#include <ddgcache.h>
Class diagram for ddgLCache:
Public Members | |||
 | | ddgLNode* | get (ddgCacheIndex n) |
| | Get entry. | |
| | ddgCacheIndex | insert (ddgCacheIndex nextNode) |
| | Insert a node into the cache before the specified node. More... | |
| | void | remove (ddgCacheIndex ci) |
| | Remove this node from the cache. | |
| | ddgCacheIndex | insertHead (ddgCacheIndex nextNode) |
| | Insert a node into the cache before the head node. More... | |
| | ddgCacheIndex | insertTail (ddgCacheIndex prevNode) |
| | Insert a node into the cache before the head node. More... | |
This cache can insert and remove items at will.
ddgCacheIndex ddgLCache::insert (ddgCacheIndex nextNode) [inline]
|
Insert a node into the cache before the specified node.
returns the position in the cache that it was inserted into.
ddgCacheIndex ddgLCache::insertHead (ddgCacheIndex nextNode) [inline]
|
Insert a node into the cache before the head node.
Assumes we are inserting at the head of the list.
ddgCacheIndex ddgLCache::insertTail (ddgCacheIndex prevNode) [inline]
|
Insert a node into the cache before the head node.
Assumes we are inserting at the tail of the list.
0.49-991205 written by Dimitri van Heesch,
© 1997-1999