Darksonn / segment-tree
A Rust implementation of two segment trees and a fenwick tree.
☆65Updated 6 years ago
Alternatives and similar repositories for segment-tree:
Users that are interested in segment-tree are comparing it to the libraries listed below
- Convert closures into wakers☆45Updated last month
- docs.rs as a publishing platform?☆68Updated 3 weeks ago
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago
- Rust interface for Linux futexes, the fast user-space locking primitive.☆86Updated 9 months ago
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆68Updated 10 months ago
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- A lock-free, append-only atomic pool.☆66Updated 2 years ago
- A futures abstraction that runs a set of futures which may complete in any order.☆89Updated 7 months ago
- A reader-writer lock that provides extremely fast read access without starving writers☆77Updated last year
- Run closures in parallel☆113Updated last month
- A growable bit-vector for Rust, optimized for size☆40Updated 3 weeks ago
- Rust library for memory barrier☆35Updated 9 months ago
- futures::AtomicWaker extracted into its own crate☆25Updated last month
- A global executor built on top of async-executor and smol☆73Updated 2 weeks ago
- A rust crate to find the total size of an object, on the stack and on the heap☆106Updated last year
- (lifetime) GATs on stable Rust☆57Updated last year
- Better reference counted strings for Rust☆118Updated 7 months ago
- Lending iterators on stable Rust☆82Updated last year
- An updated version of linked-hash-map and friends☆109Updated this week
- ☆92Updated last year
- Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.☆57Updated 11 months ago
- An LRU cache implementation with constant time operations and weighted semantic.☆42Updated 2 months ago
- [DEPRECATED] Prevent false sharing by padding and aligning to the length of a cache line☆51Updated last year
- Non-interleaving multithreaded output queue☆71Updated last week
- A low-level I/O ownership and borrowing library☆101Updated 3 months ago
- An on-disk hash table implementation☆113Updated 3 years ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆109Updated 2 weeks ago
- A benchmarking harness for concurrent key-value collections☆117Updated 2 years ago
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆70Updated 6 months ago
- Safe, zero-cost downcasting for limited compile-time specialization.☆156Updated last week