Timerix/kerep
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

SearchTree: push/pull by string keys

Browse Source
This commit is contained in:
Timerix22
2022-07-21 00:07:50 +03:00
parent 2de4506e01
commit 84c3a10035
2 changed files with 23 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
src/SearchTree/SearchTree.c
View File

@@ -45,11 +45,16 @@ indexes3 splitindex(uint8 i){
};
}
void ST_push(STNode* node_first, const char* key, Unitype value){
void ST_push(STNode* node_first, char* key, Unitype value){
string keyString={key, cptr_length(key)};
ST_pushString(node_first, keyString, value);
}
void ST_pushString(STNode* node_first, string key, Unitype value){
if (!node_first) throw(ERR_NULLPTR);
STNode* node_last=node_first;
while(*key){
indexes3 i3=splitindex((uint8)*key);
while(key.length--){
indexes3 i3=splitindex((uint8)*key.ptr);
if(!node_last->branches){
node_last->branches=(STNode****)malloc(8*sizeof(STNode***));
for(uint8 i=0;i<8;i++)
@@ -68,16 +73,21 @@ void ST_push(STNode* node_first, const char* key, Unitype value){
if(!node_last->branches[i3.n32][i3.n4][i3.rem])
node_last->branches[i3.n32][i3.n4][i3.rem]=STNode_create();
node_last=node_last->branches[i3.n32][i3.n4][i3.rem];
key++;
key.ptr++;
}
node_last->value=value;
}
Unitype ST_pull(STNode* node_first, const char* key){
Unitype ST_pull(STNode* node_first, char* key){
string keyString={key, cptr_length(key)};
return ST_pullString(node_first, keyString);
}
Unitype ST_pullString(STNode* node_first, string key){
if (!node_first) throw(ERR_NULLPTR);
STNode* node_last=node_first;
while (*key){
indexes3 i3=splitindex((uint8)*key);
while (key.length--){
indexes3 i3=splitindex((uint8)*key.ptr);
if(!node_last->branches) return UniNull;
STNode*** ptrn32=(STNode***)node_last->branches[i3.n32];
if(!ptrn32) return UniNull;
@@ -85,7 +95,7 @@ Unitype ST_pull(STNode* node_first, const char* key){
if(!ptrn4) return UniNull;
node_last=ptrn4[i3.rem];
if(!node_last) return UniNull;
key++;
key.ptr++;
}
return node_last->value;
}