Skip to content

Add min/max functions to get the extent of the tree. #2

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

Merged
merged 1 commit into from
Apr 6, 2018
Merged

Add min/max functions to get the extent of the tree. #2

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: 12 additions & 0 deletions IntervalTree.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -158,6 +158,18 @@ class IntervalTree {
assert(is_valid().first);
}

Scalar min() const {
assert(!empty());
if (left) { return left->min(); }
return std::min_element(intervals.begin(), intervals.end(),
IntervalStartCmp())->start;
}
Scalar max() const {
assert(!empty());
if (right) { return right->max(); }
return std::max_element(intervals.begin(), intervals.end(),
IntervalStopCmp())->stop;
}
// Call f on all intervals near the range [start, stop]:
template <class UnaryFunction>
void visit_near(const Scalar& start, const Scalar& stop, UnaryFunction f) const {
Expand Down