| /build/tools/ |
| print_module_licenses.sh | 2 find . -name MODULE_LICENSE_\* | sed 's/\/MODULE_LICENSE_/\ /' | sed 's/\.\///' | awk '{ print $2 " " $1; }' | sort
|
| /external/strace/ |
| syscallent.sh | 33 sort +1n | uniq |
|
| signalent.sh | 31 sort +1n |
|
| /cts/tools/dx-tests/etc/morescripts/ |
| countTests.sh | 20 egrep -R 'public void testN[0-9][0-9]?' * | grep ".java" | sed -e '/.svn/d' | sort | wc -l
23 egrep -R 'public void testB[0-9][0-9]?' * | grep ".java" | sed -e '/.svn/d' | sort | wc -l
26 egrep -R 'public void testE[0-9][0-9]?' * | grep ".java" | sed -e '/.svn/d' | sort | wc -l
29 egrep -R 'public void testVFE[0-9][0-9]?' * | grep ".java" | sed -e '/.svn/d' | sort | wc -l
|
| detailCount.sh | 23 for mypack in `find dxc -maxdepth 4 -mindepth 4 -name "Test_*.java" | sort`
|
| /external/webkit/JavaScriptCore/tests/mozilla/js1_5/Array/ |
| regress-157652.js | 38 * SUMMARY: Testing that Array.sort() doesn't crash on very large arrays
57 * We're just testing that we don't crash on Array.sort().
63 * when trying to sort such large arrays.
65 * We only want to test that we don't CRASH on the sort. So it will be OK
72 * to do the sort. Then this test will terminate with the normal exit code 0
81 * He explains that Rhino isn't actually hanging; it's doing the huge sort:
87 * > I'm getting a graceful OOM message on trying to sort certain large
92 * > Note below, I'm getting an instantaneous OOM error on arr.sort() for LEN
114 var summary = "Testing that Array.sort() doesn't crash on very large arrays";
126 a1.sort();
[all...] |
| 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/icu4c/config/ |
| gmakever.mk | 9 latest_a=$(firstword $(sort $(MAKE_VERSION) $(at_least)))
|
| /external/bluetooth/glib/tests/ |
| qsort-test.c | 11 sort (gconstpointer a, gconstpointer b, gpointer user_data) function
24 g_qsort_with_data (array, SIZE, sizeof (guint32), sort, NULL);
30 g_qsort_with_data (array, 0, sizeof (guint32), sort, NULL);
|
| /external/elfutils/tests/ |
| run-arsymtest.sh | 25 sort > $okfile
29 sort $tmpfile > $testfile
|
| /external/openssl/crypto/lhash/ |
| num.pl | 13 @a=sort {$a <=> $b } keys %num;
|
| /external/webkit/WebKitTools/Scripts/ |
| find-included-framework-headers | 9 done | sort | uniq
|
| /external/webkit/WebKitTools/BuildSlaveSupport/build.webkit.org-config/webkit/ |
| schedulers.py | 6 trunkBuilders.sort()
8 stableBuilders.sort()
10 periodicBuilders.sort()
|
| /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/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/iptables/extensions/ |
| rename-dups.sh | 6 ls *.c | tr [A-Z] [a-z] | sort > $t1
7 cat $t1 | sort -u > $t2
|
| /external/strace/strace/linux/mips/ |
| ioctlent.sh | 68 file_list=`(ls $file_find $file_stop $file_stop 2>/dev/null) | sort | uniq -u`
90 awk '{ print "#include <" substr($2, 2, length($2) - 3) ">" }' ioctlent.tmp | sort -u
|
| /external/webkit/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...] |
| /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/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...] |
| /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
88 * @param sort if true, sort such that classes appear before their inner
93 public ClassPathOpener(String pathname, boolean sort, Consumer consumer) {
95 this.sort = sort;
150 // Ensure inner classes sort second
181 if (sort) {
182 Arrays.sort(files, new Comparator<File>()
[all...] |
| /external/ipsec-tools/src/racoon/ |
| stats.pl | 13 foreach (sort keys %t) {
|
