Home
last modified time | relevance | path

Searched refs:ih (Results 1 – 25 of 29) sorted by relevance

12

/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
H A Dunique.pass.cpp82 int ih[] = {0, 1, 1}; in test() local
83 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
84 r = std::unique(Iter(ih), Iter(ih+sh)); in test()
86 assert(ih[0] == 0); in test()
87 assert(ih[1] == 1); in test()
159 Ptr ih[3]; in test1() local
160 ih[1].reset(&one); in test1()
161 ih[2].reset(&one); in test1()
162 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test1()
163 r = std::unique(Iter(ih), Iter(ih+sh)); in test1()
[all …]
H A Dunique_pred.pass.cpp104 int ih[] = {0, 1, 1}; in test() local
105 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
107 r = std::unique(Iter(ih), Iter(ih+sh), count_equal()); in test()
109 assert(ih[0] == 0); in test()
110 assert(ih[1] == 1); in test()
197 Ptr ih[3]; in test1() local
198 ih[1].reset(&one); in test1()
199 ih[2].reset(&one); in test1()
200 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test1()
202 r = std::unique(Iter(ih), Iter(ih+sh), count_equal()); in test1()
[all …]
H A Dunique_copy.pass.cpp102 const int ih[] = {0, 1, 1}; in test() local
103 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
105 r = std::unique_copy(InIter(ih), InIter(ih+sh), OutIter(jh)); in test()
/llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/
H A Dpred.pass.cpp90 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
91 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
93 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
124 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
125 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
127 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
H A Ddefault.pass.cpp76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test()
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test2()
H A Dhash.pass.cpp81 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
82 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
84 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
H A Dhash.pred.pass.cpp96 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
97 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
99 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
133 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
134 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
136 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
/llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/
H A Ddefault.pass.cpp75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test()
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test2()
H A Dhash.pred.pass.cpp93 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
94 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
96 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
127 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
128 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
130 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
H A Dhash.pass.cpp80 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
81 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
83 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
H A Dpred.pass.cpp87 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
88 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
121 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
122 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
124 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
/llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/
H A Ddefault.pass.cpp76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test()
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test2()
H A Dhash.pred.pass.cpp94 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
95 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
97 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
128 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
129 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
131 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
H A Dpred.pass.cpp88 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
89 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
91 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
122 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
123 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
125 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
H A Dhash.pass.cpp81 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
82 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
84 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
/llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/
H A Dpred.pass.cpp91 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
92 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
94 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
125 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
126 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
128 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
H A Dhash.pass.cpp82 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
83 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
85 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
116 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
117 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
119 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
H A Dhash.pred.pass.cpp97 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
98 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
100 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
134 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
135 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
137 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test2()
H A Ddefault.pass.cpp77 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
78 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
80 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test()
116 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
117 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test2()
119 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test2()
/llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/
H A Ddefault.pass.cpp76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test()
H A Ddefault.pred.pass.cpp88 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
89 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
91 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
/llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/
H A Dmake_default_searcher.pass.cpp61 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
62 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
64 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test()
H A Dmake_default_searcher.pred.pass.cpp73 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
74 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
76 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); in test()
/llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.default/
H A Ddefault.pass.cpp76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test()
H A Ddefault.pred.pass.cpp90 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
91 const unsigned sh = sizeof(ih)/sizeof(ih[0]); in test()
93 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3)); in test()

12