|
Quick Links: |
Provide an STL-compliant unordered_set container.
More...
Classes | |
| class | bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR > |
Typedefs | |
| typedef KEY | bsl::unordered_set::key_type |
| typedef KEY | bsl::unordered_set::value_type |
| typedef HASH | bsl::unordered_set::hasher |
| typedef EQUAL | bsl::unordered_set::key_equal |
| typedef ALLOCATOR | bsl::unordered_set::allocator_type |
| typedef value_type & | bsl::unordered_set::reference |
| typedef const value_type & | bsl::unordered_set::const_reference |
| typedef AllocatorTraits::size_type | bsl::unordered_set::size_type |
| typedef AllocatorTraits::difference_type | bsl::unordered_set::difference_type |
| typedef AllocatorTraits::pointer | bsl::unordered_set::pointer |
| typedef AllocatorTraits::const_pointer | bsl::unordered_set::const_pointer |
| typedef ::BloombergLP::bslstl::HashTableIterator < const value_type, difference_type > | bsl::unordered_set::iterator |
| typedef ::BloombergLP::bslstl::HashTableBucketIterator < const value_type, difference_type > | bsl::unordered_set::local_iterator |
| typedef iterator | bsl::unordered_set::const_iterator |
| typedef local_iterator | bsl::unordered_set::const_local_iterator |
Functions | |
| bsl::unordered_set::BSLMF_NESTED_TRAIT_DECLARATION_IF (unordered_set,::BloombergLP::bslmf::IsBitwiseMoveable,::BloombergLP::bslmf::IsBitwiseMoveable< HashTable >::value) | |
| bsl::unordered_set::unordered_set () | |
| bsl::unordered_set::unordered_set (size_type initialNumBuckets, const HASH &hashFunction=HASH(), const EQUAL &keyEqual=EQUAL(), const ALLOCATOR &basicAllocator=ALLOCATOR()) | |
| bsl::unordered_set::unordered_set (size_type initialNumBuckets, const HASH &hashFunction, const ALLOCATOR &basicAllocator) | |
| bsl::unordered_set::unordered_set (size_type initialNumBuckets, const ALLOCATOR &basicAllocator) | |
| bsl::unordered_set::unordered_set (const ALLOCATOR &basicAllocator) | |
| bsl::unordered_set::unordered_set (const unordered_set &original) | |
| bsl::unordered_set::unordered_set (BloombergLP::bslmf::MovableRef< unordered_set > original) | |
| bsl::unordered_set::unordered_set (const unordered_set &original, const typename type_identity< ALLOCATOR >::type &basicAllocator) | |
| bsl::unordered_set::unordered_set (BloombergLP::bslmf::MovableRef< unordered_set > original, const typename type_identity< ALLOCATOR >::type &basicAllocator) | |
| template<class INPUT_ITERATOR > | |
| bsl::unordered_set::unordered_set (INPUT_ITERATOR first, INPUT_ITERATOR last, size_type initialNumBuckets=0, const HASH &hashFunction=HASH(), const EQUAL &keyEqual=EQUAL(), const ALLOCATOR &basicAllocator=ALLOCATOR()) | |
| template<class INPUT_ITERATOR > | |
| bsl::unordered_set::unordered_set (INPUT_ITERATOR first, INPUT_ITERATOR last, size_type initialNumBuckets, const HASH &hashFunction, const ALLOCATOR &basicAllocator) | |
| template<class INPUT_ITERATOR > | |
| bsl::unordered_set::unordered_set (INPUT_ITERATOR first, INPUT_ITERATOR last, size_type initialNumBuckets, const ALLOCATOR &basicAllocator) | |
| template<class INPUT_ITERATOR > | |
| bsl::unordered_set::unordered_set (INPUT_ITERATOR first, INPUT_ITERATOR last, const ALLOCATOR &basicAllocator) | |
| bsl::unordered_set::unordered_set (std::initializer_list< KEY > values, size_type initialNumBuckets=0, const HASH &hashFunction=HASH(), const EQUAL &keyEqual=EQUAL(), const ALLOCATOR &basicAllocator=ALLOCATOR()) | |
| bsl::unordered_set::unordered_set (std::initializer_list< KEY > values, size_type initialNumBuckets, const HASH &hashFunction, const ALLOCATOR &basicAllocator) | |
| bsl::unordered_set::unordered_set (std::initializer_list< KEY > values, size_type initialNumBuckets, const ALLOCATOR &basicAllocator) | |
| bsl::unordered_set::unordered_set (std::initializer_list< KEY > values, const ALLOCATOR &basicAllocator) | |
| bsl::unordered_set::~unordered_set () | |
| unordered_set & | bsl::unordered_set::operator= (const unordered_set &rhs) |
| unordered_set &operator=(BloombergLP::bslmf::MovableRef < unordered_set > rhs) BSLS_KEYWORD_NOEXCEPT_SPECIFICATION(AllocatorTraits unordered_set & | bsl::unordered_set::operator= (std::initializer_list< KEY > values) |
| iterator | bsl::unordered_set::begin () BSLS_KEYWORD_NOEXCEPT |
| iterator | bsl::unordered_set::end () BSLS_KEYWORD_NOEXCEPT |
| local_iterator | bsl::unordered_set::begin (size_type index) |
| local_iterator | bsl::unordered_set::end (size_type index) |
| pair< iterator, bool > | bsl::unordered_set::insert (const value_type &value) |
| pair< iterator, bool > | bsl::unordered_set::insert (BloombergLP::bslmf::MovableRef< value_type > value) |
| iterator | bsl::unordered_set::insert (const_iterator hint, const value_type &value) |
| iterator | bsl::unordered_set::insert (const_iterator hint, BloombergLP::bslmf::MovableRef< value_type > value) |
| template<class INPUT_ITERATOR > | |
| void | bsl::unordered_set::insert (INPUT_ITERATOR first, INPUT_ITERATOR last) |
| void | bsl::unordered_set::insert (std::initializer_list< KEY > values) |
| template<class... Args> | |
| pair< iterator, bool > | bsl::unordered_set::emplace (Args &&...arguments) |
| template<class... Args> | |
| iterator | bsl::unordered_set::emplace_hint (const_iterator hint, Args &&...arguments) |
| iterator | bsl::unordered_set::erase (const_iterator position) |
| size_type | bsl::unordered_set::erase (const key_type &key) |
| iterator | bsl::unordered_set::erase (const_iterator first, const_iterator last) |
| template<class LOOKUP_KEY > | |
| enable_if < BloombergLP::bslmf::IsTransparentPredicate < HASH, LOOKUP_KEY >::value &&BloombergLP::bslmf::IsTransparentPredicate < EQUAL, LOOKUP_KEY >::value, iterator >::type | bsl::unordered_set::find (const LOOKUP_KEY &key) |
| iterator | bsl::unordered_set::find (const key_type &key) |
| template<class LOOKUP_KEY > | |
| enable_if < BloombergLP::bslmf::IsTransparentPredicate < HASH, LOOKUP_KEY >::value &&BloombergLP::bslmf::IsTransparentPredicate < EQUAL, LOOKUP_KEY >::value, pair< iterator, iterator > >::type | bsl::unordered_set::equal_range (const LOOKUP_KEY &key) |
| pair< iterator, iterator > | bsl::unordered_set::equal_range (const key_type &key) |
| void | bsl::unordered_set::max_load_factor (float newLoadFactor) |
| void | bsl::unordered_set::rehash (size_type numBuckets) |
| void | bsl::unordered_set::reserve (size_type numElements) |
| ALLOCATOR | bsl::unordered_set::get_allocator () const BSLS_KEYWORD_NOEXCEPT |
| const_iterator | bsl::unordered_set::begin () const BSLS_KEYWORD_NOEXCEPT |
| const_iterator | bsl::unordered_set::end () const BSLS_KEYWORD_NOEXCEPT |
| const_iterator | bsl::unordered_set::cbegin () const BSLS_KEYWORD_NOEXCEPT |
| const_iterator | bsl::unordered_set::cend () const BSLS_KEYWORD_NOEXCEPT |
| bool | bsl::unordered_set::contains (const key_type &key) const |
| template<class LOOKUP_KEY > | |
| enable_if < BloombergLP::bslmf::IsTransparentPredicate < HASH, LOOKUP_KEY >::value &&BloombergLP::bslmf::IsTransparentPredicate < EQUAL, LOOKUP_KEY >::value, bool >::type | bsl::unordered_set::contains (const LOOKUP_KEY &key) const |
| bool | bsl::unordered_set::empty () const BSLS_KEYWORD_NOEXCEPT |
| size_type | bsl::unordered_set::size () const BSLS_KEYWORD_NOEXCEPT |
| size_type | bsl::unordered_set::max_size () const BSLS_KEYWORD_NOEXCEPT |
| EQUAL | bsl::unordered_set::key_eq () const |
| HASH | bsl::unordered_set::hash_function () const |
| template<class LOOKUP_KEY > | |
| enable_if < BloombergLP::bslmf::IsTransparentPredicate < HASH, LOOKUP_KEY >::value &&BloombergLP::bslmf::IsTransparentPredicate < EQUAL, LOOKUP_KEY >::value, const_iterator >::type | bsl::unordered_set::find (const LOOKUP_KEY &key) const |
| const_iterator | bsl::unordered_set::find (const key_type &key) const |
| template<class LOOKUP_KEY > | |
| enable_if < BloombergLP::bslmf::IsTransparentPredicate < HASH, LOOKUP_KEY >::value &&BloombergLP::bslmf::IsTransparentPredicate < EQUAL, LOOKUP_KEY >::value, size_type >::type | bsl::unordered_set::count (const LOOKUP_KEY &key) const |
| size_type | bsl::unordered_set::count (const key_type &key) const |
| template<class LOOKUP_KEY > | |
| enable_if < BloombergLP::bslmf::IsTransparentPredicate < HASH, LOOKUP_KEY >::value &&BloombergLP::bslmf::IsTransparentPredicate < EQUAL, LOOKUP_KEY >::value, pair< const_iterator, const_iterator > >::type | bsl::unordered_set::equal_range (const LOOKUP_KEY &key) const |
| pair< const_iterator, const_iterator > | bsl::unordered_set::equal_range (const key_type &key) const |
| size_type | bsl::unordered_set::bucket_count () const BSLS_KEYWORD_NOEXCEPT |
| size_type | bsl::unordered_set::max_bucket_count () const BSLS_KEYWORD_NOEXCEPT |
| size_type | bsl::unordered_set::bucket_size (size_type index) const |
| size_type | bsl::unordered_set::bucket (const key_type &key) const |
| const_local_iterator | bsl::unordered_set::begin (size_type index) const |
| const_local_iterator | bsl::unordered_set::end (size_type index) const |
| const_local_iterator | bsl::unordered_set::cbegin (size_type index) const |
| const_local_iterator | bsl::unordered_set::cend (size_type index) const |
| float | bsl::unordered_set::load_factor () const BSLS_KEYWORD_NOEXCEPT |
| float | bsl::unordered_set::max_load_factor () const BSLS_KEYWORD_NOEXCEPT |
| template<class KEY , class HASH , class EQUAL , class ALLOCATOR > | |
| bool | bsl::operator== (const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > &lhs, const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > &rhs) |
| template<class KEY , class HASH , class EQUAL , class ALLOCATOR > | |
| bool | bsl::operator!= (const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > &lhs, const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > &rhs) |
| template<class KEY , class HASH , class EQUAL , class ALLOCATOR , class PREDICATE > | |
| unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::size_type | bsl::erase_if (unordered_set< KEY, HASH, EQUAL, ALLOCATOR > &s, PREDICATE predicate) |
| template<class KEY , class HASH , class EQUAL , class ALLOCATOR > | |
| void | bsl::swap (unordered_set< KEY, HASH, EQUAL, ALLOCATOR > &a, unordered_set< KEY, HASH, EQUAL, ALLOCATOR > &b) BSLS_KEYWORD_NOEXCEPT_SPECIFICATION(BSLS_KEYWORD_NOEXCEPT_OPERATOR(a.swap(b))) |
Variables | |
| void swap(unordered_set &other) BSLS_KEYWORD_NOEXCEPT_SPECIFICATION(AllocatorTraits void | bsl::unordered_set::clear () BSLS_KEYWORD_NOEXCEPT |
Friends | |
| template<class KEY2 , class HASH2 , class EQUAL2 , class ALLOCATOR2 > | |
| bool | bsl::unordered_set::operator== (const unordered_set< KEY2, HASH2, EQUAL2, ALLOCATOR2 > &, const unordered_set< KEY2, HASH2, EQUAL2, ALLOCATOR2 > &) |
unordered_set container. | bsl::unordered_set | STL-compliant unordered_set container |
bsl::unordered_set, implementing the standard container holding a collection of unique keys with no guarantees on ordering. unordered_set is an allocator-aware, value-semantic type whose salient attributes are its size (number of keys) and the set of keys the unordered_set contains, without regard to their order. If unordered_set is instantiated with a key type that is not itself value-semantic, then it will not retain all of its value-semantic qualities. In particular, if the key type cannot be tested for equality, then an unordered_set containing that type cannot be tested for equality. It is even possible to instantiate unordered_set with a key type that does not have an accessible copy-constructor, in which case the unordered_set will not be copyable. Note that the equality operator for each element is used to determine when two unordered_set objects have the same value, and not the equality comparator supplied at construction. unordered_set meets the requirements of an unordered associative container with forward iterators in the C++11 standard [unord]. The unordered_set implemented here adheres to the C++11 standard, except that it may rehash when setting the max_load_factor in order to preserve the property that the value is always respected (which is a potentially throwing operation). unordered_set instantiation is a fully Value-Semantic Type (see bsldoc_glossary) only if the supplied KEY template parameters is fully value-semantic. It is possible to instantiate an unordered_set with KEY parameter arguments that do not provide a full set of value-semantic operations, but then some methods of the container may not be instantiable. The following terminology, adopted from the C++11 standard, is used in the function documentation of unordered_set to describe a function's requirements for the KEY template parameter. These terms are also defined in section [utility.arg.requirements] of the C++11 standard. Note that, in the context of an unordered_set instantiation, the requirements apply specifically to the unordered_sets element type, value_type, which is an alias for KEY. Legend ------ 'X' - denotes an allocator-aware container type (e.g., 'unordered_set') 'T' - 'value_type' associated with 'X' 'A' - type of the allocator used by 'X' 'm' - lvalue of type 'A' (allocator) 'p' - address ('T *') of uninitialized storage for a 'T' within an 'X' 'rv' - rvalue of type (non-'const') 'T' 'v' - rvalue or lvalue of type (possibly 'const') 'T' 'args' - 0 or more arguments
T has a default constructor. More precisely, T is default-insertable into X means that the following expression is well-formed: allocator_traits<A>construct(m, p)T provides a constructor that takes an rvalue of type (non-'const') T. More precisely, T is move-insertable into X means that the following expression is well-formed: allocator_traits<A>construct(m, p, rv)T provides a constructor that takes an lvalue or rvalue of type (possibly const) T. More precisely, T is copy-insertable into X means that the following expression is well-formed: allocator_traits<A>construct(m, p, v)T provides an assignment operator that takes an rvalue of type (non-'const') T.T provides an assignment operator that takes an lvalue or rvalue of type (possibly const) T.T is emplace-constructible into X from args means that the following expression is well-formed: allocator_traits<A>construct(m, p, args)T provides a destructor. More precisely, T is erasable from X means that the following expression is well-formed: allocator_traits<A>destroy(m, p)HASH and EQUAL must be copy-constructible function-objects. Note that this requirement is somewhat stronger than the requirement currently in the standard; see the discussion for Issue 2215 (http://cplusplus.github.com/LWG/lwg-active.html#2215); HASH shall support a function call operator compatible with the following statements: HASH hash; KEY key; std::size_t result = hash(key);
bslstl_hash|Standard Hash Function. EQUAL shall support the a function call operator compatible with the following statements: EQUAL equal;
KEY key1, key2;
bool result = equal(key1, key2);
HASH and EQUAL function-objects are further constrained, such for any two objects whose keys compare equal by the comparator, shall produce the same value from the hasher. ALLOCATOR template parameter determines how that set will allocate memory. The unordered_set template supports allocators meeting the requirements of the C++11 standard [allocator.requirements], and in addition it supports scoped-allocators derived from the bslma::Allocator memory allocation protocol. Clients intending to use bslma style allocators should use the template's default ALLOCATOR type: The default type for the ALLOCATOR template parameter, bsl::allocator, provides a C++11 standard-compatible adapter for a bslma::Allocator object. ALLOCATOR type of an unordered_set instantiation is bsl::allocator, then objects of that set type will conform to the standard behavior of a bslma-allocator-enabled type. Such a set accepts an optional bslma::Allocator argument at construction. If the address of a bslma::Allocator object is explicitly supplied at construction, it will be used to supply memory for the unordered_set throughout its lifetime; otherwise, the unordered_set will use the default allocator installed at the time of the unordered_sets construction (see bslma_default). In addition to directly allocating memory from the indicated bslma::Allocator, an unordered_set supplies that allocator's address to the constructors of contained objects of the parameterized KEY types with the bslalg::TypeTraitUsesBslmaAllocator trait. unordered_set: Legend ------ 'K' - parameterized 'KEY' type of the unordered set 'a', 'b' - two distinct objects of type 'unordered_set<K>' 'rv' - modifiable rvalue of type 'unordered_set<K>' 'n', 'm' - number of elements in 'a' and 'b' respectively 'w' - number of buckets of 'a' 'value_type' - unordered_set<K>::value_type 'c' - comparator providing an ordering for objects of type 'K' 'al - an STL-style memory allocator 'i1', 'i2' - two iterators defining a sequence of 'value_type' objects 'k' - an object of type 'K' 'rk' - modifiable rvalue of type 'K' 'v' - an object of type 'value_type' 'p1', 'p2' - two iterators belonging to 'a' distance(i1,i2) - the number of elements in the range [i1, i2) distance(p1,p2) - the number of elements in the range [p1, p2) +----------------------------------------------------+--------------------+ | Operation | Complexity | +====================================================+====================+ | unordered_set<K> a; (default construction) | O[1] | | unordered_set<K> a(al); | | +----------------------------------------------------+--------------------+ | unordered_set<K> a(b); (copy construction) | Average: O[n] | | unordered_set<K> a(b, al); | Worst: O[n^2] | +----------------------------------------------------+--------------------+ | set<K> a(rv); (move construction) | O[1] if 'a' and | | set<K> a(rv, al); | 'rv' use the same | | | allocator; | | | otherwise, | | | Average: O[n] | | | Worst: O[n^2] | +----------------------------------------------------+--------------------+ | unordered_set<K> a(w); | O[n] | | unordered_set<K> a(w, hf); | | | unordered_set<K> a(w, hf, eq); | | | unordered_set<K> a(w, hf, eq, al); | | +----------------------------------------------------+--------------------+ | unordered_set<K> a(i1, i2); | Average: O[N] | | unordered_set<K> a(i1, i2, w) | Worst: O[N^2] | | unordered_set<K> a(i1, i2, w, hf); | where N = | | unordered_set<K> a(i1, i2, w, hf, eq); | distance(i1, i2)] | | unordered_set<K> a(i1, i2, w, hf, eq, al); | | | | | +----------------------------------------------------+--------------------+ | a.~unordered_set<K>(); (destruction) | O[n] | +----------------------------------------------------+--------------------+ | a = b; (assignment) | Average: O[n] | | | Worst: O[n^2] | +----------------------------------------------------+--------------------+ | a = rv; (move assignment) | O[1] if 'a' and | | | 'rv' use the same | | | allocator; | | | otherwise, | | | Average: O[n] | | | Worst: O[n^2] | +----------------------------------------------------+--------------------+ | a.begin(), a.end(), a.cbegin(), a.cend(), | O[1] | +----------------------------------------------------+--------------------+ | a == b, a != b | Best: O[n] | | | Worst: O[n^2] | +----------------------------------------------------+--------------------+ | a.swap(b), swap(a, b) | O[1] | +----------------------------------------------------+--------------------+ | a.key_eq() | O[1] | +----------------------------------------------------+--------------------+ | a.hash_function() | O[1] | +----------------------------------------------------+--------------------+ | a.size() | O[1] | +----------------------------------------------------+--------------------+ | a.max_size() | O[1] | +----------------------------------------------------+--------------------+ | a.empty() | O[1] | +----------------------------------------------------+--------------------+ | a.get_allocator() | O[1] | +----------------------------------------------------+--------------------+ | a.insert(v) | Average: O[1] | | a.insert(rk) | Worst: O[n] | | a.emplace(Args&&...) | | +----------------------------------------------------+--------------------+ | a.insert(p1, v) | Average: O[1] | | a.insert(p1, rk) | Worst: O[n] | | a.emplace_hint(p1, Args&&...) | | +----------------------------------------------------+--------------------+ | a.insert(i1, i2) | Average O[ | | | distance(i1, i2)]| | | Worst: O[ n * | | | distance(i1, i2)]| +----------------------------------------------------+--------------------+ | a.erase(p1) | Average: O[1] | | | Worst: O[n] | +----------------------------------------------------+--------------------+ | a.erase(k) | Average: O[ | | | a.count(k)]| | | Worst: O[n] | +----------------------------------------------------+--------------------+ | a.erase(p1, p2) | Average: O[ | | | distance(p1, p2)]| | | Worst: O[n] | +----------------------------------------------------+--------------------+ | a.clear() | O[n] | +----------------------------------------------------+--------------------+ | a.contains(k) | Average: O[1] | | | Worst: O[n] | +----------------------------------------------------+--------------------+ | a.find(k) | Average: O[1] | | | Worst: O[n] | +----------------------------------------------------+--------------------+ | a.count(k) | Average: O[1] | | | Worst: O[n] | +----------------------------------------------------+--------------------+ | a.equal_range(k) | Average: O[ | | | a.count(k)]| | | Worst: O[n] | +----------------------------------------------------+--------------------+ | a.bucket_count() | O[1] | +----------------------------------------------------+--------------------+ | a.max_bucket_count() | O[1] | +----------------------------------------------------+--------------------+ | a.bucket(k) | O[1] | +----------------------------------------------------+--------------------+ | a.bucket_size(k) | O[a.bucket_size(k)]| +----------------------------------------------------+--------------------+ | a.load_factor() | O[1] | +----------------------------------------------------+--------------------+ | a.max_load_factor() | O[1] | | a.max_load_factor(z) | O[1] | +----------------------------------------------------+--------------------+ | a.rehash(k) | Average: O[n] | | | Worst: O[n^2] | +----------------------------------------------------+--------------------+ | a.reserve(k) | Average: O[n] | | | Worst: O[n^2] | +----------------------------------------------------+--------------------+
unordered_set invalidates a pointer or reference to an element in the set, unless it also erases that element, such as any erase overload, clear, or the destructor (that erases all elements). Pointers and references are stable through a rehash. insert or emplace call if it triggers a rehash (but not otherwise). Iterators to specific elements are also invalidated when that element is erased. Note that the end iterator is not an iterator referring to any element in the container, so may be invalidated by any non-'const' method. bslstl_unorderedset are identical to those of bslstl_unorderedmap. See the discussion in bslstl_unorderedmap|Unordered Map Configuration and the illustrative material in bslstl_unorderedmap|Example 2. bslstl_unorderedmap|Practical Requirements on HASH. typedef enum { REPEAT , DISCOUNT , IMPULSE , NEED_BASED , BUSINESS , NON_PROFIT , INSTITUTE // ... } CustomerCode; typedef enum { USA_EAST , USA_WEST , CANADA , MEXICO , ENGLAND , SCOTLAND , FRANCE , GERMANY , RUSSIA // ... } LocationCode; typedef enum { TOAST , GREEN , FAST , TIDY , PEARL , SMITH // ... } ProjectCode;
static const char *toAscii(CustomerCode value) { switch (value) { case REPEAT: return "REPEAT"; case DISCOUNT: return "DISCOUNT"; case IMPULSE: return "IMPULSE"; case NEED_BASED: return "NEED_BASED"; case BUSINESS: return "BUSINESS"; case NON_PROFIT: return "NON_PROFIT"; case INSTITUTE: return "INSTITUTE"; // ... default: return "(* UNKNOWN *)"; } } static const char *toAscii(LocationCode value) { ... } static const char *toAscii(ProjectCode value) { ... }
static const struct CustomerProfile { CustomerCode d_customer; LocationCode d_location; ProjectCode d_project; } customerProfiles[] = { { IMPULSE , CANADA , SMITH }, { NON_PROFIT, USA_EAST, GREEN }, ... { INSTITUTE , USA_EAST, TOAST }, { NON_PROFIT, ENGLAND , FAST }, { NON_PROFIT, USA_WEST, TIDY }, { REPEAT , MEXICO , TOAST }, }; const int numCustomerProfiles = sizeof customerProfiles / sizeof *customerProfiles;
CustomerProfileHash and CustomerProfileEqual classes, each a stateless functor. Note that there is no meaningful ordering of the attribute values, they are merely arbitrary code numbers; nothing is lost by using an unordered set instead of an ordered set: class CustomerProfileHash { public: // CREATORS // Create a 'CustomerProfileHash' object. // Create a 'CustomerProfileHash' object. Note that as // 'CustomerProfileHash' is an empty (stateless) type, this // operation has no observable effect. // Destroy this object. // ACCESSORS std::size_t operator()(CustomerProfile x) const; // Return a hash value computed using the specified 'x'. };
int value) into a single, unique int value, and then applying the default hash function for int. See Practical Requirements on HASH. // ACCESSORS std::size_t CustomerProfileHash::operator()(CustomerProfile x) const { return bsl::hash<int>()(x.d_location * 100 * 100 + x.d_customer * 100 + x.d_project); } class CustomerProfileEqual { public: // CREATORS // Create a 'CustomerProfileEqual' object. // Create a 'CustomerProfileEqual' object. Note that as // 'CustomerProfileEqual' is an empty (stateless) type, this // operation has no observable effect. // Destroy this object. // ACCESSORS bool operator()(const CustomerProfile& lhs, const CustomerProfile& rhs) const; // Return 'true' if the specified 'lhs' have the same value as the // specified 'rhs', and 'false' otherwise. }; // ACCESSORS bool CustomerProfileEqual::operator()(const CustomerProfile& lhs, const CustomerProfile& rhs) const { return lhs.d_location == rhs.d_location && lhs.d_customer == rhs.d_customer && lhs.d_project == rhs.d_project; }
= default comment.) typedef bsl::unordered_set<CustomerProfile, CustomerProfileHash, CustomerProfileEqual> ProfileCategories; typedef ProfileCategories::const_iterator ProfileCategoriesConstItr;
data. ProfileCategories profileCategories; for (int idx = 0; idx < numCustomerProfiles; ++idx) { profileCategories.insert(customerProfiles[idx]); } assert(numCustomerProfiles >= profileCategories.size());
insert method. We fully expect some operations to fail. profileCategories matches the number of unique customer profiles in this data set. printf("%d %d\n", numCustomerProfiles, profileCategories.size());
100 84
toAscii functions defined earlier to make the output comprehensible: for (ProfileCategoriesConstItr itr = profileCategories.begin(), end = profileCategories.end(); end != itr; ++itr) { printf("%-10s %-8s %-5s\n", toAscii(itr->d_customer), toAscii(itr->d_location), toAscii(itr->d_project)); }
NON_PROFIT ENGLAND FAST DISCOUNT CANADA TIDY IMPULSE USA_WEST GREEN ... DISCOUNT USA_EAST GREEN DISCOUNT MEXICO SMITH
typedef KEY bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::key_type [inherited] |
typedef KEY bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::value_type [inherited] |
typedef HASH bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::hasher [inherited] |
typedef EQUAL bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::key_equal [inherited] |
typedef ALLOCATOR bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::allocator_type [inherited] |
typedef value_type& bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::reference [inherited] |
typedef const value_type& bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::const_reference [inherited] |
typedef AllocatorTraits::size_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::size_type [inherited] |
typedef AllocatorTraits::difference_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::difference_type [inherited] |
typedef AllocatorTraits::pointer bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::pointer [inherited] |
typedef AllocatorTraits::const_pointer bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::const_pointer [inherited] |
typedef ::BloombergLP::bslstl::HashTableIterator< const value_type, difference_type> bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::iterator [inherited] |
typedef ::BloombergLP::bslstl::HashTableBucketIterator< const value_type, difference_type> bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::local_iterator [inherited] |
typedef iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::const_iterator [inherited] |
typedef local_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::const_local_iterator [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::BSLMF_NESTED_TRAIT_DECLARATION_IF | ( | unordered_set< KEY, HASH, EQUAL, ALLOCATOR > | , | |
| ::BloombergLP::bslmf::IsBitwiseMoveable | , | |||
| ::BloombergLP::bslmf::IsBitwiseMoveable< HashTable >::value | ||||
| ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | size_type | initialNumBuckets, | |
| const HASH & | hashFunction = HASH(), |
|||
| const EQUAL & | keyEqual = EQUAL(), |
|||
| const ALLOCATOR & | basicAllocator = ALLOCATOR() | |||
| ) | [explicit, inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | size_type | initialNumBuckets, | |
| const HASH & | hashFunction, | |||
| const ALLOCATOR & | basicAllocator | |||
| ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | size_type | initialNumBuckets, | |
| const ALLOCATOR & | basicAllocator | |||
| ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | const ALLOCATOR & | basicAllocator | ) | [explicit, inherited] |
Create an empty unordered set. Optionally specify an initialNumBuckets indicating the initial size of the array of buckets of this container. If initialNumBuckets is not supplied, a single bucket is used. Optionally specify a hashFunction used to generate the hash values for the keys contained in this set. If hashFunction is not supplied, a default-constructed object of the (template parameter) type HASH is used. Optionally specify a key-equality functor keyEqual used to verify that two key are equivalent. If keyEqual is not supplied, a default-constructed object of the (template parameter) type EQUAL is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied, a default-constructed object of the (template parameter) type ALLOCATOR is used. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used to supply memory. Note that a bslma::Allocator * can be supplied for basicAllocator if the type ALLOCATOR is bsl::allocator (the default).
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | original | ) | [inherited] |
Create an unordered set having the same value as the specified original object. Use a copy of original.hash_function() to generate hash values for the keys contained in this set. Use a copy of original.key_eq() to verify that two keys are equivalent. Use the allocator returned by 'bslallocator_traits<ALLOCATOR>:: select_on_container_copy_construction(original.get_allocator())' to allocate memory. This method requires that the (template parameter) type KEY be copy-insertable into this set (see Requirements on KEY).
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | BloombergLP::bslmf::MovableRef< unordered_set< KEY, HASH, EQUAL, ALLOCATOR > > | original | ) | [inherited] |
Create an unordered set having the same value as the specified original object by moving (in constant time) the contents of original to the new set. Use a copy of original.hash_function() to generate hash values for the keys contained in this set. Use a copy of original.key_eq() to verify that two keys are equivalent. The allocator associated with original is propagated for use in the newly-created set. original is left in a valid but unspecified state.
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | original, | |
| const typename type_identity< ALLOCATOR >::type & | basicAllocator | |||
| ) | [inherited] |
Create an unordered set having the same value as the specified original object that uses the specified basicAllocator to supply memory. Use a copy of original.hash_function() to generate hash values for the keys contained in this set. Use a copy of original.key_eq() to verify that two keys are equivalent. This method requires that the (template parameter) type KEY be copy-insertable into this set (see Requirements on KEY). Note that a bslma::Allocator * can be supplied for basicAllocator if the (template parameter) type ALLOCATOR is bsl::allocator (the default).
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | BloombergLP::bslmf::MovableRef< unordered_set< KEY, HASH, EQUAL, ALLOCATOR > > | original, | |
| const typename type_identity< ALLOCATOR >::type & | basicAllocator | |||
| ) | [inherited] |
Create an unordered set having the same value as the specified original object that uses the specified basicAllocator to supply memory. The contents of original are moved (in constant time) to the new set if basicAllocator == original.get_allocator(), and are move-inserted (in linear time) using basicAllocator otherwise. original is left in a valid but unspecified state. Use a copy of original.hash_function() to generate hash values for the keys contained in this set. Use a copy of original.key_eq() to verify that two keys are equivalent. This method requires that the (template parameter) type KEY be move-insertable (see Requirements on KEY). Note that a bslma::Allocator * can be supplied for basicAllocator if the (template parameter) type ALLOCATOR is bsl::allocator (the default).
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | INPUT_ITERATOR | first, | |
| INPUT_ITERATOR | last, | |||
| size_type | initialNumBuckets = 0, |
|||
| const HASH & | hashFunction = HASH(), |
|||
| const EQUAL & | keyEqual = EQUAL(), |
|||
| const ALLOCATOR & | basicAllocator = ALLOCATOR() | |||
| ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | INPUT_ITERATOR | first, | |
| INPUT_ITERATOR | last, | |||
| size_type | initialNumBuckets, | |||
| const HASH & | hashFunction, | |||
| const ALLOCATOR & | basicAllocator | |||
| ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | INPUT_ITERATOR | first, | |
| INPUT_ITERATOR | last, | |||
| size_type | initialNumBuckets, | |||
| const ALLOCATOR & | basicAllocator | |||
| ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | INPUT_ITERATOR | first, | |
| INPUT_ITERATOR | last, | |||
| const ALLOCATOR & | basicAllocator | |||
| ) | [inherited] |
Create an unordered set, and insert each value_type object in the sequence starting at the specified first element, and ending immediately before the specified last element, ignoring those keys having a value equivalent to that which appears earlier in the sequence. Optionally specify an initialNumBuckets indicating the initial size of the array of buckets of this container. If initialNumBuckets is not supplied, a single bucket is used. Optionally specify a hashFunction used to generate hash values for the keys contained in this set. If hashFunction is not supplied, a default-constructed object of (template parameter) type HASH is used. Optionally specify a key-equality functor keyEqual used to verify that two key values are the same. If keyEqual is not supplied, a default-constructed object of (template parameter) type EQUAL is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied, a default-constructed object of the (template parameter) type ALLOCATOR is used. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used to supply memory. The (template parameter) type INPUT_ITERATOR shall meet the requirements of an input iterator defined in the C++11 standard [24.2.3] providing access to values of a type convertible to value_type, and value_type must be emplace-constructible from *i into this unordered set, where i is a dereferenceable iterator in the range [first .. last) (see Requirements on KEY). The behavior is undefined unless first and last refer to a sequence of valid values where first is at a position at or before last. Note that a bslma::Allocator * can be supplied for basicAllocator if the type ALLOCATOR is bsl::allocator (the default).
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | std::initializer_list< KEY > | values, | |
| size_type | initialNumBuckets = 0, |
|||
| const HASH & | hashFunction = HASH(), |
|||
| const EQUAL & | keyEqual = EQUAL(), |
|||
| const ALLOCATOR & | basicAllocator = ALLOCATOR() | |||
| ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | std::initializer_list< KEY > | values, | |
| size_type | initialNumBuckets, | |||
| const HASH & | hashFunction, | |||
| const ALLOCATOR & | basicAllocator | |||
| ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | std::initializer_list< KEY > | values, | |
| size_type | initialNumBuckets, | |||
| const ALLOCATOR & | basicAllocator | |||
| ) | [inherited] |
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::unordered_set | ( | std::initializer_list< KEY > | values, | |
| const ALLOCATOR & | basicAllocator | |||
| ) | [inherited] |
Create an unordered set and insert each value_type object in the specified values initializer list, ignoring those keys having a value equivalent to that which appears earlier in the list. Optionally specify an initialNumBuckets indicating the initial size of the array of buckets of this container. If initialNumBuckets is not supplied, a single bucket is used. Optionally specify a hashFunction used to generate the hash values for the keys contained in this set. If hashFunction is not supplied, a default-constructed object of the (template parameter) type HASH is used. Optionally specify a key-equality functor keyEqual used to verify that two keys are equivalent. If keyEqual is not supplied, a default-constructed object of the (template parameter) type EQUAL is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied, a default-constructed object of the (template parameter) type ALLOCATOR is used. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used to supply memory. This method requires that the (template parameter) type KEY be copy-constructible (see Requirements on KEY). Note that a bslma::Allocator * can be supplied for basicAllocator if the type ALLOCATOR is bsl::allocator (the default).
| bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::~unordered_set | ( | ) | [inherited] |
Destroy this object.
| unordered_set& bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::operator= | ( | const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | rhs | ) | [inherited] |
Assign to this object the value, hash function, and equality comparator of the specified rhs object, propagate to this object the allocator of rhs if the ALLOCATOR type has trait propagate_on_container_copy_assignment, and return a reference providing modifiable access to this object. If an exception is thrown, *this is left in a valid but unspecified state. This method requires that the (template parameter) type KEY be copy-assignable and 'copy-insertable" into this set (see
<A CLASS="el" HREF="group__bslstl__unorderedset.html::requirements_on_key">Requirements on KEY).
| unordered_set& operator= (BloombergLP::bslmf::MovableRef<unordered_set> rhs) BSLS_KEYWORD_NOEXCEPT_SPECIFICATION( AllocatorTraits unordered_set& bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::operator= | ( | std::initializer_list< KEY > | values | ) | [inherited] |
< Assign to this object the value, hash function, and equality comparator of the specified rhs object, propagate to this object the allocator of rhs if the ALLOCATOR type has trait propagate_on_container_move_assignment, and return a reference providing modifiable access to this object. The contents of rhs are moved (in constant time) to this set if get_allocator() == rhs.get_allocator() (after accounting for the aforementioned trait); otherwise, all elements in this set are either destroyed or move-assigned to and each additional element in rhs is move-inserted into this set. rhs is left in a valid but unspecified state, and if an exception is thrown, *this is left in a valid but unspecified state. This method requires that the (template parameter) type KEY be both move-assignable and move-insertable into this set (see Requirements on KEY). Assign to this object the value resulting from first clearing this unordered set and then inserting each value_type object in the specified values initializer list, ignoring those keys having a value equivalent to that which appears earlier in the list; return a reference providing modifiable access to this object. This method requires that the (template parameter) type KEY type be copy-insertable into this set (see Requirements on KEY).
| iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::begin | ( | ) | [inherited] |
Return an iterator providing modifiable access to the first value_type object (in the sequence of value_type objects) maintained by this set, or the end iterator if this set is empty.
| iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::end | ( | ) | [inherited] |
Return an iterator providing modifiable access to the past-the-end element in the sequence of value_type objects maintained by this unordered set.
Referenced by bsl::unordered_set< Rule, RuleHash >::contains().
| local_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::begin | ( | size_type | index | ) | [inherited] |
Return a local iterator providing modifiable access to the first value_type object in the sequence of value_type objects of the bucket having the specified index, in the array of buckets maintained by this set, or the end(index) otherwise.
| local_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::end | ( | size_type | index | ) | [inherited] |
Return a local iterator providing modifiable access to the past-the-end element in the sequence of value_type objects of the bucket having the specified indexs, in the array of buckets maintained by this set.
| pair<iterator, bool> bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::insert | ( | const value_type & | value | ) | [inherited] |
Insert the specified value into this set if a key equivalent to value does not already exist in this set; otherwise, if a key equivalent to value already exists in this set, this method has no effect. Return a pair whose first member is an iterator referring to the (possibly newly inserted) value_type object in this set that is equivalent to value, and whose second member is true if a new value was inserted, and false if the key was already present. This method requires that the (template parameter) type KEY be copy-insertable (see Requirements on KEY).
| pair<iterator, bool> bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::insert | ( | BloombergLP::bslmf::MovableRef< value_type > | value | ) | [inherited] |
Insert the specified value into this set if a key equivalent to value does not already exist in this set; otherwise, if a key equivalent to value already exists in this set, this method has no effect. value is left in a valid but unspecified state. Return a pair whose first member is an iterator referring to the (possibly newly inserted) value_type object in this set that is equivalent to value, and whose second member is true if a new value was inserted, and false if the key was already present. This method requires that the (template parameter) type KEY be move-insertable into this set (see Requirements on KEY).
| iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::insert | ( | const_iterator | hint, | |
| const value_type & | value | |||
| ) | [inherited] |
Insert the specified value into this set if a key equivalent to value does not already exist in this set; otherwise, if a key equivalent to value already exists in this set, this method has no effect. Return an iterator referring to the (possibly newly inserted) value_type object in this set that is equivalent to value. The average and worst case complexity of this operation is not affected by the specified hint. This method requires that the (template parameter) type KEY be copy-constructible into this set (see Requirements on KEY). The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included). Note that hint is ignored (other than possibly asserting its validity in some build modes).
| iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::insert | ( | const_iterator | hint, | |
| BloombergLP::bslmf::MovableRef< value_type > | value | |||
| ) | [inherited] |
Insert the specified value into this set if a key equivalent to value does not already exist in this set; otherwise, if a key equivalent to value already exists in this set, this method has no effect. value is left in a valid but unspecified state. Return an iterator referring to the (possibly newly inserted) value_type object in this set that is equivalent to value. The average and worst case complexity of this operation is not affected by the specified hint. This method requires that the (template parameter) type KEY be move-insertable (see Requirements on KEY) into this set. The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included). Note that hint is ignored (other than possibly asserting its validity in some build modes).
| void bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::insert | ( | INPUT_ITERATOR | first, | |
| INPUT_ITERATOR | last | |||
| ) | [inherited] |
Insert into this set the value of each value_type object in the range starting at the specified first iterator and ending immediately before the specified last iterator, if a key equivalent to the object is not already contained in this set. The (template parameter) type INPUT_ITERATOR shall meet the requirements of an input iterator defined in the C++11 standard [24.2.3] providing access to values of a type convertible to value_type, and value_type must be emplace-constructible from *i into this set, where i is a dereferenceable iterator in the range [first .. last) (see Requirements on KEY). The behavior is undefined unless first and last refer to a sequence of valid values where first is at a position at or before last.
| void bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::insert | ( | std::initializer_list< KEY > | values | ) | [inherited] |
Insert into this set the value of each value_type object in the specified values initializer list if a key equivalent to the object is not already contained in this set. This method requires that the (template parameter) type KEY be copy-insertable (see Requirements on KEY).
| pair<iterator, bool> bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::emplace | ( | Args &&... | arguments | ) | [inherited] |
Insert into this unordered set a newly created value_type object, constructed by forwarding get_allocator() (if required) and the specified (variable number of) arguments to the corresponding constructor of value_type, if a key equivalent to such a value does not already exist in this set; otherwise, this method has no effect (other than possibly creating a temporary value_type object). Return a pair whose first member is an iterator referring to the (possibly newly created and inserted) object in this set whose value is equivalent to that of an object constructed from arguments, and whose second member is true if a new value was inserted, and false if an equivalent key was already present. This method requires that the (template parameter) type KEY be emplace-constructible into this set from arguments (see Requirements on KEY).
| iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::emplace_hint | ( | const_iterator | hint, | |
| Args &&... | arguments | |||
| ) | [inherited] |
Insert into this unordered set a newly created value_type object, constructed by forwarding get_allocator() (if required) and the specified (variable number of) arguments to the corresponding constructor of value_type, if a key equivalent to such a value does not already exists in this set; otherwise, this method has no effect (other than possibly creating a temporary value_type object). Return an iterator referring to the (possibly newly created and inserted) object in this set whose value is equivalent to that of an object constructed from arguments. The average and worst case complexity of this operation is not affected by the specified hint. This method requires that the (template parameter) type KEY be emplace-constructible into this set from arguments (see Requirements on KEY). The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included). Note that hint is ignored (other than possibly asserting its validity in some build modes).
| iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::erase | ( | const_iterator | position | ) | [inherited] |
Remove from this unordered set the value_type object at the specified position, and return an iterator referring to the element immediately following the removed element, or to the past-the-end position if the removed element was the last element in the sequence of elements maintained by this set. This method invalidates only iterators and references to the removed element and previously saved values of the end() iterator, and preserves the relative order of the elements not removed. The behavior is undefined unless position refers to a value_type object in this unordered set.
| size_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::erase | ( | const key_type & | key | ) | [inherited] |
Remove from this set the value_type object that is equivalent to the specified key, if such an entry exists, and return 1; otherwise, if there is no value_type object that is equivalent to key, return 0 with no other effect. This method invalidates only iterators and references to the removed element and previously saved values of the end() iterator, and preserves the relative order of the elements not removed.
| iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::erase | ( | const_iterator | first, | |
| const_iterator | last | |||
| ) | [inherited] |
Remove from this set the value_type objects starting at the specified first position up to, but including the specified last position, and return last. This method invalidates only iterators and references to the removed element and previously saved values of the end() iterator, and preserves the relative order of the elements not removed. The behavior is undefined unless first and last either refer to elements in this set or are the end iterator, and the first position is at or before the last position in the sequence provided by this container.
| enable_if< BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value, iterator>::type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::find | ( | const LOOKUP_KEY & | key | ) | [inline, inherited] |
| key | Return an iterator providing modifiable access to the value_type object in this unordered set that is equivalent to the specified key, if such an entry exists, and the past-the-end (end) iterator otherwise. The behavior is undefined unless key is equivalent to at most one element in this unordered set. |
Note: implemented inline due to Sun CC compilation error.
Referenced by bsl::unordered_set< Rule, RuleHash >::contains().
| iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::find | ( | const key_type & | key | ) | [inherited] |
Return an iterator providing modifiable access to the value_type object in this unordered set that is equivalent to the specified key, if such an entry exists, and the past-the-end (end) iterator otherwise.
| enable_if< BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value, pair<iterator, iterator> >::type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::equal_range | ( | const LOOKUP_KEY & | key | ) | [inline, inherited] |
| key | Return a pair of iterators providing modifiable access to the sequence of value_type objects in this unordered set that are equivalent to the specified key, where the first iterator is positioned at the start of the sequence, and the second is positioned one past the end of the sequence. If this unordered set contains no value_type objects equivalent to key, then the two returned iterators will have the same value. The behavior is undefined unless key is equivalent to at most one element in this unordered set. Note that since an unordered set maintains unique keys, the range will contain at most one element. |
Note: implemented inline due to Sun CC compilation error.
| pair<iterator, iterator> bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::equal_range | ( | const key_type & | key | ) | [inherited] |
Return a pair of iterators providing modifiable access to the sequence of value_type objects in this unordered set that are equivalent to the specified key, where the first iterator is positioned at the start of the sequence, and the second is positioned one past the end of the sequence. If this unordered set contains no value_type objects equivalent to key, then the two returned iterators will have the same value. Note that since an unordered set maintains unique keys, the range will contain at most one element.
| void bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::max_load_factor | ( | float | newLoadFactor | ) | [inherited] |
Set the maximum load factor of this container to the specified newLoadFactor.
| void bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::rehash | ( | size_type | numBuckets | ) | [inherited] |
Change the size of the array of buckets maintained by this container to the specified numBuckets, and redistribute all the contained elements into the new sequence of buckets, according to their hash values. Note that this operation has no effect if rehashing the elements into numBuckets would cause this set to exceed its max_load_factor.
| void bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::reserve | ( | size_type | numElements | ) | [inherited] |
Increase the number of buckets of this set to a quantity such that the ratio between the specified numElements and this quantity does not exceed max_load_factor. Note that this guarantees that, after the reserve, elements can be inserted to grow the container to size() == numElements without rehashing. Also note that memory allocations may still occur when growing the container to size() == numElements. Also note that this operation has no effect if numElements <= size().
| ALLOCATOR bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::get_allocator | ( | ) | const [inherited] |
Return (a copy of) the allocator used for memory allocation by this unordered set.
| const_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::begin | ( | ) | const [inherited] |
Return an iterator providing non-modifiable access to the first value_type object in the sequence of value_type objects maintained by this set, or the end iterator if this set is empty.
| const_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::end | ( | ) | const [inherited] |
Return an iterator providing non-modifiable access to the past-the-end element in the sequence of value_type objects maintained by this set.
| const_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::cbegin | ( | ) | const [inherited] |
Return an iterator providing non-modifiable access to the first value_type object in the sequence of value_type objects maintained by this set, or the cend iterator if this set is empty.
| const_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::cend | ( | ) | const [inherited] |
Return an iterator providing non-modifiable access to the past-the-end element (in the sequence of value_type objects) maintained by this set.
| bool bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::contains | ( | const key_type & | key | ) | const [inherited] |
Return true if this unordered set contains an element whose key is equivalent to the specified key.
| enable_if< BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value && BloombergLP::bslmf::IsTransparentPredicate<EQUAL, LOOKUP_KEY>::value, bool>::type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::contains | ( | const LOOKUP_KEY & | key | ) | const [inline, inherited] |
< Return true if this unordered set contains an element whose key is equivalent to the specified key.
Note: implemented inline due to Sun CC compilation error
| bool bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::empty | ( | ) | const [inherited] |
Return true if this set contains no elements, and false otherwise.
| size_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::size | ( | ) | const [inherited] |
Return the number of elements in this set.
| size_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::max_size | ( | ) | const [inherited] |
Return a theoretical upper bound on the largest number of elements that this set could possibly hold. Note that there is no guarantee that the set can successfully grow to the returned size, or even close to that size without running out of resources.
| EQUAL bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::key_eq | ( | ) | const [inherited] |
Return (a copy of) the key-equality binary functor that returns true if the value of two key_type objects are equivalent, and false otherwise.
| HASH bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::hash_function | ( | ) | const [inherited] |
Return (a copy of) the hash unary functor used by this set to generate a hash value (of type size_t) for a key_type object.
| enable_if< BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value, const_iterator>::type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::find | ( | const LOOKUP_KEY & | key | ) | const [inline, inherited] |
< Return an iterator providing non-modifiable access to the value_type object in this unordered set that is equivalent to the specified key, if such an entry exists, and the past-the-end (end) iterator otherwise. The behavior is undefined unless key is equivalent to at most one element in this unordered set.
Note: implemented inline due to Sun CC compilation error.
| const_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::find | ( | const key_type & | key | ) | const [inherited] |
Return an iterator providing non-modifiable access to the value_type object in this unordered set that is equivalent to the specified key, if such an entry exists, and the past-the-end (end) iterator otherwise.
| enable_if< BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value, size_type>::type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::count | ( | const LOOKUP_KEY & | key | ) | const [inline, inherited] |
< Return the number of value_type objects within this unordered set that are equivalent to the specified key. The behavior is undefined unless key is equivalent to at most one element in this unordered set. Note that since an unordered set maintains unique keys, the returned value will be either 0 or 1.
Note: implemented inline due to Sun CC compilation error.
| size_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::count | ( | const key_type & | key | ) | const [inherited] |
Return the number of value_type objects within this unordered set that are equivalent to the specified key. Note that since an unordered set maintains unique keys, the returned value will be either 0 or 1.
| enable_if< BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value, pair<const_iterator, const_iterator> >::type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::equal_range | ( | const LOOKUP_KEY & | key | ) | const [inline, inherited] |
< Return a pair of iterators providing non-modifiable access to the sequence of value_type objects in this unordered set that are equivalent to the specified key, where the first iterator is positioned at the start of the sequence and the second iterator is positioned one past the end of the sequence. If this unordered set contains no value_type objects equivalent to key, then the two returned iterators will have the same value. The behavior is undefined unless key is equivalent to at most one element in this unordered set. Note that since an unordered set maintains unique keys, the range will contain at most one element.
Note: implemented inline due to Sun CC compilation error.
| pair<const_iterator, const_iterator> bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::equal_range | ( | const key_type & | key | ) | const [inherited] |
Return a pair of iterators providing non-modifiable access to the sequence of value_type objects in this unordered set that are equivalent to the specified key, where the first iterator is positioned at the start of the sequence and the second iterator is positioned one past the end of the sequence. If this unordered set contains no value_type objects equivalent to key, then the two returned iterators will have the same value. Note that since an unordered set maintains unique keys, the range will contain at most one element.
| size_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::bucket_count | ( | ) | const [inherited] |
Return the number of buckets in the array of buckets maintained by this set.
| size_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::max_bucket_count | ( | ) | const [inherited] |
Return a theoretical upper bound on the largest number of buckets that this container could possibly manage. Note that there is no guarantee that the set can successfully grow to the returned size, or even close to that size without running out of resources.
| size_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::bucket_size | ( | size_type | index | ) | const [inherited] |
Return the number of elements contained in the bucket at the specified index in the array of buckets maintained by this container.
| size_type bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::bucket | ( | const key_type & | key | ) | const [inherited] |
Return the index of the bucket, in the array of buckets of this container, where a value equivalent to the specified key would be inserted.
| const_local_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::begin | ( | size_type | index | ) | const [inherited] |
Return a local iterator providing non-modifiable access to the first value_type object (in the sequence of value_type objects) of the bucket having the specified index in the array of buckets maintained by this set, or the end(index) otherwise.
| const_local_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::end | ( | size_type | index | ) | const [inherited] |
Return a local iterator providing non-modifiable access to the past-the-end element (in the sequence of value_type objects) of the bucket having the specified index in the array of buckets maintained by this set.
| const_local_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::cbegin | ( | size_type | index | ) | const [inherited] |
Return a local iterator providing non-modifiable access to the first value_type object (in the sequence of value_type objects) of the bucket having the specified index in the array of buckets maintained by this set, or the cend(index) otherwise.
| const_local_iterator bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::cend | ( | size_type | index | ) | const [inherited] |
Return a local iterator providing non-modifiable access to the past-the-end element (in the sequence of value_type objects) of the bucket having the specified index in the array of buckets maintained by this set.
| float bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::load_factor | ( | ) | const [inherited] |
Return the current ratio between the size of this container and the number of buckets. The load_factor is a measure of how full the container is, and a higher load factor leads to an increased number of collisions, thus resulting in a loss performance.
| float bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::max_load_factor | ( | ) | const [inherited] |
Return the maximum load factor allowed for this container. If an insert operation would cause load_factor to exceed the max_load_factor, that same insert operation will increase the number of buckets and rehash the elements of the container into those buckets the (see rehash).
| bool bsl::operator== | ( | const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | lhs, | |
| const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | rhs | |||
| ) |
Return true if the specified lhs and rhs objects have the same value, and false otherwise. Two unordered_set objects have the same value if they have the same number of value-elements, and for each value-element that is contained in lhs there is a value-element contained in rhs having the same value, and vice-versa. Note that this method requires that the (template parameter) type KEY be equality-comparable (see Requirements on KEY).
| bool bsl::operator!= | ( | const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | lhs, | |
| const unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | rhs | |||
| ) |
Return true if the specified lhs and rhs objects do not have the same value, and false otherwise. Two unordered_set objects do not have the same value if they do not have the same number of value-elements, or that for some value-element contained in lhs there is not a value-element in rhs having the same value, and vice-versa. Note that this method requires that the (template parameter) type KEY and be equality-comparable (see Requirements on KEY).
| unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::size_type bsl::erase_if | ( | unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | s, | |
| PREDICATE | predicate | |||
| ) |
Erase all the elements in the specified unordered_set s that satisfy the specified predicate predicate. Return the number of elements erased.
| void bsl::swap | ( | unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | a, | |
| unordered_set< KEY, HASH, EQUAL, ALLOCATOR > & | b | |||
| ) |
Exchange the value, hasher, key-equality functor, and max_load_factor of the specified a object with those of the specified b object; also exchange the allocator of a with that of b if the (template parameter) type ALLOCATOR has the propagate_on_container_swap trait, and do not modify either allocator otherwise. This function provides the no-throw exception-safety guarantee if and only if both the (template parameter) types HASH and EQUAL provide no-throw swap operations; if an exception is thrown, both objects are left in valid but unspecified states. This operation guarantees O[1] complexity. The behavior is undefined unless either a was created with the same allocator as b or ALLOCATOR has the propagate_on_container_swap trait.
void swap (unordered_set& other) BSLS_KEYWORD_NOEXCEPT_SPECIFICATION( AllocatorTraits void bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR >::clear() BSLS_KEYWORD_NOEXCEPT [inherited] |
< Exchange the value, hasher, key-equality functor, and max_load_factor of this object with those of the specified other object; also exchange the allocator of this object with that of other if the (template parameter) type ALLOCATOR has the propagate_on_container_swap trait, and do not modify either allocator otherwise. This method provides the no-throw exception-safety guarantee if and only if both the (template parameter) types HASH and EQUAL provide no-throw swap operations; if an exception is thrown, both objects are left in valid but unspecified states. This operation guarantees O[1] complexity. The behavior is undefined unless either this object was created with the same allocator as other or ALLOCATOR has the propagate_on_container_swap trait. Remove all entries from this unordered set. Note that the set is empty after this call, but allocated memory may be retained for future use.
| bool operator== | ( | const unordered_set< KEY2, HASH2, EQUAL2, ALLOCATOR2 > & | , | |
| const unordered_set< KEY2, HASH2, EQUAL2, ALLOCATOR2 > & | ||||
| ) | [friend, inherited] |
1.7.1