22 Containers library [containers]

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

compile time

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

Preconditions: value_­type is Cpp17Erasable from X

compile time

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

Preconditions: value_­type is Cpp17Erasable from X

compile time

Preconditions: Hash is a unary function object type such that the expression hf(k) has type size_­t.

compile time

Preconditions: Pred meets the Cpp17CopyConstructible requirements.

Pred is a binary predicate that takes two arguments of type Key.

Pred is an equivalence relation.

compile time

An iterator type whose category, value type, difference type, and pointer and reference types are the same as X​::​iterator's.

A local_­iterator object may be used to iterate through a single bucket, but may not be used to iterate across buckets.

compile time

An iterator type whose category, value type, difference type, and pointer and reference types are the same as X​::​const_­iterator's.

A const_­local_­iterator object may be used to iterate through a single bucket, but may not be used to iterate across buckets.

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 with at least n buckets, using hf as the hash function and eq as the key equality predicate.

Preconditions: key_­equal meets the Cpp17DefaultConstructible requirements.

Effects:  Constructs an empty container with at least n buckets, using hf as the hash function and key_­equal() as the key equality predicate.

Preconditions: hasher and key_­equal meet the Cpp17DefaultConstructible requirements.

Effects:  Constructs an empty container with at least n buckets, using hasher() as the hash function and key_­equal() as the key equality predicate.

Preconditions: hasher and key_­equal meet the Cpp17DefaultConstructible requirements.

Effects:  Constructs an empty container with an unspecified number of buckets, using hasher() as the hash function and key_­equal() as the key equality predicate.

constant

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

Effects:  Constructs an empty container with at least n buckets, using hf as the hash function and eq as the key equality predicate, and inserts elements from [i, j) into it.

Average case $O\left(N\right)$ (N is distance(i, j)), worst case $O\left(N^2\right)$

Preconditions: key_­equal meets the Cpp17DefaultConstructible requirements.

value_­type is Cpp17EmplaceConstructible into X from *i.

Effects:  Constructs an empty container with at least n buckets, using hf as the hash function and key_­equal() as the key equality predicate, and inserts elements from [i, j) into it.

Average case $O\left(N\right)$ (N is distance(i, j)), worst case $O\left(N^2\right)$

Preconditions: hasher and key_­equal meet the Cpp17DefaultConstructible requirements.

value_­type is Cpp17EmplaceConstructible into X from *i.

Effects:  Constructs an empty container with at least n buckets, using hasher() as the hash function and key_­equal() as the key equality predicate, and inserts elements from [i, j) into it.

Average case $O\left(N\right)$ (N is distance(i, j)), worst case $O\left(N^2\right)$

Preconditions: hasher and key_­equal meet the Cpp17DefaultConstructible requirements.

value_­type is Cpp17EmplaceConstructible into X from *i.

Effects:  Constructs an empty container with an unspecified number of buckets, using hasher() as the hash function and key_­equal() as the key equality predicate, and inserts elements from [i, j) into it.

Average case $O\left(N\right)$ (N is distance(i, j)), worst case $O\left(N^2\right)$

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

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

Same as X(il.begin(), il.end(), n).

Same as X(il.begin(), il.end(), n).

Same as X(il.begin(), il.end(), n, hf).

Same as X(il.begin(), il.end(), n, hf).

Same as X(il.begin(), il.end(), n, hf, eq).

Same as X(il.begin(), il.end(), n, hf, eq).

Copy constructor.

In addition to the requirements of Table 73, copies the hash function, predicate, and maximum load factor.

Average case linear in b.size(), worst case quadratic.

Copy assignment operator.

In addition to the requirements of Table 73, copies the hash function, predicate, and maximum load factor.

Average case linear in b.size(), worst case quadratic.

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.

Same as a = X(il).

Returns: b's hash function.

constant

Returns: b's key equality predicate.

constant

a_­uniq. emplace(args)

pair<iterator, bool>

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.

Average case $O\left(1\right)$, worst case $O\left(\text{a\_uniq.}\text{size()}\right)$.

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.

Average case $O\left(1\right)$, worst case $O\left(\text{a\_eq.}\text{size()}\right)$.

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

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 const_­iterator p is a hint pointing to where the search should start.

Implementations are permitted to ignore the hint.

Average case $O\left(1\right)$, worst case $O\left(\text{a.}\text{size()}\right)$.

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 indicates whether the insertion takes place, and the iterator component points to the element with key equivalent to the key of t.

Average case $O\left(1\right)$, worst case $O\left(\text{a\_uniq.}\text{size()}\right)$.

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 an iterator pointing to the newly inserted element.

Average case $O\left(1\right)$, worst case $O\left(\text{a\_eq.}\text{size()}\right)$.

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

Effects: Equivalent to a.insert(t).

Return value is an iterator pointing to the element with the key equivalent to that of t.

The iterator p is a hint pointing to where the search should start.

Implementations are permitted to ignore the hint.

Average case $O\left(1\right)$, worst case $O\left(\text{a.size()}\right)$.

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

Neither i nor j are iterators into a.

Effects: Equivalent to a.insert(t) for each element in [i,j).

Average case $O\left(N\right)$, where N is distance(i, j), worst case $O\left(N\right(\text{a.size()}+1\left)\right)$.

Same as a.insert(il.begin(), il.end()).

