- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 348 for compute (0.17 sec)
-
android/guava/src/com/google/common/math/Quantiles.java
* * <h3>Examples</h3> * * <p>To compute the median: * * <pre>{@code * double myMedian = median().compute(myDataset); * }</pre> * * where {@link #median()} has been statically imported. * * <p>To compute the 99th percentile: * * <pre>{@code * double myPercentile99 = percentiles().index(99).compute(myDataset); * }</pre> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
guava/src/com/google/common/base/SmallCharMatcher.java
// Compute the filter. long filter = 0; int size = chars.cardinality(); boolean containsZero = chars.get(0); // Compute the hash table. char[] table = new char[chooseTableSize(size)]; int mask = table.length - 1; for (int c = chars.nextSetBit(0); c != -1; c = chars.nextSetBit(c + 1)) { // Compute the filter at the same time. filter |= 1L << c;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/LocalCacheMapComputeTest.java
// b/80241237 Cache<String, String> c = CacheBuilder.newBuilder().maximumSize(1).build(); assertThat(c.asMap().compute("hash-1", (k, v) -> "a")).isEqualTo("a"); assertThat(c.asMap().compute("hash-1", (k, v) -> "b")).isEqualTo("b"); assertThat(c.asMap().compute("hash-1", (k, v) -> "c")).isEqualTo("c"); assertThat(c.size()).isEqualTo(1); assertThat(c.asMap().computeIfAbsent("hash-2", k -> "")).isEqualTo("");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 6.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesTest.java
} public void testScale_index_compute_doubleCollection() { assertThat(Quantiles.scale(10).index(1).compute(SIXTEEN_SQUARES_DOUBLES)) .isWithin(ALLOWED_ERROR) .of(SIXTEEN_SQUARES_DECILE_1); } public void testScale_index_compute_longCollection() { assertThat(Quantiles.scale(10).index(1).compute(SIXTEEN_SQUARES_LONGS)) .isWithin(ALLOWED_ERROR)
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 29.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesTest.java
} public void testScale_index_compute_doubleCollection() { assertThat(Quantiles.scale(10).index(1).compute(SIXTEEN_SQUARES_DOUBLES)) .isWithin(ALLOWED_ERROR) .of(SIXTEEN_SQUARES_DECILE_1); } public void testScale_index_compute_longCollection() { assertThat(Quantiles.scale(10).index(1).compute(SIXTEEN_SQUARES_LONGS)) .isWithin(ALLOWED_ERROR)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hasher.java
import com.google.errorprone.annotations.CanIgnoreReturnValue; import java.nio.ByteBuffer; import java.nio.charset.Charset; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@link PrimitiveSink} that can compute a hash code after reading the input. Each hasher should * translate all multibyte values ({@link #putInt(int)}, {@link #putLong(long)}, etc) to bytes in * little-endian order. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 5.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/Fingerprint2011Test.java
assertEquals(0xcf54171253fdc198L, hasher.hash().asLong()); } /** Convenience method to compute a fingerprint on a full bytes array. */ private static long fingerprint(byte[] bytes) { return fingerprint(bytes, bytes.length); } /** Convenience method to compute a fingerprint on a subset of a byte array. */ private static long fingerprint(byte[] bytes, int length) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Dec 29 14:55:25 GMT 2021 - 7.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
// Compute the filter. long filter = 0; int size = chars.cardinality(); boolean containsZero = chars.get(0); // Compute the hash table. char[] table = new char[chooseTableSize(size)]; int mask = table.length - 1; for (int c = chars.nextSetBit(0); c != -1; c = chars.nextSetBit(c + 1)) { // Compute the filter at the same time. filter |= 1L << c;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/Fingerprint2011Test.java
assertEquals(0xcf54171253fdc198L, hasher.hash().asLong()); } /** Convenience method to compute a fingerprint on a full bytes array. */ private static long fingerprint(byte[] bytes) { return fingerprint(bytes, bytes.length); } /** Convenience method to compute a fingerprint on a subset of a byte array. */ private static long fingerprint(byte[] bytes, int length) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Dec 29 14:55:25 GMT 2021 - 7.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* computes) correspond to minimum intervals between subsequent requests, for the specified number * of requested permits. * * Here is an example of storedPermitsToWaitTime: If storedPermits == 10.0, and we want 3 permits, * we take them from storedPermits, reducing them to 7.0, and compute the throttling for these as
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0)