{
    "": "Requires:;; If `x` is the `unordered_node_set` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.",
    ":240": "---",
    ":277": "---",
    ":286": "---",
    ":295": "A constant iterator whose value type is `value_type`.",
    ":297": "The iterator category is at least a forward iterator.",
    ":301": "---",
    ":308": "A constant iterator whose value type is `value_type`.",
    ":310": "The iterator category is at least a forward iterator.",
    ":312": "---",
    ":322": "---",
    ":344": "---",
    ":357": "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^].",
    ":360": "---",
    ":374": "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^].",
    ":377": "---",
    ":393": "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^].",
    ":395": "---",
    ":409": "---",
    ":421": "---",
    ":432": "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":434": "---",
    ":443": "---",
    ":452": "---",
    ":466": "---",
    ":484": "---",
    ":499": "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^].",
    ":501": "---",
    ":514": "---",
    ":527": "---",
    ":539": "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":541": "---",
    ":554": "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":556": "---",
    ":567": "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":569": "---",
    ":580": "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":582": "---",
    ":594": "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":596": "---",
    ":607": "---",
    ":622": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]",
    ":624": "---",
    ":641": "---",
    ":651": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]",
    ":665": "---",
    ":676": "---",
    ":687": "---",
    ":697": "---",
    ":710": "---",
    ":721": "---",
    ":732": "---",
    ":741": "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.",
    ":744": "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. +",
    ":751": "---",
    ":758": "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.",
    ":763": "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. +",
    ":770": "---",
    ":777": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.",
    ":780": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. 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.",
    ":787": "---",
    ":794": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.",
    ":797": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. 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.",
    ":804": "---",
    ":811": "Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key.",
    ":814": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. 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. + + This 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.",
    ":823": "---",
    ":831": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.",
    ":834": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. 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.",
    ":841": "---",
    ":848": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.",
    ":850": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.",
    ":853": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. 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.",
    ":860": "---",
    ":867": "Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key.",
    ":869": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.",
    ":872": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. 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. + + This 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.",
    ":881": "---",
    ":888": "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.",
    ":895": "---",
    ":902": "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.",
    ":909": "---",
    ":927": "---",
    ":937": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.",
    ":945": "---",
    ":963": "---",
    ":978": "---",
    ":992": "---",
    ":1003": "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.",
    ":1008": "---",
    ":1021": "---",
    ":1036": "---",
    ":1046": "---",
    ":1058": "---",
    ":1076": "---",
    ":1088": "---",
    ":1098": "---",
    ":1108": "---",
    ":1125": "---",
    ":1138": "---",
    ":1151": "---",
    ":1167": "---",
    ":1179": "---",
    ":1191": "---",
    ":1202": "---",
    ":1212": "---",
    ":1226": "---",
    ":1237": "Invalidates iterators and changes the order of elements.",
    ":1240": "Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.",
    ":1242": "---",
    ":1253": "Invalidates iterators and changes the order of elements.",
    ":1256": "Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.",
    ":1258": "---",
    ":1271": "---",
    ":1282": "---",
    ":1316": "Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.",
    ":1318": "---",
    ":1330": "Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.",
    ":1342": "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.",
    ":1348": "---",
    ":1392": "---",
    ":1404": "---",
    ":1416": "---"
}