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/minio/minio

internal/config/callhome/callhome.go

	},
}

// callhomeCycleDefault is the default interval between two callhome cycles (24hrs)
const callhomeCycleDefault = 24 * time.Hour

// Config represents the subnet related configuration
type Config struct {
	// Flag indicating whether callhome is enabled.
	Enable bool `json:"enable"`

	// The interval between callhome cycles
	Frequency time.Duration `json:"frequency"`
}

var configLock sync.RWMutex

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

- Last Modified: Fri May 24 23:05:23 GMT 2024

- 2.6K bytes

- Click Count (0)

github.com/google/guava

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

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

- Last Modified: Thu Jul 24 01:59:49 GMT 2025

- 3.2K 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

internal/config/heal/heal.go

	// Cached value from Bitrot field
	cache struct {
		// -1: bitrot enabled, 0: bitrot disabled, > 0: bitrot cycle
		bitrotCycle time.Duration
	}
}

// BitrotScanCycle returns the configured cycle for the scanner healing
// - '-1' for not enabled
// - '0' for continuous bitrot scanning
// - '> 0' interval duration between cycles
func (opts Config) BitrotScanCycle() (d time.Duration) {
	configMutex.RLock()
	defer configMutex.RUnlock()

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

- Last Modified: Mon Nov 04 19:06:02 GMT 2024

- 4.9K bytes

- Click Count (0)

github.com/golang/go

src/arena/arena.go

of Go values and free that space manually all at once, safely. The purpose
of this functionality is to improve efficiency: manually freeing memory
before a garbage collection delays that cycle. Less frequent cycles means
the CPU cost of the garbage collector is incurred less frequently.

This functionality in this package is mostly captured in the Arena type.

Created: Tue Apr 07 11:13:11 GMT 2026

- Last Modified: Wed Oct 12 20:23:36 GMT 2022

- 4.3K 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)

Search Options