- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for lexicographical (0.26 sec)
-
android/guava-tests/test/com/google/common/collect/ComparatorsTest.java
ImmutableList<String> b = ImmutableList.of("b"); Helpers.testComparator(lexy, empty, a, aa, ab, b); new EqualsTester() .addEqualityGroup(lexy, Comparators.lexicographical(comparator)) .addEqualityGroup(Comparators.lexicographical(String.CASE_INSENSITIVE_ORDER)) .addEqualityGroup(Ordering.natural()) .testEquals(); } public void testIsInOrder() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 08:42:51 GMT 2024 - 5.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ComparatorsTest.java
ImmutableList<String> b = ImmutableList.of("b"); Helpers.testComparator(lexy, empty, a, aa, ab, b); new EqualsTester() .addEqualityGroup(lexy, Comparators.lexicographical(comparator)) .addEqualityGroup(Comparators.lexicographical(String.CASE_INSENSITIVE_ORDER)) .addEqualityGroup(Ordering.natural()) .testEquals(); } public void testIsInOrder() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Apr 11 08:42:51 GMT 2024 - 6.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
* For example, a lexicographical natural ordering over integers considers {@code [] < [1] < [1, * 1] < [1, 2] < [2]}. * * <p>Note that {@code Collections.reverseOrder(lexicographical(comparator))} is not equivalent to * {@code lexicographical(Collections.reverseOrder(comparator))} (consider how each would order * {@code [1]} and {@code [1, 1]}). */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K 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/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) -
guava-tests/test/com/google/common/collect/OrderingTest.java
ImmutableList<String> b = ImmutableList.of("b"); Helpers.testComparator(lexy, empty, a, aa, ab, b); new EqualsTester() .addEqualityGroup(lexy, ordering.lexicographical()) .addEqualityGroup(numberOrdering.lexicographical()) .addEqualityGroup(Ordering.natural()) .testEquals(); } public void testNullsFirst() {
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) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
ImmutableList<String> b = ImmutableList.of("b"); Helpers.testComparator(lexy, empty, a, aa, ab, b); new EqualsTester() .addEqualityGroup(lexy, ordering.lexicographical()) .addEqualityGroup(numberOrdering.lexicographical()) .addEqualityGroup(Ordering.natural()) .testEquals(); } public void testNullsFirst() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* but not the other, the shorter iterable is considered to be less than the longer one. For * example, a lexicographical natural ordering over integers considers {@code [] < [1] < [1, 1] < * [1, 2] < [2]}. * * <p>Note that {@code ordering.lexicographical().reverse()} is not equivalent to {@code * ordering.reverse().lexicographical()} (consider how each would order {@code [1]} and {@code [1, * 1]}). *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
} return builder.toString(); } /** * Returns a comparator that compares two {@code byte} arrays <a * href="http://en.wikipedia.org/wiki/Lexicographical_order">lexicographically</a>. That is, it * compares, using {@link #compare(byte, byte)}), the first pair of values that follow any common * prefix, or when one array is a prefix of the other, treats the shorter array as the lesser. For
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 18.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
* <li>{@code ImmutableList.of(2, "A")} * <li>{@code ImmutableList.of(2, "B")} * <li>{@code ImmutableList.of(2, "C")} * </ul> * * <p>The result is guaranteed to be in the "traditional", lexicographical order for Cartesian * products that you would get from nesting for loops: * * <pre>{@code * for (B b0 : lists.get(0)) { * for (B b1 : lists.get(1)) { * ...
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 16:48:36 GMT 2024 - 41.5K bytes - Viewed (0)