| /external/linux-tools-perf/util/ |
| generate-cmdlist.sh | 15 sort |
|
| /external/llvm/test/Linker/ |
| module-flags-3-a.ll | 1 ; RUN: llvm-link %s %p/module-flags-3-b.ll -S -o - | sort | FileCheck %s
|
| /external/llvm/test/Transforms/MergeFunc/ |
| fold-weak.ll | 6 ; This test is off for a bit as we change this particular sort of folding to
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| duplicate-phis.ll | 3 ; instcombine should sort the PHI operands so that simplifycfg can see the
|
| /external/lzma/CPP/7zip/UI/Common/ |
| SortUtils.cpp | 21 indices.Sort(CompareStrings, (void *)&strings);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/sort/ |
| sort.pass.cpp | 16 // sort(Iter first, Iter last);
33 std::sort(save, save+len);
89 std::sort(array, array+N);
93 std::sort(array, array+N);
96 std::sort(array, array+N);
100 std::sort(array, array+N);
104 std::sort(array, array+N);
109 std::sort(array, array+N);
132 std::sort(&d, &d);
|
| /packages/apps/UnifiedEmail/src/org/apache/commons/io/comparator/ |
| DefaultFileComparator.java | 26 * This comparator can be used to sort lists or arrays of files
33 * Collections.sort(list, DefaultFileComparator.DEFAULT_COMPARATOR);
36 * Example of doing a <i>reverse</i> sort of an array of files using the
40 * Arrays.sort(array, DefaultFileComparator.DEFAULT_REVERSE);
|
| LastModifiedFileComparator.java | 27 * This comparator can be used to sort lists or arrays of files
34 * Collections.sort(list, LastModifiedFileComparator.LASTMODIFIED_COMPARATOR);
37 * Example of doing a <i>reverse</i> sort of an array of files using the
41 * Arrays.sort(array, LastModifiedFileComparator.LASTMODIFIED_REVERSE);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| sort.h | 25 /** @file parallel/sort.h
70 * @tparam __stable Sort stable.
94 * @tparam __stable Sort stable.
115 * @tparam __stable Sort stable.
135 * @tparam __stable Sort stable.
156 * @tparam __stable Sort stable.
178 * @tparam __stable Sort stable.
198 * @tparam __stable Sort stable.
234 __gnu_sequential::sort(__begin, __end, __comp);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_idioms.py | 14 v.sort()
20 v.sort()
55 sort=
58 trailer< '.' 'sort' > trailer< '(' ')' >
68 sort=
71 trailer< '.' 'sort' > trailer< '(' ')' >
81 # If we've matched one of the sort/sorted subpatterns above, we
83 # subsequent .sort() call involve different identifiers.
117 sort_stmt = results["sort"]
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_idioms.py | 14 v.sort()
20 v.sort()
55 sort=
58 trailer< '.' 'sort' > trailer< '(' ')' >
68 sort=
71 trailer< '.' 'sort' > trailer< '(' ')' >
81 # If we've matched one of the sort/sorted subpatterns above, we
83 # subsequent .sort() call involve different identifiers.
117 sort_stmt = results["sort"]
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| where9.test | 29 lappend r scan [db status step] sort [db status sort]
169 } {90 91 92 96 97 99 scan 0 sort 1}
178 } {90 91 92 96 97 99 scan 98 sort 0}
187 } {90 91 92 96 97 99 scan 98 sort 0}
196 } {90 91 92 96 97 99 scan 98 sort 0}
205 } {90 91 92 96 97 99 scan 98 sort 0}
215 } {90 91 92 97 scan 0 sort 1}
224 } {90 91 92 97 scan 98 sort 0}
233 } {90 91 92 97 scan 98 sort 0
[all...] |
| boundary1.tcl | 71 # A simple selection sort. Not trying to be efficient.
73 proc sort {inlist} { procedure
180 puts "\175 {[sort $aset]}"
187 puts "\175 {[reverse [sort $aset]]}"
191 foreach rx [sort $rset] {
202 foreach rx [reverse [sort $rset]] {
217 foreach x [sort $xset] {
236 foreach rx [sort $rset] {
247 foreach rx [reverse [sort $rset]] {
265 foreach rx [sort $rset]
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| ElemSort.java | 30 * Implement xsl:sort.
32 * <!ELEMENT xsl:sort EMPTY>
33 * <!ATTLIST xsl:sort
40 * <!-- xsl:sort cannot occur after any other elements or
51 * xsl:sort has a select attribute whose value is an expression.
58 * xsl:sort has a select attribute whose value is an expression.
64 * sort key for that node. The default value of the select attribute
66 * be used as the sort key.
81 * xsl:sort has a select attribute whose value is an expression.
87 * sort key for that node. The default value of the select attribut
[all...] |
| /external/chromium_org/chrome/browser/resources/net_internals/ |
| events_view.js | 78 // Sets sort order and filter.
95 EventsView.SORT_BY_ID_ID = 'events-view-sort-by-id';
96 EventsView.SORT_BY_SOURCE_TYPE_ID = 'events-view-sort-by-source';
97 EventsView.SORT_BY_DESCRIPTION_ID = 'events-view-sort-by-description';
165 sourceEntries.sort(this.comparisonFuncWithReversing_.bind(this));
185 this.pickSortFunction_(filterParser.sort);
200 * Given a "sort" object with "method" and "backwards" keys, looks up and
202 * correspond to a sort function, defaults to sorting by ID.
204 pickSortFunction_: function(sort) {
205 this.doSortBackwards_ = sort.backwards
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| ArraysTest.java | 1735 private void sort(Object array) { method in class:ArraysTest
[all...] |
| /external/chromium/base/i18n/ |
| file_util_icu.h | 31 // used to sort directory listings. It behaves like "operator<" for use in
32 // std::sort.
|
| /external/chromium_org/ash/wm/ |
| window_properties.h | 26 // Alphabetical sort.
41 // Alphabetical sort.
|
| /external/chromium_org/chrome/browser/history/ |
| page_usage_data.h | 68 // Sort predicate to sort instances by score (high to low)
|
| /external/chromium_org/net/dns/ |
| address_sorter.h | 18 // connection. Depending on the platform, the sort could be performed
31 virtual void Sort(const AddressList& list,
|
| address_sorter_unittest.cc | 40 TEST(AddressSorterTest, Sort) {
60 sorter->Sort(list, base::Bind(&OnSortComplete, &result,
|
| /external/chromium_org/remoting/base/ |
| capabilities.cc | 24 std::sort(client_caps.begin(), client_caps.end());
28 std::sort(host_caps.begin(), host_caps.end());
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| escoll.h | 9 * specific primary and tertiary rules. This Spanish sort uses the traditional
10 * sorting sequence. The Spanish modern sorting sequence does not sort
|
| thcoll.h | 40 * Odd corner conditions taken from "How to Sort Thai Without Rewriting Sort",
|
| /external/chromium_org/third_party/icu/source/tools/genren/ |
| README | 17 diff --side-by-side urename.sort urename.old.sort | more
|
