Main Page | Modules | Alphabetical List | Data Structures | File List | Data Fields | Related Pages

TreeAgendaStruct Struct Reference
[TreeAgenda]

Collaboration diagram for TreeAgendaStruct:

Collaboration graph
[legend]

Detailed Description

quick, should be binary tree.

Definition at line 70 of file treeagenda.c.

Data Fields


Field Documentation

int TreeAgendaStruct::best
 

index of best node or -1 if non-existent

Definition at line 78 of file treeagenda.c.

int TreeAgendaStruct::free
 

index of first free node or -1 if non-existent

Definition at line 76 of file treeagenda.c.

VoidFunction* TreeAgendaStruct::freeState
 

free function

Definition at line 80 of file treeagenda.c.

int TreeAgendaStruct::maxsize
 

number of allocated nodes

Definition at line 72 of file treeagenda.c.

int TreeAgendaStruct::maxSizeSoFar
 

maximum number of used nodes so far

Definition at line 73 of file treeagenda.c.

TANodeStruct* TreeAgendaStruct::nodes
 

array of maxsize nodes

Definition at line 81 of file treeagenda.c.

int TreeAgendaStruct::root
 

index of root node or -1 if non-existent

Definition at line 77 of file treeagenda.c.

int TreeAgendaStruct::size
 

total number of used nodes

Definition at line 71 of file treeagenda.c.

Boolean TreeAgendaStruct::truncationWarning
 

flag whether warning has been emitted

Definition at line 75 of file treeagenda.c.

Boolean TreeAgendaStruct::verbose
 

If set to true then truncation warnings take effect.

Definition at line 74 of file treeagenda.c.

int TreeAgendaStruct::worst
 

index of worst node or -1 if non-existent

Definition at line 79 of file treeagenda.c.


The documentation for this struct was generated from the following file:
BLAH 0.95 (20 Oct 2004)