| /external/guava/src/com/google/common/collect/ |
| EmptyImmutableSortedSet.java | 22 import java.util.Comparator;
36 EmptyImmutableSortedSet(Comparator<? super E> comparator) {
37 super(comparator);
|
| ImmutableSortedMap.java | 27 import java.util.Comparator;
64 private static final Comparator NATURAL_ORDER = Ordering.natural();
81 Comparator<? super K> comparator) {
82 if (NATURAL_ORDER.equals(comparator)) {
85 return new ImmutableSortedMap<K, V>(EMPTY_ARRAY, comparator);
177 * keys sorted by the provided comparator.
184 * the comparator
187 Map<? extends K, ? extends V> map, Comparator<? super K> comparator) {
205 Comparator<? super K> comparator = local
325 private final Comparator<? super K> comparator; field in class:ImmutableSortedMap.Builder
375 private final transient Comparator<? super K> comparator; field in class:ImmutableSortedMap
584 public Comparator<? super K> comparator() { method
676 private final Comparator<Object> comparator; field in class:SerializedForm
[all...] |
| Ordering.java | 25 import java.util.Comparator;
36 * A comparator with added methods to support common functions. For example:
39 * if (Ordering.from(comparator).reverse().isOrdered(list)) { ... }}</pre>
41 * <p>The {@link #from(Comparator)} method returns the equivalent {@code
42 * Ordering} instance for a pre-existing comparator. You can also skip the
43 * comparator step and extend {@code Ordering} directly: <pre> {@code
61 public abstract class Ordering<T> implements Comparator<T> {
80 * Returns an ordering for a pre-existing {@code comparator}. Note
81 * that if the comparator is not pre-existing, and you don't require
85 * @param comparator the comparator that defines the orde
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/security/x501/ |
| AttributeTypeAndValueComparator.java | 26 import java.util.Comparator;
30 * AttributeTypeAndValue comparator
33 public class AttributeTypeAndValueComparator implements Comparator, Serializable {
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| multiseq_selection.h | 54 template<typename T1, typename T2, typename Comparator>
59 Comparator& comp;
62 lexicographic(Comparator& _comp) : comp(_comp) { }
80 template<typename T1, typename T2, typename Comparator>
84 Comparator& comp;
87 lexicographic_reverse(Comparator& _comp) : comp(_comp) { }
121 typename Comparator>
126 Comparator comp = std::less<
139 lexicographic<value_type, int, Comparator> lcomp(comp);
140 lexicographic_reverse<value_type, int, Comparator> lrcomp(comp)
[all...] |
| balanced_quicksort.h | 94 * @param comp Comparator.
98 template<typename RandomAccessIterator, typename Comparator>
101 Comparator comp, thread_index_t num_threads)
131 __gnu_parallel::binder2nd<Comparator, value_type, value_type, bool>
157 * @param comp Comparator.
161 template<typename RandomAccessIterator, typename Comparator>
165 Comparator comp,
234 * @param comp Comparator.
237 template<typename RandomAccessIterator, typename Comparator>
240 Comparator& comp, int iam, bool wait
[all...] |
| partition.h | 326 * @param comp Comparator.
328 template<typename RandomAccessIterator, typename Comparator>
331 RandomAccessIterator end, Comparator comp)
358 // XXX Comparator must have first_value_type, second_value_type,
360 // Comparator == __gnu_parallel::lexicographic<S, int,
364 __gnu_parallel::binder2nd<Comparator, value_type, value_type, bool>
386 binder1st<Comparator, value_type, value_type, bool>, value_type>
387 pred(__gnu_parallel::binder1st<Comparator, value_type,
415 * @param comp Comparator. */
416 template<typename RandomAccessIterator, typename Comparator>
[all...] |
| base.h | 157 // XXX comparator at the end, as per others
158 template<typename Comparator, typename T1, typename T2>
162 Comparator& comp;
165 equal_from_less(Comparator& _comp) : comp(_comp) { }
439 * @param comp Comparator.
441 template<typename RandomAccessIterator, typename Comparator>
444 RandomAccessIterator c, Comparator& comp)
|
| /external/doclava/src/com/google/doclava/ |
| AttributeInfo.java | 22 import java.util.Comparator;
25 public static final Comparator<AttributeInfo> comparator = new Comparator<AttributeInfo>() { field in class:AttributeInfo
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/ |
| NotificationData.java | 26 import java.util.Comparator;
49 private final Comparator<Entry> mEntryCmp = new Comparator<Entry>() {
|
| /libcore/dalvik/src/main/java/dalvik/system/profiler/ |
| AsciiHprofWriter.java | 24 import java.util.Comparator;
93 private static final Comparator<HprofData.Sample> SAMPLE_COMPARATOR
94 = new Comparator<HprofData.Sample>() {
|
| /libcore/luni/src/main/java/libcore/icu/ |
| TimeZones.java | 20 import java.util.Comparator;
97 private static final Comparator<String[]> ZONE_STRINGS_COMPARATOR = new Comparator<String[]>() {
|
| /sdk/ide_common/src/com/android/ide/common/resources/ |
| ResourceItem.java | 25 import java.util.Comparator;
39 private final static Comparator<ResourceFile> sComparator = new Comparator<ResourceFile>() {
|
| /external/proguard/src/proguard/classfile/editor/ |
| ClassMemberSorter.java | 35 public class ClassMemberSorter implements ClassVisitor, Comparator
54 // Implementations for Comparator.
|
| /cts/tools/tradefed-host/src/com/android/cts/tradefed/testtype/ |
| TestFilter.java | 24 import java.util.Comparator;
132 * A {@link Comparator} for {@link TestIdentifier} that compares using
135 private class TestIdComparator implements Comparator<TestIdentifier> {
|
| /libcore/luni/src/main/java/libcore/util/ |
| CollectionUtils.java | 22 import java.util.Comparator;
83 * not use {@link Object#equals}: only the comparator defines equality.
85 public static <T> void removeDuplicates(List<T> list, Comparator<? super T> comparator) {
86 Collections.sort(list, comparator);
89 if (comparator.compare(list.get(j - 1), list.get(i)) != 0) {
|
| /sdk/ddms/libs/ddmuilib/src/com/android/ddmuilib/heap/ |
| NativeLibraryAllocationInfo.java | 24 import java.util.Comparator;
114 Collections.sort(libraryAllocations, new Comparator<NativeLibraryAllocationInfo>() {
|
| /frameworks/base/test-runner/src/android/test/suitebuilder/ |
| TestGrouping.java | 33 import java.util.Comparator;
53 public static final Comparator<Class<? extends TestCase>> SORT_BY_SIMPLE_NAME
56 public static final Comparator<Class<? extends TestCase>> SORT_BY_FULLY_QUALIFIED_NAME
62 public TestGrouping(Comparator<Class<? extends TestCase>> comparator) {
63 testCaseClasses = new TreeSet<Class<? extends TestCase>>(comparator);
100 return this.testCaseClasses.comparator().equals(other.testCaseClasses.comparator());
188 implements Comparator<Class<? extends TestCase>>, Serializable {
205 implements Comparator<Class<? extends TestCase>>, Serializable
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| TreeSet.java | 29 * Comparator.
73 * specified comparator.
75 * @param comparator
76 * the comparator to use.
78 public TreeSet(Comparator<? super E> comparator) {
79 backingMap = new TreeMap<E, Object>(comparator);
84 * the specified SortedSet and using the same Comparator.
90 this(set.comparator());
108 * when the object is null and the comparator cannot handl
175 public Comparator<? super E> comparator() { method in class:TreeSet
[all...] |
| PriorityQueue.java | 25 * according to their natural order or according to the comparator specified at
47 private Comparator<? super E> comparator; field in class:PriorityQueue
73 * Constructs a priority queue with the specified capacity and comparator.
77 * @param comparator
78 * the specified comparator. If it is null, the natural ordering
83 public PriorityQueue(int initialCapacity, Comparator<? super E> comparator) {
88 this.comparator = comparator;
229 public Comparator<? super E> comparator() { method in class:PriorityQueue
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| RefSortedMap.java | 28 import java.util.Comparator;
88 private final Comparator<? super K> comparator; field in class:RefSortedMap
166 public Comparator<? super K> comparator() {
167 return RefSortedMap.this.comparator();
241 this((Comparator<? super K>) null);
246 return comparator != null ? comparator.compare(start, end)
251 public RefSortedMap(Comparator<? super K> comparator)
[all...] |
| /external/chromium/base/ |
| tracked_objects.cc | 179 Comparator comparator; local
180 comparator.ParseQuery(escaped_query);
186 if (comparator.Acceptable(*it))
190 comparator.Sort(&match_array);
192 WriteHTMLTotalAndSubtotals(match_array, comparator, output);
194 comparator.Clear(); // Delete tiebreaker_ instances.
231 const Comparator& comparator,
247 if (0 == i || !comparator.Equivalent(match_array[i - 1]
[all...] |
| /dalvik/dx/src/com/android/dx/cf/direct/ |
| ClassPathOpener.java | 28 import java.util.Comparator;
183 Arrays.sort(files, new Comparator<File>() {
215 Collections.sort(entriesList, new Comparator<ZipEntry>() {
|
| /development/apps/Development/src/com/android/development/ |
| AppHwConfigList.java | 37 import java.util.Comparator;
145 private final Comparator sDisplayNameComparator = new Comparator() {
|
| AppPicker.java | 42 import java.util.Comparator;
131 private final static Comparator<MyApplicationInfo> sDisplayNameComparator
132 = new Comparator<MyApplicationInfo>() {
|
