You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A Zig library of common data structures that keep data in order
17
+
A collection of data structures that keep data in order
17
18
18
19
</div>
19
20
20
21
---
21
22
22
-
Ordered Zig library includes implementations of popular data structures including B-tree, skip list, trie, and
23
-
red-black tree.
23
+
Ordered library includes fast and efficient implementations of popular data structures including
24
+
B-tree, skip list, trie, and red-black tree for Zig programming language.
24
25
25
-
### Features
26
+
### Supported Data Structures
26
27
27
-
- Implementations for common data structures that maintain the order of keys:
28
-
-[`BTreeMap`](src/btree_map.zig): A balanced tree map that maintains order of keys.
29
-
-[`OrderedSet`](src/sorted_set.zig): A set with ordered elements.
30
-
-[`SkipList`](src/skip_list.zig): A probabilistic data structure that allows fast search, insertion, and deletion.
31
-
-[`Trie`](src/trie.zig): A prefix tree for fast retrieval of keys with common prefixes.
32
-
-[`RedBlackTree`](src/red_black_tree.zig): A self-balancing binary search tree that maintains order of keys.
28
+
Currently supported data structures include:
29
+
30
+
-[B-tree](src/ordered/btree_map.zig): a balanced n-array tree that maintains the order of keys.
31
+
-[Sorted set](src/ordered/sorted_set.zig): a set with ordered elements based on keys.
32
+
-[Skip list](src/ordered/skip_list.zig): a probabilistic data structure that maintains sorted order using multiple linked lists.
33
+
-[Trie](src/ordered/trie.zig): a prefix tree that supports efficient retrieval of keys with common prefixes.
34
+
-[Red-black tree](src/ordered/red_black_tree.zig): A self-balancing binary search tree that maintains the order of keys
35
+
-[Cartesian tree](src/ordered/cartesian_tree.zig): A binary tree that maintains both a binary search tree property on keys and a heap property on priorities.
0 commit comments