- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 39 for fess (0.14 sec)
-
android/guava-testlib/src/com/google/common/collect/testing/google/MapGenerators.java
} @Override public Map<String, Collection<Integer>> create(Object... elements) { ImmutableMap.Builder<String, Integer> builder = ImmutableMap.builder(); // assumes that each set is a singleton or less (as is done for the samples) for (Object elem : elements) { @SuppressWarnings("unchecked") // safe by generator contract Entry<String, Collection<Integer>> entry = (Entry<String, Collection<Integer>>) elem;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 8.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Platform.java
* The new array contains nulls, even if the old array did not. If we wanted to be accurate, we * would declare a return type of `@Nullable T[]`. However, we've decided not to think too hard * about arrays for now, as they're a mess. (We previously discussed this in the review of * ObjectArrays, which is the main caller of this method.) */ static <T extends @Nullable Object> T[] newArray(T[] reference, int length) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 4.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashing.java
* 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. return Math.max(MIN_HASH_TABLE_SIZE, Hashing.closedTableSize(expectedSize + 1, 1.0f)); } /** Creates and returns a properly-sized array with the given number of buckets. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashing.java
* 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. return Math.max(MIN_HASH_TABLE_SIZE, Hashing.closedTableSize(expectedSize + 1, 1.0f)); } /** Creates and returns a properly-sized array with the given number of buckets. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/ServiceTest.java
assertLessThan(STOPPING, TERMINATED); } private static <T extends Comparable<? super T>> void assertLessThan(T a, T b) { if (a.compareTo(b) >= 0) { fail(String.format(Locale.ROOT, "Expected %s to be less than %s", a, b)); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 1.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like * {@code java.util.LinkedHashSet}, it offers insertion-order iteration, with identical behavior. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/NaturalOrdering.java
return (Ordering<@Nullable S>) result; } @Override public <S extends Comparable<?>> Ordering<S> reverse() { return (Ordering<S>) ReverseNaturalOrdering.INSTANCE; } // preserving singleton-ness gives equals()/hashCode() for free private Object readResolve() { return INSTANCE; } @Override public String toString() { return "Ordering.natural()"; } private NaturalOrdering() {}
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 2.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithmTest.java
import java.util.Map; import java.util.Random; import java.util.Set; import junit.framework.TestCase; /** * Tests that the different algorithms benchmarked in {@link QuantilesBenchmark} are actually all * returning more-or-less the same answers. */ public class QuantilesAlgorithmTest extends TestCase { private static final Random RNG = new Random(82674067L); private static final int DATASET_SIZE = 1000;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/StripedBenchmark.java
stripes[i] = i; } List<Integer> asList = Ints.asList(stripes); Collections.shuffle(asList, new Random(0xdeadbeef)); // do bulk gets with exactly 10 keys (possibly <10 stripes) (or less if numStripes is smaller) bulkGetSet = ImmutableList.copyOf(limit(cycle(asList), 10)); } @Footprint Object sizeOfStriped() { return impl.get(numStripes); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/StripedBenchmark.java
stripes[i] = i; } List<Integer> asList = Ints.asList(stripes); Collections.shuffle(asList, new Random(0xdeadbeef)); // do bulk gets with exactly 10 keys (possibly <10 stripes) (or less if numStripes is smaller) bulkGetSet = ImmutableList.copyOf(limit(cycle(asList), 10)); } @Footprint Object sizeOfStriped() { return impl.get(numStripes); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4K bytes - Viewed (0)