HomeSort by relevance Sort by last modified time
    Searched refs:ib (Results 1 - 25 of 463) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
compare.pass.cpp 26 const char ib[] = "123"; local
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1);
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1);
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1);
32 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -1)
39 const wchar_t ib[] = L"123"; local
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
compare.pass.cpp 26 const char ib[] = "123"; local
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1);
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1);
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1);
32 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -1)
39 const wchar_t ib[] = L"123"; local
    [all...]
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
rotate_copy.pass.cpp 25 // int ib[std::size(ia)] = {0};
29 // auto it = std::rotate_copy(std::begin(ia), middle, std::end(ia), std::begin(ib));
31 // return std::distance(std::begin(ib), it) == std::size(ia)
32 // && std::equal (std::begin(ia), middle, std::begin(ib) + std::size(ia) - N)
33 // && std::equal (middle, std::end(ia), std::begin(ib))
44 int ib[sa] = {0}; local
46 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib));
47 assert(base(r) == ib);
49 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib));
50 assert(base(r) == ib+1)
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.rotate/
rotate_copy.pass.cpp 27 int ib[sa] = {0}; local
29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib));
30 assert(base(r) == ib);
32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib));
33 assert(base(r) == ib+1);
34 assert(ib[0] == 0);
36 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib));
37 assert(base(r) == ib+1);
38 assert(ib[0] == 0);
40 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+2), OutIter(ib));
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.is_permutation/
is_permutation.pass.cpp 28 const int ib[] = {0}; local
32 forward_iterator<const int*>(ib)) == true);
36 forward_iterator<const int*>(ib),
37 forward_iterator<const int*>(ib + 0)) == true);
41 forward_iterator<const int*>(ib)) == true);
45 forward_iterator<const int*>(ib),
46 forward_iterator<const int*>(ib + sa)) == true);
49 forward_iterator<const int*>(ib),
50 forward_iterator<const int*>(ib + sa - 1)) == false);
55 const int ib[] = {1} local
70 const int ib[] = {0, 0}; local
88 const int ib[] = {0, 1}; local
102 const int ib[] = {1, 0}; local
116 const int ib[] = {1, 1}; local
130 const int ib[] = {0, 0}; local
144 const int ib[] = {0, 1}; local
162 const int ib[] = {1, 0}; local
176 const int ib[] = {1, 1}; local
190 const int ib[] = {0, 0}; local
204 const int ib[] = {0, 1}; local
218 const int ib[] = {1, 0}; local
232 const int ib[] = {1, 1}; local
246 const int ib[] = {0, 0}; local
260 const int ib[] = {0, 1}; local
274 const int ib[] = {1, 0}; local
288 const int ib[] = {1, 1}; local
303 const int ib[] = {1, 0, 0}; local
317 const int ib[] = {1, 0, 1}; local
331 const int ib[] = {1, 0, 2}; local
345 const int ib[] = {1, 1, 0}; local
359 const int ib[] = {1, 1, 1}; local
373 const int ib[] = {1, 1, 2}; local
387 const int ib[] = {1, 2, 0}; local
401 const int ib[] = {1, 2, 1}; local
415 const int ib[] = {1, 2, 2}; local
429 const int ib[] = {1, 0, 0}; local
447 const int ib[] = {1, 0, 1}; local
461 const int ib[] = {1, 0, 2}; local
479 const int ib[] = {1, 2, 0}; local
497 const int ib[] = {2, 1, 0}; local
515 const int ib[] = {2, 0, 1}; local
533 const int ib[] = {1, 0, 1}; local
547 const int ib[] = {1, 0, 0}; local
569 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
591 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
    [all...]
