mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-07-24 13:18:55 +00:00
Code Activity

Z3 sources

Browse source 
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
This commit is contained in:
Leonardo de Moura 2012-10-02 11:35:25 -07:00
parent 3f9edad676
commit e9eab22e5c
1186 changed files with 381859 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

72
lib/smt_almost_cg_table.h Normal file
View file

@ -0,0 +1,72 @@
/*++
Copyright (c) 2006 Microsoft Corporation
Module Name:
smt_almost_cg_table.h
Abstract:
<abstract>
Author:
Leonardo de Moura (leonardo) 2009-03-06.
Revision History:
--*/
#ifndef _SMT_ALMOST_CG_TABLE_H_
#define _SMT_ALMOST_CG_TABLE_H_
#include"smt_enode.h"
#include"map.h"
namespace smt {
/**
\brief An index for detecting 'almost' congruences.
We say (f t_1 ... t_n) is almost congruent to (f s_1 ... s_n) with respect to (r1,r2) iff
for all j in [1,n] j t_j = s_j or (t_j = r1 and s_j = r1) or (t_j = r1 and s_j = r2) or (t_j = r2 and s_j = r1) or (t_j = r2 and s_j = r2)
This index is used to speedup is_ext_diseq.
*/
class almost_cg_table {
struct cg_hash {
enode * & m_r1;
enode * & m_r2;
unsigned arg_hash(enode * n, unsigned idx) const;
public:
cg_hash(enode * & r1, enode * & r2):m_r1(r1), m_r2(r2) {}
unsigned operator()(enode * n) const;
};
struct cg_eq {
enode * & m_r1;
enode * & m_r2;
public:
cg_eq(enode * & r1, enode * & r2):m_r1(r1), m_r2(r2) {}
bool operator()(enode * n1, enode * n2) const;
};
typedef map<enode *, list<enode*> *, cg_hash, cg_eq> table;
region m_region;
enode * m_r1;
enode * m_r2;
table m_table;
public:
almost_cg_table(enode * r1 = 0, enode * r2 = 0);
void reset(enode * r1, enode * r2) { m_r1 = r1->get_root(); m_r2 = r2->get_root(); reset(); }
void reset();
void insert(enode *);
void erase(enode * n) { m_table.erase(n); }
list<enode*> * find(enode *);
bool empty() const { return m_table.empty(); }
};
};
#endif /* _SMT_ALMOST_CG_TABLE_H_ */