- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 246 for Every (0.02 sec)
-
guava/src/com/google/common/util/concurrent/Striped.java
return Collections.unmodifiableList(asStripes); } // Static factories /** * Creates a {@code Striped<L>} with eagerly initialized, strongly referenced locks. Every lock is * obtained from the passed supplier. * * @param stripes the minimum number of stripes (locks) required * @param supplier a {@code Supplier<L>} object to obtain locks from
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 20.6K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/NullPointerTester.java
testConstructor(constructor); } } } /** Runs {@link #testConstructor} on every public constructor in class {@code c}. */ public void testAllPublicConstructors(Class<?> c) { testConstructors(c, Visibility.PUBLIC); } /** * Runs {@link #testMethod} on every static method of class {@code c} that has at least {@code
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Jul 14 14:44:08 UTC 2025 - 24.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) { ImmutableGraph.Builder<N> transitiveClosure = GraphBuilder.from(graph).allowsSelfLoops(true).<N>immutable(); // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) {
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
public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) { ImmutableGraph.Builder<N> transitiveClosure = GraphBuilder.from(graph).allowsSelfLoops(true).<N>immutable(); // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/FeatureSpecificTestSuiteBuilder.java
@SuppressWarnings("unchecked") protected B self() { return (B) this; } // Test Data private @Nullable G subjectGenerator; // Gets run before every test. private Runnable setUp; // Gets run at the conclusion of every test. private Runnable tearDown; @CanIgnoreReturnValue protected B usingGenerator(G subjectGenerator) { this.subjectGenerator = subjectGenerator; return self();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 10.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java
// launched by this test is either: // // (a) Blocked attempting to enter the monitor. // (b) Waiting for the single guard to become satisfied. // (c) Occupying the monitor and awaiting the tearDownLatch. // // Except for (c), every thread should occupy the monitor very briefly, and every thread leaves
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 27K bytes - Viewed (0) -
cmd/data-scanner.go
// Adjust the probability of healing. // This first removes lowest x from the mod check and makes it x times more likely. // So if duudc = 10 and we want heal check every 50 cycles, we check // if (cycle/10) % (50/10) == 0, which would make heal checks run once every 50 cycles, // if the objects are pre-selected as 1:10. folder.objectHealProbDiv = dataUsageUpdateDirCycles } f.updateCurrentPath(folder.name)
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 45.5K bytes - Viewed (0) -
cmd/local-locker_test.go
} // Each Lock has m entries if len(l.lockMap) != len(rResources)+len(wResources)*m { t.Fatalf("lockmap len, got %d, want %d + %d", len(l.lockMap), len(rResources), len(wResources)*m) } // A UID is added for every resource if len(l.lockUID) != len(rResources)*2+len(wResources)*m { t.Fatalf("lockUID len, got %d, want %d + %d", len(l.lockUID), len(rResources)*2, len(wResources)*m) } // RUnlock once...
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 11.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ComparisonChain.java
* .result(); * } * } * * <p>The value of this expression will have the same sign as the <i>first nonzero</i> comparison * result in the chain, or will be zero if every comparison result was zero. * * <p><b>Note:</b> {@code ComparisonChain} instances are <b>immutable</b>. For this utility to work * correctly, calls must be chained as illustrated above. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 11.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ArrayTable.java
* it requires that the complete universe of rows and columns be specified at construction time. * Second, it is always backed by an array large enough to hold a value for every possible * combination of row and column keys. (This is rarely optimal unless the table is extremely dense.) * Finally, every possible combination of row and column keys is always considered to have a value
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 13 19:39:21 UTC 2025 - 26.8K bytes - Viewed (0)