File: copy_backward.cpp

package info (click to toggle)
boost1.83 1.83.0-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 545,632 kB
  • sloc: cpp: 3,857,086; xml: 125,552; ansic: 34,414; python: 25,887; asm: 5,276; sh: 4,799; ada: 1,681; makefile: 1,629; perl: 1,212; pascal: 1,139; sql: 810; yacc: 478; ruby: 102; lisp: 24; csh: 6
file content (84 lines) | stat: -rw-r--r-- 2,239 bytes parent folder | download | duplicates (14)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
// Boost.Range library
//
//  Copyright Neil Groves 2009. 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)
//
//
// For more information, see http://www.boost.org/libs/range/
//
// Credits:
//  awulkiew highlighted that this test was not successfully testing the
//  algorithm.
//
#include <boost/range/algorithm/copy_backward.hpp>

#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

#include <boost/assign.hpp>
#include <boost/range/iterator.hpp>
#include <algorithm>
#include <list>
#include <vector>

namespace boost_range_test
{
    namespace
    {
template<typename Container>
void test_copy_backward_impl(std::size_t n)
{
    Container source;
    typedef typename Container::value_type value_t;
    for (std::size_t i = 0; i < n; ++i)
        source.push_back(static_cast<value_t>(i));

    std::vector<value_t> target(n);

    typedef typename boost::range_iterator<
        std::vector<value_t>
    >::type iterator_t;

    iterator_t it = boost::copy_backward(source, target.end());

    BOOST_CHECK(it == target.begin());

    BOOST_CHECK_EQUAL_COLLECTIONS(target.begin(), target.end(),
                                  source.begin(), source.end());

    BOOST_CHECK(it == boost::copy_backward(
                        boost::make_iterator_range(source), target.end()));

    BOOST_CHECK_EQUAL_COLLECTIONS(target.begin(), target.end(),
                                  source.begin(), source.end());
}

template<typename Container>
void test_copy_backward_impl()
{
    test_copy_backward_impl<Container>(0u);
    test_copy_backward_impl<Container>(1u);
    test_copy_backward_impl<Container>(100u);
}

void test_copy_backward()
{
    test_copy_backward_impl<std::vector<int> >();
    test_copy_backward_impl<std::list<int> >();
}
    } // anonymous namespace
} // namespace boost_range_test


boost::unit_test::test_suite*
init_unit_test_suite(int, char*[])
{
    boost::unit_test::test_suite* test
        = BOOST_TEST_SUITE("RangeTestSuite.algorithm.copy_backward");

    test->add(BOOST_TEST_CASE(&boost_range_test::test_copy_backward));

    return test;
}