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

hash_multiset::upper_bound
const_iterator upper_bound(const Key& keyval) const;
The member function returns an iterator just beyond the iterator that designates the latest
element X in the controlled sequence for which X has equivalent ordering to keyval. If no
such element exists, the function returns end().
hash_multiset::value_comp
value_compare value_comp() const;
The member function returns a function object that determines the order of elements in the
controlled sequence.
hash_multiset::value_compare
typedef Tr value_compare;
The type describes a function object that can compare two elements as sort keys to determine
their relative order in the controlled sequence.
hash_multiset::value_type
typedef Key value_type;
The type describes an element of the controlled sequence.
hash_set
allocator_type · begin · clear · const_iterator · const_pointer
· const_reference · const_reverse_iterator · count ·
difference_type · empty · end · equal_range · erase · find ·
get_allocator · insert · iterator · key_comp · key_compare ·
key_type · lower_bound · max_size · pointer · rbegin · reference
· rend · reverse_iterator · hash_set · size · size_type · swap ·
upper_bound · value_comp · value_compare · value_type
template<class Key,
class Tr = hash_compare<Key, less<Key> >,
class Alloc = allocator<Key> >
class hash_set {
public: