- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 78 for smallest (0.16 sec)
-
guava-tests/test/com/google/common/escape/UnicodeEscaperTest.java
private static final String SMALLEST_SURROGATE = "" + Character.MIN_HIGH_SURROGATE + Character.MIN_LOW_SURROGATE; private static final String LARGEST_SURROGATE = "" + Character.MAX_HIGH_SURROGATE + Character.MAX_LOW_SURROGATE; private static final String TEST_STRING = "\0abyz\u0080\u0100\u0800\u1000ABYZ\uffff" + SMALLEST_SURROGATE + "0189" + LARGEST_SURROGATE; // Escapes nothing
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 6.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
allEntries.addAll(normalValues); SortedSet<E> set = delegate.create(allEntries.toArray()); return createSubSet(set, firstExclusive, lastExclusive); } /** Calls the smallest subSet overload that filters out the extreme values. */ SortedSet<E> createSubSet(SortedSet<E> set, E firstExclusive, E lastExclusive) { if (from == Bound.NO_BOUND && to == Bound.EXCLUSIVE) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/escape/UnicodeEscaperTest.java
private static final String SMALLEST_SURROGATE = "" + Character.MIN_HIGH_SURROGATE + Character.MIN_LOW_SURROGATE; private static final String LARGEST_SURROGATE = "" + Character.MAX_HIGH_SURROGATE + Character.MAX_LOW_SURROGATE; private static final String TEST_STRING = "\0abyz\u0080\u0100\u0800\u1000ABYZ\uffff" + SMALLEST_SURROGATE + "0189" + LARGEST_SURROGATE; // Escapes nothing
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 6.2K bytes - Viewed (0) -
guava/src/com/google/common/base/SmallCharMatcher.java
/** * Returns an array size suitable for the backing array of a hash table that uses open addressing * with linear probing in its implementation. The returned size is the smallest power of two that * can hold setSize elements with the desired load factor. */ @VisibleForTesting static int chooseTableSize(int setSize) { if (setSize == 1) { return 2; }
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) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
/** * Returns an array size suitable for the backing array of a hash table that uses open addressing * with linear probing in its implementation. The returned size is the smallest power of two that * can hold setSize elements with the desired load factor. */ @VisibleForTesting static int chooseTableSize(int setSize) { if (setSize == 1) { return 2; }
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-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
allEntries.addAll(normalValues); SortedSet<E> set = delegate.create(allEntries.toArray()); return createSubSet(set, firstExclusive, lastExclusive); } /** Calls the smallest subSet overload that filters out the extreme values. */ SortedSet<E> createSubSet(SortedSet<E> set, E firstExclusive, E lastExclusive) { if (from == Bound.NO_BOUND && to == Bound.EXCLUSIVE) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
return (delegate != null) ? delegate.toArray(a) : ObjectArrays.toArrayImpl(requireElements(), 0, size, a); } /** * Ensures that this {@code CompactHashSet} has the smallest representation in memory, given its * current size. */ public void trimToSize() { if (needsAllocArrays()) { return; } Set<E> delegate = delegateOrNull();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/CacheBuilderTest.java
assertEquals(2, map.segments[2].table.length()); assertEquals(2, map.segments[3].table.length()); } @GwtIncompatible // CacheTesting public void testInitialCapacity_smallest() { LoadingCache<?, ?> cache = CacheBuilder.newBuilder().initialCapacity(0).build(identityLoader()); LocalCache<?, ?> map = CacheTesting.toLocalCache(cache); assertThat(map.segments).hasLength(4);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Oct 03 20:10:02 GMT 2023 - 25.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
return false; } prev = next; } } return true; } /** * Returns a {@code Collector} that returns the {@code k} smallest (relative to the specified * {@code Comparator}) input elements, in ascending order, as an unmodifiable {@code List}. Ties * are broken arbitrarily. * * <p>For example: * * <pre>{@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
* href="http://mathworld.wolfram.com/PrimeNumber.html">prime number</a>: an integer <i>greater * than one</i> that cannot be factored into a product of <i>smaller</i> positive integers. * Returns {@code false} if {@code n} is zero, one, or a composite number (one which <i>can</i> be * factored into smaller positive integers). * * <p>To test larger numbers, use {@link LongMath#isPrime} or {@link BigInteger#isProbablePrime}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0)