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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
/*
* Normaliz
* Copyright (C) 2007-2014 Winfried Bruns, Bogdan Ichim, Christof Soeger
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* As an exception, when this program is distributed through (i) the App Store
* by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or (iii) Google Play
* by Google Inc., then that store may impose any digital rights management,
* device limits and/or redistribution restrictions that are required by its
* terms of service.
*/
#ifndef QINTEGER_H_
#define QINTEGER_H_
#include <libQnormaliz/Qgeneral.h>
#ifdef ENFNORMALIZ
#include <e-antic/renfxx.h>
#endif
#include <list>
#include <vector>
#include <string>
#include <limits.h>
#include "libnormaliz/integer.h"
//---------------------------------------------------------------------------
namespace libQnormaliz {
using namespace std;
//---------------------------------------------------------------------------
// Basic functions
//---------------------------------------------------------------------------
// returns the absolute value of a
template<typename Number> inline Number Iabs(const Number& a) {
return (a>=0) ? (a) : Number(-a);
}
//---------------------------------------------------------------------------
// Conversions and checks
//---------------------------------------------------------------------------
// convert val to ret
// does the conversion and returns false if it fails
bool try_convert(long& ret, const long long& val);
inline bool try_convert(long long& ret, const long& val) {assert(false); return true;}
bool try_convert(long& ret, const mpz_class& val);
bool try_convert(long long& ret, const mpz_class& val);
inline bool try_convert(mpz_class& ret, const long& val) {assert(false); return true;}
bool try_convert(mpz_class& ret, const long long& val);
// template for same typ "conversion"
template<typename Type>
inline bool try_convert(Type& ret, const Type& val) {ret = val; return true;}
bool fits_long_range(long long a);
template<typename Number>
inline bool using_GMP() {
return false;
}
template<>
inline bool using_GMP<mpq_class>() {
return true;
}
template<typename Number>
inline bool using_renf() {
return false;
}
#ifdef ENFNORMALIZ
template<>
inline bool using_renf<renf_elem_class>() {
return true;
}
#endif
//---------------------------------------------------------------------------
// Should be completely remoced:
template<typename Number>
inline bool check_range(const Number& m) {
return true;
}
//---------------------------------------------------------------------------
// Special functions
//---------------------------------------------------------------------------
//return the number of decimals, needed to write the Number a
template<typename Number> size_t decimal_length(Number a);
//returns b!/a!
template<typename Number> Number permutations(const size_t& a, const size_t& b);
template<typename Number> Number permutations_modulo(const size_t& a, const size_t& b, long m);
//---------------------------------------------------------------------------
// String conversion functions
//---------------------------------------------------------------------------
// forward declaration to silence clang error:
// 'operator<<' should be declared prior to the call site or in the global namespace
template <typename T> std::ostream& operator<< (std::ostream& out, const vector<T>& vec);
template<typename Number> string toString(Number a) {
ostringstream ostream;
ostream << a;
return ostream.str();
}
/* template<> inline string toString(mpz_class a) {
return a.get_str();
}*/
template<> inline string toString(mpq_class a) {
return a.get_str();
}
//-------------------------------------------------------
#ifdef ENFNORMALIZ
inline mpq_class approx_to_mpq(const renf_elem_class& x){
stringstream str_str;
str_str << x;
string str=str_str.str();
string nf_str, approx_str;
bool rational=true;
bool nf_finished=false;
for(size_t i=0;i<str.size();++i){
if(str[i]=='a')
rational=false;
if(str[i]=='(' || str[i]==')')
continue;
if(str[i]=='~' || str[i]=='='){
nf_finished=true;
continue;
}
if(nf_finished)
approx_str+=str[i];
else
nf_str+=str[i];
}
if(rational)
return mpq_class(nf_str);
else{
return libnormaliz::dec_fraction_to_mpq(approx_str);
}
}
#endif
inline mpq_class approx_to_mpq(const mpq_class& x){
return x;
}
template<typename Number>
double approx_to_double(const Number& x){
return libnormaliz::mpq_to_nmz_float(approx_to_mpq(x));
}
template<typename Number>
vector<mpq_class> approx_to_mpq(const vector<Number>& ori){
vector<mpq_class> res(ori.size());
for(size_t i=0;i<ori.size();++i)
res[i]=approx_to_mpq(ori[i]);
return res;
}
} // end libnormaliz
//---------------------------------------------------------------------------
#endif /* INTEGER_H_ */
//---------------------------------------------------------------------------
|
