- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 291 for much (0.14 sec)
-
android/guava-tests/test/com/google/common/primitives/ImmutableLongArrayTest.java
fail(); } catch (IndexOutOfBoundsException expected) { } } /* * Whenever an implementation uses `instanceof` on a parameter instance, the test has to know that * (so much for "black box") and try instances that both do and don't pass the check. The "don't" * half of that is more awkward to arrange... */ private static <T> Iterable<T> iterable(final Collection<T> collection) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 19K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
* * <p><i>Performance notes:</i> while the cartesian product of lists of size {@code m, n, p} is a * list of size {@code m x n x p}, its actual memory consumption is much smaller. When the * cartesian product is constructed, the input lists are merely copied. Only as the resulting list * is iterated are the individual lists created, and these are not retained after iteration. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 16:48:36 GMT 2024 - 41.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
return -1; } /** * Returns the start position of the first occurrence of the specified {@code target} within * {@code array}, or {@code -1} if there is no such occurrence. * * <p>More formally, returns the lowest index {@code i} such that {@code Arrays.copyOfRange(array, * i, i + target.length)} contains exactly the same elements as {@code target}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java
fail(); } catch (IndexOutOfBoundsException expected) { } } /* * Whenever an implementation uses `instanceof` on a parameter instance, the test has to know that * (so much for "black box") and try instances that both do and don't pass the check. The "don't" * half of that is more awkward to arrange... */ private static <T> Iterable<T> iterable(final Collection<T> collection) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* while (value != null) { * wait(); * } * value = newValue; * notifyAll(); * } * } * }</pre> * * <h3>{@code ReentrantLock}</h3> * * <p>This version is much more verbose than the {@code synchronized} version, and still suffers * from the need for the programmer to remember to use {@code while} instead of {@code if}. However,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
guava/src/com/google/common/base/Converter.java
* we've chosen to instead use a signature that benefits existing users -- and is still safe. * * For convertAll, I haven't looked as closely at *how* much existing users benefit, so we should * keep an eye out for problems that new users encounter. Note also that convertAll could support * both use cases by using @PolyNull. (By contrast, we can't use @PolyNull for our superinterface
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 23K bytes - Viewed (1) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
/** * This strategy uses all 128 bits of {@link Hashing#murmur3_128} when hashing. It looks different * from the implementation in MURMUR128_MITZ_32 because we're avoiding the multiplication in the * loop and doing a (much simpler) += hash2. We're also changing the index to a positive number by * AND'ing with Long.MAX_VALUE instead of flipping the bits. */ MURMUR128_MITZ_64() { @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 10.7K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
* them, even though they usually won't be needed. If you have such arguments, use the conventional * if/throw idiom instead. * * <p>Depending on your message arguments, memory may be allocated for boxing and varargs array * creation. However, the methods of this class have a large number of overloads that prevent such * allocations in many common cases. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* equivalent (except in the case of overflow) to the call {@code * addAll(Collections.nCopies(element, occurrences))}, which would presumably perform much more * poorly. * * @param element the element to add occurrences of; may be null only if explicitly allowed by the * implementation
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 19.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* to reduce cache contention on most processors. Padding is * overkill for most Atomics because they are usually irregularly * scattered in memory and thus don't interfere much with each * other. But Atomic objects residing in arrays will tend to be * placed adjacent to each other, and so will most often share * cache lines (with a huge negative performance impact) without * this precaution.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0)