// 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 #include #include "../simple_test.hpp" #include "../test_utils.hpp" int main() { using namespace ranges; { std::stringstream sinx("1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 1 2 3 4 42 6 7 8 9 "); auto rng1 = istream(sinx) | views::delimit(42); // | views::common; CPP_assert(!common_range); CPP_assert(input_range); CPP_assert(!forward_range); auto const& crng1 = rng1; CPP_assert(!range); auto rng2 = rng1 | views::common; CPP_assert(view_); CPP_assert(common_range); CPP_assert(input_iterator); CPP_assert(same_as::iterator_category, std::input_iterator_tag>); CPP_assert(!forward_iterator); ::check_equal(rng2, {1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4}); } std::vector v{1,2,3,4,5,6,7,8,9,0,42,64}; { auto rng1 = v | views::delimit(42) | views::common; CPP_assert(view_); CPP_assert(common_range); CPP_assert(!sized_range); CPP_assert(forward_iterator); CPP_assert(!bidirectional_iterator); auto const & crng1 = rng1; auto i = rng1.begin(); // non-const auto j = crng1.begin(); // const j = i; ::check_equal(rng1, {1, 2, 3, 4, 5, 6, 7, 8, 9, 0}); } { std::list l{1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0}; auto rng3 = views::counted(l.begin(), 10) | views::common; CPP_assert(view_); CPP_assert(common_range); CPP_assert(sized_range); CPP_assert(forward_iterator); CPP_assert(!bidirectional_iterator); CPP_assert(sized_sentinel_for); auto b = begin(rng3); auto e = end(rng3); CHECK((e-b) == 10); CHECK((b-e) == -10); CHECK((e-e) == 0); CHECK((next(b)-b) == 1); // Pass-through of already-common ranges is OK: rng3 = rng3 | views::common; } { auto rng4 = views::counted(begin(v), 8) | views::common; CPP_assert(view_); CPP_assert(common_range); CPP_assert(sized_range); CPP_assert(random_access_iterator); ::check_equal(rng4, {1, 2, 3, 4, 5, 6, 7, 8}); } { // Regression test for issue#504: auto rng1 = views::repeat_n( 0, 10 ); CPP_assert(view_); CPP_assert(!common_range); CPP_assert(random_access_range); CPP_assert(sized_range); auto const& crng1 = rng1; CPP_assert(random_access_range); CPP_assert(sized_range); auto rng2 = rng1 | views::common; CPP_assert(view_); CPP_assert(common_range); CPP_assert(random_access_range); CPP_assert(sized_range); auto const& crng2 = rng2; CPP_assert(common_range); CPP_assert(random_access_range); CPP_assert(sized_range); ::check_equal(rng2, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}); } { int const rgi[] = {1,2,3,4}; auto rng = debug_input_view{rgi} | views::common; using Rng = decltype(rng); CPP_assert(input_range && view_); CPP_assert(!forward_range); CPP_assert(common_range); ::check_equal(rng, {1,2,3,4}); } return ::test_result(); }