mirror of
https://github.com/Z3Prover/z3
synced 2025-04-28 03:15:50 +00:00
53 lines
1.2 KiB
C++
53 lines
1.2 KiB
C++
/*++
|
|
Copyright (c) 2007 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
expr_map.h
|
|
|
|
Abstract:
|
|
|
|
Mapping from expressions to expressions + proofs. This mapping
|
|
is used to cache simplification results.
|
|
For every entry [e1->(e2, p)] we have that p is a proof that (= e1 e2).
|
|
|
|
Author:
|
|
|
|
Leonardo (leonardo) 2008-01-03
|
|
|
|
Notes:
|
|
|
|
--*/
|
|
#ifndef EXPR_MAP_H_
|
|
#define EXPR_MAP_H_
|
|
|
|
#include"ast.h"
|
|
#include"obj_hashtable.h"
|
|
|
|
/**
|
|
\brief Map from expressions to expressions+proofs.
|
|
|
|
When proof production is disabled, no extra space is used.
|
|
*/
|
|
class expr_map {
|
|
ast_manager & m_manager;
|
|
bool m_store_proofs;
|
|
obj_map<expr, expr*> m_expr2expr;
|
|
obj_map<expr, proof*> m_expr2pr;
|
|
public:
|
|
expr_map(ast_manager & m);
|
|
expr_map(ast_manager & m, bool store_proofs);
|
|
~expr_map();
|
|
void insert(expr * k, expr * d, proof * p);
|
|
bool contains(expr * k) const { return m_expr2expr.contains(k); }
|
|
void get(expr * k, expr * & d, proof * & p) const;
|
|
void erase(expr * k);
|
|
void reset();
|
|
void flush();
|
|
void set_store_proofs(bool f) {
|
|
if (m_store_proofs != f) flush();
|
|
m_store_proofs = f;
|
|
}
|
|
};
|
|
|
|
#endif
|