| /packages/apps/Gallery/src/com/android/camera/gallery/ |
| ImageListUber.java | 25 import java.util.Comparator;
241 private static class DescendingComparator implements Comparator<MergeSlot> {
251 private static class AscendingComparator implements Comparator<MergeSlot> {
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| LocalMergeAlbum.java | 26 import java.util.Comparator;
31 // MergeAlbum merges items from two or more MediaSets. It uses a Comparator to
33 // media sets (with the same order that the Comparator uses).
41 private final Comparator<MediaItem> mComparator;
52 Path path, Comparator<MediaItem> comparator, MediaSet[] sources, int bucketId) {
54 mComparator = comparator;
|
| /packages/apps/Settings/src/com/android/settings/applications/ |
| ApplicationsState.java | 31 import java.util.Comparator;
163 public static final Comparator<AppEntry> ALPHA_COMPARATOR = new Comparator<AppEntry>() {
178 public static final Comparator<AppEntry> SIZE_COMPARATOR
179 = new Comparator<AppEntry>() {
189 public static final Comparator<AppEntry> INTERNAL_SIZE_COMPARATOR
190 = new Comparator<AppEntry>() {
200 public static final Comparator<AppEntry> EXTERNAL_SIZE_COMPARATOR
201 = new Comparator<AppEntry>() {
475 Comparator<AppEntry> mRebuildComparator
547 Comparator<AppEntry> comparator; local
[all...] |
| ProcessStatsDetail.java | 46 import java.util.Comparator;
211 final static Comparator<ProcStatsEntry.Service> sServiceCompare
212 = new Comparator<ProcStatsEntry.Service>() {
224 final static Comparator<ArrayList<ProcStatsEntry.Service>> sServicePkgCompare
225 = new Comparator<ArrayList<ProcStatsEntry.Service>>() {
|
| /packages/apps/UnifiedEmail/src/com/android/mail/ui/ |
| RecentFolderList.java | 38 import java.util.Comparator;
80 private static final Comparator<Folder> ALPHABET_IGNORECASE = new Comparator<Folder>() {
|
| /packages/experimental/LoaderApp/src/com/android/loaderapp/model/ |
| ContactsSource.java | 37 import java.util.Comparator;
146 * {@link Comparator} to sort by {@link DataKind#weight}.
148 private static Comparator<DataKind> sWeightComparator = new Comparator<DataKind>() {
|
| /packages/providers/MediaProvider/src/com/android/providers/media/ |
| MediaThumbRequest.java | 22 import java.util.Comparator;
74 static Comparator<MediaThumbRequest> getComparator() {
75 return new Comparator<MediaThumbRequest>() {
|
| /pdk/apps/HelloPDK/src/com/example/android/helloPDK/ |
| MainActivity.java | 34 import java.util.Comparator;
115 private final static Comparator<Map<String, Object>> sDisplayNameComparator =
116 new Comparator<Map<String, Object>>() {
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| algo.h | 281 // Public interface, insert default comparator
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableMultimap.java | 29 import java.util.Comparator;
139 Comparator<? super K> keyComparator, Multimap<K, V> multimap) {
169 Comparator<? super V> valueComparator;
244 public Builder<K, V> orderKeysBy(Comparator<? super K> keyComparator) {
256 public Builder<K, V> orderValuesBy(Comparator<? super V> valueComparator) {
|
| Ordering.java | 29 import java.util.Comparator;
42 * A comparator with added methods to support common functions. For example:
45 * if (Ordering.from(comparator).reverse().isOrdered(list)) { ... }}</pre>
47 * The {@link #from(Comparator)} method returns the equivalent {@code Ordering}
48 * instance for a pre-existing comparator. You can also skip the comparator step
67 public abstract class Ordering<T> implements Comparator<T> {
86 * Returns an ordering for a pre-existing {@code comparator}. Note
87 * that if the comparator is not pre-existing, and you don't require
91 * @param comparator the comparator that defines the orde
[all...] |
| RegularImmutableTable.java | 28 import java.util.Comparator;
91 @Nullable final Comparator<? super R> rowComparator,
92 @Nullable final Comparator<? super C> columnComparator) {
97 * expected and that isn't documented in the Javadoc. If a row Comparator
99 * the columns in the second row, etc. If a column Comparator is provided
100 * but a row Comparator isn't, cellSet() iterates across the rows in the
103 Comparator<Cell<R, C, V>> comparator = new Comparator<Cell<R, C, V>>() { local
115 Collections.sort(cells, comparator);
[all...] |
| TreeMultiset.java | 29 import java.util.Comparator;
41 * their natural order or an explicit {@link Comparator}. In all cases, this
43 * Comparator#compare} instead of {@link Object#equals} to determine
80 * comparator. All elements inserted into the multiset must be <i>mutually
81 * comparable</i> by the specified comparator: {@code comparator.compare(e1,
87 * @param comparator the comparator that will be used to sort this multiset. A
93 @Nullable Comparator<? super E> comparator) {
366 public Comparator<? super E> comparator() { method
560 Comparator<? super E> comparator = (Comparator<? super E>) stream.readObject(); local
[all...] |
| MinMaxPriorityQueue.java | 32 import java.util.Comparator;
44 * specified comparator. If no comparator is given at construction time, the
50 * the queue according to the queue's comparator. But unlike a regular priority
57 * removes its greatest element according to its comparator (which might be the
111 * MinMaxPriorityQueue} instances that use {@code comparator} to determine the
114 public static <B> Builder<B> orderedBy(Comparator<B> comparator) {
115 return new Builder<B>(comparator);
132 * removes its greatest element (according to its comparator), which might b
161 private final Comparator<B> comparator; field in class:MinMaxPriorityQueue.Builder
889 public Comparator<? super E> comparator() { method in class:MinMaxPriorityQueue
[all...] |
| BstOperations.java | 23 import java.util.Comparator;
41 Comparator<? super K> comparator, @Nullable N tree, @Nullable K key) {
42 checkNotNull(comparator);
46 int cmp = comparator.compare(key, tree.getKey());
51 return seek(comparator, tree.childOrNull(side), key);
69 Comparator<? super K> comparator, BstMutationRule<K, N> mutationRule, @Nullable N tree,
71 checkNotNull(comparator);
75 int cmp = comparator.compare(key, tree.getKey())
[all...] |
| ImmutableListMultimap.java | 28 import java.util.Comparator;
201 public Builder<K, V> orderKeysBy(Comparator<? super K> keyComparator) {
212 public Builder<K, V> orderValuesBy(Comparator<? super V> valueComparator) {
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableMultimap.java | 28 import java.util.Comparator;
138 Comparator<? super K> keyComparator, Multimap<K, V> multimap) {
168 Comparator<? super V> valueComparator;
243 public Builder<K, V> orderKeysBy(Comparator<? super K> keyComparator) {
255 public Builder<K, V> orderValuesBy(Comparator<? super V> valueComparator) {
|
| TreeMultiset.java | 26 import java.util.Comparator;
37 * their natural order or an explicit {@link Comparator}. In all cases, this
39 * Comparator#compare} instead of {@link Object#equals} to determine
76 * comparator. All elements inserted into the multiset must be <i>mutually
77 * comparable</i> by the specified comparator: {@code comparator.compare(e1,
83 * @param comparator the comparator that will be used to sort this multiset. A
89 @Nullable Comparator<? super E> comparator) {
362 public Comparator<? super E> comparator() { method
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| table_test.cc | 38 class ReverseKeyComparator : public Comparator {
66 static void Increment(const Comparator* cmp, std::string* key) {
77 // An STL comparator that uses a Comparator
80 const Comparator* cmp;
83 STLLessThan(const Comparator* c) : cmp(c) { }
143 explicit Constructor(const Comparator* cmp) : data_(STLLessThan(cmp)) { }
183 explicit BlockConstructor(const Comparator* cmp)
214 const Comparator* comparator_;
223 TableConstructor(const Comparator* cmp
[all...] |
| /external/guava/guava/src/com/google/common/primitives/ |
| Booleans.java | 32 import java.util.Comparator;
257 * Returns a comparator that compares two {@code boolean} arrays
264 * <p>The returned comparator is inconsistent with {@link
272 public static Comparator<boolean[]> lexicographicalComparator() {
276 private enum LexicographicalComparator implements Comparator<boolean[]> {
|
| Chars.java | 32 import java.util.Comparator;
376 * Returns a comparator that compares two {@code char} arrays
383 * <p>The returned comparator is inconsistent with {@link
391 public static Comparator<char[]> lexicographicalComparator() {
395 private enum LexicographicalComparator implements Comparator<char[]> {
|
| Doubles.java | 33 import java.util.Comparator;
319 * Returns a comparator that compares two {@code double} arrays
326 * <p>The returned comparator is inconsistent with {@link
334 public static Comparator<double[]> lexicographicalComparator() {
338 private enum LexicographicalComparator implements Comparator<double[]> {
|
| Floats.java | 33 import java.util.Comparator;
316 * Returns a comparator that compares two {@code float} arrays
323 * <p>The returned comparator is inconsistent with {@link
331 public static Comparator<float[]> lexicographicalComparator() {
335 private enum LexicographicalComparator implements Comparator<float[]> {
|
| Ints.java | 33 import java.util.Comparator;
384 * Returns a comparator that compares two {@code int} arrays
390 * <p>The returned comparator is inconsistent with {@link
398 public static Comparator<int[]> lexicographicalComparator() {
402 private enum LexicographicalComparator implements Comparator<int[]> {
|
| Longs.java | 32 import java.util.Comparator;
368 * Returns a comparator that compares two {@code long} arrays
375 * <p>The returned comparator is inconsistent with {@link
383 public static Comparator<long[]> lexicographicalComparator() {
387 private enum LexicographicalComparator implements Comparator<long[]> {
|
