- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 511 for equivalentTo (0.22 sec)
-
guava/src/com/google/common/base/Equivalence.java
* <li>If {@code equivalent(x, y)} and {@code equivalent(y, z)} are both true, then {@code * equivalent(x, z)} is also true (<i>transitive</i> property) * </ul> * * <p>Note that all calls to {@code equivalent(x, y)} are expected to return the same result as * long as neither {@code x} nor {@code y} is modified. */ public final boolean equivalent(@CheckForNull T a, @CheckForNull T b) { if (a == b) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 14.1K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Equivalence.java
* <li>If {@code equivalent(x, y)} and {@code equivalent(y, z)} are both true, then {@code * equivalent(x, z)} is also true (<i>transitive</i> property) * </ul> * * <p>Note that all calls to {@code equivalent(x, y)} are expected to return the same result as * long as neither {@code x} nor {@code y} is modified. */ public final boolean equivalent(@CheckForNull T a, @CheckForNull T b) { if (a == b) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu May 16 14:34:47 UTC 2024 - 13.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeSet.java
* range set. The returned set may be empty. The iterators returned by its {@link * Iterable#iterator} method return the ranges in increasing order of lower bound (equivalently, * of upper bound). */ Set<Range<C>> asRanges(); /** * Returns a descending view of the {@linkplain Range#isConnected disconnected} ranges that make
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 9.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/RangeSet.java
* range set. The returned set may be empty. The iterators returned by its {@link * Iterable#iterator} method return the ranges in increasing order of lower bound (equivalently, * of upper bound). */ Set<Range<C>> asRanges(); /** * Returns a descending view of the {@linkplain Range#isConnected disconnected} ranges that make
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.2K bytes - Viewed (0) -
src/image/color/ycbcr.go
// to 257*Y', which ranges over [0, 1<<16-1] as Y' ranges over [0, 255]. // YY1 is then defined as: // YY1 = 65536*Y' + 257*Y' // or equivalently: // YY1 = Y' * 0x10101 yy1 := int32(y) * 0x10101 cb1 := int32(cb) - 128 cr1 := int32(cr) - 128 // The bit twiddling below is equivalent to // // r := (yy1 + 91881*cr1) >> 16 // if r < 0 { // r = 0 // } else if r > 0xff { // r = ^int32(0) // }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 10.8K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Splitter.java
return new Splitter(strategy, omitEmptyStrings, trimmer, maxItems); } /** * Returns a splitter that behaves equivalently to {@code this} splitter, but automatically * removes leading and trailing {@linkplain CharMatcher#whitespace whitespace} from each returned * substring; equivalent to {@code trimResults(CharMatcher.whitespace())}. For example, {@code
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 23.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* @since 24.0 */ @Override Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 13.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graph.java
* @since 24.0 */ @Override Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 13.6K bytes - Viewed (0) -
src/sync/atomic/doc.go
// equivalent of: // // *addr += delta // return *addr // // The load and store operations, implemented by the LoadT and StoreT // functions, are the atomic equivalents of "return *addr" and // "*addr = val". // // In the terminology of [the Go memory model], if the effect of // an atomic operation A is observed by atomic operation B, // then A “synchronizes before” B.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 21:14:51 UTC 2024 - 11.7K bytes - Viewed (0) -
src/net/http/pattern_test.go
return p } func TestCompareMethods(t *testing.T) { for _, test := range []struct { p1, p2 string want relationship }{ {"/", "/", equivalent}, {"GET /", "GET /", equivalent}, {"HEAD /", "HEAD /", equivalent}, {"POST /", "POST /", equivalent}, {"GET /", "POST /", disjoint}, {"GET /", "/", moreSpecific}, {"HEAD /", "/", moreSpecific}, {"GET /", "HEAD /", moreGeneral}, } {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 16:36:30 UTC 2024 - 15K bytes - Viewed (0)