Class TreeRangeMap<K extends Comparable,V>
- All Implemented Interfaces:
RangeMap<K,
V>
RangeMap
based on a TreeMap
, supporting all optional
operations.
Like all RangeMap
implementations, this supports neither null keys nor null values.
- Since:
- 14.0
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionprivate final class
private static final class
TreeRangeMap.RangeMapEntry<K extends Comparable,
V> private class
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate static final RangeMap
<Comparable<?>, Object> private final NavigableMap
<Cut<K>, TreeRangeMap.RangeMapEntry<K, V>> -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionReturns a view of this range map as an unmodifiableMap<Range<K>, V>
.Returns a view of this range map as an unmodifiableMap<Range<K>, V>
.void
clear()
Removes all associations from this range map (optional operation).private static <K extends Comparable,
V>
Range<K> coalesce
(Range<K> range, V value, 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.coalescedRange
(Range<K> range, V value) Computes the coalesced range for the given range+value - does not mutate the map.static <K extends Comparable,
V>
TreeRangeMap<K, V> create()
boolean
Returns the value associated with the specified key, ornull
if there is no such value.Returns the range containing this key and its associated value, if such a range is present in the range map, ornull
otherwise.int
hashCode()
ReturnsasMapOfRanges().hashCode()
.void
Merges a value into a part of the map by applying a remapping function.void
Maps a range to a specified value (optional operation).void
Puts all the associations fromrangeMap
into this range map (optional operation).void
putCoalescing
(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 void
void
Removes all associations from this range map in the specified range (optional operation).span()
Returns the minimal range enclosing the ranges in thisRangeMap
.private void
subRangeMap
(Range<K> subRange) Returns a view of the part of this range map that intersects withrange
.toString()
Returns a readable string representation of this range map.
-
Field Details
-
entriesByLowerBound
private final NavigableMap<Cut<K extends Comparable>,TreeRangeMap.RangeMapEntry<K extends Comparable, entriesByLowerBoundV>> -
EMPTY_SUB_RANGE_MAP
-
-
Constructor Details
-
TreeRangeMap
private TreeRangeMap()
-
-
Method Details
-
create
-
get
Description copied from interface:RangeMap
Returns the value associated with the specified key, ornull
if 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.
- Specified by:
get
in interfaceRangeMap<K extends Comparable,
V>
-
getEntry
Description copied from interface:RangeMap
Returns the range containing this key and its associated value, if such a range is present in the range map, ornull
otherwise.- Specified by:
getEntry
in interfaceRangeMap<K extends Comparable,
V>
-
put
Description copied from interface:RangeMap
Maps a range to a specified value (optional operation).Specifically, after a call to
put(range, value)
, ifrange.contains(k)
, thenget(k)
will returnvalue
.If
range
is empty, then this is a no-op.- Specified by:
put
in interfaceRangeMap<K extends Comparable,
V>
-
putCoalescing
Description copied from interface:RangeMap
Maps 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 asCollection
types is discouraged.- Specified by:
putCoalescing
in interfaceRangeMap<K extends Comparable,
V>
-
coalescedRange
Computes the coalesced range for the given range+value - does not mutate the map. -
coalesce
private static <K extends Comparable,V> Range<K> coalesce(Range<K> range, V value, @CheckForNull 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
Description copied from interface:RangeMap
Puts all the associations fromrangeMap
into this range map (optional operation).- Specified by:
putAll
in interfaceRangeMap<K extends Comparable,
V>
-
clear
public void clear()Description copied from interface:RangeMap
Removes all associations from this range map (optional operation).- Specified by:
clear
in interfaceRangeMap<K extends Comparable,
V>
-
span
Description copied from interface:RangeMap
Returns the minimal range enclosing the ranges in thisRangeMap
.- Specified by:
span
in interfaceRangeMap<K extends Comparable,
V>
-
putRangeMapEntry
-
remove
Description copied from interface:RangeMap
Removes 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
.- Specified by:
remove
in interfaceRangeMap<K extends Comparable,
V>
-
split
-
merge
public void merge(Range<K> range, @CheckForNull V value, BiFunction<? super V, ? super V, ? extends V> remappingFunction) Description copied from interface:RangeMap
Merges a value into a part of the map by applying a remapping function.If any parts of the range are already present in this map, those parts are mapped to new values by applying the remapping function. The remapping function accepts the map's existing value for that part of the range and the given value. It returns the value to be associated with that part of the map, or it returns
null
to clear that part of the map.Any parts of the range not already present in this map are mapped to the specified value, unless the value is
null
.Any existing entry spanning either range boundary may be split at the boundary, even if the merge does not affect its value. For example, if
rangeMap
had one entry[1, 5] => 3
thenrangeMap.merge(Range.closed(0,2), 3, Math::max)
could yield a map with the entries[0, 1) => 3, [1, 2] => 3, (2, 5] => 3
.- Specified by:
merge
in interfaceRangeMap<K extends Comparable,
V> - Since:
- 28.1
-
asMapOfRanges
Description copied from interface:RangeMap
Returns 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
Map
iterates over entries in ascending order of the bounds of theRange
entries.It is guaranteed that no empty ranges will be in the returned
Map
.- Specified by:
asMapOfRanges
in interfaceRangeMap<K extends Comparable,
V>
-
asDescendingMapOfRanges
Description copied from interface:RangeMap
Returns 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
Map
iterates over entries in descending order of the bounds of theRange
entries.It is guaranteed that no empty ranges will be in the returned
Map
.- Specified by:
asDescendingMapOfRanges
in interfaceRangeMap<K extends Comparable,
V>
-
subRangeMap
Description copied from interface:RangeMap
Returns a view of the part of this range map that intersects withrange
.For example, if
rangeMap
had 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
IllegalArgumentException
on an attempt to insert a range not enclosed byrange
.- Specified by:
subRangeMap
in interfaceRangeMap<K extends Comparable,
V>
-
emptySubRangeMap
-
equals
Description copied from interface:RangeMap
-
hashCode
public int hashCode()Description copied from interface:RangeMap
ReturnsasMapOfRanges().hashCode()
. -
toString
Description copied from interface:RangeMap
Returns a readable string representation of this range map.
-