| /external/guava/guava/src/com/google/common/collect/ |
| EmptyImmutableSortedMap.java | 22 import java.util.Comparator;
36 EmptyImmutableSortedMap(Comparator<? super K> comparator) {
37 this.keySet = ImmutableSortedSet.emptySet(comparator);
41 Comparator<? super K> comparator, ImmutableSortedMap<K, V> descendingMap) {
43 this.keySet = ImmutableSortedSet.emptySet(comparator);
110 return new EmptyImmutableSortedMap<K, V>(Ordering.from(comparator()).reverse(), this);
|
| SortedLists.java | 24 import java.util.Comparator;
34 * <i>lesser</i> are considered to refer to the comparator on the elements, and the terms
56 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
66 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
74 int c = comparator.compare(list.get(middle), key);
90 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
99 int c = comparator.compare(list.get(middle), key)
[all...] |
| AbstractSortedMultiset.java | 21 import java.util.Comparator;
38 @GwtTransient final Comparator<? super E> comparator; field in class:AbstractSortedMultiset
43 this((Comparator) Ordering.natural());
46 AbstractSortedMultiset(Comparator<? super E> comparator) {
47 this.comparator = checkNotNull(comparator);
61 public Comparator<? super E> comparator() { method in class:AbstractSortedMultiset
[all...] |
| TreeMultimap.java | 28 import java.util.Comparator;
41 * Comparator#compare} instead of {@link Object#equals} to determine
50 * through the keys according to the key comparator ordering or the natural
53 * to the value comparator ordering or the natural ordering of the values. The
80 private transient Comparator<? super K> keyComparator;
81 private transient Comparator<? super V> valueComparator;
94 * Neither comparator may be null; use {@link Ordering#natural()} to specify
97 * @param keyComparator the comparator that determines the key ordering
98 * @param valueComparator the comparator that determines the value ordering
101 Comparator<? super K> keyComparator
[all...] |
| TreeBasedTable.java | 28 import java.util.Comparator;
80 private final Comparator<? super C> columnComparator;
84 final Comparator<? super C> comparator; field in class:TreeBasedTable.Factory
85 Factory(Comparator<? super C> comparator) {
86 this.comparator = comparator;
90 return new TreeMap<C, V>(comparator);
114 * @param rowComparator the comparator that orders the row key
200 @Override public Comparator<? super C> comparator() { method in class:TreeBasedTable.TreeRow
317 final Comparator<? super C> comparator = columnComparator(); local
[all...] |
| ImmutableSortedSet.java | 32 import java.util.Comparator;
41 * Some instances are ordered by an explicit comparator, while others follow the
62 * two elements are equivalent. Instead, with an explicit comparator, the
66 * {(x, y) | comparator.compare(x, y) == 0}}</pre>
97 private static final Comparator<Comparable> NATURAL_ORDER =
109 Comparator<? super E> comparator) {
110 if (NATURAL_ORDER.equals(comparator)) {
113 return new EmptyImmutableSortedSet<E>(comparator);
226 * copy of a {@code SortedSet} that preserves the comparator, call {@lin
401 Comparator<? super E> comparator = SortedIterables.comparator(sortedSet); local
491 private final Comparator<? super E> comparator; field in class:ImmutableSortedSet.Builder
582 final transient Comparator<? super E> comparator; field in class:ImmutableSortedSet
596 public Comparator<? super E> comparator() { method in class:ImmutableSortedSet
811 final Comparator<? super E> comparator; field in class:ImmutableSortedSet.SerializedForm
[all...] |
| TreeMultiset.java | 33 import java.util.Comparator;
42 * or an explicit {@link Comparator}. In all cases, this implementation uses
43 * {@link Comparable#compareTo} or {@link Comparator#compare} instead of {@link Object#equals} to
78 * Creates a new, empty multiset, sorted according to the specified comparator. All elements
79 * inserted into the multiset must be <i>mutually comparable</i> by the specified comparator:
80 * {@code comparator.compare(e1,
85 * @param comparator
86 * the comparator that will be used to sort this multiset. A null value indicates that
90 public static <E> TreeMultiset<E> create(@Nullable Comparator<? super E> comparator) {
[all...] |
| DescendingMultiset.java | 21 import java.util.Comparator;
37 private transient Comparator<? super E> comparator; field in class:DescendingMultiset
39 @Override public Comparator<? super E> comparator() { method in class:DescendingMultiset
40 Comparator<? super E> result = comparator;
42 return comparator =
43 Ordering.from(forwardMultiset().comparator()).<E>reverse();
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultimap.java | 24 import java.util.Comparator;
35 * Comparator#compare} instead of {@link Object#equals} to determine
44 * through the keys according to the key comparator ordering or the natural
47 * to the value comparator ordering or the natural ordering of the values. The
74 private transient Comparator<? super K> keyComparator;
75 private transient Comparator<? super V> valueComparator;
88 * Neither comparator may be null; use {@link Ordering#natural()} to specify
91 * @param keyComparator the comparator that determines the key ordering
92 * @param valueComparator the comparator that determines the value ordering
95 Comparator<? super K> keyComparator
[all...] |
| AbstractSortedMultiset.java | 21 import java.util.Comparator;
38 @GwtTransient final Comparator<? super E> comparator; field in class:AbstractSortedMultiset
43 this((Comparator) Ordering.natural());
46 AbstractSortedMultiset(Comparator<? super E> comparator) {
47 this.comparator = checkNotNull(comparator);
61 public Comparator<? super E> comparator() { method in class:AbstractSortedMultiset
[all...] |
| TreeMultiset.java | 29 import java.util.Comparator;
38 * or an explicit {@link Comparator}. In all cases, this implementation uses
39 * {@link Comparable#compareTo} or {@link Comparator#compare} instead of {@link Object#equals} to
74 * Creates a new, empty multiset, sorted according to the specified comparator. All elements
75 * inserted into the multiset must be <i>mutually comparable</i> by the specified comparator:
76 * {@code comparator.compare(e1,
81 * @param comparator
82 * the comparator that will be used to sort this multiset. A null value indicates that
86 public static <E> TreeMultiset<E> create(@Nullable Comparator<? super E> comparator) {
[all...] |
| ImmutableSortedAsList.java | 19 import java.util.Comparator;
41 @Override public Comparator<? super E> comparator() { method in class:ImmutableSortedAsList
42 return delegateCollection().comparator();
|
| DescendingMultiset.java | 21 import java.util.Comparator;
37 private transient Comparator<? super E> comparator; field in class:DescendingMultiset
39 @Override public Comparator<? super E> comparator() { method in class:DescendingMultiset
40 Comparator<? super E> result = comparator;
42 return comparator =
43 Ordering.from(forwardMultiset().comparator()).<E>reverse();
|
| /packages/apps/UnifiedEmail/src/org/apache/commons/io/comparator/ |
| DefaultFileComparator.java | 17 package org.apache.commons.io.comparator;
21 import java.util.Comparator;
26 * This comparator can be used to sort lists or arrays of files
47 public class DefaultFileComparator implements Comparator<File>, Serializable {
49 /** Singleton default comparator instance */
50 public static final Comparator<File> DEFAULT_COMPARATOR = new DefaultFileComparator();
52 /** Singleton reverse default comparator instance */
53 public static final Comparator<File> DEFAULT_REVERSE = new ReverseComparator<File>(DEFAULT_COMPARATOR);
|
| ExtensionFileComparator.java | 17 package org.apache.commons.io.comparator;
21 import java.util.Comparator;
30 * This comparator can be used to sort lists or arrays of files
54 public class ExtensionFileComparator implements Comparator<File>, Serializable {
56 /** Case-sensitive extension comparator instance (see {@link IOCase#SENSITIVE}) */
57 public static final Comparator<File> EXTENSION_COMPARATOR = new ExtensionFileComparator();
59 /** Reverse case-sensitive extension comparator instance (see {@link IOCase#SENSITIVE}) */
60 public static final Comparator<File> EXTENSION_REVERSE = new ReverseComparator<File>(EXTENSION_COMPARATOR);
62 /** Case-insensitive extension comparator instance (see {@link IOCase#INSENSITIVE}) */
63 public static final Comparator<File> EXTENSION_INSENSITIVE_COMPARATOR = new ExtensionFileComparator(IOCase.INSENSITIVE)
[all...] |
| LastModifiedFileComparator.java | 17 package org.apache.commons.io.comparator;
21 import java.util.Comparator;
27 * This comparator can be used to sort lists or arrays of files
48 public class LastModifiedFileComparator implements Comparator<File>, Serializable {
50 /** Last modified comparator instance */
51 public static final Comparator<File> LASTMODIFIED_COMPARATOR = new LastModifiedFileComparator();
53 /** Reverse last modified comparator instance */
54 public static final Comparator<File> LASTMODIFIED_REVERSE = new ReverseComparator<File>(LASTMODIFIED_COMPARATOR);
|
| /libcore/ojluni/src/main/java/java/util/ |
| Comparators.java | 35 * Package private supporting class for {@link Comparator}.
47 enum NaturalOrderComparator implements Comparator<Comparable<Object>> {
56 public Comparator<Comparable<Object>> reversed() {
57 return Comparator.reverseOrder();
64 final static class NullComparator<T> implements Comparator<T>, Serializable {
68 private final Comparator<T> real;
71 NullComparator(boolean nullFirst, Comparator<? super T> real) {
73 this.real = (Comparator<T>) real;
88 public Comparator<T> thenComparing(Comparator<? super T> other)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| NelderMead.java | 20 import java.util.Comparator;
74 protected void iterateSimplex(final Comparator<RealPointValuePair> comparator)
109 if ((comparator.compare(best, reflected) <= 0) &&
110 (comparator.compare(reflected, secondBest) < 0)) {
113 replaceWorstPoint(reflected, comparator);
115 } else if (comparator.compare(reflected, best) < 0) {
124 if (comparator.compare(expanded, reflected) < 0) {
126 replaceWorstPoint(expanded, comparator);
129 replaceWorstPoint(reflected, comparator);
[all...] |
| MultiDirectional.java | 20 import java.util.Comparator;
61 protected void iterateSimplex(final Comparator<RealPointValuePair> comparator)
74 final RealPointValuePair reflected = evaluateNewSimplex(original, 1.0, comparator);
75 if (comparator.compare(reflected, best) < 0) {
79 final RealPointValuePair expanded = evaluateNewSimplex(original, khi, comparator);
80 if (comparator.compare(reflected, expanded) <= 0) {
90 final RealPointValuePair contracted = evaluateNewSimplex(original, gamma, comparator);
91 if (comparator.compare(contracted, best) < 0) {
113 * @param comparator comparator to use to sort simplex vertices from best to poores
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SafeTreeMap.java | 22 import java.util.Comparator;
41 private static final Comparator<Object> NATURAL_ORDER = new Comparator<Object>() {
52 public SafeTreeMap(Comparator<? super K> comparator) {
53 this(new TreeMap<K, V>(comparator));
87 @Override public Comparator<? super K> comparator() { method in class:SafeTreeMap
88 Comparator<? super K> comparator = delegate.comparator() local
[all...] |
| SafeTreeSet.java | 21 import java.util.Comparator;
36 private static final Comparator<Object> NATURAL_ORDER = new Comparator<Object>() {
51 public SafeTreeSet(Comparator<? super E> comparator) {
52 this(new TreeSet<E>(comparator));
86 @Override public Comparator<? super E> comparator() { method in class:SafeTreeSet
87 Comparator<? super E> comparator = delegate.comparator() local
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/utils/ |
| SuggestionResults.java | 24 import java.util.Comparator;
45 private SuggestionResults(final Comparator<SuggestedWordInfo> comparator, final int capacity,
48 super(comparator);
62 if (comparator().compare(e, last()) > 0) return false;
74 static final class SuggestedWordInfoComparator implements Comparator<SuggestedWordInfo> {
75 // This comparator ranks the word info with the higher frequency first. That's because
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultimapExplicitTest.java | 27 import java.util.Comparator;
44 private enum StringLength implements Comparator<String> {
45 COMPARATOR;
66 private static final Comparator<Integer> DECREASING_INT_COMPARATOR =
71 StringLength.COMPARATOR, DECREASING_INT_COMPARATOR);
79 StringLength.COMPARATOR, DECREASING_INT_COMPARATOR);
95 StringLength.COMPARATOR, DECREASING_INT_COMPARATOR);
109 assertEquals(Ordering.natural(), copy.get("google").comparator()); method
125 assertEquals(StringLength.COMPARATOR, multimap.keyComparator());
175 assertEquals(DECREASING_INT_COMPARATOR, multimap.get("foo").comparator());
[all...] |
| /packages/apps/Launcher3/src/com/android/launcher3/model/ |
| AppNameComparator.java | 25 import java.util.Comparator;
28 * Class to manage access to an app name comparator.
35 private final Comparator<String> mSectionNameComparator;
59 mSectionNameComparator = new Comparator<String>() {
68 * Returns a locale-aware comparator that will alphabetically order a list of applications.
70 public Comparator<ItemInfo> getAppInfoComparator() {
75 * Returns a locale-aware comparator that will alphabetically order a list of section names.
77 public Comparator<String> getSectionNameComparator() {
82 * Compares two titles with the same return value semantics as Comparator.
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| Counter.java | 13 import java.util.Comparator;
24 Comparator<T> comparator; field in class:Counter
30 public Counter(Comparator<T> comparator) {
31 if (comparator != null) {
32 this.comparator = comparator;
33 map = new TreeMap<T, RWLong>(comparator);
108 private static class EntryComparator<T> implements Comparator<Entry<T>>
[all...] |
