Efficiently-updatable double-array trie in Rust (ported from cedar)
☆107Dec 15, 2022Updated 3 years ago
Alternatives and similar repositories for cedarwood
Users that are interested in cedarwood are comparing it to the libraries listed below
Sorting:
- Double Array Trie in Rust☆56Jul 7, 2019Updated 6 years ago
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆46Feb 25, 2024Updated 2 years ago
- An implementation of the `group_by` Haskell function for slice and strings☆54May 3, 2023Updated 2 years ago
- ☆39May 25, 2020Updated 5 years ago
- A trait to abstract over common tree functionality☆35Jan 2, 2020Updated 6 years ago
- Wavelet Matrix implementation written in Rust☆16Sep 13, 2022Updated 3 years ago
- A foray into rust async await☆44Sep 19, 2019Updated 6 years ago
- Framework for reading and writing to binary files☆18Jul 13, 2019Updated 6 years ago
- Generic and convenient `std` atomics via `Atomic<T>`☆47May 17, 2025Updated 10 months ago
- Dropbox Discovery Tool by Tresorit☆21Jun 26, 2018Updated 7 years ago
- The Jieba Chinese Word Segmentation Implemented in Rust☆902Nov 18, 2025Updated 4 months ago
- ☆24Dec 11, 2022Updated 3 years ago
- IANA IPv4 and IPv6 number database