salmans / coddLinks
A minimal in-memory database with relational algebraic expressions as queries
☆62Updated 4 years ago
Alternatives and similar repositories for codd
Users that are interested in codd are comparing it to the libraries listed below
Sorting:
- PEG parser generator built on top of nom☆70Updated 6 years ago
- An experimental columnar arena☆43Updated 11 months ago
- scraps of a potential language☆38Updated 4 years ago
- ☆49Updated 4 months ago
- Compact sets in rust☆56Updated 7 months ago
- Set theory applied on sorted and deduplicated slices.☆47Updated 3 years ago
- Pillars for Transactional Systems and Data Grids☆133Updated last year
- The simd optimized escape code☆54Updated last week
- A flexible and convenient high-level mmap for zero-copy file I/O.☆115Updated 7 months ago
- A fast pure-rust no-unsafe implementation of LZ4 compression and decompression☆111Updated last year
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- Simple, Erlang-inspired fault-tolerance framework for Rust Futures.☆130Updated 4 years ago
- Concurrent hash trie☆58Updated 5 years ago
- Retriever stores ordinary rust data types in a similar manner as a NoSQL database.☆47Updated 2 years ago
- A fast, small, full-featured, no-std compatible oneshot channel☆60Updated last year
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago
- [DEPRECATED] A simple object arena☆37Updated 4 years ago
- An intrusive splay tree implementation that is no-std compatible and free from allocation and moves☆67Updated 6 months ago
- Cache & In-Memory optimizations for Rust, revived from the slabs of Sumer.☆30Updated 5 years ago
- Type-level named values with partial dependent type support in Rust☆57Updated 3 years ago
- Derive macro for generating arrays from struct fields.☆20Updated 3 years ago
- Log call tree summaries after each request for rust programs instrumented with `tracing`.☆44Updated 3 years ago
- Spawn processes with arbitrary closures in rust☆113Updated 4 years ago
- A growable bit-vector for Rust, optimized for size☆45Updated 8 months ago
- ☆112Updated last year
- Composable, lock-free, allocation-light data structures☆60Updated 7 years ago
- A clean, efficient parser combinator☆124Updated 3 years ago
- Utility for reusing memory☆53Updated 5 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆52Updated 2 years ago
- skiplist☆142Updated 3 years ago