public class IntervalTree<T> extends RBTree<Integer,Integer>
| Constructor and Description |
|---|
IntervalTree(int maxLimit) |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
canDeleteNode(io.keikaiex.util.RBNode<Integer,Integer> n,
Object ctx) |
Collection<Interval<T>> |
contained(Interval<T> interval) |
Collection<Interval<T>> |
contains(Interval<T> interval) |
Interval<T> |
deleteInterval(Interval<T> interval,
Object context) |
protected void |
fixUp(List<io.keikaiex.util.RBTree.Traversal<Integer,Integer>> lineal) |
protected void |
insertDuplicate(io.keikaiex.util.RBNode<Integer,Integer> original,
io.keikaiex.util.RBNode<Integer,Integer> newone,
Object context) |
Interval<T> |
insertInterval(Interval<T> interval,
Object context) |
protected void |
insertLeft(io.keikaiex.util.RBNode<Integer,Integer> parent,
io.keikaiex.util.RBNode<Integer,Integer> child) |
protected void |
insertRight(io.keikaiex.util.RBNode<Integer,Integer> parent,
io.keikaiex.util.RBNode<Integer,Integer> child) |
protected void |
leftJumpUp(io.keikaiex.util.RBNode<Integer,Integer> g) |
Collection<Interval<T>> |
overlaps(Interval<T> interval) |
protected void |
replaceNode(io.keikaiex.util.RBNode<Integer,Integer> target,
io.keikaiex.util.RBNode<Integer,Integer> substitute) |
protected void |
rightJumpUp(io.keikaiex.util.RBNode<Integer,Integer> g) |
protected void |
rotateLeft(io.keikaiex.util.RBNode<Integer,Integer> g) |
protected void |
rotateRight(io.keikaiex.util.RBNode<Integer,Integer> g) |
Interval<T> |
searchInterval(Interval<T> interval) |
public Collection<Interval<T>> contains(Interval<T> interval)
public Collection<Interval<T>> contained(Interval<T> interval)
public Collection<Interval<T>> overlaps(Interval<T> interval)
protected void insertDuplicate(io.keikaiex.util.RBNode<Integer,Integer> original, io.keikaiex.util.RBNode<Integer,Integer> newone, Object context)
insertDuplicate in class RBTree<Integer,Integer>protected void insertLeft(io.keikaiex.util.RBNode<Integer,Integer> parent, io.keikaiex.util.RBNode<Integer,Integer> child)
insertLeft in class RBTree<Integer,Integer>protected void insertRight(io.keikaiex.util.RBNode<Integer,Integer> parent, io.keikaiex.util.RBNode<Integer,Integer> child)
insertRight in class RBTree<Integer,Integer>protected void rightJumpUp(io.keikaiex.util.RBNode<Integer,Integer> g)
rightJumpUp in class RBTree<Integer,Integer>protected void leftJumpUp(io.keikaiex.util.RBNode<Integer,Integer> g)
leftJumpUp in class RBTree<Integer,Integer>protected void rotateRight(io.keikaiex.util.RBNode<Integer,Integer> g)
rotateRight in class RBTree<Integer,Integer>protected void rotateLeft(io.keikaiex.util.RBNode<Integer,Integer> g)
rotateLeft in class RBTree<Integer,Integer>protected void replaceNode(io.keikaiex.util.RBNode<Integer,Integer> target, io.keikaiex.util.RBNode<Integer,Integer> substitute)
Copyright © 2020. All rights reserved.