Ordered Zig library includes implementations of popular data structures including B-tree, skip list, trie, and red-black tree.

Features

• Implementations for common data structures that maintain the order of keys:
  • BTreeMap: A balanced tree map that maintains order of keys.
  • OrderedSet: A set with ordered elements.
  • SkipList: A probabilistic data structure that allows fast search, insertion, and deletion.
  • Trie: A prefix tree for fast retrieval of keys with common prefixes.
  • RedBlackTree: A self-balancing binary search tree that maintains order of keys.

IMPORTANT Zig-DbC is in early development, so bugs and breaking API changes are expected. Please use the issues page to report bugs or request features.

Getting Started

To be added.

Documentation

You can find the API documentation for the latest release of Ordered here.

Alternatively, you can use the make docs command to generate the documentation for the current version of Ordered. This will generate HTML documentation in the docs/api directory, which you can serve locally with make serve-docs and view in a web browser.

Examples

Check out the examples directory for example usages of Ordered.

Contributing

See CONTRIBUTING.md for details on how to make a contribution.

License

Ordered is licensed under the MIT License (see LICENSE).

Acknowledgements

• The logo is from SVG Repo.