4 #ifndef UTILMM_HASH_SET_HEADER
5 # define UTILMM_HASH_SET_HEADER
6 #include "utilmm/config/config.h"
28 template<
typename Key,
class Hash = hash<Key>,
29 class Equal = std::equal_to<Key> >
63 the_table.
swap(other.the_table);
71 return the_table.
size();
86 return the_table.
empty();
94 return the_table.
begin();
101 return the_table.
end();
108 return the_table.
begin();
115 return the_table.
end();
157 the_table.
erase(first, last);
191 #endif // UTILMM_HASH_SET_HEADER
container_type::value_type value_type
Value type for cells.
Definition: hash_set.hh:46
void erase(iterator const &i)
Remove element.
Definition: hash_set.hh:165
void erase(key_arg key)
remove element
Definition: hash_set.hh:175
Identity functor.
Definition: utils.hh:24
container_type::const_iterator const_iterator
const iterator type
Definition: hash_set.hh:56
void clear()
Remove all elements.
Definition: hash_set.hh:183
container_type::iterator iterator
iterator type
Definition: hash_set.hh:51
iterator end()
end of table
Definition: hash_set.hh:100
bool empty() const
Emptyness test.
Definition: hash_set.hh:85
size_t max_size() const
max element number
Definition: hash_set.hh:77
set with hashing access
Definition: hash_set.hh:30
const_iterator end() const
end of table
Definition: hash_set.hh:114
void swap(hash_set &other)
swapping function
Definition: hash_set.hh:62
iterator begin()
beginning of table
Definition: hash_set.hh:93
iterator insert(key_arg key)
Cell insertion.
Definition: hash_set.hh:148
void erase(iterator const &first, iterator const &last)
Remove range.
Definition: hash_set.hh:156
Declaration of utilmm::hash_toolbox::table.
iterator find(key_arg key)
Search for element.
Definition: hash_set.hh:128
size_t size() const
element count
Definition: hash_set.hh:70
const_iterator begin() const
beginning of table
Definition: hash_set.hh:107
const_iterator find(key_arg key) const
Search key.
Definition: hash_set.hh:135