Eccles - 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...

ZIP Archive

- Registered: Wed May 01 11:36:15 GMT 2024

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

- 23.4K bytes

- Viewed (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.

Go

- Registered: Sun Apr 28 19:28:10 GMT 2024

- Last Modified: Mon Apr 22 17:49:30 GMT 2024

- 41.4K bytes

- Viewed (1)

github.com/google/guava

android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

 * </ul>
 *
 * <p>The locks created by a factory instance will detect lock acquisition cycles with locks created
 * by other {@code CycleDetectingLockFactory} instances (except those with {@code Policy.DISABLED}).
 * A lock's behavior when a cycle is detected, however, is defined by the {@code Policy} of the
 * factory that created it. This allows detection of cycles across components while delegating
 * control over lock behavior to individual components.
 *

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Fri Dec 15 19:31:54 GMT 2023

- 35.9K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/TraverserTest.java

   *
   * <pre>{@code
   * |--------------|
   * v              |
   * a -> b -> c -> d
   * |         ^
   * |---------|
   * }</pre>
   */
  private static final SuccessorsFunction<Character> TWO_CYCLES_GRAPH =
      createDirectedGraph("ab", "ac", "bc", "cd", "da");

  /**
   * A tree-shaped graph that looks as follows (all edges are directed facing downwards):
   *
   * <pre>{@code
   *        h

Java

- Registered: Fri May 03 12:43:13 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 47.5K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/TraverserTest.java

   *
   * <pre>{@code
   * |--------------|
   * v              |
   * a -> b -> c -> d
   * |         ^
   * |---------|
   * }</pre>
   */
  private static final SuccessorsFunction<Character> TWO_CYCLES_GRAPH =
      createDirectedGraph("ab", "ac", "bc", "cd", "da");

  /**
   * A tree-shaped graph that looks as follows (all edges are directed facing downwards):
   *
   * <pre>{@code
   *        h

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 47.5K bytes

- Viewed (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 i := 0; i < dataUsageUpdateDirCycles; i++ {
		got, err = scanDataFolder(context.Background(), nil, base, got, getSize, 0, weSleep)
		got.Info.NextCycle++
		if err != nil {
			t.Fatal(err)
		}
	}

Go

- Registered: Sun Apr 28 19:28:10 GMT 2024

- Last Modified: Wed Mar 27 15:10:40 GMT 2024

- 14.1K bytes

- Viewed (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);

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Tue May 30 20:12:45 GMT 2023

- 19.8K bytes

- Viewed (0)

github.com/google/guava

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

 *       {@code $} in its name is a nested class</a>.
 * </ul>
 *
 * <h2>{@code ClassPath} and symlinks</h2>
 *
 * <p>In the case of directory classloaders, symlinks are supported but cycles are not traversed.
 * This guarantees discovery of each unique loadable resource. However, not all possible
 * aliases for resources on cyclic paths will be listed.
 *
 * @author Ben Yu
 * @since 14.0
 */

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Wed Jan 05 17:43:40 GMT 2022

- 24.9K bytes

- Viewed (1)

github.com/google/guava

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

    }
  }

  @AndroidIncompatible // Path (for symlink creation)

  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

Java

- Registered: Fri Apr 12 12:43:09 GMT 2024

- Last Modified: Mon Jul 10 17:06:37 GMT 2023

- 27.7K bytes

- Viewed (0)

github.com/minio/minio

cmd/data-scanner.go

)

const (
	dataScannerSleepPerFolder        = time.Millisecond                 // Time to wait between folders.
	dataUsageUpdateDirCycles         = 16                               // Visit all folders every n cycles.
	dataScannerCompactLeastObject    = 500                              // Compact when there is less than this many objects in a branch.

Go

- Registered: Sun Apr 28 19:28:10 GMT 2024

- Last Modified: Mon Apr 22 17:49:30 GMT 2024

- 47.4K bytes

- Viewed (0)

Search Options