|
7 | 7 | <h2>Ordered</h2> |
8 | 8 |
|
9 | 9 | [](https://github.com/CogitatorTech/ordered/actions/workflows/tests.yml) |
10 | | -[](https://github.com/CogitatorTech/ordered/actions/workflows/benches.yml) |
| 10 | +[](https://github.com/CogitatorTech/ordered/actions/workflows/benches.yml) |
11 | 11 | [](https://www.codefactor.io/repository/github/CogitatorTech/ordered) |
| 12 | +[](https://ziglang.org/download/) |
| 13 | +<br> |
12 | 14 | [](https://CogitatorTech.github.io/ordered/) |
13 | 15 | [](https://github.com/CogitatorTech/ordered/tree/main/examples) |
14 | | -[](https://ziglang.org/download/) |
15 | 16 | [](https://github.com/CogitatorTech/ordered/releases/latest) |
16 | 17 | [](https://github.com/CogitatorTech/ordered/blob/main/LICENSE) |
17 | 18 |
|
18 | | -A collection of data structures that keep data in order in pure Zig |
| 19 | +Pure Zig implementations of high-performance, memory-safe ordered data structures |
19 | 20 |
|
20 | 21 | </div> |
21 | 22 |
|
22 | 23 | --- |
23 | 24 |
|
24 | | -Ordered is a Zig library that provides fast and efficient implementations of various popular data structures including |
| 25 | +Ordered is a Zig library that provides efficient implementations of various popular data structures including |
25 | 26 | B-tree, skip list, trie, and red-black tree for Zig programming language. |
26 | 27 |
|
27 | 28 | ### Features |
28 | 29 |
|
29 | | -- Fast and efficient implementations |
| 30 | +To be added. |
30 | 31 |
|
31 | 32 | ### Data Structures |
32 | 33 |
|
@@ -67,6 +68,10 @@ and view in a web browser. |
67 | 68 |
|
68 | 69 | Check out the [examples](examples) directory for example usages of Ordered. |
69 | 70 |
|
| 71 | +### Benchmarks |
| 72 | + |
| 73 | +To be added. |
| 74 | + |
70 | 75 | --- |
71 | 76 |
|
72 | 77 | ### Contributing |
|
0 commit comments