Top Inners Fields Constructors Methods
sun.jvm.hotspot.utilities

public Class IntervalTree

extends RBTree
Class Inheritance
Imports
java.io.PrintStream, java.util.ArrayList, .Comparator, .List

Nested and Inner Type Summary

Modifier and TypeClass and Description
pack-priv static class

Field Summary

Modifier and TypeField and Description
private Comparator<Object>
Inherited from sun.jvm.hotspot.utilities.RBTree:
DEBUGGINGREALLY_VERBOSEVERBOSE

Constructor Summary

AccessConstructor and Description
public
IntervalTree(Comparator<Object> endpointComparator)

This constructor takes only one comparator: one which operates upon the endpoints of the Intervals this tree will store.

Method Summary

Modifier and TypeMethod and Description
public List<IntervalNode>
findAllNodesIntersecting(Interval interval)

Returns a List<IntervalNode> indicating which nodes' intervals were intersected by the given query interval.

protected Object
public void
insert(Interval interval, Object data)

private void
public void
private void
protected void
verify()

Overrides sun.jvm.hotspot.utilities.RBTree.verify.

Verify invariants are preserved
private void
Inherited from sun.jvm.hotspot.utilities.RBTree:
deleteNodegetRootinsertNodemain

Field Detail

endpointComparatorback to summary
private Comparator<Object> endpointComparator

Constructor Detail

IntervalTreeback to summary
public IntervalTree(Comparator<Object> endpointComparator)

This constructor takes only one comparator: one which operates upon the endpoints of the Intervals this tree will store. It constructs an internal "interval comparator" out of this one.

Method Detail

findAllNodesIntersectingback to summary
public List<IntervalNode> findAllNodesIntersecting(Interval interval)

Returns a List<IntervalNode> indicating which nodes' intervals were intersected by the given query interval. It is guaranteed that these nodes will be returned sorted by increasing low endpoint.

getNodeValueback to summary
protected Object getNodeValue(RBNode node)

Overrides sun.jvm.hotspot.utilities.RBTree.getNodeValue.

insertback to summary
public void insert(Interval interval, Object data)
printFromNodeback to summary
private void printFromNode(RBNode node, PrintStream tty, int indentDepth)

Hides sun.jvm.hotspot.utilities.RBTree.printFromNode.

Debugging

printOnback to summary
public void printOn(PrintStream tty)

Overrides sun.jvm.hotspot.utilities.RBTree.printOn.

searchForIntersectingNodesFromback to summary
private void searchForIntersectingNodesFrom(IntervalNode node, Interval interval, List<IntervalNode> resultList)
verifyback to summary
protected void verify()

Overrides sun.jvm.hotspot.utilities.RBTree.verify.

Doc from sun.jvm.hotspot.utilities.RBTree.verify.

Verify invariants are preserved

verifyFromNodeback to summary
private void verifyFromNode(RBNode node)

Hides sun.jvm.hotspot.utilities.RBTree.verifyFromNode.

sun.jvm.hotspot.utilities back to summary

pack-priv Class IntervalTree.IntervalComparator

extends Object
implements Comparator<Object>
Class Inheritance
All Implemented Interfaces
java.util.Comparator

Field Summary

Modifier and TypeField and Description
private Comparator<Object>

Constructor Summary

AccessConstructor and Description
public
IntervalComparator(Comparator<Object> endpointComparator)

Method Summary

Modifier and TypeMethod and Description
public int
compare(Object
the first object to be compared.
o1
,
Object
the second object to be compared.
o2
)

Implements java.util.Comparator.compare.

Compares its two arguments for order.
Inherited from java.lang.Object:
cloneequalsfinalizegetClasshashCodenotifynotifyAlltoStringwaitwaitwait

Field Detail

endpointComparatorback to summary
private Comparator<Object> endpointComparator

Constructor Detail

IntervalComparatorback to summary
public IntervalComparator(Comparator<Object> endpointComparator)

Method Detail

compareback to summary
public int compare(Object o1, Object o2)

Implements java.util.Comparator.compare.

Doc from java.util.Comparator.compare.

Compares its two arguments for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.

The implementor must ensure that signum(compare(x, y)) == -signum(compare(y, x)) for all x and y. (This implies that compare(x, y) must throw an exception if and only if compare(y, x) throws an exception.)

The implementor must also ensure that the relation is transitive: ((compare(x, y)>0) && (compare(y, z)>0)) implies compare(x, z)>0.

Finally, the implementor must ensure that compare(x, y)==0 implies that signum(compare(x, z))==signum(compare(y, z)) for all z.

Parameters
o1:Object

the first object to be compared.

o2:Object

the second object to be compared.

Returns:int

a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.