22 Containers library [containers]

X​::​mapped_­type (map and multimap only)

compile time

X​::​value_­type (set and multiset only)

Preconditions: value_­type is Cpp17Erasable from X

compile time

X​::​value_­type (map and multimap only)

Preconditions: value_­type is Cpp17Erasable from X

compile time

Preconditions: key_­compare is Cpp17CopyConstructible.

compile time

a binary predicate type

is the same as key_­compare for set and multiset; is an ordering relation on pairs induced by the first component (i.e., Key) for map and multimap.

compile time

A specialization of a node-handle class template, such that the public nested types are the same types as the corresponding types in X.

see [container.node]

compile time

Effects:  Constructs an empty container.

Uses a copy of c as a comparison object.

constant

Preconditions: key_­compare meets the Cpp17DefaultConstructible requirements.

Effects:  Constructs an empty container.

Uses Compare() as a comparison object

constant

Preconditions: value_­type is Cpp17EmplaceConstructible into X from *i.

Effects:  Constructs an empty container and inserts elements from the range [i, j) into it; uses c as a comparison object.

$N\log N$ in general, where N has the value distance(i, j); linear if [i, j) is sorted with value_­comp()

Preconditions: key_­compare meets the Cpp17DefaultConstructible requirements.

value_­type is Cpp17EmplaceConstructible into X from *i.

Effects:  Same as above, but uses Compare() as a comparison object.

same as above

same as X(il.begin(), il.end())

same as X(il.begin(), il.end())

same as X(il.begin(), il.end(), c)

same as X(il.begin(), il.end(), c)

Preconditions: value_­type is Cpp17CopyInsertable into X and Cpp17CopyAssignable.

Effects: Assigns the range [il.begin(), il.end()) into a.

All existing elements of a are either assigned to or destroyed.

$N\log N$ in general, where N has the value il.size() + a.size(); linear if [il.begin(), il.end()) is sorted with value_­comp()

Returns: the comparison object out of which b was constructed.

constant

Returns: an object of value_­compare constructed out of the comparison object

constant

Preconditions: value_­type is Cpp17EmplaceConstructible into X from args.

Effects:  Inserts a value_­type object t constructed with std​::​forward<​Args​>(​args)... if and only if there is no element in the container with key equivalent to the key of t.

The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of t.

logarithmic

Preconditions: value_­type is Cpp17EmplaceConstructible into X from args.

Effects:  Inserts a value_­type object t constructed with std​::​forward<​Args​>(​args)... and returns the iterator pointing to the newly inserted element.

If a range containing elements equivalent to t exists in a_­eq, t is inserted at the end of that range.

logarithmic

Effects: Equivalent to a.emplace( std​::​forward<​Args​>(​args)...).

Return value is an iterator pointing to the element with the key equivalent to the newly inserted element.

The element is inserted as close as possible to the position just prior to p.

logarithmic in general, but amortized constant if the element is inserted right before p

Preconditions: If t is a non-const rvalue, value_­type is Cpp17MoveInsertable into X; otherwise, value_­type is Cpp17CopyInsertable into X.

Effects:  Inserts t if and only if there is no element in the container with key equivalent to the key of t.

The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of t.

logarithmic

Preconditions: If t is a non-const rvalue, value_­type is Cpp17MoveInsertable into X; otherwise, value_­type is Cpp17CopyInsertable into X.

Effects:  Inserts t and returns the iterator pointing to the newly inserted element.

If a range containing elements equivalent to t exists in a_­eq, t is inserted at the end of that range.

logarithmic

Preconditions: If t is a non-const rvalue, value_­type is Cpp17MoveInsertable into X; otherwise, value_­type is Cpp17CopyInsertable into X.

Effects:  Inserts t if and only if there is no element with key equivalent to the key of t in containers with unique keys; always inserts t in containers with equivalent keys.

Always returns the iterator pointing to the element with key equivalent to the key of t.

t is inserted as close as possible to the position just prior to p.

logarithmic in general, but amortized constant if t is inserted right before p.

Preconditions: value_­type is Cpp17EmplaceConstructible into X from *i.

Neither i nor j are iterators into a.

Effects: Inserts each element from the range [i, j) if and only if there is no element with key equivalent to the key of that element in containers with unique keys; always inserts that element in containers with equivalent keys.

$N\log (\text{a.size()}+N)$, where N has the value distance(i, j)

Effects: Equivalent to a.insert(il.begin(), il.end())

Preconditions: nh is empty or a_­uniq.get_­allocator() == nh.get_­allocator().

Effects: If nh is empty, has no effect.

Otherwise, inserts the element owned by nh if and only if there is no element in the container with a key equivalent to nh.key().

