public class IntervalTreeMap<T> extends AbstractMap<Interval,T>
AbstractMap.SimpleEntry<K extends Object,V extends Object>, AbstractMap.SimpleImmutableEntry<K extends Object,V extends Object>
Constructor | Description |
---|---|
IntervalTreeMap() |
|
IntervalTreeMap(Map<? extends Interval,? extends T> map) |
Modifier and Type | Method | Description |
---|---|---|
void |
clear() |
|
boolean |
containsContained(Locatable key) |
Test if this contains an object that is contained by 'key'
|
boolean |
containsKey(Interval key) |
|
boolean |
containsKey(Object object) |
|
boolean |
containsOverlapping(Locatable 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(Locatable key) |
|
Collection<T> |
getOverlapping(Locatable 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, values
compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll
public 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(Locatable key)
key
- the Locatablepublic Collection<T> getOverlapping(Locatable key)
public boolean containsContained(Locatable key)
key
- the Locatablepublic Collection<T> getContained(Locatable key)