node Struct Reference
#include <sequence_map.h>
Public Types | |
| typedef List::const_iterator | const_iterator |
| std STL style const_iterator | |
| typedef List::iterator | iterator |
| std STL style iterator | |
| typedef std::list< value_type > | List |
| the primary storage representationt ype | |
| typedef std::pair< T, node * > | mapped_type |
| Data you should think about as being in the hash_list. Actually, this is only part of the real 'value_type'. | |
| typedef hash_list< T, node *, H > | self |
| typedef std::vector< value_type * > | Vector |
| the collection of buckets | |
Public Member Functions | |
| const_iterator | begin () const |
| iterator to first element in the list | |
| iterator | begin () |
| iterator to first element in the list | |
| const_iterator | end () const |
| iterator to end element of the list | |
| iterator | end () |
| iterator to the end element of the list | |
| void | erase (iterator location) |
| Remove one element from the list at the specified location. Used like this: | |
| const_iterator | find (Tconst &index) const |
| iterator | find (Tconst &key) |
| given a Key value, get an interator to the hash_list::value_type object that contains that key. | |
| iterator | insert (mapped_type const &data) |
| Insert a Key/Value pair. When inserting, you must supply a hash_list::mapped_type object. Used like this: | |
| index_helper | operator[] (Tconst &index) |
| Array index operator. returns a Value given its Key. | |
| node *const & | operator[] (Tconst &index) const |
| Array index operator. returns a Value given its Key. When the hash_list is const, then this function just returns a const& to either the object in the list or to the empty_value_ object for this hash_list. | |
| size_t | size () const |
| number of items in the container | |
Friends | |
| class | index_helper |
Detailed Description
template<class T, class ID, class H = Hasher<T>>
struct cxxtls::Sequence_Map< T, ID, H >::node
Definition at line 193 of file sequence_map.h.
Member Typedef Documentation
typedef List::const_iterator const_iterator [inherited] |
std STL style const_iterator
Definition at line 164 of file hash_list.h.
typedef List::iterator iterator [inherited] |
std STL style iterator
Definition at line 163 of file hash_list.h.
typedef std::list<value_type> List [inherited] |
the primary storage representationt ype
Definition at line 160 of file hash_list.h.
typedef std::pair<T ,node * > mapped_type [inherited] |
Data you should think about as being in the hash_list. Actually, this is only part of the real 'value_type'.
Definition at line 131 of file hash_list.h.
Definition at line 128 of file hash_list.h.
typedef std::vector<value_type*> Vector [inherited] |
the collection of buckets
Definition at line 161 of file hash_list.h.
Member Function Documentation
| const_iterator begin | ( | ) | const [inherited] |
iterator to first element in the list
Definition at line 205 of file hash_list.h.
| iterator begin | ( | ) | [inherited] |
iterator to first element in the list
Definition at line 202 of file hash_list.h.
| const_iterator end | ( | ) | const [inherited] |
iterator to end element of the list
Definition at line 206 of file hash_list.h.
| iterator end | ( | ) | [inherited] |
iterator to the end element of the list
Definition at line 203 of file hash_list.h.
| void erase | ( | iterator | location | ) | [inherited] |
Remove one element from the list at the specified location. Used like this:
hash_list<t>::iterator location = hl.find(some_key); hl.erase(location);
Definition at line 246 of file hash_list.h.
| const_iterator find | ( | T const & | index | ) | const [inherited] |
- Returns:
- an iterator to the entry with the specified key
- Parameters:
-
index the entry being searched for
Definition at line 347 of file hash_list.h.
| iterator find | ( | T const & | key | ) | [inherited] |
given a Key value, get an interator to the hash_list::value_type object that contains that key.
Definition at line 293 of file hash_list.h.
| iterator insert | ( | mapped_type const & | data | ) | [inherited] |
Insert a Key/Value pair. When inserting, you must supply a hash_list::mapped_type object. Used like this:
hl->insert( hash_list::mapped_type(key,value) );
Definition at line 208 of file hash_list.h.
| index_helper operator[] | ( | T const & | index | ) | [inherited] |
Array index operator. returns a Value given its Key.
Definition at line 497 of file hash_list.h.
| node * const& operator[] | ( | T const & | index | ) | const [inherited] |
Array index operator. returns a Value given its Key. When the hash_list is const, then this function just returns a const& to either the object in the list or to the empty_value_ object for this hash_list.
- Returns:
- a reference to the desired object
- Parameters:
-
index the key value of the desired object
Definition at line 358 of file hash_list.h.
| size_t size | ( | ) | const [inherited] |
number of items in the container
Definition at line 200 of file hash_list.h.
Friends And Related Function Documentation
friend class index_helper [friend, inherited] |
Definition at line 494 of file hash_list.h.
The documentation for this struct was generated from the following file:
- include/cxxtls/sequence_map.h
