cycles - Code Search

build-logic-commons/code-quality-rules/src/main/resources/classycle/classycle_report_resources.zip

 } </style></head><body>"); list.document.writeln(text); list.document.writeln("</body></html>"); list.document.close(); list.focus(); } //--> Analysis of Date: Summary no class cycles class cycle class cycles class layers classes (using external classes) grouped in packages no package cycles package cycle package cycles no package packages Type Number of classes Averaged (maximum) size in bytes Averaged (maximum) number of usage by other classes Averaged (maximum) number of used internal classes...

Created: Wed Apr 01 11:36:16 GMT 2026

- Last Modified: Wed Dec 09 08:14:05 GMT 2020

- 23.4K bytes

- Click Count (0)

github.com/minio/minio

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.

Created: Sun Apr 05 19:28:12 GMT 2026

- Last Modified: Sun Sep 28 20:59:21 GMT 2025

- 34.7K bytes

- Click Count (0)

github.com/google/guava

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>
 *

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Wed Apr 01 17:27:13 GMT 2026

- 36K bytes

- Click Count (0)

github.com/minio/minio

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 {

Created: Sun Apr 05 19:28:12 GMT 2026

- Last Modified: Sun Sep 28 20:59:21 GMT 2025

- 14.7K bytes

- Click Count (0)

github.com/minio/minio

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)

Created: Sun Apr 05 19:28:12 GMT 2026

- Last Modified: Fri Aug 29 02:39:48 GMT 2025

- 45.5K bytes

- Click Count (0)

github.com/google/guava

android/guava/src/com/google/common/graph/Traverser.java

   *       number of nodes that have been seen but not yet visited, that is, the "horizon").
   * </ul>
   *
   * @param graph {@link SuccessorsFunction} representing a general graph that may have cycles.
   */
  public static <N> Traverser<N> forGraph(SuccessorsFunction<N> graph) {
    return new Traverser<N>(graph) {
      @Override
      Traversal<N> newTraversal() {
        return Traversal.inGraph(graph);

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Wed Mar 11 01:10:31 GMT 2026

- 19.3K bytes

- Click Count (0)

github.com/apache/maven

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 {

Created: Sun Apr 05 03:35:12 GMT 2026

- Last Modified: Wed Sep 17 10:01:14 GMT 2025

- 43K bytes

- Click Count (0)

github.com/google/guava

guava-tests/test/com/google/common/reflect/ClassPathTest.java

  public void testScanDirectory_symlinkCycle() throws IOException {
    if (isWindows()) {
      return; // TODO: b/136041958 - Can we detect cycles under Windows?
    }
    ClassLoader loader = ClassPathTest.class.getClassLoader();
    // directory with a cycle,
    // /root
    //    /left
    //       /[sibling -> right]
    //    /right
    //       /[sibling -> left]

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Thu Mar 12 17:47:10 GMT 2026

- 25.8K bytes

- Click Count (0)

github.com/google/guava

android/guava/src/com/google/common/reflect/ClassPath.java

     * cycles; otherwise symlinks are traversed.
     *
     * @param directory the root of the directory to scan
     * @param packagePrefix resource path prefix inside {@code classloader} for any files found
     *     under {@code directory}
     * @param currentPath canonical files already visited in the current directory tree path, for
     *     cycle elimination
     */

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Thu Jan 29 22:14:05 GMT 2026

- 24.8K bytes

- Click Count (0)

github.com/google/guava

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

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Thu Apr 02 14:49:41 GMT 2026

- 34.7K bytes

- Click Count (0)

Search Options