- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 143 for Tretter (0.27 sec)
-
android/guava/src/com/google/common/collect/CompactHashing.java
private static final int SHORT_MASK = (1 << Short.SIZE) - 1; // 2^16 - 1 = 65_535 /** * Returns the power of 2 hashtable size required to hold the expected number of items or the * minimum hashtable size, whichever is greater. */ static int tableSize(int expectedSize) { // We use entries next == 0 to indicate UNSET, so actual capacity is 1 less than requested.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Aug 02 21:41:22 UTC 2021 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Fingerprint2011.java
seedA += part2; seedA += part3; seedB += rotateRight(seedA, 23); output[0] = seedA + part4; output[1] = seedB + c; } /* * Compute an 8-byte hash of a byte array of length greater than 64 bytes. */ private static long fullFingerprint(byte[] bytes, int offset, int length) { // For lengths over 64 bytes we hash the end first, and then as we
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Dec 28 17:50:25 UTC 2021 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
* @return the Cartesian product, as an immutable list containing immutable lists * @throws IllegalArgumentException if the size of the cartesian product would be greater than * {@link Integer#MAX_VALUE} * @throws NullPointerException if {@code lists}, any one of the {@code lists}, or any element of * a provided list is null * @since 19.0 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 16:48:36 UTC 2024 - 41.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
if (isWindows()) { return; // TODO: b/136041958 - Running very slowly on Windows CI. } final CyclicBarrier barrier = new CyclicBarrier( 6 // for the setter threads + 50 // for the listeners + 50 // for the blocking get threads, + 1); // for the main thread
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 46.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Crc32cHashFunction.java
/* * The striding algorithm works roughly as follows: it is universally the case that * CRC(x ^ y) == CRC(x) ^ CRC(y). The approach we take is to break the message as follows, * with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableCollection.java
* method to obtain a correctly-sized copy. * <li>The performance of using the associated {@code Builder} class can be assumed to be no * worse, and possibly better, than creating a mutable collection and copying it. * <li>Implementations generally do not cache hash codes. If your element or key type has a slow * {@code hashCode} implementation, it should cache it itself. * </ul>
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.5K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java
naj,elsew,ranac,??,vr&esi,uc,?weiverpbuhtig,xdom,ylf,??ih?l!.&di?fnoc?gro?lim?moc?nsa?ten?ude?vog???m!.&eman?gro?lim?m&oc?uesum??o&fni?r&ea?p???pooc?t&en?ni??ude?vog?zib???o&g?m??rt?s!.&bog?der?gro?moc?ude???t!.&arukas,bew-eht-no,morf,naht-&esrow,retteb,?sndnyd,?d?i?won??uqhv--nx??w&a!.moc?hs?l??b!.&gro?oc???c!.&gro?moc?ten?ude??cp??e&iver!.oby,?n?s??g?k!.&bme?dni?gro?moc?ten?ude?vog???m!.&ca?gro?m&oc?uesum??oc?pooc?t&en?ni??ude?vog?zib??b??o&csom?h!s??n?w??p!.&344x,de?en?o&c?g??ro?snduolc,ualeb...
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Mar 21 21:04:43 UTC 2024 - 72.4K bytes - Viewed (0) -
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: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 1.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* failed CAS on base update), the table is initialized to size 2. * The table size is doubled upon further contention until * reaching the nearest power of two greater than or equal to the * number of CPUS. Table slots remain empty (null) until they are * needed. * * A single spinlock ("busy") is used for initializing and
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
Comparator<T> comparator) { return new LexicographicalOrdering<S>(checkNotNull(comparator)); } /** * Returns {@code true} if each element in {@code iterable} after the first is greater than or * equal to the element that preceded it, according to the specified comparator. Note that this is * always true when the iterable has fewer than two elements. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 10.1K bytes - Viewed (0)