is_permutation_pred.pass.cpp 36 const int ib[] = {0}; local
40 forward_iterator<const int*>(ib),
44 forward_iterator<const int*>(ib),
49 forward_iterator<const int*>(ib),
50 forward_iterator<const int*>(ib + sa),
54 forward_iterator<const int*>(ib),
55 forward_iterator<const int*>(ib + sa - 1),
61 const int ib[] = {1}; local
65 forward_iterator<const int*>(ib),
70 forward_iterator<const int*>(ib),
78 const int ib[] = {0, 0}; local
99 const int ib[] = {0, 1}; local
115 const int ib[] = {1, 0}; local
131 const int ib[] = {1, 1}; local
147 const int ib[] = {0, 0}; local
163 const int ib[] = {0, 1}; local
184 const int ib[] = {1, 0}; local
205 const int ib[] = {1, 1}; local
221 const int ib[] = {0, 0}; local
237 const int ib[] = {0, 1}; local
258 const int ib[] = {1, 0}; local
279 const int ib[] = {1, 1}; local
295 const int ib[] = {0, 0}; local
311 const int ib[] = {0, 1}; local
327 const int ib[] = {1, 0}; local
343 const int ib[] = {1, 1}; local
365 const int ib[] = {1, 0, 0}; local
381 const int ib[] = {1, 0, 1}; local
397 const int ib[] = {1, 0, 2}; local
413 const int ib[] = {1, 1, 0}; local
429 const int ib[] = {1, 1, 1}; local
445 const int ib[] = {1, 1, 2}; local
461 const int ib[] = {1, 2, 0}; local
477 const int ib[] = {1, 2, 1}; local
493 const int ib[] = {1, 2, 2}; local
509 const int ib[] = {1, 0, 0}; local
530 const int ib[] = {1, 0, 1}; local
546 const int ib[] = {1, 0, 2}; local
567 const int ib[] = {1, 2, 0}; local
588 const int ib[] = {2, 1, 0}; local
609 const int ib[] = {2, 0, 1}; local
630 const int ib[] = {1, 0, 1}; local
646 const int ib[] = {1, 0, 0}; local
672 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
712 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/mismatch/
mismatch.pass.cpp 28 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
29 const unsigned sb = sizeof(ib)/sizeof(ib[0]); ((void)sb); // unused in c++11
34 assert(std::mismatch(II(ia), II(ia + sa), II(ib))
35 == (std::pair<II, II>(II(ia+3), II(ib+3))));
37 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib))
38 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
41 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb))
42 == (std::pair<II, II>(II(ia+3), II(ib+3))))
    [all...]
mismatch_pred.pass.cpp 34 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
35 const unsigned sb = sizeof(ib)/sizeof(ib[0]); ((void)sb); // unused in c++11
41 assert(std::mismatch(II(ia), II(ia + sa), II(ib), EQ())
42 == (std::pair<II, II>(II(ia+3), II(ib+3))));
43 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), EQ())
44 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
47 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp))
48 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
53 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ()
    [all...]
  /external/mesa3d/src/amd/common/
ac_debug.c 131 static void ac_parse_set_reg_packet(FILE *f, uint32_t *ib, unsigned count,
134 unsigned reg = (ib[1] << 2) + reg_offset;
138 ac_dump_reg(f, reg + i*4, ib[2+i], ~0);
141 static uint32_t *ac_parse_packet3(FILE *f, uint32_t *ib, int *num_dw,
146 unsigned count = PKT_COUNT_G(ib[0]);
147 unsigned op = PKT3_IT_OPCODE_G(ib[0]);
148 const char *predicate = PKT3_PREDICATE(ib[0]) ? "(predicate)" : "";
175 ac_parse_set_reg_packet(f, ib, count, SI_CONTEXT_REG_OFFSET);
178 ac_parse_set_reg_packet(f, ib, count, SI_CONFIG_REG_OFFSET);
181 ac_parse_set_reg_packet(f, ib, count, CIK_UCONFIG_REG_OFFSET)
    [all...]
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/
is_permutation_pred.pass.cpp 34 int ib[] = {1, 1, 0}; local
38 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib) , c)
39 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), c)
40 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic) , c)
41 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), c)
51 const int ib[] = {0}; local
55 forward_iterator<const int*>(ib),
76 const int ib[] = {1}; local
93 const int ib[] = {0, 0}; local
114 const int ib[] = {0, 1}; local
130 const int ib[] = {1, 0}; local
146 const int ib[] = {1, 1}; local
162 const int ib[] = {0, 0}; local
178 const int ib[] = {0, 1}; local
199 const int ib[] = {1, 0}; local
220 const int ib[] = {1, 1}; local
236 const int ib[] = {0, 0}; local
252 const int ib[] = {0, 1}; local
273 const int ib[] = {1, 0}; local
294 const int ib[] = {1, 1}; local
310 const int ib[] = {0, 0}; local
326 const int ib[] = {0, 1}; local
342 const int ib[] = {1, 0}; local
358 const int ib[] = {1, 1}; local
380 const int ib[] = {1, 0, 0}; local
396 const int ib[] = {1, 0, 1}; local
412 const int ib[] = {1, 0, 2}; local
428 const int ib[] = {1, 1, 0}; local
444 const int ib[] = {1, 1, 1}; local
460 const int ib[] = {1, 1, 2}; local
476 const int ib[] = {1, 2, 0}; local
492 const int ib[] = {1, 2, 1}; local
508 const int ib[] = {1, 2, 2}; local
524 const int ib[] = {1, 0, 0}; local
545 const int ib[] = {1, 0, 1}; local
561 const int ib[] = {1, 0, 2}; local
582 const int ib[] = {1, 2, 0}; local
603 const int ib[] = {2, 1, 0}; local
624 const int ib[] = {2, 0, 1}; local
645 const int ib[] = {1, 0, 1}; local
661 const int ib[] = {1, 0, 0}; local
687 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
727 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
    [all...]
