mirror of
https://github.com/Z3Prover/z3
synced 2025-04-12 04:03:39 +00:00
parent
72d129eb75
commit
fca44ff3f2
|
@ -355,11 +355,7 @@ namespace recfun {
|
||||||
util & u;
|
util & u;
|
||||||
find(util & u) : u(u) {}
|
find(util & u) : u(u) {}
|
||||||
bool operator()(expr * e) override {
|
bool operator()(expr * e) override {
|
||||||
//return is_app(e) ? u.owns_app(to_app(e)) : false;
|
return is_app(e) && u.is_defined(to_app(e));
|
||||||
if (! is_app(e)) return false;
|
|
||||||
|
|
||||||
app * a = to_app(e);
|
|
||||||
return u.is_defined(a);
|
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
find f(u);
|
find f(u);
|
||||||
|
@ -467,6 +463,8 @@ namespace recfun {
|
||||||
scores.insert(e, 0);
|
scores.insert(e, 0);
|
||||||
// walk deepest terms first.
|
// walk deepest terms first.
|
||||||
for (unsigned i = max_depth; i > 0; --i) {
|
for (unsigned i = max_depth; i > 0; --i) {
|
||||||
|
if (!by_depth.contains(i))
|
||||||
|
continue;
|
||||||
for (expr* t : by_depth[i]) {
|
for (expr* t : by_depth[i]) {
|
||||||
unsigned score = 0;
|
unsigned score = 0;
|
||||||
for (expr* parent : parents[t]) {
|
for (expr* parent : parents[t]) {
|
||||||
|
|
Loading…
Reference in a new issue