| /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/oprofile/pp/ |
| opreport_options.cpp | 59 vector<string> sort; member in namespace:__anon10214
75 popt::option(sort, "sort", 's',
76 "sort by", "sample,image,app-name,symbol,debug,vma"),
77 popt::option(options::reverse_sort, "reverse-sort", 'r',
78 "use reverse sort"),
117 if (options::xml && !sort.empty()) {
118 cerr << "warning: sort options ignored because they "
122 sort.clear();
125 if (sort.empty() || options::xml)
[all...] |
| /external/compiler-rt/make/ |
| lib_info.mk | 18 AvailableModules := $(sort $(foreach key,$(SubDirKeys),\
25 AvailableArchs := $(sort $(foreach key,$(SubDirKeys),\
28 AvailableFunctions := $(sort $(foreach key,$(SubDirKeys),\
31 CommonFunctions := $(sort\
40 $(call Append,ArchFunctions.$(arch),$(sort \
45 $(call Set,ArchFunctions.$(arch),$(sort $(ArchFunctions.$(arch))))\
|
| /ndk/sources/host-tools/make-3.81/tests/scripts/functions/ |
| sort | 2 ."the ability of make to sort lists of object. Sort\n"
7 ."and includes some duplicates. Make should sort all of the elements\n"
31 ."\t\@echo \$(sort \$(bar2) \$(foo) \$(addsuffix \$(s1), \$(bar) ) \$(t2) \$(bar2) \$(bar3))\n"
32 ."\t\@echo \$(sort \$(blank) \$(foo) \$(bar2) \$(t1) \$(p1) )\n"
33 ."\t\@echo \$(sort \$(foo) \$(bar2) \$(t1) \$(t4) \$(t5) \$(t7) \$(t6) )\n";
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/Array/ |
| regress-130451.js | 38 * SUMMARY: Array.prototype.sort() should not (re-)define .length
43 * NOTE: The sort function is intentionally generic; it does not require that
45 * other kinds of objects for use as a method. Whether the sort function can
55 var summary = 'Array.prototype.sort() should not (re-)define .length';
67 * First: test Array.prototype.sort() on Array objects
72 actual = arr.sort(cmp).length;
79 actual = arr.sort(cmp).length;
87 actual = arr.sort(cmp).length;
97 arr.sort(cmp);
124 * Now test Array.prototype.sort() on non-Array object
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Array/ |
| regress-178722.js | 38 * SUMMARY: arr.sort() should not output |undefined| when |arr| is empty
41 * ECMA-262 Ed.3: 15.4.4.11 Array.prototype.sort (comparefn)
50 * Note that sort() is done in-place on |arr|. In other words, sort() is a
52 * of |arr.sort()| and |arr| are the same object.
54 * If |arr| is an empty array, the return value of |arr.sort()| should be
61 var summary = 'arr.sort() should not output |undefined| when |arr| is empty';
83 arr = arr1.sort();
89 arr = arr2.sort();
95 arr = arr3.sort();
[all...] |
| /external/bluetooth/glib/gio/ |
| abicheck.sh | 8 cpp -DINCLUDE_VARIABLES -P $INCLUDES -DALL_FILES ${srcdir:-.}/gio.symbols | sed -e '/^$/d' -e 's/ G_GNUC.*$//' -e 's/ PRIVATE$//' | sort > expected-abi
11 nm -D -g --defined-only .libs/libgio-2.0.so | cut -d ' ' -f 3 | sort > actual-abi
|
| /external/bluetooth/glib/gobject/ |
| abicheck.sh | 8 cpp -DINCLUDE_VARIABLES -P $INCLUDES -DALL_FILES ${srcdir:-.}/gobject.symbols | sed -e '/^$/d' -e 's/ G_GNUC.*$//' -e 's/ PRIVATE$//' | sort > expected-abi
11 nm -D -g --defined-only .libs/libgobject-2.0.so | cut -d ' ' -f 3 | sort > actual-abi
|
| /external/icu4c/test/perf/collationperf/ |
| readme.html | 18 <LI>Sort Key generation. Report on key lengths and key generation times.
21 <LI>Quick Sort. Report the time required to sort the file in memory, using the C library qsort function. The file
22 order is randomized prior to the sort.
53 -level n Sort level, 1 to 5, for Primary, Secndary, Tertiary, Quaternary, Identical
55 -keygen Sort Key Generation timing test
72 Sort Key Generation: total # of keys = 197704<BR>
73 Sort Key Generation: time per key = 4253 ns<BR>
|
| /external/icu4c/tools/genren/ |
| Makefile | 87 sorts: urename.sort urename.old.sort
89 @echo "Try 'diff --side-by-side urename.old.sort urename.sort'"
91 urename.sort: urename.h
92 sort urename.h > $@
94 urename.old.sort: $(top_srcdir)/common/unicode/urename.h
95 sort $(top_srcdir)/common/unicode/urename.h > $@
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| StandardSorter.java | 25 public void sort(Object[] array, int count, Comparator comparator) { method in class:StandardSorter
26 Arrays.sort(array, 0, count, comparator);
|
| /external/stlport/test/unit/ |
| bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
43 sort(array, array + 4, not2(greater<int>()));
|
| greater_test.cpp | 34 sort(array, array + 4, greater<int>() );
44 sort(array, array + 4, greater_equal<int>());
|
| less_test.cpp | 34 sort(array, array + 4, less<int>());
44 sort(array, array + 4, less_equal<int>());
|
| /external/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...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
43 sort(array, array + 4, not2(greater<int>()));
|
| greater_test.cpp | 34 sort(array, array + 4, greater<int>() );
44 sort(array, array + 4, greater_equal<int>());
|
| less_test.cpp | 34 sort(array, array + 4, less<int>());
44 sort(array, array + 4, less_equal<int>());
|
| /ndk/tests/device/test-stlport/unit/ |
| bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
43 sort(array, array + 4, not2(greater<int>()));
|
| greater_test.cpp | 34 sort(array, array + 4, greater<int>() );
44 sort(array, array + 4, greater_equal<int>());
|
| less_test.cpp | 34 sort(array, array + 4, less<int>());
44 sort(array, array + 4, less_equal<int>());
|
| /external/chromium/chrome/browser/resources/net_internals/ |
| timelineviewpainter.js | 10 addTextNode(node, 'TODO(eroman): Draw some sort of waterfall.');
|
| /external/llvm/test/Linker/ |
| module-flags-2-a.ll | 1 ; RUN: llvm-link %s %p/module-flags-2-b.ll -S -o - | sort | FileCheck %s
|
| /external/proguard/src/proguard/classfile/editor/ |
| ClassMemberSorter.java | 41 // Sort the fields.
42 Arrays.sort(programClass.fields, 0, programClass.u2fieldsCount, this);
44 // Sort the methods.
45 Arrays.sort(programClass.methods, 0, programClass.u2methodsCount, this);
|
| /external/v8/test/mjsunit/regress/ |
| regress-1360.js | 28 // Check the receiver for the sort and replace functions to
29 // Array.prototype.sort and String.prototype.replace.
35 [1,2,3].sort(strict);
36 [1,2,3].sort(non_strict);
|
