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

ListAgendaStruct Struct Reference
[ListAgenda]

Collaboration diagram for ListAgendaStruct:

Collaboration graph
[legend]

Detailed Description

quick, should be binary tree.

Definition at line 69 of file listagenda.c.

Data Fields


Field Documentation

List ListAgendaStruct::entries
 

holds an item in an agenda

The agenda will allocate and deallocate its own items.The elements,however, will only be deallocated in special cases.Definition at line 90 of file listagenda.c.

VoidFunction* ListAgendaStruct::freeState
 

used on an element when when it is lost through overflow or when the entire agenda is freed

Definition at line 87 of file listagenda.c.

int ListAgendaStruct::maxsize
 

Gives the maximal allowed size of the agenda.

If more elements are inserted to it,the agenda will overflow,and the elements with the worst scores will be lost.Definition at line 70 of file listagenda.c.

int ListAgendaStruct::maxSizeSoFar
 

gives the maximal value that the size has reached so far

Definition at line 80 of file listagenda.c.

int ListAgendaStruct::size
 

gives the current size of the agenda

Definition at line 79 of file listagenda.c.

Boolean ListAgendaStruct::truncationWarning
 

This is set after an overflow messsage is printed.

It inhibits any further warning messages.Definition at line 76 of file listagenda.c.

Boolean ListAgendaStruct::verbose
 

If set to true then truncation warnings take effect.

Definition at line 75 of file listagenda.c.

double ListAgendaStruct::worstScore
 

holds the score of the last item of the agenda

This field helps us to quickly determine whether an insert operation will make the agenda overflow.Definition at line 83 of file listagenda.c.


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