| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| p11.cpp | 4 template<class T> void sort(Array<T>& v);
6 // explicit specialization for sort(Array<int>&)
8 template<> void sort(Array<int>&);
|
| p6.cpp | 44 template<class T> void sort(Array<T>& v) { /* ... */ } function
50 sort(v); // expected-note{{required}}
52 // sort(Array<T>&), T is String
55 template<> void sort<String>(Array<String>& v); // // expected-error{{after instantiation}}
56 template<> void sort<>(Array<char*>& v); // OK: sort<char*> not yet used
|
| /build/tools/ |
| print_module_licenses.sh | 2 find . -name MODULE_LICENSE_\* | sed 's/\/MODULE_LICENSE_/\ /' | sed 's/\.\///' | awk '{ print $2 " " $1; }' | sort
|
| /external/junit/src/org/junit/runner/manipulation/ |
| Sortable.java | 15 public void sort(Sorter sorter); method in interface:Sortable
|
| /external/webkit/Source/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...] |
| /cts/tests/tests/webkitsecurity/assets/ |
| sort-no-jit-code-crash.js | 2 "This test checks that non-numeric sort functions always have JIT code. This test passes if it does not crash."
9 [].sort(f);
|
| /external/clang/test/CodeCompletion/ |
| function-templates.cpp | 3 void sort(RandomAccessIterator first, RandomAccessIterator last);
15 std::sort(1, 2);
19 // CHECK-CC1: sort(<#RandomAccessIterator first#>, <#RandomAccessIterator last#>
|
| /external/linux-tools-perf/util/ |
| generate-cmdlist.sh | 15 sort |
|
| /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);
|
| Sorter.java | 22 public abstract void sort(Type[] array, int count, Comparator<Type> comparator); method in class:Sorter
|
| /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/clang/test/CXX/temp/temp.spec/temp.explicit/ |
| p6.cpp | 4 template<class T> void sort(Array<T>& v) { } function
6 // instantiate sort(Array<int>&) - template-argument deduced
7 template void sort<>(Array<int>&);
9 template void sort(Array<long>&);
|
| p2.cpp | 8 template<class T> void sort(Array<T>& v) { /* ... */ } function
9 template void sort(Array<char>&);
|
| /external/libvpx/tools/ |
| gen_authors.sh | 9 $(git log --pretty=format:"%aN <%aE>" | sort | uniq)
|
| /external/openssl/crypto/lhash/ |
| num.pl | 13 @a=sort {$a <=> $b } keys %num;
|
| /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/webkit/Tools/Scripts/ |
| find-included-framework-headers | 29 find . \( -name '*.cpp' -o -name '*.h' -o -name '*.m' -o -name '*.mm' \) -exec grep "<$framework/" {} ';' | sed -e 's|.*/\(.*\.h\).*|\1|' | sort -u
|
| /external/wpa_supplicant_8/hostapd/logwatch/ |
| hostapd | 41 foreach my $iface (sort keys %hostapd) {
43 foreach my $mac (sort keys %{$hostapd{$iface}}) {
45 foreach my $layer (sort keys %{$hostapd{$iface}->{$mac}}) {
47 foreach my $details (sort keys %{$hostapd{$iface}->{$mac}->{$layer}}) {
|
| /external/qemu-pc-bios/bochs/bios/ |
| bios_usage | 2 gcc -E rombios.c | grep "^\.org" | sed -e 's/\.org //' | sed -e 's/ .*//' | sort >! temp.usage
|
| /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>());
|
| /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>());
|
