| /external/chromium_org/webkit/data/test_shell/sort/ |
| sort-heap.js | 3 function sort_heap(sort, end) {
5 var mid = Math.floor(sort.size/2 - 1);
6 sort.add_work(function() { build_heap(sort, mid); }, "build_heap");
8 sort.swap(end, 0);
10 sort.add_work(function() { sort_heap(sort, end); }, "sort_heap");
11 sort.add_work(function() { sift_down(sort, 0, end, 0); }, "sift_down");
15 function build_heap(sort, start)
[all...] |
| sort-quick.js | 3 function sort_quick(sort, left, right) {
6 right = sort.size - 1;
11 partition(sort, left, right, pivot);
15 function partition(sort, left, right, pivot) {
16 sort.swap(pivot, right);
17 sort.add_work(function(){partition_step(sort, left, right, pivot, left, left);});
20 function partition_step(sort, left, right, pivot, i, j) {
22 if (sort.compare(i, right) <= 0) {
23 sort.swap(i, j)
[all...] |
| sort-bubble.js | 1 // bubble sort
3 function sort_bubble(sort, x, y) {
7 var len = sort.bars.length;
9 if (sort.compare(x, y) < 0) {
10 sort.swap(x, y);
18 sort.add_work(function() { sort_bubble(sort, x, y); });
|
| sort-insertion.js | 1 // insertion sort
3 function sort_insertion(sort, x, y) {
7 var len = sort.bars.length;
9 if (sort.compare(y, y - 1) < 0) {
10 sort.swap(y, y - 1);
21 sort.add_work(function () { sort_insertion(sort, x, y); });
|
| sort.html | 5 <link rel=stylesheet href="sort.css" type="text/css">
7 <script src="sort.js"></script>
8 <script src="sort-bubble.js"></script>
9 <script src="sort-insertion.js"></script>
10 <script src="sort-quick.js"></script>
11 <script src="sort-heap.js"></script>
15 sorts.push(new Sort("Bubble", sort_bubble));
16 sorts.push(new Sort("Insertion", sort_insertion));
17 sorts.push(new Sort("Quick", sort_quick));
18 sorts.push(new Sort("Heap", sort_heap))
[all...] |
| /frameworks/opt/vcard/tests/res/raw/ |
| v40_sort_as.vcf | 4 N;SORT-AS="????;???":??;???;;;
5 ORG;TYPE=WORK;SORT-AS="????;???????":????;????
|
| /external/dhcpcd/dhcpcd-hooks/ |
| 01-test | 4 set | grep "^\(interface\|metric\|pid\|reason\|skip_hooks\)=" | sort
5 set | grep "^\(new_\|old_\)" | sort
|
| 02-dump | 4 set | sed -ne 's/^new_//p' | sort
|
| /build/tools/ |
| print_module_licenses.sh | 2 find . -name MODULE_LICENSE_\* | sed 's/\/MODULE_LICENSE_/\ /' | sed 's/\.\///' | awk '{ print $2 " " $1; }' | sort
|
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| p11.cpp | 5 template<class T> void sort(Array<T>& v);
7 // explicit specialization for sort(Array<int>&)
9 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
|
| /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/chromium_org/third_party/sqlite/src/test/ |
| sort.test | 14 # $Id: sort.test,v 1.25 2005/11/14 22:29:06 drh Exp $
19 # Create a bunch of data to sort against
21 do_test sort-1.0 {
42 do_test sort-1.1 {
45 do_test sort-1.1.1 {
48 do_test sort-1.1.1 {
51 do_test sort-1.2 {
54 do_test sort-1.3a {
57 do_test sort-1.3b {
60 do_test sort-1.4
[all...] |
| between.test | 50 # "sort" or "nosort" keyword depending on whether or not any sorting
56 if {$::sqlite_sort_count} {set x sort} {set x nosort}
65 } {5 2 36 38 6 2 49 51 sort t1 i1w}
70 } {5 2 36 38 6 2 49 51 sort t1 {}}
75 } {5 2 36 38 6 2 49 51 sort t1 i1w}
80 } {5 2 36 38 6 2 49 51 sort t1 {}}
85 } {5 2 36 38 6 2 49 51 sort t1 i1w}
90 } {5 2 36 38 6 2 49 51 sort t1 {}}
95 } {5 2 36 38 6 2 49 51 sort t1 {}}
100 } {4 2 25 27 sort t1 i1zyx
[all...] |
| collate9.test | 24 db collate "reverse sort" reverse_sort
27 # opcode was executed. If an OP_Sort did occur, then "sort" is appended
36 if {$::sqlite_sort_count} {set x sort} {set x nosort}
51 CREATE TABLE xy(x COLLATE "reverse sort", y COLLATE binary);
71 } {two three one sort}
95 SELECT y, y COLLATE "reverse sort" < 'seven' FROM xy ORDER BY x
105 SELECT y FROM xy ORDER BY y COLLATE "reverse sort"
110 SELECT y COLLATE "reverse sort" AS aaa FROM xy ORDER BY aaa
116 CREATE INDEX xy_i2 ON xy(y COLLATE "reverse sort");
123 } {one three two sort}
[all...] |
| /external/clang/test/CXX/temp/temp.spec/temp.explicit/ |
| p6.cpp | 5 template<class T> void sort(Array<T>& v) { } function
7 // instantiate sort(Array<int>&) - template-argument deduced
8 template void sort<>(Array<int>&);
10 template void sort(Array<long>&);
|
| /ndk/sources/host-tools/make-3.81/tests/scripts/variables/ |
| special | 9 X1 := $(sort $(filter FOO BAR,$(.VARIABLES)))
13 X2 := $(sort $(filter FOO BAR,$(.VARIABLES)))
20 @echo LAST = $(sort $(filter FOO BAR,$(.VARIABLES)))
31 # X1 := $(sort $(.TARGETS))
36 # @echo LAST = $(sort $(.TARGETS))
38 # X2 := $(sort $(.TARGETS))
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| sortperf.py | 0 """Sort performance test.
61 L.sort()
67 """Tabulate sort speed for lists of various sizes.
71 The output displays i, 2**i, and the time to sort arrays of 2**i
74 *sort: random data
75 \sort: descending data
76 /sort: ascending data
77 3sort: ascending, then 3 random exchanges
78 +sort: ascending, then 10 random at the end
79 %sort: ascending, then randomly replace 1% of the elements w/ random value
[all...] |
| test_sort.py | 17 raw.sort(compare)
19 raw.sort()
103 s.sort(lambda a, b: int(random.random() * 3) - 1)
112 s.sort()
117 check("exception during sort left some permutation", x, s)
121 augmented.sort() # forced stable because ties broken by index
122 x = [e for e, i in augmented] # a stable sort of s
130 # bug 453523 -- list.sort() crasher.
132 # Mutations during a list sort should raise a ValueError.
143 self.assertRaises(ValueError, L.sort)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| sortperf.py | 0 """Sort performance test.
61 L.sort()
67 """Tabulate sort speed for lists of various sizes.
71 The output displays i, 2**i, and the time to sort arrays of 2**i
74 *sort: random data
75 \sort: descending data
76 /sort: ascending data
77 3sort: ascending, then 3 random exchanges
78 +sort: ascending, then 10 random at the end
79 %sort: ascending, then randomly replace 1% of the elements w/ random value
[all...] |
| /external/chromium_org/v8/test/webkit/ |
| string-sort-expected.txt | 30 PASS ["12","123"].sort().toString() is "12,123"
32 PASS ["123","13"].sort().toString() is "123,13"
34 PASS [""," "].sort().toString() is ", "
36 PASS ["close","closed"].sort().toString() is "close,closed"
38 PASS ["a","~"].sort().toString() is "a,~"
40 PASS ["_","a"].sort().toString() is "_,a"
42 PASS ["0","A"].sort().toString() is "0,A"
44 PASS ["-","0"].sort().toString() is "-,0"
46 PASS [" ","-"].sort().toString() is " ,-"
48 PASS ["A","ABC"].sort().toString() is "A,ABC
[all...] |
| /external/chromium_org/third_party/WebKit/Source/build/scripts/templates/ |
| MakeQualifiedNames.cpp.tmpl | 26 {%- for tag in tags|sort %}
34 {%- for tag in tags|sort %}
44 {%- for attr in attrs|sort %}
51 {%- for attr in attrs|sort %}
66 {%- for name, tag_list in (tags + attrs)|groupby('name')|sort %}
71 {%- for tag in tags|sort %}
76 {%- for attr in attrs|sort %}
|
| MakeNames.cpp.tmpl | 19 {%- for entry in entries|sort %}
30 {%- for entry in entries|sort %}
35 {%- for entry in entries|sort %}
|
| /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/proguard/src/proguard/classfile/editor/ |
| AttributeSorter.java | 45 // Sort the attributes.
46 Arrays.sort(programClass.attributes, 0, programClass.u2attributesCount, this);
48 // Sort the attributes of the class members.
58 // Sort the attributes.
59 Arrays.sort(programMember.attributes, 0, programMember.u2attributesCount, this);
61 // Sort the attributes of the attributes.
73 // Sort the attributes.
74 Arrays.sort(codeAttribute.attributes, 0, codeAttribute.u2attributesCount, this);
|
