- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 148 for hver (0.13 sec)
-
android/guava/src/com/google/common/collect/ImmutableBiMap.java
* convenient. * * <p>By default, a {@code Builder} will generate bimaps that iterate over entries in the order * they were inserted into the builder. For example, in the above example, {@code * WORD_TO_INT.entrySet()} is guaranteed to iterate over the entries in the order {@code "one"=1, * "two"=2, "three"=3}, and {@code keySet()} and {@code values()} respect the same order. If you
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
return null; } // Successfully crossed over from min to max. // Bubble up max levels. E parent; // If toTrickle is moved up to a parent of removeIndex, the parent is // placed in removeIndex position. We must return that to the iterator so // that it knows to skip it. if (crossOver < removeIndex) { // We crossed over to the parent level in crossOver, so the parent
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/UnmodifiableCollectionTests.java
} catch (UnsupportedOperationException expected) { } } /** * Verifies that an Iterator is unmodifiable. * * <p>This test only works with iterators that iterate over a finite set. */ public static void assertIteratorIsUnmodifiable(Iterator<?> iterator) { while (iterator.hasNext()) { iterator.next(); try { iterator.remove();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeMap.java
* Returns a view of this range map as an unmodifiable {@code Map<Range<K>, V>}. Modifications to * this range map are guaranteed to read through to the returned {@code Map}. * * <p>The returned {@code Map} iterates over entries in ascending order of the bounds of the * {@code Range} entries. * * <p>It is guaranteed that no empty ranges will be in the returned {@code Map}. */ Map<Range<K>, V> asMapOfRanges();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* Generally speaking, this class reduces object allocation and memory consumption at the price of * moderately increased constant factors of CPU. Only use this class when there is a specific reason * to prioritize memory over CPU. * * @author Dimitris Andreou * @author Jon Noack */ @GwtIncompatible // not worth using in GWT for now @ElementTypesAreNonnullByDefault
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/base/CharMatcher.java
/** * Returns {@code true} if a character sequence contains at least one matching BMP character. * Equivalent to {@code !matchesNoneOf(sequence)}. * * <p>The default implementation iterates over the sequence, invoking {@link #matches} for each * character, until this returns {@code true} or the end is reached. * * @param sequence the character sequence to examine, possibly empty
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.7K bytes - Viewed (0) -
android/guava/src/com/google/common/io/FileBackedOutputStream.java
out.close(); } @Override public synchronized void flush() throws IOException { out.flush(); } /** * Checks if writing {@code len} bytes would go over threshold, and switches to file buffering if * so. */ @GuardedBy("this") private void update(int len) throws IOException { if (memory != null && (memory.getCount() + len > fileThreshold)) {
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) -
guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java
} /* * TODO: if we're testing a list, we could check indexOf(). (Doing it in * AbstractListTester isn't enough because many tests that run on lists don't * extends AbstractListTester.) We could also iterate over all elements to * verify absence */ protected void expectMissing(E... elements) { for (E element : elements) { assertFalse("Should not contain " + element, actualContents().contains(element)); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 8.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ContiguousSet.java
* A sorted set of contiguous values in a given {@link DiscreteDomain}. Example: * * <pre>{@code * ContiguousSet.create(Range.closed(5, 42), DiscreteDomain.integers()) * }</pre> * * <p>Note that because bounded ranges over {@code int} and {@code long} values are so common, this * particular example can be written as just: * * <pre>{@code * ContiguousSet.closed(5, 42) * }</pre> *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 9.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
* specified is included. To create a copy of a {@code SortedSet} that preserves the comparator, * call {@link #copyOfSorted} instead. This method iterates over {@code elements} at most once. * * <p>Note that if {@code s} is a {@code Set<String>}, then {@code ImmutableSortedSet.copyOf(s)} * returns an {@code ImmutableSortedSet<String>} containing each of the strings in {@code s},
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 38.5K bytes - Viewed (0)