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
|
/**************************************************************************
* *
* 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 "subcomplex/nlayeredchain.h"
#include "triangulation/ntetrahedron.h"
#include <boost/python.hpp>
using namespace boost::python;
using regina::NLayeredChain;
void addNLayeredChain() {
class_<NLayeredChain, bases<regina::NStandardTriangulation>,
std::auto_ptr<NLayeredChain>, boost::noncopyable>
("NLayeredChain", init<regina::NTetrahedron*, regina::NPerm>())
.def(init<const NLayeredChain&>())
.def("getBottom", &NLayeredChain::getBottom,
return_value_policy<reference_existing_object>())
.def("getTop", &NLayeredChain::getTop,
return_value_policy<reference_existing_object>())
.def("getIndex", &NLayeredChain::getIndex)
.def("getBottomVertexRoles", &NLayeredChain::getBottomVertexRoles)
.def("getTopVertexRoles", &NLayeredChain::getTopVertexRoles)
.def("extendAbove", &NLayeredChain::extendAbove)
.def("extendBelow", &NLayeredChain::extendBelow)
.def("extendMaximal", &NLayeredChain::extendMaximal)
.def("reverse", &NLayeredChain::reverse)
.def("invert", &NLayeredChain::invert)
;
implicitly_convertible<std::auto_ptr<NLayeredChain>,
std::auto_ptr<regina::NStandardTriangulation> >();
}
|