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 Apr 24 11:36:11 GMT 2024

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

- 23.4K bytes

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

Go

- Registered: Sun Apr 21 19:28:08 GMT 2024

- Last Modified: Mon Sep 04 19:57:37 GMT 2023

- 2.6K 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 21 19:28:08 GMT 2024

- Last Modified: Thu Apr 04 12:04:40 GMT 2024

- 41.3K bytes

- Viewed (1)

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

Plain Text

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

- Last Modified: Wed Dec 16 19:54:45 GMT 2020

- 3.1K bytes

- Viewed (0)

github.com/minio/minio

internal/config/callhome/help.go

			Description: "set to enable callhome" + defaultHelpPostfix(Enable),
			Optional:    true,
		},
		config.HelpKV{
			Key:         Frequency,
			Type:        "duration",
			Description: "time duration between callhome cycles e.g. 24h" + defaultHelpPostfix(Frequency),
			Optional:    true,
		},
	}

Go

- Registered: Sun Apr 21 19:28:08 GMT 2024

- Last Modified: Mon Jun 06 23:14:52 GMT 2022

- 1.4K bytes

- Viewed (0)

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 19 12:43:09 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 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

internal/config/heal/heal.go

		bitrotCycle time.Duration
	}
}

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

// Clone safely the heal configuration

Go

- Registered: Sun Apr 21 19:28:08 GMT 2024

- Last Modified: Thu Apr 11 01:10:30 GMT 2024

- 4.9K 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/google/guava

android/guava-tests/benchmark/com/google/common/util/concurrent/FuturesGetCheckedBenchmark.java

  /**
   * The number of other exception types in the cache of known-good exceptions and the number of
   * other {@code ClassValue} entries for the exception type to be tested. This lets us evaluate
   * whether our solution scales to use with multiple exception types and to whether it is affected
   * by other {@code ClassValue} users. Some of the benchmarked implementations don't use one or
   * both of these mechanisms, so they will be unaffected.
   */

Java

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

- Last Modified: Tue Mar 22 03:01:34 GMT 2022

- 6.5K bytes

- Viewed (0)

Search Options