tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > Class Template Reference

#include <concurrent_unordered_set.h>

Inheritance diagram for tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >:

Collaboration diagram for tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >:

Public Types
typedef Key	key_type
typedef base_type::value_type	value_type
typedef Key	mapped_type
typedef Hasher	hasher
typedef Key_equality	key_equal
typedef hash_compare	key_compare
typedef base_type::allocator_type	allocator_type
typedef base_type::pointer	pointer
typedef base_type::const_pointer	const_pointer
typedef base_type::reference	reference
typedef base_type::const_reference	const_reference
typedef base_type::size_type	size_type
typedef base_type::difference_type	difference_type
typedef base_type::iterator	iterator
typedef base_type::const_iterator	const_iterator
typedef base_type::iterator	local_iterator
typedef base_type::const_iterator	const_local_iterator
typedef base_type::node_type	node_type

Public Member Functions
	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())
	concurrent_unordered_multiset (size_type n_of_buckets, const allocator_type &a)
	concurrent_unordered_multiset (size_type n_of_buckets, const hasher &a_hasher, const allocator_type &a)
	concurrent_unordered_multiset (const Allocator &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())
template<typename Iterator >
	concurrent_unordered_multiset (Iterator first, Iterator last, size_type n_of_buckets, const allocator_type &a)
template<typename Iterator >
	concurrent_unordered_multiset (Iterator first, Iterator last, size_type n_of_buckets, const hasher &a_hasher, const allocator_type &a)
	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())
	Constructor from initializer_list. More...
	concurrent_unordered_multiset (std::initializer_list< value_type > il, size_type n_of_buckets, const allocator_type &a)
	concurrent_unordered_multiset (std::initializer_list< value_type > il, size_type n_of_buckets, const hasher &a_hasher, const allocator_type &a)
	concurrent_unordered_multiset (concurrent_unordered_multiset &&table, const Allocator &a)
template<typename Hash , typename Equality >
void	merge (concurrent_unordered_set< Key, Hash, Equality, Allocator > &source)
template<typename Hash , typename Equality >
void	merge (concurrent_unordered_set< Key, Hash, Equality, Allocator > &&source)
template<typename Hash , typename Equality >
void	merge (concurrent_unordered_multiset< Key, Hash, Equality, Allocator > &source)
template<typename Hash , typename Equality >
void	merge (concurrent_unordered_multiset< Key, Hash, Equality, Allocator > &&source)
	concurrent_unordered_multiset (const concurrent_unordered_multiset &table, const Allocator &a)
std::pair< iterator, bool >	insert (const value_type &value)
iterator	insert (const_iterator, const value_type &value)
std::pair< iterator, bool >	insert (value_type &&value)
iterator	insert (const_iterator, value_type &&value)
std::pair< iterator, bool >	insert (node_type &&nh)
iterator	insert (const_iterator, node_type &&nh)
template<class Iterator >
void	insert (Iterator first, Iterator last)
void	insert (std::initializer_list< value_type > il)
	Insert initializer list. More...
Public Member Functions inherited from tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > >
allocator_type	get_allocator () const
bool	empty () const
size_type	size () const
size_type	max_size () const
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
const_iterator	cbegin () const
const_iterator	cend () const
range_type	range ()
const_range_type	range () const
std::pair< iterator, bool >	insert (const value_type &value)
iterator	insert (const_iterator, const value_type &value)
std::pair< iterator, bool >	insert (value_type &&value)
iterator	insert (const_iterator, value_type &&value)
std::pair< iterator, bool >	insert (node_type &&nh)
iterator	insert (const_iterator, node_type &&nh)
void	insert (Iterator first, Iterator last)
void	insert (std::initializer_list< value_type > il)
	Insert initializer list. More...
std::pair< iterator, bool >	emplace (Args &&... args)
iterator	emplace_hint (const_iterator, Args &&... args)
iterator	unsafe_erase (const_iterator where)
iterator	unsafe_erase (const_iterator first, const_iterator last)
size_type	unsafe_erase (const key_type &key)
node_type	unsafe_extract (const_iterator where)
node_type	unsafe_extract (const key_type &key)
void	swap (concurrent_unordered_base &right)
hasher	hash_function () const
key_equal	key_eq () const
void	clear ()
iterator	find (const key_type &key)
const_iterator	find (const key_type &key) const
size_type	count (const key_type &key) const
std::pair< iterator, iterator >	equal_range (const key_type &key)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &key) const
size_type	unsafe_bucket_count () const
size_type	unsafe_max_bucket_count () const
size_type	unsafe_bucket_size (size_type bucket)
size_type	unsafe_bucket (const key_type &key) const
local_iterator	unsafe_begin (size_type bucket)
const_local_iterator	unsafe_begin (size_type bucket) const
local_iterator	unsafe_end (size_type bucket)
const_local_iterator	unsafe_end (size_type bucket) const
const_local_iterator	unsafe_cbegin (size_type bucket) const
const_local_iterator	unsafe_cend (size_type bucket) const
float	load_factor () const
float	max_load_factor () const
void	max_load_factor (float newmax)
void	rehash (size_type buckets)

