- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 56 for Hafner (0.2 sec)
-
android/guava/src/com/google/common/base/Suppliers.java
+ ")"; } } /** * Returns a supplier that caches the instance supplied by the delegate and removes the cached * value after the specified time has passed. Subsequent calls to {@code get()} return the cached * value if the expiration time has not passed. After the expiration time, a new value is * retrieved, cached, and returned. See: <a * href="http://en.wikipedia.org/wiki/Memoization">memoization</a> *
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-testlib/src/com/google/common/collect/testing/SpliteratorTester.java
if (trySplit != null) { assertEquals( "sum of estimated sizes of trySplit and original spliterator after trySplit", originalSize, trySplit.estimateSize() + spliterator.estimateSize()); } else { assertEquals( "estimated size of spliterator after failed trySplit", originalSize, spliterator.estimateSize()); } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 18:19:31 GMT 2024 - 11.9K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/artifact/resolver/DefaultArtifactResolver.java
if (artifacts == null || artifacts.isEmpty()) { if (request.isResolveRoot()) { result.addArtifact(rootArtifact); } return result; } // After the collection we will have the artifact object in the result but they will not be resolved yet. result = artifactCollector.collect(
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 24.8K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/DefaultMaven.java
// // 9) Execute AbstractLifecycleParticipant.afterProjectsRead(session) // // 10) Create ProjectDependencyGraph without trimming (as trimming was done in 7). A new topological sort is // required after the execution of 9) as the AbstractLifecycleParticipants are free to mutate the MavenProject // instances, which may change dependencies which can, in turn, affect the build order. //
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 27.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
Comparator<T> comparator) { return new LexicographicalOrdering<S>(checkNotNull(comparator)); } /** * Returns {@code true} if each element in {@code iterable} after the first is greater than or * equal to the element that preceded it, according to the specified comparator. Note that this is * always true when the iterable has fewer than two elements. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 11 08:42:51 GMT 2024 - 10K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSortedSet.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
} @Override public Entry<E> next() { if (!hasNext()) { throw new NoSuchElementException(); } // requireNonNull is safe because current is only nulled out after iteration is complete. Entry<E> result = wrapEntry(requireNonNull(current)); prevEntry = result; if (current.succ() == header) { current = null; } else {
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) -
android/guava/src/com/google/common/hash/Hashing.java
*/ public static HashFunction fingerprint2011() { return Fingerprint2011.FINGERPRINT_2011; } /** * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform manner * that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n}
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) -
guava/src/com/google/common/collect/ImmutableRangeMap.java
return this; } int lowerIndex = SortedLists.binarySearch( ranges, Range::upperBound, range.lowerBound, KeyPresentBehavior.FIRST_AFTER, KeyAbsentBehavior.NEXT_HIGHER); int upperIndex = SortedLists.binarySearch( ranges, Range::lowerBound, range.upperBound,
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
} /** * Returns an iterable whose iterators cycle indefinitely over the elements of {@code iterable}. * * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code * remove()} is called, subsequent cycles omit the removed element, which is no longer in {@code * iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable} * is empty. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0)