AssociativeContainer

X::key_type

Key

Key is Destructible

?

compile time

X::key_compare

Compare

?

?

compile time

X::value_compare

a type satisfying BinaryPredicate

key_compare for std::set and std::multiset; an ordering relation over Key for std::map and std::multimap

?

compile time

X(c), X a(c);

?

key_compare is CopyConstructible

Construct an empty container using a copy of c as key_comp

constant

X(), X a;

?

key_compare is CopyConstructible

Construct an empty container using a Compare() as key_comp

constant

X(i, j, c), X a(i, j, c);

?

key_compare is CopyConstructible and value_type is EmplaceConstructible into X from *i

Constructs an empty container using a copy of c as key_comp and inserts all elements from the range [i; j)

generally N log N, or N if [i, j) is sorted (where N is std::distance(i, j))

X(i, j), X a(i, j);

?

key_compare is CopyConstructible and value_type is EmplaceConstructible into X from *i

Constructs an empty container using a Compare() as key_comp and inserts all elements from the range [i; j)

generally N log N, or N if [i, j) is sorted according to value_comp() (where N is std::distance(i, j))

X(il);

?

Equivalent to X(il.begin(), il.end());

Equivalent to X(il.begin(), il.end());

a = il

X&

T is CopyInsertable into X and also CopyAssignable

Assign the range [il.begin(), il.end()) into a. Elements of a that were not assigned to are destroyed

generally N log N, or N if [il.begin(), il.end()) is sorted according to value_comp() (where N is il.size() + a.size())

a.key_comp()

X::key_compare

?

The comparison object with which a was constructed is returned.

constant

a.value_comp()

X::value_compare

?

An object of type X::value_compare constructed out of the comparison object is returned.

constant

multiset

collection of keys, sorted by keys (class template)

map

collection of key-value pairs, sorted by keys, keys are unique (class template)

multimap

collection of key-value pairs, sorted by keys (class template)