is_permutation.pass.cpp 27 int ib[] = {1, 1, 0}; local
30 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib))
31 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib))
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic))
33 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic))
43 const int ib[] = {0}; local
47 forward_iterator<const int*>(ib)) == true)
70 const int ib[] = {1}; local
85 const int ib[] = {0, 0}; local
103 const int ib[] = {0, 1}; local
117 const int ib[] = {1, 0}; local
131 const int ib[] = {1, 1}; local
145 const int ib[] = {0, 0}; local
159 const int ib[] = {0, 1}; local
177 const int ib[] = {1, 0}; local
191 const int ib[] = {1, 1}; local
205 const int ib[] = {0, 0}; local
219 const int ib[] = {0, 1}; local
233 const int ib[] = {1, 0}; local
247 const int ib[] = {1, 1}; local
261 const int ib[] = {0, 0}; local
275 const int ib[] = {0, 1}; local
289 const int ib[] = {1, 0}; local
303 const int ib[] = {1, 1}; local
318 const int ib[] = {1, 0, 0}; local
332 const int ib[] = {1, 0, 1}; local
346 const int ib[] = {1, 0, 2}; local
360 const int ib[] = {1, 1, 0}; local
374 const int ib[] = {1, 1, 1}; local
388 const int ib[] = {1, 1, 2}; local
402 const int ib[] = {1, 2, 0}; local
416 const int ib[] = {1, 2, 1}; local
430 const int ib[] = {1, 2, 2}; local
444 const int ib[] = {1, 0, 0}; local
462 const int ib[] = {1, 0, 1}; local
476 const int ib[] = {1, 0, 2}; local
494 const int ib[] = {1, 2, 0}; local
512 const int ib[] = {2, 1, 0}; local
530 const int ib[] = {2, 0, 1}; local
548 const int ib[] = {1, 0, 1}; local
562 const int ib[] = {1, 0, 0}; local
584 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
606 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
    [all...]
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
search_n.pass.cpp 53 int ib[] = {0, 0, 1, 1, 2, 2}; local
54 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
55 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib));
56 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0));
57 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0))
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/
search_n.pass.cpp 42 int ib[] = {0, 0, 1, 1, 2, 2}; local
43 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
44 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib));
45 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0));
46 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0))
    [all...]
  /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/
mismatch.pass.cpp 30 int ib[] = {1, 3}; local
43 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic));
44 if (p3.first != ib+2 || p3.second != ic+2)
47 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic));
48 if (p4.first != ib+2 || p4.second != ic+2)
51 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)));
52 if (p5.first != II(ib+2) || p5.second != II(ic+2)
66 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
    [all...]
mismatch_pred.pass.cpp 35 int ib[] = {1, 3}; local
48 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), eq);
49 if (p3.first != ib+2 || p3.second != ic+2)
52 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq);
53 if (p4.first != ib+2 || p4.second != ic+2)
56 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)), eq);
57 if (p5.first != II(ib+2) || p5.second != II(ic+2)
76 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
    [all...]
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/
remove_copy.pass.cpp 26 int ib[std::size(ia)] = {0}; local
28 auto it = std::remove_copy(std::begin(ia), std::end(ia), std::begin(ib), 5);
30 return std::distance(std::begin(ib), it) == (std::size(ia) - 2) // we removed two elements
31 && std::none_of(std::begin(ib), it, [](int a) {return a == 5;})
32 && std::all_of (it, std::end(ib), [](int a) {return a == 0;})
43 int ib[sa];
44 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2);
45 assert(base(r) == ib + sa-3);
46 assert(ib[0] == 0);
47 assert(ib[1] == 1)
    [all...]
