|
| | TfHashSet () |
| |
| | TfHashSet (size_type n, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &alloc=allocator_type()) |
| |
| | TfHashSet (const allocator_type &alloc) |
| |
| template<class InputIterator > |
| | TfHashSet (InputIterator first, InputIterator last, size_type n=0, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &alloc=allocator_type()) |
| |
| | TfHashSet (const TfHashSet &other) |
| |
| TfHashSet & | operator= (const TfHashSet &rhs) |
| |
| iterator | begin () |
| |
| const_iterator | begin () const |
| |
| const_iterator | cbegin () const |
| |
| const_iterator | cend () const |
| |
| iterator | end () |
| |
| const_iterator | end () const |
| |
| size_type | erase (const key_type &key) |
| |
| void | erase (const_iterator position) |
| |
| void | erase (const_iterator first, const_iterator last) |
| |
| std::pair< iterator, bool > | insert (const value_type &v) |
| |
| iterator | insert (const_iterator hint, const value_type &v) |
| |
| template<class InputIterator > |
| void | insert (InputIterator first, InputIterator last) |
| |
| void | swap (TfHashSet &other) |
| |
template<class Key, class HashFn = std::hash<Key>, class EqualKey = std::equal_to<Key>, class Alloc = std::allocator<Key>>
class TfHashSet< Key, HashFn, EqualKey, Alloc >
Definition at line 246 of file hashset.h.
template<class Key, class HashFn = std::hash<Key>, class EqualKey = std::equal_to<Key>, class Alloc = std::allocator<Key>>
template<class Key2 , class HashFn2 , class EqualKey2 , class Alloc2 >
| bool operator== |
( |
const TfHashSet< Key2, HashFn2, EqualKey2, Alloc2 > & |
, |
|
|
const TfHashSet< Key2, HashFn2, EqualKey2, Alloc2 > & |
|
|
) |
| |
|
friend |