- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 208 for BarTest (0.35 sec)
-
src/internal/trace/traceviewer/http.go
</ul> <h2>Garbage collection metrics</h2> <ul> <li><a href="/mmu">Minimum mutator utilization</a></li> </ul> <p> This chart indicates the maximum GC pause time (the largest x value for which y is zero), and more generally, the fraction of time that the processors are available to application goroutines ("mutators"), for any time window of a specified size, in the worst case. </p>
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 21:29:53 UTC 2023 - 12.6K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
// prefers setCounts to be sorted for optimal behavior. if divisibleSize < setCounts[len(setCounts)-1] { return divisibleSize } // Figure out largest value of total_drives_in_erasure_set which results // in least number of total_drives/total_drives_erasure_set ratio. prevD := divisibleSize / setCounts[0] for _, cnt := range setCounts { if divisibleSize%cnt == 0 {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 14.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* @since 20.0 */ public static BigInteger ceilingPowerOfTwo(BigInteger x) { return BigInteger.ZERO.setBit(log2(x, CEILING)); } /** * Returns the largest power of two less than or equal to {@code x}. This is equivalent to {@code * BigInteger.valueOf(2).pow(log2(x, FLOOR))}. * * @throws IllegalArgumentException if {@code x <= 0} * @since 20.0 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
throw new ArithmeticException("ceilingPowerOfTwo(" + x + ") is not representable as a long"); } return 1L << -Long.numberOfLeadingZeros(x - 1); } /** * Returns the largest power of two less than or equal to {@code x}. This is equivalent to {@code * checkedPow(2, log2(x, FLOOR))}. * * @throws IllegalArgumentException if {@code x <= 0} * @since 20.0 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
public int indexOf(long target) { for (int i = start; i < end; i++) { if (array[i] == target) { return i - start; } } return -1; } /** * Returns the largest index for which {@link #get} returns {@code target}, or {@code -1} if no * such index exists. Equivalent to {@code asList().lastIndexOf(target)}. */ public int lastIndexOf(long target) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 16:34:24 UTC 2023 - 18.9K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/noderesources/fit.go
handle: h, resourceAllocationScorer: *scorePlugin(args), }, nil } // computePodResourceRequest returns a framework.Resource that covers the largest // width in each resource dimension. Because init-containers run sequentially, we collect // the max in each dimension iteratively. In contrast, we sum the resource vectors for // regular containers since they run simultaneously.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 20.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/StatsTesting.java
* #MANY_VALUES_COUNT} values. If all the values are finite then the mean is {@link * #MANY_VALUES_MEAN} and the sum-of-squares-of-deltas is {@link * #MANY_VALUES_SUM_OF_SQUARES_OF_DELTAS}. The smallest and largest finite values are always * {@link #MANY_VALUES_MIN} and {@link #MANY_VALUES_MAX}, although setting non-finite values will * change the true min and max. */ static class ManyValues {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Nov 09 22:49:56 UTC 2023 - 22.4K bytes - Viewed (0) -
src/slices/zsortordered.go
first := a lo := 0 hi := b - a // Build heap with greatest element at top. for i := (hi - 1) / 2; i >= 0; i-- { siftDownOrdered(data, i, hi, first) } // Pop elements, largest first, into end of data. for i := hi - 1; i >= 0; i-- { data[first], data[first+i] = data[first+i], data[first] siftDownOrdered(data, lo, i, first) } } // pdqsortOrdered sorts data[a:b].
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.4K bytes - Viewed (0) -
src/syscall/mkall.sh
# # * types_${GOOS}.c # # This hand-written C file includes standard C headers and then # creates typedef or enum names beginning with a dollar sign # (use of $ in variable names is a gcc extension). The hardest # part about preparing this file is figuring out which headers to # include and which symbols need to be #defined to get the # actual data structures that pass through to the kernel system calls.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 18:22:23 UTC 2023 - 14.6K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/driver/html/stacks.js
display(xscale, pos, neg, displayList); } // renderStacks creates boxes with top-left at x,y with children drawn as // nested stacks (below or above based on the sign of direction). // Returns the largest y coordinate filled. function renderStacks(depth, xscale, x, y, places, direction) { // Example: suppose we are drawing the following stacks: // a->b->c // a->b->d // a->e->f
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 18.5K bytes - Viewed (0)