#include <ddgtmesh.h>
Class diagram for ddgQCache:

| Public Members | |||
|  |  | void | init (unsigned int size, unsigned int bn, bool r = false ) | 
|  |  | Initialize the cache. More... | |
|  |  | ddgQNode* | get (unsigned short index) | 
|  |  | Get entry. | |
|  |  | ddgCacheIndex | insert (ddgTreeIndex t, ddgTriIndex ti, short b) | 
|  |  | Insert a node into the queue. More... | |
|  |  | void | move (ddgCacheIndex ci, short b) | 
|  |  | Move a node from one position to another in the queue. | |
| void ddgQCache::init (unsigned int size, unsigned int bn, bool r = false)  [inline] | 
Initialize the cache.
size is the total number of entries the cache should be able to hold. bn is the number of priority slots. r indicates if this queue is sorted in reverse.
| ddgCacheIndex ddgQCache::insert (ddgTreeIndex t, ddgTriIndex ti, short b)  [inline] | 
Insert a node into the queue.
returns the position in the cache that it was inserted into.
 0.49-991205 written by Dimitri van Heesch,
 © 1997-1999
 0.49-991205 written by Dimitri van Heesch,
 © 1997-1999