- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 22 for numGCs (0.11 sec)
-
src/runtime/gc_test.go
// slack if things are slow. var numGCs uint32 const want = 2 for i := 0; i < 200 && numGCs < want; i++ { time.Sleep(5 * time.Millisecond) // Test that periodic GC actually happened. runtime.ReadMemStats(&ms2) numGCs = ms2.NumGC - ms1.NumGC } *runtime.ForceGCPeriod = orig if numGCs < want { t.Fatalf("no periodic GC: got %v GCs, want >= 2", numGCs) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 05 22:33:52 UTC 2024 - 17.6K bytes - Viewed (0) -
src/index/suffixarray/sais2.go
// about each's role in the algorithm. numLMS := placeLMS_8_64(text, sa, freq, bucket) if numLMS <= 1 { // 0 or 1 items are already sorted. Do nothing. } else { induceSubL_8_64(text, sa, freq, bucket) induceSubS_8_64(text, sa, freq, bucket) length_8_64(text, sa, numLMS) maxID := assignID_8_64(text, sa, numLMS) if maxID < numLMS { map_64(sa, numLMS) recurse_64(sa, tmp, numLMS, maxID) unmap_8_64(text, sa, numLMS)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K bytes - Viewed (0) -
src/index/suffixarray/sais.go
// about each's role in the algorithm. numLMS := placeLMS_8_32(text, sa, freq, bucket) if numLMS <= 1 { // 0 or 1 items are already sorted. Do nothing. } else { induceSubL_8_32(text, sa, freq, bucket) induceSubS_8_32(text, sa, freq, bucket) length_8_32(text, sa, numLMS) maxID := assignID_8_32(text, sa, numLMS) if maxID < numLMS { map_32(sa, numLMS) recurse_32(sa, tmp, numLMS, maxID)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 32.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/dropped_requests_tracker_test.go
tracker := newDroppedRequestsTracker(fakeClock.Now) startCh := make(chan struct{}) wg := sync.WaitGroup{} numPLs := 5 // For all `numPLs` priority levels, create b.N workers each // of which will try to record a dropped request every 100ms // with a random jitter. for i := 0; i < numPLs; i++ { plName := fmt.Sprintf("priority-level-%d", i) for i := 0; i < b.N; i++ { wg.Add(1) go func() {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 26 13:50:25 UTC 2023 - 4.9K bytes - Viewed (0) -
test/typeparam/issue51925.go
if x < y { return x } return y } // Min returns the minimum element of `nums`. func Min[T IntLike, NumSlice ~[]T](nums NumSlice) T { if len(nums) == 0 { return T(0) } return Reduce(min[T], nums, nums[0]) } // VarMin is the variadic version of Min. func VarMin[T IntLike](nums ...T) T { return Min(nums) } type myInt int func main() { fmt.Println(VarMin(myInt(1), myInt(2)))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Dec 14 17:22:18 UTC 2023 - 963 bytes - Viewed (0) -
guava-tests/test/com/google/common/base/PredicatesTest.java
public void testIn_compilesWithExplicitSupertype() { Collection<Number> nums = ImmutableSet.of(); Predicate<Number> p1 = Predicates.in(nums); Predicate<Object> p2 = Predicates.<Object>in(nums); // The next two lines are not expected to compile. // Predicate<Integer> p3 = Predicates.in(nums); // Predicate<Integer> p4 = Predicates.<Integer>in(nums); } @J2ktIncompatible @GwtIncompatible // NullPointerTester
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 17:15:24 UTC 2024 - 32.4K bytes - Viewed (0) -
test/fixedbugs/issue6750.go
// Copyright 2016 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package main import "fmt" func printmany(nums ...int) { for i, n := range nums { fmt.Printf("%d: %d\n", i, n) } fmt.Printf("\n") } func main() { printmany(1, 2, 3) printmany([]int{1, 2, 3}...)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Dec 09 23:54:59 UTC 2020 - 528 bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
} static BigInteger listProduct(List<BigInteger> nums) { return listProduct(nums, 0, nums.size()); } static BigInteger listProduct(List<BigInteger> nums, int start, int end) { switch (end - start) { case 0: return BigInteger.ONE; case 1: return nums.get(start); case 2: return nums.get(start).multiply(nums.get(start + 1)); case 3:
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
pkg/kubelet/cm/cpumanager/cpu_assignment.go
// sort the NUMA nodes directly, and return them. func (n *numaFirst) sortAvailableNUMANodes() []int { numas := n.acc.details.NUMANodes().UnsortedList() n.acc.sort(numas, n.acc.details.CPUsInNUMANodes) return numas } // If NUMA nodes are higher in the memory hierarchy than sockets, then we need // to pull the set of sockets out of each sorted NUMA node, and accumulate the
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 25 23:56:21 UTC 2024 - 36.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/PredicatesTest.java
public void testIn_compilesWithExplicitSupertype() { Collection<Number> nums = ImmutableSet.of(); Predicate<Number> p1 = Predicates.in(nums); Predicate<Object> p2 = Predicates.<Object>in(nums); // The next two lines are not expected to compile. // Predicate<Integer> p3 = Predicates.in(nums); // Predicate<Integer> p4 = Predicates.<Integer>in(nums); } @J2ktIncompatible @GwtIncompatible // NullPointerTester
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 17:15:24 UTC 2024 - 32.4K bytes - Viewed (0)