Class TreeRangeMap<K extends java.lang.Comparable,V>
- java.lang.Object
-
- com.google.common.collect.TreeRangeMap<K,V>
-
- All Implemented Interfaces:
RangeMap<K,V>
public final class TreeRangeMap<K extends java.lang.Comparable,V> extends java.lang.Object implements RangeMap<K,V>
An implementation ofRangeMapbased on aTreeMap, supporting all optional operations.Like all
RangeMapimplementations, this supports neither null keys nor null values.- Since:
- 14.0
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description private classTreeRangeMap.AsMapOfRangesprivate static classTreeRangeMap.RangeMapEntry<K extends java.lang.Comparable,V>private classTreeRangeMap.SubRangeMap
-
Field Summary
Fields Modifier and Type Field Description private static RangeMapEMPTY_SUB_RANGE_MAPprivate java.util.NavigableMap<Cut<K>,TreeRangeMap.RangeMapEntry<K,V>>entriesByLowerBound
-
Constructor Summary
Constructors Modifier Constructor Description privateTreeRangeMap()
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.Map<Range<K>,V>asDescendingMapOfRanges()Returns a view of this range map as an unmodifiableMap<Range<K>, V>.java.util.Map<Range<K>,V>asMapOfRanges()Returns a view of this range map as an unmodifiableMap<Range<K>, V>.voidclear()Removes all associations from this range map (optional operation).private static <K extends java.lang.Comparable,V>
Range<K>coalesce(Range<K> range, V value, java.util.Map.Entry<Cut<K>,TreeRangeMap.RangeMapEntry<K,V>> entry)Returns the range that spans the given range and entry, if the entry can be coalesced.private Range<K>coalescedRange(Range<K> range, V value)Computes the coalesced range for the given range+value - does not mutate the map.static <K extends java.lang.Comparable,V>
TreeRangeMap<K,V>create()private RangeMap<K,V>emptySubRangeMap()booleanequals(java.lang.Object o)Vget(K key)Returns the value associated with the specified key, ornullif there is no such value.java.util.Map.Entry<Range<K>,V>getEntry(K key)Returns the range containing this key and its associated value, if such a range is present in the range map, ornullotherwise.inthashCode()ReturnsasMapOfRanges().hashCode().voidmerge(Range<K> range, V value, java.util.function.BiFunction<? super V,? super V,? extends V> remappingFunction)Merges a value into the map over a range by applying a remapping function.voidput(Range<K> range, V value)Maps a range to a specified value (optional operation).voidputAll(RangeMap<K,V> rangeMap)Puts all the associations fromrangeMapinto this range map (optional operation).voidputCoalescing(Range<K> range, V value)Maps a range to a specified value, coalescing this range with any existing ranges with the same value that are connected to this range.private voidputRangeMapEntry(Cut<K> lowerBound, Cut<K> upperBound, V value)voidremove(Range<K> rangeToRemove)Removes all associations from this range map in the specified range (optional operation).Range<K>span()Returns the minimal range enclosing the ranges in thisRangeMap.private voidsplit(Cut<K> cut)RangeMap<K,V>subRangeMap(Range<K> subRange)Returns a view of the part of this range map that intersects withrange.java.lang.StringtoString()Returns a readable string representation of this range map.
-
-
-
Method Detail
-
create
public static <K extends java.lang.Comparable,V> TreeRangeMap<K,V> create()
-
get
public V get(K key)
Description copied from interface:RangeMapReturns the value associated with the specified key, ornullif there is no such value.Specifically, if any range in this range map contains the specified key, the value associated with that range is returned.
-
getEntry
public java.util.Map.Entry<Range<K>,V> getEntry(K key)
Description copied from interface:RangeMapReturns the range containing this key and its associated value, if such a range is present in the range map, ornullotherwise.
-
put
public void put(Range<K> range, V value)
Description copied from interface:RangeMapMaps a range to a specified value (optional operation).Specifically, after a call to
put(range, value), ifrange.contains(k), thenget(k)will returnvalue.If
rangeis empty, then this is a no-op.
-
putCoalescing
public void putCoalescing(Range<K> range, V value)
Description copied from interface:RangeMapMaps a range to a specified value, coalescing this range with any existing ranges with the same value that are connected to this range.The behavior of
get(k)after calling this method is identical to the behavior described input(range, value), however the ranges returned fromRangeMap.asMapOfRanges()will be different if there were existing entries which connect to the given range and value.Even if the input range is empty, if it is connected on both sides by ranges mapped to the same value those two ranges will be coalesced.
Note: coalescing requires calling
.equals()on any connected values, which may be expensive depending on the value type. Using this method on range maps with large values such asCollectiontypes is discouraged.- Specified by:
putCoalescingin interfaceRangeMap<K extends java.lang.Comparable,V>
-
coalescedRange
private Range<K> coalescedRange(Range<K> range, V value)
Computes the coalesced range for the given range+value - does not mutate the map.
-
coalesce
private static <K extends java.lang.Comparable,V> Range<K> coalesce(Range<K> range, V value, java.util.Map.Entry<Cut<K>,TreeRangeMap.RangeMapEntry<K,V>> entry)
Returns the range that spans the given range and entry, if the entry can be coalesced.
-
putAll
public void putAll(RangeMap<K,V> rangeMap)
Description copied from interface:RangeMapPuts all the associations fromrangeMapinto this range map (optional operation).
-
clear
public void clear()
Description copied from interface:RangeMapRemoves all associations from this range map (optional operation).
-
span
public Range<K> span()
Description copied from interface:RangeMapReturns the minimal range enclosing the ranges in thisRangeMap.
-
remove
public void remove(Range<K> rangeToRemove)
Description copied from interface:RangeMapRemoves all associations from this range map in the specified range (optional operation).If
!range.contains(k),get(k)will return the same result before and after a call toremove(range). Ifrange.contains(k), then after a call toremove(range),get(k)will returnnull.
-
merge
public void merge(Range<K> range, V value, java.util.function.BiFunction<? super V,? super V,? extends V> remappingFunction)
Description copied from interface:RangeMapMerges a value into the map over a range by applying a remapping function.If any parts of the range are already present in this range map, those parts are mapped to new values by applying the remapping function. Any parts of the range not already present in this range map are mapped to the specified value, unless the value is
null.Any existing map entry spanning either range boundary may be split at the boundary, even if the merge does not affect its value.
For example, if
rangeMaphad one entry[1, 5] => 3thenrangeMap.merge(Range.closed(0,2), 3, Math::max)could yield a range map with the entries[0, 1) => 3, [1, 2] => 3, (2, 5] => 3.
-
asMapOfRanges
public java.util.Map<Range<K>,V> asMapOfRanges()
Description copied from interface:RangeMapReturns a view of this range map as an unmodifiableMap<Range<K>, V>. Modifications to this range map are guaranteed to read through to the returnedMap.The returned
Mapiterates over entries in ascending order of the bounds of theRangeentries.It is guaranteed that no empty ranges will be in the returned
Map.- Specified by:
asMapOfRangesin interfaceRangeMap<K extends java.lang.Comparable,V>
-
asDescendingMapOfRanges
public java.util.Map<Range<K>,V> asDescendingMapOfRanges()
Description copied from interface:RangeMapReturns a view of this range map as an unmodifiableMap<Range<K>, V>. Modifications to this range map are guaranteed to read through to the returnedMap.The returned
Mapiterates over entries in descending order of the bounds of theRangeentries.It is guaranteed that no empty ranges will be in the returned
Map.- Specified by:
asDescendingMapOfRangesin interfaceRangeMap<K extends java.lang.Comparable,V>
-
subRangeMap
public RangeMap<K,V> subRangeMap(Range<K> subRange)
Description copied from interface:RangeMapReturns a view of the part of this range map that intersects withrange.For example, if
rangeMaphad the entries[1, 5] => "foo", (6, 8) => "bar", (10, ∞) => "baz"thenrangeMap.subRangeMap(Range.open(3, 12))would return a range map with the entries(3, 5] => "foo", (6, 8) => "bar", (10, 12) => "baz".The returned range map supports all optional operations that this range map supports, except for
asMapOfRanges().iterator().remove().The returned range map will throw an
IllegalArgumentExceptionon an attempt to insert a range not enclosed byrange.- Specified by:
subRangeMapin interfaceRangeMap<K extends java.lang.Comparable,V>
-
equals
public boolean equals(java.lang.Object o)
Description copied from interface:RangeMap
-
hashCode
public int hashCode()
Description copied from interface:RangeMapReturnsasMapOfRanges().hashCode().
-
-