man std::tr1::unordered_set (Fonctions bibliothèques) -

NAME

std::tr1::unordered_set -

SYNOPSIS



Inherits hashtable< Value, Value, Alloc, Internal::identity< Value >, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, false, true >.

Detailed Description

template<class Value, class Hash = hash<Value>, class Pred = std::equal_to<Value>, class Alloc = std::allocator<Value>, bool cache_hash_code = false> class std::tr1::unordered_set< Value, Hash, Pred, Alloc, cache_hash_code >

Definition at line 50 of file unordered_set.

Public Types

typedef Base::allocator_type allocator_type

typedef Internal::hashtable_iterator< value_type, true, cache_hash_code > const_iterator

typedef Internal::node_iterator< value_type, true, cache_hash_code > const_local_iterator

typedef Alloc::const_reference const_reference

typedef Alloc::difference_type difference_type

typedef Base::hasher hasher

typedef Internal::hashtable_iterator< value_type,!mutable_iterators, cache_hash_code > iterator

typedef Base::key_equal key_equal

typedef Value key_type

typedef Internal::node_iterator< value_type,!mutable_iterators, cache_hash_code > local_iterator

typedef Alloc::reference reference

typedef Base::size_type size_type

typedef Value value_type

Public Member Functions

const_local_iterator begin (size_type n) const

local_iterator begin (size_type n)

const_iterator begin () const

iterator begin ()

size_type bucket (const key_type &k) const

size_type bucket_count () const

size_type bucket_size (size_type n) const

void clear ()

size_type count (const key_type &k) const

bool empty () const

const_local_iterator end (size_type n) const

local_iterator end (size_type n)

const_iterator end () const

iterator end ()

std::pair< const_iterator, const_iterator > equal_range (const key_type &k) const

std::pair< iterator, iterator > equal_range (const key_type &k)

void erase (const_iterator, const_iterator)

size_type erase (const key_type &)

void erase (const_iterator)

const_iterator find (const key_type &k) const

iterator find (const key_type &)

allocator_type get_allocator () const

void insert (InIter first, InIter last)

Insert_Return_Type insert (const_iterator, const value_type &v)

Insert_Return_Type insert (const value_type &v)

float load_factor () const

size_type max_bucket_count () const

size_type max_size () const

void rehash (size_type n)

void rehash_policy (const Internal::prime_rehash_policy &)

const Internal::prime_rehash_policy & rehash_policy () const

size_type size () const

void swap (hashtable &)

template<typename InputIterator> unordered_set (InputIterator f, InputIterator l, size_type n=10, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type())

unordered_set (size_type n=10, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type())

Author

Generated automatically by Doxygen for libstdc++ source from the source code.