| /external/oprofile/libpp/ |
| symbol_sort.h | 22 // order give sort order if caller doesn't specify one
39 * Sort the given container by the given criteria.
41 void sort(symbol_collection & syms, bool reverse_sort,
45 * Sort the given container by the given criteria.
47 void sort(diff_collection & syms, bool reverse_sort,
|
| /external/chromium_org/courgette/ |
| analyze_mem_test | 21 | sort -n \
62 | sort -nr \
64 done | sort -k2 -n > "${metrics_tmp}"
84 | sort -nr \
86 done | sort -k2 -n > "${metrics_bsdiff_tmp}"
|
| /external/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
| Android.mk | 17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/Android.mk
19 test_name := algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until
23 test_name := algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp
27 test_name := algorithms/alg.sorting/alg.sort/is.sorted/is_sorted
31 test_name := algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until_comp
|
| /external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| Android.mk | 17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/Android.mk
19 test_name := algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap
23 test_name := algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp
|
| /external/libpng/scripts/ |
| dfn.awk | 21 sort=0 # sort the output
34 sort=0+$2
39 # Do a very simple, slow, sort; notice that blank lines won't be
59 sort=0
179 if (sort) {
180 if (split(line, parts) < sort) {
181 print "line", lineno ": missing sort field:", line
184 array[parts[sort]] = line
|
| /external/clang/test/CXX/temp/temp.spec/temp.explicit/ |
| p2.cpp | 8 template<class T> void sort(Array<T>& v) { /* ... */ } function
9 template void sort(Array<char>&);
|
| /external/libcxx/test/containers/sequences/list/list.ops/ |
| sort.pass.cpp | 12 // void sort();
25 c1.sort();
33 c1.sort();
|
| sort_comp.pass.cpp | 12 // template <class Compare> sort(Compare comp);
26 c1.sort(std::greater<int>());
34 c1.sort(std::greater<int>());
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| boundary2.tcl | 71 # A simple selection sort. Not trying to be efficient.
73 proc sort {inlist} {
181 puts "\175 {[sort $aset]}"
188 puts "\175 {[reverse [sort $aset]]}"
192 foreach rx [sort $rset] {
203 foreach rx [reverse [sort $rset]] {
218 foreach x [sort $xset] {
237 foreach rx [sort $rset] {
248 foreach rx [reverse [sort $rset]] {
266 foreach rx [sort $rset]
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| Type.java | 45 * The sort of the <tt>void</tt> type. See {@link #getSort getSort}.
50 * The sort of the <tt>boolean</tt> type. See {@link #getSort getSort}.
55 * The sort of the <tt>char</tt> type. See {@link #getSort getSort}.
60 * The sort of the <tt>byte</tt> type. See {@link #getSort getSort}.
65 * The sort of the <tt>short</tt> type. See {@link #getSort getSort}.
70 * The sort of the <tt>int</tt> type. See {@link #getSort getSort}.
75 * The sort of the <tt>float</tt> type. See {@link #getSort getSort}.
80 * The sort of the <tt>long</tt> type. See {@link #getSort getSort}.
85 * The sort of the <tt>double</tt> type. See {@link #getSort getSort}.
90 * The sort of array reference types. See {@link #getSort getSort}.
151 private final int sort; field in class:Type
[all...] |
| /external/chromium_org/third_party/icu/source/config/ |
| gmakever.mk | 19 latest_a=$(firstword $(sort $(MAKE_VERSION) $(at_least)))
|
| /external/compiler-rt/lib/dfsan/scripts/ |
| check_custom_wrappers.sh | 20 | sed "s/^fun:\(.*\)=custom.*/\1/" | sort ) \
23 | sort) > ${DIFFOUT}
34 | sort) \
37 | sort) > ${DIFFOUT}
|
| /external/icu/icu4c/source/config/ |
| gmakever.mk | 19 latest_a=$(firstword $(sort $(MAKE_VERSION) $(at_least)))
|
| /external/libedit/src/ |
| makelist | 152 sort | tr '[a-z]' '[A-Z]' | $AWK '
173 cat $FILES | $AWK '/el_action_t/ { print $3 }' | sort | $AWK '
|
| /dalvik/dx/src/com/android/dx/cf/direct/ |
| ClassPathOpener.java | 44 * If true, sort such that classes appear before their inner
48 private final boolean sort; field in class:ClassPathOpener
109 * @param sort if true, sort such that classes appear before their inner
114 public ClassPathOpener(String pathname, boolean sort, Consumer consumer) {
115 this(pathname, sort, acceptAll, consumer);
122 * @param sort if true, sort such that classes appear before their inner
127 public ClassPathOpener(String pathname, boolean sort, FileNameFilter filter,
130 this.sort = sort
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 35 /** Test topo sort in GraphNode. */
53 List nodes = g.sort();
67 List nodes = g.sort();
81 List nodes = g.sort();
95 List nodes = g.sort();
109 List nodes = g.sort();
|
| /cts/tools/signature-tools/src/signature/io/html/ |
| ClassOverviewPage.java | 99 Collections.sort(removedFields, fieldComparator);
103 Collections.sort(addedFields, fieldComparator);
107 Collections.sort(changedFields, fieldComparator);
113 Collections.sort(removedAnnotationFields, annotationfieldComparator);
117 Collections.sort(addedAnnotationFields, annotationfieldComparator);
121 Collections.sort(changedAnnotationFields, annotationfieldComparator);
127 Collections.sort(removedEnumConstants, enumConstantComparator);
131 Collections.sort(addedEnumConstants, enumConstantComparator);
135 Collections.sort(changedEnumConstants, enumConstantComparator);
141 Collections.sort(removedConstructors, constructorComparator)
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| array-sort.js | 30 // Test array sort.
36 // Default sort converts each element to string and orders
38 a.sort();
40 // Sort numbers by value using a compare functions.
41 a.sort(function(x, y) { return x - y; });
44 // Default sort on negative numbers.
46 a.sort();
49 // Default sort on negative and non-negative numbers.
51 a.sort();
55 a = [9, 1000000000].sort();
[all...] |
| /external/chromium_org/remoting/base/ |
| capabilities.cc | 25 std::sort(client_caps.begin(), client_caps.end());
29 std::sort(host_caps.begin(), host_caps.end());
|
| /external/chromium_org/third_party/closure_linter/closure_linter/ |
| strict_test.py | 62 error_nums.sort()
63 expected_errors.sort()
|
| /external/chromium_org/third_party/lcov/contrib/galaxy/ |
| gen_makefile.sh | 29 echo RING1_DEPS:=`find $RING1 -name '*.c.*' | sed 's/\.c.*/-all.ps/' | sort | uniq`
30 echo RING4_DEPS:=`find $RING4 -name '*.c.*' | sed 's/\.c.*/-all.ps/' | sort | uniq`
98 echo "%-ring2.weight:" `find $RING2 -name '*.c.*' | sed 's/\.c.*/-all.ps/' | sort | uniq`
100 echo "%-ring3.weight:" `find $RING3 -name '*.c.*' | sed 's/\.c.*/-all.ps/' | sort | uniq`
|
| /external/chromium_org/third_party/skia/experimental/webtry/ |
| build | 16 find core effects pathops -maxdepth 1 -name "*.h" | sed "s#^[^\/]*\/##g" | sed "s/\(.*\)/#include \"\1\"/" | sort > ${WEBTRY_ROOT}/templates/template.cpp
|
| /external/chromium_org/tools/valgrind/ |
| fixed_suppressions.sh | 7 sed -e 's/bug_//' | sort -n | uniq);
|
| /external/ipsec-tools/src/racoon/ |
| stats.pl | 13 foreach (sort keys %t) {
|
| /external/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);
|
