{ "": "Requires:;; If `x` is the `unordered_node_map` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.", ":286": "---", ":327": "---", ":336": "---", ":347": "The iterator category is at least a forward iterator.", ":351": "---", ":360": "The iterator category is at least a forward iterator.", ":362": "---", ":372": "---", ":394": "---", ":407": "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^].", ":410": "---", ":424": "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^].", ":427": "---", ":443": "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^].", ":445": "---", ":456": "---", ":468": "---", ":479": "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":481": "---", ":490": "---", ":499": "---", ":513": "---", ":531": "---", ":546": "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^].", ":548": "---", ":561": "---", ":574": "---", ":586": "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":588": "---", ":601": "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":603": "---", ":614": "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":616": "---", ":627": "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":629": "---", ":641": "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].", ":643": "---", ":654": "---", ":669": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]", ":671": "---", ":688": "---", ":698": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]", ":712": "---", ":723": "---", ":734": "---", ":744": "---", ":757": "---", ":768": "---", ":779": "---", ":788": "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.", ":791": "Requires:;; `value_type` is constructible from `args`. Returns:;; The `bool` component of the return type is `true` if an insert took place. + + If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load. + + If `args...` is of the form `k,v`, it delays constructing the whole object until it is certain that an element should be inserted, using only the `k` argument to check. This optimization happens when `key_type` is move constructible or when the `k` argument is a `key_type`.", ":800": "---", ":807": "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.", ":812": "Requires:;; `value_type` is constructible from `args`. Returns:;; The `bool` component of the return type is `true` if an insert took place. + + If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load. + + If `args...` is of the form `k,v`, it delays constructing the whole object until it is certain that an element should be inserted, using only the `k` argument to check. This optimization happens when `key_type` is move constructible or when the `k` argument is a `key_type`.", ":821": "---", ":829": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.", ":841": "---", ":849": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.", ":861": "---", ":870": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.", ":882": "---", ":890": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.", ":892": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.", ":904": "---", ":911": "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.", ":918": "---", ":925": "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.", ":932": "---", ":950": "---", ":960": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.", ":968": "---", ":980": "Inserts a new element into the container if there is no existing element with key `k` contained within it.", ":982": "If there is an existing element with key `k` this function does nothing.", ":995": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...))", ":1000": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...)) ```", ":1007": "Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load.", ":1009": "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.", ":1011": "--", ":1013": "---", ":1025": "Inserts a new element into the container if there is no existing element with key `k` contained within it.", ":1027": "If there is an existing element with key `k` this function does nothing.", ":1040": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...))", ":1045": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...)) ```", ":1052": "Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load.", ":1054": "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.", ":1056": "--", ":1058": "---", ":1070": "Inserts a new element into the container or updates an existing one by assigning to the contained value.", ":1072": "If there is an element with key `k`, then it is updated by assigning `std::forward(obj)`.", ":1074": "If there is no such element, it is added to the container as: ```c++", ":1077": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(obj)))", ":1082": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(obj))) ```", ":1096": "---", ":1108": "Inserts a new element into the container or updates an existing one by assigning to the contained value.", ":1110": "If there is an element with key `k`, then it is updated by assigning `std::forward(obj)`.", ":1112": "If there is no such element, it is added to the container as: ```c++", ":1115": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(obj)))", ":1120": "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(obj))) ```", ":1125": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.", ":1134": "---", ":1153": "---", ":1168": "---", ":1182": "---", ":1193": "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.", ":1198": "---", ":1211": "---", ":1226": "---", ":1236": "---", ":1248": "---", ":1266": "---", ":1278": "---", ":1288": "---", ":1298": "---", ":1315": "---", ":1328": "---", ":1341": "---", ":1357": "---", ":1374": "---", ":1389": "---", ":1401": "---", ":1413": "---", ":1424": "---", ":1434": "---", ":1448": "---", ":1459": "Invalidates iterators and changes the order of elements.", ":1462": "Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.", ":1464": "---", ":1475": "Invalidates iterators and changes the order of elements.", ":1478": "Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.", ":1480": "---", ":1493": "---", ":1504": "---", ":1563": "Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.", ":1565": "---", ":1577": "Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.", ":1589": "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.", ":1595": "---", ":1641": "---", ":1655": "---", ":1667": "---" }