mirror of
https://github.com/Z3Prover/z3
synced 2025-05-05 14:55:45 +00:00
45 lines
1.1 KiB
C++
45 lines
1.1 KiB
C++
/*++
|
|
Copyright (c) 2006 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
recurse_expr.h
|
|
|
|
Abstract:
|
|
|
|
Traverse an expression applying a visitor.
|
|
|
|
Author:
|
|
|
|
Leonardo de Moura (leonardo) 2008-01-11.
|
|
|
|
Revision History:
|
|
|
|
--*/
|
|
#pragma once
|
|
|
|
#include "ast/ast.h"
|
|
#include "util/obj_hashtable.h"
|
|
|
|
template<typename T, typename Visitor, bool IgnorePatterns=false, bool CallDestructors=true>
|
|
class recurse_expr : public Visitor {
|
|
obj_map<expr, T> m_cache;
|
|
ptr_vector<expr> m_todo;
|
|
vector<T, CallDestructors> m_results1;
|
|
vector<T, CallDestructors> m_results2;
|
|
|
|
bool is_cached(expr * n) const { T c; return m_cache.find(n, c); }
|
|
T get_cached(expr * n) const { return m_cache.find(n); }
|
|
void cache_result(expr * n, T c) { m_cache.insert(n, c); }
|
|
|
|
void visit(expr * n, bool & visited);
|
|
bool visit_children(expr * n);
|
|
void process(expr * n);
|
|
|
|
public:
|
|
recurse_expr(Visitor const & v = Visitor()):Visitor(v) {}
|
|
T operator()(expr * n);
|
|
void reset() { m_cache.reset(); m_todo.reset(); }
|
|
void finalize() { m_cache.finalize(); m_todo.finalize(); }
|
|
};
|
|
|