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
|
/******************************************************************************
* Top contributors (to current version):
* Gereon Kremer, Aina Niemetz
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2025 by the authors listed in the file AUTHORS
* in the top-level source directory and their institutional affiliations.
* All rights reserved. See the file COPYING in the top-level source
* directory for licensing information.
* ****************************************************************************
*
* Black box testing of expr/algorithms/
*/
#include "base/output.h"
#include "expr/algorithm/flatten.h"
#include "expr/node_manager.h"
#include "test_node.h"
namespace cvc5::internal {
using namespace expr;
using namespace kind;
namespace test {
class TestNodeBlackNodeAlgorithms : public TestNode
{
};
TEST_F(TestNodeBlackNodeAlgorithms, flatten)
{
{
Node x = d_nodeManager->mkBoundVar(*d_realTypeNode);
Node n = d_nodeManager->mkNode(Kind::ADD, x, x);
EXPECT_FALSE(expr::algorithm::canFlatten(n));
EXPECT_FALSE(expr::algorithm::canFlatten(n, Kind::ADD));
EXPECT_FALSE(expr::algorithm::canFlatten(n, Kind::MULT));
EXPECT_FALSE(expr::algorithm::canFlatten(n, Kind::ADD, Kind::MULT));
EXPECT_EQ(expr::algorithm::flatten(d_nodeManager.get(), n), n);
EXPECT_EQ(expr::algorithm::flatten(d_nodeManager.get(), n, Kind::ADD), n);
EXPECT_EQ(expr::algorithm::flatten(d_nodeManager.get(), n, Kind::MULT), n);
EXPECT_EQ(
expr::algorithm::flatten(d_nodeManager.get(), n, Kind::ADD, Kind::MULT),
n);
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children);
EXPECT_EQ(children.size(), 2);
EXPECT_EQ(children[0], x);
EXPECT_EQ(children[1], x);
}
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children, Kind::ADD);
EXPECT_EQ(children.size(), 2);
EXPECT_EQ(children[0], x);
EXPECT_EQ(children[1], x);
}
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children, Kind::MULT);
EXPECT_EQ(children.size(), 1);
EXPECT_EQ(children[0], n);
}
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children, Kind::ADD, Kind::MULT);
EXPECT_EQ(children.size(), 2);
EXPECT_EQ(children[0], x);
EXPECT_EQ(children[1], x);
}
}
{
Node x = d_nodeManager->mkBoundVar(*d_realTypeNode);
Node n = d_nodeManager->mkNode(
Kind::ADD, x, d_nodeManager->mkNode(Kind::ADD, x, x));
EXPECT_TRUE(expr::algorithm::canFlatten(n));
EXPECT_TRUE(expr::algorithm::canFlatten(n, Kind::ADD));
EXPECT_FALSE(expr::algorithm::canFlatten(n, Kind::MULT));
EXPECT_TRUE(expr::algorithm::canFlatten(n, Kind::ADD, Kind::MULT));
EXPECT_NE(expr::algorithm::flatten(d_nodeManager.get(), n), n);
EXPECT_NE(expr::algorithm::flatten(d_nodeManager.get(), n, Kind::ADD), n);
EXPECT_EQ(expr::algorithm::flatten(d_nodeManager.get(), n, Kind::MULT), n);
EXPECT_NE(
expr::algorithm::flatten(d_nodeManager.get(), n, Kind::ADD, Kind::MULT),
n);
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children);
EXPECT_EQ(children.size(), 3);
EXPECT_EQ(children[0], x);
EXPECT_EQ(children[1], x);
EXPECT_EQ(children[2], x);
}
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children, Kind::ADD);
EXPECT_EQ(children.size(), 3);
EXPECT_EQ(children[0], x);
EXPECT_EQ(children[1], x);
EXPECT_EQ(children[2], x);
}
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children, Kind::MULT);
EXPECT_EQ(children.size(), 1);
EXPECT_EQ(children[0], n);
}
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children, Kind::ADD, Kind::MULT);
EXPECT_EQ(children.size(), 3);
EXPECT_EQ(children[0], x);
EXPECT_EQ(children[1], x);
EXPECT_EQ(children[2], x);
}
}
{
Node x = d_nodeManager->mkBoundVar(*d_realTypeNode);
Node n = d_nodeManager->mkNode(
Kind::ADD, x, d_nodeManager->mkNode(Kind::MULT, x, x));
EXPECT_FALSE(expr::algorithm::canFlatten(n));
EXPECT_FALSE(expr::algorithm::canFlatten(n, Kind::ADD));
EXPECT_FALSE(expr::algorithm::canFlatten(n, Kind::MULT));
EXPECT_TRUE(expr::algorithm::canFlatten(n, Kind::ADD, Kind::MULT));
EXPECT_EQ(expr::algorithm::flatten(d_nodeManager.get(), n), n);
EXPECT_EQ(expr::algorithm::flatten(d_nodeManager.get(), n, Kind::ADD), n);
EXPECT_EQ(expr::algorithm::flatten(d_nodeManager.get(), n, Kind::MULT), n);
EXPECT_NE(
expr::algorithm::flatten(d_nodeManager.get(), n, Kind::ADD, Kind::MULT),
n);
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children);
EXPECT_EQ(children.size(), 2);
EXPECT_EQ(children[0], x);
EXPECT_EQ(children[1], n[1]);
}
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children, Kind::ADD);
EXPECT_EQ(children.size(), 2);
EXPECT_EQ(children[0], x);
EXPECT_EQ(children[1], n[1]);
}
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children, Kind::MULT);
EXPECT_EQ(children.size(), 1);
EXPECT_EQ(children[0], n);
}
{
std::vector<TNode> children;
expr::algorithm::flatten(n, children, Kind::ADD, Kind::MULT);
EXPECT_EQ(children.size(), 3);
EXPECT_EQ(children[0], x);
EXPECT_EQ(children[1], x);
EXPECT_EQ(children[2], x);
}
}
}
} // namespace test
} // namespace cvc5::internal
|
