- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 235 for order (0.14 sec)
-
android/guava/src/com/google/common/collect/Queues.java
/** * Creates a {@code LinkedBlockingQueue} with a capacity of {@link Integer#MAX_VALUE}, containing * the elements of the specified iterable, in the order they are returned by the iterable's * iterator. * * @param elements the elements that the queue should contain, in order * @return a new {@code LinkedBlockingQueue} containing those elements */ @J2ktIncompatible @GwtIncompatible // LinkedBlockingQueue
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 16K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
* 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. * * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one
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/TopKSelector.java
/** * Returns a {@code TopKSelector} that collects the lowest {@code k} elements added to it, * relative to the natural ordering of the elements, and returns them via {@link #topK} in * ascending order. * * @throws IllegalArgumentException if {@code k < 0} or {@code k > Integer.MAX_VALUE / 2} */ public static <T extends Comparable<? super T>> TopKSelector<T> least(int k) { return least(k, Ordering.natural());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SetsTest.java
* @author Jared Levy */ @GwtCompatible(emulated = true) @ElementTypesAreNonnullByDefault public class SetsTest extends TestCase { private static final IteratorTester.KnownOrder KNOWN_ORDER = IteratorTester.KnownOrder.KNOWN_ORDER; private static final Collection<Integer> EMPTY_COLLECTION = Arrays.<Integer>asList(); private static final Collection<Integer> SOME_COLLECTION = Arrays.asList(0, 1, 1);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 47.9K bytes - Viewed (1) -
guava-tests/test/com/google/common/collect/TreeMultisetTest.java
} @Override public List<String> order(List<String> insertionOrder) { return Ordering.natural().sortedCopy(insertionOrder); } }) .withFeatures( CollectionSize.ANY, CollectionFeature.KNOWN_ORDER, CollectionFeature.GENERAL_PURPOSE, CollectionFeature.SERIALIZABLE,
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 12.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
Helpers.addAll(elements, previousElements); Helpers.addAll(elements, Helpers.reverse(nextElements)); return elements; } } public enum KnownOrder { KNOWN_ORDER, UNKNOWN_ORDER } @SuppressWarnings("unchecked") // TODO(cpovirk): Stop using arrays. AbstractIteratorTester( int steps, Iterable<E> elementsToInsertIterable,
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) -
cmd/object-api-interface.go
// WalkVersionsSortOrder represents the sort order in which versions of an // object should be returned by ObjectLayer.Walk method type WalkVersionsSortOrder uint8 const ( // WalkVersionsSortAsc - Sort in ascending order of ModTime WalkVersionsSortAsc WalkVersionsSortOrder = iota // WalkVersionsSortDesc - Sort in descending order of ModTime WalkVersionsSortDesc )
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 20:08:20 GMT 2024 - 17K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* 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. * * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one
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) -
android/guava-tests/test/com/google/common/collect/ImmutableMultisetTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 21K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
return ((Integer) object) % 5; // fake tons of collisions! } }; // Don't let the elements be in such a predictable order list = shuffledCopy(list, new Random(1)); Collections.sort(list, arbitrary); // Now we don't care what order it's put the list in, only that // comparing any pair of elements gives the answer we expect. Helpers.testComparator(arbitrary, list); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0)