- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,386 for Fill (0.19 sec)
-
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
LoadingCache<Integer, Integer> cache; int max; static AtomicLong requests = new AtomicLong(0); static AtomicLong misses = new AtomicLong(0); @BeforeExperiment void setUp() { // random integers will be generated in this range, then raised to the // power of (1/concentration) and floor()ed max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration)); cache = CacheBuilder.newBuilder()
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/src/com/google/common/collect/CompactHashing.java
return new int[buckets]; } } static void tableClear(Object table) { if (table instanceof byte[]) { Arrays.fill((byte[]) table, (byte) 0); } else if (table instanceof short[]) { Arrays.fill((short[]) table, (short) 0); } else { Arrays.fill((int[]) table, 0); } } /** * Returns {@code table[index]}, where {@code table} is actually a {@code byte[]}, {@code
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
return new int[buckets]; } } static void tableClear(Object table) { if (table instanceof byte[]) { Arrays.fill((byte[]) table, (byte) 0); } else if (table instanceof short[]) { Arrays.fill((short[]) table, (short) 0); } else { Arrays.fill((int[]) table, 0); } } /** * Returns {@code table[index]}, where {@code table} is actually a {@code byte[]}, {@code
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/src/com/google/common/collect/RegularImmutableMap.java
* values are null. This method may update {@code alternatingKeysAndValues} if there are duplicate * keys. If so, the return value will indicate how many entries are still valid, and will also * include a {@link Builder.DuplicateKey} in case duplicate keys are not allowed now or will not * be allowed on a later {@link Builder#buildOrThrow()} call. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/io/FileBackedOutputStream.java
* versions would create a file that is more accessible, as discussed in <a * href="https://github.com/google/guava/issues/2575">Guava issue 2575</a>. TODO: b/283778848 - Fill * in CVE number once it's available.) * * <p>Temporary files created by this stream may live in the local filesystem until either: * * <ul>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountLinkedHashMap.java
} @Override void init(int expectedSize, float loadFactor) { super.init(expectedSize, loadFactor); firstEntry = ENDPOINT; lastEntry = ENDPOINT; links = new long[expectedSize]; Arrays.fill(links, UNSET); } @Override int firstIndex() { return (firstEntry == ENDPOINT) ? -1 : firstEntry; } @Override int nextIndex(int index) { int result = getSuccessor(index);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 5.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java
} private static String newTestString(Random random, BitSet bitSet, int percentMatching) { final String allMatchingChars = allMatchingChars(bitSet); final char[] result = new char[STRING_LENGTH]; // Fill with matching chars. for (int i = 0; i < result.length; i++) { result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length())); } // Replace some of chars by non-matching.
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed May 16 22:49:59 GMT 2018 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. * * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one * permutation, instead of two. This is why the elements have to implement {@link Comparable}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
delegate.clear(); // invalidate any iterators left over! table = null; size = 0; } else { Arrays.fill(requireElements(), 0, size, null); CompactHashing.tableClear(requireTable()); Arrays.fill(requireEntries(), 0, size, 0); this.size = 0; } } @J2ktIncompatible private void writeObject(ObjectOutputStream stream) throws IOException {
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-tests/test/com/google/common/cache/CacheReferencesTest.java
private void assertCleanup( LoadingCache<Integer, String> cache, CountingRemovalListener<Integer, String> removalListener) { // initialSize will most likely be 2, but it's possible for the GC to have already run, so we'll // observe a size of 1 long initialSize = cache.size(); assertTrue(initialSize == 1 || initialSize == 2); // wait up to 5s
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 6.1K bytes - Viewed (0)