Class IntervalTreeOri
java.lang.Object
org.snpeff.interval.tree.IntervalTreeOri
- All Implemented Interfaces:
Serializable, Iterable<Marker>, Itree
An Interval Tree is essentially a map from intervals to objects, which
can be queried for all data associated with a particular interval of
point
- See Also:
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionInstantiate a new interval tree with no intervalsIntervalTreeOri(Markers intervals) Instantiate an interval tree with a list of intervals -
Method Summary
Modifier and TypeMethodDescriptionvoidAdd an interval object to the interval tree's list Note: Marks the tree as 'not inSync', but will not rebuild the tree until the next query or call to buildvoidAdd all intervals to interval tree's list Note: Marks the tree as 'not inSync', but will not rebuild the tree until the next query or call to buildvoidbuild()Build the interval tree to reflect the list of intervals, Will not run if this is currently in syncbooleanisEmpty()booleanisInSync()Determine whether this interval tree is currently a reflection of all intervals in the interval listiterator()voidLoad intervals from filePerform an interval query, returning the intervals that intersect with 'interval'intsize()Size: number of entries in the interval liststab(int point) Perform a stabbing query, returning the interval objectstoString()Methods inherited from class Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface Iterable
forEach, spliterator
-
Field Details
-
head
-
intervals
-
inSync
protected boolean inSync
-
-
Constructor Details
-
IntervalTreeOri
public IntervalTreeOri()Instantiate a new interval tree with no intervals -
IntervalTreeOri
Instantiate an interval tree with a list of intervals
-
-
Method Details
-
add
-
add
-
build
-
getIntervals
- Specified by:
getIntervalsin interfaceItree
-
isEmpty
-
isInSync
-
iterator
-
load
-
query
-
size
-
stab
-
toString
-