regina 7.4.1__cp314-cp314-macosx_10_13_x86_64.whl

regina/sageRegina/testsuite/equality.out

@@ -0,0 +1,112 @@
+EqualityType.BY_VALUE
+EqualityType.BY_REFERENCE
+EqualityType.BY_VALUE
+EqualityType.NEVER_INSTANTIATED
+EqualityType.DISABLED
+EqualityType.DISABLED
+
+Integer : ==, not !=
+Integer : not ==, !=
+AbelianGroup : ==, not !=
+AbelianGroup : not ==, !=
+GroupPresentation : ==, not !=
+GroupPresentation : not ==, !=
+Link : ==, not !=
+Link : not ==, !=
+Link : ==, not !=
+Link : not ==, !=
+Link + Packet : ==, not !=, throws on samePacket()
+Link + Packet : ==, not !=, throws on samePacket()
+PacketOfLink : ==, not !=, different packets
+PacketOfLink : ==, not !=, same packet
+Tangle : ==, not !=
+Tangle : not ==, !=
+Tangle : not ==, !=
+ModelLinkGraph : ==, not !=
+ModelLinkGraph : not ==, !=
+ModelLinkGraphCells : ==, not !=
+ModelLinkGraphCells : not ==, !=
+Triangulation3 : ==, not !=
+Triangulation3 : not ==, !=
+Triangulation3 + Packet : ==, not !=, throws on samePacket()
+Triangulation3 + Packet : ==, not !=, throws on samePacket()
+PacketOfTriangulation3 : ==, not !=, different packets
+PacketOfTriangulation3 : ==, not !=, same packet
+SnapPeaTriangulation : ==, not !=
+SnapPeaTriangulation : not ==, !=
+SnapPeaTriangulation : not ==, !=
+SnapPeaTriangulation : not ==, !=
+FacetPairing2 : ==, not !=
+FacetPairing2 : not ==, !=
+Attachment : ==, not !=, different packets
+Attachment : not ==, !=, different packets
+Attachment : not ==, !=, different packets
+Attachment : not ==, !=, different packets
+Text : ==, not !=, different packets
+Text : not ==, !=, different packets
+Script : not ==, !=
+Script : ==, not !=
+Script : ==, not !=
+GluingPerms2 : ==, not !=
+GluingPerms2 : not ==, !=
+GluingPerms2 : not ==, !=
+NormalSurfaces : not ==, !=
+NormalSurfaces : ==, not !=
+NormalSurfaces : ==, not !=
+NormalHypersurfaces : not ==, !=
+NormalHypersurfaces : ==, not !=
+NormalHypersurfaces : ==, not !=
+AngleStructures : not ==, !=
+AngleStructures : ==, not !=
+TypeTrie : ==, not !=
+TypeTrie : not ==, !=
+TypeTrie : not ==, !=
+TrieSet : ==, not !=
+TrieSet : not ==, !=
+TrieSet : not ==, !=
+LPMatrix : ==, not !=
+LPMatrix : ==, not !=
+LPMatrix : not ==, !=
+ValidityConstraints : ==, not !=
+ValidityConstraints : not ==, !=
+Signature : ==, not !=
+Signature : not ==, !=
+SFSAlt : ==, not !=
+SFSAlt : not ==, !=
+DiscSetTet : ==, not !=
+DiscSetTet : not ==, !=
+DiscSetSurface : ==, not !=
+DiscSetSurface : not ==, !=
+DiscSetSurface : not ==, !=
+TreeDecomposition : ==, not !=
+TreeDecomposition : not ==, !=
+SatBlockSpec : ==, not !=
+SatBlockSpec : not ==, !=
+SatBlockSpec : ==, not !=
+SatBlockSpec : not ==, !=
+SatBlockSpec : ==, not !=
+SatBlockSpec : not ==, !=
+SatBlock : ==, not !=
+SatBlock : not ==, !=
+SatBlock : ==, not !=
+SatBlock : not ==, !=
+SatBlock : ==, not !=
+SatBlock : not ==, !=
+TxICore : ==, not !=
+TxICore : not ==, !=
+TxICore : not ==, !=
+TxICore : ==, not !=
+BlockedSFSTriple : ==, not !=
+BlockedSFSTriple : not ==, !=
+BlockedSFSTriple.manifold() : ==, not !=
+Tetrahedron3 : ==, not !=
+Tetrahedron3 : not ==, !=
+Container : throws on ==, throws on !=, same packet
+Text : ==, not !=, same packet
+Different Packets : throws on ==, throws on !=, different packets
+Different Packets : throws on ==, throws on !=, different packets
+Different Packets : throws on ==, throws on !=, different packets
+Different Packets : throws on ==, throws on !=, different packets
+Different Packets : throws on ==, throws on !=, throws on samePacket()
+Different Packets : throws on ==, throws on !=, throws on samePacket()
+HomologicalData : throws on ==, throws on !=

regina/sageRegina/testsuite/equality.test

@@ -0,0 +1,308 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2015-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests that == and != behave as expected for Regina's python bindings.
+#
+# This file is a single component of Regina's python test suite.  To run
+# the python test suite, move to the main python directory in the source
+# tree and run "make check".
+#
+# 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.
+#
+# As an exception, when this program is distributed through (i) the
+# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
+# (iii) Google Play by Google Inc., then that store may impose any
+# digital rights management, device limits and/or redistribution
+# restrictions that are required by its terms of service.
+#
+# 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, see <https://www.gnu.org/licenses/>.
+
+print(AbelianGroup.equalityType)
+print(GluingPermSearcher2.equalityType)
+print(Integer.equalityType)
+print(SigCensus.equalityType)
+print(HomologicalData.equalityType)
+print(Container.equalityType)
+
+print()
+
+def cmp(name, a, b, packet = False):
+	ans = ''
+	try:
+		if a == b:
+			ans += '=='
+		else:
+			ans += 'not =='
+	except:
+		ans += 'throws on =='
+	ans += ', '
+	try:
+		if a != b:
+			ans += '!='
+		else:
+			ans += 'not !='
+	except:
+		ans += 'throws on !='
+	if packet:
+		ans += ', '
+		try:
+			if a.samePacket(b):
+				ans += 'same packet'
+			else:
+				ans += 'different packets'
+		except:
+			ans += 'throws on samePacket()'
+	print(name, ':', ans)
+
+# ----------------------------------------------------------------------
+# Classes that compare by value:
+# ----------------------------------------------------------------------
+
+cmp('Integer', Integer(3), Integer(3))
+cmp('Integer', Integer(3), Integer(4))
+
+cmp('AbelianGroup', AbelianGroup(), AbelianGroup())
+cmp('AbelianGroup', AbelianGroup(), AbelianGroup(1))
+
+cmp('GroupPresentation', GroupPresentation(), GroupPresentation())
+cmp('GroupPresentation', GroupPresentation(), GroupPresentation(1))
+
+cmp('Link', ExampleLink.trefoil(), ExampleLink.trefoilRight())
+cmp('Link', ExampleLink.trefoilLeft(), ExampleLink.trefoilRight())
+cmp('Link', Link(3), Link(3))
+cmp('Link', Link(3), Link(2))
+cmp('Link + Packet', Link(2), PacketOfLink(2), True)
+cmp('Link + Packet', PacketOfLink(2), Link(2), True)
+cmp('PacketOfLink', PacketOfLink(2), PacketOfLink(2), True)
+p = PacketOfLink(3)
+cmp('PacketOfLink', p, p.root(), True)
+
+cmp('Tangle', Tangle(3,2), Tangle(3,2))
+cmp('Tangle', Tangle(3,2), Tangle(3,-2))
+cmp('Tangle', Tangle(1,0), Tangle(0,1))
+
+g1 = ModelLinkGraph.fromPlantri('bcdd,aeec,abfd,acfa,bffb,ceed')
+g2 = ModelLinkGraph.fromPlantri('bcdd,aeec,abfd,acfa,bffb,eedc')
+cmp('ModelLinkGraph', g1, ModelLinkGraph(g1))
+cmp('ModelLinkGraph', g1, g2)
+cmp('ModelLinkGraphCells', g1.cells(), ModelLinkGraph(g1).cells())
+cmp('ModelLinkGraphCells', g1.cells(), g2.cells())
+
+cmp('Triangulation3', Triangulation3(), Triangulation3())
+cmp('Triangulation3', Example3.figureEight(), Example3.whiteheadLink())
+cmp('Triangulation3 + Packet', Triangulation3(), PacketOfTriangulation3(), True)
+cmp('Triangulation3 + Packet', PacketOfTriangulation3(), Triangulation3(), True)
+cmp('PacketOfTriangulation3', PacketOfTriangulation3(), PacketOfTriangulation3(), True)
+p = PacketOfTriangulation3()
+cmp('PacketOfTriangulation3', p, p.root(), True)
+
+w = ExampleSnapPea.whiteheadLink()
+cmp('SnapPeaTriangulation', w, ExampleSnapPea.whiteheadLink())
+dummy = w.fill(3,4,0)
+cmp('SnapPeaTriangulation', w, ExampleSnapPea.whiteheadLink())
+cmp('SnapPeaTriangulation', ExampleSnapPea.whiteheadLink(), w)
+cmp('SnapPeaTriangulation', ExampleSnapPea.figureEight(), w)
+
+cmp('FacetPairing2', FacetPairing2(Example2.kb()), FacetPairing2(Example2.kb()))
+cmp('FacetPairing2', FacetPairing2(Example2.mobius()), FacetPairing2(Example2.annulus()))
+
+cmp('Attachment', Attachment(b'foo', 'x'), Attachment(b'foo', 'y'), True)
+cmp('Attachment', Attachment(b'foo', 'x'), Attachment(), True)
+cmp('Attachment', Attachment(), Attachment(b'foo', 'x'), True)
+cmp('Attachment', Attachment(b'foof', 'x'), Attachment(b'foo', 'x'), True)
+cmp('Text', Text('foo'), Text('foo'), True)
+cmp('Text', Text('foo'), Text('foof'), True)
+
+s = Script()
+s.setText('print("Hello world!")')
+dummy = s.addVariable('foo', None)
+dummy = s.addVariable('bar', s)
+t = Script()
+t.setText('print("Hello world!")')
+dummy = t.addVariable('foo', None)
+dummy = t.addVariable('bar', t)
+cmp('Script', s, t)
+t.removeVariable('bar')
+dummy = t.addVariable('bar', s)
+cmp('Script', s, t)
+cmp('Script', s, Script(s))
+
+x = None
+
+def foundGluings2(g):
+	global x
+	if not x:
+		x = GluingPerms2(g)
+	cmp('GluingPerms2', x, g)
+
+def foundPairing2(p, isos):
+	GluingPermSearcher2.findAllPerms(p, isos, True, foundGluings2)
+
+FacetPairing2.findAllPairings(2, False, 0, foundPairing2)
+
+a = NormalSurfaces(Example3.poincare(), NormalCoords.Standard)
+b = NormalSurfaces(Example3.poincare(), NormalCoords.Quad)
+c = NormalSurfaces(Example3.poincare(), NormalCoords.Standard)
+cmp('NormalSurfaces', a, b)
+cmp('NormalSurfaces', a, c)
+a.sort(lambda x,y: x.eulerChar() > y.eulerChar())
+c.sort(lambda x,y: x.eulerChar() < y.eulerChar())
+cmp('NormalSurfaces', a, c)
+
+a = NormalHypersurfaces(Example4.s3xs1(), HyperCoords.Standard)
+b = NormalHypersurfaces(Example4.s3xs1(), HyperCoords.Prism)
+c = NormalHypersurfaces(Example4.s3xs1(), HyperCoords.Standard)
+cmp('NormalHypersurfaces', a, b)
+cmp('NormalHypersurfaces', a, c)
+a.sort(lambda x,y: x.homology().str() > y.homology().str())
+c.sort(lambda x,y: x.homology().str() < y.homology().str())
+cmp('NormalHypersurfaces', a, c)
+
+a = AngleStructures(Example3.figureEight())
+b = AngleStructures(Example3.figureEight(), True)
+c = AngleStructures(Example3.figureEight())
+cmp('AngleStructures', a, b)
+cmp('AngleStructures', a, c)
+
+t = TypeTrie4()
+t.insert([1,0,3])
+t.insert([0,0,2])
+u = TypeTrie4(t)
+cmp('TypeTrie', t, u)
+u.insert([0,1,1])
+cmp('TypeTrie', t, u)
+cmp('TypeTrie', u, t)
+
+t = TrieSet()
+b = Bitmask8(); b.set([1,2,4], True); t.insert(b)
+b = Bitmask8(); b.set([1,4,5], True); t.insert(b)
+u = TrieSet(t)
+cmp('TrieSet', t, u)
+b = Bitmask8(); b.set([0,4], True); t.insert(b)
+cmp('TrieSet', t, u)
+cmp('TrieSet', u, t)
+
+t = Example3.figureEight()
+tab = LPInitialTableaux(t, NormalCoords.Quad)
+m1 = LPMatrix(tab.rank(), tab.columns()); tab.fillInitialTableaux(m1)
+m2 = LPMatrix(tab.rank(), tab.columns()); tab.fillInitialTableaux(m2)
+cmp('LPMatrix', LPMatrix(), LPMatrix())
+cmp('LPMatrix', m1, m2)
+t = Example3.s2xs1()
+tab = LPInitialTableaux(t, NormalCoords.Quad)
+m3 = LPMatrix(tab.rank(), tab.columns()); tab.fillInitialTableaux(m3)
+cmp('LPMatrix', m1, m3)
+
+v1 = ValidityConstraints(10, 4)
+v1.addLocal([4,5,6]); v1.addLocal([7,8,9]); v1.addGlobal([0])
+v2 = ValidityConstraints(10, 4)
+v2.addLocal([9,8,7]); v2.addLocal([6,5,4]); v2.addGlobal([0])
+v3 = ValidityConstraints(10, 4)
+v3.addLocal([9,8,7]); v3.addLocal([6,5,4]); v3.addGlobal([1])
+cmp('ValidityConstraints', v1, v2)
+cmp('ValidityConstraints', v1, v3)
+
+cmp('Signature', Signature('(aba)(b)'), Signature('aba.b'))
+cmp('Signature', Signature('(aba)(b)'), Signature('(ab)(a)(b)'))
+
+sfsDisc = SFSpace(SFSpace.o2, 0, 1)
+s1 = SFSAlt.altSet(sfsDisc)
+s2 = SFSAlt.altSet(sfsDisc)
+cmp('SFSAlt', s1[0], s2[0])
+cmp('SFSAlt', s1[0], s1[1])
+
+t = Example3.poincare()
+st = NormalSurfaces(t, NormalCoords.Quad)
+dt = DiscSetSurface(st.surface(0))
+u = Example3.s2xs1()
+su = NormalSurfaces(u, NormalCoords.Quad)
+du = DiscSetSurface(su.surface(0))
+cmp('DiscSetTet', du.tetDiscs(0), du.tetDiscs(1)) # should be equal
+cmp('DiscSetTet', dt.tetDiscs(0), dt.tetDiscs(1)) # should be different
+cmp('DiscSetSurface', dt, DiscSetSurface(st.surface(0)))
+cmp('DiscSetSurface', dt, DiscSetSurface(st.surface(1)))
+cmp('DiscSetSurface', dt, du)
+
+t1 = TreeDecomposition(ExampleLink.conway())
+t2 = TreeDecomposition(ExampleLink.conway())
+cmp('TreeDecomposition', t1, t2)
+t2.reroot(t2.bag(3))
+cmp('TreeDecomposition', t1, t2)
+
+t = Triangulation3('kLALALMkbccfefihijjlpkusuueotr')
+b = BlockedSFSTriple.recognise(t)
+# [ Tri, Mob(v), LST(1,2,3) | Tri, Mob(v) | Tri, Mob(v), Mob(v) ]
+cmp('SatBlockSpec', b.end(0).block(0), b.centre().block(0))
+cmp('SatBlockSpec', b.end(0).block(0), b.centre().block(1))
+cmp('SatBlockSpec', b.end(0).block(1), b.centre().block(1))
+cmp('SatBlockSpec', b.end(0).block(1), b.centre().block(0))
+cmp('SatBlockSpec', b.end(0).block(2), b.end(0).block(2))
+cmp('SatBlockSpec', b.end(0).block(2), b.end(1).block(2))
+cmp('SatBlock', b.end(0).block(0).block(), b.centre().block(0).block())
+cmp('SatBlock', b.end(0).block(0).block(), b.centre().block(1).block())
+cmp('SatBlock', b.end(0).block(1).block(), b.centre().block(1).block())
+cmp('SatBlock', b.end(0).block(1).block(), b.centre().block(0).block())
+cmp('SatBlock', b.end(0).block(2).block(), b.end(0).block(2).block())
+cmp('SatBlock', b.end(0).block(2).block(), b.end(1).block(2).block())
+
+cmp('TxICore', TxIDiagonalCore(6, 1), TxIDiagonalCore(6, 1))
+cmp('TxICore', TxIDiagonalCore(7, 1), TxIDiagonalCore(7, 2))
+cmp('TxICore', TxIDiagonalCore(6, 1), TxIParallelCore())
+cmp('TxICore', TxIParallelCore(), TxIParallelCore())
+
+t = Triangulation3('kLALALMkbccfefihijjlpkusuueotr')
+b1 = BlockedSFSTriple.recognise(t)
+b2 = BlockedSFSTriple.recognise(t)
+cmp('BlockedSFSTriple', b1, b2)
+iso = Isomorphism3(t.size())
+for i in range(t.size()):
+	iso.setSimpImage(i, t.size() - i - 1)
+	iso.setFacetPerm(i, Perm4(3,2,1,0))
+
+t2 = iso.apply(t)
+b3 = BlockedSFSTriple.recognise(t2)
+cmp('BlockedSFSTriple', b1, b3)
+cmp('BlockedSFSTriple.manifold()', b1.manifold(), b3.manifold())
+
+# ----------------------------------------------------------------------
+# Classes that compare by reference:
+# ----------------------------------------------------------------------
+
+t = Triangulation3()
+(a,b) = t.newTetrahedra(2)
+cmp('Tetrahedron3', a, t.tetrahedron(0))
+cmp('Tetrahedron3', a, t.tetrahedron(1))
+
+# ----------------------------------------------------------------------
+# More tests with packets:
+# ----------------------------------------------------------------------
+
+a = Container()
+cmp('Container', a, a.root(), True)
+t = Text()
+cmp('Text', t, t.root(), True)
+cmp('Different Packets', Container(), Text(), True)
+cmp('Different Packets', Text(), Container(), True)
+cmp('Different Packets', PacketOfLink(), Text(), True)
+cmp('Different Packets', Text(), PacketOfLink(), True)
+cmp('Different Packets', Text(), Link(), True)
+cmp('Different Packets', Link(), Text(), True)
+
+# ----------------------------------------------------------------------
+# Classes that cannot be compared:
+# ----------------------------------------------------------------------
+
+t = Example3.poincare()
+cmp('HomologicalData', HomologicalData(t), HomologicalData(t))

