1253 lines
57 KiB
C++
1253 lines
57 KiB
C++
/***
|
|
* ==++==
|
|
*
|
|
* Copyright (c) Microsoft Corporation. All rights reserved.
|
|
*
|
|
* ==--==
|
|
* =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
|
|
*
|
|
* concurrent_unordered_set.h
|
|
*
|
|
* =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
|
|
****/
|
|
#pragma once
|
|
|
|
#include <utility>
|
|
#include "internal_concurrent_hash.h"
|
|
|
|
#define _PPL_CONTAINER
|
|
|
|
#if !(defined (_M_X64) || defined (_M_IX86) || defined (_M_ARM))
|
|
#error ERROR: Concurrency Runtime is supported only on X64, X86 and ARM architectures.
|
|
#endif /* !(defined (_M_X64) || defined (_M_IX86) || defined (_M_ARM)) */
|
|
|
|
#if defined (_M_CEE)
|
|
#error ERROR: Concurrency Runtime is not supported when compiling /clr.
|
|
#endif /* defined (_M_CEE) */
|
|
|
|
#pragma pack(push,_CRT_PACKING)
|
|
#pragma warning(push)
|
|
#pragma warning(disable: 4100) // Unreferenced formal parameter - needed for document generation
|
|
|
|
namespace Concurrency
|
|
{
|
|
namespace details
|
|
{
|
|
// Template class for hash set traits
|
|
template<typename _Key_type, typename _Key_comparator, typename _Allocator_type, bool _Allow_multimapping>
|
|
class _Concurrent_unordered_set_traits : public std::_Container_base
|
|
{
|
|
public:
|
|
typedef _Key_type value_type;
|
|
typedef _Key_type key_type;
|
|
typedef _Key_comparator _Key_compare;
|
|
|
|
typedef typename _Allocator_type::template rebind<value_type>::other allocator_type;
|
|
|
|
enum
|
|
{
|
|
_M_allow_multimapping = _Allow_multimapping
|
|
};
|
|
|
|
_Concurrent_unordered_set_traits() : _M_comparator()
|
|
{
|
|
}
|
|
|
|
_Concurrent_unordered_set_traits(const _Key_comparator& _Traits) : _M_comparator(_Traits)
|
|
{
|
|
}
|
|
|
|
typedef _Key_compare _Value_compare;
|
|
|
|
static const _Key_type& _Key_function(const value_type& _Value)
|
|
{
|
|
return _Value;
|
|
}
|
|
|
|
_Key_comparator _M_comparator; // the comparator predicate for keys
|
|
};
|
|
} // namespace details;
|
|
|
|
/// <summary>
|
|
/// The <c>concurrent_unordered_set</c> class is an concurrency-safe container that controls a varying-length sequence of
|
|
/// elements of type _Key_type. The sequence is represented in a way that enables concurrency-safe append, element access,
|
|
/// iterator access and iterator traversal operations.
|
|
/// </summary>
|
|
/// <typeparam name="_Key_type">
|
|
/// The key type.
|
|
/// </typeparam>
|
|
/// <typeparam name="_Hasher">
|
|
/// The hash function object type. This argument is optional and the default value is
|
|
/// <c>std::tr1::hash<</c><typeparamref name="_Key_type"/><c>></c>.
|
|
/// </typeparam>
|
|
/// <typeparam name="_Key_equality">
|
|
/// The equality comparison function object type. This argument is optional and the default value is
|
|
/// <c>std::equal_to<</c><typeparamref name="_Key_type"/><c>></c>.
|
|
/// </typeparam>
|
|
/// <typeparam name="_Allocator_type">
|
|
/// The type that represents the stored allocator object that encapsulates details about the allocation and
|
|
/// deallocation of memory for the concurrent unordered set. This argument is optional and the default value is
|
|
/// <c>std::allocator<</c><typeparamref name="_Key_type"/><c>></c>.
|
|
/// </typeparam>
|
|
/// <remarks>
|
|
/// For detailed information on the <c>concurrent_unordered_set</c> class, see <see cref="Parallel Containers and Objects"/>.
|
|
/// </remarks>
|
|
/// <seealso cref="Parallel Containers and Objects"/>
|
|
/**/
|
|
template <typename _Key_type, typename _Hasher = std::tr1::hash<_Key_type>, typename _Key_equality = std::equal_to<_Key_type>, typename _Allocator_type = std::allocator<_Key_type> >
|
|
class concurrent_unordered_set : public details::_Concurrent_hash< details::_Concurrent_unordered_set_traits<_Key_type, details::_Hash_compare<_Key_type, _Hasher, _Key_equality>, _Allocator_type, false> >
|
|
{
|
|
public:
|
|
// Base type definitions
|
|
typedef concurrent_unordered_set<_Key_type, _Hasher, _Key_equality, _Allocator_type> _Mytype;
|
|
typedef details::_Hash_compare<_Key_type, _Hasher, _Key_equality> _Key_compare;
|
|
typedef details::_Concurrent_hash< details::_Concurrent_unordered_set_traits<_Key_type, _Key_compare, _Allocator_type, false> > _Mybase;
|
|
|
|
/// <summary>
|
|
/// The type of an ordering key.
|
|
/// </summary>
|
|
/**/
|
|
typedef _Key_type key_type;
|
|
|
|
/// <summary>
|
|
/// The type of an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::value_type value_type;
|
|
|
|
/// <summary>
|
|
/// The type of the hash function.
|
|
/// </summary>
|
|
/**/
|
|
typedef _Hasher hasher;
|
|
|
|
/// <summary>
|
|
/// The type of the comparison function.
|
|
/// </summary>
|
|
/**/
|
|
typedef _Key_equality key_equal;
|
|
|
|
/// <summary>
|
|
/// The type of an allocator for managing storage.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::allocator_type allocator_type;
|
|
|
|
/// <summary>
|
|
/// The type of a pointer to an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::pointer pointer;
|
|
|
|
/// <summary>
|
|
/// The type of a constant pointer to an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::const_pointer const_pointer;
|
|
|
|
/// <summary>
|
|
/// The type of a reference to an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::reference reference;
|
|
|
|
/// <summary>
|
|
/// The type of a constant reference to an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::const_reference const_reference;
|
|
|
|
/// <summary>
|
|
/// The type of an unsigned distance between two elements.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::size_type size_type;
|
|
|
|
/// <summary>
|
|
/// The type of a signed distance between two elements.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::difference_type difference_type;
|
|
|
|
/// <summary>
|
|
/// The type of an iterator for the controlled sequence.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::iterator iterator;
|
|
|
|
/// <summary>
|
|
/// The type of a constant iterator for the controlled sequence.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::const_iterator const_iterator;
|
|
|
|
/// <summary>
|
|
/// The type of a bucket iterator for the controlled sequence.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::iterator local_iterator;
|
|
|
|
/// <summary>
|
|
/// The type of a constant bucket iterator for the controlled sequence.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::const_iterator const_local_iterator;
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered set.
|
|
/// </summary>
|
|
/// <param name="_Number_of_buckets">
|
|
/// The initial number of buckets for this unordered set.
|
|
/// </param>
|
|
/// <param name="_Hasher">
|
|
/// The hash function for this unordered set.
|
|
/// </param>
|
|
/// <param name="_Key_equality">
|
|
/// The equality comparison function for this unordered set.
|
|
/// </param>
|
|
/// <param name="_Allocator">
|
|
/// The allocator for this unordered set.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered set.
|
|
/// <para>The first constructor specifies an empty initial set and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered set.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
explicit concurrent_unordered_set(size_type _Number_of_buckets = 8, const hasher& _Hasher = hasher(), const key_equal& _Key_equality = key_equal(),
|
|
const allocator_type& _Allocator = allocator_type())
|
|
: _Mybase(_Number_of_buckets, _Key_compare(_Hasher, _Key_equality), _Allocator)
|
|
{
|
|
this->rehash(_Number_of_buckets);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered set.
|
|
/// </summary>
|
|
/// <param name="_Allocator">
|
|
/// The allocator for this unordered set.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered set.
|
|
/// <para>The first constructor specifies an empty initial set and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered set.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_set(const allocator_type& _Allocator) : _Mybase(8, _Key_compare(), _Allocator)
|
|
{
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered set.
|
|
/// </summary>
|
|
/// <typeparam name="_Iterator">
|
|
/// The type of the input iterator.
|
|
/// </typeparam>
|
|
/// <param name="_Begin">
|
|
/// The position of the first element in the range of elements to be copied.
|
|
/// </param>
|
|
/// <param name="_End">
|
|
/// The position of the first element beyond the range of elements to be copied.
|
|
/// </param>
|
|
/// <param name="_Number_of_buckets">
|
|
/// The initial number of buckets for this unordered set.
|
|
/// </param>
|
|
/// <param name="_Hasher">
|
|
/// The hash function for this unordered set.
|
|
/// </param>
|
|
/// <param name="_Key_equality">
|
|
/// The equality comparison function for this unordered set.
|
|
/// </param>
|
|
/// <param name="_Allocator">
|
|
/// The allocator for this unordered set.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered set.
|
|
/// <para>The first constructor specifies an empty initial set and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered set.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
template <typename _Iterator>
|
|
concurrent_unordered_set(_Iterator _First, _Iterator _Last, size_type _Number_of_buckets = 8, const hasher& _Hasher = hasher(),
|
|
const key_equal& _Key_equality = key_equal(), const allocator_type& _Allocator = allocator_type())
|
|
: _Mybase(_Number_of_buckets, _Key_compare(), allocator_type())
|
|
{
|
|
this->rehash(_Number_of_buckets);
|
|
for (; _First != _Last; ++_First)
|
|
{
|
|
_Insert(*_First);
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered set.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_set</c> object to copy or move elements from.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered set.
|
|
/// <para>The first constructor specifies an empty initial set and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered set.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_set(const concurrent_unordered_set& _Uset) : _Mybase(_Uset)
|
|
{
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered set.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_set</c> object to copy or move elements from.
|
|
/// </param>
|
|
/// <param name="_Allocator">
|
|
/// The allocator for this unordered set.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered set.
|
|
/// <para>The first constructor specifies an empty initial set and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered set.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_set(const concurrent_unordered_set& _Uset, const allocator_type& _Allocator) : _Mybase(_Uset, _Allocator)
|
|
{
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered set.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_set</c> object to copy or move elements from.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered set.
|
|
/// <para>The first constructor specifies an empty initial set and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered set.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered set <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_set(concurrent_unordered_set&& _Uset) : _Mybase(std::move(_Uset))
|
|
{
|
|
}
|
|
|
|
/// <summary>
|
|
/// Assigns the contents of another <c>concurrent_unordered_set</c> object to this one. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_set</c> object.
|
|
/// </param>
|
|
/// <returns>
|
|
/// A reference to this <c>concurrent_unordered_set</c> object.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// After erasing any existing elements in a concurrent unordered set, <c>operator=</c> either copies or moves the contents of
|
|
/// <paramref name="_Uset"/> into the concurrent unordered set.
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_set& operator=(const concurrent_unordered_set& _Uset)
|
|
{
|
|
_Mybase::operator=(_Uset);
|
|
return (*this);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Assigns the contents of another <c>concurrent_unordered_set</c> object to this one. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_set</c> object.
|
|
/// </param>
|
|
/// <returns>
|
|
/// A reference to this <c>concurrent_unordered_set</c> object.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// After erasing any existing elements in a concurrent unordered set, <c>operator=</c> either copies or moves the contents of
|
|
/// <paramref name="_Uset"/> into the concurrent unordered set.
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_set& operator=(concurrent_unordered_set&& _Uset)
|
|
{
|
|
_Mybase::operator=(std::move(_Uset));
|
|
return (*this);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_set</c> object.
|
|
/// </summary>
|
|
/// <param name="_Value">
|
|
/// The value to be inserted.
|
|
/// </param>
|
|
/// <returns>
|
|
/// A pair that contains an iterator and a boolean value. See the Remarks section for more details.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// The first member function determines whether an element X exists in the sequence whose key has equivalent ordering to
|
|
/// that of <paramref name="_Value"/>. If not, it creates such an element X and initializes it with <paramref name="_Value"/>.
|
|
/// The function then determines the iterator <c>where</c> that designates X. If an insertion occurred, the function returns
|
|
/// <c>std::pair(where, true)</c>. Otherwise, it returns <c>std::pair(where, false)</c>.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
std::pair<iterator, bool> insert(const value_type& _Value)
|
|
{
|
|
return _Insert(_Value);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_set</c> object.
|
|
/// </summary>
|
|
/// <param name="_Where">
|
|
/// The starting location to search for an insertion point.
|
|
/// </param>
|
|
/// <param name="_Value">
|
|
/// The value to be inserted.
|
|
/// </param>
|
|
/// <returns>
|
|
/// An iterator pointing to the insertion location of the object. If the key already exists in the container
|
|
/// an iterator pointing to the duplicate key location in the set is returned.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// The first member function determines whether an element X exists in the sequence whose key has equivalent ordering to
|
|
/// that of <paramref name="_Value"/>. If not, it creates such an element X and initializes it with <paramref name="_Value"/>.
|
|
/// The function then determines the iterator <c>where</c> that designates X. If an insertion occurred, the function returns
|
|
/// <c>std::pair(where, true)</c>. Otherwise, it returns <c>std::pair(where, false)</c>.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
iterator insert(const_iterator _Where, const value_type& _Value)
|
|
{
|
|
// Current implementation ignores the hint. The method is provided for compatibility with unordered_set.
|
|
return _Insert(_Value).first;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_set</c> object.
|
|
/// </summary>
|
|
/// <typeparam name="_Iterator">
|
|
/// The iterator type used for insertion.
|
|
/// </typeparam>
|
|
/// <param name="_First">
|
|
/// The beginning of the range to insert.
|
|
/// </param>
|
|
/// <param name="_Last">
|
|
/// The end of the range to insert.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// The first member function determines whether an element X exists in the sequence whose key has equivalent ordering to
|
|
/// that of <paramref name="_Value"/>. If not, it creates such an element X and initializes it with <paramref name="_Value"/>.
|
|
/// The function then determines the iterator <c>where</c> that designates X. If an insertion occurred, the function returns
|
|
/// <c>std::pair(where, true)</c>. Otherwise, it returns <c>std::pair(where, false)</c>.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
template<class _Iterator>
|
|
void insert(_Iterator _First, _Iterator _Last)
|
|
{
|
|
_Insert(_First, _Last);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_set</c> object.
|
|
/// </summary>
|
|
/// <typeparam name="_Valty">
|
|
/// The type of the value inserted into the set.
|
|
/// </typeparam>
|
|
/// <param name="_Value">
|
|
/// The value to be inserted.
|
|
/// </param>
|
|
/// <returns>
|
|
/// A pair that contains an iterator and a boolean value. See the Remarks section for more details.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// The first member function determines whether an element X exists in the sequence whose key has equivalent ordering to
|
|
/// that of <paramref name="_Value"/>. If not, it creates such an element X and initializes it with <paramref name="_Value"/>.
|
|
/// The function then determines the iterator <c>where</c> that designates X. If an insertion occurred, the function returns
|
|
/// <c>std::pair(where, true)</c>. Otherwise, it returns <c>std::pair(where, false)</c>.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
template<class _Valty>
|
|
std::pair<iterator, bool> insert(_Valty&& _Value)
|
|
{
|
|
return _Insert(std::forward<_Valty>(_Value));
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_set</c> object.
|
|
/// </summary>
|
|
/// <typeparam name="_Valty">
|
|
/// The type of the value inserted into the set.
|
|
/// </typeparam>
|
|
/// <param name="_Where">
|
|
/// The starting location to search for an insertion point.
|
|
/// </param>
|
|
/// <param name="_Value">
|
|
/// The value to be inserted.
|
|
/// </param>
|
|
/// <returns>
|
|
/// An iterator pointing to the insertion location of the object. If the key already exists in the container
|
|
/// an iterator pointing to the duplicate key location in the set is returned.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// The first member function determines whether an element X exists in the sequence whose key has equivalent ordering to
|
|
/// that of <paramref name="_Value"/>. If not, it creates such an element X and initializes it with <paramref name="_Value"/>.
|
|
/// The function then determines the iterator <c>where</c> that designates X. If an insertion occurred, the function returns
|
|
/// <c>std::pair(where, true)</c>. Otherwise, it returns <c>std::pair(where, false)</c>.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
template<class _Valty>
|
|
typename std::tr1::enable_if<!std::tr1::is_same<const_iterator,
|
|
typename std::tr1::remove_reference<_Valty>::type>::value, iterator>::type
|
|
insert(const_iterator _Where, _Valty&& _Value)
|
|
{
|
|
// Current implementation ignores the hint. The method is provided for compatibility with unordered_set.
|
|
return _Insert(std::forward<_Valty>(_Value)).first;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Removes elements from the <c>concurrent_unordered_set</c> at specified positions. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Where">
|
|
/// The iterator position to erase from.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// The first member function removes the element pointed to by <paramref name="_Where"/>. The second member function removes the elements
|
|
/// in the range [<paramref name="_Begin"/>, <paramref name="_End"/>).
|
|
/// <para>The third member function removes the elements in the range delimited by
|
|
/// <see cref="concurrent_unordered_set::equal_range Method"/>(_Keyval).</para>
|
|
/// </remarks>
|
|
/// <returns>
|
|
/// The first two member functions return an iterator that designates the first element remaining beyond any elements removed,
|
|
/// or <see cref="concurrent_unordered_set::end Method"/>() if no such element exists. The third member function returns the number
|
|
/// of elements it removes.
|
|
/// </returns>
|
|
/**/
|
|
iterator unsafe_erase(const_iterator _Where)
|
|
{
|
|
return _Mybase::unsafe_erase(_Where);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Removes elements from the <c>concurrent_unordered_set</c> at specified positions. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Keyval">
|
|
/// The key value to erase.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// The first member function removes the element pointed to by <paramref name="_Where"/>. The second member function removes the elements
|
|
/// in the range [<paramref name="_Begin"/>, <paramref name="_End"/>).
|
|
/// <para>The third member function removes the elements in the range delimited by
|
|
/// <see cref="concurrent_unordered_set::equal_range Method"/>(_Keyval).</para>
|
|
/// </remarks>
|
|
/// <returns>
|
|
/// The first two member functions return an iterator that designates the first element remaining beyond any elements removed,
|
|
/// or <see cref="concurrent_unordered_set::end Method"/>() if no such element exists. The third member function returns the number
|
|
/// of elements it removes.
|
|
/// </returns>
|
|
/**/
|
|
size_type unsafe_erase(const key_type& _Keyval)
|
|
{
|
|
return _Mybase::unsafe_erase(_Keyval);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Removes elements from the <c>concurrent_unordered_set</c> at specified positions. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Begin">
|
|
/// The position of the first element in the range of elements to be erased.
|
|
/// </param>
|
|
/// <param name="_End">
|
|
/// The position of the first element beyond the range of elements to be erased.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// The first member function removes the element pointed to by <paramref name="_Where"/>. The second member function removes the elements
|
|
/// in the range [<paramref name="_Begin"/>, <paramref name="_End"/>).
|
|
/// <para>The third member function removes the elements in the range delimited by
|
|
/// <see cref="concurrent_unordered_set::equal_range Method"/>(_Keyval).</para>
|
|
/// </remarks>
|
|
/// <returns>
|
|
/// The first two member functions return an iterator that designates the first element remaining beyond any elements removed,
|
|
/// or <see cref="concurrent_unordered_set::end Method"/>() if no such element exists. The third member function returns the number
|
|
/// of elements it removes.
|
|
/// </returns>
|
|
/**/
|
|
iterator unsafe_erase(const_iterator _First, const_iterator _Last)
|
|
{
|
|
return _Mybase::unsafe_erase(_First, _Last);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Swaps the contents of two <c>concurrent_unordered_set</c> objects. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The <c>concurrent_unordered_set</c> object to swap with.
|
|
/// </param>
|
|
/**/
|
|
void swap(concurrent_unordered_set& _Uset)
|
|
{
|
|
_Mybase::swap(_Uset);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns the stored hash function object.
|
|
/// </summary>
|
|
/// <returns>
|
|
/// The stored hash function object.
|
|
/// </returns>
|
|
/**/
|
|
hasher hash_function() const
|
|
{
|
|
return _M_comparator._M_hash_object;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns the stored equality comparison function object.
|
|
/// </summary>
|
|
/// <returns>
|
|
/// The stored equality comparison function object.
|
|
/// </returns>
|
|
/**/
|
|
key_equal key_eq() const
|
|
{
|
|
return _M_comparator._M_key_compare_object;
|
|
}
|
|
};
|
|
|
|
/// <summary>
|
|
/// The <c>concurrent_unordered_multiset</c> class is an concurrency-safe container that controls a varying-length sequence of
|
|
/// elements of type _Key_type. The sequence is represented in a way that enables concurrency-safe append, element access,
|
|
/// iterator access and iterator traversal operations.
|
|
/// </summary>
|
|
/// <typeparam name="_Key_type">
|
|
/// The key type.
|
|
/// </typeparam>
|
|
/// <typeparam name="_Hasher">
|
|
/// The hash function object type. This argument is optional and the default value is
|
|
/// <c>std::tr1::hash<</c><typeparamref name="_Key_type"/><c>></c>.
|
|
/// </typeparam>
|
|
/// <typeparam name="_Key_equality">
|
|
/// The equality comparison function object type. This argument is optional and the default value is
|
|
/// <c>std::equal_to<</c><typeparamref name="_Key_type"/><c>></c>.
|
|
/// </typeparam>
|
|
/// <typeparam name="_Allocator_type">
|
|
/// The type that represents the stored allocator object that encapsulates details about the allocation and
|
|
/// deallocation of memory for the concurrent vector. This argument is optional and the default value is
|
|
/// <c>std::allocator<</c><typeparamref name="_Key_type"/><c>></c>.
|
|
/// </typeparam>
|
|
/// <remarks>
|
|
/// For detailed information on the <c>concurrent_unordered_multiset</c> class, see <see cref="Parallel Containers and Objects"/>.
|
|
/// </remarks>
|
|
/// <seealso cref="Parallel Containers and Objects"/>
|
|
/**/
|
|
template <typename _Key_type, typename _Hasher = std::tr1::hash<_Key_type>, typename _Key_equality = std::equal_to<_Key_type>, typename _Allocator_type = std::allocator<_Key_type> >
|
|
class concurrent_unordered_multiset : public details::_Concurrent_hash< details::_Concurrent_unordered_set_traits<_Key_type, details::_Hash_compare<_Key_type, _Hasher, _Key_equality>, _Allocator_type, true> >
|
|
{
|
|
public:
|
|
// Base type definitions
|
|
typedef concurrent_unordered_multiset<_Key_type, _Hasher, _Key_equality, _Allocator_type> _Mytype;
|
|
typedef details::_Hash_compare<_Key_type, _Hasher, _Key_equality> _Key_compare;
|
|
typedef details::_Concurrent_hash< details::_Concurrent_unordered_set_traits<_Key_type, _Key_compare, _Allocator_type, true> > _Mybase;
|
|
|
|
/// <summary>
|
|
/// The type of an ordering key.
|
|
/// </summary>
|
|
/**/
|
|
typedef _Key_type key_type;
|
|
|
|
/// <summary>
|
|
/// The type of an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::value_type value_type;
|
|
|
|
/// <summary>
|
|
/// The type of the hash function.
|
|
/// </summary>
|
|
/**/
|
|
typedef _Hasher hasher;
|
|
|
|
/// <summary>
|
|
/// The type of the comparison function.
|
|
/// </summary>
|
|
/**/
|
|
typedef _Key_equality key_equal;
|
|
|
|
/// <summary>
|
|
/// The type of an allocator for managing storage.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::allocator_type allocator_type;
|
|
|
|
/// <summary>
|
|
/// The type of a pointer to an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::pointer pointer;
|
|
|
|
/// <summary>
|
|
/// The type of a constant pointer to an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::const_pointer const_pointer;
|
|
|
|
/// <summary>
|
|
/// The type of a reference to an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::reference reference;
|
|
|
|
/// <summary>
|
|
/// The type of a constant reference to an element.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::const_reference const_reference;
|
|
|
|
/// <summary>
|
|
/// The type of an unsigned distance between two elements.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::size_type size_type;
|
|
|
|
/// <summary>
|
|
/// The type of a signed distance between two elements.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::difference_type difference_type;
|
|
|
|
/// <summary>
|
|
/// The type of an iterator for the controlled sequence.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::iterator iterator;
|
|
|
|
/// <summary>
|
|
/// The type of a constant iterator for the controlled sequence.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::const_iterator const_iterator;
|
|
|
|
/// <summary>
|
|
/// The type of a bucket iterator for the controlled sequence.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::iterator local_iterator;
|
|
|
|
/// <summary>
|
|
/// The type of a constant bucket iterator for the controlled sequence.
|
|
/// </summary>
|
|
/**/
|
|
typedef typename _Mybase::const_iterator const_local_iterator;
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered multiset.
|
|
/// </summary>
|
|
/// <param name="_Number_of_buckets">
|
|
/// The initial number of buckets for this unordered multiset.
|
|
/// </param>
|
|
/// <param name="_Hasher">
|
|
/// The hash function for this unordered multiset.
|
|
/// </param>
|
|
/// <param name="_Key_equality">
|
|
/// The equality comparison function for this unordered multiset.
|
|
/// </param>
|
|
/// <param name="_Allocator">
|
|
/// The allocator for this unordered multiset.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered multiset.
|
|
/// <para>The first constructor specifies an empty initial multiset and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered multiset.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
explicit concurrent_unordered_multiset(size_type _Number_of_buckets = 8, const hasher& _Hasher = hasher(), const key_equal& _Key_equality = key_equal(),
|
|
const allocator_type& _Allocator = allocator_type())
|
|
: _Mybase(_Number_of_buckets, _Key_compare(_Hasher, _Key_equality), _Allocator)
|
|
{
|
|
this->rehash(_Number_of_buckets);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered multiset.
|
|
/// </summary>
|
|
/// <param name="_Allocator">
|
|
/// The allocator for this unordered multiset.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered multiset.
|
|
/// <para>The first constructor specifies an empty initial multiset and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered multiset.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_multiset(const allocator_type& _Allocator) : _Mybase(8, _Key_compare(), _Allocator)
|
|
{
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered multiset.
|
|
/// </summary>
|
|
/// <typeparam name="_Iterator">
|
|
/// The type of the input iterator.
|
|
/// </typeparam>
|
|
/// <param name="_Begin">
|
|
/// The position of the first element in the range of elements to be copied.
|
|
/// </param>
|
|
/// <param name="_End">
|
|
/// The position of the first element beyond the range of elements to be copied.
|
|
/// </param>
|
|
/// <param name="_Number_of_buckets">
|
|
/// The initial number of buckets for this unordered multiset.
|
|
/// </param>
|
|
/// <param name="_Hasher">
|
|
/// The hash function for this unordered multiset.
|
|
/// </param>
|
|
/// <param name="_Key_equality">
|
|
/// The equality comparison function for this unordered multiset.
|
|
/// </param>
|
|
/// <param name="_Allocator">
|
|
/// The allocator for this unordered multiset.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered multiset.
|
|
/// <para>The first constructor specifies an empty initial multiset and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered multiset.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
template <typename _Iterator>
|
|
concurrent_unordered_multiset(_Iterator _First, _Iterator _Last, size_type _Number_of_buckets = 8, const hasher& _Hasher = hasher(),
|
|
const key_equal& _Key_equality = key_equal(), const allocator_type& _Allocator = allocator_type())
|
|
: _Mybase(_Number_of_buckets, _Key_compare(), allocator_type())
|
|
{
|
|
this->rehash(_Number_of_buckets);
|
|
for (; _First != _Last; ++_First)
|
|
{
|
|
_Insert(*_First);
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered multiset.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_multiset</c> object to copy elements from.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered multiset.
|
|
/// <para>The first constructor specifies an empty initial multiset and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered multiset.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_multiset(const concurrent_unordered_multiset& _Uset) : _Mybase(_Uset)
|
|
{
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered multiset.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_multiset</c> object to copy elements from.
|
|
/// </param>
|
|
/// <param name="_Allocator">
|
|
/// The allocator for this unordered multiset.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered multiset.
|
|
/// <para>The first constructor specifies an empty initial multiset and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered multiset.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_multiset(const concurrent_unordered_multiset& _Uset, const allocator_type& _Allocator) : _Mybase(_Uset, _Allocator)
|
|
{
|
|
}
|
|
|
|
/// <summary>
|
|
/// Constructs a concurrent unordered multiset.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_multiset</c> object to move elements from.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// All constructors store an allocator object <paramref name="_Allocator"/> and initialize the unordered multiset.
|
|
/// <para>The first constructor specifies an empty initial multiset and explicitly specifies the number of buckets,
|
|
/// hash function, equality function and allocator type to be used.</para>
|
|
/// <para>The second constructor specifies an allocator for the unordered multiset.</para>
|
|
/// <para>The third constructor specifies values supplied by the iterator range [<paramref name="_Begin"/>, <paramref name="_End"/>).</para>
|
|
/// <para>The fourth and fifth constructors specify a copy of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// <para>The last constructor specifies a move of the concurrent unordered multiset <paramref name="_Uset"/>.</para>
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_multiset(concurrent_unordered_multiset&& _Uset) : _Mybase(std::move(_Uset))
|
|
{
|
|
}
|
|
|
|
/// <summary>
|
|
/// Assigns the contents of another <c>concurrent_unordered_multiset</c> object to this one. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_multiset</c> object.
|
|
/// </param>
|
|
/// <returns>
|
|
/// A reference to this <c>concurrent_unordered_multiset</c> object.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// After erasing any existing elements in a concurrent unordered multiset, <c>operator=</c> either copies or moves the contents of
|
|
/// <paramref name="_Uset"/> into the concurrent unordered multiset.
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_multiset& operator=(const concurrent_unordered_multiset& _Uset)
|
|
{
|
|
_Mybase::operator=(_Uset);
|
|
return (*this);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Assigns the contents of another <c>concurrent_unordered_multiset</c> object to this one. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The source <c>concurrent_unordered_multiset</c> object.
|
|
/// </param>
|
|
/// <returns>
|
|
/// A reference to this <c>concurrent_unordered_multiset</c> object.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// After erasing any existing elements in a concurrent unordered multiset, <c>operator=</c> either copies or moves the contents of
|
|
/// <paramref name="_Uset"/> into the concurrent unordered multiset.
|
|
/// </remarks>
|
|
/**/
|
|
concurrent_unordered_multiset& operator=(concurrent_unordered_multiset&& _Uset)
|
|
{
|
|
_Mybase::operator=(std::move(_Uset));
|
|
return (*this);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_multiset</c> object.
|
|
/// </summary>
|
|
/// <param name="_Value">
|
|
/// The value to be inserted.
|
|
/// </param>
|
|
/// <returns>
|
|
/// An iterator pointing to the insertion location.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// The first member function inserts the element <paramref name="_Value"/> in the controlled sequence, then returns the iterator
|
|
/// that designates the inserted element.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
iterator insert(const value_type& _Value)
|
|
{
|
|
return _Insert(_Value).first;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_multiset</c> object.
|
|
/// </summary>
|
|
/// <param name="_Where">
|
|
/// The starting location to search for an insertion point.
|
|
/// </param>
|
|
/// <param name="_Value">
|
|
/// The value to be inserted.
|
|
/// </param>
|
|
/// <returns>
|
|
/// An iterator pointing to the insertion location.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// The first member function inserts the element <paramref name="_Value"/> in the controlled sequence, then returns the iterator
|
|
/// that designates the inserted element.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
iterator insert(const_iterator _Where, const value_type& _Value)
|
|
{
|
|
// Current implementation ignores the hint. The method is provided for compatibility with unordered_multiset.
|
|
return _Insert(_Value).first;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_multiset</c> object.
|
|
/// </summary>
|
|
/// <typeparam name="_Iterator">
|
|
/// The iterator type used for insertion.
|
|
/// </typeparam>
|
|
/// <param name="_First">
|
|
/// The beginning of the range to insert.
|
|
/// </param>
|
|
/// <param name="_Last">
|
|
/// The end of the range to insert.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// The first member function inserts the element <paramref name="_Value"/> in the controlled sequence, then returns the iterator
|
|
/// that designates the inserted element.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
template<class _Iterator>
|
|
void insert(_Iterator _First, _Iterator _Last)
|
|
{
|
|
_Insert(_First, _Last);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_multiset</c> object.
|
|
/// </summary>
|
|
/// <typeparam name="_Valty">
|
|
/// The type of the value inserted.
|
|
/// </typeparam>
|
|
/// <param name="_Value">
|
|
/// The value to be inserted.
|
|
/// </param>
|
|
/// <returns>
|
|
/// An iterator pointing to the insertion location.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// The first member function inserts the element <paramref name="_Value"/> in the controlled sequence, then returns the iterator
|
|
/// that designates the inserted element.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
template<class _Valty>
|
|
iterator insert(_Valty&& _Value)
|
|
{
|
|
return _Insert(std::forward<_Valty>(_Value)).first;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds elements to the <c>concurrent_unordered_multiset</c> object.
|
|
/// </summary>
|
|
/// <typeparam name="_Valty">
|
|
/// The type of the value inserted.
|
|
/// </typeparam>
|
|
/// <param name="_Where">
|
|
/// The starting location to search for an insertion point.
|
|
/// </param>
|
|
/// <param name="_Value">
|
|
/// The value to be inserted.
|
|
/// </param>
|
|
/// <returns>
|
|
/// An iterator pointing to the insertion location.
|
|
/// </returns>
|
|
/// <remarks>
|
|
/// The first member function inserts the element <paramref name="_Value"/> in the controlled sequence, then returns the iterator
|
|
/// that designates the inserted element.
|
|
/// <para>The second member function returns insert(<paramref name="_Value"/>), using <paramref name="_Where"/> as a starting
|
|
/// place within the controlled sequence to search for the insertion point.</para>
|
|
/// <para>The third member function inserts the sequence of element values from the range [<paramref name="_First"/>,
|
|
/// <paramref name="_Last"/>).</para>
|
|
/// <para>The last two member functions behave the same as the first two, except that <paramref name="_Value"/> is used to
|
|
/// construct the inserted value.</para>
|
|
/// </remarks>
|
|
/**/
|
|
template<class _Valty>
|
|
typename std::tr1::enable_if<!std::tr1::is_same<const_iterator,
|
|
typename std::tr1::remove_reference<_Valty>::type>::value, iterator>::type
|
|
insert(const_iterator _Where, _Valty&& _Value)
|
|
{
|
|
// Current implementation ignores the hint. The method is provided for compatibility with unordered_multiset.
|
|
return _Insert(std::forward<_Valty>(_Value)).first;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Removes elements from the <c>concurrent_unordered_multiset</c> at specified positions. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Where">
|
|
/// The iterator position to erase from.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// The first member function removes the element pointed to by <paramref name="_Where"/>. The second member function removes the elements
|
|
/// in the range [<paramref name="_Begin"/>, <paramref name="_End"/>).
|
|
/// <para>The third member function removes the elements in the range delimited by
|
|
/// <see cref="concurrent_unordered_multiset::equal_range Method"/>(_Keyval).</para>
|
|
/// </remarks>
|
|
/// <returns>
|
|
/// The first two member functions return an iterator that designates the first element remaining beyond any elements removed,
|
|
/// or <see cref="concurrent_unordered_multiset::end Method"/>() if no such element exists. The third member function returns the number
|
|
/// of elements it removes.
|
|
/// </returns>
|
|
/**/
|
|
iterator unsafe_erase(const_iterator _Where)
|
|
{
|
|
return _Mybase::unsafe_erase(_Where);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Removes elements from the <c>concurrent_unordered_multiset</c> at specified positions. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Begin">
|
|
/// The position of the first element in the range of elements to be erased.
|
|
/// </param>
|
|
/// <param name="_End">
|
|
/// The position of the first element beyond the range of elements to be erased.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// The first member function removes the element pointed to by <paramref name="_Where"/>. The second member function removes the elements
|
|
/// in the range [<paramref name="_Begin"/>, <paramref name="_End"/>).
|
|
/// <para>The third member function removes the elements in the range delimited by
|
|
/// <see cref="concurrent_unordered_multiset::equal_range Method"/>(_Keyval).</para>
|
|
/// </remarks>
|
|
/// <returns>
|
|
/// The first two member functions return an iterator that designates the first element remaining beyond any elements removed,
|
|
/// or <see cref="concurrent_unordered_multiset::end Method"/>() if no such element exists. The third member function returns the number
|
|
/// of elements it removes.
|
|
/// </returns>
|
|
/**/
|
|
iterator unsafe_erase(const_iterator _First, const_iterator _Last)
|
|
{
|
|
return _Mybase::unsafe_erase(_First, _Last);
|
|
}
|
|
|
|
|
|
/// <summary>
|
|
/// Removes elements from the <c>concurrent_unordered_multiset</c> at specified positions. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Keyval">
|
|
/// The key value to erase.
|
|
/// </param>
|
|
/// <remarks>
|
|
/// The first member function removes the element pointed to by <paramref name="_Where"/>. The second member function removes the elements
|
|
/// in the range [<paramref name="_Begin"/>, <paramref name="_End"/>).
|
|
/// <para>The third member function removes the elements in the range delimited by
|
|
/// <see cref="concurrent_unordered_multiset::equal_range Method"/>(_Keyval).</para>
|
|
/// </remarks>
|
|
/// <returns>
|
|
/// The first two member functions return an iterator that designates the first element remaining beyond any elements removed,
|
|
/// or <see cref="concurrent_unordered_multiset::end Method"/>() if no such element exists. The third member function returns the number
|
|
/// of elements it removes.
|
|
/// </returns>
|
|
/**/
|
|
size_type unsafe_erase(const key_type& _Keyval)
|
|
{
|
|
return _Mybase::unsafe_erase(_Keyval);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Swaps the contents of two <c>concurrent_unordered_multiset</c> objects. This method is not concurrency-safe.
|
|
/// </summary>
|
|
/// <param name="_Uset">
|
|
/// The <c>concurrent_unordered_multiset</c> object to swap with.
|
|
/// </param>
|
|
/**/
|
|
void swap(concurrent_unordered_multiset& _Uset)
|
|
{
|
|
_Mybase::swap(_Uset);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns the stored hash function object.
|
|
/// </summary>
|
|
/// <returns>
|
|
/// The stored hash function object.
|
|
/// </returns>
|
|
/**/
|
|
hasher hash_function() const
|
|
{
|
|
return _M_comparator._M_hash_object;
|
|
}
|
|
|
|
/// <summary>
|
|
/// The stored equality comparison function object.
|
|
/// </summary>
|
|
/// <returns>
|
|
/// The stored equality comparison function object.
|
|
/// </returns>
|
|
/**/
|
|
key_equal key_eq() const
|
|
{
|
|
return _M_comparator._M_key_compare_object;
|
|
}
|
|
};
|
|
} // namespace Concurrency
|
|
|
|
namespace concurrency = Concurrency;
|
|
|
|
#pragma warning(pop)
|
|
#pragma pack(pop)
|