Private Types
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

Additional Inherited Members
Protected Types inherited from tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > >
typedef concurrent_unordered_base< concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > >	self_type
typedef concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > ::value_type	value_type
typedef concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > ::key_type	key_type
typedef concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > ::hash_compare	hash_compare
typedef concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > ::allocator_type	allocator_type
typedef hash_compare::hasher	hasher
typedef hash_compare::key_equal	key_equal
typedef tbb::internal::allocator_traits< allocator_type >::size_type	size_type
typedef tbb::internal::allocator_traits< allocator_type >::difference_type	difference_type
typedef tbb::internal::allocator_traits< allocator_type >::pointer	pointer
typedef tbb::internal::allocator_traits< allocator_type >::const_pointer	const_pointer
typedef allocator_type::value_type &	reference
typedef const allocator_type::value_type &	const_reference
typedef split_ordered_list< value_type, typename concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > ::allocator_type >	solist_t
typedef solist_t::nodeptr_t	nodeptr_t
typedef solist_t::raw_iterator	raw_iterator
typedef solist_t::raw_const_iterator	raw_const_iterator
typedef solist_t::iterator	iterator
typedef solist_t::const_iterator	const_iterator
typedef iterator	local_iterator
typedef const_iterator	const_local_iterator
typedef concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > ::node_type	node_type
Protected Types inherited from tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping >
enum	{ allow_multimapping = Allow_multimapping }
typedef Key	value_type
typedef Key	key_type
typedef Hash_compare	hash_compare
typedef tbb::internal::allocator_rebind< Allocator, value_type >::type	allocator_type
typedef tbb::internal::node_handle< key_type, key_type, typename internal::split_ordered_list< key_type, allocator_type >::node, allocator_type >	node_type
Protected Member Functions inherited from tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > >
	concurrent_unordered_base (size_type n_of_buckets=initial_bucket_number, const hash_compare &hc=hash_compare(), const allocator_type &a=allocator_type())
	concurrent_unordered_base (const concurrent_unordered_base &right, const allocator_type &a)
	concurrent_unordered_base (const concurrent_unordered_base &right)
	concurrent_unordered_base (concurrent_unordered_base &&right)
	concurrent_unordered_base (concurrent_unordered_base &&right, const allocator_type &a)
concurrent_unordered_base &	operator= (const concurrent_unordered_base &right)
concurrent_unordered_base &	operator= (concurrent_unordered_base &&other)
concurrent_unordered_base &	operator= (std::initializer_list< value_type > il)
	assignment operator from initializer_list More...
	~concurrent_unordered_base ()
void	internal_merge (SourceType &source)
Protected Member Functions inherited from tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping >
	concurrent_unordered_set_traits ()
	concurrent_unordered_set_traits (const hash_compare &hc)
Static Protected Member Functions inherited from tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping >
static const Key &	get_key (const value_type &value)
Protected Attributes inherited from tbb::interface5::concurrent_unordered_set_traits< Key, Hash_compare, Allocator, Allow_multimapping >
hash_compare	my_hash_compare
Static Protected Attributes inherited from tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_set_traits< Key, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, true > >
static const size_type	initial_bucket_number

Detailed Description

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>
class tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >

Definition at line 61 of file concurrent_unordered_set.h.

Member Typedef Documentation

allocator_type

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::allocator_type tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::allocator_type

Definition at line 279 of file concurrent_unordered_set.h.

base_type

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef internal::concurrent_unordered_base< traits_type > tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::base_type

private

Definition at line 263 of file concurrent_unordered_set.h.

const_iterator

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::const_iterator tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::const_iterator

Definition at line 289 of file concurrent_unordered_set.h.

const_local_iterator

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::const_iterator tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::const_local_iterator

Definition at line 291 of file concurrent_unordered_set.h.

const_pointer

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::const_pointer tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::const_pointer

Definition at line 281 of file concurrent_unordered_set.h.

const_reference

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::const_reference tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::const_reference

Definition at line 283 of file concurrent_unordered_set.h.

difference_type

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::difference_type tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::difference_type

Definition at line 286 of file concurrent_unordered_set.h.

hash_compare

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef internal::hash_compare<Key, Hasher, Key_equality> tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::hash_compare

private

Definition at line 261 of file concurrent_unordered_set.h.

hasher

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef Hasher tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::hasher

Definition at line 275 of file concurrent_unordered_set.h.

iterator

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::iterator tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::iterator

Definition at line 288 of file concurrent_unordered_set.h.

