- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 665 for greatest (0.13 sec)
-
guava-tests/test/com/google/common/primitives/SignedBytesTest.java
new byte[] {LEAST, (byte) 1}, new byte[] {(byte) 1}, new byte[] {(byte) 1, LEAST}, new byte[] {GREATEST, GREATEST - (byte) 1}, new byte[] {GREATEST, GREATEST}, new byte[] {GREATEST, GREATEST, GREATEST}); Comparator<byte[]> comparator = SignedBytes.lexicographicalComparator(); Helpers.testComparator(comparator, ordered); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/SignedBytesTest.java
new byte[] {LEAST, (byte) 1}, new byte[] {(byte) 1}, new byte[] {(byte) 1, LEAST}, new byte[] {GREATEST, GREATEST - (byte) 1}, new byte[] {GREATEST, GREATEST}, new byte[] {GREATEST, GREATEST, GREATEST}); Comparator<byte[]> comparator = SignedBytes.lexicographicalComparator(); Helpers.testComparator(comparator, ordered); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
} }); // To start, fill up the cache. // Each miss both increments the counter and causes the map to grow by one, // so until evictions begin, the size of the map is the greatest return // value seen so far while (cache.getUnchecked(nextRandomKey()) < maximumSize) {} requests.set(0); misses.set(0); } @Benchmark int time(int reps) { int dummy = 0;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
} }); // To start, fill up the cache. // Each miss both increments the counter and causes the map to grow by one, // so until evictions begin, the size of the map is the greatest return // value seen so far while (cache.getUnchecked(nextRandomKey()) < maximumSize) {} requests.set(0); misses.set(0); } @Benchmark int time(int reps) { int dummy = 0;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.4K bytes - Viewed (0) -
guava/src/com/google/common/math/ToDoubleRounder.java
* a {@link RoundingMode}. */ @GwtIncompatible abstract class ToDoubleRounder<X extends Number & Comparable<X>> { /** * Returns x rounded to either the greatest double less than or equal to the precise value of x, * or the least double greater than or equal to the precise value of x. */ abstract double roundToDoubleArbitrarily(X x); /** Returns the sign of x: either -1, 0, or 1. */ abstract int sign(X x);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 5.8K bytes - Viewed (0) -
docs/distributed/DESIGN.md
of erasure set size is automatic based on the number of drives available, let's say for example if there are 32 servers and 32 drives which is a total of 1024 drives. In this scenario 16 becomes the erasure set size. This is decided based on the greatest common divisor (GCD) of acceptable erasure set sizes ranging from *4 to 16*. - *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*. In the example...
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Feb 26 09:25:50 UTC 2025 - 8K bytes - Viewed (2) -
misc/cgo/gmp/gmp.go
// DivModInt sets q = x / y and r = x % y. func DivModInt(q, r, x, y *Int) { q.doinit() r.doinit() x.doinit() y.doinit() C.mpz_tdiv_qr(&q.i[0], &r.i[0], &x.i[0], &y.i[0]) } // GcdInt sets d to the greatest common divisor of a and b, // which must be positive numbers. // If x and y are not nil, GcdInt sets x and y such that d = a*x + b*y. // If either a or b is not positive, GcdInt sets d = x = y = 0.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 9.5K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/TestSortedMapGenerator.java
* key of {@link #belowSamplesLesser()}. */ Entry<K, V> belowSamplesGreater(); /** * Returns an entry with a key greater than the keys of the {@link #samples()} but less than the * key of {@link #aboveSamplesGreater()}. */ Entry<K, V> aboveSamplesLesser(); /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 1.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/TestSortedSetGenerator.java
/** * Returns an element less than the {@link #samples()} but greater than {@link * #belowSamplesLesser()}. */ E belowSamplesGreater(); /** * Returns an element greater than the {@link #samples()} but less than {@link * #aboveSamplesGreater()}. */ E aboveSamplesLesser(); /** * Returns an element greater than the {@link #samples()} and greater than {@link * #aboveSamplesLesser()}. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 1.7K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/TestSortedSetGenerator.java
/** * Returns an element less than the {@link #samples()} but greater than {@link * #belowSamplesLesser()}. */ E belowSamplesGreater(); /** * Returns an element greater than the {@link #samples()} but less than {@link * #aboveSamplesGreater()}. */ E aboveSamplesLesser(); /** * Returns an element greater than the {@link #samples()} and greater than {@link * #aboveSamplesLesser()}. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 1.7K bytes - Viewed (0)