{ "": "Requires:;; If `x` is the `unordered_map` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.", ":280": "---", ":327": "The iterator category is at least a forward iterator.", ":331": "---", ":340": "The iterator category is at least a forward iterator.", ":342": "---", ":353": "---", ":364": "---", ":374": "---", ":396": "---", ":410": "Postconditions:;; `size() == 0` Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":413": "---", ":428": "Postconditions:;; `size() == 0` Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":431": "---", ":447": "Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":449": "---", ":461": "Requires:;; `value_type` is copy constructible", ":463": "---", ":476": "---", ":487": "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":489": "---", ":498": "---", ":507": "---", ":520": "---", ":535": "Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":537": "---", ":550": "---", ":563": "---", ":575": "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":577": "---", ":590": "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":592": "---", ":603": "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":605": "---", ":616": "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":618": "---", ":630": "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":632": "---", ":643": "---", ":658": "Requires:;; `value_type` is copy constructible", ":660": "---", ":676": "---", ":690": "begin", ":699": "---", ":701": "end", ":710": "---", ":712": "cbegin", ":720": "---", ":722": "cend", ":730": "---", ":743": "---", ":754": "---", ":765": "---", ":774": "Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent key.", ":788": "---", ":795": "Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent key.", ":811": "---", ":818": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.", ":830": "---", ":837": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.", ":849": "---", ":858": "Only participates in overload resolution if `std::is_constructible::value` is `true`.", ":865": "---", ":873": "`hint` is a suggestion to where the element should be inserted.", ":885": "---", ":892": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.", ":894": "`hint` is a suggestion to where the element should be inserted.", ":906": "---", ":916": "Only participates in overload resolution if `std::is_constructible::value` is `true`.", ":918": "`hint` is a suggestion to where the element should be inserted.", ":928": "---", ":935": "Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.", ":944": "---", ":951": "Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.", ":960": "---", ":972": "Inserts a new element into the container if there is no existing element with key `k` contained within it.", ":974": "If there is an existing element with key `k` this function does nothing.", ":986": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...))", ":991": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...)) ```", ":998": "Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.", ":1000": "Pointers and references to elements are never invalidated.", ":1002": "The `template` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type. --", ":1005": "---", ":1017": "Inserts a new element into the container if there is no existing element with key `k` contained within it.", ":1019": "If there is an existing element with key `k` this function does nothing.", ":1021": "`hint` is a suggestion to where the element should be inserted.", ":1031": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...))", ":1036": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...)) ```", ":1045": "Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.", ":1047": "Pointers and references to elements are never invalidated.", ":1049": "The `template` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type. --", ":1052": "---", ":1064": "Inserts a new element into the container or updates an existing one by assigning to the contained value.", ":1066": "If there is an element with key `k`, then it is updated by assigning `std::forward(obj)`.", ":1068": "If there is no such element, it is added to the container as: ```c++", ":1071": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(obj)))", ":1076": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(obj))) ```", ":1092": "---", ":1104": "Inserts a new element into the container or updates an existing one by assigning to the contained value.", ":1106": "If there is an element with key `k`, then it is updated by assigning `std::forward(obj)`.", ":1108": "If there is no such element, it is added to the container as: ```c++", ":1111": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(obj)))", ":1116": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(obj))) ```", ":1121": "`hint` is a suggestion to where the element should be inserted.", ":1134": "---", ":1147": "---", ":1164": "---", ":1171": "If `nh` is empty, has no effect.", ":1173": "Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.", ":1189": "---", ":1196": "If `nh` is empty, has no effect.", ":1198": "Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.", ":1202": "`hint` is a suggestion to where the element should be inserted.", ":1220": "---", ":1229": "Erase the element pointed to by `position`.", ":1236": "---", ":1251": "---", ":1267": "---", ":1274": "Erase the element pointed to by `position`.", ":1277": "Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. + + In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. Notes:;; This method was implemented because returning an iterator to the next element from erase was expensive, but the container has been redesigned so that is no longer the case. So this method is now deprecated.", ":1282": "---", ":1289": "Erase the element pointed to by `position`.", ":1292": "Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. + + In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. Notes:;; This method was implemented because returning an iterator to the next element from erase was expensive, but the container has been redesigned so that is no longer the case. So this method is now deprecated.", ":1297": "---", ":1309": "If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.", ":1315": "---", ":1328": "---", ":1363": "---", ":1372": "---", ":1382": "---", ":1392": "---", ":1419": "---", ":1432": "---", ":1445": "---", ":1461": "---", ":1480": "---", ":1495": "---", ":1507": "---", ":1517": "---", ":1528": "---", ":1541": "---", ":1543": "begin", ":1554": "---", ":1556": "end", ":1566": "---", ":1568": "cbegin", ":1577": "---", ":1579": "cend", ":1588": "---", ":1600": "---", ":1611": "---", ":1621": "---", ":1633": "Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.", ":1636": "Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.", ":1638": "---", ":1649": "Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.", ":1652": "Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.", ":1711": "Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.", ":1713": "---", ":1725": "Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.", ":1737": "If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.", ":1744": "---", ":1790": "---", ":1806": "---", ":1818": "---" }