key_compare

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef hash_compare tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::key_compare

Definition at line 277 of file concurrent_unordered_set.h.

key_equal

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef Key_equality tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::key_equal

Definition at line 276 of file concurrent_unordered_set.h.

key_type

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef Key tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::key_type

Definition at line 272 of file concurrent_unordered_set.h.

local_iterator

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::iterator tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::local_iterator

Definition at line 290 of file concurrent_unordered_set.h.

mapped_type

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef Key tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::mapped_type

Definition at line 274 of file concurrent_unordered_set.h.

node_type

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::node_type tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::node_type

Definition at line 293 of file concurrent_unordered_set.h.

pointer

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::pointer tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::pointer

Definition at line 280 of file concurrent_unordered_set.h.

reference

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::reference tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::reference

Definition at line 282 of file concurrent_unordered_set.h.

size_type

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::size_type tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::size_type

Definition at line 285 of file concurrent_unordered_set.h.

traits_type

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef concurrent_unordered_set_traits<Key, hash_compare, Allocator, true> tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::traits_type

private

Definition at line 262 of file concurrent_unordered_set.h.

value_type

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

typedef base_type::value_type tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::value_type

Definition at line 273 of file concurrent_unordered_set.h.

Constructor & Destructor Documentation

concurrent_unordered_multiset() [1/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::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()  )

inlineexplicit

Definition at line 297 of file concurrent_unordered_set.h.

        : base_type(n_of_buckets, key_compare(a_hasher, a_keyeq), a)
    {}

