- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for adapter (0.18 sec)
-
guava-tests/test/com/google/common/collect/TreeTraverserTest.java
} public void testPreOrder() { assertThat(iterationOrder(ADAPTER.preOrderTraversal(h))).isEqualTo("hdabcegf"); } public void testPostOrder() { assertThat(iterationOrder(ADAPTER.postOrderTraversal(h))).isEqualTo("abcdefgh"); } public void testBreadthOrder() { assertThat(iterationOrder(ADAPTER.breadthFirstTraversal(h))).isEqualTo("hdegabcf"); } public void testUsing() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 3.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeTraverserTest.java
} public void testPreOrder() { assertThat(iterationOrder(ADAPTER.preOrderTraversal(h))).isEqualTo("hdabcegf"); } public void testPostOrder() { assertThat(iterationOrder(ADAPTER.postOrderTraversal(h))).isEqualTo("abcdefgh"); } public void testBreadthOrder() { assertThat(iterationOrder(ADAPTER.breadthFirstTraversal(h))).isEqualTo("hdegabcf"); } public void testUsing() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/JdkFutureAdapters.java
} return new ListenableFutureAdapter<>(future, executor); } /** * An adapter to turn a {@link Future} into a {@link ListenableFuture}. This will wait on the * future to finish, and when it completes, run the listeners. This implementation will wait on * the source future indefinitely, so if the source future never completes, the adapter will never * complete either. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 7.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * 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. *
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-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java
* http://creativecommons.org/publicdomain/zero/1.0/ */ /* * Source: * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/test/tck-jsr166e/AtomicDoubleArrayTest.java?revision=1.13 * (Modified to adapt to guava coding conventions) */ package com.google.common.util.concurrent; import static org.junit.Assert.assertThrows; import java.util.Arrays; /** Unit test for {@link AtomicDoubleArray}. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 10K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* @since 30.0 */ @SuppressWarnings("deprecation") @GwtIncompatible public static double roundToDouble(long x, RoundingMode mode) { // Logic adapted from ToDoubleRounder. double roundArbitrarily = (double) x; long roundArbitrarilyAsLong = (long) roundArbitrarily; int cmpXToRoundArbitrarily; if (roundArbitrarilyAsLong == Long.MAX_VALUE) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java
* http://creativecommons.org/publicdomain/zero/1.0/ */ /* * Source: * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/test/tck-jsr166e/AtomicDoubleArrayTest.java?revision=1.13 * (Modified to adapt to guava coding conventions) */ package com.google.common.util.concurrent; import static java.lang.Math.max; import static org.junit.Assert.assertThrows; import com.google.common.annotations.GwtIncompatible;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 14.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
try { latch.await(); } catch (InterruptedException quittingTime) { } return TEST_STRING; } }; } public Runnable awaiter(final CountDownLatch latch) { return new CheckedRunnable() { @Override public void realRun() throws InterruptedException { await(latch); } }; }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 37.7K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/CacheBuilder.java
* code changes, you can use <a * href="https://www.javadoc.io/doc/com.github.ben-manes.caffeine/guava/latest/com.github.benmanes.caffeine.guava/com/github/benmanes/caffeine/guava/CaffeinatedGuava.html">its * {@code CaffeinatedGuava} adapter class</a>, which lets you build a Guava {@code Cache} or a Guava * {@code LoadingCache} backed by a Guava {@code CacheLoader}. * * <p>Caffeine's API for asynchronous operations uses {@code CompletableFuture}: <a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 44.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * 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. *
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)