Ordered

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

IMPORTANT This library is in very early stages of development and is not yet ready for serious use. The API is not stable and may change frequently. Additionally, it's not thoroughly tested or optimized so use it at your own risk.

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.

Getting Started

To be added.

Contributing

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

Logo

The logo is from SVG Repo.

License

This project is licensed under the MIT License (LICENSE).