Back to index

libcitadel  8.12
Modules
Hashlist Key Value list implementation;

Hashlist is a simple implementation of key value pairs. More...

Collaboration diagram for Hashlist Key Value list implementation;:

Modules

 Datastructures used for the internals of HashList
 Hashlist debugging functions
 Hashlist internal functions
 Hashlist sorting functions
 Hashlist functions to access / put / delete items in(to) the list
 functions to condense Key to an integer.
 MSet is sort of a derived hashlist, its special for treating Messagesets as Citadel uses them to store access rangesx

Detailed Description

Hashlist is a simple implementation of key value pairs.

It doesn't implement collision handling. the Hashingalgorythm is pluggeable on creation. items are added with a functionpointer destructs them; that way complex structures can be added. if no pointer is given, simply free is used. Use reference_free_handler if you don't want us to free you rmemory.