|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectjava.util.AbstractCollection<T>
org.utgenome.gwt.utgb.client.canvas.IntervalTree<T>
public class IntervalTree<T extends GenomeRange>
Interval layout
| Constructor Summary | |
|---|---|
IntervalTree()
|
|
| Method Summary | |
|---|---|
boolean |
add(T elem)
Add an entry [start, end) |
void |
clear()
|
int |
countOverlap(int start)
|
int |
countOverlap(int start,
int end)
|
List<T> |
elementList()
return the elements in the tree |
T |
findOverlap(GenomeRange target)
|
boolean |
isEmpty()
|
Iterator<T> |
iterator()
|
List<T> |
overlapQuery(GenomeRange target)
|
void |
overlapQuery(GenomeRange target,
PrioritySearchTree.ResultHandler<T> handler)
|
List<T> |
overlapQuery(int start)
|
List<T> |
overlapQuery(int start,
int end)
Get entries overlapping with [start, end) |
void |
overlapQuery(int start,
int end,
PrioritySearchTree.ResultHandler<T> handler)
Get entries overlapping with [start, end) |
void |
overlapQuery(int start,
PrioritySearchTree.ResultHandler<T> handler)
|
boolean |
remove(T t)
|
void |
removeBefore(int start)
Removes the intervals contained in [-oo, start) |
void |
removeBefore(int start,
PrioritySearchTree.ResultHandler<T> handler)
|
int |
size()
|
| Methods inherited from class java.util.AbstractCollection |
|---|
addAll, contains, containsAll, remove, removeAll, retainAll, toArray, toArray, toString |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface java.util.Collection |
|---|
equals, hashCode |
| Constructor Detail |
|---|
public IntervalTree()
| Method Detail |
|---|
public boolean add(T elem)
add in interface Collection<T extends GenomeRange>add in class AbstractCollection<T extends GenomeRange>elem - public boolean remove(T t)
public void overlapQuery(int start,
PrioritySearchTree.ResultHandler<T> handler)
public List<T> overlapQuery(int start)
public int countOverlap(int start)
public int countOverlap(int start,
int end)
public List<T> overlapQuery(int start,
int end)
start - query start (inclusive)end - query end (exclusive)
public void overlapQuery(int start,
int end,
PrioritySearchTree.ResultHandler<T> handler)
start - query start (inclusive)end - query end (exclusive)handler -
public void overlapQuery(GenomeRange target,
PrioritySearchTree.ResultHandler<T> handler)
public List<T> overlapQuery(GenomeRange target)
public T findOverlap(GenomeRange target)
public boolean isEmpty()
isEmpty in interface Collection<T extends GenomeRange>isEmpty in class AbstractCollection<T extends GenomeRange>public void clear()
clear in interface Collection<T extends GenomeRange>clear in class AbstractCollection<T extends GenomeRange>public void removeBefore(int start)
start -
public void removeBefore(int start,
PrioritySearchTree.ResultHandler<T> handler)
public Iterator<T> iterator()
iterator in interface Iterable<T extends GenomeRange>iterator in interface Collection<T extends GenomeRange>iterator in class AbstractCollection<T extends GenomeRange>public List<T> elementList()
public int size()
size in interface Collection<T extends GenomeRange>size in class AbstractCollection<T extends GenomeRange>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||