| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| hash.pass.cpp | 71 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
72 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
76 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
78 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
105 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pred.pass.cpp | 86 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
87 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
91 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
93 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
123 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| pred.pass.cpp | 80 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
81 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
83 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
85 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
114 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| default.pass.cpp | 65 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
68 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
104 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pass.cpp | 70 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
71 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
77 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
104 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pred.pass.cpp | 83 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
84 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
88 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
90 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
117 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| pred.pass.cpp | 77 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
78 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
82 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
84 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
111 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| default.pass.cpp | 66 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
67 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
69 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
105 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pass.cpp | 72 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
73 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
77 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
79 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
106 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pred.pass.cpp | 87 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
88 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
90 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
92 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
94 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
124 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| pred.pass.cpp | 81 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
82 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
84 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
88 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
115 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| default.pass.cpp | 66 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
67 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
69 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
105 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pass.cpp | 71 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
72 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
76 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
78 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
105 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pred.pass.cpp | 84 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
85 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
91 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
118 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| pred.pass.cpp | 78 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
79 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
81 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
83 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
85 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
112 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| default.pass.cpp | 65 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
68 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
104 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pass.cpp | 71 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
72 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
76 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
78 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
105 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pred.pass.cpp | 86 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
87 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
91 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
93 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
123 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| pred.pass.cpp | 80 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
81 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
83 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
85 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
114 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| default.pass.cpp | 65 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
68 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
104 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pass.cpp | 70 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
71 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
77 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
104 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| hash.pred.pass.cpp | 83 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
84 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
88 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
90 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
117 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| pred.pass.cpp | 77 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
78 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
82 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
84 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
111 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
| /prebuilts/go/darwin-x86/test/ken/ |
| interbasic.go | 16 var ia, ib I0
20 if ia != ib {
26 ib = i
27 if ia != ib {
36 if ia == ib {
41 if ia == ib {
45 ib = nil
46 if ia != ib {
56 ib = nil
57 if ia == ib {
[all...] |
| /prebuilts/go/linux-x86/test/ken/ |
| interbasic.go | 16 var ia, ib I0
20 if ia != ib {
26 ib = i
27 if ia != ib {
36 if ia == ib {
41 if ia == ib {
45 ib = nil
46 if ia != ib {
56 ib = nil
57 if ia == ib {
[all...] |
