- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 147 for cycles (0.12 sec)
-
cmd/data-usage-cache.go
} // mod returns true if the hash mod cycles == cycle. // If cycles is 0 false is always returned. // If cycles is 1 true is always returned (as expected). func (h dataUsageHash) mod(cycle uint32, cycles uint32) bool { if cycles <= 1 { return cycles == 1 } return uint32(xxhash.Sum64String(string(h)))%cycles == cycle%cycles } // modAlt returns true if the hash mod cycles == cycle. // This is out of sync with mod.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 34.7K bytes - Viewed (0) -
cycle_suppress_list.txt
# TODO(user): Resolve cycles NAMESPACE com.google.common.collect.testing NAMESPACE com.google.common.collect.testing.google NAMESPACE com.google.common.escape NAMESPACE com.google.common.escape.testing NAMESPACE com.google.common.io NAMESPACE com.google.common.net NAMESPACE com.google.common.testing # Allow our dependencies for now. NAMESPACE junit.framework NAMESPACE org.junit # ***** REAL CYCLES *****
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 24 01:59:49 UTC 2025 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* verified or created. * <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed * to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new * "safe" edge is created. * <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential * deadlock situation, and the appropriate Policy is executed. * </ul> *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 18 15:05:43 UTC 2025 - 35.9K bytes - Viewed (0) -
src/test/java/jcifs/smb/SimpleMemoryManagementTest.java
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/UnmodifiableSortedMultiset.java
return (NavigableSet<E>) super.elementSet(); } @LazyInit private transient @Nullable UnmodifiableSortedMultiset<E> descendingMultiset; // TODO(b/418181860): This method creates retain cycles in J2ObjC. In order to break the cycle, // there needs to be separate classes for primary and descending multiset, where the primary one // would hold {@code @LazyInit @RetainedWith @Nullable} reference to its descending multiset, and
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 4K bytes - Viewed (0) -
cmd/data-scanner.go
// 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/data-usage_test.go
} createUsageTestFiles(t, base, bucket, files) err = os.RemoveAll(filepath.Join(base, bucket, "dir1/dira/dirasub/dcfile")) if err != nil { t.Fatal(err) } // Changed dir must be picked up in this many cycles. for range dataUsageUpdateDirCycles { got, err = scanDataFolder(t.Context(), nil, &xls, got, getSize, 0, weSleep) got.Info.NextCycle++ if err != nil { t.Fatal(err) } } want = []struct {
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 14.6K bytes - Viewed (0) -
compat/maven-compat/src/test/java/org/apache/maven/repository/legacy/resolver/DefaultArtifactCollectorTest.java
assertThrows( CyclicDependencyException.class, () -> collect(a), "Should have failed on cyclic dependency not involving project"); } @Test @Disabled("works, but we don't fail on cycles presently") void testCircularDependencyIncludingCurrentProject() throws ArtifactResolutionException, InvalidVersionSpecificationException {
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Fri Jun 06 14:28:57 UTC 2025 - 42.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
count++; } return count; } /** * Returns an iterator that cycles indefinitely over the elements of {@code iterable}. * * <p>The returned iterator supports {@code remove()} if the provided iterator does. After {@code * remove()} is called, subsequent cycles omit the removed element, which is no longer in {@code
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 50.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/FluentIterable.java
} /** * Returns a fluent iterable whose {@code Iterator} cycles indefinitely over the elements of this * fluent iterable. * * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code * remove()} is called, subsequent cycles omit the removed element, which is no longer in this
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 35.3K bytes - Viewed (0)