- Sort Score
- Result 10 results
- Languages All
Results 681 - 690 of 1,463 for case81 (0.13 sec)
-
guava-tests/test/com/google/common/math/MathBenchmarking.java
*/ package com.google.common.math; import java.math.BigInteger; import java.util.Random; import org.jspecify.annotations.NullUnmarked; /** * Utilities for benchmarks. * * <p>In many cases, we wish to vary the order of magnitude of the input as much as we want to vary * the input itself, so most methods which generate values use an exponential distribution varying
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Aug 10 19:54:19 UTC 2025 - 4.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/SuppliersTest.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 17.9K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SmbRandomAccessFile.java
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 14.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TestUtil.java
assertThat(networkA.nodeOrder()).isEqualTo(networkB.nodeOrder()); assertThat(networkA.edgeOrder()).isEqualTo(networkB.edgeOrder()); assertThat(networkA).isEqualTo(networkB); } /** * In some cases our graph implementations return custom sets that define their own size() and * contains(). Verify that these sets are consistent with the elements of their iterator. */ @CanIgnoreReturnValue
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Jan 18 02:54:30 UTC 2025 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
this.node = node; } } /** * Determines whether an edge has already been used during traversal. In the directed case a cycle * is always detected before reusing an edge, so no special logic is required. In the undirected * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going * from B to A). */ private static boolean canTraverseWithoutReusingEdge(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
this.node = node; } } /** * Determines whether an edge has already been used during traversal. In the directed case a cycle * is always detected before reusing an edge, so no special logic is required. In the undirected * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going * from B to A). */ private static boolean canTraverseWithoutReusingEdge(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
cmd/notification.go
defer wg.Done() for { select { case m, ok := <-peerChannel: if !ok { return } select { case ch <- m: case <-ctx.Done(): return } case <-ctx.Done(): return } } }(ctx, peerChannels[index], &wg) }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 45.9K bytes - Viewed (0) -
guava/src/com/google/common/base/Function.java
* this function. * * <p><b>Warning: do not depend</b> on the behavior of this method. * * <p>Historically, {@code Function} instances in this library have implemented this method to * recognize certain cases where distinct {@code Function} instances would in fact behave * identically. However, as code migrates to {@code java.util.function}, that behavior will * disappear. It is best not to depend on it. */ @Override
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Apr 15 22:14:00 UTC 2025 - 2.6K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/cache2/Relay.kt
* * ## Upstream * * In this case the current thread is assigned as the upstream reader. We read bytes from * upstream and copy them to both the file and to the buffer. Finally we release the upstream * reader lock and return the new bytes. * * ## The file * * In this case we copy bytes from the file to the [sink]. * * ## The buffer *
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed May 28 17:15:47 UTC 2025 - 11.8K bytes - Viewed (0) -
cmd/erasure-metadata-utils.go
continue } errorCounts[err]++ } maxCnt := 0 for err, count := range errorCounts { switch { case maxCnt < count: maxCnt = count maxErr = err // Prefer `nil` over other error values with the same // number of occurrences. case maxCnt == count && err == nil: maxErr = err } } return maxCnt, maxErr }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 11.7K bytes - Viewed (0)