https://github.com/ekg/intervaltree

a minimal C++ interval tree implementation
https://github.com/ekg/intervaltree

Last synced: 3 days ago
JSON representation

a minimal C++ interval tree implementation

• Host: GitHub
• URL: https://github.com/ekg/intervaltree
• Owner: ekg
• License: mit
• Created: 2011-11-04T19:02:09.000Z (about 13 years ago)
• Default Branch: master
• Last Pushed: 2021-03-11T13:08:51.000Z (over 3 years ago)
• Last Synced: 2024-07-31T22:53:57.164Z (3 months ago)
• Language: C++
• Homepage:
• Size: 119 KB
• Stars: 216
• Watchers: 18
• Forks: 66
• Open Issues: 11
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# intervaltree

## Overview

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.

## Usage

Add `#include "IntervalTree.h"` to the source files in which you will use the interval tree.

To make an IntervalTree to contain objects of class T, use:

```c++

vector > intervals;

T a, b, c;

intervals.push_back(Interval(2, 10, a));

intervals.push_back(Interval(3, 4, b));

intervals.push_back(Interval(20, 100, c));

IntervalTree tree;

tree = IntervalTree(intervals);

```

Now, it's possible to query the tree and obtain a set of intervals which are contained within the start and stop coordinates.

```c++

vector > results;

tree.findContained(start, stop, results);

cout << "found " << results.size() << " overlapping intervals" << endl;

```

The function IntervalTree::findOverlapping provides a method to find all those intervals which are contained or partially overlap the interval (start, stop).

### Author: Erik Garrison 

### License: MIT