It should be in the bit manipulation extension which is not finished yet

They are in the XBitmanip Extension spec draft from a few days ago

Overflow easy

oo controlling rip?

Better learn c++

NO

if I have a set<int> s; and it contains 3 elements {1,2,3} how can I take the value of 2?

Not possible direct

to access an element at nth index u need to create an iterator pointing to starting position and keep on  increment the iterator till nth element is reached

to access an element at nth index u need to create an iterator pointing to starting position and keep on  increment the iterator till nth element is reached

._. that seems too overkill

what is the type of s?

NOO

operator + is overloaded on standard iterators

operator + is overloaded on standard iterators

code it plz

set<int>

what is the compiler error?

D:\CodeBlocks\h\main.cpp|33|error: no match for 'operator+' (operand types are 'std::set<int>::iterator {aka std::_Rb_tree_const_iterator<int>}' and 'int')|

have you included the correct library?

I did #include <bits/stdc++.h>

well... its c++ soooo

what?

Time to overload +

Overloading is disgustingly convenient

this includes WAYYY to many things

maxi

looks like set iterators ACTUALLY don't have an operator+

Yes, how should it? Set has a Bidirectional Iterator, which allows to move back and forth. You would need a randomAcessIterator to have rhe + operator defined.

A randomAcessIterator needs it's + operator to be of O(1). This cannot work using a set

can't bidirectional iterators have a + operator aswell?

if I have a set<int> s; and it contains 3 elements {1,2,3} how can I take the value of 2?

Why do you want to do that? Additionally a set has no "sequence" so what should "take the value" of 2 do?

isn't set ordered?

Sorted, but still no "sequence" (in terms of this is the first, this is the second element)

what does it mean for a set to be sorted but without having a sequence?