2019-09-05 01:57:56 +03:00
|
|
|
// unordered_set standard header
|
|
|
|
|
|
|
|
// Copyright (c) Microsoft Corporation.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
#ifndef _UNORDERED_SET_
|
|
|
|
#define _UNORDERED_SET_
|
|
|
|
#include <yvals_core.h>
|
|
|
|
#if _STL_COMPILER_PREPROCESSOR
|
|
|
|
#include <xhash>
|
|
|
|
|
|
|
|
#if _HAS_CXX17
|
|
|
|
#include <xpolymorphic_allocator.h>
|
|
|
|
#endif // _HAS_CXX17
|
|
|
|
|
|
|
|
#pragma pack(push, _CRT_PACKING)
|
|
|
|
#pragma warning(push, _STL_WARNING_LEVEL)
|
|
|
|
#pragma warning(disable : _STL_DISABLED_WARNINGS)
|
|
|
|
_STL_DISABLE_CLANG_WARNINGS
|
|
|
|
#pragma push_macro("new")
|
|
|
|
#undef new
|
|
|
|
|
|
|
|
_STD_BEGIN
|
|
|
|
// CLASS TEMPLATE _Uset_traits
|
|
|
|
template <class _Kty, // key type (same as value type)
|
|
|
|
class _Tr, // comparator predicate type
|
|
|
|
class _Alloc, // actual allocator type (should be value allocator)
|
|
|
|
bool _Mfl> // true if multiple equivalent keys are permitted
|
|
|
|
class _Uset_traits : public _Tr { // traits required to make _Hash behave like a set
|
|
|
|
public:
|
|
|
|
using key_type = _Kty;
|
|
|
|
using value_type = _Kty;
|
|
|
|
using _Mutable_value_type = _Kty;
|
|
|
|
using key_compare = _Tr;
|
|
|
|
using allocator_type = _Alloc;
|
|
|
|
#if _HAS_CXX17
|
|
|
|
using node_type = _Node_handle<_List_node<value_type, typename allocator_traits<_Alloc>::void_pointer>, _Alloc,
|
|
|
|
_Node_handle_set_base, _Kty>;
|
|
|
|
#endif // _HAS_CXX17
|
|
|
|
|
|
|
|
static constexpr bool _Multi = _Mfl;
|
|
|
|
static constexpr bool _Standard = true;
|
|
|
|
|
|
|
|
template <class... _Args>
|
|
|
|
using _In_place_key_extractor = _In_place_key_extract_set<_Kty, _Args...>;
|
|
|
|
|
|
|
|
_Uset_traits() = default;
|
|
|
|
|
|
|
|
explicit _Uset_traits(const _Tr& _Traits) noexcept(is_nothrow_copy_constructible_v<_Tr>) : _Tr(_Traits) {}
|
|
|
|
|
2020-02-03 13:55:53 +03:00
|
|
|
using value_compare = void; // TRANSITION, remove when _Standard becomes unconditionally true
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
static const _Kty& _Kfn(const value_type& _Val) noexcept {
|
|
|
|
return _Val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int _Nonkfn(const value_type&) noexcept { // extract "non-key" from element value (for container equality)
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// CLASS TEMPLATE unordered_set
|
|
|
|
template <class _Kty, class _Hasher = hash<_Kty>, class _Keyeq = equal_to<_Kty>, class _Alloc = allocator<_Kty>>
|
|
|
|
class unordered_set : public _Hash<_Uset_traits<_Kty, _Uhash_compare<_Kty, _Hasher, _Keyeq>, _Alloc, false>> {
|
|
|
|
// hash table of key-values, unique keys
|
|
|
|
public:
|
|
|
|
static_assert(!_ENFORCE_MATCHING_ALLOCATORS || is_same_v<_Kty, typename _Alloc::value_type>,
|
|
|
|
_MISMATCHED_ALLOCATOR_MESSAGE("unordered_set<T, Hasher, Eq, Allocator>", "T"));
|
|
|
|
|
|
|
|
private:
|
|
|
|
using _Mytraits = _Uhash_compare<_Kty, _Hasher, _Keyeq>;
|
|
|
|
using _Mybase = _Hash<_Uset_traits<_Kty, _Mytraits, _Alloc, false>>;
|
|
|
|
using _Alnode = typename _Mybase::_Alnode;
|
|
|
|
using _Alnode_traits = typename _Mybase::_Alnode_traits;
|
|
|
|
using _Key_compare = typename _Mybase::_Key_compare;
|
|
|
|
|
|
|
|
public:
|
|
|
|
using hasher = _Hasher;
|
|
|
|
using key_type = _Kty;
|
2019-12-03 07:34:31 +03:00
|
|
|
using key_equal = _Keyeq;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
using value_type = typename _Mybase::value_type;
|
|
|
|
using allocator_type = typename _Mybase::allocator_type;
|
|
|
|
using size_type = typename _Mybase::size_type;
|
|
|
|
using difference_type = typename _Mybase::difference_type;
|
|
|
|
using pointer = typename _Mybase::pointer;
|
|
|
|
using const_pointer = typename _Mybase::const_pointer;
|
|
|
|
using reference = value_type&;
|
|
|
|
using const_reference = const value_type&;
|
|
|
|
using iterator = typename _Mybase::iterator;
|
|
|
|
using const_iterator = typename _Mybase::const_iterator;
|
|
|
|
|
|
|
|
using local_iterator = typename _Mybase::iterator;
|
|
|
|
using const_local_iterator = typename _Mybase::const_iterator;
|
|
|
|
|
|
|
|
#if _HAS_CXX17
|
|
|
|
using insert_return_type = _Insert_return_type<iterator, typename _Mybase::node_type>;
|
|
|
|
#endif // _HAS_CXX17
|
|
|
|
|
|
|
|
unordered_set() : _Mybase(_Key_compare(), allocator_type()) {}
|
|
|
|
|
|
|
|
explicit unordered_set(const allocator_type& _Al) : _Mybase(_Key_compare(), _Al) {}
|
|
|
|
|
|
|
|
unordered_set(const unordered_set& _Right)
|
|
|
|
: _Mybase(_Right, _Alnode_traits::select_on_container_copy_construction(_Right._Getal())) {}
|
|
|
|
|
|
|
|
unordered_set(const unordered_set& _Right, const allocator_type& _Al) : _Mybase(_Right, _Al) {}
|
|
|
|
|
|
|
|
explicit unordered_set(size_type _Buckets) : _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(size_type _Buckets, const allocator_type& _Al) : _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(size_type _Buckets, const hasher& _Hasharg) : _Mybase(_Key_compare(_Hasharg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(size_type _Buckets, const hasher& _Hasharg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_set(_Iter _First, _Iter _Last) : _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_set(_Iter _First, _Iter _Last, const allocator_type& _Al) : _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_set(_Iter _First, _Iter _Last, size_type _Buckets) : _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_set(_Iter _First, _Iter _Last, size_type _Buckets, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_set(_Iter _First, _Iter _Last, size_type _Buckets, const hasher& _Hasharg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_set(_Iter _First, _Iter _Last, size_type _Buckets, const hasher& _Hasharg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_set(_Iter _First, _Iter _Last, size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_set(_Iter _First, _Iter _Last, size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg,
|
|
|
|
const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set& operator=(const unordered_set& _Right) {
|
|
|
|
_Mybase::operator=(_Right);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(unordered_set&& _Right) : _Mybase(_STD move(_Right)) {}
|
|
|
|
|
|
|
|
unordered_set(unordered_set&& _Right, const allocator_type& _Al) : _Mybase(_STD move(_Right), _Al) {}
|
|
|
|
|
|
|
|
unordered_set& operator=(unordered_set&& _Right) noexcept(_Alnode_traits::is_always_equal::value&&
|
|
|
|
is_nothrow_move_assignable_v<_Hasher>&& is_nothrow_move_assignable_v<_Keyeq>) {
|
|
|
|
_Mybase::operator=(_STD move(_Right));
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
void swap(unordered_set& _Right) noexcept(noexcept(_Mybase::swap(_Right))) {
|
|
|
|
_Mybase::swap(_Right);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(initializer_list<value_type> _Ilist) : _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(initializer_list<value_type> _Ilist, const allocator_type& _Al) : _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(initializer_list<value_type> _Ilist, size_type _Buckets) : _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(initializer_list<value_type> _Ilist, size_type _Buckets, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(initializer_list<value_type> _Ilist, size_type _Buckets, const hasher& _Hasharg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(
|
|
|
|
initializer_list<value_type> _Ilist, size_type _Buckets, const hasher& _Hasharg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(
|
|
|
|
initializer_list<value_type> _Ilist, size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set(initializer_list<value_type> _Ilist, size_type _Buckets, const hasher& _Hasharg,
|
|
|
|
const _Keyeq& _Keyeqarg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_set& operator=(initializer_list<value_type> _Ilist) {
|
|
|
|
this->clear();
|
|
|
|
this->insert(_Ilist);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
_NODISCARD hasher hash_function() const {
|
|
|
|
return this->_Traitsobj._Mypair._Get_first();
|
|
|
|
}
|
|
|
|
|
|
|
|
_NODISCARD key_equal key_eq() const {
|
|
|
|
return this->_Traitsobj._Mypair._Myval2._Get_first();
|
|
|
|
}
|
|
|
|
|
|
|
|
using _Mybase::_Unchecked_begin;
|
|
|
|
using _Mybase::_Unchecked_end;
|
|
|
|
};
|
|
|
|
|
|
|
|
#if _HAS_CXX17
|
|
|
|
template <class _Iter, class _Hasher = hash<_Iter_value_t<_Iter>>, class _Keyeq = equal_to<_Iter_value_t<_Iter>>,
|
|
|
|
class _Alloc = allocator<_Iter_value_t<_Iter>>,
|
|
|
|
enable_if_t<
|
|
|
|
conjunction_v<_Is_iterator<_Iter>, _Is_hasher<_Hasher>, negation<_Is_allocator<_Keyeq>>, _Is_allocator<_Alloc>>,
|
|
|
|
int> = 0>
|
|
|
|
unordered_set(_Iter, _Iter, _Guide_size_type_t<_Alloc> = 0, _Hasher = _Hasher(), _Keyeq = _Keyeq(), _Alloc = _Alloc())
|
2020-03-29 04:53:15 +03:00
|
|
|
-> unordered_set<_Iter_value_t<_Iter>, _Hasher, _Keyeq, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Kty, class _Hasher = hash<_Kty>, class _Keyeq = equal_to<_Kty>, class _Alloc = allocator<_Kty>,
|
|
|
|
enable_if_t<conjunction_v<_Is_hasher<_Hasher>, negation<_Is_allocator<_Keyeq>>, _Is_allocator<_Alloc>>, int> = 0>
|
2020-03-29 04:53:15 +03:00
|
|
|
unordered_set(initializer_list<_Kty>, _Guide_size_type_t<_Alloc> = 0, _Hasher = _Hasher(), _Keyeq = _Keyeq(),
|
|
|
|
_Alloc = _Alloc()) -> unordered_set<_Kty, _Hasher, _Keyeq, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Iter, class _Alloc, enable_if_t<conjunction_v<_Is_iterator<_Iter>, _Is_allocator<_Alloc>>, int> = 0>
|
|
|
|
unordered_set(_Iter, _Iter, _Guide_size_type_t<_Alloc>, _Alloc)
|
2020-03-29 04:53:15 +03:00
|
|
|
-> unordered_set<_Iter_value_t<_Iter>, hash<_Iter_value_t<_Iter>>, equal_to<_Iter_value_t<_Iter>>, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Iter, class _Hasher, class _Alloc,
|
|
|
|
enable_if_t<conjunction_v<_Is_iterator<_Iter>, _Is_hasher<_Hasher>, _Is_allocator<_Alloc>>, int> = 0>
|
|
|
|
unordered_set(_Iter, _Iter, _Guide_size_type_t<_Alloc>, _Hasher, _Alloc)
|
2020-03-29 04:53:15 +03:00
|
|
|
-> unordered_set<_Iter_value_t<_Iter>, _Hasher, equal_to<_Iter_value_t<_Iter>>, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Kty, class _Alloc, enable_if_t<_Is_allocator<_Alloc>::value, int> = 0>
|
|
|
|
unordered_set(initializer_list<_Kty>, _Guide_size_type_t<_Alloc>, _Alloc)
|
2020-03-29 04:53:15 +03:00
|
|
|
-> unordered_set<_Kty, hash<_Kty>, equal_to<_Kty>, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Kty, class _Hasher, class _Alloc,
|
|
|
|
enable_if_t<conjunction_v<_Is_hasher<_Hasher>, _Is_allocator<_Alloc>>, int> = 0>
|
|
|
|
unordered_set(initializer_list<_Kty>, _Guide_size_type_t<_Alloc>, _Hasher, _Alloc)
|
2020-03-29 04:53:15 +03:00
|
|
|
-> unordered_set<_Kty, _Hasher, equal_to<_Kty>, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
#endif // _HAS_CXX17
|
|
|
|
|
|
|
|
template <class _Kty, class _Hasher, class _Keyeq, class _Alloc>
|
|
|
|
void swap(unordered_set<_Kty, _Hasher, _Keyeq, _Alloc>& _Left,
|
|
|
|
unordered_set<_Kty, _Hasher, _Keyeq, _Alloc>& _Right) noexcept(noexcept(_Left.swap(_Right))) {
|
|
|
|
_Left.swap(_Right);
|
|
|
|
}
|
|
|
|
|
2019-11-02 00:32:39 +03:00
|
|
|
#if _HAS_CXX20
|
|
|
|
template <class _Kty, class _Hasher, class _Keyeq, class _Alloc, class _Pr>
|
2020-03-01 01:35:24 +03:00
|
|
|
typename unordered_set<_Kty, _Hasher, _Keyeq, _Alloc>::size_type erase_if(
|
|
|
|
unordered_set<_Kty, _Hasher, _Keyeq, _Alloc>& _Cont, _Pr _Pred) {
|
|
|
|
return _Erase_nodes_if(_Cont, _Pass_fn(_Pred));
|
2019-11-02 00:32:39 +03:00
|
|
|
}
|
|
|
|
#endif // _HAS_CXX20
|
|
|
|
|
2019-09-05 01:57:56 +03:00
|
|
|
template <class _Kty, class _Hasher, class _Keyeq, class _Alloc>
|
|
|
|
_NODISCARD bool operator==(const unordered_set<_Kty, _Hasher, _Keyeq, _Alloc>& _Left,
|
|
|
|
const unordered_set<_Kty, _Hasher, _Keyeq, _Alloc>& _Right) {
|
|
|
|
return _Hash_equal(_Left, _Right);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Kty, class _Hasher, class _Keyeq, class _Alloc>
|
|
|
|
_NODISCARD bool operator!=(const unordered_set<_Kty, _Hasher, _Keyeq, _Alloc>& _Left,
|
|
|
|
const unordered_set<_Kty, _Hasher, _Keyeq, _Alloc>& _Right) {
|
|
|
|
return !(_Left == _Right);
|
|
|
|
}
|
|
|
|
|
|
|
|
// CLASS TEMPLATE unordered_multiset
|
|
|
|
template <class _Kty, class _Hasher = hash<_Kty>, class _Keyeq = equal_to<_Kty>, class _Alloc = allocator<_Kty>>
|
|
|
|
class unordered_multiset : public _Hash<_Uset_traits<_Kty, _Uhash_compare<_Kty, _Hasher, _Keyeq>, _Alloc, true>> {
|
|
|
|
// hash table of key-values, non-unique keys
|
|
|
|
public:
|
|
|
|
static_assert(!_ENFORCE_MATCHING_ALLOCATORS || is_same_v<_Kty, typename _Alloc::value_type>,
|
|
|
|
_MISMATCHED_ALLOCATOR_MESSAGE("unordered_multiset<T, Hasher, Eq, Allocator>", "T"));
|
|
|
|
|
|
|
|
private:
|
|
|
|
using _Mytraits = _Uhash_compare<_Kty, _Hasher, _Keyeq>;
|
|
|
|
using _Mybase = _Hash<_Uset_traits<_Kty, _Mytraits, _Alloc, true>>;
|
|
|
|
using _Alnode = typename _Mybase::_Alnode;
|
|
|
|
using _Alnode_traits = typename _Mybase::_Alnode_traits;
|
|
|
|
using _Key_compare = typename _Mybase::_Key_compare;
|
|
|
|
|
|
|
|
public:
|
|
|
|
using hasher = _Hasher;
|
|
|
|
using key_type = _Kty;
|
2019-12-03 07:34:31 +03:00
|
|
|
using key_equal = _Keyeq;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
using value_type = typename _Mybase::value_type;
|
|
|
|
using allocator_type = typename _Mybase::allocator_type;
|
|
|
|
using size_type = typename _Mybase::size_type;
|
|
|
|
using difference_type = typename _Mybase::difference_type;
|
|
|
|
using pointer = typename _Mybase::pointer;
|
|
|
|
using const_pointer = typename _Mybase::const_pointer;
|
|
|
|
using reference = value_type&;
|
|
|
|
using const_reference = const value_type&;
|
|
|
|
using iterator = typename _Mybase::iterator;
|
|
|
|
using const_iterator = typename _Mybase::const_iterator;
|
|
|
|
|
|
|
|
unordered_multiset() : _Mybase(_Key_compare(), allocator_type()) {}
|
|
|
|
|
|
|
|
explicit unordered_multiset(const allocator_type& _Al) : _Mybase(_Key_compare(), _Al) {}
|
|
|
|
|
|
|
|
unordered_multiset(const unordered_multiset& _Right)
|
|
|
|
: _Mybase(_Right, _Alnode_traits::select_on_container_copy_construction(_Right._Getal())) {}
|
|
|
|
|
|
|
|
unordered_multiset(const unordered_multiset& _Right, const allocator_type& _Al) : _Mybase(_Right, _Al) {}
|
|
|
|
|
|
|
|
explicit unordered_multiset(size_type _Buckets) : _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(size_type _Buckets, const allocator_type& _Al) : _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(size_type _Buckets, const hasher& _Hasharg) : _Mybase(_Key_compare(_Hasharg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(size_type _Buckets, const hasher& _Hasharg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_multiset(_Iter _First, _Iter _Last) : _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_multiset(_Iter _First, _Iter _Last, const allocator_type& _Al) : _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_multiset(_Iter _First, _Iter _Last, size_type _Buckets) : _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_multiset(_Iter _First, _Iter _Last, size_type _Buckets, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_multiset(_Iter _First, _Iter _Last, size_type _Buckets, const hasher& _Hasharg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_multiset(_Iter _First, _Iter _Last, size_type _Buckets, const hasher& _Hasharg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_multiset(_Iter _First, _Iter _Last, size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Iter>
|
|
|
|
unordered_multiset(_Iter _First, _Iter _Last, size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg,
|
|
|
|
const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_First, _Last);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset& operator=(const unordered_multiset& _Right) {
|
|
|
|
_Mybase::operator=(_Right);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(unordered_multiset&& _Right) : _Mybase(_STD move(_Right)) {}
|
|
|
|
|
|
|
|
unordered_multiset(unordered_multiset&& _Right, const allocator_type& _Al) : _Mybase(_STD move(_Right), _Al) {}
|
|
|
|
|
|
|
|
unordered_multiset& operator=(unordered_multiset&& _Right) noexcept(_Alnode_traits::is_always_equal::value&&
|
|
|
|
is_nothrow_move_assignable_v<_Hasher>&& is_nothrow_move_assignable_v<_Keyeq>) {
|
|
|
|
_Mybase::operator=(_STD move(_Right));
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
void swap(unordered_multiset& _Right) noexcept(noexcept(_Mybase::swap(_Right))) {
|
|
|
|
_Mybase::swap(_Right);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(initializer_list<value_type> _Ilist) : _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(initializer_list<value_type> _Ilist, const allocator_type& _Al) : _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(initializer_list<value_type> _Ilist, size_type _Buckets)
|
|
|
|
: _Mybase(_Key_compare(), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(initializer_list<value_type> _Ilist, size_type _Buckets, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(initializer_list<value_type> _Ilist, size_type _Buckets, const hasher& _Hasharg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(
|
|
|
|
initializer_list<value_type> _Ilist, size_type _Buckets, const hasher& _Hasharg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(
|
|
|
|
initializer_list<value_type> _Ilist, size_type _Buckets, const hasher& _Hasharg, const _Keyeq& _Keyeqarg)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), allocator_type()) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset(initializer_list<value_type> _Ilist, size_type _Buckets, const hasher& _Hasharg,
|
|
|
|
const _Keyeq& _Keyeqarg, const allocator_type& _Al)
|
|
|
|
: _Mybase(_Key_compare(_Hasharg, _Keyeqarg), _Al) {
|
|
|
|
this->rehash(_Buckets);
|
|
|
|
this->insert(_Ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
unordered_multiset& operator=(initializer_list<value_type> _Ilist) {
|
|
|
|
this->clear();
|
|
|
|
this->insert(_Ilist);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
_NODISCARD hasher hash_function() const {
|
|
|
|
return this->_Traitsobj._Mypair._Get_first();
|
|
|
|
}
|
|
|
|
|
|
|
|
_NODISCARD key_equal key_eq() const {
|
|
|
|
return this->_Traitsobj._Mypair._Myval2._Get_first();
|
|
|
|
}
|
|
|
|
|
|
|
|
using _Mybase::_Unchecked_begin;
|
|
|
|
using _Mybase::_Unchecked_end;
|
|
|
|
};
|
|
|
|
|
|
|
|
#if _HAS_CXX17
|
|
|
|
template <class _Iter, class _Hasher = hash<_Iter_value_t<_Iter>>, class _Keyeq = equal_to<_Iter_value_t<_Iter>>,
|
|
|
|
class _Alloc = allocator<_Iter_value_t<_Iter>>,
|
|
|
|
enable_if_t<
|
|
|
|
conjunction_v<_Is_iterator<_Iter>, _Is_hasher<_Hasher>, negation<_Is_allocator<_Keyeq>>, _Is_allocator<_Alloc>>,
|
|
|
|
int> = 0>
|
2020-03-29 04:53:15 +03:00
|
|
|
unordered_multiset(_Iter, _Iter, _Guide_size_type_t<_Alloc> = 0, _Hasher = _Hasher(), _Keyeq = _Keyeq(),
|
|
|
|
_Alloc = _Alloc()) -> unordered_multiset<_Iter_value_t<_Iter>, _Hasher, _Keyeq, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Kty, class _Hasher = hash<_Kty>, class _Keyeq = equal_to<_Kty>, class _Alloc = allocator<_Kty>,
|
|
|
|
enable_if_t<conjunction_v<_Is_hasher<_Hasher>, negation<_Is_allocator<_Keyeq>>, _Is_allocator<_Alloc>>, int> = 0>
|
2020-03-29 04:53:15 +03:00
|
|
|
unordered_multiset(initializer_list<_Kty>, _Guide_size_type_t<_Alloc> = 0, _Hasher = _Hasher(), _Keyeq = _Keyeq(),
|
|
|
|
_Alloc = _Alloc()) -> unordered_multiset<_Kty, _Hasher, _Keyeq, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Iter, class _Alloc, enable_if_t<conjunction_v<_Is_iterator<_Iter>, _Is_allocator<_Alloc>>, int> = 0>
|
|
|
|
unordered_multiset(_Iter, _Iter, _Guide_size_type_t<_Alloc>, _Alloc)
|
2020-03-29 04:53:15 +03:00
|
|
|
-> unordered_multiset<_Iter_value_t<_Iter>, hash<_Iter_value_t<_Iter>>, equal_to<_Iter_value_t<_Iter>>, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Iter, class _Hasher, class _Alloc,
|
|
|
|
enable_if_t<conjunction_v<_Is_iterator<_Iter>, _Is_hasher<_Hasher>, _Is_allocator<_Alloc>>, int> = 0>
|
|
|
|
unordered_multiset(_Iter, _Iter, _Guide_size_type_t<_Alloc>, _Hasher, _Alloc)
|
2020-03-29 04:53:15 +03:00
|
|
|
-> unordered_multiset<_Iter_value_t<_Iter>, _Hasher, equal_to<_Iter_value_t<_Iter>>, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Kty, class _Alloc, enable_if_t<_Is_allocator<_Alloc>::value, int> = 0>
|
|
|
|
unordered_multiset(initializer_list<_Kty>, _Guide_size_type_t<_Alloc>, _Alloc)
|
2020-03-29 04:53:15 +03:00
|
|
|
-> unordered_multiset<_Kty, hash<_Kty>, equal_to<_Kty>, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
|
|
|
|
template <class _Kty, class _Hasher, class _Alloc,
|
|
|
|
enable_if_t<conjunction_v<_Is_hasher<_Hasher>, _Is_allocator<_Alloc>>, int> = 0>
|
|
|
|
unordered_multiset(initializer_list<_Kty>, _Guide_size_type_t<_Alloc>, _Hasher, _Alloc)
|
2020-03-29 04:53:15 +03:00
|
|
|
-> unordered_multiset<_Kty, _Hasher, equal_to<_Kty>, _Alloc>;
|
2019-09-05 01:57:56 +03:00
|
|
|
#endif // _HAS_CXX17
|
|
|
|
|
|
|
|
template <class _Kty, class _Hasher, class _Keyeq, class _Alloc>
|
|
|
|
void swap(unordered_multiset<_Kty, _Hasher, _Keyeq, _Alloc>& _Left,
|
|
|
|
unordered_multiset<_Kty, _Hasher, _Keyeq, _Alloc>& _Right) noexcept(noexcept(_Left.swap(_Right))) {
|
|
|
|
_Left.swap(_Right);
|
|
|
|
}
|
|
|
|
|
2019-11-02 00:32:39 +03:00
|
|
|
#if _HAS_CXX20
|
|
|
|
template <class _Kty, class _Hasher, class _Keyeq, class _Alloc, class _Pr>
|
2020-03-01 01:35:24 +03:00
|
|
|
typename unordered_multiset<_Kty, _Hasher, _Keyeq, _Alloc>::size_type erase_if(
|
|
|
|
unordered_multiset<_Kty, _Hasher, _Keyeq, _Alloc>& _Cont, _Pr _Pred) {
|
|
|
|
return _Erase_nodes_if(_Cont, _Pass_fn(_Pred));
|
2019-11-02 00:32:39 +03:00
|
|
|
}
|
|
|
|
#endif // _HAS_CXX20
|
|
|
|
|
2019-09-05 01:57:56 +03:00
|
|
|
template <class _Kty, class _Hasher, class _Keyeq, class _Alloc>
|
|
|
|
_NODISCARD bool operator==(const unordered_multiset<_Kty, _Hasher, _Keyeq, _Alloc>& _Left,
|
|
|
|
const unordered_multiset<_Kty, _Hasher, _Keyeq, _Alloc>& _Right) {
|
|
|
|
return _Hash_equal(_Left, _Right);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Kty, class _Hasher, class _Keyeq, class _Alloc>
|
|
|
|
_NODISCARD bool operator!=(const unordered_multiset<_Kty, _Hasher, _Keyeq, _Alloc>& _Left,
|
|
|
|
const unordered_multiset<_Kty, _Hasher, _Keyeq, _Alloc>& _Right) {
|
|
|
|
return !(_Left == _Right);
|
|
|
|
}
|
|
|
|
|
|
|
|
#if _HAS_TR1_NAMESPACE
|
|
|
|
namespace _DEPRECATE_TR1_NAMESPACE tr1 {
|
|
|
|
using _STD unordered_multiset;
|
|
|
|
using _STD unordered_set;
|
|
|
|
} // namespace tr1
|
|
|
|
#endif // _HAS_TR1_NAMESPACE
|
|
|
|
|
|
|
|
#if _HAS_CXX17
|
|
|
|
namespace pmr {
|
|
|
|
template <class _Kty, class _Hasher = hash<_Kty>, class _Keyeq = equal_to<_Kty>>
|
|
|
|
using unordered_set = _STD unordered_set<_Kty, _Hasher, _Keyeq, polymorphic_allocator<_Kty>>;
|
|
|
|
|
|
|
|
template <class _Kty, class _Hasher = hash<_Kty>, class _Keyeq = equal_to<_Kty>>
|
|
|
|
using unordered_multiset = _STD unordered_multiset<_Kty, _Hasher, _Keyeq, polymorphic_allocator<_Kty>>;
|
|
|
|
} // namespace pmr
|
|
|
|
#endif // _HAS_CXX17
|
|
|
|
_STD_END
|
|
|
|
#pragma pop_macro("new")
|
|
|
|
_STL_RESTORE_CLANG_WARNINGS
|
|
|
|
#pragma warning(pop)
|
|
|
|
#pragma pack(pop)
|
|
|
|
#endif // _STL_COMPILER_PREPROCESSOR
|
|
|
|
#endif // _UNORDERED_SET_
|