Home
last modified time | relevance | path

Searched +full:natural +full:- +full:compare (Results 1 – 25 of 1081) sorted by relevance

12345678910>>...44

/aosp_15_r20/external/guava/guava-tests/test/com/google/common/collect/
H A DOrderingTest.java8 * http://www.apache.org/licenses/LICENSE-2.0
55 // TODO(cpovirk): some of these are inexplicably slow (20-30s) under GWT
63 assertEquals(0, comparator.compare(null, null)); in testAllEqual()
64 assertEquals(0, comparator.compare(new Object(), new Object())); in testAllEqual()
65 assertEquals(0, comparator.compare("apples", "oranges")); in testAllEqual()
78 Ordering.<Integer>natural() in testComplicatedOrderingExample()
112 Ordering<Integer> comparator = Ordering.natural(); in testNatural()
113 Helpers.testComparator(comparator, Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE); in testNatural()
115 comparator.compare(1, null); in testNatural()
120 comparator.compare(null, 2); in testNatural()
[all …]
H A DTreeMultimapNaturalTest.java8 * http://www.apache.org/licenses/LICENSE-2.0
56 * Unit tests for {@code TreeMultimap} with natural ordering.
76 Ordering.natural().nullsFirst(), Ordering.natural().nullsFirst()); in suite()
88 public int compare(Entry<String, String> left, Entry<String, String> right) { in suite()
90 .compare(left.getKey(), right.getKey(), Ordering.natural().nullsFirst()) in suite()
91 .compare( in suite()
92 left.getValue(), right.getValue(), Ordering.natural().nullsFirst()) in suite()
116 TreeMultimap.create(Ordering.natural().nullsFirst(), Ordering.natural()); in suite()
125 return Ordering.natural().nullsFirst().sortedCopy(insertionOrder); in suite()
175 public int compare(Entry<String, ?> left, Entry<String, ?> right) { in suite()
[all …]
H A DGeneralRangeTest.java7 * http://www.apache.org/licenses/LICENSE-2.0
39 Ordering.<Integer>natural().<Integer>nullsFirst();
95 assertEquals(ORDERING.compare(i, 3) == 0, range.contains(i)); in testSingletonRange()
104 ORDERING.compare(i, 3) > 0 || (ORDERING.compare(i, 3) == 0 && lBoundType == CLOSED), in testLowerRange()
107 ORDERING.compare(i, 3) < 0 || (ORDERING.compare(i, 3) == 0 && lBoundType == OPEN), in testLowerRange()
119 ORDERING.compare(i, 3) < 0 || (ORDERING.compare(i, 3) == 0 && lBoundType == CLOSED),
122 ORDERING.compare(i, 3) > 0 || (ORDERING.compare(i, 3) == 0 && lBoundType == OPEN),
189 assertEquals(GeneralRange.all(Ordering.natural()), GeneralRange.from(Range.all()));
195 GeneralRange.upTo(Ordering.natural(), 3, endpointType),
199 GeneralRange.downTo(Ordering.natural(), 3, endpointType),
[all …]
/aosp_15_r20/external/guava/android/guava-tests/test/com/google/common/collect/
H A DOrderingTest.java8 * http://www.apache.org/licenses/LICENSE-2.0
55 // TODO(cpovirk): some of these are inexplicably slow (20-30s) under GWT
63 assertEquals(0, comparator.compare(null, null)); in testAllEqual()
64 assertEquals(0, comparator.compare(new Object(), new Object())); in testAllEqual()
65 assertEquals(0, comparator.compare("apples", "oranges")); in testAllEqual()
78 Ordering.<Integer>natural() in testComplicatedOrderingExample()
112 Ordering<Integer> comparator = Ordering.natural(); in testNatural()
113 Helpers.testComparator(comparator, Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE); in testNatural()
115 comparator.compare(1, null); in testNatural()
120 comparator.compare(null, 2); in testNatural()
[all …]
H A DTreeMultimapNaturalTest.java8 * http://www.apache.org/licenses/LICENSE-2.0
56 * Unit tests for {@code TreeMultimap} with natural ordering.
76 Ordering.natural().nullsFirst(), Ordering.natural().nullsFirst()); in suite()
88 public int compare(Entry<String, String> left, Entry<String, String> right) { in suite()
90 .compare(left.getKey(), right.getKey(), Ordering.natural().nullsFirst()) in suite()
91 .compare( in suite()
92 left.getValue(), right.getValue(), Ordering.natural().nullsFirst()) in suite()
116 TreeMultimap.create(Ordering.natural().nullsFirst(), Ordering.natural()); in suite()
125 return Ordering.natural().nullsFirst().sortedCopy(insertionOrder); in suite()
175 public int compare(Entry<String, ?> left, Entry<String, ?> right) { in suite()
[all …]
H A DGeneralRangeTest.java7 * http://www.apache.org/licenses/LICENSE-2.0
39 Ordering.<Integer>natural().<Integer>nullsFirst();
95 assertEquals(ORDERING.compare(i, 3) == 0, range.contains(i)); in testSingletonRange()
104 ORDERING.compare(i, 3) > 0 || (ORDERING.compare(i, 3) == 0 && lBoundType == CLOSED), in testLowerRange()
107 ORDERING.compare(i, 3) < 0 || (ORDERING.compare(i, 3) == 0 && lBoundType == OPEN), in testLowerRange()
119 ORDERING.compare(i, 3) < 0 || (ORDERING.compare(i, 3) == 0 && lBoundType == CLOSED),
122 ORDERING.compare(i, 3) > 0 || (ORDERING.compare(i, 3) == 0 && lBoundType == OPEN),
189 assertEquals(GeneralRange.all(Ordering.natural()), GeneralRange.from(Range.all()));
195 GeneralRange.upTo(Ordering.natural(), 3, endpointType),
199 GeneralRange.downTo(Ordering.natural(), 3, endpointType),
[all …]
/aosp_15_r20/external/apache-commons-lang/src/main/java/org/apache/commons/lang3/
H A DRange.java9 * http://www.apache.org/licenses/LICENSE-2.0
29 * <p>#ThreadSafe# if the objects and comparator are thread-safe.</p>
41 * Comparable based compare implementation.
43 * @param obj1 left-hand side of comparison
44 * @param obj2 right-hand side of comparison
48 public int compare(final Object obj1, final Object obj2) { in compare() method in Range.ComparableComparator
63 * <p>The range uses the natural ordering of the elements to determine where
95 * @param comparator the comparator to be used, null for natural ordering
99 … * @throws ClassCastException if using natural ordering and the elements are not {@link Comparable}
111 * <p>The range uses the natural ordering of the elements to determine where
[all …]
/aosp_15_r20/external/guava/android/guava/src/com/google/common/collect/
H A DOrdering.java8 * http://www.apache.org/licenses/LICENSE-2.0
47 * of {@code Comparator} for pre-Java-8 users, in the same sense that {@link FluentIterable} is an
48 * enriched {@link Iterable} for pre-Java-8 users.
60 * <li>Subclass it and implement {@link #compare} instead of implementing {@link Comparator}
62 * <li>Pass a <i>pre-existing</i> {@link Comparator} instance to {@link #from(Comparator)}
63 * <li>Use the natural ordering, {@link Ordering#natural}
95 * Ordering.natural()
104 * when {@code compare} is called on the above ordering:
108 * <li>Next, non-null {@code Foo} values are passed to {@code getBarFunction} (we will be
111 * <li>Finally, natural ordering is used (i.e. the result of {@code Bar.compareTo(Bar)} is
[all …]
H A DImmutableSortedSet.java8 * http://www.apache.org/licenses/LICENSE-2.0
49 * equals</i>. That is, {@code a.compareTo(b)} or {@code comparator.compare(a, b)} should equal zero
73 * @since 33.2.0 (available since 21.0 in guava-jre)
83 if (Ordering.natural().equals(comparator)) { in emptySet()
84 @SuppressWarnings("unchecked") // The natural-ordered empty set supports all types. in emptySet()
98 @SuppressWarnings("unchecked") // The natural-ordered empty set supports all types.
105 return new RegularImmutableSortedSet<>(ImmutableList.of(e1), Ordering.natural()); in of()
109 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
116 return construct(Ordering.natural(), 2, e1, e2); in of()
120 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
[all …]
H A DTreeBasedTable.java8 * http://www.apache.org/licenses/LICENSE-2.0
37 * Implementation of {@code Table} whose row keys and column keys are ordered by their natural
39 * comparators for the row keys and the column keys, or you may use natural ordering for both.
89 * Creates an empty {@code TreeBasedTable} that uses the natural orderings of both row and column
98 return new TreeBasedTable<>(Ordering.natural(), Ordering.natural()); in create()
133 * Returns the comparator that orders the rows. With natural ordering, {@link Ordering#natural()}
141 * requireNonNull is safe because the factories require non-null Comparators, which they pass on in rowComparator()
148 * Returns the comparator that orders the columns. With natural ordering, {@link
149 * Ordering#natural()} is returned.
170 * source-compatible</a> since 7.0)
[all …]
H A DImmutableSortedMap.java8 * http://www.apache.org/licenses/LICENSE-2.0
52 * equals</i>. That is, {@code a.compareTo(b)} or {@code comparator.compare(a, b)} should equal zero
77 * @since 33.2.0 (available since 21.0 in guava-jre)
98 * @since 33.2.0 (available since 21.0 in guava-jre)
116 private static final Comparator<?> NATURAL_ORDER = Ordering.natural();
120 ImmutableSortedSet.emptySet(Ordering.natural()), ImmutableList.<Object>of());
123 if (Ordering.natural().equals(comparator)) { in emptyMap()
145 return of(Ordering.natural(), k1, v1); in of()
156 * Returns an immutable sorted map containing the given entries, sorted by the natural ordering of
159 * @throws IllegalArgumentException if the two keys are equal according to their natural ordering
[all …]
H A DTreeMultimap.java8 * http://www.apache.org/licenses/LICENSE-2.0
39 * Implementation of {@code Multimap} whose keys and values are ordered by their natural ordering or
41 * {@link Comparator#compare} instead of {@link Object#equals} to determine equivalence of
50 * according to the key comparator ordering or the natural ordering of the keys. Similarly, {@code
52 * values according to the value comparator ordering or the natural ordering of the values. The
57 * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an
58 * existing key-value pair has no effect.
83 * Creates an empty {@code TreeMultimap} ordered by the natural ordering of its keys and values.
87 return new TreeMultimap<>(Ordering.natural(), Ordering.natural()); in create()
92 * may be null; use {@link Ordering#natural()} to specify natural order.
[all …]
H A DSortedLists.java7 * http://www.apache.org/licenses/LICENSE-2.0
72 int upper = list.size() - 1; in resultIndex()
76 int c = comparator.compare(list.get(middle), key); in resultIndex()
78 upper = middle - 1; in resultIndex()
102 int c = comparator.compare(list.get(middle), key); in resultIndex()
127 * Return the index of the last list element that compares as less than the key, or {@code -1}
137 return FIRST_PRESENT.resultIndex(comparator, key, list, foundIndex) - 1; in resultIndex()
149 * A specification for which index to return if the list contains no elements that compare as
154 * Return the index of the next lower element in the list, or {@code -1} if there is no such
160 return higherIndex - 1; in resultIndex()
[all …]
/aosp_15_r20/external/guava/guava/src/com/google/common/collect/
H A DOrdering.java8 * http://www.apache.org/licenses/LICENSE-2.0
47 * of {@code Comparator} for pre-Java-8 users, in the same sense that {@link FluentIterable} is an
48 * enriched {@link Iterable} for pre-Java-8 users.
60 * <li>Subclass it and implement {@link #compare} instead of implementing {@link Comparator}
62 * <li>Pass a <i>pre-existing</i> {@link Comparator} instance to {@link #from(Comparator)}
63 * <li>Use the natural ordering, {@link Ordering#natural}
95 * Ordering.natural()
104 * when {@code compare} is called on the above ordering:
108 * <li>Next, non-null {@code Foo} values are passed to {@code getBarFunction} (we will be
111 * <li>Finally, natural ordering is used (i.e. the result of {@code Bar.compareTo(Bar)} is
[all …]
H A DImmutableSortedSet.java8 * http://www.apache.org/licenses/LICENSE-2.0
52 * equals</i>. That is, {@code a.compareTo(b)} or {@code comparator.compare(a, b)} should equal zero
87 if (Ordering.natural().equals(comparator)) { in emptySet()
88 @SuppressWarnings("unchecked") // The natural-ordered empty set supports all types. in emptySet()
102 @SuppressWarnings("unchecked") // The natural-ordered empty set supports all types.
109 return new RegularImmutableSortedSet<>(ImmutableList.of(e1), Ordering.natural()); in of()
113 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
120 return construct(Ordering.natural(), 2, e1, e2); in of()
124 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
131 return construct(Ordering.natural(), 3, e1, e2, e3); in of()
[all …]
H A DTreeBasedTable.java8 * http://www.apache.org/licenses/LICENSE-2.0
37 * Implementation of {@code Table} whose row keys and column keys are ordered by their natural
39 * comparators for the row keys and the column keys, or you may use natural ordering for both.
89 * Creates an empty {@code TreeBasedTable} that uses the natural orderings of both row and column
98 return new TreeBasedTable<>(Ordering.natural(), Ordering.natural()); in create()
133 * Returns the comparator that orders the rows. With natural ordering, {@link Ordering#natural()}
141 * requireNonNull is safe because the factories require non-null Comparators, which they pass on in rowComparator()
148 * Returns the comparator that orders the columns. With natural ordering, {@link
149 * Ordering#natural()} is returned.
170 * source-compatible</a> since 7.0)
[all …]
H A DTreeMultimap.java8 * http://www.apache.org/licenses/LICENSE-2.0
39 * Implementation of {@code Multimap} whose keys and values are ordered by their natural ordering or
41 * {@link Comparator#compare} instead of {@link Object#equals} to determine equivalence of
50 * according to the key comparator ordering or the natural ordering of the keys. Similarly, {@code
52 * values according to the value comparator ordering or the natural ordering of the values. The
57 * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an
58 * existing key-value pair has no effect.
83 * Creates an empty {@code TreeMultimap} ordered by the natural ordering of its keys and values.
87 return new TreeMultimap<>(Ordering.natural(), Ordering.natural()); in create()
92 * may be null; use {@link Ordering#natural()} to specify natural order.
[all …]
/aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/gensrcs/libcore/ojluni/src/main/java/java/util/
DComparator.java19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
45 * natural ordering}.<p>
49 * {@code c.compare(e1, e2)==0} has the same boolean value as
63 * {@code (a.equals(b) && c.compare(a, b) != 0)}
80 * {(x, y) such that c.compare(x, y) &lt;= 0}.
82 * {(x, y) such that c.compare(x, y) == 0}.
85 * It follows immediately from the contract for {@code compare} that the
97 * the quotient of the {@code compare} method are the same.
104 * <a href="{@docRoot}/reference/java/util/package-summary.html#CollectionsFramework">
123 * signum}{@code (compare(x, y)) == -signum(compare(y, x))} for
[all …]
DTreeMap.java20 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
36 * A Red-Black tree based {@link NavigableMap} implementation.
37 * The map is sorted according to the {@linkplain Comparable natural
53 * compareTo} (or {@code compare}) method, so two keys that are deemed equal by
55 * of a sorted map <em>is</em> well-defined even if its ordering is
75 * <em>fail-fast</em>: if the map is structurally modified at any time after
80 * arbitrary, non-deterministic behavior at an undetermined time in the future.
82 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed
84 * presence of unsynchronized concurrent modification. Fail-fast iterators
85 * throw {@code ConcurrentModificationException} on a best-effort basis.
[all …]
/aosp_15_r20/libcore/ojluni/src/main/java/java/util/
H A DComparator.java19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
45 * natural ordering}.<p>
49 * {@code c.compare(e1, e2)==0} has the same boolean value as
63 * {@code (a.equals(b) && c.compare(a, b) != 0)}
80 * {(x, y) such that c.compare(x, y) &lt;= 0}.
82 * {(x, y) such that c.compare(x, y) == 0}.
85 * It follows immediately from the contract for {@code compare} that the
97 * the quotient of the {@code compare} method are the same.
104 * <a href="{@docRoot}/java.base/java/util/package-summary.html#CollectionsFramework">
123 * signum}{@code (compare(x, y)) == -signum(compare(y, x))} for
[all …]
H A DTreeMap.java20 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
36 * A Red-Black tree based {@link NavigableMap} implementation.
37 * The map is sorted according to the {@linkplain Comparable natural
53 * compareTo} (or {@code compare}) method, so two keys that are deemed equal by
55 * of a sorted map <em>is</em> well-defined even if its ordering is
75 * <em>fail-fast</em>: if the map is structurally modified at any time after
80 * arbitrary, non-deterministic behavior at an undetermined time in the future.
82 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed
84 * presence of unsynchronized concurrent modification. Fail-fast iterators
85 * throw {@code ConcurrentModificationException} on a best-effort basis.
[all …]
/aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/18/libcore/ojluni/src/main/java/java/util/
DComparator.java19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
45 * natural ordering}.<p>
49 * {@code c.compare(e1, e2)==0} has the same boolean value as
63 * {@code (a.equals(b) && c.compare(a, b) != 0)}
80 * {(x, y) such that c.compare(x, y) &lt;= 0}.
82 * {(x, y) such that c.compare(x, y) == 0}.
85 * It follows immediately from the contract for {@code compare} that the
97 * the quotient of the {@code compare} method are the same.
104 * <a href="{@docRoot}/reference/java/util/package-summary.html#CollectionsFramework">
123 * signum}{@code (compare(x, y)) == -signum(compare(y, x))} for
[all …]
/aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/24/libcore/ojluni/src/main/java/java/util/
DTreeMap.java20 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
36 * A Red-Black tree based {@link NavigableMap} implementation.
37 * The map is sorted according to the {@linkplain Comparable natural
53 * compareTo} (or {@code compare}) method, so two keys that are deemed equal by
55 * of a sorted map <em>is</em> well-defined even if its ordering is
75 * <em>fail-fast</em>: if the map is structurally modified at any time after
80 * arbitrary, non-deterministic behavior at an undetermined time in the future.
82 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed
84 * presence of unsynchronized concurrent modification. Fail-fast iterators
85 * throw {@code ConcurrentModificationException} on a best-effort basis.
[all …]
/aosp_15_r20/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DImmutableSortedMap.java8 * http://www.apache.org/licenses/LICENSE-2.0
49 static final Comparator<?> NATURAL_ORDER = Ordering.natural();
61 // non-null instance of Ordering.natural().
93 keyFunction, valueFunction, mergeFunction, () -> new TreeMap<K, V>(comparator)), in toImmutableSortedMap()
109 return new Builder<K, V>(Ordering.natural()).put(k1, v1).put(k2, v2).build(); in of()
114 return new Builder<K, V>(Ordering.natural()).put(k1, v1).put(k2, v2).put(k3, v3).build(); in of()
119 return new Builder<K, V>(Ordering.natural()) in of()
129 return new Builder<K, V>(Ordering.natural()) in of()
140 return new Builder<K, V>(Ordering.natural()) in of()
152 return new Builder<K, V>(Ordering.natural()) in of()
[all …]
/aosp_15_r20/prebuilts/cmake/linux-x86/share/cmake-3.22/Help/command/
Dlist.rst2 ----
9 .. parsed-literal::
12 list(`LENGTH`_ <list> <out-var>)
13 list(`GET`_ <list> <element index> [<index> ...] <out-var>)
14 list(`JOIN`_ <list> <glue> <out-var>)
15 list(`SUBLIST`_ <list> <begin> <length> <out-var>)
18 list(`FIND`_ <list> <value> <out-var>)
24 list(`POP_BACK`_ <list> [<out-var>...])
25 list(`POP_FRONT`_ <list> [<out-var>...])
61 first list element. If ``<element index>`` is -1 or lesser, it is indexed
[all …]

12345678910>>...44