regina 7.4.1__cp314-cp314-macosx_10_13_x86_64.whl

regina/sageRegina/testsuite/skeleton.test

@@ -0,0 +1,52 @@
+# 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).
+#
+# Provides detailed tests for the skeleta of triangulations.
+#
+# 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.weberSeifert()
+print(t.detail())
+
+for v in t.vertices():
+	print(v.detail())
+
+for e in t.edges():
+	print(e.detail())
+
+for f in t.triangles():
+	print(f.detail())
+
+t = Example2.nonOrientable(3, 1)
+print(t.detail())
+
+for v in t.vertices():
+	print(v.detail())
+
+for e in t.edges():
+	print(e.detail())
+

regina/sageRegina/testsuite/snappea.out

@@ -0,0 +1,90 @@
+2 Z
+Z + Z_5
+2 Z
+True
+
+2 Z
+Z + Z_5
+2 Z
+True
+
+2 Z
+To be changed:
+    Size: 4
+    Homology: 2 Z
+Was changed:
+    Size: 4
+    Homology: Z + Z_5
+Z + Z_5
+To be changed:
+    Size: 4
+    Homology: Z + Z_5
+Was changed:
+    Size: 4
+    Homology: 2 Z
+2 Z
+To be changed:
+    Size: 5
+    Homology: 2 Z
+Was changed:
+    Null
+True
+
+Ideal orientable 3-D triangulation, f = ( 2 4 8 4 ), cusps: [ vertex 1: (-3, 7), vertex 0 ]
+
+Size of the skeleton:
+  Tetrahedra: 4
+  Triangles: 8
+  Edges: 4
+  Vertices: 2
+
+Tetrahedron gluing:
+  Tet  |  gluing:       (012)       (013)       (023)       (123)
+  -----+---------------------------------------------------------
+    0  |              1 (320)     3 (230)     3 (231)     1 (120)
+    1  |              0 (312)     2 (213)     0 (210)     2 (023)
+    2  |              3 (130)     3 (012)     1 (123)     1 (103)
+    3  |              2 (013)     2 (201)     0 (301)     0 (302)
+
+Vertices:
+  Tet  |  vertex:    0   1   2   3
+  -----+--------------------------
+    0  |             0   1   1   1
+    1  |             1   1   1   0
+    2  |             1   1   1   0
+    3  |             1   1   0   1
+
+Edges:
+  Tet  |  edge:   01  02  03  12  13  23
+  -----+--------------------------------
+    0  |           0   0   1   2   3   2
+    1  |           3   2   0   2   1   0
+    2  |           2   2   1   3   1   0
+    3  |           2   1   3   1   2   0
+
+Triangles:
+  Tet  |  face:  012 013 023 123
+  -----+------------------------
+    0  |           0   1   2   3
+    1  |           3   4   0   5
+    2  |           6   7   5   4
+    3  |           7   6   1   2
+
+Tetrahedron shapes:
+  0: ( 0.960267, 1.2835 )
+  1: ( -0.0397327, 1.2835 )
+  2: ( 0.381077, 0.47042 )
+  3: ( 0.626279, 0.499517 )
+
+Cusps:
+  0: Vertex 1, filled (-3, 7)
+  1: Vertex 0, complete
+
+Ideal orientable 3-D triangulation, f = ( 2 4 8 4 )
+Ideal orientable 3-D triangulation, f = ( 2 4 8 4 )
+Ideal orientable 3-D triangulation, f = ( 2 4 8 4 ), cusps: [ vertex 0, vertex 1 ]
+Ideal orientable 3-D triangulation, f = ( 2 4 8 4 ), cusps: [ vertex 0, vertex 1 ]
+Closed orientable 3-D triangulation, f = ( 1 6 10 5 )
+Closed orientable 3-D triangulation, f = ( 1 6 10 5 )
+Ideal orientable 3-D triangulation, f = ( 1 2 4 2 ), cusps: [ vertex 0: (1, 0) ]
+Ideal orientable 3-D triangulation, f = ( 1 2 4 2 ), cusps: [ vertex 0: (1, 0) ]

