// Range v3 library // // Copyright Eric Niebler 2014-present // // Use, modification and distribution is subject to the // Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Project home: https://github.com/ericniebler/range-v3 #include #include #include #include #include #include #include #include "../simple_test.hpp" #include "../test_utils.hpp" struct empty {}; int main() { std::vector vi{1,2,3,4}; using namespace ranges; iterator_range::iterator> r0 {vi.begin(), vi.end()}; CPP_assert(view_); CPP_assert(sized_range); CHECK(r0.size() == 4u); CHECK(r0.begin() == vi.begin()); CHECK(r0.end() == vi.end()); CHECK(ranges::get<0>(r0) == vi.begin()); CHECK(ranges::get<1>(r0) == vi.end()); ++r0.begin(); CHECK(r0.size() == 3u); std::pair::iterator, std::vector::iterator> p0 = r0; CHECK(p0.first == vi.begin()+1); CHECK(p0.second == vi.end()); iterator_range::iterator, unreachable_sentinel_t> r1 { r0.begin(), {} }; CPP_assert(view_); CPP_assert(!sized_range); CHECK(r1.begin() == vi.begin()+1); r1.end() = unreachable; ++r0.begin(); CHECK(r0.begin() == vi.begin()+2); CHECK(r0.size() == 2u); --r0.end(); CHECK(r0.end() == vi.end()-1); CHECK(r0.size() == 1u); CHECK(r0.front() == 3); CHECK(r0.back() == 3); std::pair::iterator, unreachable_sentinel_t> p1 = r1; CHECK(p1.first == vi.begin()+1); iterator_range::iterator, unreachable_sentinel_t> r2 { p1 }; CHECK(r1.begin() == vi.begin()+1); std::list li{1,2,3,4}; sized_iterator_range::iterator> l0 {li.begin(), li.end(), li.size()}; CPP_assert(view_); CPP_assert(sized_range); CHECK(l0.begin() == li.begin()); CHECK(l0.end() == li.end()); CHECK(l0.size() == li.size()); return ::test_result(); }