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
|
/**************************************************************************
* *
* 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 "packet/npacket.h"
#include <boost/python.hpp>
using namespace boost::python;
using regina::NPacket;
namespace {
NPacket* (NPacket::*firstTreePacket_non_const)(const std::string&) =
&NPacket::firstTreePacket;
NPacket* (NPacket::*nextTreePacket_non_const)(const std::string&) =
&NPacket::nextTreePacket;
NPacket* (NPacket::*findPacketLabel_non_const)(const std::string&) =
&NPacket::findPacketLabel;
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(OL_moveUp,
NPacket::moveUp, 0, 1);
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(OL_moveDown,
NPacket::moveDown, 0, 1);
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(OL_nextTreePacket,
NPacket::nextTreePacket, 0, 1);
BOOST_PYTHON_MEMBER_FUNCTION_OVERLOADS(OL_clone,
NPacket::clone, 0, 2);
void reparent_check(NPacket& child, NPacket* newParent,
bool first = false) {
if (child.getTreeParent())
child.reparent(newParent, first);
else {
PyErr_SetString(PyExc_AssertionError,
"reparent() cannot be used on packets with no parent");
::boost::python::throw_error_already_set();
}
}
BOOST_PYTHON_FUNCTION_OVERLOADS(OL_reparent, reparent_check, 2, 3);
void insertChildFirst_own(NPacket& parent, std::auto_ptr<NPacket> child) {
parent.insertChildFirst(child.get());
child.release();
}
void insertChildLast_own(NPacket& parent, std::auto_ptr<NPacket> child) {
parent.insertChildLast(child.get());
child.release();
}
void insertChildAfter_own(NPacket& parent, std::auto_ptr<NPacket> child,
NPacket* prevChild) {
parent.insertChildAfter(child.get(), prevChild);
child.release();
}
boost::python::list getTags_list(const NPacket* p) {
const std::set<std::string>& tags = p->getTags();
std::set<std::string>::const_iterator it;
boost::python::list ans;
for (it = tags.begin(); it != tags.end(); it++)
ans.append(*it);
return ans;
}
}
void addNPacket() {
class_<NPacket, boost::noncopyable,
bases<regina::ShareableObject>,
std::auto_ptr<NPacket> >("NPacket", no_init)
.def("getPacketType", &NPacket::getPacketType)
.def("getPacketTypeName", &NPacket::getPacketTypeName)
.def("getPacketLabel", &NPacket::getPacketLabel,
return_value_policy<return_by_value>())
.def("setPacketLabel", &NPacket::setPacketLabel)
.def("getFullName", &NPacket::getFullName)
.def("makeUniqueLabel", &NPacket::makeUniqueLabel)
.def("makeUniqueLabels", &NPacket::makeUniqueLabels)
.def("hasTag", &NPacket::hasTag)
.def("hasTags", &NPacket::hasTags)
.def("addTag", &NPacket::addTag)
.def("removeTag", &NPacket::removeTag)
.def("removeAllTags", &NPacket::removeAllTags)
.def("getTags", getTags_list)
.def("getTreeParent", &NPacket::getTreeParent,
return_value_policy<reference_existing_object>())
.def("getFirstTreeChild", &NPacket::getFirstTreeChild,
return_value_policy<reference_existing_object>())
.def("getLastTreeChild", &NPacket::getLastTreeChild,
return_value_policy<reference_existing_object>())
.def("getNextTreeSibling", &NPacket::getNextTreeSibling,
return_value_policy<reference_existing_object>())
.def("getPrevTreeSibling", &NPacket::getPrevTreeSibling,
return_value_policy<reference_existing_object>())
.def("getTreeMatriarch", &NPacket::getTreeMatriarch,
return_value_policy<reference_existing_object>())
.def("levelsDownTo", &NPacket::levelsDownTo)
.def("levelsUpTo", &NPacket::levelsUpTo)
.def("isGrandparentOf", &NPacket::isGrandparentOf)
.def("getNumberOfChildren", &NPacket::getNumberOfChildren)
.def("getNumberOfDescendants", &NPacket::getNumberOfDescendants)
.def("getTotalTreeSize", &NPacket::getTotalTreeSize)
.def("insertChildFirst", insertChildFirst_own)
.def("insertChildLast", insertChildLast_own)
.def("insertChildAfter", insertChildAfter_own)
.def("makeOrphan", &NPacket::makeOrphan)
.def("reparent", reparent_check, OL_reparent())
.def("swapWithNextSibling", &NPacket::swapWithNextSibling)
.def("moveUp", &NPacket::moveUp, OL_moveUp())
.def("moveDown", &NPacket::moveDown, OL_moveDown())
.def("moveToFirst", &NPacket::moveToFirst)
.def("moveToLast", &NPacket::moveToLast)
.def("sortChildren", &NPacket::sortChildren)
.def("nextTreePacket", nextTreePacket_non_const, OL_nextTreePacket()
[return_value_policy<reference_existing_object>()])
.def("firstTreePacket", firstTreePacket_non_const,
return_value_policy<reference_existing_object>())
.def("findPacketLabel", findPacketLabel_non_const,
return_value_policy<reference_existing_object>())
.def("dependsOnParent", &NPacket::dependsOnParent)
.def("isPacketEditable", &NPacket::isPacketEditable)
.def("clone", &NPacket::clone, OL_clone()[
return_value_policy<reference_existing_object>()])
;
}
|
