- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 3,552 for Largest (0.2 sec)
-
src/sort/zsortfunc.go
first := a lo := 0 hi := b - a // Build heap with greatest element at top. for i := (hi - 1) / 2; i >= 0; i-- { siftDown_func(data, i, hi, first) } // Pop elements, largest first, into end of data. for i := hi - 1; i >= 0; i-- { data.Swap(first, first+i) siftDown_func(data, lo, i, first) } } // pdqsort_func sorts data[a:b].
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
public boolean contains(@CheckForNull Object target) { return indexOf(target) >= 0; } @Override public int indexOf(@CheckForNull Object target) { return target instanceof Long ? parent.indexOf((Long) target) : -1; } @Override public int lastIndexOf(@CheckForNull Object target) { return target instanceof Long ? parent.lastIndexOf((Long) target) : -1; } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 16:34:24 UTC 2023 - 18.9K bytes - Viewed (0) -
src/unsafe/unsafe.go
func Offsetof(x ArbitraryType) uintptr // Alignof takes an expression x of any type and returns the required alignment // of a hypothetical variable v as if v was declared via var v = x. // It is the largest value m such that the address of v is always zero mod m. // It is the same as the value returned by [reflect.TypeOf](x).Align(). // As a special case, if a variable s is of struct type and f is a field
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 19:45:20 UTC 2024 - 12.1K bytes - Viewed (0) -
src/index/suffixarray/suffixarray_test.go
// Generates many inputs, builds and checks suffix arrays. func test(t *testing.T, build func([]byte) []int) { t.Run("ababab...", func(t *testing.T) { // Very repetitive input has numLMS = len(x)/2-1 // at top level, the largest it can be. // But maxID is only two (aba and ab$). size := 100000 if testing.Short() { size = 10000 } x := make([]byte, size) for i := range x { x[i] = "ab"[i%2] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 14.1K bytes - Viewed (0) -
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) -
src/slices/zsortanyfunc.go
first := a lo := 0 hi := b - a // Build heap with greatest element at top. for i := (hi - 1) / 2; i >= 0; i-- { siftDownCmpFunc(data, i, hi, first, cmp) } // 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] siftDownCmpFunc(data, lo, i, first, cmp) } } // pdqsortCmpFunc sorts data[a:b].
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.8K 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) -
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) -
guava/src/com/google/common/primitives/ImmutableIntArray.java
@Override public boolean contains(@CheckForNull Object target) { return indexOf(target) >= 0; } @Override public int indexOf(@CheckForNull Object target) { return target instanceof Integer ? parent.indexOf((Integer) target) : -1; } @Override public int lastIndexOf(@CheckForNull Object target) { return target instanceof Integer ? parent.lastIndexOf((Integer) target) : -1;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 16:34:24 UTC 2023 - 20.9K 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)