-/**
- * @defgroup HashList Hashlist Key Value list implementation;
- * 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 @ref reference_free_handler if you don't want us to free you rmemory.
- */
-
-/**
- * @defgroup HashListData Datastructures used for the internals of HashList
- * @ingroup HashList
- */
-
-/**
- * @defgroup HashListDebug Hashlist debugging functions
- * @ingroup HashList
- */
-
-/**
- * @defgroup HashListPrivate Hashlist internal functions
- * @ingroup HashList
- */
-
-/**
- * @defgroup HashListSort Hashlist sorting functions
- * @ingroup HashList
- */
-
-/**
- * @defgroup HashListAccess Hashlist functions to access / put / delete items in(to) the list
- * @ingroup HashList
- */
-
-/**
- * @defgroup HashListAlgorithm functions to condense Key to an integer.
- * @ingroup HashList
- */
-
-/**
- * @defgroup HashListMset MSet is sort of a derived hashlist, its special for treating Messagesets as Citadel uses them to store access rangesx
- * @ingroup HashList
- */