All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type |
Method and Description |
boolean |
add(IntervalTree.TreeNode<E,T> node,
T target) |
boolean |
add(IntervalTree.TreeNode<E,T> node,
T target,
double alpha) |
boolean |
add(T target) |
boolean |
addNonNested(T target) |
boolean |
addNonOverlapping(T target) |
void |
balance() |
IntervalTree.TreeNode<E,T> |
balance(IntervalTree.TreeNode<E,T> node) |
void |
check() |
void |
check(IntervalTree.TreeNode<E,T> treeNode) |
void |
clear() |
boolean |
contains(Object o) |
boolean |
contains(T target) |
static <E extends Comparable<E>,T extends HasInterval<E>> boolean |
containsInterval(IntervalTree<E,T> n,
E p,
boolean exact) |
static <E extends Comparable<E>,T extends HasInterval<E>> boolean |
containsInterval(IntervalTree<E,T> node,
Interval<E> target,
boolean exact) |
boolean |
containsInterval(T target,
boolean exact) |
static <E extends Comparable<E>,T extends HasInterval<E>> boolean |
containsValue(IntervalTree<E,T> node,
T target) |
IntervalTree.TreeNode<E,T> |
getLeftmostNode(IntervalTree.TreeNode<E,T> node) |
IntervalTree.TreeNode<E,T> |
getNode(IntervalTree.TreeNode<E,T> node,
int nodeIndex) |
static <T,E extends Comparable<E>> List<T> |
getNonNested(List<? extends T> items,
java.util.function.Function<? super T,Interval<E>> toIntervalFunc,
Comparator<? super T> compareFunc) |
static <T extends HasInterval<E>,E extends Comparable<E>> List<T> |
getNonOverlapping(List<? extends T> items) |
static <T extends HasInterval<E>,E extends Comparable<E>> List<T> |
getNonOverlapping(List<? extends T> items,
Comparator<? super T> compareFunc) |
static <T,E extends Comparable<E>> List<T> |
getNonOverlapping(List<? extends T> items,
java.util.function.Function<? super T,Interval<E>> toIntervalFunc) |
static <T,E extends Comparable<E>> List<T> |
getNonOverlapping(List<? extends T> items,
java.util.function.Function<? super T,Interval<E>> toIntervalFunc,
Comparator<? super T> compareFunc) |
static <T extends HasInterval<E>,E extends Comparable<E>> List<T> |
getNonOverlappingMaxScore(List<? extends T> items,
java.util.function.Function<? super T,Double> scoreFunc) |
static <T,E extends Comparable<E>> List<T> |
getNonOverlappingMaxScore(List<? extends T> items,
java.util.function.Function<? super T,Interval<E>> toIntervalFunc,
java.util.function.Function<? super T,Double> scoreFunc) |
static <E extends Comparable<E>,T extends HasInterval<E>> List<T> |
getOverlapping(IntervalTree.TreeNode<E,T> n,
E p) |
static <E extends Comparable<E>,T extends HasInterval<E>> void |
getOverlapping(IntervalTree.TreeNode<E,T> n,
E p,
List<T> result) |
static <E extends Comparable<E>,T extends HasInterval<E>> List<T> |
getOverlapping(IntervalTree.TreeNode<E,T> n,
Interval<E> target) |
static <E extends Comparable<E>,T extends HasInterval<E>> void |
getOverlapping(IntervalTree.TreeNode<E,T> node,
Interval<E> target,
List<T> result) |
List<T> |
getOverlapping(T target) |
IntervalTree.TreeNode<E,T> |
getRightmostNode(IntervalTree.TreeNode<E,T> node) |
int |
height() |
int |
height(IntervalTree.TreeNode<E,T> node) |
boolean |
isAlphaBalanced(IntervalTree.TreeNode<E,T> node,
double alpha) |
boolean |
isEmpty() |
Iterator<T> |
iterator() |
IntervalTree.TreeNode<E,T> |
leftRotate(IntervalTree.TreeNode<E,T> oldRoot) |
static <E extends Comparable<E>,T extends HasInterval<E>> boolean |
overlaps(IntervalTree.TreeNode<E,T> n,
E p) |
static <E extends Comparable<E>,T extends HasInterval<E>> boolean |
overlaps(IntervalTree.TreeNode<E,T> node,
Interval<E> target) |
boolean |
overlaps(T target) |
boolean |
remove(IntervalTree.TreeNode<E,T> node,
T target) |
boolean |
remove(Object o) |
boolean |
remove(T target) |
boolean |
removeAll(Collection<?> c) |
boolean |
retainAll(Collection<?> c) |
IntervalTree.TreeNode<E,T> |
rightRotate(IntervalTree.TreeNode<E,T> oldRoot) |
void |
rotateUp(IntervalTree.TreeNode<E,T> node,
IntervalTree.TreeNode<E,T> target) |
int |
size() |
String |
toString() |