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
|
/**************************************************************************
* *
* 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 "triangulation/nboundarycomponent.h"
#include "triangulation/ncomponent.h"
#include "triangulation/nedge.h"
#include "triangulation/ntetrahedron.h"
#include "triangulation/nvertex.h"
#include "../globalarray.h"
#include <boost/python.hpp>
using namespace boost::python;
using regina::NEdge;
using regina::NEdgeEmbedding;
using regina::python::GlobalArray;
using regina::python::GlobalArray2D;
namespace {
GlobalArray2D<int> edgeNumber_arr(regina::edgeNumber, 4);
GlobalArray<int> edgeStart_arr(regina::edgeStart, 6);
GlobalArray<int> edgeEnd_arr(regina::edgeEnd, 6);
GlobalArray2D<int> NEdge_edgeNumber(NEdge::edgeNumber, 4);
GlobalArray2D<int> NEdge_edgeVertex(NEdge::edgeVertex, 6);
GlobalArray<regina::NPerm> NEdge_ordering(NEdge::ordering, 6);
boost::python::list edge_getEmbeddings_list(const NEdge* e) {
const std::deque<NEdgeEmbedding>& embs = e->getEmbeddings();
std::deque<NEdgeEmbedding>::const_iterator it;
boost::python::list ans;
for (it = embs.begin(); it != embs.end(); it++)
ans.append(*it);
return ans;
}
}
void addNEdge() {
// Global arrays:
scope().attr("edgeNumber") = &edgeNumber_arr;
scope().attr("edgeStart") = &edgeStart_arr;
scope().attr("edgeEnd") = &edgeEnd_arr;
// Classes:
class_<NEdgeEmbedding>("NEdgeEmbedding",
init<regina::NTetrahedron*, int>())
.def(init<const NEdgeEmbedding&>())
.def("getTetrahedron", &NEdgeEmbedding::getTetrahedron,
return_value_policy<reference_existing_object>())
.def("getEdge", &NEdgeEmbedding::getEdge)
.def("getVertices", &NEdgeEmbedding::getVertices)
;
scope s = class_<NEdge, bases<regina::ShareableObject>,
std::auto_ptr<NEdge>, boost::noncopyable>("NEdge", no_init)
.def("getEmbeddings", edge_getEmbeddings_list)
.def("getNumberOfEmbeddings", &NEdge::getNumberOfEmbeddings)
.def("getEmbedding", &NEdge::getEmbedding,
return_internal_reference<>())
.def("getComponent", &NEdge::getComponent,
return_value_policy<reference_existing_object>())
.def("getBoundaryComponent", &NEdge::getBoundaryComponent,
return_value_policy<reference_existing_object>())
.def("getVertex", &NEdge::getVertex,
return_value_policy<reference_existing_object>())
.def("getDegree", &NEdge::getDegree)
.def("isBoundary", &NEdge::isBoundary)
.def("isValid", &NEdge::isValid)
;
s.attr("edgeNumber") = &NEdge_edgeNumber;
s.attr("edgeVertex") = &NEdge_edgeVertex;
s.attr("ordering") = &NEdge_ordering;
}
|