regina/sageRegina/testsuite/euler.out

@@ -0,0 +1,15 @@
+Euler characteristics for triangulation vs compact manifold:
+0 0 --- Empty triangulation
+0 0 --- L(8,3)
+0 0 --- RP2 x S1
+0 0 --- Solid Klein bottle
+0 0 --- LST(3,4,7)
+1 1 --- Solid ball
+1 0 --- Figure eight knot complement
+2 0 --- Whitehead link complement
+1 0 --- Gieseking manifold
+2 -1 --- Cusped genus two torus
+-1 1 --- Invalid edge
+1 1 --- Two projective plane cusps
+1 0 --- Pinched solid torus
+1 0 --- Pinched solid Klein bottle

regina/sageRegina/testsuite/euler.test

@@ -0,0 +1,93 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2007-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests different Euler characteristic calculations.
+#
+# This file is a single component of Regina's python test suite.  To run
+# the python test suite, move to the main python directory in the source
+# tree and run "make check".
+#
+# 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.
+#
+# As an exception, when this program is distributed through (i) the
+# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
+# (iii) Google Play by Google Inc., then that store may impose any
+# digital rights management, device limits and/or redistribution
+# restrictions that are required by its terms of service.
+#
+# 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, see <https://www.gnu.org/licenses/>.
+
+def printEuler(t, name):
+	print(t.eulerCharTri(), t.eulerCharManifold(), \
+		'---', name)
+	
+	# Consistency check, while we're here.
+	eHom = regina.HomologicalData(t).eulerChar()
+	if eHom != t.eulerCharManifold():
+		print('ERROR: Triangulation3::eulerCharManifold() and')
+		print('       HomologicalData.eulerChar() disagree!')
+
+print('Euler characteristics for triangulation vs compact manifold:')
+
+# Empty:
+printEuler(regina.Triangulation3(), "Empty triangulation")
+
+# Closed:
+printEuler(regina.Example3.lens(8,3), "L(8,3)")
+printEuler(regina.Example3.rp2xs1(), "RP2 x S1")
+
+# Bounded:
+printEuler(regina.Example3.solidKleinBottle(),
+	"Solid Klein bottle")
+printEuler(regina.Example3.lst(3,4), "LST(3,4,7)")
+
+tri = regina.Triangulation3()
+dummy = tri.newTetrahedron()
+printEuler(tri, "Solid ball")
+
+# Ideal:
+printEuler(regina.Example3.figureEight(),
+	"Figure eight knot complement")
+printEuler(regina.Example3.whiteheadLink(),
+	"Whitehead link complement")
+printEuler(regina.Example3.gieseking(),
+	"Gieseking manifold")
+printEuler(regina.Example3.cuspedGenusTwoTorus(),
+	"Cusped genus two torus")
+
+# Edge joined to itself:
+tri = regina.Triangulation3()
+t = tri.newTetrahedron()
+t.join(0, t, regina.Perm4(1,0,3,2))
+t.join(2, t, regina.Perm4(1,0,3,2))
+printEuler(tri, "Invalid edge")
+
+# Subdivide to obtain a valid triangulation:
+tri.subdivide()
+printEuler(tri, "Two projective plane cusps")
+
+# Invalid boundary vertex links:
+tri = regina.Triangulation3()
+(t, s) = tri.newTetrahedra(2)
+t.join(3, s, regina.Perm4(0,1,2,3))
+t.join(2, s, regina.Perm4(0,3,1,2))
+printEuler(tri, "Pinched solid torus")
+
+tri = regina.Triangulation3()
+(t, s) = tri.newTetrahedra(2)
+t.join(3, s, regina.Perm4(0,1,2,3))
+t.join(2, s, regina.Perm4(0,2,1,3))
+printEuler(tri, "Pinched solid Klein bottle")
+

