- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 114 for haverace (0.14 sec)
-
src/cmd/go/internal/mvs/mvs.go
} return nil } // First walk the base modules that must be listed. var min []module.Version haveBase := map[string]bool{} for _, path := range base { if haveBase[path] { continue } m := module.Version{Path: path, Version: max[path]} min = append(min, m) walk(m) haveBase[path] = true } // Now the reverse postorder to bring in anything else. for i := len(postorder) - 1; i >= 0; i-- {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 21:58:12 UTC 2024 - 14.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* <ul> * <li>2 levels: average of 64ns per lock()/unlock() * <li>3 levels: average of 77ns per lock()/unlock() * <li>4 levels: average of 99ns per lock()/unlock() * <li>5 levels: average of 103ns per lock()/unlock() * <li>10 levels: average of 184ns per lock()/unlock() * <li>20 levels: average of 393ns per lock()/unlock() * </ul> * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
src/runtime/sema.go
// (When we do a lifo insertion, we preserve this property by // copying the old head's acquiretime into the inserted new head. // In that case the overall average may be slightly high, but that's fine: // the average of the ends is only an approximation to the actual // average anyway.) // The root.dequeue above changed the head and tail acquiretime // to the current time, so the next unlock will not re-count this contention.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 19K bytes - Viewed (0) -
test/maplinear.go
// O(n lg n) time. Fortunately, the checkLinear test // leaves enough wiggle room to include n lg n time // (it actually tests for O(n^log_2(3)). // To prevent false positives, average away variation // by doing multiple rounds within a single run. checkLinear("iterdelete", 2500, func(n int) { for round := 0; round < 4; round++ { m := map[int]int{} for i := 0; i < n; i++ { m[i] = i
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 3.6K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/DefaultPlanExecutor.java
if (workerCount > 0) { LOGGER.lifecycle("average select time: " + format(stats -> stats.totalSelectTime)); LOGGER.lifecycle("average execute time: " + format(stats -> stats.totalExecuteTime)); LOGGER.lifecycle("average finish time: " + format(stats -> stats.totalMarkFinishedTime)); } completedWorkers.clear();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 05 16:29:26 UTC 2024 - 29.1K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/driver/commands.go
"Divide all samples values by a constant, eg the number of processors or jobs."), "mean": helpText( "Average sample value over first value (count)", "For memory profiles, report average memory per allocation.", "For time-based profiles, report average time per event."), "sample_index": helpText( "Sample value to report (0-based index or name)", "Profiles contain multiple values per sample.",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 18.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ArrayListMultimap.java
* MultimapBuilder.hashKeys(expectedKeys).arrayListValues(expectedValuesPerKey).build()}. * * @param expectedKeys the expected number of distinct keys * @param expectedValuesPerKey the expected average number of values per key * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is * negative */ public static <K extends @Nullable Object, V extends @Nullable Object>
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
// We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory. final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed /** Constructs a graph with the properties specified in {@code builder}. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardNetwork.java
// We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory. final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed /** Constructs a graph with the properties specified in {@code builder}. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ArrayListMultimap.java
* MultimapBuilder.hashKeys(expectedKeys).arrayListValues(expectedValuesPerKey).build()}. * * @param expectedKeys the expected number of distinct keys * @param expectedValuesPerKey the expected average number of values per key * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is * negative */ public static <K extends @Nullable Object, V extends @Nullable Object>
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 6.9K bytes - Viewed (0)