forked from simbuerg/isl-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQpolynomial.h
357 lines (298 loc) · 8.88 KB
/
Qpolynomial.h
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
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
#ifndef ISL_CXX_Qpolynomial_H
#define ISL_CXX_Qpolynomial_H
#include "isl/polynomial.h"
#include "isl/Bool.h"
#include "isl/DimType.h"
#include "isl/Format.h"
#include "isl/IslBase.h"
#include "isl/IslException.h"
#include "isl/Stat.h"
#include "isl/polynomial.h"
#include "isl/set.h"
#include <string>
#include "isl/IslFnPtr.h"
namespace isl {
class Aff;
class BasicSet;
class Constraint;
class Point;
class Set;
class Space;
class Term;
class Val;
class Qpolynomial {
protected:
Ctx ctx;
void * This;
public:
explicit Qpolynomial(Ctx ctx, isl_qpolynomial *That) : ctx(ctx), This(That) {}
Qpolynomial() : ctx(Ctx(nullptr)), This(nullptr) {}
const Ctx &Context() const { return ctx; }
__isl_give isl_qpolynomial *GetCopy() const;
/// \brief Release ownership of the wrapped object.
///
/// You are on your own now buddy.
/// The wrapper cannot be used anymore after calling Give()
///
/// \returns the wrapped isl object.
__isl_give isl_qpolynomial *Give();
/// \brief unwrap the stored isl object.
/// \return a the wrapped isl object.
__isl_give isl_qpolynomial *Get() const;
/// \brief Constructor for isl_qpolynomial_zero_on_domain
///
/// \param dim
static Qpolynomial zeroOnDomain(const Space &dim);
/// \brief Constructor for isl_qpolynomial_one_on_domain
///
/// \param dim
static Qpolynomial oneOnDomain(const Space &dim);
/// \brief Constructor for isl_qpolynomial_infty_on_domain
///
/// \param dim
static Qpolynomial inftyOnDomain(const Space &dim);
/// \brief Constructor for isl_qpolynomial_neginfty_on_domain
///
/// \param dim
static Qpolynomial neginftyOnDomain(const Space &dim);
/// \brief Constructor for isl_qpolynomial_nan_on_domain
///
/// \param dim
static Qpolynomial nanOnDomain(const Space &dim);
/// \brief Constructor for isl_qpolynomial_val_on_domain
///
/// \param space
/// \param val
static Qpolynomial valOnDomain(const Space &space, const Val &val);
/// \brief Constructor for isl_qpolynomial_var_on_domain
///
/// \param dim
/// \param type
/// \param pos
static Qpolynomial varOnDomain(const Space &dim, DimType type, unsigned int pos);
/// \brief Constructor for isl_qpolynomial_from_constraint
///
/// \param c
/// \param type
/// \param pos
static Qpolynomial fromConstraint(const Constraint &c, DimType type, unsigned int pos);
/// \brief Constructor for isl_qpolynomial_from_term
///
/// \param term
static Qpolynomial fromTerm(const Term &term);
/// \brief Constructor for isl_qpolynomial_from_aff
///
/// \param aff
static Qpolynomial fromAff(const Aff &aff);
public:
virtual ~Qpolynomial();
/// \brief Generated from ::<isl_qpolynomial_add>
///
/// \param [in] qp2
///
/// \returns A new Qpolynomial
Qpolynomial add(const Qpolynomial &qp2) const;
/// \brief Generated from ::<isl_qpolynomial_add_dims>
///
/// \param [in] type
/// \param [in] n
///
/// \returns A new Qpolynomial
Qpolynomial addDims(DimType type, unsigned int n) const;
/// \brief Generated from ::<isl_qpolynomial_align_params>
///
/// \param [in] model
///
/// \returns A new Qpolynomial
Qpolynomial alignParams(const Space &model) const;
/// \brief Generated from ::<isl_qpolynomial_as_polynomial_on_domain>
///
/// \param [in] bset
/// \param [in] fn
/// \param [in] user
///
/// \returns A new int
int asPolynomialOnDomain(const BasicSet &bset, const std::function<int(isl_basic_set *, isl_qpolynomial *, void *)> && fn, void * user) const;
/// \brief Generated from ::<isl_qpolynomial_dim>
///
/// \param [in] type
///
/// \returns A new unsigned int
unsigned int dim(DimType type) const;
/// \brief Generated from ::<isl_qpolynomial_drop_dims>
///
/// \param [in] type
/// \param [in] first
/// \param [in] n
///
/// \returns A new Qpolynomial
Qpolynomial dropDims(DimType type, unsigned int first, unsigned int n) const;
/// \brief Generated from ::<isl_qpolynomial_eval>
///
/// \param [in] pnt
///
/// \returns A new Val
Val eval(const Point &pnt) const;
/// \brief Generated from ::<isl_qpolynomial_foreach_term>
///
/// \param [in] fn
/// \param [in] user
///
/// \returns A new Stat
Stat foreachTerm(const std::function<isl_stat(isl_term *, void *)> && fn, void * user) const;
/// \brief Generated from ::<isl_qpolynomial_get_constant_val>
///
///
/// \returns A new Val
Val getConstantVal() const;
/// \brief Generated from ::<isl_qpolynomial_get_domain_space>
///
///
/// \returns A new Space
Space getDomainSpace() const;
/// \brief Generated from ::<isl_qpolynomial_get_space>
///
///
/// \returns A new Space
Space getSpace() const;
/// \brief Generated from ::<isl_qpolynomial_gist>
///
/// \param [in] context
///
/// \returns A new Qpolynomial
Qpolynomial gist(const Set &context) const;
/// \brief Generated from ::<isl_qpolynomial_gist_params>
///
/// \param [in] context
///
/// \returns A new Qpolynomial
Qpolynomial gistParams(const Set &context) const;
/// \brief Generated from ::<isl_qpolynomial_homogenize>
///
///
/// \returns A new Qpolynomial
Qpolynomial homogenize() const;
/// \brief Generated from ::<isl_qpolynomial_insert_dims>
///
/// \param [in] type
/// \param [in] first
/// \param [in] n
///
/// \returns A new Qpolynomial
Qpolynomial insertDims(DimType type, unsigned int first, unsigned int n) const;
/// \brief Generated from ::<isl_qpolynomial_involves_dims>
///
/// \param [in] type
/// \param [in] first
/// \param [in] n
///
/// \returns A new Bool
Bool involvesDims(DimType type, unsigned int first, unsigned int n) const;
/// \brief Generated from ::<isl_qpolynomial_is_infty>
///
///
/// \returns A new Bool
Bool isInfty() const;
/// \brief Generated from ::<isl_qpolynomial_is_nan>
///
///
/// \returns A new Bool
Bool isNan() const;
/// \brief Generated from ::<isl_qpolynomial_is_neginfty>
///
///
/// \returns A new Bool
Bool isNeginfty() const;
/// \brief Generated from ::<isl_qpolynomial_is_zero>
///
///
/// \returns A new Bool
Bool isZero() const;
/// \brief Generated from ::<isl_qpolynomial_move_dims>
///
/// \param [in] dst_type
/// \param [in] dst_pos
/// \param [in] src_type
/// \param [in] src_pos
/// \param [in] n
///
/// \returns A new Qpolynomial
Qpolynomial moveDims(DimType dst_type, unsigned int dst_pos, DimType src_type, unsigned int src_pos, unsigned int n) const;
/// \brief Generated from ::<isl_qpolynomial_mul>
///
/// \param [in] qp2
///
/// \returns A new Qpolynomial
Qpolynomial mul(const Qpolynomial &qp2) const;
/// \brief Generated from ::<isl_qpolynomial_neg>
///
///
/// \returns A new Qpolynomial
Qpolynomial neg() const;
/// \brief Generated from ::<isl_qpolynomial_plain_is_equal>
///
/// \param [in] qp2
///
/// \returns A new Bool
Bool plainIsEqual(const Qpolynomial &qp2) const;
/// \brief Generated from ::<isl_qpolynomial_pow>
///
/// \param [in] power
///
/// \returns A new Qpolynomial
Qpolynomial pow(unsigned int power) const;
/// \brief Generated from ::<isl_qpolynomial_project_domain_on_params>
///
///
/// \returns A new Qpolynomial
Qpolynomial projectDomainOnParams() const;
/// \brief Generated from ::<isl_qpolynomial_scale_val>
///
/// \param [in] v
///
/// \returns A new Qpolynomial
Qpolynomial scaleVal(const Val &v) const;
/// \brief Generated from ::<isl_qpolynomial_set_dim_name>
///
/// \param [in] type
/// \param [in] pos
/// \param [in] s
///
/// \returns A new Qpolynomial
Qpolynomial setDimName(DimType type, unsigned int pos, std::string s) const;
/// \brief Generated from ::<isl_qpolynomial_sgn>
///
///
/// \returns A new int
int sgn() const;
/// \brief Generated from ::<isl_qpolynomial_sub>
///
/// \param [in] qp2
///
/// \returns A new Qpolynomial
Qpolynomial sub(const Qpolynomial &qp2) const;
/// \brief Generated from ::<isl_qpolynomial_substitute>
///
/// \param [in] type
/// \param [in] first
/// \param [in] n
/// \param [out] subs (isl_give)
///
/// \returns A new Qpolynomial
Qpolynomial substitute(DimType type, unsigned int first, unsigned int n, std::unique_ptr<Qpolynomial> * subs) const;
Qpolynomial(const Qpolynomial &Other) : ctx(Other.Context()), This(Other.GetCopy()) {}
Qpolynomial &operator=(const Qpolynomial &Other);
Qpolynomial (Qpolynomial && Other) : ctx(Other.Context()), This(Other.Give()) {}
Qpolynomial &operator=(Qpolynomial && Other) {
isl_qpolynomial *New = Other.Give();
isl_qpolynomial_free((isl_qpolynomial *)This);
This = New;
ctx = Other.Context();
return *this;
}
/// \brief Implement lt via pointer comparison of the
/// wrapped isl objects.
bool operator<(const Qpolynomial &RHS) const { return This < RHS.This; }
};
} // namespace isl
#endif //ISL_CXX_Qpolynomial_H