* \brief Anonymous Hash Iterator Object. used for traversing the whole array from outside
*/
long Position;
+ int StepWidth;
};
/**
* \brief creates a hash-linear iterator object
+ * \param Hash the list we reference
+ * \param in which step width should we iterate?
+ * If negative, the last position matching the
+ * step-raster is provided.
* \returns the hash iterator
*/
-HashPos *GetNewHashPos(void)
+HashPos *GetNewHashPos(HashList *Hash, int StepWidth)
{
HashPos *Ret;
Ret = (HashPos*)malloc(sizeof(HashPos));
- Ret->Position = 0;
+ if (StepWidth != 0)
+ Ret->StepWidth = StepWidth;
+ else
+ Ret->StepWidth = 1;
+ if (Ret->StepWidth < 0) {
+ Ret->Position = (Hash->nMembersUsed % (-Ret->StepWidth))
+ * (-Ret->StepWidth);
+ }
+ else {
+ Ret->Position = 0;
+ }
return Ret;
}
+/**
+ * \brief retrieve the counter from the itteratoor
+ * \param the Iterator to analyze
+ * \returns the n'th hashposition we point at
+ */
+int GetHashPosCounter(HashPos *At)
+{
+ return At->Position;
+}
+
/**
* \brief frees a linear hash iterator
*/
{
long PayloadPos;
- if ((Hash == NULL) || (Hash->nMembersUsed <= At->Position))
+ if ((Hash == NULL) || (At->Position >= Hash->nMembersUsed))
return 0;
*HKLen = Hash->LookupTable[At->Position]->HKLen;
*HashKey = Hash->LookupTable[At->Position]->HashKey;
PayloadPos = Hash->LookupTable[At->Position]->Position;
*Data = Hash->Members[PayloadPos]->Data;
- At->Position++;
+
+ At->Position += At->StepWidth;
+ if (At->Position > Hash->nMembersUsed) {
+ At->Position = Hash->nMembersUsed;
+ return 0;
+ }
return 1;
}
*/
void reference_free_handler(void *ptr)
{
- 1;
+ return;
}
int GetHashKeys(HashList *Hash, char ***List);
int dbg_PrintHash(HashList *Hash, PrintHashContent first, PrintHashContent Second);
int PrintHash(HashList *Hash, TransitionFunc Trans, PrintHashDataFunc PrintEntry);
-HashPos *GetNewHashPos(void);
+HashPos *GetNewHashPos(HashList *Hash, int StepWidth);
+int GetHashPosCounter(HashPos *At);
void DeleteHashPos(HashPos **DelMe);
int GetNextHashPos(HashList *Hash, HashPos *At, long *HKLen, const char **HashKey, void **Data);
void SortByHashKey(HashList *Hash, int Order);