lodborg / interval-treeLinks
Implementation of a dynamic interval tree, supporting efficient lookup for all intervals intersecting a query.
☆31Updated 6 years ago
Alternatives and similar repositories for interval-tree
Users that are interested in interval-tree are comparing it to the libraries listed below
Sorting:
- Java implementation of the Sparkey key value store☆122Updated last year
- A hashmap implementation for Java that stores map entries off-heap☆72Updated 5 years ago
- Parallel boolean circuit evaluation☆26Updated 6 years ago
- Master repository for the JHeaps project☆50Updated 4 years ago
- ByteBuffer collection classes for java and jvm-based languages.☆33Updated 7 years ago
- Banana is a Java primitive collections library with its own memory management☆73Updated 4 years ago
- Persistent Adaptive Radix Trees in Java☆82Updated 5 years ago
- Provides off-heap storage for in-memory datagrid build in Turkey☆51Updated 10 years ago
- Sux4J is an effort to bring succinct data structures to Java.☆170Updated 3 months ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆153Updated 4 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆29Updated 8 months ago
- Java 8 implementation of a red-black interval-tree, with testing☆40Updated 4 years ago
- Library which contains several time-dependent data and index structures (e.g., IntervalTree, BucketTimeSeries), as well as algorithms.☆130Updated 2 months ago
- Hyper-Dimensional R-Tree Index in Java☆72Updated 7 years ago
- A java.util.HashMap compatible map that won't stall puts or gets when resizing☆152Updated 3 years ago
- A generic compact Trie implementation in Java. Built for high-performance applications.☆47Updated 4 years ago
- Java serialization, faster and space efficient version of ObjectOutputStream☆46Updated 4 years ago
- ☆22Updated 11 years ago
- Tools to work with off-heap memory using sun.misc.Unsafe☆136Updated 8 years ago
- Spatial index library with R*Tree, STR-Tree, Quadtree, CritBit, KD-Tree, CoverTree and PH-Tree☆114Updated last year
- High performance native memory access for Java.☆126Updated 4 months ago
- simple rules engine☆92Updated 5 years ago
- ☆12Updated 8 years ago
- Java library to create and search random access files (including in S3) using the space-filling hilbert index (sparse)☆49Updated this week
- AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation☆32Updated 8 years ago
- SIMD Intrinsics in the JVM☆48Updated 7 years ago
- Networking and buffer APIs and implementations for use in Copycat and Atomix☆52Updated 8 years ago
- Lightweight dataflow Java library. Includes various asynchronous constructs, including actors and asynchronous I/O requests.☆99Updated 2 years ago
- TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.☆124Updated 3 weeks ago
- A fast and space efficient Radix tree in Java☆128Updated 5 years ago