- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 3,196 for Fill (0.3 sec)
-
android/guava-tests/benchmark/com/google/common/base/JoinerBenchmark.java
int componentLength; private Iterable<String> components; @BeforeExperiment void setUp() { String component = Strings.repeat("a", componentLength); String[] raw = new String[count]; Arrays.fill(raw, component); components = Arrays.asList(raw); } /** {@link Joiner} with a string delimiter. */ @Benchmark int joinerWithStringDelimiter(int reps) { int dummy = 0;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/EnumMultiset.java
distinctElements++; } else if (oldCount > 0 && count == 0) { distinctElements--; } return oldCount; } @Override public void clear() { Arrays.fill(counts, 0); size = 0; distinctElements = 0; } abstract class Itr<T> implements Iterator<T> { int index = 0; int toRemove = -1; abstract T output(int index);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 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) -
guava/src/com/google/common/collect/CompactHashMap.java
delegate.clear(); // invalidate any iterators left over! table = null; size = 0; } else { Arrays.fill(requireKeys(), 0, size, null); Arrays.fill(requireValues(), 0, size, null); CompactHashing.tableClear(requireTable()); Arrays.fill(requireEntries(), 0, size, 0); this.size = 0; } } @J2ktIncompatible
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/CacheExpirationTest.java
WatchedCreatorLoader loader, FakeTicker ticker, String keyPrefix, long ttl) { int shift1 = 10 + VALUE_PREFIX; loader.setValuePrefix(shift1); // fill with initial data for (int i = 0; i < 10; i++) { assertEquals(Integer.valueOf(i + shift1), cache.getUnchecked(keyPrefix + i)); } assertEquals(10, CacheTesting.expirationQueueSize(cache));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 05 17:21:46 GMT 2022 - 18.7K bytes - Viewed (0) -
.github/DISCUSSION_TEMPLATE/questions.yml
Others - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Thu Aug 03 15:59:41 GMT 2023 - 5.8K bytes - Viewed (1) -
src/main/webapp/css/admin/adminlte.min.css
1em + .75rem) * 3 / 4 + 1.75rem);background:url("data:image/svg+xml;charset=utf8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 4 5'%3E%3Cpath fill='%23343a40' d='M2 0L0 2h4zm0 5L0 3h4z'/%3E%3C/svg%3E") no-repeat right .75rem center/8px 10px,url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3e%3cpath fill='%2328a745' d='M2.3 6.73L.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/%3e%3c/svg%3e") #fff no-repeat center...
CSS - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Fri Feb 07 10:28:50 GMT 2020 - 641.1K bytes - Viewed (2) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
} @Override public void clear() { if (needsAllocArrays()) { return; } this.firstEntry = ENDPOINT; this.lastEntry = ENDPOINT; if (links != null) { Arrays.fill(links, 0, size(), 0); } super.clear(); } /* * For discussion of the safety of the following methods, see the comments near the end of * CompactHashMap. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http2/Huffman.kt
children[childIndex] = child } node = child } val shift = 8 - accumulatorBitCount val start = (code shl shift) and 0xff val end = 1 shl shift node.children!!.fill(terminal, start, start + end) } private class Node { /** Null if terminal. */ val children: Array<Node?>? /** Terminal nodes have a symbol. */ val symbol: Int
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 8.3K bytes - Viewed (0)