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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Python Interface *
* *
* Copyright (c) 1999-2025, Ben Burton *
* For further details contact Ben Burton (bab@debian.org). *
* *
* 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 2 of the *
* License, or (at your option) any later version. *
* *
* 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. *
* *
* 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 <https://www.gnu.org/licenses/>. *
* *
**************************************************************************/
#include <pybind11/pybind11.h>
#include <pybind11/operators.h>
#include <pybind11/stl.h>
#include "maths/polynomial.h"
#include "maths/rational.h"
#include "../helpers.h"
#include "../docstrings/maths/polynomial.h"
using pybind11::overload_cast;
using regina::Polynomial;
template <typename T>
void addPolynomialOver(pybind11::module_& m, const char* className) {
RDOC_SCOPE_BEGIN(Polynomial)
auto c = pybind11::class_<Polynomial<T>>(m, className, rdoc_scope)
.def(pybind11::init<>(), rdoc::__default)
.def(pybind11::init<const Polynomial<T>&>(), rdoc::__copy)
.def(pybind11::init([](size_t exp) { // deprecated
Polynomial<T> ans;
ans.initExp(exp);
return ans;
}), rdoc::__init)
.def(pybind11::init([](const std::vector<T>& coeffs) {
return new Polynomial<T>(coeffs.begin(), coeffs.end());
}), pybind11::arg("coefficients"), rdoc::__init_2)
// overload_cast has trouble with templated vs non-templated overloads.
// Just cast directly.
.def("init", static_cast<void (Polynomial<T>::*)()>(
&Polynomial<T>::init), rdoc::init)
.def("initExp", &Polynomial<T>::initExp, rdoc::initExp)
.def("init", &Polynomial<T>::initExp, rdoc::init_2) // deprecated
.def("init", [](Polynomial<T>& p, const std::vector<T>& c) {
p.init(c.begin(), c.end());
}, pybind11::arg("coefficients"), rdoc::init_3)
.def("degree", &Polynomial<T>::degree, rdoc::degree)
.def("isZero", &Polynomial<T>::isZero, rdoc::isZero)
.def("isMonic", &Polynomial<T>::isMonic, rdoc::isMonic)
.def("leading", &Polynomial<T>::leading,
pybind11::return_value_policy::copy, // to enforce constness
rdoc::leading)
.def("__getitem__", [](const Polynomial<T>& p, size_t exp) {
return p[exp];
}, pybind11::return_value_policy::copy, // to enforce constness
rdoc::__array)
.def("__setitem__", [](Polynomial<T>& p, size_t exp, const T& value) {
p.set(exp, value);
}, rdoc::__array)
.def("set", &Polynomial<T>::set, rdoc::set)
.def("swap", &Polynomial<T>::swap, rdoc::swap)
.def("negate", &Polynomial<T>::negate, rdoc::negate)
.def("shift", &Polynomial<T>::shift, rdoc::shift)
.def("str", overload_cast<const char*>(
&Polynomial<T>::str, pybind11::const_), rdoc::str)
.def("utf8", overload_cast<const char*>(
&Polynomial<T>::utf8, pybind11::const_), rdoc::utf8)
.def(pybind11::self *= T(), rdoc::__imul)
.def(pybind11::self /= T(), rdoc::__idiv)
.def(pybind11::self += pybind11::self, rdoc::__iadd)
.def(pybind11::self -= pybind11::self, rdoc::__isub)
.def(pybind11::self *= pybind11::self, rdoc::__imul_2)
.def(pybind11::self /= pybind11::self, rdoc::__idiv_2)
.def(pybind11::self * T(), rdoc_global::__mul)
.def(T() * pybind11::self, rdoc_global::__mul_2)
.def(pybind11::self / T(), rdoc_global::__div)
.def(pybind11::self + pybind11::self, rdoc_global::__add)
.def(pybind11::self - pybind11::self, rdoc_global::__sub_2)
.def(pybind11::self * pybind11::self, rdoc_global::__mul_3)
.def(pybind11::self / pybind11::self, rdoc_global::__div_2)
.def(- pybind11::self, rdoc_global::__sub)
.def("divisionAlg", overload_cast<const Polynomial<T>&>(
&Polynomial<T>::divisionAlg, pybind11::const_),
rdoc::divisionAlg)
.def("gcdWithCoeffs", &Polynomial<T>::template gcdWithCoeffs<T>,
rdoc::gcdWithCoeffs)
;
regina::python::add_output(c);
regina::python::add_eq_operators(c, rdoc::__eq);
regina::python::add_global_swap<Polynomial<T>>(m, rdoc::global_swap);
RDOC_SCOPE_END
}
void addPolynomial(pybind11::module_& m) {
addPolynomialOver<regina::Integer>(m, "PolynomialInt");
addPolynomialOver<regina::Rational>(m, "PolynomialRational");
m.attr("Polynomial") = m.attr("PolynomialRational");
}
|
