- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for numGCs (0.25 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/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) -
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) -
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) -
platforms/core-runtime/base-services/src/test/groovy/org/gradle/util/internal/CollectionUtilsTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:48:02 UTC 2023 - 11.7K bytes - Viewed (0) -
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) -
src/cmd/link/internal/wasm/asm.go
func writeElementSec(ctxt *ld.Link, numImports, numFns uint64) { sizeOffset := writeSecHeader(ctxt, sectionElement) writeUleb128(ctxt.Out, 1) // number of element segments writeUleb128(ctxt.Out, 0) // tableidx writeI32Const(ctxt.Out, funcValueOffset) ctxt.Out.WriteByte(0x0b) // end writeUleb128(ctxt.Out, numFns) // number of entries for i := uint64(0); i < numFns; i++ { writeUleb128(ctxt.Out, numImports+i) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:17:48 UTC 2024 - 21.9K bytes - Viewed (0) -
cmd/erasure-metadata-utils.go
// Returns an empty int slice for cardinality < 0. return nil } nums := make([]int, cardinality) keyCrc := crc32.Checksum([]byte(key), crc32.IEEETable) start := int(keyCrc % uint32(cardinality)) for i := 1; i <= cardinality; i++ { nums[i-1] = 1 + ((start + i) % cardinality) } return nums } // Reads all `xl.meta` metadata as a FileInfo slice.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 11.7K bytes - Viewed (0)