- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 75 for bias (0.16 sec)
-
android/guava/src/com/google/common/math/DoubleUtils.java
} /* * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the * top SIGNIFICAND_BITS + 1. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 28 15:37:52 GMT 2021 - 5.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java
Random random = new Random(); int nKeys = keys.size(); long blah = 0; for (int i = 0; i < reps; i++) { Integer key = keys.get(random.nextInt(nKeys)); // This range is [-5, 4] - slight negative bias so we often hit zero, which brings the // auto-removal of zeroes into play. int delta = random.nextInt(10) - 5; blah += delta; if (delta >= 0) { multiset.add(key, delta);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed May 09 15:17:25 GMT 2018 - 16.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java
Random random = new Random(); int nKeys = keys.size(); long blah = 0; for (int i = 0; i < reps; i++) { Integer key = keys.get(random.nextInt(nKeys)); // This range is [-5, 4] - slight negative bias so we often hit zero, which brings the // auto-removal of zeroes into play. int delta = random.nextInt(10) - 5; blah += delta; if (delta >= 0) { multiset.add(key, delta);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 06 12:56:11 GMT 2023 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
public static HashFunction goodFastHash(int minimumBits) { int bits = checkPositiveAndMakeMultipleOf32(minimumBits); if (bits == 32) { return Murmur3_32HashFunction.GOOD_FAST_HASH_32; } if (bits <= 128) { return Murmur3_128HashFunction.GOOD_FAST_HASH_128; } // Otherwise, join together some 128-bit murmur3s int hashFunctionsNeeded = (bits + 127) / 128;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
} private static final int ENDPOINT = -2; /** * Contains the link pointers corresponding with the entries, in the range of [0, size()). The * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are * all "null" (UNSET). *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/MessageDigestHashFunction.java
try { Object unused = digest.clone(); return true; } catch (CloneNotSupportedException e) { return false; } } @Override public int bits() { return bytes * Byte.SIZE; } @Override public String toString() { return toString; } private static MessageDigest getMessageDigest(String algorithmName) { try {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed May 25 20:32:46 GMT 2022 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
return null; } int mask = tableSize - 1; Builder.DuplicateKey duplicateKey = null; if (tableSize <= BYTE_MAX_SIZE) { /* * Use 8 bits per entry. The value is unsigned to allow use up to a size of 2^8. * * The absent indicator of -1 signed becomes 2^8 - 1 unsigned, which reduces the actual max
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
// From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41. // We calculate the constant below by: // 1. Omitting the most significant bit (because it's always 1). => 0x1EDC6F41 // 2. Flipping the bits of the constant so we can process a byte at a time. => 0x82F63B78 private static final int CRC32C_GENERATOR = 0x1EDC6F41; // 0x11EDC6F41 private static final int CRC32C_GENERATOR_FLIPPED = Integer.reverse(CRC32C_GENERATOR);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Dec 23 18:30:33 GMT 2020 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Utf8.java
// Three-byte form. if (index + 1 >= end) { return false; } int byte2 = bytes[index++]; if (byte2 > (byte) 0xBF // Overlong? 5 most significant bits must not all be zero. || (byte1 == (byte) 0xE0 && byte2 < (byte) 0xA0) // Check for illegal surrogate codepoints. || (byte1 == (byte) 0xED && (byte) 0xA0 <= byte2)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 10 14:11:51 GMT 2023 - 7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
}); assertThat(expected) .hasMessageThat() .isEqualTo("Could not create BloomFilter of 3327428144502 bits"); } @AndroidIncompatible // OutOfMemoryError public void testLargeNumberOfInsertions() { // We use horrible FPPs here to keep Java from OOM'ing BloomFilter<String> unused =
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0)