mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-05-04 22:35:45 +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

256
lib/mpq_inf.h Normal file
View file

@ -0,0 +1,256 @@
/*++
Copyright (c) 2006 Microsoft Corporation
Module Name:
mpq_inf.h
Abstract:
MPQ numbers with infinitesimals
Author:
Leonardo de Moura (leonardo) 2011-06-28
Revision History:
--*/
#ifndef _MPQ_INF_H_
#define _MPQ_INF_H_
#include"mpq.h"
#include"hash.h"
#include"params.h"
typedef std::pair<mpq, mpq> mpq_inf;
template<bool SYNCH = true>
class mpq_inf_manager {
mpq_manager<SYNCH> & m;
double m_inf;
public:
typedef mpq_inf numeral;
mpq_inf_manager(mpq_manager<SYNCH> & _m, params_ref const & p = params_ref()):m(_m) {
updt_params(p);
}
void updt_params(params_ref const & p) {
m_inf = p.get_double(":infinitesimal-as-double", 0.00001);
}
enum inf_kind { NEG=-1, ZERO, POS };
void reset(mpq_inf & a) {
m.reset(a.first);
m.reset(a.second);
}
unsigned hash(mpq_inf const & a) const { return hash_u_u(m.hash(a.first), m.hash(a.second)); }
void del(mpq_inf & a) {
m.del(a.first);
m.del(a.second);
}
void swap(mpq_inf & a, mpq_inf & b) {
m.swap(a.first, b.first);
m.swap(a.second, b.second);
}
void set(mpq_inf & a, mpq_inf const & b) {
m.set(a.first, b.first);
m.set(a.second, b.second);
}
void set(mpq_inf & a, mpq const & r) {
m.set(a.first, r);
m.reset(a.second);
}
void set(mpq_inf & a, mpq const & r, inf_kind k) {
m.set(a.first, r);
switch (k) {
case NEG: m.set(a.second, -1); break;
case ZERO: m.reset(a.second); break;
case POS: m.set(a.second, 1); break;
}
}
void set(mpq_inf & a, mpq const & r, mpq const & i) {
m.set(a.first, r);
m.set(a.second, i);
}
bool is_int(mpq_inf const & a) const { return m.is_int(a.first) && m.is_zero(a.second); }
bool is_rational(mpq_inf const & a) const { return m.is_zero(a.second); }
void get_rational(mpq_inf const & a, mpq & r) { m.set(r, a.first); }
void get_infinitesimal(mpq_inf const & a, mpq & r) { m.set(r, a.second); }
double get_double(mpq_inf const & a) {
double r = m.get_double(a.first);
if (m.is_pos(a.second))
return r + m_inf;
else if (m.is_neg(a.second))
return r - m_inf;
else
return r;
}
bool is_zero(mpq_inf const & a) const {
return m.is_zero(a.first) && m.is_zero(a.second);
}
bool eq(mpq_inf const & a, mpq_inf const & b) const {
return m.eq(a.first, b.first) && m.eq(a.second, b.second);
}
bool eq(mpq_inf const & a, mpq const & b) const {
return m.eq(a.first, b) && m.is_zero(a.second);
}
bool eq(mpq_inf const & a, mpq const & b, inf_kind k) const {
if (!m.eq(a.first, b))
return false;
switch (k) {
case NEG: return m.is_minus_one(a.second);
case ZERO: return m.is_zero(a.second);
case POS: return m.is_one(a.second);
}
UNREACHABLE();
return false;
}
bool lt(mpq_inf const & a, mpq_inf const & b) const {
return m.lt(a.first, b.first) || (m.lt(a.second, b.second) && m.eq(a.first, b.first));
}
bool lt(mpq_inf const & a, mpq const & b) const {
return m.lt(a.first, b) || (m.is_neg(a.second) && m.eq(a.first, b));
}
bool lt(mpq_inf const & a, mpq const & b, inf_kind k) const {
if (m.lt(a.first, b))
return true;
if (m.eq(a.first, b)) {
switch (k) {
case NEG: return m.lt(a.second, mpq(-1));
case ZERO: return m.is_neg(a.second);
case POS: return m.lt(a.second, mpq(1));
}
UNREACHABLE();
}
return false;
}
bool gt(mpq_inf const & a, mpq_inf const & b) const { return lt(b, a); }
bool gt(mpq_inf const & a, mpq const & b) const {
return m.gt(a.first, b) || (m.is_pos(a.second) && m.eq(a.first, b));
}
bool gt(mpq_inf const & a, mpq const & b, inf_kind k) const {
if (m.gt(a.first, b))
return true;
if (m.eq(a.first, b)) {
switch (k) {
case NEG: return m.gt(a.second, mpq(-1));
case ZERO: return m.is_pos(a.second);
case POS: return m.gt(a.second, mpq(1));
}
UNREACHABLE();
}
return false;
}
bool le(mpq_inf const & a, mpq_inf const & b) const { return !gt(a, b); }
bool le(mpq_inf const & a, mpq const & b) const { return !gt(a, b); }
bool le(mpq_inf const & a, mpq const & b, inf_kind k) const { return !gt(a, b, k); }
bool ge(mpq_inf const & a, mpq_inf const & b) const { return !lt(a, b); }
bool ge(mpq_inf const & a, mpq const & b) const { return !lt(a, b); }
bool ge(mpq_inf const & a, mpq const & b, inf_kind k) const { return !lt(a, b, k); }
void add(mpq_inf const & a, mpq_inf const & b, mpq_inf & c) {
m.add(a.first, b.first, c.first);
m.add(a.second, b.second, c.second);
}
void sub(mpq_inf const & a, mpq_inf const & b, mpq_inf & c) {
m.sub(a.first, b.first, c.first);
m.sub(a.second, b.second, c.second);
}
void add(mpq_inf const & a, mpq const & b, mpq_inf & c) {
m.add(a.first, b, c.first);
m.set(c.second, a.second);
}
void sub(mpq_inf const & a, mpq const & b, mpq_inf & c) {
m.sub(a.first, b, c.first);
m.set(c.second, a.second);
}
void mul(mpq_inf const & a, mpq const & b, mpq_inf & c) {
m.mul(a.first, b, c.first);
m.mul(a.second, b, c.second);
}
void mul(mpq_inf const & a, mpz const & b, mpq_inf & c) {
m.mul(b, a.first, c.first);
m.mul(b, a.second, c.second);
}
void inc(mpq_inf & a) {
m.inc(a.first);
}
void dec(mpq_inf & a) {
m.dec(a.first);
}
void neg(mpq_inf & a) {
m.neg(a.first);
m.neg(a.second);
}
void ceil(mpq_inf const & a, mpq & b) {
if (m.is_int(a.first)) {
// special cases for k - delta*epsilon where k is an integer
if (m.is_pos(a.first))
m.add(a.first, mpq(1), b); // ceil(k + delta*epsilon) --> k+1
else
m.set(b, a.first);
}
else {
m.ceil(a.first, b);
}
}
void floor(mpq_inf const & a, mpq & b) {
if (m.is_int(a.first)) {
if (m.is_neg(a.first))
m.sub(a.first, mpq(1), b); // floor(k - delta*epsilon) --> k-1
else
m.set(b, a.first);
}
else {
m.floor(a.first, b);
}
}
std::string to_string(mpq_inf const & a) const;
};
typedef mpq_inf_manager<true> synch_mpq_inf_manager;
typedef mpq_inf_manager<false> unsynch_mpq_inf_manager;
#endif