aboutsummaryrefslogtreecommitdiff
path: root/paludis/visitor_TEST.cc
blob: d0c65ab59ab0589a6fcee9741d86b404538606bc (plain)
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
/* vim: set sw=4 sts=4 et foldmethod=syntax : */

/*
 * Copyright (c) 2006 Ciaran McCreesh <ciaranm@gentoo.org>
 *
 * This file is part of the Paludis package manager. Paludis is free software;
 * you can redistribute it and/or modify it under the terms of the GNU General
 * Public License as published by the Free Software Foundation; either version
 * 2 of the License, or (at your option) any later version.
 *
 * Paludis is distributed in the hope that it will be useful, but WITHOUT ANY
 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program; if not, write to the Free Software Foundation, Inc., 59 Temple
 * Place, Suite 330, Boston, MA  02111-1307  USA
 */

#include "visitor.hh"
#include "deleter.hh"
#include "indirect_iterator.hh"
#include <test/test_framework.hh>
#include <test/test_runner.hh>
#include <vector>
#include <algorithm>

using namespace paludis;
using namespace test;

/** \file
 * Test cases for visitor.hh .
 *
 * \ingroup Test
 * \ingroup Visitor
 */

#ifndef DOXYGEN

class Node;
class FooNode;
class BarNode;

typedef VisitorTypes<FooNode *, BarNode *> NodeVisitorTypes;

struct Node :
    virtual VisitableInterface<NodeVisitorTypes>
{
};

struct FooNode :
    Node,
    Visitable<FooNode, NodeVisitorTypes>
{
    std::string c_foo() const
    {
        return "c_foo";
    }

    std::string foo()
    {
        return "foo";
    }
};

struct BarNode :
    Node,
    Visitable<BarNode, NodeVisitorTypes>
{
    std::string c_bar() const
    {
        return "c_bar";
    }

    std::string bar()
    {
        return "bar";
    }
};

struct NodeCVisitor :
    NodeVisitorTypes::ConstVisitor
{
    std::string r;

    virtual void visit(const FooNode * const f)
    {
        r.append(f->c_foo());
    }

    virtual void visit(const BarNode * const b)
    {
        r.append(b->c_bar());
    }
};

struct NodeVisitor :
    NodeVisitorTypes::Visitor
{
    std::string r;

    virtual void visit(FooNode * const f)
    {
        r.append(f->foo());
    }

    virtual void visit(BarNode * const b)
    {
        r.append(b->bar());
    }
};

#endif

namespace test_cases
{
    /**
     * \test Test const visitors.
     *
     * \ingroup Test
     */
    struct ConstVisitorTest : TestCase
    {
        ConstVisitorTest() : TestCase("const visitor") { }

        void run()
        {
            std::vector<Node *> v;

            v.push_back(new FooNode);
            v.push_back(new BarNode);
            v.push_back(new FooNode);

            NodeCVisitor c;
            TEST_CHECK_EQUAL(c.r, "");
            std::for_each(v.begin(), v.end(), accept_visitor(&c));
            TEST_CHECK_EQUAL(c.r, "c_fooc_barc_foo");

            std::for_each(v.begin(), v.end(), Deleter());
        }
    } test_const_visitor;

    /**
     * \test Test non-const visitors.
     *
     * \ingroup Test
     */
    struct VisitorTest : TestCase
    {
        VisitorTest() : TestCase("visitor") { }

        void run()
        {
            std::vector<Node *> v;

            v.push_back(new FooNode);
            v.push_back(new BarNode);
            v.push_back(new FooNode);

            NodeVisitor c;
            TEST_CHECK_EQUAL(c.r, "");
            std::for_each(v.begin(), v.end(), accept_visitor(&c));
            TEST_CHECK_EQUAL(c.r, "foobarfoo");

            std::for_each(v.begin(), v.end(), Deleter());
        }
    } test_visitor;
}