- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 230 for save (0.24 sec)
-
android/guava/src/com/google/common/collect/RegularImmutableMap.java
private final transient int size; /* * We have some considerable complexity in these create methods because of * Builder.buildKeepingLast(). The same Builder might be called with buildKeepingLast() and then * buildOrThrow(), or vice versa. So in particular, if we modify alternatingKeysAndValues to * eliminate duplicate keys (for buildKeepingLast()) then we have to ensure that a later call to
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) -
guava-gwt/src-super/com/google/common/cache/super/com/google/common/cache/LocalCache.java
* compilation purposes. */ enum Strength { /* * TODO(kevinb): If we strongly reference the value and aren't loading, we needn't wrap the * value. This could save ~8 bytes per entry. */ STRONG { @Override Equivalence<Object> defaultEquivalence() { return Equivalence.equals(); } }, SOFT { @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 21.6K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableList.java
if (elements instanceof ImmutableCollection) { /* * TODO: When given an ImmutableList that's a sublist, copy the referenced * portion of the array into a new array to save space? */ @SuppressWarnings("unchecked") // all supported methods are covariant ImmutableCollection<E> list = (ImmutableCollection<E>) elements; return list.asList(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 11K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
// Inline the Comparator implementation rather than transforming with a Function // to save code size. Arrays.sort( entryArray, 0, size, (e1, e2) -> { // requireNonNull is safe because the first `size` elements have been filled in. requireNonNull(e1); requireNonNull(e2);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMap.java
// Inline the Comparator implementation rather than transforming with a Function // to save code size. Arrays.sort( entryArray, 0, size, (e1, e2) -> { // requireNonNull is safe because the first `size` elements have been filled in. requireNonNull(e1); requireNonNull(e2);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 50.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/MinimalIterable.java
* second invocation, so implementors have made various choices, including: * * <ul> * <li>returning the same iterator again * <li>throwing an exception of some kind * <li>or the usual, <i>robust</i> behavior, which all known {@link Collection} implementations * have, of returning a new, independent iterator * </ul> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 3.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
* 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}. * * <p>An empty iterable has only one permutation, which is an empty list. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
switch (balanceFactor()) { case -2: // requireNonNull is safe because right must exist in order to get a negative factor. requireNonNull(right); if (right.balanceFactor() > 0) { right = right.rotateRight(); } return rotateLeft(); case 2: // requireNonNull is safe because left must exist in order to get a positive factor.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
/* * requireNonNull is safe because the callers promise to put non-null objects in the first * `length` array elements. */ @SuppressWarnings("unchecked") // our callers put only E instances into the array E onlyElement = (E) requireNonNull(elements[0]); return of(onlyElement); default: /*
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 30K bytes - Viewed (1)