| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| D | make_default_searcher.pass.cpp | 26 template <typename Iter1, typename Iter2>
27 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search()
32 template <class Iter1, class Iter2>
38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test()
39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test()
40 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test()
41 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test()
42 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
43 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
44 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia)); in test()
[all …]
|
| D | make_default_searcher.pred.pass.cpp | 36 template <typename Iter1, typename Iter2>
37 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search()
44 template <class Iter1, class Iter2>
50 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
51 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
52 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
56 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0); in test()
[all …]
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| D | default.pass.cpp | 40 template <typename Iter1, typename Iter2>
41 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search()
46 template <class Iter1, class Iter2>
52 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test()
53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test()
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test()
55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test()
56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
58 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia)); in test()
[all …]
|
| D | default.pred.pass.cpp | 50 template <typename Iter1, typename Iter2>
51 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search()
58 template <class Iter1, class Iter2>
64 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
70 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| D | search.pass.cpp | 22 template <class Iter1, class Iter2>
28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); in test()
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); in test()
30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); in test()
31 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); in test()
32 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
33 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
34 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia)); in test()
35 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)); in test()
36 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa)) == Iter1(ia+sa-3)); in test()
[all …]
|
| D | search_pred.pass.cpp | 32 template <class Iter1, class Iter2>
39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); in test()
42 … assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia)); in test()
45 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1… in test()
48 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia)); in test()
51 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
54 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
57 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia)); in test()
60 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), count_equal()) == Iter1(… in test()
63 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), count_equal()) == Iter1(… in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| D | find_end.pass.cpp | 22 template <class Iter1, class Iter2>
29 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1)); in test()
31 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18)); in test()
33 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15)); in test()
35 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4)) == Iter1(ia+11)); in test()
37 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5)) == Iter1(ia+6)); in test()
39 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6)) == Iter1(ia)); in test()
41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7)) == Iter1(ia+sa)); in test()
42 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b)) == Iter1(ia+sa)); in test()
43 assert(std::find_end(Iter1(ia), Iter1(ia), Iter2(b), Iter2(b+1)) == Iter1(ia)); in test()
|
| D | find_end_pred.pass.cpp | 33 template <class Iter1, class Iter2>
41 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
45 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
49 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
53 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
57 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
61 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
68 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
71 assert(std::find_end(Iter1(ia), Iter1(ia), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia)); in test()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| D | includes.pass.cpp | 23 template <class Iter1, class Iter2>
36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib))); in test()
37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1))); in test()
38 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib))); in test()
39 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa))); in test()
41 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb))); in test()
42 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa))); in test()
44 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2))); in test()
45 assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2))); in test()
47 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+1))); in test()
[all …]
|
| D | includes_comp.pass.cpp | 24 template <class Iter1, class Iter2>
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>())); in test()
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>())); in test()
39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>())); in test()
40 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), std::less<int>())); in test()
42 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>())); in test()
43 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), std::less<int>())); in test()
45 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>())); in test()
46 assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2), std::less<int>())); in test()
48 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+1), std::less<int>())); in test()
[all …]
|
| /external/libcxx/test/std/numerics/numeric.ops/inner.product/ |
| D | inner_product.pass.cpp | 27 template <class Iter1, class Iter2, class T>
29 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test()
34 template <class Iter1, class Iter2>
41 test(Iter1(a), Iter1(a), Iter2(b), 0, 0); in test()
42 test(Iter1(a), Iter1(a), Iter2(b), 10, 10); in test()
43 test(Iter1(a), Iter1(a+1), Iter2(b), 0, 6); in test()
44 test(Iter1(a), Iter1(a+1), Iter2(b), 10, 16); in test()
45 test(Iter1(a), Iter1(a+2), Iter2(b), 0, 16); in test()
46 test(Iter1(a), Iter1(a+2), Iter2(b), 10, 26); in test()
47 test(Iter1(a), Iter1(a+sa), Iter2(b), 0, 56); in test()
[all …]
|
| D | inner_product_comp.pass.cpp | 29 template <class Iter1, class Iter2, class T>
31 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test()
37 template <class Iter1, class Iter2>
44 test(Iter1(a), Iter1(a), Iter2(b), 1, 1); in test()
45 test(Iter1(a), Iter1(a), Iter2(b), 10, 10); in test()
46 test(Iter1(a), Iter1(a+1), Iter2(b), 1, 7); in test()
47 test(Iter1(a), Iter1(a+1), Iter2(b), 10, 70); in test()
48 test(Iter1(a), Iter1(a+2), Iter2(b), 1, 49); in test()
49 test(Iter1(a), Iter1(a+2), Iter2(b), 10, 490); in test()
50 test(Iter1(a), Iter1(a+sa), Iter2(b), 1, 117649); in test()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | SparseBitVector.h | 554 ElementListConstIter Iter1 = Elements.begin();
557 for (; Iter1 != Elements.end() && Iter2 != RHS.Elements.end();
558 ++Iter1, ++Iter2) {
559 if (*Iter1 != *Iter2)
562 return Iter1 == Elements.end() && Iter2 == RHS.Elements.end();
571 ElementListIter Iter1 = Elements.begin();
579 if (Iter1 == Elements.end() || Iter1->index() > Iter2->index()) {
580 Elements.insert(Iter1,
584 } else if (Iter1->index() == Iter2->index()) {
585 changed |= Iter1->unionWith(*Iter2);
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 23 template <class Iter1, class Iter2>
30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2))); in test()
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa))); in test()
32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3))); in test()
33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
34 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3))); in test()
35 assert(!std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
|
| D | lexicographical_compare_comp.pass.cpp | 25 template <class Iter1, class Iter2>
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c)); in test()
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c)); in test()
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c)); in test()
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
38 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c)); in test()
39 assert( std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.swap/ |
| D | swap_ranges.pass.cpp | 25 template<class Iter1, class Iter2>
31 Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j)); in test()
43 template<class Iter1, class Iter2>
53 Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j)); in test1()
|
| /external/clang/test/OpenMP/ |
| D | parallel_for_loop_messages.cpp | 327 class Iter1 { class
329 Iter1(float f = 0.0f, double d = 0.0) {} in Iter1() function in Iter1
330 Iter1(const Iter1 &) {} in Iter1() function in Iter1
331 Iter1 operator++() { return *this; } in operator ++()
332 Iter1 operator--() { return *this; } in operator --()
333 bool operator<(Iter1 a) { return true; } in operator <()
334 bool operator>=(Iter1 a) { return false; } in operator >=()
458 Iter1 begin1, end1; in test_with_random_access_iterator()
462 for (Iter1 I = begin1; I < end1; ++I) in test_with_random_access_iterator()
467 for (Iter1 I = begin1; I >= end1; ++I) in test_with_random_access_iterator()
[all …]
|
| D | simd_loop_messages.cpp | 323 class Iter1 { class
325 Iter1(float f=0.0f, double d=0.0) { } in Iter1() function in Iter1
326 Iter1(const Iter1 &) { } in Iter1() function in Iter1
327 Iter1 operator ++() { return *this; } in operator ++()
328 Iter1 operator --() { return *this; } in operator --()
329 bool operator <(Iter1 a) { return true; } in operator <()
330 bool operator >=(Iter1 a) { return false; } in operator >=()
446 Iter1 begin1, end1; in test_with_random_access_iterator()
450 for (Iter1 I = begin1; I < end1; ++I) in test_with_random_access_iterator()
455 for (Iter1 I = begin1; I >= end1; ++I) in test_with_random_access_iterator()
[all …]
|
| D | for_simd_loop_messages.cpp | 382 class Iter1 { class
384 Iter1(float f = 0.0f, double d = 0.0) {} in Iter1() function in Iter1
385 Iter1(const Iter1 &) {} in Iter1() argument
386 Iter1 operator++() { return *this; } in operator ++()
387 Iter1 operator--() { return *this; } in operator --()
388 bool operator<(Iter1 a) { return true; } in operator <()
389 bool operator>=(Iter1 a) { return false; } in operator >=()
533 Iter1 begin1, end1; in test_with_random_access_iterator()
538 for (Iter1 I = begin1; I < end1; ++I) in test_with_random_access_iterator()
544 for (Iter1 I = begin1; I >= end1; ++I) in test_with_random_access_iterator()
[all …]
|
| D | parallel_for_simd_loop_messages.cpp | 329 class Iter1 { class
331 Iter1(float f = 0.0f, double d = 0.0) {} in Iter1() function in Iter1
332 Iter1(const Iter1 &) {} in Iter1() argument
333 Iter1 operator++() { return *this; } in operator ++()
334 Iter1 operator--() { return *this; } in operator --()
335 bool operator<(Iter1 a) { return true; } in operator <()
336 bool operator>=(Iter1 a) { return false; } in operator >=()
459 Iter1 begin1, end1; in test_with_random_access_iterator()
463 for (Iter1 I = begin1; I < end1; ++I) in test_with_random_access_iterator()
468 for (Iter1 I = begin1; I >= end1; ++I) in test_with_random_access_iterator()
[all …]
|
| D | for_loop_messages.cpp | 399 class Iter1 { class
401 Iter1(float f = 0.0f, double d = 0.0) {} in Iter1() function in Iter1
402 Iter1(const Iter1 &) {} in Iter1() argument
403 Iter1 operator++() { return *this; } in operator ++()
404 Iter1 operator--() { return *this; } in operator --()
405 bool operator<(Iter1 a) { return true; } in operator <()
406 bool operator>=(Iter1 a) { return false; } in operator >=()
552 Iter1 begin1, end1; in test_with_random_access_iterator()
557 for (Iter1 I = begin1; I < end1; ++I) in test_with_random_access_iterator()
563 for (Iter1 I = begin1; I >= end1; ++I) in test_with_random_access_iterator()
[all …]
|
| D | taskloop_loop_messages.cpp | 400 class Iter1 { class
402 Iter1(float f = 0.0f, double d = 0.0) {} in Iter1() function in Iter1
403 Iter1(const Iter1 &) {} in Iter1() argument
404 Iter1 operator++() { return *this; } in operator ++()
405 Iter1 operator--() { return *this; } in operator --()
406 bool operator<(Iter1 a) { return true; } in operator <()
407 bool operator>=(Iter1 a) { return false; } in operator >=()
553 Iter1 begin1, end1; in test_with_random_access_iterator()
558 for (Iter1 I = begin1; I < end1; ++I) in test_with_random_access_iterator()
564 for (Iter1 I = begin1; I >= end1; ++I) in test_with_random_access_iterator()
[all …]
|
| D | taskloop_simd_loop_messages.cpp | 401 class Iter1 { class
403 Iter1(float f = 0.0f, double d = 0.0) {} in Iter1() function in Iter1
404 Iter1(const Iter1 &) {} in Iter1() function in Iter1
405 Iter1 operator++() { return *this; } in operator ++()
406 Iter1 operator--() { return *this; } in operator --()
407 bool operator<(Iter1 a) { return true; } in operator <()
408 bool operator>=(Iter1 a) { return false; } in operator >=()
554 Iter1 begin1, end1; in test_with_random_access_iterator()
559 for (Iter1 I = begin1; I < end1; ++I) in test_with_random_access_iterator()
565 for (Iter1 I = begin1; I >= end1; ++I) in test_with_random_access_iterator()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| D | set_union.pass.cpp | 26 template <class Iter1, class Iter2, class OutIter>
37 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), in test()
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb), in test()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| D | set_symmetric_difference.pass.cpp | 27 template <class Iter1, class Iter2, class OutIter>
38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), in test()
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb), in test()
|