mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

Mnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-tree

js-strange - Range object for JavaScript

•    Javascript

---

stRange.js is a range object for JavaScript. Use it to have a single value type with two endpoints and their boundaries. Also implements an interval tree for quick lookups. Stringifies itself in the style of [begin,end) and allows you to parse a string back. Also useful with PostgreSQL. stRange.js follows semantic versioning, so feel free to depend on its major version with something like >= 1.0.0 < 2 (a.k.a ^1.0.0).

range ranges interval interval-tree bst integer integers sort bounds math

RangeTree - A generic interval tree implementation in C#

•    CSharp

---

A generic implementation of a centered interval tree in C#. Also comes with an asynchronous version which rebuilds the tree using the Task Parallel Library (TPL). In computer science, an interval tree is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene.

c-sharp interval-tree tree tpl generic

ygg - An intrusive C++14 implementation of a Red-Black-Tree, an Interval Tree and an Interval Map.

•    C++

---

If you're not sure whether one of these data structures is the right data structure for your application, check out the datastructure overview in the Documentation. Warning: This is still in development. Therefore, things could break. Also, the API might change. If you found an example where one of the data structures does not behave as expected, please let me know.

red-black-tree data-structure interval-tree search-trees interval-set interval-map segment-tree cpp14

interval-tree - tree for float intervals

•    OCaml

---

tree for float intervals

ocaml-library interval-tree

rust-lapper - Rust implementation of a fast, easy, interval tree library nim-lapper

•    Rust

---

This is a rust port of Brent Pendersen's nim-lapper. It has a few notable differences, mostly that the find and seek methods both return iterators, so all adaptor methods may be used normally. This crate works well for most interval data that does not include very long intervals that engulf a majority of other intervals. It is still fairly comparable to other methods. If you absolutely need time guarantees in the worst case, see COItres and IITree.

tree bioinformatics algorithms interval-tree interval intervaltree