CFLAGS = -Wall -g
ifneq (,$(findstring debug,$(DEB_BUILD_OPTIONS)))
- CFLAGS += -O0 -ggdb -rdynamic -MD -MP
+ CFLAGS += -O0 -ggdb -rdynamic -MD -MP -D DEBUG
else
CFLAGS += -O2
endif
return NewList;
}
+int GetCount(HashList *Hash)
+{
+ return Hash->nMembersUsed;
+}
+
+
/**
* \brief private destructor for one hash element.
* \param Data an element to free using the user provided destructor, or just plain free
/** but if we should be sorted into a specific place... */
if ((Hash->nMembersUsed != 0) &&
(HashPos != Hash->nMembersUsed) ) {
- long InsertAt;
long ItemsAfter;
ItemsAfter = Hash->nMembersUsed - HashPos;
- InsertAt = HashPos;
/** make space were we can fill us in */
if (ItemsAfter > 0)
{
- memmove(&Hash->LookupTable[InsertAt + 1],
- &Hash->LookupTable[InsertAt],
+ memmove(&Hash->LookupTable[HashPos + 1],
+ &Hash->LookupTable[HashPos],
ItemsAfter * sizeof(HashKey*));
}
}
*/
#include <time.h>
#include <stdlib.h>
-#define LIBCITADEL_VERSION_NUMBER 111
+#define LIBCITADEL_VERSION_NUMBER 112
/*
* Here's a bunch of stupid magic to make the MIME parser portable.
void SortByHashKey(HashList *Hash, int Order);
void SortByHashKeyStr(HashList *Hash);
-
+int GetCount(HashList *Hash);
const void *GetSearchPayload(const void *HashVoid);
void SortByPayload(HashList *Hash, CompareFunc SortBy);