remove_copy_if.pass.cpp 30 int ib[std::size(ia)] = {0}; local
32 auto it = std::remove_copy_if(std::begin(ia), std::end(ia), std::begin(ib), equalToTwo);
34 return std::distance(std::begin(ib), it) == (std::size(ia) - 1) // we removed one element
35 && std::none_of(std::begin(ib), it, equalToTwo)
36 && std::all_of (it, std::end(ib), [](int a) {return a == 0;})
47 int ib[sa];
49 OutIter(ib), equalToTwo);
50 assert(base(r) == ib + sa-3);
51 assert(ib[0] == 0);
52 assert(ib[1] == 1)
    [all...]
  /external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/
lexicographical_compare.pass.cpp 27 int ib[] = {1, 3, 5, 2, 4, 6}; local
29 return std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib))
30 && !std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia))
41 int ib[] = {1, 2, 3}; local
42 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2)));
43 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa)))
    [all...]
lexicographical_compare_comp.pass.cpp 29 int ib[] = {1, 3, 5, 2, 4, 6}; local
32 return !std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), pred)
33 && std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia), pred)
44 int ib[] = {1, 2, 3}; local
47 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c));
48 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c))
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.lex.comparison/
lexicographical_compare.pass.cpp 29 int ib[] = {1, 2, 3}; local
30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2)));
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa)));
32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3)));
33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa)));
34 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3)))
    [all...]
lexicographical_compare_comp.pass.cpp 31 int ib[] = {1, 2, 3}; local
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c));
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c));
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c));
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c));
38 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c))
    [all...]
  /external/sqlite/android/
OldPhoneNumberUtils.cpp 170 int ia, ib; local
180 ib = strlen(b);
181 if (ia == 0 || ib == 0) {
187 ib--;
191 while (ia >= 0 && ib >=0) {
203 cb = b[ib];
206 ib--;
215 ia--; ib--; matched++;
233 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) {
246 if (matchIntlPrefix(a, ia + 1) && matchIntlPrefix(b, ib + 1))
    [all...]
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/
replace_copy.pass.cpp 30 int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger local
33 auto it = std::replace_copy(std::begin(ia), std::end(ia), std::begin(ib), 2, 5);
35 return it == (std::begin(ib) + std::size(ia))
37 && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected))
48 int ib[sa] = {0}; local
49 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
50 assert(base(r) == ib + sa);
51 assert(ib[0] == 0);
52 assert(ib[1] == 1);
53 assert(ib[2] == 5)
    [all...]
replace_copy_if.pass.cpp 33 int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger local
36 auto it = std::replace_copy_if(std::begin(ia), std::end(ia), std::begin(ib), equalToTwo, 5);
38 return it == (std::begin(ib) + std::size(ia))
40 && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected))
51 int ib[sa] = {0}; local
53 OutIter(ib), equalToTwo, 5);
54 assert(base(r) == ib + sa);
55 assert(ib[0] == 0);
56 assert(ib[1] == 1);
57 assert(ib[2] == 5)
    [all...]
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/
unary_transform.pass.cpp 31 int ib[] = {0, 0, 0, 0, 0}; // one bigger local
34 auto it = std::transform(std::begin(ia), std::end(ia), std::begin(ib), plusOne);
36 return it == (std::begin(ib) + std::size(ia))
38 && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected))
50 int ib[sa] = {0}; local
52 OutIter(ib), plusOne);
53 assert(base(r) == ib + sa);
54 assert(ib[0] == 1);
55 assert(ib[1] == 2);
56 assert(ib[2] == 3)
    [all...]

Completed in 160 milliseconds

1 2 3 4 5 6 7 8 91011>>