Jason W. Bacon 03b4820d4c devel/intervaltree: Minimal C++ interval tree implementation
An interval tree can be used to efficiently find a set of numeric
intervals overlapping or containing another interval.  This library
provides a basic implementation of an interval tree using C++
templates, allowing the insertion of arbitrary types into the tree.

Unbundled from biology/freebayes
2025-02-18 08:56:30 -06:00

4 lines
200 B
Plaintext

TIMESTAMP = 1739809365
SHA256 (ekg-intervaltree-0.1-2-gaa59377_GH0.tar.gz) = 4813653eade9572ed39a70e578958ccce845506ef23f609f680040d92c1d8868
SIZE (ekg-intervaltree-0.1-2-gaa59377_GH0.tar.gz) = 72565