| /external/chromium_org/tools/git/ |
| mass-rename.sh | 13 # 4) commit, then use tools/sort-headers.py to fix #include ordering:
14 # for f in $(git diff --name-only origin); do ./tools/sort-headers.py $f; done
|
| /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/clang/utils/ |
| find-unused-diagnostics.sh | 15 comm -23 <(sort -u <<< "$ALL_DIAGS") <(sort -u <<< "$DIAGS_IN_SOURCES")
|
| /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>());
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_libc.py | 21 def sort(a, b): function in function:LibTest.test_qsort
25 lib.my_qsort(chars, len(chars)-1, sizeof(c_char), comparefunc(sort))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_libc.py | 21 def sort(a, b): function in function:LibTest.test_qsort
25 lib.my_qsort(chars, len(chars)-1, sizeof(c_char), comparefunc(sort))
|
| /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/chromium/chrome/browser/resources/net_internals/ |
| timelineviewpainter.js | 10 addTextNode(node, 'TODO(eroman): Draw some sort of waterfall.');
|
| /external/chromium_org/tools/code_coverage/third_party/ |
| README.chromium | 11 Click on the headers to sort
|
| /external/chromium_org/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);
|
| /external/chromium_org/v8/test/webkit/ |
| array-sort-reentrance.js | 25 "This tests that a call to array.sort(compareFunction) does not crash from within a sort comparison function."
36 numbers1.sort(compareFn1);
40 numbers2.sort(compareFn2);
|
| /external/libvpx/libvpx/tools/ |
| author_first_release.sh | 15 done | sort -k2 | uniq -f2
|
| /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
|
