concurrent_unordered_set.h
Go to the documentation of this file.
/*
Copyright (c) 2005-2020 Intel Corporation
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
/* Container implementations in this header are based on PPL implementations
provided by Microsoft. */
#ifndef __TBB_concurrent_unordered_set_H
#define __TBB_concurrent_unordered_set_H
#define __TBB_concurrent_unordered_set_H_include_area
#include "internal/_warning_suppress_enable_notice.h"
#include "internal/_concurrent_unordered_impl.h"
namespace tbb
{
namespace interface5 {
// Template class for hash set traits
template<typename Key, typename Hash_compare, typename Allocator, bool Allow_multimapping>
class concurrent_unordered_set_traits
{
protected:
typedef Key value_type;
typedef Key key_type;
typedef Hash_compare hash_compare;
typedef typename tbb::internal::allocator_rebind<Allocator, value_type>::type allocator_type;
#if __TBB_UNORDERED_NODE_HANDLE_PRESENT
typedef tbb::internal::node_handle<key_type, key_type,
typename internal::split_ordered_list<key_type, allocator_type>::node,
allocator_type> node_type;
#endif // __TBB_UNORDERED_NODE_HANDLE_PRESENT
enum { allow_multimapping = Allow_multimapping };
concurrent_unordered_set_traits() : my_hash_compare() {}
concurrent_unordered_set_traits(const hash_compare& hc) : my_hash_compare(hc) {}
static const Key& get_key(const value_type& value) {
return value;
}
hash_compare my_hash_compare; // the comparator predicate for keys
};
template<typename Key, typename Hasher, typename Key_equality, typename Allocator>
class concurrent_unordered_multiset;
template <typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key> >
class concurrent_unordered_set : public internal::concurrent_unordered_base< concurrent_unordered_set_traits<Key, internal::hash_compare<Key, Hasher, Key_equality>, Allocator, false> >
{
// Base type definitions
typedef internal::hash_compare<Key, Hasher, Key_equality> hash_compare;
typedef concurrent_unordered_set_traits<Key, hash_compare, Allocator, false> traits_type;
typedef internal::concurrent_unordered_base< traits_type > base_type;
#if __TBB_EXTRA_DEBUG
public:
#endif
using traits_type::allow_multimapping;
public:
using base_type::insert;
// Type definitions
typedef Key key_type;
typedef typename base_type::value_type value_type;
typedef Key mapped_type;
typedef Hasher hasher;
typedef Key_equality key_equal;
typedef hash_compare key_compare;
typedef typename base_type::allocator_type allocator_type;
typedef typename base_type::pointer pointer;
typedef typename base_type::const_pointer const_pointer;
typedef typename base_type::reference reference;
typedef typename base_type::const_reference const_reference;
typedef typename base_type::size_type size_type;
typedef typename base_type::difference_type difference_type;
typedef typename base_type::iterator iterator;
typedef typename base_type::const_iterator const_iterator;
typedef typename base_type::iterator local_iterator;
typedef typename base_type::const_iterator const_local_iterator;
#if __TBB_UNORDERED_NODE_HANDLE_PRESENT
typedef typename base_type::node_type node_type;
#endif /*__TBB_UNORDERED_NODE_HANDLE_PRESENT*/
// Construction/destruction/copying
explicit concurrent_unordered_set(size_type n_of_buckets = base_type::initial_bucket_number, const hasher& a_hasher = hasher(),
const key_equal& a_keyeq = key_equal(), const allocator_type& a = allocator_type())
: base_type(n_of_buckets, key_compare(a_hasher, a_keyeq), a)
{}
concurrent_unordered_set(size_type n_of_buckets, const allocator_type& a)
: base_type(n_of_buckets, key_compare(hasher(), key_equal()), a)
{}
concurrent_unordered_set(size_type n_of_buckets, const hasher& a_hasher, const allocator_type& a)
: base_type(n_of_buckets, key_compare(a_hasher, key_equal()), a)
{}
explicit concurrent_unordered_set(const Allocator& a) : base_type(base_type::initial_bucket_number, key_compare(), a)
{}
template <typename Iterator>
concurrent_unordered_set(Iterator first, Iterator last, size_type n_of_buckets = base_type::initial_bucket_number,
const hasher& a_hasher = hasher(), const key_equal& a_keyeq = key_equal(), const allocator_type& a = allocator_type())
: base_type(n_of_buckets, key_compare(a_hasher, a_keyeq), a)
{
insert(first, last);
}
template <typename Iterator>
concurrent_unordered_set(Iterator first, Iterator last, size_type n_of_buckets, const allocator_type& a)
: base_type(n_of_buckets, key_compare(hasher(), key_equal()), a)
{
insert(first, last);
}
template <typename Iterator>
concurrent_unordered_set(Iterator first, Iterator last, size_type n_of_buckets, const hasher& a_hasher, const allocator_type& a)
: base_type(n_of_buckets, key_compare(a_hasher, key_equal()), a)
{
insert(first, last);
}
#if __TBB_INITIALIZER_LISTS_PRESENT
concurrent_unordered_set(std::initializer_list<value_type> il, size_type n_of_buckets = base_type::initial_bucket_number, const hasher& a_hasher = hasher(),
const key_equal& a_keyeq = key_equal(), const allocator_type& a = allocator_type())
: base_type(n_of_buckets, key_compare(a_hasher, a_keyeq), a)
{
insert(il.begin(),il.end());
}
concurrent_unordered_set(std::initializer_list<value_type> il, size_type n_of_buckets, const allocator_type& a)
: base_type(n_of_buckets, key_compare(hasher(), key_equal()), a)
{
insert(il.begin(), il.end());
}
concurrent_unordered_set(std::initializer_list<value_type> il, size_type n_of_buckets, const hasher& a_hasher, const allocator_type& a)
: base_type(n_of_buckets, key_compare(a_hasher, key_equal()), a)
{
insert(il.begin(), il.end());
}
#endif //# __TBB_INITIALIZER_LISTS_PRESENT
#if __TBB_CPP11_RVALUE_REF_PRESENT && !__TBB_IMPLICIT_MOVE_PRESENT
concurrent_unordered_set(const concurrent_unordered_set& table)
: base_type(table)
{}
concurrent_unordered_set& operator=(const concurrent_unordered_set& table)
{
return static_cast<concurrent_unordered_set&>(base_type::operator=(table));
}
concurrent_unordered_set(concurrent_unordered_set&& table)
: base_type(std::move(table))
{}
concurrent_unordered_set& operator=(concurrent_unordered_set&& table)
{
return static_cast<concurrent_unordered_set&>(base_type::operator=(std::move(table)));
}
#endif //__TBB_CPP11_RVALUE_REF_PRESENT && !__TBB_IMPLICIT_MOVE_PRESENT
#if __TBB_CPP11_RVALUE_REF_PRESENT
concurrent_unordered_set(concurrent_unordered_set&& table, const Allocator& a)
: base_type(std::move(table), a)
{}
#endif /*__TBB_CPP11_RVALUE_REF_PRESENT*/
#if __TBB_UNORDERED_NODE_HANDLE_PRESENT
template<typename Hash, typename Equality>
void merge(concurrent_unordered_set<Key, Hash, Equality, Allocator>& source)
{ this->internal_merge(source); }
template<typename Hash, typename Equality>
void merge(concurrent_unordered_set<Key, Hash, Equality, Allocator>&& source)
{ this->internal_merge(source); }
template<typename Hash, typename Equality>
void merge(concurrent_unordered_multiset<Key, Hash, Equality, Allocator>& source)
{ this->internal_merge(source); }
template<typename Hash, typename Equality>
void merge(concurrent_unordered_multiset<Key, Hash, Equality, Allocator>&& source)
{ this->internal_merge(source); }
#endif //__TBB_UNORDERED_NODE_HANDLE_PRESENT
concurrent_unordered_set(const concurrent_unordered_set& table, const Allocator& a)
: base_type(table, a)
{}
};
#if __TBB_CPP17_DEDUCTION_GUIDES_PRESENT
namespace internal {
using namespace tbb::internal;
template <template<typename...> typename Set, typename T, typename... Args>
using cu_set_t = Set <
T,
std::conditional_t< (sizeof...(Args)>0) && !is_allocator_v< pack_element_t<0, Args...> >,
pack_element_t<0, Args...>, tbb_hash<T> >,
std::conditional_t< (sizeof...(Args)>1) && !is_allocator_v< pack_element_t<1, Args...> >,
pack_element_t<1, Args...>, std::equal_to<T> >,
std::conditional_t< (sizeof...(Args)>0) && is_allocator_v< pack_element_t<sizeof...(Args)-1, Args...> >,
pack_element_t<sizeof...(Args)-1, Args...>, tbb_allocator<T> >
>;
}
// Deduction guide for the constructor from two iterators
template<typename I>
concurrent_unordered_set(I, I)
-> internal::cu_set_t<concurrent_unordered_set, internal::iterator_value_t<I>>;
// Deduction guide for the constructor from two iterators and hasher/equality/allocator
template<typename I, typename... Args>
concurrent_unordered_set(I, I, size_t, Args...)
-> internal::cu_set_t<concurrent_unordered_set, internal::iterator_value_t<I>, Args...>;
// Deduction guide for the constructor from an initializer_list
template<typename T>
concurrent_unordered_set(std::initializer_list<T>)
-> internal::cu_set_t<concurrent_unordered_set, T>;
// Deduction guide for the constructor from an initializer_list and hasher/equality/allocator
template<typename T, typename... Args>
concurrent_unordered_set(std::initializer_list<T>, size_t, Args...)
-> internal::cu_set_t<concurrent_unordered_set, T, Args...>;
#endif /*__TBB_CPP17_DEDUCTION_GUIDES_PRESENT */
template <typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>,
typename Allocator = tbb::tbb_allocator<Key> >
class concurrent_unordered_multiset :
public internal::concurrent_unordered_base< concurrent_unordered_set_traits<Key,
internal::hash_compare<Key, Hasher, Key_equality>, Allocator, true> >
{
// Base type definitions
typedef internal::hash_compare<Key, Hasher, Key_equality> hash_compare;
typedef concurrent_unordered_set_traits<Key, hash_compare, Allocator, true> traits_type;
typedef internal::concurrent_unordered_base< traits_type > base_type;
#if __TBB_EXTRA_DEBUG
public:
#endif
using traits_type::allow_multimapping;
public:
using base_type::insert;
// Type definitions
typedef Key key_type;
typedef typename base_type::value_type value_type;
typedef Key mapped_type;
typedef Hasher hasher;
typedef Key_equality key_equal;
typedef hash_compare key_compare;
typedef typename base_type::allocator_type allocator_type;
typedef typename base_type::pointer pointer;
typedef typename base_type::const_pointer const_pointer;
typedef typename base_type::reference reference;
typedef typename base_type::const_reference const_reference;
typedef typename base_type::size_type size_type;
typedef typename base_type::difference_type difference_type;
typedef typename base_type::iterator iterator;
typedef typename base_type::const_iterator const_iterator;
typedef typename base_type::iterator local_iterator;
typedef typename base_type::const_iterator const_local_iterator;
#if __TBB_UNORDERED_NODE_HANDLE_PRESENT
typedef typename base_type::node_type node_type;
#endif // __TBB_UNORDERED_NODE_HANDLE_PRESENT
// Construction/destruction/copying
explicit concurrent_unordered_multiset(size_type n_of_buckets = base_type::initial_bucket_number,
const hasher& a_hasher = hasher(), const key_equal& a_keyeq = key_equal(),
const allocator_type& a = allocator_type())
: base_type(n_of_buckets, key_compare(a_hasher, a_keyeq), a)
{}
concurrent_unordered_multiset(size_type n_of_buckets, const allocator_type& a)
: base_type(n_of_buckets, key_compare(hasher(), key_equal()), a)
{}
concurrent_unordered_multiset(size_type n_of_buckets, const hasher& a_hasher,
const allocator_type& a)
: base_type(n_of_buckets, key_compare(a_hasher, key_equal()), a)
{}
explicit concurrent_unordered_multiset(const Allocator& a) : base_type(base_type::initial_bucket_number, key_compare(), a)
{}
template <typename Iterator>
concurrent_unordered_multiset(Iterator first, Iterator last, size_type n_of_buckets = base_type::initial_bucket_number,
const hasher& a_hasher = hasher(), const key_equal& a_keyeq = key_equal(),
const allocator_type& a = allocator_type())
: base_type(n_of_buckets, key_compare(a_hasher, a_keyeq), a)
{
insert(first, last);
}
template <typename Iterator>
concurrent_unordered_multiset(Iterator first, Iterator last, size_type n_of_buckets, const allocator_type& a)
: base_type(n_of_buckets, key_compare(hasher(), key_equal()), a)
{
insert(first, last);
}
template <typename Iterator>
concurrent_unordered_multiset(Iterator first, Iterator last, size_type n_of_buckets, const hasher& a_hasher,
const allocator_type& a)
: base_type(n_of_buckets, key_compare(a_hasher, key_equal()), a)
{
insert(first, last);
}
#if __TBB_INITIALIZER_LISTS_PRESENT
concurrent_unordered_multiset(std::initializer_list<value_type> il, size_type n_of_buckets = base_type::initial_bucket_number,
const hasher& a_hasher = hasher(), const key_equal& a_keyeq = key_equal(), const allocator_type& a = allocator_type())
: base_type(n_of_buckets, key_compare(a_hasher, a_keyeq), a)
{
insert(il.begin(),il.end());
}
concurrent_unordered_multiset(std::initializer_list<value_type> il, size_type n_of_buckets, const allocator_type& a)
: base_type(n_of_buckets, key_compare(hasher(), key_equal()), a)
{
insert(il.begin(), il.end());
}
concurrent_unordered_multiset(std::initializer_list<value_type> il, size_type n_of_buckets, const hasher& a_hasher,
const allocator_type& a)
: base_type(n_of_buckets, key_compare(a_hasher, key_equal()), a)
{
insert(il.begin(), il.end());
}
#endif //# __TBB_INITIALIZER_LISTS_PRESENT
#if __TBB_CPP11_RVALUE_REF_PRESENT && !__TBB_IMPLICIT_MOVE_PRESENT
concurrent_unordered_multiset(const concurrent_unordered_multiset& table)
: base_type(table)
{}
concurrent_unordered_multiset& operator=(const concurrent_unordered_multiset& table)
{
return static_cast<concurrent_unordered_multiset&>(base_type::operator=(table));
}
concurrent_unordered_multiset(concurrent_unordered_multiset&& table)
: base_type(std::move(table))
{}
concurrent_unordered_multiset& operator=(concurrent_unordered_multiset&& table)
{
return static_cast<concurrent_unordered_multiset&>(base_type::operator=(std::move(table)));
}
#endif //__TBB_CPP11_RVALUE_REF_PRESENT && !__TBB_IMPLICIT_MOVE_PRESENT
#if __TBB_CPP11_RVALUE_REF_PRESENT
concurrent_unordered_multiset(concurrent_unordered_multiset&& table, const Allocator& a)
: base_type(std::move(table), a)
{
}
#endif /*__TBB_CPP11_RVALUE_REF_PRESENT*/
#if __TBB_UNORDERED_NODE_HANDLE_PRESENT
template<typename Hash, typename Equality>
void merge(concurrent_unordered_set<Key, Hash, Equality, Allocator>& source)
{ this->internal_merge(source); }
template<typename Hash, typename Equality>
void merge(concurrent_unordered_set<Key, Hash, Equality, Allocator>&& source)
{ this->internal_merge(source); }
template<typename Hash, typename Equality>
void merge(concurrent_unordered_multiset<Key, Hash, Equality, Allocator>& source)
{ this->internal_merge(source); }
template<typename Hash, typename Equality>
void merge(concurrent_unordered_multiset<Key, Hash, Equality, Allocator>&& source)
{ this->internal_merge(source); }
#endif //__TBB_UNORDERED_NODE_HANDLE_PRESENT
concurrent_unordered_multiset(const concurrent_unordered_multiset& table, const Allocator& a)
: base_type(table, a)
{}
};
#if __TBB_CPP17_DEDUCTION_GUIDES_PRESENT
// Deduction guide for the constructor from two iterators
template<typename I>
concurrent_unordered_multiset(I, I)
-> internal::cu_set_t<concurrent_unordered_multiset, internal::iterator_value_t<I>>;
// Deduction guide for the constructor from two iterators and hasher/equality/allocator
template<typename I, typename... Args>
concurrent_unordered_multiset(I, I, size_t, Args...)
-> internal::cu_set_t<concurrent_unordered_multiset, internal::iterator_value_t<I>, Args...>;
// Deduction guide for the constructor from an initializer_list
template<typename T>
concurrent_unordered_multiset(std::initializer_list<T>)
-> internal::cu_set_t<concurrent_unordered_multiset, T>;
// Deduction guide for the constructor from an initializer_list and hasher/equality/allocator
template<typename T, typename... Args>
concurrent_unordered_multiset(std::initializer_list<T>, size_t, Args...)
-> internal::cu_set_t<concurrent_unordered_multiset, T, Args...>;
#endif /* __TBB_CPP17_DEDUCTION_GUIDES_PRESENT */
} // namespace interface5
using interface5::concurrent_unordered_set;
using interface5::concurrent_unordered_multiset;
} // namespace tbb
#include "internal/_warning_suppress_disable_notice.h"
#undef __TBB_concurrent_unordered_set_H_include_area
#endif// __TBB_concurrent_unordered_set_H
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(size_type n_of_buckets, const hasher &a_hasher, const allocator_type &a)
Definition: concurrent_unordered_set.h:307
tbb::interface5::concurrent_unordered_set::merge
void merge(concurrent_unordered_multiset< Key, Hash, Equality, Allocator > &source)
Definition: concurrent_unordered_set.h:200
tbb::interface5::concurrent_unordered_set_traits::my_hash_compare
hash_compare my_hash_compare
Definition: concurrent_unordered_set.h:57
tbb::interface5::concurrent_unordered_set_traits::value_type
Key value_type
Definition: concurrent_unordered_set.h:38
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(std::initializer_list< value_type > il, size_type n_of_buckets, const allocator_type &a)
Definition: concurrent_unordered_set.h:150
internal
Definition: _flow_graph_async_msg_impl.h:24
tbb::interface5::concurrent_unordered_multiset::const_iterator
base_type::const_iterator const_iterator
Definition: concurrent_unordered_set.h:289
tbb::interface5::concurrent_unordered_multiset::const_local_iterator
base_type::const_iterator const_local_iterator
Definition: concurrent_unordered_set.h:291
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(size_type n_of_buckets, const allocator_type &a)
Definition: concurrent_unordered_set.h:303
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(size_type n_of_buckets, const allocator_type &a)
Definition: concurrent_unordered_set.h:108
tbb::interface5::concurrent_unordered_set::allocator_type
base_type::allocator_type allocator_type
Definition: concurrent_unordered_set.h:85
tbb::interface5::concurrent_unordered_multiset::difference_type
base_type::difference_type difference_type
Definition: concurrent_unordered_set.h:286
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
Definition: concurrent_unordered_set.h:103
tbb::interface5::internal::concurrent_unordered_base::const_reference
const typedef allocator_type::value_type & const_reference
Definition: _concurrent_unordered_impl.h:724
tbb::interface5::concurrent_unordered_multiset::merge
void merge(concurrent_unordered_set< Key, Hash, Equality, Allocator > &source)
Definition: concurrent_unordered_set.h:393
tbb::interface5::internal::split_ordered_list::node
Definition: _concurrent_unordered_impl.h:228
tbb::interface5::concurrent_unordered_set::hash_compare
internal::hash_compare< Key, Hasher, Key_equality > hash_compare
Definition: concurrent_unordered_set.h:67
tbb::interface5::concurrent_unordered_multiset::key_equal
Key_equality key_equal
Definition: concurrent_unordered_set.h:276
tbb::interface5::internal::concurrent_unordered_base::const_pointer
tbb::internal::allocator_traits< allocator_type >::const_pointer const_pointer
Definition: _concurrent_unordered_impl.h:721
tbb::tbb_allocator
Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5.
Definition: tbb_allocator.h:58
tbb::interface5::internal::concurrent_unordered_base::insert
std::pair< iterator, bool > insert(const value_type &value)
Definition: _concurrent_unordered_impl.h:1068
tbb::interface5::concurrent_unordered_multiset::hasher
Hasher hasher
Definition: concurrent_unordered_set.h:275
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(const Allocator &a)
Definition: concurrent_unordered_set.h:312
tbb::interface5::concurrent_unordered_multiset::merge
void merge(concurrent_unordered_multiset< Key, Hash, Equality, Allocator > &&source)
Definition: concurrent_unordered_set.h:405
tbb::interface5::concurrent_unordered_set_traits::concurrent_unordered_set_traits
concurrent_unordered_set_traits()
Definition: concurrent_unordered_set.h:50
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(Iterator first, Iterator last, size_type n_of_buckets, const allocator_type &a)
Definition: concurrent_unordered_set.h:325
tbb::interface5::concurrent_unordered_multiset::const_pointer
base_type::const_pointer const_pointer
Definition: concurrent_unordered_set.h:281
tbb::interface5::concurrent_unordered_set::pointer
base_type::pointer pointer
Definition: concurrent_unordered_set.h:86
tbb
The graph class.
Definition: serial/tbb/parallel_for.h:46
tbb::interface5::concurrent_unordered_set::key_equal
Key_equality key_equal
Definition: concurrent_unordered_set.h:82
tbb::interface5::internal::hash_compare
Definition: _tbb_hash_compare_impl.h:29
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(std::initializer_list< value_type > il, size_type n_of_buckets, const hasher &a_hasher, const allocator_type &a)
Definition: concurrent_unordered_set.h:354
tbb::interface5::concurrent_unordered_set::merge
void merge(concurrent_unordered_multiset< Key, Hash, Equality, Allocator > &&source)
Definition: concurrent_unordered_set.h:204
tbb::interface5::concurrent_unordered_set::const_iterator
base_type::const_iterator const_iterator
Definition: concurrent_unordered_set.h:95
tbb::interface5::concurrent_unordered_set_traits
Definition: concurrent_unordered_set.h:35
tbb::interface5::concurrent_unordered_multiset::traits_type
concurrent_unordered_set_traits< Key, hash_compare, Allocator, true > traits_type
Definition: concurrent_unordered_set.h:262
tbb::interface5::concurrent_unordered_multiset::size_type
base_type::size_type size_type
Definition: concurrent_unordered_set.h:285
tbb::interface5::concurrent_unordered_set::key_type
Key key_type
Definition: concurrent_unordered_set.h:78
tbb::interface5::concurrent_unordered_multiset::base_type
internal::concurrent_unordered_base< traits_type > base_type
Definition: concurrent_unordered_set.h:263
tbb::interface5::concurrent_unordered_multiset::merge
void merge(concurrent_unordered_multiset< Key, Hash, Equality, Allocator > &source)
Definition: concurrent_unordered_set.h:401
tbb::interface5::concurrent_unordered_set::traits_type
concurrent_unordered_set_traits< Key, hash_compare, Allocator, false > traits_type
Definition: concurrent_unordered_set.h:68
tbb::interface5::concurrent_unordered_set_traits::allow_multimapping
Definition: concurrent_unordered_set.h:48
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(Iterator first, Iterator last, size_type n_of_buckets, const hasher &a_hasher, const allocator_type &a)
Definition: concurrent_unordered_set.h:135
tbb::interface5::concurrent_unordered_set::node_type
base_type::node_type node_type
Definition: concurrent_unordered_set.h:99
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(concurrent_unordered_set &&table, const Allocator &a)
Definition: concurrent_unordered_set.h:185
tbb::interface5::internal::concurrent_unordered_base::initial_bucket_number
static const size_type initial_bucket_number
Definition: _concurrent_unordered_impl.h:742
tbb::interface5::concurrent_unordered_multiset::mapped_type
Key mapped_type
Definition: concurrent_unordered_set.h:274
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(const Allocator &a)
Definition: concurrent_unordered_set.h:116
tbb::interface5::concurrent_unordered_set::reference
base_type::reference reference
Definition: concurrent_unordered_set.h:88
tbb::interface5::concurrent_unordered_multiset::merge
void merge(concurrent_unordered_set< Key, Hash, Equality, Allocator > &&source)
Definition: concurrent_unordered_set.h:397
tbb::internal::allocator_rebind::type
allocator_traits< Alloc >::template rebind_alloc< T >::other type
Definition: _allocator_traits.h:149
tbb::interface5::concurrent_unordered_set_traits::concurrent_unordered_set_traits
concurrent_unordered_set_traits(const hash_compare &hc)
Definition: concurrent_unordered_set.h:51
tbb::interface5::concurrent_unordered_multiset::allocator_type
base_type::allocator_type allocator_type
Definition: concurrent_unordered_set.h:279
tbb::interface5::concurrent_unordered_set::difference_type
base_type::difference_type difference_type
Definition: concurrent_unordered_set.h:92
tbb::interface5::internal::concurrent_unordered_base::value_type
Traits::value_type value_type
Definition: _concurrent_unordered_impl.h:711
tbb::move
void move(tbb_thread &t1, tbb_thread &t2)
Definition: tbb_thread.h:319
tbb::interface5::concurrent_unordered_multiset::key_compare
hash_compare key_compare
Definition: concurrent_unordered_set.h:277
tbb::interface5::internal::concurrent_unordered_base::difference_type
tbb::internal::allocator_traits< allocator_type >::difference_type difference_type
Definition: _concurrent_unordered_impl.h:719
tbb::interface5::concurrent_unordered_multiset::local_iterator
base_type::iterator local_iterator
Definition: concurrent_unordered_set.h:290
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(size_type n_of_buckets, const hasher &a_hasher, const allocator_type &a)
Definition: concurrent_unordered_set.h:112
tbb::interface5::internal::concurrent_unordered_base::reference
allocator_type::value_type & reference
Definition: _concurrent_unordered_impl.h:723
tbb::interface5::internal::concurrent_unordered_base::allocator_type
Traits::allocator_type allocator_type
Definition: _concurrent_unordered_impl.h:714
tbb::interface5::concurrent_unordered_set::mapped_type
Key mapped_type
Definition: concurrent_unordered_set.h:80
tbb::interface5::concurrent_unordered_multiset::hash_compare
internal::hash_compare< Key, Hasher, Key_equality > hash_compare
Definition: concurrent_unordered_set.h:261
tbb::interface5::concurrent_unordered_set::size_type
base_type::size_type size_type
Definition: concurrent_unordered_set.h:91
tbb::interface5::concurrent_unordered_set
Definition: concurrent_unordered_set.h:64
tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, false > >::operator=
concurrent_unordered_base & operator=(const concurrent_unordered_base &right)
Definition: _concurrent_unordered_impl.h:844
tbb::interface5::concurrent_unordered_set::key_compare
hash_compare key_compare
Definition: concurrent_unordered_set.h:83
tbb::internal::node_handle
Definition: _node_handle_impl.h:104
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(Iterator first, Iterator last, size_type n_of_buckets, const hasher &a_hasher, const allocator_type &a)
Definition: concurrent_unordered_set.h:332
tbb::interface5::concurrent_unordered_set::merge
void merge(concurrent_unordered_set< Key, Hash, Equality, Allocator > &source)
Definition: concurrent_unordered_set.h:192
_warning_suppress_disable_notice.h
tbb::interface5::concurrent_unordered_set::local_iterator
base_type::iterator local_iterator
Definition: concurrent_unordered_set.h:96
tbb::internal::first
auto first(Container &c) -> decltype(begin(c))
Definition: _range_iterator.h:34
tbb::interface5::concurrent_unordered_set::const_pointer
base_type::const_pointer const_pointer
Definition: concurrent_unordered_set.h:87
tbb::interface5::concurrent_unordered_set_traits::key_type
Key key_type
Definition: concurrent_unordered_set.h:39
tbb::interface5::internal::concurrent_unordered_base::pointer
tbb::internal::allocator_traits< allocator_type >::pointer pointer
Definition: _concurrent_unordered_impl.h:720
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(std::initializer_list< value_type > il, size_type n_of_buckets, const hasher &a_hasher, const allocator_type &a)
Definition: concurrent_unordered_set.h:156
tbb::interface5::internal::solist_iterator
Definition: _concurrent_unordered_impl.h:129
tbb::interface5::concurrent_unordered_multiset
Definition: concurrent_unordered_set.h:61
tbb::interface5::internal::concurrent_unordered_base::node_type
Traits::node_type node_type
Definition: _concurrent_unordered_impl.h:736
tbb::interface5::concurrent_unordered_set_traits::allocator_type
tbb::internal::allocator_rebind< Allocator, value_type >::type allocator_type
Definition: concurrent_unordered_set.h:41
tbb::internal::allocator_type
Class for determining type of std::allocator<T>::value_type.
Definition: tbb_stddef.h:471
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(const concurrent_unordered_set &table, const Allocator &a)
Definition: concurrent_unordered_set.h:209
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
Definition: concurrent_unordered_set.h:120
tbb::interface5::internal::concurrent_unordered_base
Definition: _concurrent_unordered_impl.h:63
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
Definition: concurrent_unordered_set.h:297
tbb::interface5::concurrent_unordered_set_traits::hash_compare
Hash_compare hash_compare
Definition: concurrent_unordered_set.h:40
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(const concurrent_unordered_multiset &table, const Allocator &a)
Definition: concurrent_unordered_set.h:410
tbb::interface5::concurrent_unordered_set::base_type
internal::concurrent_unordered_base< traits_type > base_type
Definition: concurrent_unordered_set.h:69
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(concurrent_unordered_multiset &&table, const Allocator &a)
Definition: concurrent_unordered_set.h:385
tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, false > >::internal_merge
void internal_merge(SourceType &source)
Definition: _concurrent_unordered_impl.h:892
value
void const char const char int ITT_FORMAT __itt_group_sync x void const char ITT_FORMAT __itt_group_sync s void ITT_FORMAT __itt_group_sync p void ITT_FORMAT p void ITT_FORMAT p no args __itt_suppress_mode_t unsigned int void size_t ITT_FORMAT d void ITT_FORMAT p void ITT_FORMAT p __itt_model_site __itt_model_site_instance ITT_FORMAT p __itt_model_task __itt_model_task_instance ITT_FORMAT p void ITT_FORMAT p void ITT_FORMAT p void size_t ITT_FORMAT d void ITT_FORMAT p const wchar_t ITT_FORMAT s const char ITT_FORMAT s const char ITT_FORMAT s const char ITT_FORMAT s no args void ITT_FORMAT p size_t ITT_FORMAT d no args const wchar_t const wchar_t ITT_FORMAT s __itt_heap_function void size_t int ITT_FORMAT d __itt_heap_function void ITT_FORMAT p __itt_heap_function void void size_t int ITT_FORMAT d no args no args unsigned int ITT_FORMAT u const __itt_domain __itt_id ITT_FORMAT lu const __itt_domain __itt_id __itt_id __itt_string_handle ITT_FORMAT p const __itt_domain __itt_id ITT_FORMAT p const __itt_domain __itt_id __itt_timestamp __itt_timestamp ITT_FORMAT lu const __itt_domain __itt_id __itt_id __itt_string_handle ITT_FORMAT p const __itt_domain ITT_FORMAT p const __itt_domain __itt_string_handle unsigned long long value
Definition: ittnotify_static.h:192
tbb::interface5::concurrent_unordered_set_traits::get_key
static const Key & get_key(const value_type &value)
Definition: concurrent_unordered_set.h:53
_concurrent_unordered_impl.h
tbb::interface5::concurrent_unordered_multiset::iterator
base_type::iterator iterator
Definition: concurrent_unordered_set.h:288
tbb::interface5::concurrent_unordered_set::const_reference
base_type::const_reference const_reference
Definition: concurrent_unordered_set.h:89
tbb::internal
Identifiers declared inside namespace internal should never be used directly by client code.
Definition: atomic.h:65
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(std::initializer_list< value_type > il, size_type n_of_buckets, const allocator_type &a)
Definition: concurrent_unordered_set.h:348
tbb::internal::last
auto last(Container &c) -> decltype(begin(c))
Definition: _range_iterator.h:40
_warning_suppress_enable_notice.h
tbb::interface5::concurrent_unordered_multiset::pointer
base_type::pointer pointer
Definition: concurrent_unordered_set.h:280
tbb::interface5::concurrent_unordered_set::merge
void merge(concurrent_unordered_set< Key, Hash, Equality, Allocator > &&source)
Definition: concurrent_unordered_set.h:196
tbb::interface5::concurrent_unordered_set::value_type
base_type::value_type value_type
Definition: concurrent_unordered_set.h:79
tbb::interface5::internal::concurrent_unordered_base::size_type
tbb::internal::allocator_traits< allocator_type >::size_type size_type
Definition: _concurrent_unordered_impl.h:718
tbb::interface5::concurrent_unordered_set::hasher
Hasher hasher
Definition: concurrent_unordered_set.h:81
tbb::interface5::concurrent_unordered_multiset::concurrent_unordered_multiset
concurrent_unordered_multiset(Iterator first, Iterator last, size_type n_of_buckets=base_type::initial_bucket_number, const hasher &a_hasher=hasher(), const key_equal &a_keyeq=key_equal(), const allocator_type &a=allocator_type())
Definition: concurrent_unordered_set.h:316
tbb::interface5::concurrent_unordered_set_traits::node_type
tbb::internal::node_handle< key_type, key_type, typename internal::split_ordered_list< key_type, allocator_type >::node, allocator_type > node_type
Definition: concurrent_unordered_set.h:45
tbb::interface5::concurrent_unordered_multiset::node_type
base_type::node_type node_type
Definition: concurrent_unordered_set.h:293
tbb::interface5::concurrent_unordered_set::const_local_iterator
base_type::const_iterator const_local_iterator
Definition: concurrent_unordered_set.h:97
tbb::interface5::concurrent_unordered_multiset::reference
base_type::reference reference
Definition: concurrent_unordered_set.h:282
tbb::interface5::concurrent_unordered_multiset::key_type
Key key_type
Definition: concurrent_unordered_set.h:272
tbb::interface5::concurrent_unordered_set::concurrent_unordered_set
concurrent_unordered_set(Iterator first, Iterator last, size_type n_of_buckets, const allocator_type &a)
Definition: concurrent_unordered_set.h:128
tbb::interface5::concurrent_unordered_multiset::value_type
base_type::value_type value_type
Definition: concurrent_unordered_set.h:273
tbb::interface5::concurrent_unordered_multiset::const_reference
base_type::const_reference const_reference
Definition: concurrent_unordered_set.h:283
tbb::interface5::concurrent_unordered_set::iterator
base_type::iterator iterator
Definition: concurrent_unordered_set.h:94

Copyright © 2005-2020 Intel Corporation. All Rights Reserved.

Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are registered trademarks or trademarks of Intel Corporation or its subsidiaries in the United States and other countries.

* Other names and brands may be claimed as the property of others.