|
|
#include <closed_hash.hpp>
|
| iterator | begin () |
| |
| const_iterator | begin () const |
| |
| size_type | capacity () const |
| |
| void | clear () |
| |
| | closed_hash_set () |
| |
| | closed_hash_set (size_type n) |
| |
| | closed_hash_set (size_type n, const hasher &hf, const key_equal &eq=key_equal(), const key_transform &kf=key_transform(), const allocator_type &a=allocator_type()) |
| |
| template<typename I > |
| | closed_hash_set (I f, I l) |
| |
| template<typename I > |
| | closed_hash_set (I f, I l, size_type n, const hasher &hf=hasher(), const key_equal &eq=key_equal(), const key_transform &kf=key_transform(), const allocator_type &a=allocator_type()) |
| |
| | closed_hash_set (const closed_hash_set &x) |
| |
| | closed_hash_set (move_from< closed_hash_set > x) |
| |
| std::size_t | count (const key_type &key) const |
| |
| bool | empty () const |
| |
| iterator | end () |
| |
| const_iterator | end () const |
| |
| std::pair< const_iterator, const_iterator > | equal_range (const key_type &key) const |
| |
| std::pair< iterator, iterator > | equal_range (const key_type &key) |
| |
| iterator | erase (iterator location) |
| |
| std::size_t | erase (const key_type &key) |
| |
| const_iterator | find (const key_type &key) const |
| |
| iterator | find (const key_type &key) |
| |
| allocator_type | get_allocator () const |
| |
| hasher | hash_function () const |
| |
| template<typename I > |
| void | insert (I first, I last) |
| |
| std::pair< iterator, bool > | insert (value_type x) |
| |
| iterator | insert (iterator, value_type x) |
| |
| key_equal | key_eq () const |
| |
| key_transform | key_function () const |
| |
| size_type | max_size () const |
| |
| template<typename I > |
| void | move_insert (I first, I last) |
| |
| closed_hash_set & | operator= (closed_hash_set x) |
| |
| reverse_iterator | rbegin () |
| |
| const_reverse_iterator | rbegin () const |
| |
| reverse_iterator | rend () |
| |
| const_reverse_iterator | rend () const |
| |
| void | reserve (size_type n) |
| |
| size_type | size () const |
| |
| | ~closed_hash_set () |
| |
template<typename T, typename KeyTransform, typename Hash, typename Pred, typename A>
class adobe::closed_hash_set< T, KeyTransform, Hash, Pred, A >
- A
closed_hash_set is a hash based associative container, similar to a hash_set.
- Model Of:
-
- Todo:
- re-order parameters so key_function is after comparison - to be consistent with lower_bound.
Definition at line 157 of file closed_hash.hpp.
◆ allocator_type
◆ const_iterator
◆ const_pointer
◆ const_reference
◆ const_reverse_iterator
◆ difference_type
◆ hasher
◆ iterator
◆ key_equal
◆ key_transform
◆ key_type
| typedef boost::remove_reference<typename key_transform::result_type>::type key_type |
◆ pointer
◆ reference
◆ reverse_iterator
◆ size_type
◆ value_type
◆ closed_hash_set() [1/7]
◆ closed_hash_set() [2/7]
◆ closed_hash_set() [3/7]
◆ closed_hash_set() [4/7]
◆ closed_hash_set() [5/7]
◆ closed_hash_set() [6/7]
◆ closed_hash_set() [7/7]
◆ ~closed_hash_set()
◆ begin() [1/2]
◆ begin() [2/2]
◆ capacity()
◆ clear()
◆ count()
| std::size_t count |
( |
const key_type & |
key | ) |
const |
◆ empty()
◆ end() [1/2]
◆ end() [2/2]
◆ equal_range() [1/2]
◆ equal_range() [2/2]
◆ erase() [1/2]
◆ erase() [2/2]
| std::size_t erase |
( |
const key_type & |
key | ) |
|
◆ find() [1/2]
◆ find() [2/2]
◆ get_allocator()
◆ hash_function()
| hasher hash_function |
( |
| ) |
const |
◆ insert() [1/3]
| void insert |
( |
I |
first, |
|
|
I |
last |
|
) |
| |
◆ insert() [2/3]
◆ insert() [3/3]
◆ key_eq()
◆ key_function()
◆ max_size()
◆ move_insert()
| void move_insert |
( |
I |
first, |
|
|
I |
last |
|
) |
| |
◆ operator=()
◆ rbegin() [1/2]
◆ rbegin() [2/2]
◆ rend() [1/2]
◆ rend() [2/2]
◆ reserve()
◆ size()
◆ operator==
◆ swap
|