| /external/chromium_org/third_party/mesa/src/src/gallium/tools/ |
| addr2line.sh | 10 sed -nre 's|([^ ]*/[^ ]*)\(\+0x([^)]*).*|\1 \2|p' "$input"|sort|uniq|while read bin addr; do
|
| /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/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/clang/test/SemaTemplate/ |
| instantiate-field.cpp | 76 typename Requires_< BidirectionalIterator<RanIter>::value >::type sort(RanIter,RanIter){} function in namespace:PR7123
81 sort(x,x);
|
| /external/dropbear/libtomcrypt/ |
| genlist.sh | 3 export a=`echo -n "src/ciphers/aes/aes_enc.o " ; find . -type f | sort | grep "[.]/src" | grep "[.]c" | grep -v "sha224" | grep -v "sha384" | grep -v "aes_tab" | grep -v "twofish_tab" | grep -v "whirltab" | grep -v "dh_sys" | grep -v "ecc_sys" | grep -v "mpi[.]c" | grep -v "sober128tab" | sed -e 'sE\./EE' | sed -e 's/\.c/\.o/' | xargs`
|
| /external/mesa3d/src/gallium/tools/ |
| addr2line.sh | 10 sed -nre 's|([^ ]*/[^ ]*)\(\+0x([^)]*).*|\1 \2|p' "$input"|sort|uniq|while read bin addr; do
|
| /external/smali/baksmali/src/main/java/org/jf/baksmali/ |
| dump.java | 39 public static void dump(DexFile dexFile, String dumpFileName, String outputDexFileName, boolean sort)
42 if (sort) {
43 //sort all items, to guarantee a unique ordering
|
| /external/stlport/test/unit/ |
| func_test.cpp | 59 sort(v.begin(), v.end(), bigger_than);
71 sort(v.begin(), v.end(), greater<int>());
|
| /libcore/ |
| run-libcore-tests | 13 xargs grep -h '^package ' | sed 's/^package //' | sed 's/;$//' | sort | uniq | tr "\n" " ")
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| inplace_merge.pass.cpp | 32 std::sort(ia, ia+M);
33 std::sort(ia+M, ia+N);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/sort/ |
| sort_comp.pass.cpp | 16 // sort(Iter first, Iter last, Compare comp);
40 std::sort(v.begin(), v.end(), std::greater<int>());
50 std::sort(v.begin(), v.end(), indirect_less());
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| func_test.cpp | 59 sort(v.begin(), v.end(), bigger_than);
71 sort(v.begin(), v.end(), greater<int>());
|
| /ndk/tests/device/test-stlport/unit/ |
| func_test.cpp | 59 sort(v.begin(), v.end(), bigger_than);
71 sort(v.begin(), v.end(), greater<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))
|
| /external/chromium_org/third_party/icu/source/common/ |
| rbbicst.pl | 211 foreach $setName (sort keys %charClasses) {
258 foreach $act (sort keys %actions) {
267 foreach $setName (sort keys %charClasses) {
361 foreach $setName (sort keys %charClasses) {
373 foreach $act (sort keys %actions) {
|
| /external/chromium_org/tools/perf_expectations/ |
| update_perf_expectations_unittest.py | 79 actual_list.sort()
104 actual_list.sort()
118 actual_list.sort()
133 actual_list.sort()
161 actual_list.sort()
|
| /external/icu4c/common/ |
| rbbicst.pl | 211 foreach $setName (sort keys %charClasses) {
258 foreach $act (sort keys %actions) {
267 foreach $setName (sort keys %charClasses) {
361 foreach $setName (sort keys %charClasses) {
373 foreach $act (sort keys %actions) {
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-326.js | 29 // Should sort non-array into equivalent of [37,42,undefined,,0]
32 Array.prototype.sort.call(nonArray);
35 assertEquals(37, nonArray[0], "sort smallest first");
36 assertEquals(42, nonArray[1], "sort largest last");
38 assertEquals(undefined, nonArray[2], "sort undefined after largest");
|
| /external/v8/test/mjsunit/regress/ |
| regress-326.js | 29 // Should sort non-array into equivalent of [37,42,undefined,,0]
32 Array.prototype.sort.call(nonArray);
35 assertEquals(37, nonArray[0], "sort smallest first");
36 assertEquals(42, nonArray[1], "sort largest last");
38 assertEquals(undefined, nonArray[2], "sort undefined after largest");
|
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| MixedItemSection.java | 46 /** sort by type only */
49 /** sort in class-major order, with instances sorted per-class */
69 /** {@code non-null;} how to sort the items */
70 private final SortType sort; field in class:MixedItemSection
86 * @param sort how the items should be sorted in the final output
89 SortType sort) {
94 this.sort = sort;
296 switch (sort) {
298 Collections.sort(items)
[all...] |
| /dalvik/dx/src/com/android/dx/dex/file/ |
| MixedItemSection.java | 45 /** sort by type only */
48 /** sort in class-major order, with instances sorted per-class */
68 /** {@code non-null;} how to sort the items */
69 private final SortType sort; field in class:MixedItemSection
85 * @param sort how the items should be sorted in the final output
88 SortType sort) {
93 this.sort = sort;
295 switch (sort) {
297 Collections.sort(items)
[all...] |
| /external/chromium_org/net/base/ |
| directory_lister.cc | 76 // Sort the results. See the TODO below (this sort should be removed and we
79 std::sort(data->begin(), data->end(), CompareDate);
81 std::sort(data->begin(), data->end(), CompareFullPath);
83 std::sort(data->begin(), data->end(), CompareAlphaDirsFirst);
100 SortType sort,
102 : core_(new Core(dir, recursive, sort, this)),
122 SortType sort,
126 sort_(sort),
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
| MixedItemSection.java | 46 /** sort by type only */
49 /** sort in class-major order, with instances sorted per-class */
69 /** {@code non-null;} how to sort the items */
70 private final SortType sort; field in class:MixedItemSection
86 * @param sort how the items should be sorted in the final output
89 SortType sort) {
94 this.sort = sort;
296 switch (sort) {
298 Collections.sort(items)
[all...] |
| /external/v8/test/mjsunit/ |
| testcfg.py | 131 mjsunit.sort()
132 regress.sort()
133 bugs.sort()
134 third_party.sort()
135 tools.sort()
136 compiler.sort()
137 harmony.sort()
|
