#include <cache.h>
Classes | |
| class | Storage |
Public Types | |
| typedef CacheIterator< K, T > | iterator |
| typedef List< Storage > | ObjList |
| typedef ListIterator< Storage > | ObjListIterator |
| typedef std::tr1::unordered_map< K, ObjListIterator > | ObjMap |
| typedef ObjMap::iterator | ObjMapIterator |
Public Member Functions | |
| T * | back () |
| void | clear () |
| void | erase (iterator &it) |
| bool | exists (const K &id) |
| iterator | find (const K &id) |
| T * | front () |
| iterator | iterate () |
| iterator | iterateBack () |
| void | move_back_to_front () |
| void | move_to_back (const K &id) |
| void | move_to_front (const K &id) |
| void | move_to_front (iterator &it) |
| void | pop_back () |
| void | push_back (const K &id, T *object) |
| void | push_front (const K &id, T *object) |
| size_t | size () const |
Public Attributes | |
| ObjMap | hash_ |
| ObjList | list_ |
Friends | |
| class | CacheIterator< K, T > |
| typedef CacheIterator<K, T> megatree::Cache< K, T >::iterator |
| typedef List<Storage > megatree::Cache< K, T >::ObjList |
| typedef ListIterator<Storage> megatree::Cache< K, T >::ObjListIterator |
| typedef std::tr1::unordered_map<K, ObjListIterator> megatree::Cache< K, T >::ObjMap |
| typedef ObjMap::iterator megatree::Cache< K, T >::ObjMapIterator |
| T* megatree::Cache< K, T >::back | ( | ) | [inline] |
| void megatree::Cache< K, T >::clear | ( | ) | [inline] |
| void megatree::Cache< K, T >::erase | ( | iterator & | it | ) | [inline] |
| bool megatree::Cache< K, T >::exists | ( | const K & | id | ) | [inline] |
| iterator megatree::Cache< K, T >::find | ( | const K & | id | ) | [inline] |
| T* megatree::Cache< K, T >::front | ( | ) | [inline] |
| iterator megatree::Cache< K, T >::iterate | ( | ) | [inline] |
| iterator megatree::Cache< K, T >::iterateBack | ( | ) | [inline] |
| void megatree::Cache< K, T >::move_back_to_front | ( | ) | [inline] |
| void megatree::Cache< K, T >::move_to_back | ( | const K & | id | ) | [inline] |
| void megatree::Cache< K, T >::move_to_front | ( | const K & | id | ) | [inline] |
| void megatree::Cache< K, T >::move_to_front | ( | iterator & | it | ) | [inline] |
| void megatree::Cache< K, T >::pop_back | ( | ) | [inline] |
| void megatree::Cache< K, T >::push_back | ( | const K & | id, |
| T * | object | ||
| ) | [inline] |
| void megatree::Cache< K, T >::push_front | ( | const K & | id, |
| T * | object | ||
| ) | [inline] |
| size_t megatree::Cache< K, T >::size | ( | ) | const [inline] |
friend class CacheIterator< K, T > [friend] |
| ObjMap megatree::Cache< K, T >::hash_ |
| ObjList megatree::Cache< K, T >::list_ |