Quick Links: |
Provide an STL-compliant unordered_set
container.
More...
Go to the source code of this file.
Classes | |
class | bsl::unordered_set< KEY, HASH, EQUAL, ALLOCATOR > |
Namespaces | |
namespace | bsl |
Functions | |
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))) |