#include <ddgcache.h>
Class diagram for ddgSCache:
Public Members | |||
![]() | ![]() | ddgSCache (void) | |
![]() | ![]() | Constructor. | |
![]() | ![]() | ~ddgSCache (void) | |
![]() | ![]() | Destructor. | |
![]() | ![]() | void | reset (void) |
![]() | ![]() | Reset the queue. | |
![]() | ![]() | void | init (unsigned int size, unsigned int nodeSize, unsigned int bn, bool r = false ) |
![]() | ![]() | Initialize the cache. | |
![]() | ![]() | ddgSNode* | get (unsigned short index) |
![]() | ![]() | Get entry. | |
![]() | ![]() | short | bucketNo (void) |
![]() | ![]() | Return the number of buckets/key slots. | |
![]() | ![]() | short | convert ( short b ) |
![]() | ![]() | Convert bucket # back to key for reversed cache. | |
![]() | ![]() | ddgCacheIndex | insert (short b) |
![]() | ![]() | Insert a node into the cache. More... | |
![]() | ![]() | void | remove (ddgCacheIndex ci) |
![]() | ![]() | Remove this node from the queue. | |
![]() | ![]() | ddgCacheIndex | head (void) |
![]() | ![]() | Return the item at the head of the queue. | |
![]() | ![]() | ddgCacheIndex | tail (void) |
![]() | ![]() | Return the item at the head of the queue. | |
![]() | ![]() | ddgCacheIndex | next (ddgCacheIndex ci) |
![]() | ![]() | Return the item following this one ci must be valid. |
ddgCacheIndex ddgSCache::insert (short b) [inline]
|
Insert a node into the cache.
returns the position in the cache that it was inserted into.