- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 63 for We (0.16 sec)
-
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* objects per entry. Instead we use an open-addressed hash table. This design is basically * equivalent to RegularImmutableSet, save that instead of having a hash table containing the * elements directly and null for empty positions, we store indices of the keys in the hash table, * and ABSENT for empty positions. We then look up the keys in alternatingKeysAndValues. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/Types.java
* cannot implement that interface in source code in a way that will compile on both Java 7 and * Java 8. If we include the {@code getAnnotatedBounds()} method then its return type means it * won't compile on Java 7, while if we don't include the method then the compiler will complain * that an abstract method is unimplemented. So instead we use a dynamic proxy to get an
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 23.1K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
&& knownOrder == KnownOrder.UNKNOWN_ORDER) { /* * We already know the iterator is an Iterator<E>, and now we know that * we called next(), so the returned element must be of type E. */ @SuppressWarnings("unchecked") E targetReturnValueFromNext = (E) targetReturnValue; /* * We have an Iterator<E> and want to cast it to
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Suppliers.java
this.durationNanos = durationNanos; } @Override @ParametricNullness public T get() { // Another variant of Double Checked Locking. // // We use two volatile reads. We could reduce this to one by // putting our fields into a holder class, but (at least on x86) // the extra memory consumption and indirection are more // expensive than the extra volatile reads.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 15.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
void calculateNextPermutation() { int j = findNextJ(); if (j == -1) { nextPermutation = null; return; } /* * requireNonNull is safe because we don't clear nextPermutation until we're done calling this * method. */ requireNonNull(nextPermutation); int l = findNextL(j); Collections.swap(nextPermutation, j, l);
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/ImmutableSortedSet.java
* TODO(cpovirk): use Object[] instead of E[] in the mainline? (The backport is different and * doesn't need this suppression, but we keep it to minimize diffs.) Generally be more clear * about when we have an Object[] vs. a Comparable[] or other array type in internalArray? If we * used Object[], we might be able to optimize toArray() to use clone() sometimes. (See * cl/592273615 and cl/592273683.) */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 36.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* process in any way, for example being sent over RPC, or saved to disk. For a general-purpose, * non-cryptographic hash function that will never change behavior, we suggest {@link * #murmur3_128}. * * <p>Repeated calls to this method on the same loaded {@code Hashing} class, using the same value
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSortedSet.java
} @Override public boolean containsAll(Collection<?> targets) { // TODO(jlevy): For optimal performance, use a binary search when // targets.size() < size() / log(size()) // TODO(kevinb): see if we can share code with OrderedIterator after it // graduates from labs. if (targets instanceof Multiset) { targets = ((Multiset<?>) targets).elementSet(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
* parameters. If it were statically checked, the checker would still be OK with it, since * we're copying into a `contents` array whose type allows it to contain nulls. Still, it's * worth noting that we promise not to put nulls into the array in the first `size` elements. * We uphold that promise here because our callers promise that `elements` will not contain * nulls in its first `n` elements.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 30K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/TreeMultiset.java
@CheckForNull private AvlNode<E> right; /* * pred and succ are nullable after construction, but we always call successor() to initialize * them immediately thereafter. * * They may be subsequently nulled out by TreeMultiset.clear(). I think that the only place that * we can reference a node whose fields have been cleared is inside the iterator (and presumably * only under concurrent modification).
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)