Construct, Destroy, Copy

The following tables provide information on the members of the concurrent_unordered_map and concurrent_unordered_multimap template classes.

concurrent_unordered_map

Member Description
explicit concurrent_unordered_map(size_type n = <implementation-defined>, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type())

Constructs a table with n buckets.

template <typename InputIterator> concurrent_unordered_map (InputIterator first, InputIterator last, size_type n = <implementation-defined>, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type())

Constructs a table with n buckets initialized with value_type(*i) where i is in the half open interval [first,last).

concurrent_unordered_map(const concurrent_unordered_map& m)

Constructs a copy of the map m.

concurrent_unordered_map(const Alloc& a)

Constructs an empty map using allocator a.

concurrent_unordered_map(const concurrent_unordered_map& m, const Alloc& a)

Constructs a copy of the map m using allocator a.

concurrent_unordered_map(std::initializer_list<value_type> il, size_type n = <implementation-defined>, const Hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type())

C++11 specific; Equivalent to concurrent_unordered_map(il.begin(), il.end(), n, hf, eql, a) .

concurrent_unordered_map(concurrent_unordered_map&& m)

C++11 specific; Constructs a new table by moving content from m. m is left in an unspecified state, but can be safely destroyed.

concurrent_unordered_map(concurrent_unordered_map&& m, const Alloc& a)

C++11 specific; Constructs a new table by moving content from m using specifed allocator. m is left in an unspecified state, but can be safely destroyed.

~concurrent_unordered_map()

Destroys the map.

concurrent_unordered_map& operator=(const concurrent_unordered_map& m);

Assigns contents of m to *this.

Returns: a reference to *this.

concurrent_unordered_map& operator=(concurrent_unordered_map&& m);

C++11 specific; Moves data from m to *this. m is left in an unspecified state, but can be safely destroyed.

Returns: a reference to *this.

concurrent_unordered_map& operator=(std::initializer_list<value_type> il);

C++11 specific; Assigns contents of il to *this.

Returns: a reference to *this.

allocator_type get_allocator() const;

Returns a copy of the allocator associated with *this.

concurrent_unordered_multimap

Member Description
explicit concurrent_unordered_multimap(size_type n = <implementation-defined>, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type())

Constructs a table with n buckets.

template <typename InputIterator> concurrent_unordered_multimap(InputIterator first, InputIterator last, size_type n = <implementation-defined>, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type())

Constructs a table with n buckets initialized with value_type(*i) where i is in the half open interval [first,last).

concurrent_unordered_multimap(const concurrent_unordered_multimap& m)

Constructs a copy of the multimap m.

concurrent_unordered_multimap(const Alloc& a)

Constructs empty multimap using allocator a.

concurrent_unordered_multimap(const concurrent_unordered_multimap&, const Alloc& a)

Constructs a copy of the multimap m using allocator a.

concurrent_unordered_multimap(std::initializer_list<value_type> il, size_type n = <implementation-defined>, const Hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type())

C++11 specific; Equivalent to concurrent_unordered_multimap(il.begin(), il.end(), n, hf, eql, a) .

concurrent_unordered_multimap(concurrent_unordered_multimap&& m)

C++11 specific; Constructs a new table by moving content from m. m is left in an unspecified state, but can be safely destroyed.

concurrent_unordered_multimap(concurrent_unordered_multimap&& m, const Alloc& a)

C++11 specific; Constructs a new table by moving content from m using specifed allocator. m is left in an unspecified state, but can be safely destroyed.

~concurrent_unordered_multimap()

Destroys the multimap.

concurrent_unordered_multimap& operator=(const concurrent_unordered_multimap& m);

Assigns contents of m to *this.

Returns: a reference to *this.

concurrent_unordered_multimap& operator=(concurrent_unordered_multimap&& m);

C++11 specific; Moves data from m to *this. m is left in an unspecified state, but can be safely destroyed.

Returns: a reference to *this.

concurrent_unordered_multimap& operator=( std::initializer_list<value_type> il);

C++11 specific; Assigns contents of il to *this.

Returns: a reference to *this.

allocator_type get_allocator() const;

Returns a copy of the allocator associated with *this.

Para obtener información más completa sobre las optimizaciones del compilador, consulte nuestro Aviso de optimización.