MnO2 / cedarwoodLinks
Efficiently-updatable double-array trie in Rust (ported from cedar)
☆102Updated 2 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☆53Updated 5 years ago
- A sentinel-based, heapless, `Vec`-like type.☆69Updated 5 years ago
- Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.☆57Updated last year
- Skiplist implementation in rust☆95Updated last week
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆165Updated last month
- ☆129Updated 5 years ago
- A suite of non-cryptographic hash functions for Rust.☆139Updated 3 years ago
- The simd optimized escape code☆54Updated this week
- Rust FFI wrapper for CRoaring☆158Updated 3 weeks ago
- ☆39Updated 5 years ago
- Ultra fast binary serialization and deserialization for types with a constant size (known at compile time).☆106Updated 2 years ago
- An LCS based slice and string diffing implementation.☆81Updated last year
- An idiomatic and fast QP-trie implementation in pure Rust.☆101Updated last year
- A small async runtime for Rust☆59Updated last year
- Access File System operations off-thread, using a Futures.☆69Updated 6 years ago
- Utilities for pinning☆97Updated last year
- ☆46Updated last year
- An on-disk hash table implementation☆120Updated 3 years ago
- A simple map based on a vector for small integer keys☆65Updated 6 months ago
- Chinese tokenizer for tantivy, based on jieba-rs☆79Updated last year
- Thread-safe object pool with automatic return and attach/detach semantics☆76Updated 8 months ago
- Support for Linux kernel aio within Tokio.☆51Updated 3 years ago
- Extended utilities for working with files and filesystems in Rust☆149Updated last year
- skiplist☆142Updated 3 years ago
- Concurrent hash trie☆54Updated 4 years ago
- Helper trait to create a boxed instance without going through stack☆36Updated 3 years ago
- Small Box optimization: store small item on stack and fallback to heap for large item.☆83Updated last week
- A Rust implementation of DEFLATE algorithm and related formats (ZLIB, GZIP)☆183Updated last year
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago