Cross Reference: /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find.end/find_end

Lines Matching refs:sa

38     const unsigned sa = sizeof(ia)/sizeof(ia[0]);
41     assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1));
42     assert(count_equal::count <= 1*(sa-1+1));
45     assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18));
46     assert(count_equal::count <= 2*(sa-2+1));
49     assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15));
50     assert(count_equal::count <= 3*(sa-3+1));
53     assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11));
54     assert(count_equal::count <= 4*(sa-4+1));
57     assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6));
58     assert(count_equal::count <= 5*(sa-5+1));
61     assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia));
62     assert(count_equal::count <= 6*(sa-6+1));
65     assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa));
66     assert(count_equal::count <= 7*(sa-7+1));
68     assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa));

OpenGrok