regina/sageRegina/testsuite/snappea.test

@@ -0,0 +1,133 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2019-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests involving SnapPea triangulations.
+#
+# 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/>.
+
+# Fetch the python/testsuite path in the source tree, since we will need
+# to access external files.
+import sys
+if (len(sys.argv) > 1):
+    testpath = sys.argv[1]
+else:
+    testpath = '.'
+
+class Watcher(PacketListener):
+    def packetToBeChanged(self, packet):
+        print('To be changed:')
+        if packet.isNull():
+            print('    Null')
+        else:
+            print('    Size:', packet.size())
+            print('    Homology:', packet.homologyFilled())
+    def packetWasChanged(self, packet):
+        print('Was changed:')
+        if packet.isNull():
+            print('    Null')
+        else:
+            print('    Size:', packet.size())
+            print('    Homology:', packet.homologyFilled())
+
+w = Watcher()
+
+# Without a packet:
+
+t = SnapPeaTriangulation(Example3.whiteheadLink())
+
+print(t.homologyFilled())
+dummy = t.fill(3, 4, 0)
+print(t.homologyFilled())
+t.unfill()
+print(t.homologyFilled())
+dummy = t.pachner(t.triangle(0))
+print(t.isNull())
+
+print()
+
+# With a packet, but without a listener:
+
+t = PacketOfSnapPeaTriangulation(Example3.whiteheadLink())
+
+print(t.homologyFilled())
+dummy = t.fill(3, 4, 0)
+print(t.homologyFilled())
+t.unfill()
+print(t.homologyFilled())
+dummy = t.pachner(t.triangle(0))
+print(t.isNull())
+
+print()
+
+# With a packet and a listener:
+
+t = PacketOfSnapPeaTriangulation(Example3.whiteheadLink())
+dummy = t.listen(w)
+
+print(t.homologyFilled())
+dummy = t.fill(3, 4, 0)
+print(t.homologyFilled())
+t.unfill()
+print(t.homologyFilled())
+dummy = t.pachner(t.triangle(0))
+# The watcher should have given incorrect output at this point, since
+# packetToBeChanged is currently called too late (after the Regina
+# changes but before the SnapPea triangulation is nullified).
+# Specifically, we should see the wrong size() being output.
+# See the SnapPeaTriangulation class notes for details on this issue.
+print(t.isNull())
+
+print()
+
+# Make sure we get the SnapPeaTriangulation output functions, not the
+# inherited ones from Triangulation3.
+
+t = SnapPeaTriangulation(ExampleLink.whitehead())
+dummy = t.fill(-3,7)
+print(t.str())
+print()
+print(t.detail())
+
+# Verify that both Regina's and SnapPea's import code does the right thing.
+# This includes data files written by SnapPea and also data files written by
+# other programs (and formatted a little differently).
+# It also includes both ideal triangulations (which both import routines
+# should handle the same way) and closed triangulations (where SnapPea drills
+# and fills, but Regina preserves the triangulation).
+
+def reginaImport(filename):
+    f = open(filename)
+    text = f.read()
+    f.close()
+    
+    print(Triangulation3.fromSnapPea(text))
+    print(Triangulation3.fromSnapPea(filename))
+    print(SnapPeaTriangulation(text))
+    print(SnapPeaTriangulation(filename))
+
+reginaImport(testpath + '/whitehead.tri')
+reginaImport(testpath + '/poincare.tri')

regina/sageRegina/testsuite/snapshot.out

@@ -0,0 +1,15 @@
+eLPkbdcddhgggb False
+18 vertex angle structures (no restrictions)
+eLPkbdcddhgggb
+hLLLQkbcefgfgghgtlagks False
+eLPkbdcddhgggb True
+Step 1
+Destroying: original
+Step 2
+Step 3
+
+eLPkbdcddhgggb False
+18 vertex angle structures (no restrictions)
+eLPkbdcddhgggb
+a False
+eLPkbdcddhgggb True

