lemonrock / context-allocatorLinks
Rust crate to support allocation in contexts
☆15Updated 3 years ago
Alternatives and similar repositories for context-allocator
Users that are interested in context-allocator are comparing it to the libraries listed below
Sorting:
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- Composable, lock-free, allocation-light data structures☆60Updated 7 years ago
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- A minimal in-memory database with relational algebraic expressions as queries☆62Updated 4 years ago
- Implementation of triple buffering in Rust☆94Updated 2 months ago
- Judy array implementation in pure Rust☆88Updated 8 years ago
- [DEPRECATED] A simple object arena☆37Updated 4 years ago
- Simple probabilistic data structures☆147Updated last week
- This crate provides Rust bindings for the Open MPI Portable Hardware Locality "hwloc" library☆90Updated 4 years ago
- io_uring proof of concept in rust, integrated with tokio timers/executor (but not the reactor ofc)☆46Updated 6 years ago
- probe: Static probes for Rust☆99Updated 2 years ago
- A rust wrapper for Infinity, a lightweight RDMA library for InfiniBand☆52Updated 6 years ago
- ☆53Updated 5 years ago
- Set theory applied on sorted and deduplicated slices.☆47Updated 3 years ago
- Rust library providing `Zc` for self-referential zero-copy structures☆41Updated 4 years ago
- Simplify the use of performance counters.☆64Updated 3 years ago
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago
- liburing bindings☆35Updated 3 years ago
- Concurrent hash trie☆58Updated 5 years ago
- Take a reference and get back a slice of length one☆25Updated 4 years ago
- Rust library to program hardware performance counter.☆54Updated 2 years ago
- A linked-list based, lock-free concurrent hashmap in Rust.☆164Updated 5 years ago
- Pillars for Transactional Systems and Data Grids☆133Updated last year
- A concurrent lock-free hash map for Rust.☆21Updated 4 years ago
- A fast pure-rust no-unsafe implementation of LZ4 compression and decompression☆111Updated last year
- Epoch-based garbage collection☆81Updated 6 years ago
- A growable bit-vector for Rust, optimized for size☆45Updated 8 months ago
- Dynamically query a type-erased object for any trait implementation☆67Updated 3 years ago
- An idiomatic and fast QP-trie implementation in pure Rust.☆102Updated last year
- skiplist☆142Updated 3 years ago