concurrent_unordered_multiset() [2/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::concurrent_unordered_multiset ( size_type  n_of_buckets, const allocator_type &  a  )

inline

Definition at line 303 of file concurrent_unordered_set.h.

        : base_type(n_of_buckets, key_compare(hasher(), key_equal()), a)
    {}

concurrent_unordered_multiset() [3/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::concurrent_unordered_multiset ( size_type  n_of_buckets, const hasher &  a_hasher, const allocator_type &  a  )

inline

Definition at line 307 of file concurrent_unordered_set.h.

        : base_type(n_of_buckets, key_compare(a_hasher, key_equal()), a)
    {}

concurrent_unordered_multiset() [4/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::concurrent_unordered_multiset ( const Allocator &  a )

inlineexplicit

Definition at line 312 of file concurrent_unordered_set.h.

                                                               : base_type(base_type::initial_bucket_number, key_compare(), a)
    {}

concurrent_unordered_multiset() [5/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

template<typename Iterator >

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::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()  )

inline

Definition at line 316 of file concurrent_unordered_set.h.

        : base_type(n_of_buckets, key_compare(a_hasher, a_keyeq), a)
    {
        insert(first, last);
    }

References tbb::internal::first(), and tbb::internal::last().

Here is the call graph for this function:

concurrent_unordered_multiset() [6/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

template<typename Iterator >

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::concurrent_unordered_multiset ( Iterator  first, Iterator  last, size_type  n_of_buckets, const allocator_type &  a  )

inline

Definition at line 325 of file concurrent_unordered_set.h.

        : base_type(n_of_buckets, key_compare(hasher(), key_equal()), a)
    {
        insert(first, last);
    }

References tbb::internal::first(), and tbb::internal::last().

Here is the call graph for this function:

concurrent_unordered_multiset() [7/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

template<typename Iterator >

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::concurrent_unordered_multiset ( Iterator  first, Iterator  last, size_type  n_of_buckets, const hasher &  a_hasher, const allocator_type &  a  )

inline

Definition at line 332 of file concurrent_unordered_set.h.

        : base_type(n_of_buckets, key_compare(a_hasher, key_equal()), a)
    {
        insert(first, last);
    }

References tbb::internal::first(), and tbb::internal::last().

Here is the call graph for this function:

concurrent_unordered_multiset() [8/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::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()  )

inline

Constructor from initializer_list.

Definition at line 341 of file concurrent_unordered_set.h.

        : base_type(n_of_buckets, key_compare(a_hasher, a_keyeq), a)
    {
        insert(il.begin(),il.end());
    }

concurrent_unordered_multiset() [9/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::concurrent_unordered_multiset ( std::initializer_list< value_type >  il, size_type  n_of_buckets, const allocator_type &  a  )

inline

Definition at line 348 of file concurrent_unordered_set.h.

        : base_type(n_of_buckets, key_compare(hasher(), key_equal()), a)
    {
        insert(il.begin(), il.end());
    }

concurrent_unordered_multiset() [10/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::concurrent_unordered_multiset ( std::initializer_list< value_type >  il, size_type  n_of_buckets, const hasher &  a_hasher, const allocator_type &  a  )

inline

Definition at line 354 of file concurrent_unordered_set.h.

        : base_type(n_of_buckets, key_compare(a_hasher, key_equal()), a)
    {
        insert(il.begin(), il.end());
    }

concurrent_unordered_multiset() [11/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::concurrent_unordered_multiset ( concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > &&  table, const Allocator &  a  )

inline

Definition at line 385 of file concurrent_unordered_set.h.

        : base_type(std::move(table), a)
    {
    }

concurrent_unordered_multiset() [12/12]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::concurrent_unordered_multiset ( const concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator > &  table, const Allocator &  a  )

inline

Definition at line 410 of file concurrent_unordered_set.h.

        : base_type(table, a)
    {}

Member Function Documentation

insert() [1/8]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

std::pair<iterator, bool> tbb::interface5::internal::concurrent_unordered_base< Traits >::insert

inline

Definition at line 1068 of file _concurrent_unordered_impl.h.

                                                            {
        return internal_insert</*AllowCreate=*/tbb::internal::true_type,
                               /*AllowDestroy=*/tbb::internal::true_type>(value);
    }

insert() [2/8]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

iterator tbb::interface5::internal::concurrent_unordered_base< Traits >::insert

inline

Definition at line 1084 of file _concurrent_unordered_impl.h.

                                                        {
        // Ignore hint
        return insert(std::move(value)).first;
    }

insert() [3/8]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

template<class Iterator >

void tbb::interface5::internal::concurrent_unordered_base< Traits >::insert ( class Iterator  )

inline

Definition at line 1128 of file _concurrent_unordered_impl.h.

                                               {
        for (Iterator it = first; it != last; ++it)
            insert(*it);
    }

insert() [4/8]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

std::pair<iterator, bool> tbb::interface5::internal::concurrent_unordered_base< Traits >::insert

inline

Definition at line 1091 of file _concurrent_unordered_impl.h.

                                                   {
        if (!nh.empty()) {
            nodeptr_t handled_node = nh.my_node;
            std::pair<iterator, bool> insert_result =
                                      internal_insert</*AllowCreate=*/tbb::internal::false_type,
                                                      /*AllowDestroy=*/tbb::internal::false_type>
                                                      (handled_node->my_element, handled_node);
            if (insert_result.second)
                nh.deactivate();
            return insert_result;
        }
        return std::pair<iterator, bool>(end(), false);
    }

insert() [5/8]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

iterator tbb::interface5::internal::concurrent_unordered_base< Traits >::insert

inline

Definition at line 1105 of file _concurrent_unordered_impl.h.

                                                    {
        return insert(std::move(nh)).first;
    }

insert() [6/8]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

iterator tbb::interface5::internal::concurrent_unordered_base< Traits >::insert

inline

Definition at line 1073 of file _concurrent_unordered_impl.h.

                                                             {
        // Ignore hint
        return insert(value).first;
    }

insert() [7/8]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

std::pair<iterator, bool> tbb::interface5::internal::concurrent_unordered_base< Traits >::insert

inline

Definition at line 1079 of file _concurrent_unordered_impl.h.

                                                       {
        return internal_insert</*AllowCreate=*/tbb::internal::true_type,
                               /*AllowDestroy=*/tbb::internal::true_type>(std::move(value));
    }

insert() [8/8]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

void tbb::interface5::internal::concurrent_unordered_base< Traits >::insert

inline

Insert initializer list.

Definition at line 1135 of file _concurrent_unordered_impl.h.

                                                    {
        insert(il.begin(), il.end());
    }

merge() [1/4]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

template<typename Hash , typename Equality >

void tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::merge ( concurrent_unordered_set< Key, Hash, Equality, Allocator > &  source )

inline

Definition at line 393 of file concurrent_unordered_set.h.

              { this->internal_merge(source); }

merge() [2/4]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

template<typename Hash , typename Equality >

void tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::merge ( concurrent_unordered_set< Key, Hash, Equality, Allocator > &&  source )

inline

Definition at line 397 of file concurrent_unordered_set.h.

              { this->internal_merge(source); }

merge() [3/4]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

template<typename Hash , typename Equality >

void tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::merge ( concurrent_unordered_multiset< Key, Hash, Equality, Allocator > &  source )

inline

Definition at line 401 of file concurrent_unordered_set.h.

              { this->internal_merge(source); }

merge() [4/4]

template<typename Key, typename Hasher = tbb::tbb_hash<Key>, typename Key_equality = std::equal_to<Key>, typename Allocator = tbb::tbb_allocator<Key>>

template<typename Hash , typename Equality >

void tbb::interface5::concurrent_unordered_multiset< Key, Hasher, Key_equality, Allocator >::merge ( concurrent_unordered_multiset< Key, Hash, Equality, Allocator > &&  source )

inline

Definition at line 405 of file concurrent_unordered_set.h.

              { this->internal_merge(source); }

---

The documentation for this class was generated from the following file:

• concurrent_unordered_set.h