| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n_pred.pass.cpp | 36 struct count_equal struct
44 unsigned count_equal::count = 0;
53 count_equal::count = 0;
54 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
55 assert(count_equal::count <= sa);
56 count_equal::count = 0;
57 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
58 assert(count_equal::count <= sa);
59 count_equal::count = 0;
60 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa))
[all...] |
| search_pred.pass.cpp | 36 struct count_equal struct
44 unsigned count_equal::count = 0;
52 count_equal::count = 0;
53 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia));
54 assert(count_equal::count <= 0);
55 count_equal::count = 0;
56 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia));
57 assert(count_equal::count <= sa);
58 count_equal::count = 0;
59 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1))
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_pred.pass.cpp | 38 struct count_equal struct
46 unsigned count_equal::count = 0;
54 count_equal::count = 0;
55 Iter r = std::unique(Iter(ia), Iter(ia+sa), count_equal());
58 assert(count_equal::count == sa-1);
62 count_equal::count = 0;
63 r = std::unique(Iter(ib), Iter(ib+sb), count_equal());
67 assert(count_equal::count == sb-1);
71 count_equal::count = 0;
72 r = std::unique(Iter(ic), Iter(ic+sc), count_equal());
[all...] |
| unique_copy_pred.pass.cpp | 42 struct count_equal struct
50 unsigned count_equal::count = 0;
59 count_equal::count = 0;
60 OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja), count_equal());
63 assert(count_equal::count == sa-1);
68 count_equal::count = 0;
69 r = std::unique_copy(InIter(ib), InIter(ib+sb), OutIter(jb), count_equal());
73 assert(count_equal::count == sb-1);
78 count_equal::count = 0;
79 r = std::unique_copy(InIter(ic), InIter(ic+sc), OutIter(jc), count_equal());
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end_pred.pass.cpp | 25 struct count_equal struct
52 unsigned count_equal::count = 0;
61 count_equal::count = 0;
62 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1));
63 assert(count_equal::count <= 1*(sa-1+1));
65 count_equal::count = 0;
66 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18));
67 assert(count_equal::count <= 2*(sa-2+1));
69 count_equal::count = 0;
70 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15))
[all...] |
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
| default.pred.pass.cpp | 41 struct count_equal struct
49 unsigned count_equal::count = 0;
53 std::default_searcher<Iter2, count_equal> s{b2, e2};
54 count_equal::count = 0;
56 assert(count_equal::count <= max_count);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| make_default_searcher.pred.pass.cpp | 26 struct count_equal struct
34 unsigned count_equal::count = 0;
38 count_equal::count = 0;
41 assert(count_equal::count <= max_count);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pred.pass.cpp | 41 struct count_equal struct
49 unsigned count_equal::count = 0;
53 std::experimental::default_searcher<Iter2, count_equal> s{b2, e2};
54 count_equal::count = 0;
56 assert(count_equal::count <= max_count);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| hash.pred.pass.cpp | 45 struct count_equal struct
53 unsigned count_equal::count = 0;
59 count_equal>
61 count_equal::count = 0;
63 assert(count_equal::count <= max_count);
|
| pred.pass.cpp | 41 struct count_equal struct
49 unsigned count_equal::count = 0;
54 typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, count_equal> s{b2, e2};
55 count_equal::count = 0;
57 assert(count_equal::count <= max_count);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| hash.pred.pass.cpp | 44 struct count_equal struct
52 unsigned count_equal::count = 0;
58 count_equal>
60 count_equal::count = 0;
62 assert(count_equal::count <= max_count);
|
| pred.pass.cpp | 40 struct count_equal struct
48 unsigned count_equal::count = 0;
53 typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, count_equal> s{b2, e2};
54 count_equal::count = 0;
56 assert(count_equal::count <= max_count);
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| hash.pred.pass.cpp | 46 struct count_equal struct
54 unsigned count_equal::count = 0;
60 count_equal>
62 count_equal::count = 0;
64 assert(count_equal::count <= max_count);
|
| pred.pass.cpp | 42 struct count_equal struct
50 unsigned count_equal::count = 0;
55 typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, count_equal> s{b2, e2};
56 count_equal::count = 0;
58 assert(count_equal::count <= max_count);
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| hash.pred.pass.cpp | 45 struct count_equal struct
53 unsigned count_equal::count = 0;
59 count_equal>
61 count_equal::count = 0;
63 assert(count_equal::count <= max_count);
|
| pred.pass.cpp | 41 struct count_equal struct
49 unsigned count_equal::count = 0;
54 typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, count_equal> s{b2, e2};
55 count_equal::count = 0;
57 assert(count_equal::count <= max_count);
|
