mirror of
https://github.com/Z3Prover/z3
synced 2025-04-28 19:35:50 +00:00
port to emonomials (#90)
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
b52e79b648
commit
e28e83a25e
20 changed files with 666 additions and 683 deletions
|
@ -21,31 +21,31 @@
|
|||
#include "util/lp/nla_core.h"
|
||||
|
||||
namespace nla {
|
||||
bool common::done() const { return m_core->done(); }
|
||||
bool common::done() const { return c().done(); }
|
||||
|
||||
template <typename T> void common::explain(const T& t) {
|
||||
c().explain(t, c().current_expl());
|
||||
}
|
||||
template void common::explain<monomial>(const monomial& t);
|
||||
template void common::explain<factor>(const factor& t);
|
||||
template void common::explain<rooted_mon>(const rooted_mon& t);
|
||||
template void common::explain<signed_vars>(const signed_vars& t);
|
||||
template void common::explain<factorization>(const factorization& t);
|
||||
|
||||
void common::explain(lpvar j) { c().explain(j, c().current_expl()); }
|
||||
|
||||
template <typename T> rational common::vvr(T const& t) const { return m_core->vvr(t); }
|
||||
template <typename T> rational common::vvr(T const& t) const { return c().vvr(t); }
|
||||
template rational common::vvr<monomial>(monomial const& t) const;
|
||||
template rational common::vvr<rooted_mon>(rooted_mon const& t) const;
|
||||
template rational common::vvr<signed_vars>(signed_vars const& t) const;
|
||||
template rational common::vvr<factor>(factor const& t) const;
|
||||
rational common::vvr(lpvar t) const { return m_core->vvr(t); }
|
||||
template <typename T> lpvar common::var(T const& t) const { return m_core->var(t); }
|
||||
rational common::vvr(lpvar t) const { return c().vvr(t); }
|
||||
template <typename T> lpvar common::var(T const& t) const { return c().var(t); }
|
||||
template lpvar common::var<factor>(factor const& t) const;
|
||||
template lpvar common::var<rooted_mon>(rooted_mon const& t) const;
|
||||
template lpvar common::var<signed_vars>(signed_vars const& t) const;
|
||||
void common::add_empty_lemma() { c().add_empty_lemma(); }
|
||||
template <typename T> rational common::canonize_sign(const T& t) const {
|
||||
return c().canonize_sign(t);
|
||||
}
|
||||
template rational common::canonize_sign<rooted_mon>(const rooted_mon& t) const;
|
||||
template rational common::canonize_sign<signed_vars>(const signed_vars& t) const;
|
||||
template rational common::canonize_sign<factor>(const factor& t) const;
|
||||
rational common::canonize_sign(lpvar j) const {
|
||||
return c().canonize_sign_of_var(j);
|
||||
|
@ -99,18 +99,19 @@ std::ostream& common::print_product(const T & m, std::ostream& out) const {
|
|||
template
|
||||
std::ostream& common::print_product<monomial>(const monomial & m, std::ostream& out) const;
|
||||
|
||||
template std::ostream& common::print_product<rooted_mon>(const rooted_mon & m, std::ostream& out) const;
|
||||
template std::ostream& common::print_product<signed_vars>(const signed_vars & m, std::ostream& out) const;
|
||||
|
||||
|
||||
std::ostream& common::print_monomial(const monomial & m, std::ostream& out) const {
|
||||
return c().print_monomial(m, out);
|
||||
}
|
||||
std::ostream& common::print_rooted_monomial(const rooted_mon& rm, std::ostream& out) const {
|
||||
return c().print_rooted_monomial(rm, out);
|
||||
}
|
||||
std::ostream& common::print_rooted_monomial_with_vars(const rooted_mon& rm, std::ostream& out) const {
|
||||
return c().print_rooted_monomial_with_vars(rm, out);
|
||||
}
|
||||
|
||||
//std::ostream& common::print_rooted_monomial(const signed_vars& rm, std::ostream& out) const {
|
||||
// return c().print_rooted_monomial(rm, out);
|
||||
//}
|
||||
//std::ostream& common::print_rooted_monomial_with_vars(const signed_vars& rm, std::ostream& out) const {
|
||||
// return c().print_rooted_monomial_with_vars(rm, out);
|
||||
//}
|
||||
std::ostream& common::print_factor(const factor & f, std::ostream& out) const {
|
||||
return c().print_factor(f, out);
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue