This is used by the module netsearch, but has been superseded by the more efficienct module treeagenda.
|
returns the best entry (= first) from the agenda.
References listElement(). |
|
deletes the specified agenda. The function deallocates all the items in a using *freeState(). Then it deallocates all the entries and the agenda itself.
References listElement(), and listNext(). |
|
inserts a new entry into the agenda.
If the insertion leads to an overflow, then the worst item from the list is removed. Note that the item to be removed may be the state itself. Definition at line 233 of file listagenda.c. References listAppendElement(), listDelete(), listElement(), listNext(), listPrependElement(), and listSetNext(). |
|
checks if the specified ListAgenda is empty.
|
|
checks for the truncation of the ListAgenda a.
|
|
deletes the iterator object. The function deallocates the list cell that was used by the iterator.
|
|
creates a new iterator object. This is actually just a single new list cell that points to the first entry.
References listElement(), and listPrependElement(). |
|
returns the next item in iterator object.
References listElement(), listNext(), listSetElement(), and listSetNext(). |
|
retrieves the size limit of the agenda.
|
|
retrieves the largest attained size of the agenda.
|
|
creates a new ListAgenda.
|
|
removes and returns best entry (= first) from the agenda.
References listElement(), and listNext(). |
|
reset the agenda truncation warning.
|
|
sets verbosity flag.
|
|
retrieves size of the agenda.
|
|
gets verbosity flag.
|