Alternatives and similar repositories for segment-tree

Users that are interested in segment-tree are comparing it to the libraries listed below

• rust-lang / odht
  An on-disk hash table implementation
  ☆123Updated 3 years ago
• jonhoo / sento
  A lock-free, append-only atomic pool.
  ☆67Updated 3 years ago
• asynchronics / st3
  Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
  ☆80Updated 10 months ago
• jonhoo / bustle
  A benchmarking harness for concurrent key-value collections
  ☆119Updated 2 years ago
• dtolnay / essay
  docs.rs as a publishing platform?
  ☆69Updated last month
• craftytrickster / stubborn-io
  io traits/structs for tokio that automatically recover from potential disconnections/interruptions
  ☆72Updated last year
• m-ou-se / linux-futex
  Rust interface for Linux futexes, the fast user-space locking primitive.
  ☆87Updated last year
• sunfishcode / io-lifetimes
  A low-level I/O ownership and borrowing library
  ☆102Updated 7 months ago
• smol-rs / waker-fn
  Convert closures into wakers
  ☆45Updated 5 months ago
• Amanieu / seqlock
  A reader-writer lock that provides extremely fast read access without starving writers
  ☆81Updated last year
• Gregory-Meyer / cht
  Lockfree resizeable concurrent hash table.
  ☆54Updated 3 years ago
• kyren / hashlink
  An updated version of linked-hash-map and friends
  ☆120Updated 3 months ago
• dtolnay / oqueue
  Non-interleaving multithreaded output queue
  ☆71Updated last month
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆115Updated 4 months ago
• marmeladema / clru-rs
  An LRU cache implementation with constant time operations and weighted semantic.
  ☆46Updated 6 months ago
• cofibrant / obake
  Versioned data-structures for Rust
  ☆206Updated 4 months ago
• jedisct1 / rust-coarsetime
  Time and duration crate optimized for speed and API stability.
  ☆72Updated last month
• kprotty / yaar
  Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability
  ☆81Updated 3 years ago
• udoprog / unicycle
  A futures abstraction that runs a set of futures which may complete in any order.
  ☆90Updated 3 months ago
• smol-rs / cache-padded
  [DEPRECATED] Prevent false sharing by padding and aligning to the length of a cache line
  ☆51Updated 2 years ago
• sdleffler / qp-trie-rs
  An idiomatic and fast QP-trie implementation in pure Rust.
  ☆101Updated last year
• sekineh / binary-heap-plus-rs
  Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.
  ☆57Updated last year
• google / moveit
  ☆167Updated 2 years ago
• fitzgen / associative-cache
  A generic, fixed-size, associative cache
  ☆40Updated 8 months ago
• dtolnay / ghost
  Define your own PhantomData
  ☆155Updated this week
• withoutboats / kudzu
  skiplist
  ☆142Updated 3 years ago
• jeehoonkang / membarrier-rs
  Rust library for memory barrier
  ☆35Updated last year
• dtolnay / dragonbox
  ☆58Updated last month
• smol-rs / atomic-waker
  futures::AtomicWaker extracted into its own crate
  ☆27Updated last month
• przygienda / dot-rust
  A library for generating Graphviz DOT language files for graphs.
  ☆76Updated 3 months ago