Ordered map which saves the order of insertion.
More...
|
typedef std::pair< Key, Object > | entry_t |
|
typedef std::list< entry_t > | list_t |
|
typedef list_t::iterator | iterator |
|
typedef list_t::const_iterator | const_iterator |
|
typedef std::unordered_map< Key, iterator > | map_t |
|
|
void | clear () |
|
const_iterator | begin () const |
|
const_iterator | end () const |
|
iterator | begin () |
|
iterator | end () |
|
size_t | size () const |
|
bool | empty () const |
|
void | insert (const Key &key, const Object &object) |
|
iterator | find (const Key &key) |
|
const_iterator | find (const Key &key) const |
|
size_t | erase (const Key &key) |
|
const Object & | value (const Key &key) const |
|
const Object & | operator[] (const Key &key) |
|
template<class Key, class Object>
class OrderedMap< Key, Object >
Ordered map which saves the order of insertion.
Definition at line 28 of file OrderedMap.h.
The documentation for this class was generated from the following file: