|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectapollo.util.interval.IntervalTree
public class IntervalTree
| Constructor Summary | |
|---|---|
IntervalTree()
|
|
| Method Summary | |
|---|---|
Interval |
getInterval(RbNode node)
|
int |
getMax(RbNode node)
|
int |
getMin(RbNode node)
|
void |
insert(Interval interval)
|
boolean |
isValid()
Test case code: check to see that the data structure follows the right constraints of interval trees: o. |
Interval |
search(Interval interval)
|
java.util.List |
searchAll(Interval interval)
|
int |
size()
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public IntervalTree()
| Method Detail |
|---|
public void insert(Interval interval)
public int size()
public Interval search(Interval interval)
public java.util.List searchAll(Interval interval)
public Interval getInterval(RbNode node)
public int getMax(RbNode node)
public int getMin(RbNode node)
public boolean isValid()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||