regina/sageRegina/testsuite/snapshot.test

@@ -0,0 +1,76 @@
+# 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 Regina's mechanism for snapshotting triangulations.
+#
+# 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/>.
+
+class Watcher(PacketListener):
+    def __init__(self, packet, label):
+        PacketListener.__init__(self)
+        packet.setLabel(label)
+        packet.listen(self)
+    def packetBeingDestroyed(self, packet):
+        print('Destroying: ' + packet.label())
+
+# Make sure that snapshotting works.
+
+t = PacketOfTriangulation3(Example3.whiteheadLink())
+w1 = Watcher(t, 'original')
+print(t.isoSig(), t.isReadOnlySnapshot())
+
+a = AngleStructures(t)
+print(a)
+print(a.triangulation().isoSig())
+
+dummy = a.triangulation().pachner(t.tetrahedron(0))
+print(t.isoSig(), t.isReadOnlySnapshot())
+print(a.triangulation().isoSig(), a.triangulation().isReadOnlySnapshot())
+
+print('Step 1')
+t = None
+print('Step 2')
+a = None
+# This should destroy a.triangulation(), but since that does not have a
+# packet wrapper we cannot observe its destruction here.
+print('Step 3')
+
+print()
+
+# Test that snapshotting happens when we nullify a SnapPea triangulation.
+
+t = ExampleSnapPea.whiteheadLink()
+print(t.isoSig(), t.isReadOnlySnapshot())
+
+a = AngleStructures(t)
+print(a)
+print(a.triangulation().isoSig())
+
+dummy = a.triangulation().pachner(t.tetrahedron(0))
+print(t.isoSig(), t.isReadOnlySnapshot()) # should be an empty triangulation
+print(a.triangulation().isoSig(), a.triangulation().isReadOnlySnapshot())
+

regina/sageRegina/testsuite/sort.out

