#include <FIFOMap.h>
Inheritance diagram for FIFOMap:
Public Types | |
typedef Map<KeyPair<Key>, Value, KeyList, ValueList> | KeyMap |
Save some typing. | |
typedef vector<Key> | KeyVector |
Public Methods | |
Value& | operator[] (const Key &k) |
pair<iterator, bool> | insert (const pair< Key, Value > &newPair) |
size_t | erase (const Key &k) |
Value | Get (const Key &key) const |
KeyVector | GetWordsAsKeys () const |
void | Add (const Key &k, const Value &v) |
void | Set (const Key &k, const Value &v) |
KeyPair<Key> | FindKeyPair (const Key &k) const |
Find a KeyPair based on a given Key. |
This class is designed to act like a general Map class, except it will keep it's elements in fifo order. This is accomplished by making the key into the KeyPair class. Where the fifo order is kept. The goal of this class is to make its use transparent from the Map class except that its elements are in fifo order. This mostly involves wrapper functions for each Map and map function
|
All of these work the same as their parent's function only they use a KeyPair instead of just the Key type |
|
All of these work the same as their parent's function only they use a KeyPair instead of just the Key type |