contain-rs / trieLinks
An ordered map and set based on a trie.
☆28Updated 5 years ago
Alternatives and similar repositories for trie
Users that are interested in trie are comparing it to the libraries listed below
Sorting:
- A Raw utility for managing contiguous heap allocations☆10Updated 9 years ago
- A double-ended priority queue implemented with an interval heap.☆17Updated 8 years ago
- Ordered iterators☆10Updated 5 years ago
- A structure for holding a set of enum variants☆19Updated 6 years ago
- A simple map based on a vector for small integer keys☆67Updated last year
- Concurrent work-stealing deque☆48Updated 7 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆52Updated 2 years ago
- A reader-writer lock that can be used with a Condvar.☆29Updated 9 years ago
- Fast json encoder in rust, that encodes the structure of JSON values in their types☆83Updated 3 years ago
- Convert `try!()` into `?`s☆34Updated 8 years ago
- ☆27Updated 10 years ago
- An immutable singly-linked list, as seen in basically every functional language☆30Updated 2 years ago
- A small crate to provide space-efficient Option<_> replacements☆37Updated 8 months ago
- Emulating Higher-Kinded Types in Rust via Plug/Unplug. Also, Monads.☆30Updated 6 years ago
- A map backed by a vector☆26Updated last year
- The peano numbers implemented in Rust's type system.☆24Updated 9 years ago
- Epoch-based garbage collection☆81Updated 7 years ago
- An intrusive splay tree implementation that is no-std compatible and free from allocation and moves☆67Updated 7 months ago
- An experimental columnar arena☆43Updated last year
- Experimental persistent collections in Rust☆46Updated 8 years ago
- An in-memory topological sort algorithm for trees based on Group Theory☆23Updated 4 years ago
- Rust library providing a lazily filled Cell☆60Updated 5 years ago
- A cache that holds a limited number of key-value pairs☆84Updated 3 years ago
- Experimental collection traits for Rust☆28Updated 8 years ago
- software transactional memory in rust☆14Updated 4 years ago
- Inert lets you use non-Sync values in Sync context☆16Updated 6 years ago
- An ordered map and set based on a binary search tree.☆13Updated 10 years ago
- Ergonomic trie data structure☆27Updated 7 years ago
- A pool of reusable values☆51Updated 6 years ago
- Rust crate to use process file descriptors (pidfd) for Linux☆50Updated 6 months ago