Postconditions: If nh is empty, inserted is false, position is end(), and node is empty.

Otherwise if the insertion took place, inserted is true, position points to the inserted element, and node is empty; if the insertion failed, inserted is false, node has the previous value of nh, and position points to an element with a key equivalent to nh.key().

logarithmic

Preconditions: nh is empty or a_­eq.get_­allocator() == nh.get_­allocator().

Effects: If nh is empty, has no effect and returns a_­eq.end().

Otherwise, inserts the element owned by nh and returns an iterator pointing to the newly inserted element.

If a range containing elements with keys equivalent to nh.key() exists in a_­eq, the element is inserted at the end of that range.

Postconditions: nh is empty.

logarithmic

Preconditions: nh is empty or a.get_­allocator() == nh.get_­allocator().

Effects: If nh is empty, has no effect and returns a.end().

Otherwise, inserts the element owned by nh if and only if there is no element with key equivalent to nh.key() in containers with unique keys; always inserts the element owned by nh in containers with equivalent keys.

Always returns the iterator pointing to the element with key equivalent to nh.key().

The element is inserted as close as possible to the position just prior to p.

Postconditions: nh is empty if insertion succeeds, unchanged if insertion fails.

logarithmic in general, but amortized constant if the element is inserted right before p.

Effects: Removes the first element in the container with key equivalent to k.

Returns: A node_­type owning the element if found, otherwise an empty node_­type.

Effects: Removes the element pointed to by q.

Returns: A node_­type owning that element.

amortized constant

Preconditions: a.get_­allocator() == a2.get_­allocator().

Effects: Attempts to extract each element in a2 and insert it into a using the comparison object of a.

In containers with unique keys, if there is an element in a with key equivalent to the key of an element from a2, then that element is not extracted from a2.

Postconditions: Pointers and references to the transferred elements of a2 refer to those same elements but as members of a.

Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into a, not into a2.

Throws: Nothing unless the comparison object throws.

$N\log \left(\text{a.size()+}N\right)$, where N has the value a2.size().

Effects: Erases all elements in the container with key equivalent to k.

Returns: The number of erased elements.

Effects: Erases the element pointed to by q.

Returns: An iterator pointing to the element immediately following q prior to the element being erased.

If no such element exists, returns a.end().

amortized constant

Effects: Erases the element pointed to by r.

Returns: An iterator pointing to the element immediately following r prior to the element being erased.

If no such element exists, returns a.end().

amortized constant

Effects: Erases all the elements in the range [q1, q2).

Returns: An iterator pointing to the element pointed to by q2 prior to any elements being erased.

If no such element exists, a.end() is returned.

$\log \left(\text{a.size()}\right)+N$, where N has the value distance(q1, q2).

Effects: Equivalent to a.erase(a.begin(), a.end()).

Postconditions: a.empty() is true.

linear in a.size().

iterator; const_­iterator for constant b.

Returns: An iterator pointing to an element with the key equivalent to k, or b.end() if such an element is not found.

logarithmic

iterator; const_­iterator for constant a_­tran.

Returns: An iterator pointing to an element with key r such that !c(r, ke) && !c(ke, r), or a_­tran.end() if such an element is not found.

logarithmic

Returns: The number of elements with key equivalent to k.

Returns: The number of elements with key r such that !c(r, ke) && !c(ke, r)

Effects: Equivalent to: return b.find(k) != b.end();

logarithmic

Effects: Equivalent to: return a_­tran.find(ke) != a_­tran.end();

logarithmic

iterator; const_­iterator for constant b.

Returns: An iterator pointing to the first element with key not less than k, or b.end() if such an element is not found.

logarithmic

iterator; const_­iterator for constant a_­tran.

Returns: An iterator pointing to the first element with key r such that !c(r, kl), or a_­tran.end() if such an element is not found.

logarithmic

iterator; const_­iterator for constant b.

Returns: An iterator pointing to the first element with key greater than k, or b.end() if such an element is not found.

logarithmic

iterator; const_­iterator for constant a_­tran.

Returns: An iterator pointing to the first element with key r such that c(ku, r), or a_­tran.end() if such an element is not found.

logarithmic

pair<​iterator, iterator>; pair<​const_­iterator, const_­iterator> for constant b.

Effects: Equivalent to: return make_­pair(b.lower_­bound(k), b.upper_­bound(k));

logarithmic

pair<​iterator, iterator>; pair<​const_­iterator, const_­iterator> for constant a_­tran.

Effects: Equivalent to: return make_­pair(
a_­tran.lower_­bound(ke), a_­tran.upper_­bound(ke));

logarithmic