std::tr1::unordered_set< Value, Hash, Pred, Alloc, cache_hash_code > Class Template Reference

Inheritance diagram for std::tr1::unordered_set< Value, Hash, Pred, Alloc, cache_hash_code >:

std::tr1::hashtable< Value, Value, Alloc, Internal::identity< Value >, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, true, true > Internal::rehash_base< RehashPolicy, Hashtable > hash_code_base Internal::map_base< K, V, Ex, unique, Hashtable > List of all members.

Public Types

typedef Base::size_type size_type
typedef Base::hasher hasher
typedef Base::key_equal key_equal
typedef Base::allocator_type allocator_type

Public Member Functions

 unordered_set (size_type n=10, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type())
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())

Private Types

typedef hashtable< Value,
Value, Alloc, Internal::identity<
Value >, Pred, Hash, Internal::mod_range_hashing,
Internal::default_ranged_hash,
Internal::prime_rehash_policy,
cache_hash_code, true, true > 
Base

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 54 of file unordered_set.


Member Typedef Documentation

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

Reimplemented from std::tr1::hashtable< Value, Value, Alloc, Internal::identity< Value >, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, true, true >.

Definition at line 74 of file unordered_set.

template<class Value, class Hash = hash<Value>, class Pred = std::equal_to<Value>, class Alloc = std::allocator<Value>, bool cache_hash_code = false>
typedef hashtable<Value, Value, Alloc, Internal::identity<Value>, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, true, true> std::tr1::unordered_set< Value, Hash, Pred, Alloc, cache_hash_code >::Base [private]

Definition at line 68 of file unordered_set.

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

Definition at line 72 of file unordered_set.

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

Reimplemented from std::tr1::hashtable< Value, Value, Alloc, Internal::identity< Value >, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, true, true >.

Definition at line 73 of file unordered_set.

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

Reimplemented from std::tr1::hashtable< Value, Value, Alloc, Internal::identity< Value >, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, true, true >.

Definition at line 71 of file unordered_set.


Constructor & Destructor Documentation

template<class Value, class Hash = hash<Value>, class Pred = std::equal_to<Value>, class Alloc = std::allocator<Value>, bool cache_hash_code = false>
std::tr1::unordered_set< Value, Hash, Pred, Alloc, cache_hash_code >::unordered_set ( size_type  n = 10,
const hasher hf = hasher(),
const key_equal eql = key_equal(),
const allocator_type a = allocator_type() 
) [inline, explicit]

Definition at line 77 of file unordered_set.

template<class Value, class Hash = hash<Value>, class Pred = std::equal_to<Value>, class Alloc = std::allocator<Value>, bool cache_hash_code = false>
template<typename InputIterator>
std::tr1::unordered_set< Value, Hash, Pred, Alloc, cache_hash_code >::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() 
) [inline]

Definition at line 87 of file unordered_set.


The documentation for this class was generated from the following file:
Generated on Tue Feb 2 16:59:56 2010 for GNU C++ STL by  doxygen 1.4.7