- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 38 for smallint (0.17 sec)
-
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) -
guava/src/com/google/common/base/SmallCharMatcher.java
import com.google.common.annotations.VisibleForTesting; import com.google.common.base.CharMatcher.NamedFastMatcher; import java.util.BitSet; /** * An immutable version of CharMatcher for smallish sets of characters that uses a hash table with * linear probing to check for matches. * * @author Christopher Swenson */ @GwtIncompatible // no precomputation is done in GWT @ElementTypesAreNonnullByDefault
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/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/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) -
android/guava/src/com/google/common/math/IntMath.java
// NOTE: Whenever both tests are cheap and functional, it's faster to use &, | instead of &&, || @VisibleForTesting static final int MAX_SIGNED_POWER_OF_TWO = 1 << (Integer.SIZE - 2); /** * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to * {@code checkedPow(2, log2(x, CEILING))}. * * @throws IllegalArgumentException if {@code x <= 0}
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) -
android/guava/src/com/google/common/collect/Sets.java
HashSet<E> set = newHashSet(); Iterators.addAll(set, elements); return set; } /** * Returns a new hash set using the smallest initial table size that can hold {@code expectedSize} * elements without resizing. Note that this is not what {@link HashSet#HashSet(int)} does, but it * is what most users want and expect it to do. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K 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/primitives/ImmutableIntArray.java
* {@link #length} */ public int get(int index) { Preconditions.checkElementIndex(index, length()); return array[start + index]; } /** * Returns the smallest index for which {@link #get} returns {@code target}, or {@code -1} if no * such index exists. Equivalent to {@code asList().indexOf(target)}. */ public int indexOf(int target) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimap.java
* <li>The total entry count is available as {@link #size}. * <li>Many complex operations become easier; for example, {@code * Collections.min(multimap.values())} finds the smallest value across all keys. * </ul> * * <h3>Implementations</h3> * * <ul> * <li>{@link ImmutableListMultimap} * <li>{@link ImmutableSetMultimap}
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 15.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java
* {@link #length} */ public double get(int index) { Preconditions.checkElementIndex(index, length()); return array[start + index]; } /** * Returns the smallest index for which {@link #get} returns {@code target}, or {@code -1} if no * such index exists. Values are compared as if by {@link Double#equals}. Equivalent to {@code * asList().indexOf(target)}. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 19.6K bytes - Viewed (0)