Lines Matching refs:interval
43 // An interval tree, which is a form of augmented red-black tree. It
67 // interval. The returned intervals are sorted by increasing low
69 Vector<IntervalType> allOverlaps(const IntervalType& interval) const
72 allOverlaps(interval, result);
77 // interval. The returned intervals are sorted by increasing low
79 void allOverlaps(const IntervalType& interval, Vector<IntervalType>& result) const
83 searchForOverlapsFrom(this->root(), interval, result);
86 // Helper to create interval objects.
113 // interval to the result vector. The intervals are sorted by
115 void searchForOverlapsFrom(IntervalNode* node, const IntervalType& interval, Vector<IntervalType>& res) const
128 && !(left->data().maxHigh() < interval.low()))
129 searchForOverlapsFrom(left, interval, res);
132 if (node->data().overlaps(interval))
138 if (!(interval.high() < node->data().low()))
139 searchForOverlapsFrom(node->right(), interval, res);
215 static String string(const PODInterval<T, UserData>& interval)
217 return interval.toString();