public class IntervalTreeMap<T> extends AbstractMap<Interval,T>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
IntervalTreeMap() |
IntervalTreeMap(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(Object object) |
boolean |
containsOverlapping(Interval key)
Test overlapping interval
|
IntervalTree<T> |
debugGetTree(String sequence) |
Set<Map.Entry<Interval,T>> |
entrySet() |
boolean |
equals(Object o) |
T |
get(Interval key) |
T |
get(Object object) |
Collection<T> |
getContained(Interval key) |
Collection<T> |
getOverlapping(Interval key) |
int |
hashCode() |
boolean |
isEmpty() |
T |
put(Interval key,
T value) |
T |
remove(Interval key) |
T |
remove(Object object) |
int |
size() |
clone, containsValue, keySet, putAll, toString, valuesfinalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAllpublic IntervalTree<T> debugGetTree(String sequence)
public void clear()
public boolean containsKey(Object object)
containsKey in interface Map<Interval,T>containsKey in class AbstractMap<Interval,T>public boolean containsKey(Interval key)
public boolean equals(Object o)
public int hashCode()
public boolean isEmpty()
public int size()
public boolean containsOverlapping(Interval key)
key - the intervalpublic Collection<T> getOverlapping(Interval key)
public boolean containsContained(Interval key)
key - the intervalpublic Collection<T> getContained(Interval key)