| /frameworks/base/core/java/android/service/autofill/ |
| FieldClassification.java | 43 Collections.sort(mMatches, new Comparator<Match>() {
|
| /frameworks/base/services/tests/servicestests/src/com/android/server/ |
| AlarmManagerServiceTest.java | 70 alarms.sort((a, b) -> ObjectUtils.compare(a.packageName, b.packageName));
|
| /frameworks/base/services/tests/uiservicestests/src/com/android/server/notification/ |
| GlobalSortKeyComparatorTest.java | 82 Collections.sort(actual, new GlobalSortKeyComparator());
112 Collections.sort(actual, new GlobalSortKeyComparator());
142 Collections.sort(actual, new GlobalSortKeyComparator());
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| RelocData.h | 91 void sort(Comparator pComparator) { function in class:mcld::RelocData
92 mcld::sort(m_Relocations, pComparator);
|
| /frameworks/support/v7/recyclerview/src/androidTest/java/androidx/recyclerview/widget/ |
| GapWorkerTest.java | 93 Collections.sort(list, GapWorker.sTaskComparator);
110 Collections.sort(list, GapWorker.sTaskComparator);
133 Collections.sort(list, GapWorker.sTaskComparator);
164 Collections.sort(list, GapWorker.sTaskComparator);
|
| /packages/apps/Contacts/src/com/android/contacts/model/account/ |
| AccountInfo.java | 129 Collections.sort(accounts, sourceComparator(defaultAccount));
|
| /packages/apps/Messaging/src/com/android/messaging/datamodel/ |
| FrequentContactsCursorBuilder.java | 135 // Therefore, sort all the rows according to their actual ranks in the frequents list.
136 Collections.sort(rows, new Comparator<Object[]>() {
163 // Use the default sort order, i.e. sort by phoneType value.
|
| /packages/apps/Settings/src/com/android/settings/fuelgauge/batterytip/detectors/ |
| HighUsageDetector.java | 98 Collections.sort(mHighUsageAppList, Collections.reverseOrder());
|
| /packages/apps/SettingsIntelligence/src/com/android/settings/intelligence/suggestions/ranking/ |
| SuggestionRanker.java | 84 Collections.sort(rankedSuggestions, suggestionComparator);
|
| /packages/apps/TV/partner_support/src/com/google/android/tv/partner/support/ |
| TunerSetupUtils.java | 44 // sort in decreasing order
45 Collections.sort(
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| heapq.py | 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
218 result.sort(reverse=True)
236 result.sort()
290 # The total compares needed by list.sort() on the same lists were 8627,
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficien
474 sort = [] variable
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| heapq.py | 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
218 result.sort(reverse=True)
236 result.sort()
290 # The total compares needed by list.sort() on the same lists were 8627,
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficien
474 sort = [] variable
[all...] |
| /prebuilts/go/darwin-x86/src/compress/flate/ |
| huffman_code.go | 10 "sort"
261 h.lns.sort(chunk)
306 h.lfs.sort(list)
316 func (s *byLiteral) sort(a []literalNode) { func
318 sort.Sort(s)
331 func (s *byFreq) sort(a []literalNode) { func
333 sort.Sort(s)
|
| /prebuilts/go/linux-x86/src/compress/flate/ |
| huffman_code.go | 10 "sort"
261 h.lns.sort(chunk)
306 h.lfs.sort(list)
316 func (s *byLiteral) sort(a []literalNode) { func
318 sort.Sort(s)
331 func (s *byFreq) sort(a []literalNode) { func
333 sort.Sort(s)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| heapq.py | 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
218 result.sort(reverse=True)
236 result.sort()
290 # The total compares needed by list.sort() on the same lists were 8627,
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficien
474 sort = [] variable
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| heapq.py | 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
218 result.sort(reverse=True)
236 result.sort()
290 # The total compares needed by list.sort() on the same lists were 8627,
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficien
474 sort = [] variable
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| MixedItemSection.java | 46 /** sort by type only */
49 /** sort in class-major order, with instances sorted per-class */
69 /** {@code non-null;} how to sort the items */
70 private final SortType sort; field in class:MixedItemSection
86 * @param sort how the items should be sorted in the final output
89 SortType sort) {
94 this.sort = sort;
296 switch (sort) {
298 Collections.sort(items)
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| IntList.java | 265 // sort status is unchanged
357 public void sort() { method in class:IntList
361 Arrays.sort(values, 0, size);
444 * @see #sort
|
| /dalvik/dx/src/com/android/dx/dex/file/ |
| MixedItemSection.java | 45 /** sort by type only */
48 /** sort in class-major order, with instances sorted per-class */
69 /** {@code non-null;} how to sort the items */
70 private final SortType sort; field in class:MixedItemSection
86 * @param sort how the items should be sorted in the final output
89 SortType sort) {
94 this.sort = sort;
296 switch (sort) {
298 Collections.sort(items)
[all...] |
| /dalvik/dx/src/com/android/dx/util/ |
| IntList.java | 265 // sort status is unchanged
357 public void sort() { method in class:IntList
361 Arrays.sort(values, 0, size);
445 * @see #sort
|
| /external/emma/core/java12/com/vladium/emma/report/ |
| AbstractReportGenerator.java | 122 final IntVector sort = new IntVector (); local
128 sort.add (userSort [c]);
129 sort.add (userSort [c + 1]);
133 m_settings.setSortOrder (sort.values ());
246 protected ItemComparator [] m_typeSortComparators; // m_typeSortComparators [t] is a comparator representing the sort order for item type t
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| CollationThreadTest.java | 140 sort(temporaryData, collator); method
153 private static void sort(String[] data, Collator collator) { method in class:CollationThreadTest
154 Arrays.sort(data, collator);
216 sort(this.data, this.collator); method
218 control.fail(name + ": incorrect sort");
|
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| CollationThreadTest.java | 137 sort(temporaryData, collator); method
150 private static void sort(String[] data, Collator collator) { method in class:CollationThreadTest
151 Arrays.sort(data, collator);
213 sort(this.data, this.collator); method
215 control.fail(name + ": incorrect sort");
|
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| ClassTable.java | 48 // Straight insertion sort from Knuth vol. III, pg. 81
50 public static void sort(ClassEntry[] table, Vector unsorted) method in class:ClassTable.ClassEntry
166 ClassEntry.sort(classTable, classMap);
|
| DecompTable.java | 74 // Straight insertion sort from Knuth vol. III, pg. 81
76 public static void sort(DecompEntry[] table, Vector decompVector) method in class:DecompTable.DecompEntry
141 DecompEntry.sort(decompEntries, decompVector);
|
