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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Python Interface *
* *
* Copyright (c) 1999-2009, 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. *
* *
* 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, write to the Free *
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, *
* MA 02110-1301, USA. *
* *
**************************************************************************/
/* end stub */
#include "algebra/nmarkedabeliangroup.h"
#include "maths/nmatrixint.h"
#include <boost/python.hpp>
#include <boost/python/detail/api_placeholder.hpp> // For len().
using namespace boost::python;
using regina::NHomMarkedAbelianGroup;
using regina::NMarkedAbelianGroup;
using regina::NMatrixInt;
namespace {
unsigned (NMarkedAbelianGroup::*getTorsionRank_large)(
const regina::NLargeInteger&) const =
&NMarkedAbelianGroup::getTorsionRank;
unsigned (NMarkedAbelianGroup::*getTorsionRank_long)(unsigned long)
const = &NMarkedAbelianGroup::getTorsionRank;
boost::python::list getFreeRep_list(
const NMarkedAbelianGroup& g, unsigned long index) {
boost::python::list ans;
std::vector<regina::NLargeInteger> rep = g.getFreeRep(index);
for (std::vector<regina::NLargeInteger>::const_iterator
it = rep.begin(); it != rep.end(); ++it) {
ans.append(*it);
}
return ans;
}
boost::python::list getTorsionRep_list(
const NMarkedAbelianGroup& g, unsigned long index) {
boost::python::list ans;
std::vector<regina::NLargeInteger> rep = g.getTorsionRep(index);
for (std::vector<regina::NLargeInteger>::const_iterator
it = rep.begin(); it != rep.end(); ++it) {
ans.append(*it);
}
return ans;
}
boost::python::list getSNFIsoRep_list_list(
const NMarkedAbelianGroup& g, boost::python::list element) {
unsigned long needLen = g.getM().columns();
if (boost::python::len(element) != needLen) {
PyErr_SetString(PyExc_IndexError,
"The element vector does not contain the expected "
"number of elements.");
boost::python::throw_error_already_set();
}
std::vector<regina::NLargeInteger> eltVector;
for (unsigned long i = 0; i < needLen; ++i) {
// Accept any type that we know how to convert to a large
// integer.
extract<regina::NLargeInteger&> x_large(element[i]);
if (x_large.check()) {
eltVector.push_back(x_large());
continue;
}
extract<long> x_long(element[i]);
if (x_long.check()) {
eltVector.push_back(x_long());
continue;
}
extract<const char*> x_str(element[i]);
if (x_str.check()) {
eltVector.push_back(x_str());
continue;
}
// Throw an exception.
x_large();
}
std::vector<regina::NLargeInteger> rep = g.getSNFIsoRep(eltVector);
boost::python::list ans;
for (std::vector<regina::NLargeInteger>::const_iterator
it = rep.begin(); it != rep.end(); ++it) {
ans.append(*it);
}
return ans;
}
void writeReducedMatrix_stdout(const NHomMarkedAbelianGroup& h) {
h.writeReducedMatrix(std::cout);
}
}
void addNMarkedAbelianGroup() {
class_<NMarkedAbelianGroup, bases<regina::ShareableObject>,
std::auto_ptr<NMarkedAbelianGroup>, boost::noncopyable>(
"NMarkedAbelianGroup", init<const NMatrixInt&, const NMatrixInt&>())
.def(init<const NMarkedAbelianGroup&>())
.def("getRank", &NMarkedAbelianGroup::getRank)
.def("getTorsionRank", getTorsionRank_large)
.def("getTorsionRank", getTorsionRank_long)
.def("getNumberOfInvariantFactors",
&NMarkedAbelianGroup::getNumberOfInvariantFactors)
.def("getInvariantFactor", &NMarkedAbelianGroup::getInvariantFactor,
return_value_policy<return_by_value>())
.def("isTrivial", &NMarkedAbelianGroup::isTrivial)
.def("getFreeRep", getFreeRep_list)
.def("getTorsionRep", getTorsionRep_list)
.def("getSNFIsoRep", getSNFIsoRep_list_list)
.def("getMRB", &NMarkedAbelianGroup::getMRB,
return_internal_reference<>())
.def("getMRBi", &NMarkedAbelianGroup::getMRBi,
return_internal_reference<>())
.def("getMCB", &NMarkedAbelianGroup::getMCB,
return_internal_reference<>())
.def("getMCBi", &NMarkedAbelianGroup::getMCBi,
return_internal_reference<>())
.def("getNRB", &NMarkedAbelianGroup::getNRB,
return_internal_reference<>())
.def("getNRBi", &NMarkedAbelianGroup::getNRBi,
return_internal_reference<>())
.def("getNCB", &NMarkedAbelianGroup::getNCB,
return_internal_reference<>())
.def("getNCBi", &NMarkedAbelianGroup::getNCBi,
return_internal_reference<>())
.def("getRankM", &NMarkedAbelianGroup::getRankM)
.def("getFreeLoc", &NMarkedAbelianGroup::getFreeLoc)
.def("getTorsionLoc", &NMarkedAbelianGroup::getTorsionLoc)
.def("getM", &NMarkedAbelianGroup::getM,
return_internal_reference<>())
.def("getN", &NMarkedAbelianGroup::getN,
return_internal_reference<>())
.def(self == self)
;
class_<NHomMarkedAbelianGroup, bases<regina::ShareableObject>,
std::auto_ptr<NHomMarkedAbelianGroup>, boost::noncopyable>(
"NHomMarkedAbelianGroup",
init<const NMarkedAbelianGroup&, const NMarkedAbelianGroup&,
const NMatrixInt&>())
.def(init<const NHomMarkedAbelianGroup&>())
.def("isEpic", &NHomMarkedAbelianGroup::isEpic)
.def("isMonic", &NHomMarkedAbelianGroup::isMonic)
.def("isIso", &NHomMarkedAbelianGroup::isIso)
.def("isZero", &NHomMarkedAbelianGroup::isZero)
.def("getKernel", &NHomMarkedAbelianGroup::getKernel,
return_internal_reference<>())
.def("getCokernel", &NHomMarkedAbelianGroup::getCokernel,
return_internal_reference<>())
.def("getImage", &NHomMarkedAbelianGroup::getImage,
return_internal_reference<>())
.def("getDomain", &NHomMarkedAbelianGroup::getDomain,
return_internal_reference<>())
.def("getRange", &NHomMarkedAbelianGroup::getRange,
return_internal_reference<>())
.def("getDefiningMatrix", &NHomMarkedAbelianGroup::getDefiningMatrix,
return_internal_reference<>())
.def("getReducedMatrix", &NHomMarkedAbelianGroup::getReducedMatrix,
return_internal_reference<>())
.def("writeReducedMatrix", writeReducedMatrix_stdout)
;
}
|
