1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
/******************************************************************************
* Top contributors (to current version):
* Gereon Kremer, Mathias Preiner
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
* in the top-level source directory and their institutional affiliations.
* All rights reserved. See the file COPYING in the top-level source
* directory for licensing information.
* ****************************************************************************
*
* Implementation of RealAlgebraicNumber based on libpoly.
*/
#include "base/cvc5config.h"
#include "util/real_algebraic_number.h"
#ifndef CVC5_POLY_IMP // Make sure this comes after base/cvc5config.h
#error "This source should only ever be built if CVC5_POLY_IMP is on!"
#endif /* CVC5_POLY_IMP */
#include <poly/polyxx.h>
#include <limits>
#include "base/check.h"
#include "util/poly_util.h"
namespace cvc5 {
RealAlgebraicNumber::RealAlgebraicNumber(poly::AlgebraicNumber&& an)
: d_value(std::move(an))
{
}
RealAlgebraicNumber::RealAlgebraicNumber(const Integer& i)
: d_value(poly::DyadicRational(poly_utils::toInteger(i)))
{
}
RealAlgebraicNumber::RealAlgebraicNumber(const Rational& r)
{
poly::Rational pr = poly_utils::toRational(r);
auto dr = poly_utils::toDyadicRational(r);
if (dr)
{
d_value = poly::AlgebraicNumber(dr.value());
}
else
{
d_value = poly::AlgebraicNumber(
poly::UPolynomial({numerator(pr), -denominator(pr)}),
poly::DyadicInterval(floor(pr), ceil(pr)));
}
}
RealAlgebraicNumber::RealAlgebraicNumber(const std::vector<long>& coefficients,
long lower,
long upper)
{
#ifdef CVC5_ASSERTIONS
for (long c : coefficients)
{
Assert(std::numeric_limits<std::int32_t>::min() <= c
&& c <= std::numeric_limits<std::int32_t>::max())
<< "Coefficients need to fit within 32 bit integers. Please use the "
"constructor based on Integer instead.";
}
#endif
d_value = poly::AlgebraicNumber(poly::UPolynomial(coefficients),
poly::DyadicInterval(lower, upper));
}
RealAlgebraicNumber::RealAlgebraicNumber(
const std::vector<Integer>& coefficients,
const Rational& lower,
const Rational& upper)
{
*this = poly_utils::toRanWithRefinement(
poly::UPolynomial(poly_utils::toInteger(coefficients)), lower, upper);
}
RealAlgebraicNumber::RealAlgebraicNumber(
const std::vector<Rational>& coefficients,
const Rational& lower,
const Rational& upper)
{
Integer factor = Integer(1);
for (const auto& c : coefficients)
{
factor = factor.lcm(c.getDenominator());
}
std::vector<poly::Integer> coeffs;
for (const auto& c : coefficients)
{
Assert((c * factor).getDenominator() == Integer(1));
coeffs.emplace_back(poly_utils::toInteger((c * factor).getNumerator()));
}
*this = poly_utils::toRanWithRefinement(
poly::UPolynomial(std::move(coeffs)), lower, upper);
}
std::ostream& operator<<(std::ostream& os, const RealAlgebraicNumber& ran)
{
return os << ran.getValue();
}
bool operator==(const RealAlgebraicNumber& lhs, const RealAlgebraicNumber& rhs)
{
return lhs.getValue() == rhs.getValue();
}
bool operator!=(const RealAlgebraicNumber& lhs, const RealAlgebraicNumber& rhs)
{
return lhs.getValue() != rhs.getValue();
}
bool operator<(const RealAlgebraicNumber& lhs, const RealAlgebraicNumber& rhs)
{
return lhs.getValue() < rhs.getValue();
}
bool operator<=(const RealAlgebraicNumber& lhs, const RealAlgebraicNumber& rhs)
{
return lhs.getValue() <= rhs.getValue();
}
bool operator>(const RealAlgebraicNumber& lhs, const RealAlgebraicNumber& rhs)
{
return lhs.getValue() > rhs.getValue();
}
bool operator>=(const RealAlgebraicNumber& lhs, const RealAlgebraicNumber& rhs)
{
return lhs.getValue() >= rhs.getValue();
}
RealAlgebraicNumber operator+(const RealAlgebraicNumber& lhs,
const RealAlgebraicNumber& rhs)
{
return lhs.getValue() + rhs.getValue();
}
RealAlgebraicNumber operator-(const RealAlgebraicNumber& lhs,
const RealAlgebraicNumber& rhs)
{
return lhs.getValue() - rhs.getValue();
}
RealAlgebraicNumber operator-(const RealAlgebraicNumber& ran)
{
return -ran.getValue();
}
RealAlgebraicNumber operator*(const RealAlgebraicNumber& lhs,
const RealAlgebraicNumber& rhs)
{
return lhs.getValue() * rhs.getValue();
}
RealAlgebraicNumber& operator+=(RealAlgebraicNumber& lhs,
const RealAlgebraicNumber& rhs)
{
lhs.getValue() = lhs.getValue() + rhs.getValue();
return lhs;
}
RealAlgebraicNumber& operator-=(RealAlgebraicNumber& lhs,
const RealAlgebraicNumber& rhs)
{
lhs.getValue() = lhs.getValue() - rhs.getValue();
return lhs;
}
RealAlgebraicNumber& operator*=(RealAlgebraicNumber& lhs,
const RealAlgebraicNumber& rhs)
{
lhs.getValue() = lhs.getValue() * rhs.getValue();
return lhs;
}
int sgn(const RealAlgebraicNumber& ran) { return sgn(ran.getValue()); }
bool isZero(const RealAlgebraicNumber& ran) { return is_zero(ran.getValue()); }
bool isOne(const RealAlgebraicNumber& ran) { return is_one(ran.getValue()); }
} // namespace cvc5
|
