| /frameworks/av/media/libmedia/ |
| StringArray.cpp | 29 // An expanding array of strings. Add, get, sort, delete.
86 // Sort the array.
88 void StringArray::sort(int (*compare)(const void*, const void*)) { function in class:android::StringArray
93 // Pass this to the sort routine to do an ascending alphabetical sort.
|
| /frameworks/base/media/java/android/media/ |
| Utils.java | 47 Arrays.sort(ranges, new Comparator<Range<T>>() {
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| ilist_sort.h | 22 void sort(llvm::iplist<T, Alloc>& xs, size_t size, Comparator is_less_than) { function in namespace:mcld::detail
53 // Sort the xs and ys recursively.
54 sort(xs, mid, is_less_than);
55 sort(ys, size - mid, is_less_than);
77 void sort(llvm::iplist<T, Alloc>& list, function in namespace:mcld
79 detail::sort(list, list.size(), is_less_than);
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| ListDefaultMethodTester.java | 45 l.sort((v1, v2) -> v1.compareTo(v2));
|
| /libcore/metrictests/memory/apps/src/libcore/heapdumper/ |
| Actions.java | 39 * Uses a collator for the root locale to trivially sort some strings.
49 * Uses a collator for the US English locale to trivially sort some strings.
59 * Uses a collator for the Korean locale to trivially sort some strings.
73 Arrays.sort(strings, collator);
|
| /libcore/ojluni/src/test/java/time/test/java/time/chrono/ |
| TestChronoLocalDate.java | 103 Collections.sort(copy, ChronoLocalDate.timeLineOrder());
127 Collections.sort(copy, ChronoLocalDate.timeLineOrder());
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/distutils/ |
| filelist.py | 58 def sort(self): member in class:FileList
59 # Not a strict lexical sort!
61 sortable_files.sort()
|
| /prebuilts/gdb/linux-x86/lib/python2.7/distutils/ |
| filelist.py | 58 def sort(self): member in class:FileList
59 # Not a strict lexical sort!
61 sortable_files.sort()
|
| /prebuilts/go/darwin-x86/src/net/ |
| dnsclient.go | 9 "sort"
235 // sort reorders SRV records as specified in RFC 2782.
236 func (addrs byPriorityWeight) sort() { func
237 sort.Sort(addrs)
254 // byPref implements sort.Interface to sort MX records by preference
261 // sort reorders MX records as specified in RFC 5321.
262 func (s byPref) sort() { func
267 sort.Sort(s
[all...] |
| /prebuilts/go/darwin-x86/src/sort/ |
| zfuncversion.go | 1 // DO NOT EDIT; AUTO-GENERATED from sort.go using genzfunc.go
7 package sort package
9 // Auto-generated variant of sort.go:insertionSort
18 // Auto-generated variant of sort.go:siftDown
37 // Auto-generated variant of sort.go:heapSort
51 // Auto-generated variant of sort.go:medianOfThree
64 // Auto-generated variant of sort.go:swapRange
71 // Auto-generated variant of sort.go:doPivot
135 // Auto-generated variant of sort.go:quickSort
162 // Auto-generated variant of sort.go:stabl
[all...] |
| /prebuilts/go/linux-x86/src/net/ |
| dnsclient.go | 9 "sort"
235 // sort reorders SRV records as specified in RFC 2782.
236 func (addrs byPriorityWeight) sort() { func
237 sort.Sort(addrs)
254 // byPref implements sort.Interface to sort MX records by preference
261 // sort reorders MX records as specified in RFC 5321.
262 func (s byPref) sort() { func
267 sort.Sort(s
[all...] |
| /prebuilts/go/linux-x86/src/sort/ |
| zfuncversion.go | 1 // DO NOT EDIT; AUTO-GENERATED from sort.go using genzfunc.go
7 package sort package
9 // Auto-generated variant of sort.go:insertionSort
18 // Auto-generated variant of sort.go:siftDown
37 // Auto-generated variant of sort.go:heapSort
51 // Auto-generated variant of sort.go:medianOfThree
64 // Auto-generated variant of sort.go:swapRange
71 // Auto-generated variant of sort.go:doPivot
135 // Auto-generated variant of sort.go:quickSort
162 // Auto-generated variant of sort.go:stabl
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/ |
| filelist.py | 58 def sort(self): member in class:FileList
59 # Not a strict lexical sort!
61 sortable_files.sort()
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/ |
| filelist.py | 58 def sort(self): member in class:FileList
59 # Not a strict lexical sort!
61 sortable_files.sort()
|
| /art/test/925-threadgroups/src/art/ |
| Test925.java | 85 Collections.sort(threadList, THREAD_COMP);
87 Arrays.sort(groups, THREADGROUP_COMP);
|
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| RopMethod.java | 182 // Sort and immutablize all the predecessor lists.
186 preds.sort();
191 exitPredecessors.sort();
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| RopMethod.java | 181 // Sort and immutablize all the predecessor lists.
185 preds.sort();
190 exitPredecessors.sort();
|
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/ |
| ScanDetailCache.java | 121 // Sort by descending timestamp
122 Collections.sort(list, new Comparator() {
144 private ArrayList<ScanDetail> sort() { method in class:ScanDetailCache
147 Collections.sort(list, new Comparator() {
175 ArrayList<ScanDetail> list = sort();
|
| /libcore/ojluni/src/main/java/java/util/ |
| List.java | 417 // Android-changed: Warn about Collections.sort() being built on top
418 // of List.sort() rather than the other way round when targeting an
436 * Nougat (API level {@code > 25}), {@link Collections#sort(List)}
438 * {@link Collections#sort(List)} from this method. Instead, prefer
443 * public void sort(Comparator<? super E> c) {
445 * Arrays.sort(elements, c);
459 * to sort a linked list in place.)
475 * simply concatenate the arrays and sort the resulting array.
477 * <p>The implementation was adapted from Tim Peters's list sort for Python
498 default void sort(Comparator<? super E> c) method in interface:List
[all...] |
| /packages/apps/Camera2/src/com/android/camera/data/ |
| FilmstripItemList.java | 109 public void sort(Comparator<FilmstripItem> comparator) { method in class:FilmstripItemList
110 Collections.sort(mList, comparator);
|
| /cts/tools/cts-api-coverage/src/com/android/cts/apicoverage/ |
| XmlReport.java | 58 Collections.sort(packages, comparator);
75 Collections.sort(classes, comparator);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| 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
204 result.sort(reverse=True)
288 # The total compares needed by list.sort() on the same lists were 8627,
290 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
436 sort = [] variable
[all...] |
| /external/caliper/examples/src/main/java/examples/ |
| ArraySortBenchmark.java | 43 @Benchmark void sort(int reps) { method in class:ArraySortBenchmark
46 Arrays.sort(copy);
|
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| p1.cpp | 99 template<class T> void sort(Array<T>& v) { /* ... */ } function
100 template<> void sort<char*>(Array<char*>&) ;
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| ComparatorDelegationOverheadBenchmark.java | 27 * {@link Ordering#natural()}, as opposed to using the inlined {@link Arrays#sort(Object[])}
54 Arrays.sort(copy);
64 Arrays.sort(copy, Ordering.natural());
81 Arrays.sort(copy, Ordering.from(NATURAL_INTEGER));
|
