33 lines
684 B
C
33 lines
684 B
C
#include "WaitAckMap.h"
|
|
#include "WaitAckMapIter.h"
|
|
|
|
WaitAckMapIter WaitAckMap_find(WaitAckMap* this, const char* searchKey)
|
|
{
|
|
RBTreeElem* treeElem = _PointerRBTree_findElem( (RBTree*)this, searchKey);
|
|
|
|
WaitAckMapIter iter;
|
|
WaitAckMapIter_init(&iter, this, treeElem);
|
|
|
|
return iter;
|
|
}
|
|
|
|
WaitAckMapIter WaitAckMap_begin(WaitAckMap* this)
|
|
{
|
|
struct rb_node* node = rb_first(&this->rbTree.treeroot);
|
|
RBTreeElem* treeElem = node ? container_of(node, RBTreeElem, treenode) : NULL;
|
|
|
|
WaitAckMapIter iter;
|
|
WaitAckMapIter_init(&iter, this, treeElem);
|
|
|
|
return iter;
|
|
}
|
|
|
|
|
|
int compareWaitAckMapElems(const void* key1, const void* key2)
|
|
{
|
|
return strcmp(key1, key2);
|
|
}
|
|
|
|
|
|
|