{
    "": "Requires:;; If `x` is the `unordered_flat_set` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.",
    ":235": "---",
    ":273": "---",
    ":282": "---",
    ":291": "A constant iterator whose value type is `value_type`.",
    ":293": "The iterator category is at least a forward iterator.",
    ":297": "---",
    ":304": "A constant iterator whose value type is `value_type`.",
    ":306": "The iterator category is at least a forward iterator.",
    ":319": "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^].",
    ":322": "---",
    ":336": "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^].",
    ":339": "---",
    ":355": "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^].",
    ":357": "---",
    ":371": "---",
    ":383": "---",
    ":394": "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":396": "---",
    ":405": "---",
    ":414": "---",
    ":428": "---",
    ":446": "---",
    ":461": "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^].",
    ":463": "---",
    ":476": "---",
    ":489": "---",
    ":501": "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":503": "---",
    ":516": "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":518": "---",
    ":529": "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":531": "---",
    ":542": "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":544": "---",
    ":556": "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].",
    ":558": "---",
    ":569": "---",
    ":584": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]",
    ":586": "---",
    ":603": "---",
    ":613": "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]",
    ":627": "---",
    ":638": "---",
    ":649": "---",
    ":659": "---",
    ":672": "---",
    ":683": "---",
    ":694": "---",
    ":703": "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.",
    ":706": "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, pointers and references, but only if the insert causes the load to be greater than the maximum load. +",
    ":713": "---",
    ":720": "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.",
    ":725": "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, pointers and references, but only if the insert causes the load to be greater than the maximum load. +",
    ":732": "---",
    ":739": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.",
    ":742": "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, pointers and references, but only if the insert causes the load to be greater than the maximum load.",
    ":749": "---",
    ":756": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.",
    ":759": "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, pointers and references, but only if the insert causes the load to be greater than the maximum load.",
    ":766": "---",
    ":773": "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.",
    ":776": "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, pointers and references, 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.",
    ":785": "---",
    ":793": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.",
    ":796": "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, pointers and references, but only if the insert causes the load to be greater than the maximum load.",
    ":803": "---",
    ":810": "Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.",
    ":812": "`hint` is a suggestion to where the element should be inserted. This implementation ignores it.",
    ":815": "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, pointers and references, but only if the insert causes the load to be greater than the maximum load.",
    ":822": "---",
    ":829": "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.",
    ":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/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, pointers and references, 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.",
    ":843": "---",
    ":850": "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.",
    ":857": "---",
    ":864": "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.",
    ":871": "---",
    ":889": "---",
    ":904": "---",
    ":918": "---",
    ":929": "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.",
    ":934": "---",
    ":944": "---",
    ":956": "---",
    ":968": "---",
    ":980": "---",
    ":990": "---",
    ":1000": "---",
    ":1017": "---",
    ":1030": "---",
    ":1043": "---",
    ":1059": "---",
    ":1071": "---",
    ":1083": "---",
    ":1094": "---",
    ":1104": "---",
    ":1118": "---",
    ":1129": "Invalidates iterators, pointers and references, and changes the order of elements.",
    ":1132": "Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.",
    ":1134": "---",
    ":1145": "Invalidates iterators, pointers and references, and changes the order of elements.",
    ":1148": "Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.",
    ":1150": "---",
    ":1163": "---",
    ":1174": "---",
    ":1208": "Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.",
    ":1210": "---",
    ":1222": "Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.",
    ":1234": "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.",
    ":1240": "---",
    ":1284": "---",
    ":1295": "---",
    ":1307": "---"
}