File: chained.cpp

package info (click to toggle)
boost1.90 1.90.0-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 593,120 kB
  • sloc: cpp: 4,190,908; xml: 196,648; python: 34,618; ansic: 23,145; asm: 5,468; sh: 3,774; makefile: 1,161; perl: 1,020; sql: 728; ruby: 676; yacc: 478; java: 77; lisp: 24; csh: 6
file content (119 lines) | stat: -rw-r--r-- 3,091 bytes parent folder | download | duplicates (13)
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
// Boost.Range library
//
//  Copyright Neil Groves 2014. 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:
//  Jurgen Hunold provided a test case that demonstrated that the range adaptors
//  were producing iterators that were not default constructible. This became
//  symptomatic after enabling concept checking assertions. This test is a
//  lightly modified version of his supplied code to ensure that his use case
//  never breaks again. (hopefully!)
//

#include <boost/range/adaptor/transformed.hpp>
#include <boost/range/adaptor/filtered.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/bind/bind.hpp>

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

#include <vector>
#include <set>

namespace boost_range_test
{
    namespace
    {

class foo
{
public:
    static foo from_string(const std::string& source)
    {
        foo f;
        f.m_valid = true;
        f.m_value = 0u;
        for (std::string::const_iterator it = source.begin();
             it != source.end(); ++it)
        {
            f.m_value += *it;
            if ((*it < 'a') || (*it > 'z'))
                f.m_valid = false;
        }
        return f;
    }
    bool is_valid() const
    {
        return m_valid;
    }
    bool operator<(const foo& other) const
    {
        return m_value < other.m_value;
    }
    bool operator==(const foo& other) const
    {
        return m_value == other.m_value && m_valid == other.m_valid;
    }
    bool operator!=(const foo& other) const
    {
        return !operator==(other);
    }

    friend inline std::ostream& operator<<(std::ostream& out, const foo& obj)
    {
        out << "{value=" << obj.m_value
            << ", valid=" << std::boolalpha << obj.m_valid << "}\n";
        return out;
    }

private:
    boost::uint64_t m_value;
    bool m_valid;
};

void chained_adaptors_test()
{
    std::vector<std::string> sep;

    sep.push_back("AB");
    sep.push_back("ab");
    sep.push_back("aghj");

    std::set<foo> foos;

    using namespace boost::placeholders;

    boost::copy(sep
        | boost::adaptors::transformed(boost::bind(&foo::from_string, _1))
        | boost::adaptors::filtered(boost::bind(&foo::is_valid, _1)),
        std::inserter(foos, foos.end()));

    std::vector<foo> reference;
    reference.push_back(foo::from_string("ab"));
    reference.push_back(foo::from_string("aghj"));

    BOOST_CHECK_EQUAL_COLLECTIONS(
                reference.begin(), reference.end(),
                foos.begin(), foos.end());
}

    } // anonymous namespace
} // namespace boost_range_test

boost::unit_test::test_suite*
init_unit_test_suite(int argc, char* argv[])
{
    boost::unit_test::test_suite* test
        = BOOST_TEST_SUITE( "RangeTestSuite.adaptor.chained adaptors" );

    test->add(BOOST_TEST_CASE( boost_range_test::chained_adaptors_test));

    return test;
}