@@ -0,0 +1,78 @@
+Embedded, vertex surfaces
+Coordinates: Standard normal (tri-quad)
+Number of surfaces is 7
+0 1 0 1 ; 0 1 0 || 0 0 1 1 ; 1 0 0 || 1 0 1 0 ; 0 1 0 || 0 1 0 1 ; 0 1 0 || 1 1 0 0 ; 1 0 0
+1 1 0 0 ; 1 0 0 || 1 0 0 1 ; 0 0 1 || 1 0 0 1 ; 0 0 1 || 0 1 1 0 ; 0 0 1 || 0 0 1 1 ; 1 0 0
+0 0 1 1 ; 1 0 0 || 0 1 0 1 ; 0 1 0 || 0 1 0 1 ; 0 1 0 || 1 1 0 0 ; 1 0 0 || 1 0 1 0 ; 0 1 0
+0 1 1 0 ; 0 0 1 || 0 1 1 0 ; 0 0 1 || 1 1 0 0 ; 1 0 0 || 1 0 1 0 ; 0 1 0 || 0 1 0 1 ; 0 1 0
+1 0 0 1 ; 0 0 1 || 1 1 0 0 ; 1 0 0 || 0 1 1 0 ; 0 0 1 || 0 0 1 1 ; 1 0 0 || 1 0 0 1 ; 0 0 1
+1 0 1 0 ; 0 1 0 || 1 0 1 0 ; 0 1 0 || 0 0 1 1 ; 1 0 0 || 1 0 0 1 ; 0 0 1 || 0 1 1 0 ; 0 0 1
+1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0
+
+Embedded, vertex surfaces
+Coordinates: Standard normal (tri-quad)
+Number of surfaces is 7
+0 0 1 1 ; 1 0 0 || 0 1 0 1 ; 0 1 0 || 0 1 0 1 ; 0 1 0 || 1 1 0 0 ; 1 0 0 || 1 0 1 0 ; 0 1 0
+0 1 0 1 ; 0 1 0 || 0 0 1 1 ; 1 0 0 || 1 0 1 0 ; 0 1 0 || 0 1 0 1 ; 0 1 0 || 1 1 0 0 ; 1 0 0
+0 1 1 0 ; 0 0 1 || 0 1 1 0 ; 0 0 1 || 1 1 0 0 ; 1 0 0 || 1 0 1 0 ; 0 1 0 || 0 1 0 1 ; 0 1 0
+1 0 0 1 ; 0 0 1 || 1 1 0 0 ; 1 0 0 || 0 1 1 0 ; 0 0 1 || 0 0 1 1 ; 1 0 0 || 1 0 0 1 ; 0 0 1
+1 0 1 0 ; 0 1 0 || 1 0 1 0 ; 0 1 0 || 0 0 1 1 ; 1 0 0 || 1 0 0 1 ; 0 0 1 || 0 1 1 0 ; 0 0 1
+1 1 0 0 ; 1 0 0 || 1 0 0 1 ; 0 0 1 || 1 0 0 1 ; 0 0 1 || 0 1 1 0 ; 0 0 1 || 0 0 1 1 ; 1 0 0
+1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0
+
+Embedded, vertex surfaces
+Coordinates: Standard normal (tri-quad)
+Number of surfaces is 7
+1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 1 1 1 1 ; 0 0 0
+1 1 0 0 ; 1 0 0 || 1 0 0 1 ; 0 0 1 || 1 0 0 1 ; 0 0 1 || 0 1 1 0 ; 0 0 1 || 0 0 1 1 ; 1 0 0
+1 0 1 0 ; 0 1 0 || 1 0 1 0 ; 0 1 0 || 0 0 1 1 ; 1 0 0 || 1 0 0 1 ; 0 0 1 || 0 1 1 0 ; 0 0 1
+1 0 0 1 ; 0 0 1 || 1 1 0 0 ; 1 0 0 || 0 1 1 0 ; 0 0 1 || 0 0 1 1 ; 1 0 0 || 1 0 0 1 ; 0 0 1
+0 1 1 0 ; 0 0 1 || 0 1 1 0 ; 0 0 1 || 1 1 0 0 ; 1 0 0 || 1 0 1 0 ; 0 1 0 || 0 1 0 1 ; 0 1 0
+0 1 0 1 ; 0 1 0 || 0 0 1 1 ; 1 0 0 || 1 0 1 0 ; 0 1 0 || 0 1 0 1 ; 0 1 0 || 1 1 0 0 ; 1 0 0
+0 0 1 1 ; 1 0 0 || 0 1 0 1 ; 0 1 0 || 0 1 0 1 ; 0 1 0 || 1 1 0 0 ; 1 0 0 || 1 0 1 0 ; 0 1 0
+
+Embedded, vertex hypersurfaces
+Coordinates: Prism normal
+Number of hypersurfaces is 4
+0 0 0 0 0 ; 0 0 0 0 0 1 0 0 0 0 || 0 0 0 0 0 ; 0 0 0 0 0 1 0 0 0 0
+0 1 1 1 0 ; 0 0 0 1 0 0 0 0 0 0 || 0 1 1 1 0 ; 0 0 0 1 0 0 0 0 0 0
+0 0 1 0 0 ; 0 0 1 0 0 0 1 0 0 0 || 0 0 1 0 0 ; 0 0 1 0 0 0 1 0 0 0
+1 0 0 0 1 ; 1 0 0 0 0 0 0 0 0 1 || 1 0 0 0 1 ; 1 0 0 0 0 0 0 0 0 1
+
+Embedded, vertex hypersurfaces
+Coordinates: Prism normal
+Number of hypersurfaces is 4
+0 0 0 0 0 ; 0 0 0 0 0 1 0 0 0 0 || 0 0 0 0 0 ; 0 0 0 0 0 1 0 0 0 0
+0 0 1 0 0 ; 0 0 1 0 0 0 1 0 0 0 || 0 0 1 0 0 ; 0 0 1 0 0 0 1 0 0 0
+0 1 1 1 0 ; 0 0 0 1 0 0 0 0 0 0 || 0 1 1 1 0 ; 0 0 0 1 0 0 0 0 0 0
+1 0 0 0 1 ; 1 0 0 0 0 0 0 0 0 1 || 1 0 0 0 1 ; 1 0 0 0 0 0 0 0 0 1
+
+Embedded, vertex hypersurfaces
+Coordinates: Prism normal
+Number of hypersurfaces is 4
+1 0 0 0 1 ; 1 0 0 0 0 0 0 0 0 1 || 1 0 0 0 1 ; 1 0 0 0 0 0 0 0 0 1
+0 1 1 1 0 ; 0 0 0 1 0 0 0 0 0 0 || 0 1 1 1 0 ; 0 0 0 1 0 0 0 0 0 0
+0 0 1 0 0 ; 0 0 1 0 0 0 1 0 0 0 || 0 0 1 0 0 ; 0 0 1 0 0 0 1 0 0 0
+0 0 0 0 0 ; 0 0 0 0 0 1 0 0 0 0 || 0 0 0 0 0 ; 0 0 0 0 0 1 0 0 0 0
+
+5 vertex angle structures (no restrictions):
+1 0 0 ; 1 0 0
+0 0 1 ; 0 1 0
+0 1 0 ; 0 0 1
+0 1/2 1/2 ; 1 0 0
+1 0 0 ; 0 1/2 1/2
+
+5 vertex angle structures (no restrictions):
+0 0 1 ; 0 1 0
+0 1 0 ; 0 0 1
+0 1/2 1/2 ; 1 0 0
+1 0 0 ; 0 1/2 1/2
+1 0 0 ; 1 0 0
+
+5 vertex angle structures (no restrictions):
+1 0 0 ; 1 0 0
+1 0 0 ; 0 1/2 1/2
+0 1/2 1/2 ; 1 0 0
+0 1 0 ; 0 0 1
+0 0 1 ; 0 1 0
+

