Uses of Class
com.google.common.collect.Range
-
Packages that use Range Package Description com.google.common.collect This package contains generic collection interfaces and implementations, and other utilities for working with collections.com.google.common.testing This package contains testing utilities. -
-
Uses of Range in com.google.common.collect
Fields in com.google.common.collect declared as Range Modifier and Type Field Description private static Range<java.lang.Comparable>Range. ALLprivate Range<Cut<C>>TreeRangeSet.ComplementRangesByLowerBound. complementLowerBoundWindowcomplementLowerBoundWindow represents the headMap/subMap/tailMap view of the entire "complement ranges by lower bound" map; it's a constraint on the *keys*, and does not affect the values.private Range<Cut<C>>TreeRangeSet.SubRangeSetRangesByLowerBound. lowerBoundWindowlowerBoundWindow is the headMap/subMap/tailMap view; it only restricts the keys, and does not affect the values.private Range<C>RegularContiguousSet. range(package private) Range<C>RegularContiguousSet.SerializedForm. rangeprivate Range<K>TreeRangeMap.RangeMapEntry. rangeprivate Range<C>TreeRangeSet.SubRangeSet. restrictionprivate Range<C>TreeRangeSet.SubRangeSetRangesByLowerBound. restrictionrestriction is the subRangeSet view; ranges are truncated to their intersection with restriction.private Range<K>TreeRangeMap.SubRangeMap. subRangeprivate Range<Cut<C>>TreeRangeSet.RangesByUpperBound. upperBoundWindowupperBoundWindow represents the headMap/subMap/tailMap view of the entire "ranges by upper bound" map; it's a constraint on the *keys*, and does not affect the values.Fields in com.google.common.collect with type parameters of type Range Modifier and Type Field Description private java.util.Set<Range<C>>TreeRangeSet. asDescendingSetOfRangesprivate java.util.Set<Range<C>>TreeRangeSet. asRanges(package private) java.util.Collection<Range<C>>TreeRangeSet.AsRanges. delegateprivate java.util.List<java.util.Map.Entry<Range<K>,V>>ImmutableRangeMap.Builder. entries(package private) java.lang.Iterable<java.util.Map.Entry<Range<K>,V>>TreeRangeMap.AsMapOfRanges. entryIterable(package private) static Ordering<Range<?>>Range.RangeLexOrdering. INSTANCEprivate ImmutableMap<Range<K>,V>ImmutableRangeMap.SerializedForm. mapOfRangesprivate java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.ComplementRangesByLowerBound. positiveRangesByLowerBoundprivate java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.ComplementRangesByLowerBound. positiveRangesByUpperBoundprivate ImmutableList<Range<K>>ImmutableRangeMap. rangesprivate ImmutableList<Range<C>>ImmutableRangeSet.AsSetSerializedForm. rangesprivate java.util.List<Range<C>>ImmutableRangeSet.Builder. rangesprivate ImmutableList<Range<C>>ImmutableRangeSet. rangesprivate ImmutableList<Range<C>>ImmutableRangeSet.SerializedForm. ranges(package private) java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet. rangesByLowerBoundprivate java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.RangesByUpperBound. rangesByLowerBoundprivate java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.SubRangeSetRangesByLowerBound. rangesByLowerBoundprivate java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.SubRangeSetRangesByLowerBound. rangesByUpperBoundprivate static java.util.stream.Collector<Range<java.lang.Comparable>,?,ImmutableRangeSet<java.lang.Comparable>>CollectCollectors. TO_IMMUTABLE_RANGE_SETMethods in com.google.common.collect that return Range Modifier and Type Method Description static <C extends java.lang.Comparable<?>>
Range<C>Range. all()Returns a range that contains every value of typeC.static <C extends java.lang.Comparable<?>>
Range<C>Range. atLeast(C endpoint)Returns a range that contains all values greater than or equal toendpoint.static <C extends java.lang.Comparable<?>>
Range<C>Range. atMost(C endpoint)Returns a range that contains all values less than or equal toendpoint.Range<C>Range. canonical(DiscreteDomain<C> domain)Returns the canonical form of this range in the given domain.static <C extends java.lang.Comparable<?>>
Range<C>Range. closed(C lower, C upper)Returns a range that contains all values greater than or equal tolowerand less than or equal toupper.static <C extends java.lang.Comparable<?>>
Range<C>Range. closedOpen(C lower, C upper)Returns a range that contains all values greater than or equal tolowerand strictly less thanupper.private static <K extends java.lang.Comparable,V>
Range<K>TreeRangeMap. 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>TreeRangeMap. coalescedRange(Range<K> range, V value)Computes the coalesced range for the given range+value - does not mutate the map.(package private) static <C extends java.lang.Comparable<?>>
Range<C>Range. create(Cut<C> lowerBound, Cut<C> upperBound)static <C extends java.lang.Comparable<?>>
Range<C>Range. downTo(C endpoint, BoundType boundType)Returns a range from the given endpoint, which may be either inclusive (closed) or exclusive (open), with no upper bound.static <C extends java.lang.Comparable<?>>
Range<C>Range. encloseAll(java.lang.Iterable<C> values)Returns the minimal range that contains all of the given values.Range<C>Range. gap(Range<C> otherRange)Returns the maximal range lying between this range andotherRange, if such a range exists.Range<C>ImmutableRangeSet.ComplementRanges. get(int index)Range<C>TreeRangeSet.ComplementRangesByLowerBound. get(java.lang.Object key)Range<C>TreeRangeSet.RangesByUpperBound. get(java.lang.Object key)Range<C>TreeRangeSet.SubRangeSetRangesByLowerBound. get(java.lang.Object key)Range<K>TreeRangeMap.RangeMapEntry. getKey()static <C extends java.lang.Comparable<?>>
Range<C>Range. greaterThan(C endpoint)Returns a range that contains all values strictly greater thanendpoint.Range<C>Range. intersection(Range<C> connectedRange)Returns the maximal range enclosed by both this range andconnectedRange, if such a range exists.static <C extends java.lang.Comparable<?>>
Range<C>Range. lessThan(C endpoint)Returns a range that contains all values strictly less thanendpoint.static <C extends java.lang.Comparable<?>>
Range<C>Range. open(C lower, C upper)Returns a range that contains all values strictly greater thanlowerand strictly less thanupper.static <C extends java.lang.Comparable<?>>
Range<C>Range. openClosed(C lower, C upper)Returns a range that contains all values strictly greater thanlowerand less than or equal toupper.abstract Range<C>ContiguousSet. range()Returns a range, closed on both ends, whose endpoints are the minimum and maximum values contained in this set.abstract Range<C>ContiguousSet. range(BoundType lowerBoundType, BoundType upperBoundType)Returns the minimal range with the given boundary types for which all values in this set are contained within the range.Range<C>EmptyContiguousSet. range()Range<C>EmptyContiguousSet. range(BoundType lowerBoundType, BoundType upperBoundType)static <C extends java.lang.Comparable<?>>
Range<C>Range. range(C lower, BoundType lowerType, C upper, BoundType upperType)Returns a range that contains any value fromlowertoupper, where each endpoint may be either inclusive (closed) or exclusive (open).Range<C>RegularContiguousSet. range()Range<C>RegularContiguousSet. range(BoundType lowerBoundType, BoundType upperBoundType)abstract Range<C>AbstractRangeSet. rangeContaining(C value)Range<C>ImmutableRangeSet. rangeContaining(C value)Range<C>RangeSet. rangeContaining(C value)Returns the unique range from this range set that containsvalue, ornullif this range set does not containvalue.Range<C>TreeRangeSet. rangeContaining(C value)Range<C>TreeRangeSet.SubRangeSet. rangeContaining(C value)private Range<C>TreeRangeSet. rangeEnclosing(Range<C> range)static <C extends java.lang.Comparable<?>>
Range<C>Range. singleton(C value)Returns a range that contains only the given value.Range<K>ImmutableRangeMap. span()Range<C>ImmutableRangeSet. span()Range<C>Range. span(Range<C> other)Returns the minimal range that encloses both this range andother.Range<K>RangeMap. span()Returns the minimal range enclosing the ranges in thisRangeMap.Range<C>RangeSet. span()Returns the minimal range which encloses all ranges in this range set.Range<K>TreeRangeMap. span()Range<K>TreeRangeMap.SubRangeMap. span()Range<C>TreeRangeSet. span()static <C extends java.lang.Comparable<?>>
Range<C>Range. upTo(C endpoint, BoundType boundType)Returns a range with no lower bound up to the given endpoint, which may be either inclusive (closed) or exclusive (open).Methods in com.google.common.collect that return types with arguments of type Range Modifier and Type Method Description ImmutableMap<Range<K>,V>ImmutableRangeMap. asDescendingMapOfRanges()java.util.Map<Range<K>,V>RangeMap. asDescendingMapOfRanges()Returns a view of this range map as an unmodifiableMap<Range<K>, V>.java.util.Map<Range<K>,V>TreeRangeMap. asDescendingMapOfRanges()java.util.Map<Range<K>,V>TreeRangeMap.SubRangeMap. asDescendingMapOfRanges()ImmutableSet<Range<C>>ImmutableRangeSet. asDescendingSetOfRanges()java.util.Set<Range<C>>RangeSet. asDescendingSetOfRanges()Returns a descending view of the disconnected ranges that make up this range set.java.util.Set<Range<C>>TreeRangeSet. asDescendingSetOfRanges()ImmutableMap<Range<K>,V>ImmutableRangeMap. asMapOfRanges()java.util.Map<Range<K>,V>RangeMap. asMapOfRanges()Returns a view of this range map as an unmodifiableMap<Range<K>, V>.java.util.Map<Range<K>,V>TreeRangeMap. asMapOfRanges()java.util.Map<Range<K>,V>TreeRangeMap.SubRangeMap. asMapOfRanges()ImmutableSet<Range<C>>ImmutableRangeSet. asRanges()java.util.Set<Range<C>>RangeSet. asRanges()Returns a view of the disconnected ranges that make up this range set.java.util.Set<Range<C>>TreeRangeSet. asRanges()protected java.util.Collection<Range<C>>TreeRangeSet.AsRanges. delegate()(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>>TreeRangeSet.ComplementRangesByLowerBound. descendingEntryIterator()(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>>TreeRangeSet.RangesByUpperBound. descendingEntryIterator()(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>>TreeRangeSet.SubRangeSetRangesByLowerBound. descendingEntryIterator()(package private) java.util.Iterator<java.util.Map.Entry<Range<K>,V>>TreeRangeMap.AsMapOfRanges. entryIterator()(package private) java.util.Iterator<java.util.Map.Entry<Range<K>,V>>TreeRangeMap.SubRangeMap.SubRangeMapAsMap. entryIterator()(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>>TreeRangeSet.ComplementRangesByLowerBound. entryIterator()(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>>TreeRangeSet.RangesByUpperBound. entryIterator()(package private) java.util.Iterator<java.util.Map.Entry<Cut<C>,Range<C>>>TreeRangeSet.SubRangeSetRangesByLowerBound. entryIterator()java.util.Set<java.util.Map.Entry<Range<K>,V>>TreeRangeMap.SubRangeMap.SubRangeMapAsMap. entrySet()java.util.Map.Entry<Range<K>,V>ImmutableRangeMap. getEntry(K key)java.util.Map.Entry<Range<K>,V>RangeMap. getEntry(K key)Returns the range containing this key and its associated value, if such a range is present in the range map, ornullotherwise.java.util.Map.Entry<Range<K>,V>TreeRangeMap. getEntry(K key)java.util.Map.Entry<Range<K>,V>TreeRangeMap.SubRangeMap. getEntry(K key)java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.ComplementRangesByLowerBound. headMap(Cut<C> toKey, boolean inclusive)java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.RangesByUpperBound. headMap(Cut<C> toKey, boolean inclusive)java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.SubRangeSetRangesByLowerBound. headMap(Cut<C> toKey, boolean inclusive)private ImmutableList<Range<C>>ImmutableRangeSet. intersectRanges(Range<C> range)Returns a list containing the nonempty intersections ofrangewith the ranges in this range set.java.util.Set<Range<K>>TreeRangeMap.SubRangeMap.SubRangeMapAsMap. keySet()(package private) static <C extends java.lang.Comparable<?>>
Function<Range<C>,Cut<C>>Range. lowerBoundFn()(package private) static <C extends java.lang.Comparable<?>>
Ordering<Range<C>>Range. rangeLexOrdering()java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.ComplementRangesByLowerBound. subMap(Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive)private java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.ComplementRangesByLowerBound. subMap(Range<Cut<C>> subWindow)java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.RangesByUpperBound. subMap(Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive)private java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.RangesByUpperBound. subMap(Range<Cut<C>> window)java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.SubRangeSetRangesByLowerBound. subMap(Cut<C> fromKey, boolean fromInclusive, Cut<C> toKey, boolean toInclusive)private java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.SubRangeSetRangesByLowerBound. subMap(Range<Cut<C>> window)java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.ComplementRangesByLowerBound. tailMap(Cut<C> fromKey, boolean inclusive)java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.RangesByUpperBound. tailMap(Cut<C> fromKey, boolean inclusive)java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.SubRangeSetRangesByLowerBound. tailMap(Cut<C> fromKey, boolean inclusive)(package private) static <E extends java.lang.Comparable<? super E>>
java.util.stream.Collector<Range<E>,?,ImmutableRangeSet<E>>CollectCollectors. toImmutableRangeSet()static <E extends java.lang.Comparable<? super E>>
java.util.stream.Collector<Range<E>,?,ImmutableRangeSet<E>>ImmutableRangeSet. toImmutableRangeSet()Returns aCollectorthat accumulates the input elements into a newImmutableRangeSet.(package private) static <C extends java.lang.Comparable<?>>
Function<Range<C>,Cut<C>>Range. upperBoundFn()Methods in com.google.common.collect with parameters of type Range Modifier and Type Method Description voidAbstractRangeSet. add(Range<C> range)voidImmutableRangeSet. add(Range<C> range)Deprecated.Unsupported operation.ImmutableRangeSet.Builder<C>ImmutableRangeSet.Builder. add(Range<C> range)Add the specified range to this builder.voidRangeSet. add(Range<C> range)Adds the specified range to thisRangeSet(optional operation).voidTreeRangeSet. add(Range<C> rangeToAdd)voidTreeRangeSet.Complement. add(Range<C> rangeToAdd)voidTreeRangeSet.SubRangeSet. add(Range<C> rangeToAdd)CutRange.LowerBoundFn. apply(Range range)CutRange.UpperBoundFn. apply(Range range)private static <K extends java.lang.Comparable,V>
Range<K>TreeRangeMap. 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>TreeRangeMap. coalescedRange(Range<K> range, V value)Computes the coalesced range for the given range+value - does not mutate the map.intRange.RangeLexOrdering. compare(Range<?> left, Range<?> right)static <C extends java.lang.Comparable>
ContiguousSet<C>ContiguousSet. create(Range<C> range, DiscreteDomain<C> domain)Returns aContiguousSetcontaining the same values in the given domain contained by the range.abstract booleanAbstractRangeSet. encloses(Range<C> otherRange)booleanImmutableRangeSet. encloses(Range<C> otherRange)booleanRange. encloses(Range<C> other)Returnstrueif the bounds ofotherdo not extend outside the bounds of this range.booleanRangeSet. encloses(Range<C> otherRange)Returnstrueif there exists a member range in this range set which encloses the specified range.booleanTreeRangeSet. encloses(Range<C> range)booleanTreeRangeSet.SubRangeSet. encloses(Range<C> range)(package private) static <T extends java.lang.Comparable>
GeneralRange<T>GeneralRange. from(Range<T> range)Converts a Range to a GeneralRange.Range<C>Range. gap(Range<C> otherRange)Returns the maximal range lying between this range andotherRange, if such a range exists.Range<C>Range. intersection(Range<C> connectedRange)Returns the maximal range enclosed by both this range andconnectedRange, if such a range exists.private ContiguousSet<C>RegularContiguousSet. intersectionInCurrentDomain(Range<C> other)private ImmutableList<Range<C>>ImmutableRangeSet. intersectRanges(Range<C> range)Returns a list containing the nonempty intersections ofrangewith the ranges in this range set.booleanAbstractRangeSet. intersects(Range<C> otherRange)booleanImmutableRangeSet. intersects(Range<C> otherRange)booleanRangeSet. intersects(Range<C> otherRange)Returnstrueif there exists a non-empty range enclosed by both a member range in this range set and the specified range.booleanTreeRangeSet. intersects(Range<C> range)booleanRange. isConnected(Range<C> other)Returnstrueif there exists a (possibly empty) range which is enclosed by both this range andother.voidImmutableRangeMap. merge(Range<K> range, V value, java.util.function.BiFunction<? super V,? super V,? extends V> remappingFunction)Deprecated.Unsupported operation.voidRangeMap. merge(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.voidTreeRangeMap. merge(Range<K> range, V value, java.util.function.BiFunction<? super V,? super V,? extends V> remappingFunction)voidTreeRangeMap.SubRangeMap. merge(Range<K> range, V value, java.util.function.BiFunction<? super V,? super V,? extends V> remappingFunction)static <K extends java.lang.Comparable<?>,V>
ImmutableRangeMap<K,V>ImmutableRangeMap. of(Range<K> range, V value)Returns an immutable range map mapping a single range to a single value.static <C extends java.lang.Comparable>
ImmutableRangeSet<C>ImmutableRangeSet. of(Range<C> range)Returns an immutable range set containing the specified single range.ImmutableRangeMap.Builder<K,V>ImmutableRangeMap.Builder. put(Range<K> range, V value)Associates the specified range with the specified value.voidImmutableRangeMap. put(Range<K> range, V value)Deprecated.Unsupported operation.voidRangeMap. put(Range<K> range, V value)Maps a range to a specified value (optional operation).voidTreeRangeMap. put(Range<K> range, V value)voidTreeRangeMap.SubRangeMap. put(Range<K> range, V value)voidImmutableRangeMap. putCoalescing(Range<K> range, V value)Deprecated.Unsupported operation.voidRangeMap. 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.voidTreeRangeMap. putCoalescing(Range<K> range, V value)voidTreeRangeMap.SubRangeMap. putCoalescing(Range<K> range, V value)private Range<C>TreeRangeSet. rangeEnclosing(Range<C> range)voidAbstractRangeSet. remove(Range<C> range)voidImmutableRangeMap. remove(Range<K> range)Deprecated.Unsupported operation.voidImmutableRangeSet. remove(Range<C> range)Deprecated.Unsupported operation.voidRangeMap. remove(Range<K> range)Removes all associations from this range map in the specified range (optional operation).voidRangeSet. remove(Range<C> range)Removes the specified range from thisRangeSet(optional operation).voidTreeRangeMap. remove(Range<K> rangeToRemove)voidTreeRangeMap.SubRangeMap. remove(Range<K> range)voidTreeRangeSet.Complement. remove(Range<C> rangeToRemove)voidTreeRangeSet. remove(Range<C> rangeToRemove)voidTreeRangeSet.SubRangeSet. remove(Range<C> rangeToRemove)private voidTreeRangeSet. replaceRangeWithSameLowerBound(Range<C> range)Range<C>Range. span(Range<C> other)Returns the minimal range that encloses both this range andother.static <K extends java.lang.Comparable<? super K>,V>
java.util.NavigableMap<K,V>Maps. subMap(java.util.NavigableMap<K,V> map, Range<K> range)Returns a view of the portion ofmapwhose keys are contained byrange.private java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.ComplementRangesByLowerBound. subMap(Range<Cut<C>> subWindow)private java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.RangesByUpperBound. subMap(Range<Cut<C>> window)private java.util.NavigableMap<Cut<C>,Range<C>>TreeRangeSet.SubRangeSetRangesByLowerBound. subMap(Range<Cut<C>> window)ImmutableRangeMap<K,V>ImmutableRangeMap. subRangeMap(Range<K> range)RangeMap<K,V>RangeMap. subRangeMap(Range<K> range)Returns a view of the part of this range map that intersects withrange.RangeMap<K,V>TreeRangeMap. subRangeMap(Range<K> subRange)RangeMap<K,V>TreeRangeMap.SubRangeMap. subRangeMap(Range<K> range)ImmutableRangeSet<C>ImmutableRangeSet. subRangeSet(Range<C> range)Returns a view of the intersection of this range set with the given range.RangeSet<C>RangeSet. subRangeSet(Range<C> view)Returns a view of the intersection of thisRangeSetwith the specified range.RangeSet<C>TreeRangeSet. subRangeSet(Range<C> view)RangeSet<C>TreeRangeSet.SubRangeSet. subRangeSet(Range<C> view)(package private) ImmutableSortedSet<C>ImmutableRangeSet.AsSet. subSet(Range<C> range)static <K extends java.lang.Comparable<? super K>>
java.util.NavigableSet<K>Sets. subSet(java.util.NavigableSet<K> set, Range<K> range)Returns a view of the portion ofsetwhose elements are contained byrange.Method parameters in com.google.common.collect with type arguments of type Range Modifier and Type Method Description voidImmutableRangeSet. addAll(java.lang.Iterable<Range<C>> other)Deprecated.Unsupported operation.ImmutableRangeSet.Builder<C>ImmutableRangeSet.Builder. addAll(java.lang.Iterable<Range<C>> ranges)Add all of the specified ranges to this builder.default voidRangeSet. addAll(java.lang.Iterable<Range<C>> ranges)Adds all of the specified ranges to this range set (optional operation).static <C extends java.lang.Comparable<?>>
ImmutableRangeSet<C>ImmutableRangeSet. copyOf(java.lang.Iterable<Range<C>> ranges)Returns anImmutableRangeSetcontaining each of the specified disjoint ranges.static <C extends java.lang.Comparable<?>>
TreeRangeSet<C>TreeRangeSet. create(java.lang.Iterable<Range<C>> ranges)Returns aTreeRangeSetrepresenting the union of the specified ranges.default booleanRangeSet. enclosesAll(java.lang.Iterable<Range<C>> other)Returnstrueif for each range inotherthere exists a member range in this range set which encloses it.voidImmutableRangeSet. removeAll(java.lang.Iterable<Range<C>> other)Deprecated.Unsupported operation.default voidRangeSet. removeAll(java.lang.Iterable<Range<C>> ranges)Removes all of the specified ranges from this range set (optional operation).private booleanTreeRangeMap.SubRangeMap.SubRangeMapAsMap. removeEntryIf(Predicate<? super java.util.Map.Entry<Range<K>,V>> predicate)(package private) static <T,K extends java.lang.Comparable<? super K>,V>
java.util.stream.Collector<T,?,ImmutableRangeMap<K,V>>CollectCollectors. toImmutableRangeMap(java.util.function.Function<? super T,Range<K>> keyFunction, java.util.function.Function<? super T,? extends V> valueFunction)static <T,K extends java.lang.Comparable<? super K>,V>
java.util.stream.Collector<T,?,ImmutableRangeMap<K,V>>ImmutableRangeMap. toImmutableRangeMap(java.util.function.Function<? super T,Range<K>> keyFunction, java.util.function.Function<? super T,? extends V> valueFunction)Returns aCollectorthat accumulates the input elements into a newImmutableRangeMap.static <C extends java.lang.Comparable<?>>
ImmutableRangeSet<C>ImmutableRangeSet. unionOf(java.lang.Iterable<Range<C>> ranges)Returns anImmutableRangeSetrepresenting the union of the specified ranges.Constructors in com.google.common.collect with parameters of type Range Constructor Description ComplementRangesByLowerBound(java.util.NavigableMap<Cut<C>,Range<C>> positiveRangesByLowerBound, Range<Cut<C>> window)RangeMapEntry(Range<K> range, V value)RangesByUpperBound(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound, Range<Cut<C>> upperBoundWindow)RegularContiguousSet(Range<C> range, DiscreteDomain<C> domain)SerializedForm(Range<C> range, DiscreteDomain<C> domain)SubRangeMap(Range<K> subRange)SubRangeSet(Range<C> restriction)SubRangeSetRangesByLowerBound(Range<Cut<C>> lowerBoundWindow, Range<C> restriction, java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound)Constructor parameters in com.google.common.collect with type arguments of type Range Constructor Description AsRanges(java.util.Collection<Range<C>> delegate)AsSetSerializedForm(ImmutableList<Range<C>> ranges, DiscreteDomain<C> domain)ComplementRangesByLowerBound(java.util.NavigableMap<Cut<C>,Range<C>> positiveRangesByLowerBound)ComplementRangesByLowerBound(java.util.NavigableMap<Cut<C>,Range<C>> positiveRangesByLowerBound, Range<Cut<C>> window)ImmutableRangeMap(ImmutableList<Range<K>> ranges, ImmutableList<V> values)ImmutableRangeSet(ImmutableList<Range<C>> ranges)ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement)RangesByUpperBound(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound)RangesByUpperBound(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound, Range<Cut<C>> upperBoundWindow)SerializedForm(ImmutableMap<Range<K>,V> mapOfRanges)SerializedForm(ImmutableList<Range<C>> ranges)SubRangeSetRangesByLowerBound(Range<Cut<C>> lowerBoundWindow, Range<C> restriction, java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerBound)TreeRangeSet(java.util.NavigableMap<Cut<C>,Range<C>> rangesByLowerCut) -
Uses of Range in com.google.common.testing
Methods in com.google.common.testing that return Range Modifier and Type Method Description private static <C extends java.lang.Comparable<?>>
Range<C>FreshValueGenerator. generateRange()private static <C extends java.lang.Comparable<?>>
Range<C>FreshValueGenerator. generateRange(C freshElement)
-