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
|
/********************* */
/*! \file node_white.h
** \verbatim
** Original author: Morgan Deters <mdeters@cs.nyu.edu>
** Major contributors: none
** Minor contributors (to current version): Tim King <taking@cs.nyu.edu>, Dejan Jovanović <dejan.jovanovic@gmail.com>
** This file is part of the CVC4 project.
** Copyright (c) 2009-2013 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief White box testing of CVC4::Node.
**
** White box testing of CVC4::Node.
**/
#include <cxxtest/TestSuite.h>
#include <string>
#include "expr/node_value.h"
#include "expr/node_builder.h"
#include "expr/node_manager.h"
#include "expr/node.h"
#include "context/context.h"
#include "util/cvc4_assert.h"
using namespace CVC4;
using namespace CVC4::kind;
using namespace CVC4::context;
using namespace CVC4::expr;
using namespace std;
class NodeWhite : public CxxTest::TestSuite {
Context* d_ctxt;
NodeManager* d_nm;
NodeManagerScope* d_scope;
public:
void setUp() {
d_ctxt = new Context();
d_nm = new NodeManager(d_ctxt, NULL);
d_scope = new NodeManagerScope(d_nm);
}
void tearDown() {
delete d_scope;
delete d_nm;
delete d_ctxt;
}
void testNull() {
TS_ASSERT_EQUALS(Node::null(), Node::s_null);
}
void testCopyCtor() {
Node e(Node::s_null);
}
void testBuilder() {
NodeBuilder<> b;
TS_ASSERT(b.d_nv->getId() == 0);
TS_ASSERT(b.d_nv->getKind() == UNDEFINED_KIND);
TS_ASSERT_EQUALS(b.d_nv->d_nchildren, 0u);
/* etc. */
}
void testIterators() {
Node x = d_nm->mkVar("x", d_nm->integerType());
Node y = d_nm->mkVar("y", d_nm->integerType());
Node x_plus_y = d_nm->mkNode(PLUS, x, y);
Node two = d_nm->mkConst(Rational(2));
Node x_times_2 = d_nm->mkNode(MULT, x, two);
Node n = d_nm->mkNode(PLUS, x_times_2, x_plus_y, y);
Node::iterator i;
i = find(n.begin(), n.end(), x_plus_y);
TS_ASSERT(i != n.end());
TS_ASSERT(*i == x_plus_y);
i = find(n.begin(), n.end(), x);
TS_ASSERT(i == n.end());
i = find(x_times_2.begin(), x_times_2.end(), two);
TS_ASSERT(i != x_times_2.end());
TS_ASSERT(*i == two);
i = find(n.begin(), n.end(), y);
TS_ASSERT(i != n.end());
TS_ASSERT(*i == y);
vector<Node> v;
copy(n.begin(), n.end(), back_inserter(v));
TS_ASSERT(n.getNumChildren() == v.size());
TS_ASSERT(3 == v.size());
TS_ASSERT(v[0] == x_times_2);
TS_ASSERT(v[1] == x_plus_y);
TS_ASSERT(v[2] == y);
}
};
|
