| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| D | rotate_copy.pass.cpp | 44 int ib[sa] = {0}; in test() local
46 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib)); in test()
47 assert(base(r) == ib); in test()
49 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib)); in test()
50 assert(base(r) == ib+1); in test()
51 assert(ib[0] == 0); in test()
53 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib)); in test()
54 assert(base(r) == ib+1); in test()
55 assert(ib[0] == 0); in test()
57 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+2), OutIter(ib)); in test()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
29 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib)) in test_constexpr()
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
46 forward_iterator<const int*>(ib)) == true); in main()
50 forward_iterator<const int*>(ib), in main()
51 forward_iterator<const int*>(ib + 0)) == true); in main()
55 forward_iterator<const int*>(ib)) == true); in main()
[all …]
|
| D | is_permutation_pred.pass.cpp | 33 int ib[] = {1, 1, 0}; in test_constexpr() local
37 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib) , c) in test_constexpr()
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
66 forward_iterator<const int*>(ib), in main()
70 forward_iterator<const int*>(ib), in main()
75 forward_iterator<const int*>(ib), in main()
76 forward_iterator<const int*>(ib + sa), in main()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 27 int ib[] = {1, 1, 0}; in test_constexpr() local
30 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib)) in test_constexpr()
31 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
33 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
43 const int ib[] = {0}; in main() local
47 forward_iterator<const int*>(ib)) == true); in main()
51 forward_iterator<const int*>(ib), in main()
52 forward_iterator<const int*>(ib + 0)) == true); in main()
56 forward_iterator<const int*>(ib)) == true); in main()
[all …]
|
| D | is_permutation_pred.pass.cpp | 34 int ib[] = {1, 1, 0}; in test_constexpr() local
38 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib) , c) in test_constexpr()
39 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), c) in test_constexpr()
40 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic) , c) in test_constexpr()
41 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), c) in test_constexpr()
63 const int ib[] = {0}; in main() local
67 forward_iterator<const int*>(ib), in main()
71 forward_iterator<const int*>(ib), in main()
76 forward_iterator<const int*>(ib), in main()
77 forward_iterator<const int*>(ib + sa), in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| D | rotate_copy.pass.cpp | 30 int ib[sa] = {0}; in test() local
32 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib)); in test()
33 assert(base(r) == ib); in test()
35 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia + 1), OutIter(ib)); in test()
36 assert(base(r) == ib + 1); in test()
37 assert(ib[0] == 0); in test()
39 r = std::rotate_copy(InIter(ia), InIter(ia + 1), InIter(ia + 1), OutIter(ib)); in test()
40 assert(base(r) == ib + 1); in test()
41 assert(ib[0] == 0); in test()
43 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia + 2), OutIter(ib)); in test()
[all …]
|
| /external/mesa3d/src/amd/common/ |
| D | ac_debug.c | 57 uint32_t *ib; member
68 static void ac_do_parse_ib(FILE *f, struct ac_ib_parser *ib);
195 static uint32_t ac_ib_get(struct ac_ib_parser *ib) in ac_ib_get() argument
199 if (ib->cur_dw < ib->num_dw) { in ac_ib_get()
200 v = ib->ib[ib->cur_dw]; in ac_ib_get()
210 fprintf(ib->f, COLOR_RED "Valgrind: The next DWORD is garbage" COLOR_RESET "\n"); in ac_ib_get()
212 fprintf(ib->f, "\n\035#%08x ", v); in ac_ib_get()
214 fprintf(ib->f, "\n\035#???????? "); in ac_ib_get()
217 ib->cur_dw++; in ac_ib_get()
222 struct ac_ib_parser *ib) in ac_parse_set_reg_packet() argument
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| D | search_n.pass.cpp | 53 int ib[] = {0, 0, 1, 1, 2, 2}; in test() local
54 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
55 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib)); in test()
56 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0)); in test()
57 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0)); in test()
58 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), sb, 0) == Iter(ib+sb)); in test()
60 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib)); in test()
61 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1) == Iter(ib+2)); in test()
62 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1) == Iter(ib+2)); in test()
[all …]
|
| D | search_n_pred.pass.cpp | 91 int ib[] = {0, 0, 1, 1, 2, 2}; in test() local
92 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
93 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib)); in test()
96 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0)); in test()
99 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0)); in test()
102 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0, count_equal()) == Iter(ib+sb)); in test()
105 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0, count_equal()) == Iter(ib+sb)); in test()
108 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1, count_equal()) == Iter(ib)); in test()
111 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1, count_equal()) == Iter(ib+2)); in test()
114 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1, count_equal()) == Iter(ib+2)); in test()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| D | search_n.pass.cpp | 52 int ib[] = {0, 0, 1, 1, 2, 2}; in test() local
53 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
54 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()
58 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 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()
[all …]
|
| D | search_n_pred.pass.cpp | 90 int ib[] = {0, 0, 1, 1, 2, 2}; in test() local
91 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
92 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()
104 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 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()
[all …]
|
| /external/llvm-project/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| D | compare.pass.cpp | 27 const char ib[] = "123"; in main() local
29 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
30 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); in main()
31 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
32 assert(f.compare(ib, ib+3, ia, ia+sa) == -1); in main()
33 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -1); in main()
34 assert(f.compare(ib+1, ib+3, ia, ia+sa) == 1); in main()
35 assert(f.compare(ia, ia+3, ib, ib+3) == 0); in main()
40 const wchar_t ib[] = L"123"; in main() local
42 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
[all …]
|
| /external/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| D | compare.pass.cpp | 26 const char ib[] = "123"; in main() local
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); in main()
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1); in main()
32 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -1); in main()
33 assert(f.compare(ib+1, ib+3, ia, ia+sa) == 1); in main()
34 assert(f.compare(ia, ia+3, ib, ib+3) == 0); in main()
39 const wchar_t ib[] = L"123"; in main() local
41 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch_pred.pass.cpp | 34 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()
48 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
51 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq); in test_constexpr()
52 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
55 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)), eq); in test_constexpr()
56 if (p5.first != II(ib+2) || p5.second != II(ic+2)) 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()
59 if (p6.first != BI(ib+2) || p6.second != BI(ic+2)) in test_constexpr()
75 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
[all …]
|
| D | mismatch.pass.cpp | 29 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()
47 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
50 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))); in test_constexpr()
51 if (p5.first != II(ib+2) || p5.second != II(ic+2)) 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()
54 if (p6.first != BI(ib+2) || p6.second != BI(ic+2)) in test_constexpr()
65 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch_pred.pass.cpp | 35 int ib[] = {1, 3}; in test_constexpr() local
48 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), eq); in test_constexpr()
49 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
52 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq); in test_constexpr()
53 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
56 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)), eq); in test_constexpr()
57 if (p5.first != II(ib+2) || p5.second != II(ic+2)) in test_constexpr()
59 …auto p6 = std::mismatch(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic))… in test_constexpr()
60 if (p6.first != BI(ib+2) || p6.second != BI(ic+2)) in test_constexpr()
76 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
[all …]
|
| D | mismatch.pass.cpp | 30 int ib[] = {1, 3}; in test_constexpr() local
43 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic)); in test_constexpr()
44 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
47 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)); in test_constexpr()
48 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
51 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))); in test_constexpr()
52 if (p5.first != II(ib+2) || p5.second != II(ic+2)) in test_constexpr()
54 …auto p6 = std::mismatch(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic))… in test_constexpr()
55 if (p6.first != BI(ib+2) || p6.second != BI(ic+2)) in test_constexpr()
66 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
[all …]
|
| /external/mesa3d/src/gallium/drivers/r600/ |
| D | eg_debug.c | 133 static void ac_parse_set_reg_packet(FILE *f, uint32_t *ib, unsigned count, in ac_parse_set_reg_packet() argument
136 unsigned reg = (ib[1] << 2) + reg_offset; in ac_parse_set_reg_packet()
140 eg_dump_reg(f, reg + i*4, ib[2+i], ~0); in ac_parse_set_reg_packet()
143 static uint32_t *ac_parse_packet3(FILE *f, uint32_t *ib, int *num_dw, in ac_parse_packet3() argument
148 unsigned count = PKT_COUNT_G(ib[0]); in ac_parse_packet3()
149 unsigned op = PKT3_IT_OPCODE_G(ib[0]); in ac_parse_packet3()
150 const char *predicate = PKT3_PREDICATE(ib[0]) ? "(predicate)" : ""; in ac_parse_packet3()
151 const char *compute_mode = (ib[0] & 0x2) ? "(C)" : ""; in ac_parse_packet3()
178 ac_parse_set_reg_packet(f, ib, count, EVERGREEN_CONTEXT_REG_OFFSET); in ac_parse_packet3()
181 ac_parse_set_reg_packet(f, ib, count, EVERGREEN_CONFIG_REG_OFFSET); in ac_parse_packet3()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 26 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()
|
| D | lexicographical_compare_comp.pass.cpp | 28 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()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 27 int ib[] = {1, 3, 5, 2, 4, 6}; in test_constexpr() local
29 return std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
30 && !std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia)) in test_constexpr()
41 int ib[] = {1, 2, 3}; in test() local
42 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2))); in test()
43 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa))); in test()
44 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3))); in test()
45 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
46 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3))); in test()
47 assert(!std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
|
| D | lexicographical_compare_comp.pass.cpp | 29 int ib[] = {1, 3, 5, 2, 4, 6}; in test_constexpr() local
32 …return !std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), p… in test_constexpr()
33 … && std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia), pred) in test_constexpr()
44 int ib[] = {1, 2, 3}; in test() local
47 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c)); in test()
48 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c)); in test()
49 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c)); in test()
50 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
51 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c)); in test()
52 assert( std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
|
| /external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| D | hash.pred.pass.cpp | 86 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()
123 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
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()
[all …]
|
| D | pred.pass.cpp | 80 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()
114 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
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()
[all …]
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| D | default.pass.cpp | 66 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()
105 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test2() local
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()
[all …]
|