regina/sageRegina/testsuite/exception.out

@@ -0,0 +1,7 @@
+10
+Z_55
+0.5
+Z
+7 embedded, vertex surfaces (Standard normal (tri-quad))
+True
+All done!

regina/sageRegina/testsuite/exception.test

@@ -0,0 +1,98 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2015-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests throwing and catching Regina's exception types.
+#
+# This file is a single component of Regina's python test suite.  To run
+# the python test suite, move to the main python directory in the source
+# tree and run "make check".
+#
+# 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.
+#
+# As an exception, when this program is distributed through (i) the
+# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
+# (iii) Google Play by Google Inc., then that store may impose any
+# digital rights management, device limits and/or redistribution
+# restrictions that are required by its terms of service.
+#
+# 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, see <https://www.gnu.org/licenses/>.
+
+t = Example3.poincare()
+
+print(t.faces(2).size())
+try:
+    print(t.faces(3).size())
+    print('ERROR: Did not throw exception')
+except InvalidArgument:
+    pass
+
+try:
+    print(t.faces(-1).size())
+    print('ERROR: Did not throw exception')
+except InvalidArgument:
+    pass
+
+t = ExampleSnapPea.whiteheadLink()
+try:
+    print(t.filledAll())
+    print('ERROR: Did not throw exception')
+except FailedPrecondition:
+    pass
+
+dummy = t.fill(1,2,0)
+dummy = t.fill(3,4,1)
+print(t.filledAll().homology())
+dummy = t.pachner(t.triangle(0))
+try:
+    print(t.filledAll())
+    print('ERROR: Did not throw exception')
+except SnapPeaIsNull:
+    pass
+
+print(Rational(1,2).doubleApprox())
+try:
+    print(Rational(1,0).doubleApprox())
+    print('ERROR: Did not throw exception')
+except UnsolvedCase:
+    pass
+
+s = SFSpace()
+print(s.construct().homology())
+s.addPuncture()
+try:
+    print(s.construct())
+    print('ERROR: Did not throw exception')
+except NotImplemented:
+    pass
+
+t = Example3.poincare()
+s = NormalSurfaces(t, NormalCoords.Standard)
+t = None
+print(s)
+try:
+    t = s.triangulation()
+    print(t.isReadOnlySnapshot())
+    # TODO: subdivide(), due to a swap() in its internal implementation,
+    # actually throws a SnapshotWriteError from a triangulation destructor.
+    # This is *bad*, and moreover results in an exception that Python cannot
+    # catch.
+    # t.subdivide()
+    t.pachner(t.triangle(0))
+    print('ERROR: Did not throw exception')
+except SnapshotWriteError:
+    pass
+
+print('All done!')
+