lodborg / interval-tree
Implementation of a dynamic interval tree, supporting efficient lookup for all intervals intersecting a query.
☆30Updated 5 years ago
Alternatives and similar repositories for interval-tree:
Users that are interested in interval-tree are comparing it to the libraries listed below
- Master repository for the JHeaps project☆47Updated 4 years ago
- A hashmap implementation for Java that stores map entries off-heap☆70Updated 4 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆28Updated 3 months ago
- Java API for libaio☆15Updated 3 years ago
- A simple and high-performance Java B-tree: drop-in replacement for java.util.TreeMap☆28Updated 5 years ago
- 64-bit integer compression algorithms in Java☆15Updated 6 years ago
- Hyper-Dimensional R-Tree Index in Java☆71Updated 6 years ago
- Java serialization, faster and space efficient version of ObjectOutputStream☆45Updated 4 years ago
- A fast and space efficient Radix tree in Java☆126Updated 5 years ago
- Banana is a Java primitive collections library with its own memory management☆72Updated 3 years ago
- Extremely fast and compact in-memory embedded column oriented database☆19Updated 7 years ago
- ☆29Updated 3 years ago
- Java Software Transactional Memory☆57Updated 4 years ago
- New proposed API for buffers in Netty☆27Updated 2 years ago
- Java implementation of the Sparkey key value store☆119Updated last year
- Sux4J is an effort to bring succinct data structures to Java.☆161Updated last year
- simple rules engine☆91Updated 5 years ago
- Keap is a heap data structure presenting stable PriorityQueue and stable Keapsort sorting algorithm☆12Updated last year
- Tiny Java utility to incrementally calculate Mean and Standard Deviation with a numerically stable algorithm.☆35Updated 3 years ago
- High performance native memory access for Java.☆125Updated last week
- A java.util.HashMap compatible map that won't stall puts or gets when resizing☆151Updated 2 years ago
- Spatial index library with R*Tree, STR-Tree, Quadtree, CritBit, KD-Tree, CoverTree and PH-Tree☆114Updated 8 months ago
- Java 8 implementation of a red-black interval-tree, with testing☆39Updated 3 years ago
- Persistent Adaptive Radix Trees in Java☆81Updated 4 years ago
- Persistent Memory library for pure Java☆25Updated last year
- Benchmark of open source, embedded, memory-mapped, key-value stores available from Java (JMH)☆141Updated 2 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆151Updated 4 years ago
- Java Hashing, CRC and Checksum Benchmark (JMH)☆68Updated 4 years ago
- SIMD Intrinsics in the JVM☆48Updated 7 years ago
- Dynatrace hash library for Java☆103Updated this week