lian/ldb
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

rbtree和hash的全量持久化操作。rbtree的二进制安全。

Browse Source 
粗略测试。
This commit is contained in:
1iaan
2026-01-08 21:42:20 +08:00
parent de21fe94ec
commit 4b4e06b33d
16 changed files with 1997 additions and 1450 deletions
Download Patch File Download Diff File Expand all files Collapse all files

798
kvs_rbtree.c
View File

@@ -1,553 +1,553 @@
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// #include <stdio.h>
// #include <stdlib.h>
// #include <string.h>
#include "kvstore.h"
// #include "kvstore.h"
rbtree_node *rbtree_mini(rbtree *T, rbtree_node *x) {
while (x->left != T->nil) {
x = x->left;
}
return x;
}
// rbtree_node *rbtree_mini(rbtree *T, rbtree_node *x) {
// while (x->left != T->nil) {
// x = x->left;
// }
// return x;
// }
rbtree_node *rbtree_maxi(rbtree *T, rbtree_node *x) {
while (x->right != T->nil) {
x = x->right;
}
return x;
}
// rbtree_node *rbtree_maxi(rbtree *T, rbtree_node *x) {
// while (x->right != T->nil) {
// x = x->right;
// }
// return x;
// }
rbtree_node *rbtree_successor(rbtree *T, rbtree_node *x) {
rbtree_node *y = x->parent;
// rbtree_node *rbtree_successor(rbtree *T, rbtree_node *x) {
// rbtree_node *y = x->parent;
if (x->right != T->nil) {
return rbtree_mini(T, x->right);
}
// if (x->right != T->nil) {
// return rbtree_mini(T, x->right);
// }
while ((y != T->nil) && (x == y->right)) {
x = y;
y = y->parent;
}
return y;
}
// while ((y != T->nil) && (x == y->right)) {
// x = y;
// y = y->parent;
// }
// return y;
// }
void rbtree_left_rotate(rbtree *T, rbtree_node *x) {
// void rbtree_left_rotate(rbtree *T, rbtree_node *x) {
rbtree_node *y = x->right; // x --> y , y --> x, right --> left, left --> right
// rbtree_node *y = x->right; // x --> y , y --> x, right --> left, left --> right
x->right = y->left; //1 1
if (y->left != T->nil) { //1 2
y->left->parent = x;
}
// x->right = y->left; //1 1
// if (y->left != T->nil) { //1 2
// y->left->parent = x;
// }
y->parent = x->parent; //1 3
if (x->parent == T->nil) { //1 4
T->root = y;
} else if (x == x->parent->left) {
x->parent->left = y;
} else {
x->parent->right = y;
}
// y->parent = x->parent; //1 3
// if (x->parent == T->nil) { //1 4
// T->root = y;
// } else if (x == x->parent->left) {
// x->parent->left = y;
// } else {
// x->parent->right = y;
// }
y->left = x; //1 5
x->parent = y; //1 6
}
// y->left = x; //1 5
// x->parent = y; //1 6
// }
void rbtree_right_rotate(rbtree *T, rbtree_node *y) {
// void rbtree_right_rotate(rbtree *T, rbtree_node *y) {
rbtree_node *x = y->left;
// rbtree_node *x = y->left;
y->left = x->right;
if (x->right != T->nil) {
x->right->parent = y;
}
// y->left = x->right;
// if (x->right != T->nil) {
// x->right->parent = y;
// }
x->parent = y->parent;
if (y->parent == T->nil) {
T->root = x;
} else if (y == y->parent->right) {
y->parent->right = x;
} else {
y->parent->left = x;
}
// x->parent = y->parent;
// if (y->parent == T->nil) {
// T->root = x;
// } else if (y == y->parent->right) {
// y->parent->right = x;
// } else {
// y->parent->left = x;
// }
x->right = y;
y->parent = x;
}
// x->right = y;
// y->parent = x;
// }
void rbtree_insert_fixup(rbtree *T, rbtree_node *z) {
// void rbtree_insert_fixup(rbtree *T, rbtree_node *z) {
while (z->parent->color == RED) { //z ---> RED
if (z->parent == z->parent->parent->left) {
rbtree_node *y = z->parent->parent->right;
if (y->color == RED) {
z->parent->color = BLACK;
y->color = BLACK;
z->parent->parent->color = RED;
// while (z->parent->color == RED) { //z ---> RED
// if (z->parent == z->parent->parent->left) {
// rbtree_node *y = z->parent->parent->right;
// if (y->color == RED) {
// z->parent->color = BLACK;
// y->color = BLACK;
// z->parent->parent->color = RED;
z = z->parent->parent; //z --> RED
} else {
// z = z->parent->parent; //z --> RED
// } else {
if (z == z->parent->right) {
z = z->parent;
rbtree_left_rotate(T, z);
}
// if (z == z->parent->right) {
// z = z->parent;
// rbtree_left_rotate(T, z);
// }
z->parent->color = BLACK;
z->parent->parent->color = RED;
rbtree_right_rotate(T, z->parent->parent);
}
}else {
rbtree_node *y = z->parent->parent->left;
if (y->color == RED) {
z->parent->color = BLACK;
y->color = BLACK;
z->parent->parent->color = RED;
// z->parent->color = BLACK;
// z->parent->parent->color = RED;
// rbtree_right_rotate(T, z->parent->parent);
// }
// }else {
// rbtree_node *y = z->parent->parent->left;
// if (y->color == RED) {
// z->parent->color = BLACK;
// y->color = BLACK;
// z->parent->parent->color = RED;
z = z->parent->parent; //z --> RED
} else {
if (z == z->parent->left) {
z = z->parent;
rbtree_right_rotate(T, z);
}
// z = z->parent->parent; //z --> RED
// } else {
// if (z == z->parent->left) {
// z = z->parent;
// rbtree_right_rotate(T, z);
// }
z->parent->color = BLACK;
z->parent->parent->color = RED;
rbtree_left_rotate(T, z->parent->parent);
}
}
// z->parent->color = BLACK;
// z->parent->parent->color = RED;
// rbtree_left_rotate(T, z->parent->parent);
// }
// }
}
// }
T->root->color = BLACK;
}
// T->root->color = BLACK;
// }
void rbtree_insert(rbtree *T, rbtree_node *z) {
// void rbtree_insert(rbtree *T, rbtree_node *z) {
rbtree_node *y = T->nil;
rbtree_node *x = T->root;
// rbtree_node *y = T->nil;
// rbtree_node *x = T->root;
while (x != T->nil) {
y = x;
#if ENABLE_KEY_CHAR
// while (x != T->nil) {
// y = x;
// #if ENABLE_KEY_CHAR
if (strcmp(z->key, x->key) < 0) {
x = x->left;
} else if (strcmp(z->key, x->key) > 0) {
x = x->right;
} else {
return ;
}
// if (strcmp(z->key, x->key) < 0) {
// x = x->left;
// } else if (strcmp(z->key, x->key) > 0) {
// x = x->right;
// } else {
// return ;
// }
#else
if (z->key < x->key) {
x = x->left;
} else if (z->key > x->key) {
x = x->right;
} else { //Exist
return ;
}
#endif
}
// #else
// if (z->key < x->key) {
// x = x->left;
// } else if (z->key > x->key) {
// x = x->right;
// } else { //Exist
// return ;
// }
// #endif
// }
z->parent = y;
if (y == T->nil) {
T->root = z;
#if ENABLE_KEY_CHAR
} else if (strcmp(z->key, y->key) < 0) {
#else
} else if (z->key < y->key) {
#endif
y->left = z;
} else {
y->right = z;
}
// z->parent = y;
// if (y == T->nil) {
// T->root = z;
// #if ENABLE_KEY_CHAR
// } else if (strcmp(z->key, y->key) < 0) {
// #else
// } else if (z->key < y->key) {
// #endif
// y->left = z;
// } else {
// y->right = z;
// }
z->left = T->nil;
z->right = T->nil;
z->color = RED;
// z->left = T->nil;
// z->right = T->nil;
// z->color = RED;
rbtree_insert_fixup(T, z);
}
// rbtree_insert_fixup(T, z);
// }
void rbtree_delete_fixup(rbtree *T, rbtree_node *x) {
// void rbtree_delete_fixup(rbtree *T, rbtree_node *x) {
while ((x != T->root) && (x->color == BLACK)) {
if (x == x->parent->left) {
// while ((x != T->root) && (x->color == BLACK)) {
// if (x == x->parent->left) {
rbtree_node *w= x->parent->right;
if (w->color == RED) {
w->color = BLACK;
x->parent->color = RED;
// rbtree_node *w= x->parent->right;
// if (w->color == RED) {
// w->color = BLACK;
// x->parent->color = RED;
rbtree_left_rotate(T, x->parent);
w = x->parent->right;
}
// rbtree_left_rotate(T, x->parent);
// w = x->parent->right;
// }
if ((w->left->color == BLACK) && (w->right->color == BLACK)) {
w->color = RED;
x = x->parent;
} else {
// if ((w->left->color == BLACK) && (w->right->color == BLACK)) {
// w->color = RED;
// x = x->parent;
// } else {
if (w->right->color == BLACK) {
w->left->color = BLACK;
w->color = RED;
rbtree_right_rotate(T, w);
w = x->parent->right;
}
// if (w->right->color == BLACK) {
// w->left->color = BLACK;
// w->color = RED;
// rbtree_right_rotate(T, w);
// w = x->parent->right;
// }
w->color = x->parent->color;
x->parent->color = BLACK;
w->right->color = BLACK;
rbtree_left_rotate(T, x->parent);
// w->color = x->parent->color;
// x->parent->color = BLACK;
// w->right->color = BLACK;
// rbtree_left_rotate(T, x->parent);
x = T->root;
}
// x = T->root;
// }
} else {
// } else {
rbtree_node *w = x->parent->left;
if (w->color == RED) {
w->color = BLACK;
x->parent->color = RED;
rbtree_right_rotate(T, x->parent);
w = x->parent->left;
}
// rbtree_node *w = x->parent->left;
// if (w->color == RED) {
// w->color = BLACK;
// x->parent->color = RED;
// rbtree_right_rotate(T, x->parent);
// w = x->parent->left;
// }
if ((w->left->color == BLACK) && (w->right->color == BLACK)) {
w->color = RED;
x = x->parent;
} else {
// if ((w->left->color == BLACK) && (w->right->color == BLACK)) {
// w->color = RED;
// x = x->parent;
// } else {
if (w->left->color == BLACK) {
w->right->color = BLACK;
w->color = RED;
rbtree_left_rotate(T, w);
w = x->parent->left;
}
// if (w->left->color == BLACK) {
// w->right->color = BLACK;
// w->color = RED;
// rbtree_left_rotate(T, w);
// w = x->parent->left;
// }
w->color = x->parent->color;
x->parent->color = BLACK;
w->left->color = BLACK;
rbtree_right_rotate(T, x->parent);
// w->color = x->parent->color;
// x->parent->color = BLACK;
// w->left->color = BLACK;
// rbtree_right_rotate(T, x->parent);
x = T->root;
}
// x = T->root;
// }
}
}
// }
// }
x->color = BLACK;
}
// x->color = BLACK;
// }
rbtree_node *rbtree_delete(rbtree *T, rbtree_node *z) {
// rbtree_node *rbtree_delete(rbtree *T, rbtree_node *z) {
rbtree_node *y = T->nil;
rbtree_node *x = T->nil;
// rbtree_node *y = T->nil;
// rbtree_node *x = T->nil;
if ((z->left == T->nil) || (z->right == T->nil)) {
y = z;
} else {
y = rbtree_successor(T, z);
}
// if ((z->left == T->nil) || (z->right == T->nil)) {
// y = z;
// } else {
// y = rbtree_successor(T, z);
// }
if (y->left != T->nil) {
x = y->left;
} else if (y->right != T->nil) {
x = y->right;
}
// if (y->left != T->nil) {
// x = y->left;
// } else if (y->right != T->nil) {
// x = y->right;
// }
x->parent = y->parent;
if (y->parent == T->nil) {
T->root = x;
} else if (y == y->parent->left) {
y->parent->left = x;
} else {
y->parent->right = x;
}
// x->parent = y->parent;
// if (y->parent == T->nil) {
// T->root = x;
// } else if (y == y->parent->left) {
// y->parent->left = x;
// } else {
// y->parent->right = x;
// }
if (y != z) {
#if ENABLE_KEY_CHAR
// if (y != z) {
// #if ENABLE_KEY_CHAR
void *tmp = z->key;
z->key = y->key;
y->key = tmp;
// void *tmp = z->key;
// z->key = y->key;
// y->key = tmp;
tmp = z->value;
z->value= y->value;
y->value = tmp;
// tmp = z->value;
// z->value= y->value;
// y->value = tmp;
#else
z->key = y->key;
z->value = y->value;
#endif
}
// #else
// z->key = y->key;
// z->value = y->value;
// #endif
// }
if (y->color == BLACK) {
rbtree_delete_fixup(T, x);
}
// if (y->color == BLACK) {
// rbtree_delete_fixup(T, x);
// }
return y;
}
// return y;
// }
rbtree_node *rbtree_search(rbtree *T, KEY_TYPE key) {
// rbtree_node *rbtree_search(rbtree *T, KEY_TYPE key) {
rbtree_node *node = T->root;
while (node != T->nil) {
#if ENABLE_KEY_CHAR
// rbtree_node *node = T->root;
// while (node != T->nil) {
// #if ENABLE_KEY_CHAR
if (strcmp(key, node->key) < 0) {
node = node->left;
} else if (strcmp(key, node->key) > 0) {
node = node->right;
} else {
return node;
}
// if (strcmp(key, node->key) < 0) {
// node = node->left;
// } else if (strcmp(key, node->key) > 0) {
// node = node->right;
// } else {
// return node;
// }
#else
if (key < node->key) {
node = node->left;
} else if (key > node->key) {
node = node->right;
} else {
return node;
}
#endif
}
return T->nil;
}
// #else
// if (key < node->key) {
// node = node->left;
// } else if (key > node->key) {
// node = node->right;
// } else {
// return node;
// }
// #endif
// }
// return T->nil;
// }
void rbtree_traversal(rbtree *T, rbtree_node *node) {
if (node != T->nil) {
rbtree_traversal(T, node->left);
#if ENABLE_KEY_CHAR
printf("key:%s, value:%s\n", node->key, (char *)node->value);
#else
printf("key:%d, color:%d\n", node->key, node->color);
#endif
rbtree_traversal(T, node->right);
}
}
// void rbtree_traversal(rbtree *T, rbtree_node *node) {
// if (node != T->nil) {
// rbtree_traversal(T, node->left);
// #if ENABLE_KEY_CHAR
// printf("key:%s, value:%s\n", node->key, (char *)node->value);
// #else
// printf("key:%d, color:%d\n", node->key, node->color);
// #endif
// rbtree_traversal(T, node->right);
// }
// }
#if 0
// #if 0
int main() {
// int main() {
#if ENABLE_KEY_CHAR
// #if ENABLE_KEY_CHAR
char* keyArray[10] = {"King", "Darren", "Mark", "Vico", "Nick", "qiuxiang", "youzi", "taozi", "123", "234"};
char* valueArray[10] = {"1King", "2Darren", "3Mark", "4Vico", "5Nick", "6qiuxiang", "7youzi", "8taozi", "9123", "10234"};
// char* keyArray[10] = {"King", "Darren", "Mark", "Vico", "Nick", "qiuxiang", "youzi", "taozi", "123", "234"};
// char* valueArray[10] = {"1King", "2Darren", "3Mark", "4Vico", "5Nick", "6qiuxiang", "7youzi", "8taozi", "9123", "10234"};
rbtree *T = (rbtree *)malloc(sizeof(rbtree));
if (T == NULL) {
printf("malloc failed\n");
return -1;
}
// rbtree *T = (rbtree *)malloc(sizeof(rbtree));
// if (T == NULL) {
// printf("malloc failed\n");
// return -1;
// }
T->nil = (rbtree_node*)malloc(sizeof(rbtree_node));
T->nil->color = BLACK;
T->root = T->nil;
// T->nil = (rbtree_node*)malloc(sizeof(rbtree_node));
// T->nil->color = BLACK;
// T->root = T->nil;
rbtree_node *node = T->nil;
int i = 0;
for (i = 0;i < 10;i ++) {
node = (rbtree_node*)malloc(sizeof(rbtree_node));
// rbtree_node *node = T->nil;
// int i = 0;
// for (i = 0;i < 10;i ++) {
// node = (rbtree_node*)malloc(sizeof(rbtree_node));
node->key = malloc(strlen(keyArray[i]) + 1);
memset(node->key, 0, strlen(keyArray[i]) + 1);
strcpy(node->key, keyArray[i]);
// node->key = malloc(strlen(keyArray[i]) + 1);
// memset(node->key, 0, strlen(keyArray[i]) + 1);
// strcpy(node->key, keyArray[i]);
node->value = malloc(strlen(valueArray[i]) + 1);
memset(node->value, 0, strlen(valueArray[i]) + 1);
strcpy(node->value, valueArray[i]);
// node->value = malloc(strlen(valueArray[i]) + 1);
// memset(node->value, 0, strlen(valueArray[i]) + 1);
// strcpy(node->value, valueArray[i]);
rbtree_insert(T, node);
// rbtree_insert(T, node);
}
// }
rbtree_traversal(T, T->root);
printf("----------------------------------------\n");
// rbtree_traversal(T, T->root);
// printf("----------------------------------------\n");
for (i = 0;i < 10;i ++) {
// for (i = 0;i < 10;i ++) {
rbtree_node *node = rbtree_search(T, keyArray[i]);
rbtree_node *cur = rbtree_delete(T, node);
free(cur);
// rbtree_node *node = rbtree_search(T, keyArray[i]);
// rbtree_node *cur = rbtree_delete(T, node);
// free(cur);
rbtree_traversal(T, T->root);
printf("----------------------------------------\n");
}
// rbtree_traversal(T, T->root);
// printf("----------------------------------------\n");
// }
#else
// #else
int keyArray[20] = {24,25,13,35,23, 26,67,47,38,98, 20,19,17,49,12, 21,9,18,14,15};
// int keyArray[20] = {24,25,13,35,23, 26,67,47,38,98, 20,19,17,49,12, 21,9,18,14,15};
rbtree *T = (rbtree *)malloc(sizeof(rbtree));
if (T == NULL) {
printf("malloc failed\n");
return -1;
}
// rbtree *T = (rbtree *)malloc(sizeof(rbtree));
// if (T == NULL) {
// printf("malloc failed\n");
// return -1;
// }
T->nil = (rbtree_node*)malloc(sizeof(rbtree_node));
T->nil->color = BLACK;
T->root = T->nil;
// T->nil = (rbtree_node*)malloc(sizeof(rbtree_node));
// T->nil->color = BLACK;
// T->root = T->nil;
rbtree_node *node = T->nil;
int i = 0;
for (i = 0;i < 20;i ++) {
node = (rbtree_node*)malloc(sizeof(rbtree_node));
node->key = keyArray[i];
node->value = NULL;
// rbtree_node *node = T->nil;
// int i = 0;
// for (i = 0;i < 20;i ++) {
// node = (rbtree_node*)malloc(sizeof(rbtree_node));
// node->key = keyArray[i];
// node->value = NULL;
rbtree_insert(T, node);
// rbtree_insert(T, node);
}
// }
rbtree_traversal(T, T->root);
printf("----------------------------------------\n");
// rbtree_traversal(T, T->root);
// printf("----------------------------------------\n");
for (i = 0;i < 20;i ++) {
// for (i = 0;i < 20;i ++) {
rbtree_node *node = rbtree_search(T, keyArray[i]);
rbtree_node *cur = rbtree_delete(T, node);
free(cur);
// rbtree_node *node = rbtree_search(T, keyArray[i]);
// rbtree_node *cur = rbtree_delete(T, node);
// free(cur);
rbtree_traversal(T, T->root);
printf("----------------------------------------\n");
}
#endif
// rbtree_traversal(T, T->root);
// printf("----------------------------------------\n");
// }
// #endif
}
// }
#endif
// #endif
typedef struct _rbtree kvs_rbtree_t;
// typedef struct _rbtree kvs_rbtree_t;
kvs_rbtree_t global_rbtree;
// kvs_rbtree_t global_rbtree;
// 5 + 2
int kvs_rbtree_create(kvs_rbtree_t *inst) {
// // 5 + 2
// int kvs_rbtree_create(kvs_rbtree_t *inst) {
if (inst == NULL) return 1;
// if (inst == NULL) return 1;
inst->nil = (rbtree_node*)kvs_malloc(sizeof(rbtree_node));
inst->nil->color = BLACK;
inst->root = inst->nil;
// inst->nil = (rbtree_node*)kvs_malloc(sizeof(rbtree_node));
// inst->nil->color = BLACK;
// inst->root = inst->nil;
return 0;
// return 0;
}
// }
void kvs_rbtree_destroy(kvs_rbtree_t *inst) {
// void kvs_rbtree_destroy(kvs_rbtree_t *inst) {
if (inst == NULL) return ;
// if (inst == NULL) return ;
rbtree_node *node = NULL;
// rbtree_node *node = NULL;
while (!(node = inst->root)) {
// while (!(node = inst->root)) {
rbtree_node *mini = rbtree_mini(inst, node);
// rbtree_node *mini = rbtree_mini(inst, node);
rbtree_node *cur = rbtree_delete(inst, mini);
kvs_free(cur);
// rbtree_node *cur = rbtree_delete(inst, mini);
// kvs_free(cur);
}
// }
kvs_free(inst->nil);
// kvs_free(inst->nil);
return ;
// return ;
}
// }
int kvs_rbtree_set(kvs_rbtree_t *inst, char *key, char *value) {
// int kvs_rbtree_set(kvs_rbtree_t *inst, char *key, char *value) {
if (!inst || !key || !value) return -1;
// if (!inst || !key || !value) return -1;
rbtree_node *node = (rbtree_node*)kvs_malloc(sizeof(rbtree_node));
// rbtree_node *node = (rbtree_node*)kvs_malloc(sizeof(rbtree_node));
node->key = kvs_malloc(strlen(key) + 1);
if (!node->key) return -2;
memset(node->key, 0, strlen(key) + 1);
strcpy(node->key, key);
// node->key = kvs_malloc(strlen(key) + 1);
// if (!node->key) return -2;
// memset(node->key, 0, strlen(key) + 1);
// strcpy(node->key, key);
node->value = kvs_malloc(strlen(value) + 1);
if (!node->value) return -2;
memset(node->value, 0, strlen(value) + 1);
strcpy(node->value, value);
// node->value = kvs_malloc(strlen(value) + 1);
// if (!node->value) return -2;
// memset(node->value, 0, strlen(value) + 1);
// strcpy(node->value, value);
rbtree_insert(inst, node);
// rbtree_insert(inst, node);
return 0;
}
// return 0;
// }
char* kvs_rbtree_get(kvs_rbtree_t *inst, char *key) {
// char* kvs_rbtree_get(kvs_rbtree_t *inst, char *key) {
if (!inst || !key) return NULL;
rbtree_node *node = rbtree_search(inst, key);
if (!node) return NULL; // no exist
if (node == inst->nil) return NULL;
// if (!inst || !key) return NULL;
// rbtree_node *node = rbtree_search(inst, key);
// if (!node) return NULL; // no exist
// if (node == inst->nil) return NULL;
return node->value;
// return node->value;
}
// }
int kvs_rbtree_del(kvs_rbtree_t *inst, char *key) {
// int kvs_rbtree_del(kvs_rbtree_t *inst, char *key) {
if (!inst || !key) return -1;
// if (!inst || !key) return -1;
rbtree_node *node = rbtree_search(inst, key);
if (!node) return 1; // no exist
// rbtree_node *node = rbtree_search(inst, key);
// if (!node) return 1; // no exist
rbtree_node *cur = rbtree_delete(inst, node);
free(cur);
// rbtree_node *cur = rbtree_delete(inst, node);
// free(cur);
return 0;
}
// return 0;
// }
int kvs_rbtree_mod(kvs_rbtree_t *inst, char *key, char *value) {
// int kvs_rbtree_mod(kvs_rbtree_t *inst, char *key, char *value) {
if (!inst || !key || !value) return -1;
// if (!inst || !key || !value) return -1;
rbtree_node *node = rbtree_search(inst, key);
if (!node) return 1; // no exist
if (node == inst->nil) return 1;
// rbtree_node *node = rbtree_search(inst, key);
// if (!node) return 1; // no exist
// if (node == inst->nil) return 1;
kvs_free(node->value);
// kvs_free(node->value);
node->value = kvs_malloc(strlen(value) + 1);
if (!node->value) return -2;
// node->value = kvs_malloc(strlen(value) + 1);
// if (!node->value) return -2;
memset(node->value, 0, strlen(value) + 1);
strcpy(node->value, value);
// memset(node->value, 0, strlen(value) + 1);
// strcpy(node->value, value);
return 0;
// return 0;
}
// }
int kvs_rbtree_exist(kvs_rbtree_t *inst, char *key) {
// int kvs_rbtree_exist(kvs_rbtree_t *inst, char *key) {
if (!inst || !key) return -1;
// if (!inst || !key) return -1;
rbtree_node *node = rbtree_search(inst, key);
if (!node) return 1; // no exist
if (node == inst->nil) return 1;
// rbtree_node *node = rbtree_search(inst, key);
// if (!node) return 1; // no exist
// if (node == inst->nil) return 1;
return 0;
}
// return 0;
// }