Constructor and Description |
---|
IntervalTreeMap() |
IntervalTreeMap(java.util.Map<? extends Interval,? extends T> map) |
Modifier and Type | Method and Description |
---|---|
void |
clear() |
boolean |
containsContained(Interval key)
Test if this contains an object that is contained by 'key'
|
boolean |
containsKey(Interval key) |
boolean |
containsKey(java.lang.Object object) |
boolean |
containsOverlapping(Interval key)
Test overlapping interval
|
IntervalTree<T> |
debugGetTree(java.lang.String sequence) |
java.util.Set<java.util.Map.Entry<Interval,T>> |
entrySet() |
boolean |
equals(java.lang.Object o) |
T |
get(Interval key) |
T |
get(java.lang.Object object) |
java.util.Collection<T> |
getContained(Interval key) |
java.util.Collection<T> |
getOverlapping(Interval key) |
int |
hashCode() |
boolean |
isEmpty() |
T |
put(Interval key,
T value) |
T |
remove(Interval key) |
T |
remove(java.lang.Object object) |
int |
size() |
clone, containsValue, keySet, putAll, toString, values
public IntervalTree<T> debugGetTree(java.lang.String sequence)
public void clear()
public boolean containsKey(java.lang.Object object)
public boolean containsKey(Interval key)
public boolean equals(java.lang.Object o)
public int hashCode()
public T get(java.lang.Object object)
public boolean isEmpty()
public T remove(java.lang.Object object)
public int size()
public boolean containsOverlapping(Interval key)
key
- the intervalpublic boolean containsContained(Interval key)
key
- the interval