- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 80 for ascending (0.62 sec)
-
android/guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
// Test 32 byte arrays of ascending. byte[] ascending = new byte[32]; for (int i = 0; i < 32; i++) { ascending[i] = (byte) i; } assertCrc(0x46dd794e, ascending); } public void testDescending() { // Test 32 byte arrays of descending. byte[] descending = new byte[32]; for (int i = 0; i < 32; i++) { descending[i] = (byte) (31 - i); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Dec 23 18:30:33 GMT 2020 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedMultiset.java
/** * {@inheritDoc} * * <p>The {@code entrySet}'s iterator returns entries in ascending element order according to this * multiset's comparator. */ @Override Set<Entry<E>> entrySet(); /** * {@inheritDoc} * * <p>The iterator returns the elements in ascending order according to this multiset's * comparator. */ @Override Iterator<E> iterator();
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) -
guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
// Test 32 byte arrays of ascending. byte[] ascending = new byte[32]; for (int i = 0; i < 32; i++) { ascending[i] = (byte) i; } assertCrc(0x46dd794e, ascending); } public void testDescending() { // Test 32 byte arrays of descending. byte[] descending = new byte[32]; for (int i = 0; i < 32; i++) { descending[i] = (byte) (31 - i); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Dec 23 18:30:33 GMT 2020 - 6.5K 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) {
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-testlib/src/com/google/common/collect/testing/SortedMapTestSuiteBuilder.java
enum NoRecurse implements Feature<@Nullable Void> { SUBMAP, DESCENDING; @Override public Set<Feature<? super @Nullable Void>> getImpliedFeatures() { return Collections.emptySet(); } } /** * Creates a suite whose map has some elements filtered out of view. * * <p>Because the map may be ascending or descending, this test must derive the relative order of
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/MultisetNavigationTester.java
public void testDescendingNavigation() { List<Entry<E>> ascending = new ArrayList<>(); Iterators.addAll(ascending, sortedMultiset.entrySet().iterator()); List<Entry<E>> descending = new ArrayList<>(); Iterators.addAll(descending, sortedMultiset.descendingMultiset().entrySet().iterator()); Collections.reverse(descending); assertEquals(ascending, descending); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 25.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/SortedSetTestSuiteBuilder.java
} return derivedSuites; } /** * Creates a suite whose set has some elements filtered out of view. * * <p>Because the set may be ascending or descending, this test must derive the relative order of * these extreme values rather than relying on their regular sort ordering. */ final TestSuite createSubsetSuite(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeMap.java
* this range map are guaranteed to read through to the returned {@code Map}. * * <p>The returned {@code Map} iterates over entries in ascending order of the bounds of the * {@code Range} entries. * * <p>It is guaranteed that no empty ranges will be in the returned {@code Map}. */ Map<Range<K>, V> asMapOfRanges(); /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* 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 * permutation, instead of two. This is why the elements have to implement {@link Comparable}.
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-testlib/src/com/google/common/collect/testing/google/MultisetNavigationTester.java
public void testDescendingNavigation() { List<Entry<E>> ascending = new ArrayList<>(); Iterators.addAll(ascending, sortedMultiset.entrySet().iterator()); List<Entry<E>> descending = new ArrayList<>(); Iterators.addAll(descending, sortedMultiset.descendingMultiset().entrySet().iterator()); Collections.reverse(descending); assertEquals(ascending, descending); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 25.9K bytes - Viewed (0)