Same as 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().

Average case $O\left(1\right)$, worst case $O\left(\text{a\_uniq.}\text{size()}\right)$.

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.

Postconditions: nh is empty.

Average case $O\left(1\right)$, worst case $O\left(\text{a\_eq.}\text{size()}\right)$.

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 iterator q is a hint pointing to where the search should start.

Implementations are permitted to ignore the hint.

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

Average case $O\left(1\right)$, worst case $O\left(\text{a.size()}\right)$.

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

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

Average case $O\left(1\right)$, worst case $O\left(\text{a.size()}\right)$.

Effects: Removes the element pointed to by q.

Returns: A node_­type owning that element.

Average case $O\left(1\right)$, worst case $O\left(\text{a.size()}\right)$.

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

Attempts to extract each element in a2 and insert it into a using the hash function and key equality predicate 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 and all iterators referring to a will be invalidated, but iterators to elements remaining in a2 will remain valid.

Average case $O\left(N\right)$, where N is a2.size(), worst case $O\left(N\text{*a.size()}\text{+}N\right)$.

Effects: Erases all elements with key equivalent to k.

Returns: The number of elements erased.

Average case $O\left(\text{a.count(k)}\right)$, worst case $O\left(\text{a.size()}\right)$.

Effects: Erases the element pointed to by q.

Returns: The iterator immediately following q prior to the erasure.

Average case $O\left(1\right)$, worst case $O\left(\text{a.size()}\right)$.

Effects: Erases the element pointed to by r.

Returns: The iterator immediately following r prior to the erasure.

Average case $O\left(1\right)$, worst case $O\left(\text{a.size()}\right)$.

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

Returns: The iterator immediately following the erased elements prior to the erasure.

Average case linear in distance(q1, q2), worst case $O\left(\text{a.size()}\right)$.

Effects: Erases all elements in the container.

Postconditions: a.empty() is true

Linear in a.size().

iterator;
const_­iterator for const b.

Returns: An iterator pointing to an element with key equivalent to k, or b.end() if no such element exists.

Average case $O\left(1\right)$, worst case $O\left(\text{b.size()}\right)$.

iterator;
const_­iterator for const a_­tran.

Returns: An iterator pointing to an element with key equivalent to ke, or a_­tran.end() if no such element exists.

Average case $O\left(1\right)$, worst case $O\left(\text{a\_tran.}\text{size()}\right)$.

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

Average case $O\left(\text{b.count(k)}\right)$, worst case $O\left(\text{b.size()}\right)$.

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

Average case $O\left(\text{a\_tran.}\text{count(ke)}\right)$, worst case $O\left(\text{a\_tran.}\text{size()}\right)$.

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

Average case $O\left(1\right)$, worst case $O\left(\text{b.size()}\right)$.

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

Average case $O\left(1\right)$, worst case $O\left(\text{a\_tran.}\text{size()}\right)$.

pair<iterator, iterator>;
pair<const_­iterator, const_­iterator> for const b.

Returns: A range containing all elements with keys equivalent to k.

Returns make_­pair(b.end(), b.end()) if no such elements exist.

Average case $O\left(\text{b.count(k)}\right)$, worst case $O\left(\text{b.size()}\right)$.

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

Returns: A range containing all elements with keys equivalent to ke.

Returns make_­pair(a_­tran.end(), a_­tran.end()) if no such elements exist.

Average case $O\left(\text{a\_tran.}\text{count(ke)}\right)$, worst case $O\left(\text{a\_tran.}\text{size()}\right)$.

Returns: The number of buckets that b contains.

Constant

Returns: An upper bound on the number of buckets that b can ever contain.

Constant

Preconditions: b.bucket_­count() > 0.

Returns: The index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

Postconditions: The return value shall be in the range [0, b.bucket_­count()).

Constant

Preconditions: n shall be in the range [0, b.bucket_­count()).

Returns: The number of elements in the ${\text{n}}^{\text{th}}$ bucket.

local_­iterator;
const_­local_­iterator for const b.

Preconditions: n is in the range [0, b.bucket_­count()).

Returns: An iterator referring to the first element in the bucket.

If the bucket is empty, then b.begin(n) == b.end(n).

Constant

local_­iterator;
const_­local_­iterator for const b.

Preconditions: n is in the range [0, b.bucket_­count()).

Returns: An iterator which is the past-the-end value for the bucket.

Constant

Preconditions: n shall be in the range [0, b.bucket_­count()).

Returns: An iterator referring to the first element in the bucket.

If the bucket is empty, then b.cbegin(n) == b.cend(n).

Constant

Preconditions: n is in the range [0, b.bucket_­count()).

Returns: An iterator which is the past-the-end value for the bucket.

Constant

Returns: The average number of elements per bucket.

Constant

Returns: A positive number that the container attempts to keep the load factor less than or equal to.

The container automatically increases the number of buckets as necessary to keep the load factor below this number.

Constant

Preconditions: z is positive.

May change the container's maximum load factor, using z as a hint.

Constant

Postconditions: a.bucket_­count() >= a.size() / a.max_­load_­factor() and a.bucket_­count() >= n.

Average case linear in a.size(), worst case quadratic.

Same as a.rehash(ceil(n / a.max_­load_­factor())).

Average case linear in a.size(), worst case quadratic.