regina/sageRegina/testsuite/sort.test

@@ -0,0 +1,58 @@
+# 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).
+#
+# Provides tests for sorting functions that use callbacks.
+#
+# 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 sortInc(a, b):
+	return a.str() < b.str()
+
+def sortDec(a, b):
+	return a.str() > b.str()
+
+s = NormalSurfaces(Example3.poincare(), NormalCoords.Standard)
+print(s.detail())
+s.sort(sortInc)
+print(s.detail())
+s.sort(sortDec)
+print(s.detail())
+
+s = NormalHypersurfaces(Example4.s3xs1(), HyperCoords.Prism)
+print(s.detail())
+s.sort(sortInc)
+print(s.detail())
+s.sort(sortDec)
+print(s.detail())
+
+s = AngleStructures(Example3.figureEight())
+print(s.detail())
+s.sort(sortInc)
+print(s.detail())
+s.sort(sortDec)
+print(s.detail())
+

regina/sageRegina/testsuite/special.out

@@ -0,0 +1,4 @@
+7
+1 1 0 0 ; 1 0 0 || 1 0 0 1 ; 0 0 1 || 1 0 0 1 ; 0 0 1 || 0 1 1 0 ; 0 0 1 || 0 0 1 1 ; 1 0 0
+<uninitialised> 0 False
+0 2 True

regina/sageRegina/testsuite/special.test

@@ -0,0 +1,45 @@
+# 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 special Python functions (__getitem__, __len__, etc.).
+#
+# 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/>.
+
+# The functions below are chosen because they test the internal translations
+# between C++ types and Python types.
+
+t = Example3.poincare()
+s = NormalSurfaces(t, NormalCoords.Standard)
+
+print(len(s))
+print(s[1])
+
+c = Cyclotomic()
+print(c, len(c), 'True' if c else 'False')
+
+c = Cyclotomic(3)
+print(c, len(c), 'True' if c else 'False')