lodborg / interval-treeLinks
Implementation of a dynamic interval tree, supporting efficient lookup for all intervals intersecting a query.
☆32Updated 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:
- Master repository for the JHeaps project☆52Updated 4 years ago
- Library which contains several time-dependent data and index structures (e.g., IntervalTree, BucketTimeSeries), as well as algorithms.☆131Updated 6 months ago
- Hyper-Dimensional R-Tree Index in Java☆75Updated 7 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆153Updated 5 years ago
- A hashmap implementation for Java that stores map entries off-heap☆73Updated 5 years ago
- Sux4J is an effort to bring succinct data structures to Java.☆171Updated 7 months ago
- A java.util.HashMap compatible map that won't stall puts or gets when resizing☆151Updated 3 years ago
- simple rules engine☆92Updated 5 years ago
- Parallel boolean circuit evaluation☆26Updated 7 years ago
- Java implementation of the Sparkey key value store☆124Updated last month
- TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.☆126Updated last month
- Provides off-heap storage for in-memory datagrid build in Turkey☆52Updated 10 years ago
- Banana is a Java primitive collections library with its own memory management☆74Updated 4 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆29Updated last year
- Java library to create and search random access files (including in S3) using the space-filling hilbert index (sparse)☆50Updated this week
- ☆30Updated 4 years ago
- Networking and buffer APIs and implementations for use in Copycat and Atomix☆52Updated 8 years ago
- Tools to work with off-heap memory using sun.misc.Unsafe