Home
last modified time | relevance | path

Searched refs:ib (Results 1 – 25 of 160) sorted by relevance

1234567

/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/
H A Dis_permutation.pass.cpp26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
H A Dis_permutation_pred.pass.cpp33 int ib[] = {1, 1, 0}; in test_constexpr() local
38 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), c) in test_constexpr()
39 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic) , c) in test_constexpr()
40 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), c) in test_constexpr()
62 const int ib[] = {0}; in main() local
87 const int ib[] = {1}; in main() local
104 const int ib[] = {0, 0}; in main() local
125 const int ib[] = {0, 1}; in main() local
141 const int ib[] = {1, 0}; in main() local
157 const int ib[] = {1, 1}; in main() local
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate_copy.pass.cpp26 int ib[sa] = {0}; in test() local
33 assert(ib[0] == 0); in test()
37 assert(ib[0] == 0); in test()
41 assert(ib[0] == 0); in test()
42 assert(ib[1] == 1); in test()
46 assert(ib[0] == 1); in test()
47 assert(ib[1] == 0); in test()
51 assert(ib[0] == 0); in test()
52 assert(ib[1] == 1); in test()
56 assert(ib[0] == 0); in test()
[all …]
/llvm-project-15.0.7/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
H A Dcompare.pass.cpp32 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
33 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); in main()
34 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
35 assert(f.compare(ib, ib+3, ia, ia+sa) == -1); in main()
37 assert(f.compare(ib+1, ib+3, ia, ia+sa) == 1); in main()
38 assert(f.compare(ia, ia+3, ib, ib+3) == 0); in main()
46 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
47 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); in main()
48 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
49 assert(f.compare(ib, ib+3, ia, ia+sa) == -1); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch_n.pass.cpp54 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib)); in test()
55 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0)); in test()
56 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0)); in test()
57 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0) == Iter(ib+sb)); in test()
59 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib)); in test()
60 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1) == Iter(ib+2)); in test()
61 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1) == Iter(ib+2)); in test()
62 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1) == Iter(ib+sb)); in test()
64 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2) == Iter(ib)); in test()
65 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2) == Iter(ib+4)); in test()
[all …]
H A Dsearch_n_pred.pass.cpp92 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib)); in test()
95 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0)); in test()
98 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0)); in test()
101 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0, count_equal()) == Iter(ib+sb)); in test()
107 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1, count_equal()) == Iter(ib)); in test()
110 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1, count_equal()) == Iter(ib+2)); in test()
113 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1, count_equal()) == Iter(ib+2)); in test()
116 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1, count_equal()) == Iter(ib+sb)); in test()
122 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2, count_equal()) == Iter(ib)); in test()
125 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2, count_equal()) == Iter(ib+4)); in test()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/
H A Dmismatch_pred.pass.cpp34 int ib[] = {1, 3}; in test_constexpr() local
47 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), eq); in test_constexpr()
51 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq); in test_constexpr()
55 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)), eq); in test_constexpr()
58 …auto p6 = std::mismatch(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic))… in test_constexpr()
76 const unsigned sb = sizeof(ib)/sizeof(ib[0]); ((void)sb); // unused in C++11 in main()
94 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ()) in main()
96 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib + sb), EQ()) in main()
99 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), std::ref(bcp)) in main()
108 assert(std::mismatch(ia, ia + sa, ib, ib + sb, EQ()) == in main()
[all …]
H A Dmismatch.pass.cpp29 int ib[] = {1, 3}; in test_constexpr() local
42 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic)); in test_constexpr()
43 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
46 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)); in test_constexpr()
50 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))); in test_constexpr()
53 …auto p6 = std::mismatch(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic))… in test_constexpr()
65 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]); ((void)sb); // unused in C++11 in main()
78 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb)) in main()
81 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb)) in main()
[all …]
/llvm-project-15.0.7/mlir/lib/Dialect/X86Vector/Transforms/
H A DAVXTranspose.cpp124 Value t0 = mm256UnpackLoPs(ib, vs[0], vs[1]); in transpose4x8xf32()
125 Value t1 = mm256UnpackHiPs(ib, vs[0], vs[1]); in transpose4x8xf32()
126 Value t2 = mm256UnpackLoPs(ib, vs[2], vs[3]); in transpose4x8xf32()
127 Value t3 = mm256UnpackHiPs(ib, vs[2], vs[3]); in transpose4x8xf32()
148 Value t0 = mm256UnpackLoPs(ib, vs[0], vs[1]); in transpose8x8xf32()
149 Value t1 = mm256UnpackHiPs(ib, vs[0], vs[1]); in transpose8x8xf32()
150 Value t2 = mm256UnpackLoPs(ib, vs[2], vs[3]); in transpose8x8xf32()
151 Value t3 = mm256UnpackHiPs(ib, vs[2], vs[3]); in transpose8x8xf32()
284 ImplicitLocOpBuilder ib(loc, rewriter); in matchAndRewrite() local
303 transpose4x8xf32(ib, vs); in matchAndRewrite()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/
H A Dlexicographical_compare.pass.cpp26 int ib[] = {1, 3, 5, 2, 4, 6}; in test_constexpr() local
28 return std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
29 && !std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia)) in test_constexpr()
40 int ib[] = {1, 2, 3}; in test() local
41 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2))); in test()
42 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa))); in test()
43 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3))); in test()
44 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
45 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3))); in test()
46 assert(!std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
H A Dlexicographical_compare_comp.pass.cpp28 int ib[] = {1, 3, 5, 2, 4, 6}; in test_constexpr() local
31 …return !std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), p… in test_constexpr()
32 … && std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia), pred) in test_constexpr()
43 int ib[] = {1, 2, 3}; in test() local
46 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c)); in test()
47 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c)); in test()
48 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c)); in test()
49 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
50 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c)); in test()
51 assert( std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
/llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/
H A Dpred.pass.cpp80 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
81 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
83 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
85 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
115 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
117 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
119 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
121 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
H A Ddefault.pass.cpp66 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
67 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
69 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1)); in test()
71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1)); in test()
73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4)); in test()
75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test()
106 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
108 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1)); in test2()
110 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1)); in test2()
112 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4)); in test2()
[all …]
H A Dhash.pass.cpp71 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
72 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
76 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
78 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
106 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
108 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
110 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
112 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
H A Dhash.pred.pass.cpp86 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
87 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
91 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
93 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
95 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
124 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
126 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
128 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
130 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
/llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/
H A Ddefault.pass.cpp65 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
68 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1)); in test()
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1)); in test()
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4)); in test()
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test()
105 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
107 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1)); in test2()
109 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1)); in test2()
111 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4)); in test2()
[all …]
H A Dhash.pred.pass.cpp83 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
84 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
88 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
90 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
92 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
118 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
120 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
122 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
124 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
H A Dhash.pass.cpp70 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
71 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
77 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
79 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
105 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
107 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
109 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
111 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
H A Dpred.pass.cpp77 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
78 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
82 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
84 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
112 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
116 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
118 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
/llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/
H A Ddefault.pass.cpp66 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
67 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
69 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1)); in test()
71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1)); in test()
73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4)); in test()
75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test()
106 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
108 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1)); in test2()
110 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1)); in test2()
112 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4)); in test2()
[all …]
H A Dhash.pred.pass.cpp84 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
85 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
91 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
93 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
119 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
121 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
123 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
125 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
H A Dpred.pass.cpp78 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
79 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
81 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
83 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
85 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
113 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
115 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
117 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
119 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
H A Dhash.pass.cpp71 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
72 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
76 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
78 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
106 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
108 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
110 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
112 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
/llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/
H A Dpred.pass.cpp81 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
82 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
84 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
88 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
90 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
116 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
118 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
120 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
122 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]
H A Dhash.pass.cpp72 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
73 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test()
77 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test()
79 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test()
81 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
107 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test2()
109 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); in test2()
111 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); in test2()
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); in test2()
[all …]

1234567