搜索

MapIterator 文档

Sets the value associated with the current key (optional operation).

ImmutableListMultimap 文档

Returns an immutable multimap containing the same mappings as multimap. The generated multimap's key and value orderings correspond to the iteration ordering of the multimap.asMap() view. Despite the method name, this method attempts to avoid actually copying the data when it is safe to do so. The exact circumstances under which a copy will or will not be performed are undocumented and subject to change.

ContiguousSet<C>.toString Method 文档

Returns a short-hand representation of the contents such as "[1..100]".

DiscreteDomain<C>.minValue Method 文档

Returns the minimum value of type C, if it has one. The minimum value is the unique value for which Comparable#compareTo(Object) never returns a positive value for any input of type C. The default implementation throws NoSuchElementException.

RangeSet<C>.clear Method 文档

Removes all ranges from this RangeSet (optional operation). After this operation, this.contains(c) will return false for all c. This is equivalent to remove(Range.all()).

RangeSet<C>.isEmpty Method 文档

Returns true if this range set contains no ranges.

CharMatcher.matches(char c) Method 文档

Determines a true or false value for the given character.

Range<C> Class 文档

A range (or "interval") defines the boundaries around a contiguous span of values of some Comparable type; for example, "integers from 1 to 100 inclusive." Note that it is not possible to iterate over these contained values. To do so, pass this range instance and an appropriate DiscreteDomain<C> to ContiguousSet#create. Types of ranges Each end of the range may be bounded or unbounded. If bounded, there is an associated endpoint value, and the range is considered to be either open (does not include the endpoint) or closed (includes the endpoint) on that side. With three possibilities on each side, this yields nine basic types of ranges, enumerated below. (Notation: a square bracket ([ ]) indicates that the range is closed on that side; a parenthesis (( )) means it is either open or unbounded. The construct {x | statement} is read "the set of all x such that statement.") | -------------------- | ------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------ | | Notation | Definition | Factory method | | `(a..b)` | `{x | a < x < b}` | <xref uid="com.azure.cosmos.implementation.guava25.collect.Range.open" data-throw-if-not-resolved="false" data-raw-source="open"></xref> | | `[a..b]` | `{x | a <= x <= b}` | <xref uid="com.azure.cosmos.implementation.guava25.collect.Range.closed" data-throw-if-not-resolved="false" data-raw-source="closed"></xref> | | `(a..b]` | `{x | a < x <= b}` | <xref uid="com.azure.cosmos.implementation.guava25.collect.Range.openClosed" data-throw-if-not-resolved="false" data-raw-source="openClosed"></xref> | | `[a..b)` | `{x | a <= x < b}` | <xref uid="com.azure.cosmos.implementation.guava25.collect.Range.closedOpen" data-throw-if-not-resolved="false" data-raw-source="closedOpen"></xref> | | `(a..+\u221e)` | `{x | x > a}` | <xref uid="com.azure.cosmos.implementation.guava25.collect.Range.greaterThan" data-throw-if-not-resolved="false" data-raw-source="greaterThan"></xref> | | `[a..+\u221e)` | `{x | x >= a}` | <xref uid="com.azure.cosmos.implementation.guava25.collect.Range.atLeast" data-throw-if-not-resolved="false" data-raw-source="atLeast"></xref> | | `(-\u221e..b)` | `{x | x < b}` | <xref uid="com.azure.cosmos.implementation.guava25.collect.Range.lessThan" data-throw-if-not-resolved="false" data-raw-source="lessThan"></xref> | | `(-\u221e..b]` | `{x | x <= b}` | <xref uid="com.azure.cosmos.implementation.guava25.collect.Range.atMost" data-throw-if-not-resolved="false" data-raw-source="atMost"></xref> | | `(-\u221e..+\u221e)` | `{x}` | <xref uid="com.azure.cosmos.implementation.guava25.collect.Range.all" data-throw-if-not-resolved="false" data-raw-source="all"></xref> | When both endpoints exist, the upper endpoint may not be less than the lower. The endpoints may be equal only if at least one of the bounds is closed: [a..a] : a singleton range [a..a); (a..a] : empty ranges; also valid (a..a) : invalid; an exception will be thrown Warnings Use immutable value types only, if at all possible. If you must use a mutable type, do not allow the endpoint instances to mutate after the range is created! Your value type's comparison method should be consistent with equals if at all possible. Otherwise, be aware that concepts used throughout this documentation such as "equal", "same", "unique" and so on actually refer to whether compareTo returns zero, not whether equals returns true. A class which implements Comparable is very broken, and will cause undefined horrible things to happen in Range. For now, the Range API does not prevent its use, because this would also rule out all ungenerified (pre-JDK1.5) data types. This may change in the future. Other notes Instances of this type are obtained using the static factory methods in this class. Ranges are convex: whenever two values are contained, all values in between them must also be contained. More formally, for any c1 <= c2 <= c3 of type C, r.contains(c1) && r.contains(c3) implies r.contains(c2)). This means that a Range can never be used to represent, say, "all prime numbers from 1 to 100." When evaluated as a Predicate<T>, a range yields the same result as invoking #contains. Terminology note: a range a is said to be the maximal range having property P if, for all ranges b also having property P, a.encloses(b). Likewise, a is minimal when b.encloses(a) for all b having property P. See, for example, the definition of intersection. Further reading See the Guava User Guide article on Range.

TreeRangeSet<C>.asDescendingSetOfRanges Method 文档

FabricServicePartitionClient<C>.getCommunicationClientFactory Method 文档

Gets the communication client factory