- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 32 for selected (3.02 sec)
-
guava-tests/test/com/google/common/util/concurrent/AggregateFutureStateFallbackAtomicHelperTest.java
* * <p>On different platforms AggregateFutureState uses different strategies for its core * synchronization primitives. The strategies are all implemented as subtypes of AtomicHelper and * the strategy is selected in the static initializer of AggregateFutureState. This is convenient * and performant but introduces some testing difficulties. This test exercises the two fallback * strategies. * * <ul>
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
root = Optional.of(new BinaryNode(rng.nextInt(), Optional.<BinaryNode>absent(), root)); } return root; } }, RANDOM { /** * Generates a tree with topology selected uniformly at random from the topologies of binary * trees of the specified size. */ @Override Optional<BinaryNode> createTree(int size, Random rng) { int[] keys = new int[size];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
if (array[min] > array[i]) { min = i; } } return array[min]; } static double select(int k, double[] array) { // This is basically a copy of com.google.math.Rank#select, with a small change in the method // signature: we make k 0-based rather than 1-based; and we drop from and to, and always work on // the whole array. int from = 0;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
if (array[min] > array[i]) { min = i; } } return array[min]; } static double select(int k, double[] array) { // This is basically a copy of com.google.math.Rank#select, with a small change in the method // signature: we make k 0-based rather than 1-based; and we drop from and to, and always work on // the whole array. int from = 0;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractFutureFallbackAtomicHelperTest.java
* * <p>On different platforms AbstractFuture uses different strategies for its core synchronization * primitives. The strategies are all implemented as subtypes of AtomicHelper and the strategy is * selected in the static initializer of AbstractFuture. This is convenient and performant but * introduces some testing difficulties. This test exercises the two fallback strategies in abstract * future. * * <ul>
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 16 03:24:50 GMT 2021 - 6.2K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
root = Optional.of(new BinaryNode(rng.nextInt(), Optional.<BinaryNode>absent(), root)); } return root; } }, RANDOM { /** * Generates a tree with topology selected uniformly at random from the topologies of binary * trees of the specified size. */ @Override Optional<BinaryNode> createTree(int size, Random rng) { int[] keys = new int[size];
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AggregateFutureStateFallbackAtomicHelperTest.java
* * <p>On different platforms AggregateFutureState uses different strategies for its core * synchronization primitives. The strategies are all implemented as subtypes of AtomicHelper and * the strategy is selected in the static initializer of AggregateFutureState. This is convenient * and performant but introduces some testing difficulties. This test exercises the two fallback * strategies. * * <ul>
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/JdkBackedImmutableMap.java
@ElementTypesAreNonnullByDefault final class JdkBackedImmutableMap<K, V> extends ImmutableMap<K, V> { /** * Creates an {@code ImmutableMap} backed by a JDK HashMap. Used when probable hash flooding is * detected. This implementation may replace the entries in entryArray with its own entry objects * (though they will have the same key/value contents), and will take ownership of entryArray. */ static <K, V> ImmutableMap<K, V> create(
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 4.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureFallbackAtomicHelperTest.java
* * <p>On different platforms AbstractFuture uses different strategies for its core synchronization * primitives. The strategies are all implemented as subtypes of AtomicHelper and the strategy is * selected in the static initializer of AbstractFuture. This is convenient and performant but * introduces some testing difficulties. This test exercises the two fallback strategies in abstract * future. * * <ul>
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 16 03:24:50 GMT 2021 - 6.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedMultiset.java
* in the other. */ SortedMultiset<E> descendingMultiset(); /** * Returns a view of this multiset restricted to the elements less than {@code upperBound}, * optionally including {@code upperBound} itself. The returned multiset is a view of this * multiset, so changes to one will be reflected in the other. The returned multiset supports all
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.5K bytes - Viewed (0)