Showing content from https://timsong-cpp.github.io/cppwp/n4140/associative.reqmts below:
[associative.reqmts]
Expression Return type Assertion/note Complexity pre-/post-condition X::key_type Key compile time mapped_type (map and multimap only) T compile time X::value_type (set and multiset only) Key Requires: value_type is Erasable from X compile time X::value_type (map and multimap only) pair<const Key, T> Requires: value_type is Erasable from X compile time X::key_compare Compare defaults to less<key_type> compile time X::value_compare 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 X(c)
X a(c); Requires: key_compare is CopyConstructible.
Effects: Constructs an empty container. Uses a copy of c as a comparison object. constant X()
X a; Requires: key_compare is DefaultConstructible.
Effects: Constructs an empty container. Uses Compare() as a comparison object constant X(i,j,c)
X a(i,j,c); Requires: key_compare is CopyConstructible. value_type is EmplaceConstructible 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 (N has the value distance(i, j)); linear if [i, j) is sorted with value_comp() X(i,j) X a(i,j); Requires: key_compare is DefaultConstructible. value_type is EmplaceConstructible into X from *i.
Effects: Same as above, but uses Compare() as a comparison object same as above X(il); Same as X(il.begin(), il.end()). Same as X(il.begin(), il.end()). X(il,c); Same as X(il.begin(), il.end(), c). Same as X(il.begin(), il.end(), c). a = il X& Requires: value_type is CopyInsertable into X and CopyAssignable.
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(). a.key_comp() X::key_compare returns the comparison object out of which a was constructed. constant a.value_comp() X::value_compare returns an object of value_compare constructed out of the comparison object constant a_uniq. emplace(args) pair<iterator, bool> Requires: value_type shall be EmplaceConstructible 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 a_eq. emplace(args) iterator Requires: value_type shall be EmplaceConstructible 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 a.emplace_hint(p, args) iterator 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 a_uniq. insert(t) pair<iterator, bool> Requires: If t is a non-const rvalue expression, value_type shall be MoveInsertable into X; otherwise, value_type shall be CopyInsertable 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 a_eq.insert(t) iterator Requires: If t is a non-const rvalue expression, value_type shall be MoveInsertable into X; otherwise, value_type shall be CopyInsertable 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 a.insert(
p, t) iterator Requires: If t is a non-const rvalue expression, value_type shall be MoveInsertable into X; otherwise, value_type shall be CopyInsertable 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. a.insert(
i, j) void Requires: value_type shall be EmplaceConstructible into X from *i.
pre: i, j are not iterators into a. 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. Nlog (a.size() + N) (N has the value distance(i, j) a.insert(il) void Equivalent to a.insert(il.begin(), il.end()). a.erase(k) size_type erases all elements in the container with key equivalent to k. returns the number of erased elements. log (a.size()) + a.count(k) a.erase(q) iterator 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 a.erase(
q1, q2) iterator 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 (a.size()) + N where N has the value distance(q1, q2). a.clear() void a.erase(a.begin(),a.end())
post: a.empty() returns true linear in a.size(). a.find(k) iterator; const_iterator for constant a. returns an iterator pointing to an element with the key equivalent to k, or a.end() if such an element is not found logarithmic a_tran.
find(ke) 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 a.count(k) size_type returns the number of elements with key equivalent to k log (a.size()) + a.count(k) a_tran.
count(ke) size_type returns the number of elements with key r such that !c(r, ke) && !c(ke, r) log (a_tran.size()) + a_tran.count(ke) a.lower_bound(k) iterator; const_iterator for constant a. returns an iterator pointing to the first element with key not less than k, or a.end() if such an element is not found. logarithmic a_tran.
lower_bound(kl) 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 a.upper_bound(k) iterator; const_iterator for constant a. returns an iterator pointing to the first element with key greater than k, or a.end() if such an element is not found. logarithmic a_tran.
upper_bound(ku) 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 a.equal_range(k) pair<iterator, iterator>; pair<const_iterator, const_iterator> for constant a. equivalent to make_pair(a.lower_bound(k), a.upper_bound(k)). logarithmic a_tran.
equal_range(ke) pair<iterator, iterator>; pair<const_iterator, const_iterator> for constant a_tran. equivalent to make_pair(
a_tran.lower_bound(ke), a_tran.upper_bound(ke)). logarithmic
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4