Chewing_Bever/lander
1
0
Fork 0
Code Issues 30 Projects 1 Packages 2 Activity

refactor: some small stuff

Browse source
This commit is contained in:
Jef Roosens 2022-12-03 13:27:34 +01:00
parent f9a5fc14e5
commit 2d89c5e80f
Signed by: Jef Roosens
GPG key ID: B75D4F293C7052DB
3 changed files with 10 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

12
src/trie/trie.c
View file

@ -236,17 +236,19 @@ bool trie_add_no_lock(Trie *trie, const char *string, Entry *entry) {
offset = 0;
child_node_ptr = tnode_search(*node_ptr, string[i], true);
i++;
// We've reached a NULL child, so we add the remaining part of the string
// here
if (*child_node_ptr == NULL) {
child_node = tnode_init();
while (offset < TRIE_MAX_SKIP_SIZE &&
string[i + 1 + offset] != DELIMITER) {
string[i + offset] != DELIMITER) {
offset++;
}
memcpy(child_node->string, string + i + 1, offset);
memcpy(child_node->string, string + i, offset);
child_node->string_len = offset;
*child_node_ptr = child_node;
@ -255,9 +257,9 @@ bool trie_add_no_lock(Trie *trie, const char *string, Entry *entry) {
// allowed skip length, we continue through the loop. The next iteration
// will enter this if statement again, and perform the same loop, until
// the string is fully added to the trie.
if (string[i + 1 + offset] != DELIMITER) {
if (string[i + offset] != DELIMITER) {
node_ptr = child_node_ptr;
i += offset + 1;
i += offset;
continue;
}
@ -269,8 +271,6 @@ bool trie_add_no_lock(Trie *trie, const char *string, Entry *entry) {
return true;
}
i++;
while (offset < (*child_node_ptr)->string_len) {
// String no longer aligns with edge, so we have to split
if (string[i + offset] != (*child_node_ptr)->string[offset]) {