| /dports/devel/hyperscan/boost_1_75_0/libs/range/test/algorithm_test/ |
| H A D | find_end.cpp | 43 iter_t result = boost::find_end(cont, m_cont); in test_iter()
44 BOOST_CHECK( result == boost::find_end(boost::make_iterator_range(cont), m_cont) ); in test_iter()
45 BOOST_CHECK( result == boost::find_end(cont, boost::make_iterator_range(m_cont)) ); in test_iter()
58 result_t result = boost::find_end<return_type>(cont, policy.cont()); in operator ()()
71 return std::find_end(cont.begin(), cont.end(), in reference()
97 iter_t it = boost::find_end(cont, m_cont, m_pred); in test_iter()
98 BOOST_CHECK( it == boost::find_end(boost::make_iterator_range(cont), m_cont, m_pred) ); in test_iter()
99 BOOST_CHECK( it == boost::find_end(cont, boost::make_iterator_range(m_cont), m_pred) ); in test_iter()
112 result_t result = boost::find_end<return_type>(cont, policy.cont(), policy.pred()); in operator ()()
117 return boost::find_end<return_type>(cont, policy.cont(), policy.pred()); in operator ()()
[all …]
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/devel/libc++/libcxx-10.0.1.src/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | find_end_pred.pass.cpp | 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
77 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
81 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
85 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
88 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/range/doc/reference/algorithm/ |
| H A D | find_end.qbk | 6 [section:find_end find_end]
13 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
21 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
29 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
38 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
43 The versions of `find_end` that return an iterator, return an iterator to the beginning of the last…
44 … for non-predicate versions of `find_end`, and by satisfying `pred` in the predicate versions. The…
48 Defined in the header file `boost/range/algorithm/find_end.hpp`
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/range/doc/reference/algorithm/ |
| H A D | find_end.qbk | 6 [section:find_end find_end]
13 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
21 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
29 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
38 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
43 The versions of `find_end` that return an iterator, return an iterator to the beginning of the last…
44 … for non-predicate versions of `find_end`, and by satisfying `pred` in the predicate versions. The…
48 Defined in the header file `boost/range/algorithm/find_end.hpp`
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/range/doc/reference/algorithm/ |
| H A D | find_end.qbk | 6 [section:find_end find_end]
13 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
21 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
29 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
38 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
43 The versions of `find_end` that return an iterator, return an iterator to the beginning of the last…
44 … for non-predicate versions of `find_end`, and by satisfying `pred` in the predicate versions. The…
48 Defined in the header file `boost/range/algorithm/find_end.hpp`
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/range/doc/reference/algorithm/ |
| H A D | find_end.qbk | 6 [section:find_end find_end]
13 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
21 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
29 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
38 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
43 The versions of `find_end` that return an iterator, return an iterator to the beginning of the last…
44 … for non-predicate versions of `find_end`, and by satisfying `pred` in the predicate versions. The…
48 Defined in the header file `boost/range/algorithm/find_end.hpp`
|
| /dports/databases/percona57-server/boost_1_59_0/libs/range/doc/reference/algorithm/ |
| H A D | find_end.qbk | 6 [section:find_end find_end]
13 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
21 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
29 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
38 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
43 The versions of `find_end` that return an iterator, return an iterator to the beginning of the last…
44 … for non-predicate versions of `find_end`, and by satisfying `pred` in the predicate versions. The…
48 Defined in the header file `boost/range/algorithm/find_end.hpp`
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/range/doc/reference/algorithm/ |
| H A D | find_end.qbk | 6 [section:find_end find_end]
13 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
21 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
29 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
38 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
43 The versions of `find_end` that return an iterator, return an iterator to the beginning of the last…
44 … for non-predicate versions of `find_end`, and by satisfying `pred` in the predicate versions. The…
48 Defined in the header file `boost/range/algorithm/find_end.hpp`
|
| /dports/databases/percona57-client/boost_1_59_0/libs/range/doc/reference/algorithm/ |
| H A D | find_end.qbk | 6 [section:find_end find_end]
13 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
21 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
29 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
38 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
43 The versions of `find_end` that return an iterator, return an iterator to the beginning of the last…
44 … for non-predicate versions of `find_end`, and by satisfying `pred` in the predicate versions. The…
48 Defined in the header file `boost/range/algorithm/find_end.hpp`
|
| /dports/devel/boost-libs/boost_1_72_0/libs/range/doc/reference/algorithm/ |
| H A D | find_end.qbk | 6 [section:find_end find_end]
13 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
21 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
29 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
38 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
43 The versions of `find_end` that return an iterator, return an iterator to the beginning of the last…
44 … for non-predicate versions of `find_end`, and by satisfying `pred` in the predicate versions. The…
48 Defined in the header file `boost/range/algorithm/find_end.hpp`
|
| /dports/devel/hyperscan/boost_1_75_0/libs/range/doc/reference/algorithm/ |
| H A D | find_end.qbk | 6 [section:find_end find_end]
13 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
21 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
29 find_end(ForwardRange1& rng1, const ForwardRange2& rng2);
38 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
43 The versions of `find_end` that return an iterator, return an iterator to the beginning of the last…
44 … for non-predicate versions of `find_end`, and by satisfying `pred` in the predicate versions. The…
48 Defined in the header file `boost/range/algorithm/find_end.hpp`
|
| /dports/www/anyterm/anyterm-1.1.29/libpbe/include/ |
| H A D | StringSplitter.hh | 47 find_end(); in operator *()
58 find_end(); in operator ++()
62 find_end(); in operator ++()
68 virtual void find_end(void) = 0;
87 void find_end(void) { in find_end() function in StringSplitterSeq
112 void find_end(void) { in find_end() function in StringSplitterAny
|
| /dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/testsuite/25_algorithms/find_end/ |
| H A D | 1.cc | 29 using std::find_end;
37 VERIFY(find_end(con1.begin(), con1.end(), con1.begin(), con1.end()).ptr == array); in test1()
38 VERIFY(find_end(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array); in test1()
39 VERIFY(find_end(con2.begin(), con2.end(), con1.begin(), con1.end()).ptr == array + 1); in test1()
49 VERIFY(find_end(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array1 + 3); in test2()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/find_end/ |
| H A D | 1.cc | 29 using std::find_end;
37 VERIFY(find_end(con1.begin(), con1.end(), con1.begin(), con1.end()).ptr == array); in test1()
38 VERIFY(find_end(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array); in test1()
39 VERIFY(find_end(con2.begin(), con2.end(), con1.begin(), con1.end()).ptr == array + 1); in test1()
49 VERIFY(find_end(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array1 + 3); in test2()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/find_end/ |
| H A D | 1.cc | 29 using std::find_end;
37 VERIFY(find_end(con1.begin(), con1.end(), con1.begin(), con1.end()).ptr == array); in test1()
38 VERIFY(find_end(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array); in test1()
39 VERIFY(find_end(con2.begin(), con2.end(), con1.begin(), con1.end()).ptr == array + 1); in test1()
49 VERIFY(find_end(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array1 + 3); in test2()
|