i6engine  1.0
sequence_map.h File Reference
#include <cassert>
#include <list>
#include <unordered_map>
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.


class  i6e::utils::sequence_map< KeyType, ValueType, Hash >
 A map with linear access time and an iterator iterating through the elements in creation time. This map is intended for fast accessing complexity with preserving insertion order

Operation Time Desc.
Insert O(1)
Access O(1)
erase(key) O(n) maybe improvable when storing iterators not pointers
erase(iterator) O(n) O(1) as soon as stdlib++ allows const_iterator in erase (bug)