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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Python Interface *
* *
* Copyright (c) 1999-2008, 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 "maths/matrixops.h"
#include <boost/python.hpp>
#include <boost/python/detail/api_placeholder.hpp> // For len().
using namespace boost::python;
using regina::NMatrixInt;
namespace {
void (*SNF_nobasis)(NMatrixInt&) = regina::smithNormalForm;
void (*SNF_basis)(NMatrixInt&, NMatrixInt&, NMatrixInt&,
NMatrixInt&, NMatrixInt&) = regina::smithNormalForm;
void columnEchelonForm_list(NMatrixInt& m, NMatrixInt& r,
NMatrixInt& rInv, boost::python::list rowList) {
std::vector<unsigned> rowListVector;
long len = boost::python::len(rowList);
for (long i = 0; i < len; i++) {
extract<long> x_long(rowList[i]);
// Better make sure we can actually convert to an unsigned int.
if (x_long() < 0) {
PyErr_SetString(PyExc_IndexError,
"Row indices may not be negative.");
boost::python::throw_error_already_set();
}
rowListVector.push_back(x_long());
}
regina::columnEchelonForm(m, r, rInv, rowListVector);
}
std::auto_ptr<NMatrixInt> preImageOfLattice_list(const NMatrixInt& m,
boost::python::list l) {
if (boost::python::len(l) != m.rows()) {
PyErr_SetString(PyExc_IndexError,
"Sublattice vector does not contain the expected number "
"of elements.");
boost::python::throw_error_already_set();
}
std::vector<regina::NLargeInteger> lVector;
for (unsigned long i = 0; i < m.rows(); ++i) {
// Accept any type that we know how to convert to a large integer.
extract<regina::NLargeInteger&> x_large(l[i]);
if (x_large.check()) {
lVector.push_back(x_large());
continue;
}
extract<long> x_long(l[i]);
if (x_long.check()) {
lVector.push_back(x_long());
continue;
}
extract<const char*> x_str(l[i]);
if (x_str.check()) {
lVector.push_back(x_str());
continue;
}
// Throw an exception.
x_large();
}
return regina::preImageOfLattice(m, lVector);
}
}
void addMatrixOps() {
def("smithNormalForm", SNF_nobasis);
def("smithNormalForm", SNF_basis);
def("columnEchelonForm", columnEchelonForm_list);
def("preImageOfLattice", preImageOfLattice_list);
}
|
