Standard C++ Library Reference ISO/IEC (VERSION3)

where. The second member function removes the elements in the range [first, last).
Both return an iterator that designates the first element remaining beyond any elements
removed, or end() if no such element exists.
The third member removes the elements with sort keys in the range
[lower_bound(keyval), upper_bound(keyval)). It returns the number of
elements it removes.
The member functions never throw an exception.
hash_set::find
const_iterator find(const Key& keyval) const;
The member function returns lower_bound(keyval).
hash_set::get_allocator
Alloc get_allocator() const;
The member function returns the stored allocator object.
hash_set::hash_set
hash_set();
explicit hash_set(const Tr& traits);
hash_set(const Tr& traits, const Alloc& al);
hash_set(const hash_set& right);
template<class InIt>
hash_set(InIt first, InIt last);
template<class InIt>
hash_set(InIt first, InIt last,
const Tr& traits);
template<class InIt>
hash_set(InIt first, InIt last,
const Tr& traits, const Alloc& al);
All constructors store an allocator object and initialize the controlled sequence. The allocator
object is the argument al, if present. For the copy constructor, it is
right.get_allocator(). Otherwise, it is Alloc().
All constructors also store a hash traits object that can later be returned by calling
key_comp(). The hash traits object is the argument traits, if present. For the copy
constructor, it is right.key_comp()). Otherwise, it is Tr().
The first three constructors specify an empty initial controlled sequence. The fourth constructor