- increasing - Variable in class com.lodborg.intervaltree.TreeNode
-
A set containing all
Intervals stored in this node, ordered by their
end points.
- IntegerInterval - Class in com.lodborg.intervaltree
-
A class representing an interval with Integers as start and end points.
- IntegerInterval() - Constructor for class com.lodborg.intervaltree.IntegerInterval
-
Instantiates an interval extending from positive infinity to negative
infinity and thus containing all Integers.
- IntegerInterval(Integer, Integer, Interval.Bounded) - Constructor for class com.lodborg.intervaltree.IntegerInterval
-
Instantiates a new bounded interval.
- IntegerInterval(Integer, Interval.Unbounded) - Constructor for class com.lodborg.intervaltree.IntegerInterval
-
Instantiates a new unbounded interval - an interval that extends to positive or
negative infinity.
- intersects(Interval<T>) - Method in class com.lodborg.intervaltree.Interval
-
Checks if the current interval intersects another interval.
- Interval<T extends Comparable<? super T>> - Class in com.lodborg.intervaltree
-
A representation of a generic interval.
- Interval() - Constructor for class com.lodborg.intervaltree.Interval
-
Instantiates a new interval representing all points in the domain of definition,
i.e.
- Interval(T, T, Interval.Bounded) - Constructor for class com.lodborg.intervaltree.Interval
-
Instantiates a new bounded interval.
- Interval(T, Interval.Unbounded) - Constructor for class com.lodborg.intervaltree.Interval
-
Instantiates a new unbounded interval - an interval that extends to positive or
negative infinity.
- Interval.Bounded - Enum in com.lodborg.intervaltree
-
An enum representing all possible types of bounded intervals.
- Interval.Builder - Class in com.lodborg.intervaltree
-
Used to create new intervals in an intuitive fashion by using the builder pattern.
- Interval.Unbounded - Enum in com.lodborg.intervaltree
-
- IntervalTree<T extends Comparable<? super T>> - Class in com.lodborg.intervaltree
-
An implementation of a Centered Interval Tree for efficient search in a set of intervals.
- IntervalTree() - Constructor for class com.lodborg.intervaltree.IntervalTree
-
- isEmpty() - Method in class com.lodborg.intervaltree.DoubleInterval
-
Determines if the interval is empty, meaning it contains no Doubles.
- isEmpty() - Method in class com.lodborg.intervaltree.IntegerInterval
-
Determines if the interval is empty, meaning it contains no Integers.
- isEmpty() - Method in class com.lodborg.intervaltree.Interval
-
Checks if the current interval contains no points.
- isEndInclusive() - Method in class com.lodborg.intervaltree.Interval
-
Returns true, if the end point is a part of the interval, or false otherwise.
- isLeftOf(T, boolean) - Method in class com.lodborg.intervaltree.Interval
-
This method checks, if this current interval is entirely to the left of a point.
- isLeftOf(T) - Method in class com.lodborg.intervaltree.Interval
-
This method checks, if this current interval is entirely to the left of a point.
- isLeftOf(Interval<T>) - Method in class com.lodborg.intervaltree.Interval
-
This method checks, if this current interval is entirely to the left of another interval
with no common points.
- isPoint() - Method in class com.lodborg.intervaltree.Interval
-
Determines if the current interval is a single point.
- isRightOf(T, boolean) - Method in class com.lodborg.intervaltree.Interval
-
This method checks, if this current interval is entirely to the right of a point.
- isRightOf(T) - Method in class com.lodborg.intervaltree.Interval
-
This method checks, if this current interval is entirely to the right of a point.
- isRightOf(Interval<T>) - Method in class com.lodborg.intervaltree.Interval
-
This method checks, if this current interval is entirely to the right of another interval
with no common points.
- isStartInclusive() - Method in class com.lodborg.intervaltree.Interval
-
Returns true, if the start point is a part of the interval, or false otherwise.
- iterator() - Method in class com.lodborg.intervaltree.IntervalTree
-
- iterator() - Method in class com.lodborg.intervaltree.TreeNode
-
An iterator over all intervals stored in subtree rooted at the current node.