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
171
172
173
174
175
176
177
178
179
|
/********************* */
/*! \file subs.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2021 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.\endverbatim
**
** \brief Simple substitution utility
**/
#include "expr/subs.h"
#include <sstream>
#include "theory/rewriter.h"
namespace CVC4 {
bool Subs::empty() const { return d_vars.empty(); }
size_t Subs::size() const { return d_vars.size(); }
bool Subs::contains(Node v) const
{
return std::find(d_vars.begin(), d_vars.end(), v) != d_vars.end();
}
Node Subs::getSubs(Node v) const
{
std::vector<Node>::const_iterator it =
std::find(d_vars.begin(), d_vars.end(), v);
if (it == d_vars.end())
{
return Node::null();
}
size_t i = std::distance(d_vars.begin(), it);
Assert(i < d_subs.size());
return d_subs[i];
}
void Subs::add(Node v)
{
// default, use a fresh skolem of the same type
Node s = NodeManager::currentNM()->mkSkolem("sk", v.getType());
add(v, s);
}
void Subs::add(const std::vector<Node>& vs)
{
for (const Node& v : vs)
{
add(v);
}
}
void Subs::add(Node v, Node s)
{
Assert(v.getType().isComparableTo(s.getType()));
d_vars.push_back(v);
d_subs.push_back(s);
}
void Subs::add(const std::vector<Node>& vs, const std::vector<Node>& ss)
{
Assert(vs.size() == ss.size());
for (size_t i = 0, nvs = vs.size(); i < nvs; i++)
{
add(vs[i], ss[i]);
}
}
void Subs::addEquality(Node eq)
{
Assert(eq.getKind() == kind::EQUAL);
add(eq[0], eq[1]);
}
void Subs::append(Subs& s)
{
// add the substitution list
add(s.d_vars, s.d_subs);
}
Node Subs::apply(Node n, bool doRewrite) const
{
if (d_vars.empty())
{
return n;
}
Node ns =
n.substitute(d_vars.begin(), d_vars.end(), d_subs.begin(), d_subs.end());
if (doRewrite)
{
ns = theory::Rewriter::rewrite(ns);
}
return ns;
}
Node Subs::rapply(Node n, bool doRewrite) const
{
if (d_vars.empty())
{
return n;
}
Node ns =
n.substitute(d_subs.begin(), d_subs.end(), d_vars.begin(), d_vars.end());
if (doRewrite)
{
ns = theory::Rewriter::rewrite(ns);
}
return ns;
}
void Subs::applyToRange(Subs& s, bool doRewrite) const
{
if (d_vars.empty())
{
return;
}
for (size_t i = 0, ns = s.d_subs.size(); i < ns; i++)
{
s.d_subs[i] = apply(s.d_subs[i], doRewrite);
}
}
void Subs::rapplyToRange(Subs& s, bool doRewrite) const
{
if (d_vars.empty())
{
return;
}
for (size_t i = 0, ns = s.d_subs.size(); i < ns; i++)
{
s.d_subs[i] = rapply(s.d_subs[i], doRewrite);
}
}
Node Subs::getEquality(size_t i) const
{
Assert(i < d_vars.size());
return d_vars[i].eqNode(d_subs[i]);
}
std::map<Node, Node> Subs::toMap() const
{
std::map<Node, Node> ret;
for (size_t i = 0, nvs = d_vars.size(); i < nvs; i++)
{
ret[d_vars[i]] = d_subs[i];
}
return ret;
}
std::string Subs::toString() const
{
std::stringstream ss;
ss << "[";
for (size_t i = 0, nvs = d_vars.size(); i < nvs; i++)
{
if (i > 0)
{
ss << " ";
}
ss << d_vars[i] << " -> " << d_subs[i];
}
ss << "]";
return ss.str();
}
std::ostream& operator<<(std::ostream& out, const Subs& s)
{
out << s.toString();
return out;
}
} // namespace CVC4
|
