height optimized trie

UncP · Nov 2, 2019 · ba4c2ef · ba4c2ef
1 parent 4ff0132
commit ba4c2ef
Show file tree

Hide file tree

Showing 5 changed files with 47 additions and 0 deletions.
diff --git a/README.md b/README.md
@@ -13,6 +13,7 @@ A library that provides various concurrent algorithms for in-memory index, aims
 * B<sup>link</sup> Tree (`blink/`)
 * Mass Tree (`mass/`)
 * Adaptive Radix Tree (`art/`)
+* Height Optimized Trie (`hot/`) (developing)
 
 #### Version
 

diff --git a/hot/hot.c b/hot/hot.c
@@ -0,0 +1,5 @@
+/**
+ *    author:     UncP
+ *    date:    2019-11-02
+ *    license:    BSD-3
+**/
diff --git a/hot/hot.h b/hot/hot.h
@@ -0,0 +1,5 @@
+/**
+ *    author:     UncP
+ *    date:    2019-11-02
+ *    license:    BSD-3
+**/
diff --git a/hot/hot_node.c b/hot/hot_node.c
@@ -0,0 +1,23 @@
+/**
+ *    author:     UncP
+ *    date:    2019-11-02
+ *    license:    BSD-3
+**/
+
+#include <stdint.h>
+
+#include "hot_node.h"
+
+#define node_header  \
+  uint64_t type:3;   \
+  uint64_t height:3; \
+  uint64_t n_keys:6; \
+  uint64_t locked:1; \
+  uint64_t unused:51;
+
+typedef struct hot_node_s_8
+{
+  node_header;
+  uint8_t keys[32];
+  void   *childs[32];
+}hot_node_s_8;
diff --git a/hot/hot_node.h b/hot/hot_node.h
@@ -0,0 +1,13 @@
+/**
+ *    author:     UncP
+ *    date:    2019-11-02
+ *    license:    BSD-3
+**/
+
+#ifndef _hot_node_h_
+#define _hot_node_h_
+
+typedef struct hot_node hot_node;
+
+
+#endif /* _hot_node_h_ */