Skip to content

Update README.md #28

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
0x0c wants to merge 1 commit into from
Closed

Update README.md #28

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,13 +13,13 @@ Add `#include "IntervalTree.h"` to the source files in which you will use the in
To make an IntervalTree to contain objects of class T, use:

```c++
vector<Interval<T> > intervals;
vector<Interval<int, T> > intervals;
T a, b, c;
intervals.push_back(Interval<T>(2, 10, a));
intervals.push_back(Interval<T>(3, 4, b));
intervals.push_back(Interval<T>(20, 100, c));
IntervalTree<T> tree;
tree = IntervalTree<T>(intervals);
intervals.push_back(Interval<int, T>(2, 10, a));
intervals.push_back(Interval<int, T>(3, 4, b));
intervals.push_back(Interval<int, T>(20, 100, c));
IntervalTree<int, T> tree;
tree = IntervalTree<int, T>(std::move(intervals));
```

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