tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node Class Reference

#include <concurrent_hash_map.h>

Inheritance diagram for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node:

Collaboration diagram for tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node:

Public Member Functions
value_type *	storage ()
value_type &	value ()

Private Attributes
tbb::aligned_space< value_type >	my_value

Detailed Description

template<typename Key, typename T, typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<const Key, T> >>
class tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node

Definition at line 616 of file concurrent_hash_map.h.

Member Function Documentation

template<typename Key, typename T, typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<const Key, T> >>

value_type* tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node::storage ( )

inline

Definition at line 619 of file concurrent_hash_map.h.

References tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node::my_value.

Referenced by tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::create_node(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::internal_fast_find(), and tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node::value().

{ return my_value.begin(); }

Here is the caller graph for this function:

template<typename Key, typename T, typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<const Key, T> >>

value_type& tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node::value ( )

inline

Definition at line 620 of file concurrent_hash_map.h.

References tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node::storage().

Referenced by tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::generic_emplace(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::internal_copy(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::const_accessor::operator*(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::accessor::operator*(), and tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::search_bucket().

{ return *storage(); }

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

template<typename Key, typename T, typename HashCompare = tbb_hash_compare<Key>, typename A = tbb_allocator<std::pair<const Key, T> >>

tbb::aligned_space<value_type> tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node::my_value

private

Definition at line 617 of file concurrent_hash_map.h.

Referenced by tbb::interface5::concurrent_hash_map< Key, T, HashCompare, A >::node::storage().

---

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

• concurrent_hash_map.h