regina 7.4.1__cp314-cp314-macosx_10_13_x86_64.whl

regina/sageRegina/testsuite/memory3.test

@@ -0,0 +1,214 @@
+# 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 the independence and lifespans of engine-generated packets.
+#
+# 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())
+
+
+print('Vertices of triangulation: vertices()')
+print('Step 1')
+t = PacketOfTriangulation2(Example2.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+v = t.vertices() # v keeps t alive
+print('Step 3')
+t = None
+print('Step 4')
+v = None # destroys t
+print('Step 5')
+
+print('Vertices of triangulation: edges()')
+print('Step 1')
+t = PacketOfTriangulation3(Example3.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+e = t.edges() # e keeps t alive
+print('Step 3')
+t = None
+print('Step 4')
+e = None # destroys t
+print('Step 5')
+
+print('Vertices of triangulation: vertex()')
+print('Step 1')
+t = PacketOfTriangulation4(Example4.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+v = t.vertex(0) # v keeps t alive
+print('Step 3')
+t = None
+print('Step 4')
+v = None # destroys t
+print('Step 5')
+
+print('Vertices of triangulation: edge()')
+print('Step 1')
+t = PacketOfTriangulation5(Example5.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+e = t.edge(0) # e keeps t alive
+print('Step 3')
+t = None
+print('Step 4')
+e = None # destroys t
+print('Step 5')
+
+print('Vertices of triangulation: faces<0>()')
+print('Step 1')
+t = PacketOfTriangulation5(Example5.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+v = t.faces(0) # v keeps t alive
+print('Step 3')
+t = None
+print('Step 4')
+v = None # destroys t
+print('Step 5')
+
+print('Vertices of triangulation: faces<1>()')
+print('Step 1')
+t = PacketOfTriangulation4(Example4.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+e = t.faces(1) # e keeps t alive
+print('Step 3')
+t = None
+print('Step 4')
+e = None # destroys t
+print('Step 5')
+
+print('Vertices of triangulation: face<0>()')
+print('Step 1')
+t = PacketOfTriangulation3(Example3.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+v = t.face(0, 0) # v keeps t alive
+print('Step 3')
+t = None
+print('Step 4')
+v = None # destroys t
+print('Step 5')
+
+print('Vertices of triangulation: face<1>()')
+print('Step 1')
+t = PacketOfTriangulation2(Example2.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+e = t.face(1, 0) # e keeps t alive
+print('Step 3')
+t = None
+print('Step 4')
+e = None # destroys t
+print('Step 5')
+
+print('Vertices of simplex')
+print('Step 1')
+t = PacketOfTriangulation3(Example3.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+s = t.simplex(0) # s keeps t alive
+print('Step 3')
+# None of these keep t alive
+f1 = s.vertex(0)
+f2 = s.edge(0)
+f3 = s.face(0, 0)
+f4 = s.face(1, 0)
+print('Step 4')
+t = None
+print('Step 5')
+s = None # destroys t
+print('Step 6')
+f1 = None; f2 = None; f3 = None; f4 = None
+print('Step 7')
+
+print('Vertices of face')
+print('Step 1')
+t = PacketOfTriangulation4(Example4.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+f = t.triangle(0) # f keeps t alive
+print('Step 3')
+# None of these keep t alive
+f1 = f.vertex(0)
+f2 = f.edge(0)
+f3 = f.face(0, 0)
+f4 = f.face(1, 0)
+print('Step 4')
+t = None
+print('Step 5')
+f = None # destroys t
+print('Step 6')
+f1 = None; f2 = None; f3 = None; f4 = None
+print('Step 7')
+
+print('Vertices of component')
+print('Step 1')
+t = PacketOfTriangulation2(Example2.sphere()); tw = Watcher(t, 't')
+print('Step 2')
+c = t.component(0) # c keeps t alive
+print('Step 3')
+# None of these keep t alive
+f1 = c.vertices()
+f2 = c.vertex(0)
+f3 = c.edges()
+f4 = c.edge(0)
+f5 = c.faces(0)
+f6 = c.face(0, 0)
+f7 = c.faces(1)
+f8 = c.face(1, 0)
+print('Step 4')
+t = None
+print('Step 5')
+c = None # destroys t
+print('Step 6')
+f1 = None; f2 = None; f3 = None; f4 = None
+f5 = None; f6 = None; f7 = None; f8 = None
+print('Step 7')
+
+print('Vertices of boundary component')
+print('Step 1')
+t = PacketOfTriangulation4(Example4.ball()); tw = Watcher(t, 't')
+print('Step 2')
+b = t.boundaryComponent(0) # b keeps t alive
+print('Step 3')
+# None of these keep t alive
+f1 = b.vertices()
+f2 = b.vertex(0)
+f3 = b.edges()
+f4 = b.edge(0)
+f5 = b.faces(0)
+f6 = b.face(0, 0)
+f7 = b.faces(1)
+f8 = b.face(1, 0)
+print('Step 4')
+t = None
+print('Step 5')
+b = None # destroys t
+print('Step 6')
+f1 = None; f2 = None; f3 = None; f4 = None
+f5 = None; f6 = None; f7 = None; f8 = None
+print('Step 7')
+

regina/sageRegina/testsuite/misc.out

@@ -0,0 +1,7 @@
+3
+Z_5
+True False False
+False True True
+True False False
+False True True
+<built-in function open>

regina/sageRegina/testsuite/misc.test

@@ -0,0 +1,54 @@
+# 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 small miscellaneous tests to ensure that things are up and running.
+#
+# 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 most trivial test: can we talk to the calculation engine at all?
+print(regina.testEngine(3))
+
+# Some slightly less trivial tests.
+t = Example3.lens(5, 1)
+print(t.homology())
+
+# Does equality work correctly?
+a = Perm4(2,3)
+b = Perm4()
+c = Perm4(2,3)
+print(a == c, a == b, b == c)
+print(a != c, a != b, b != c)
+
+t = regina.Example3.poincare()
+a = t.tetrahedron(0)
+b = t.tetrahedron(1)
+c = t.tetrahedron(0)
+print(a == c, a == b, b == c)
+print(a != c, a != b, b != c)
+
+# Have we clobbered python's builtin open() function?
+print(open)

regina/sageRegina/testsuite/operators.out

@@ -0,0 +1,129 @@
+0 -> 1 (1230), 1 -> 0 (2103)
+Size of the skeleton:
+  Tetrahedra: 2
+  Triangles: 4
+  Edges: 3
+  Vertices: 1
+
+Tetrahedron gluing:
+  Tet  |  gluing:       (012)       (013)       (023)       (123)
+  -----+---------------------------------------------------------
+    0  |              0 (123)     1 (013)     1 (023)     0 (012)
+    1  |              1 (123)     0 (013)     0 (023)     1 (012)
+
+Vertices:
+  Tet  |  vertex:    0   1   2   3
+  -----+--------------------------
+    0  |             0   0   0   0
+    1  |             0   0   0   0
+
+Edges:
+  Tet  |  edge:   01  02  03  12  13  23
+  -----+--------------------------------
+    0  |           0   1   2   0   1   0
+    1  |           0   1   2   0   1   0
+
+Triangles:
+  Tet  |  face:  012 013 023 123
+  -----+------------------------
+    0  |           0   1   2   0
+    1  |           3   1   2   3
+
+
+Size of the skeleton:
+  Tetrahedra: 2
+  Triangles: 4
+  Edges: 3
+  Vertices: 1
+
+Tetrahedron gluing:
+  Tet  |  gluing:       (012)       (013)       (023)       (123)
+  -----+---------------------------------------------------------
+    0  |              0 (301)     0 (120)     1 (310)     1 (210)
+    1  |              0 (321)     0 (320)     1 (312)     1 (230)
+
+Vertices:
+  Tet  |  vertex:    0   1   2   3
+  -----+--------------------------
+    0  |             0   0   0   0
+    1  |             0   0   0   0
+
+Edges:
+  Tet  |  edge:   01  02  03  12  13  23
+  -----+--------------------------------
+    0  |           0   1   0   0   1   2
+    1  |           2   1   0   0   1   0
+
+Triangles:
+  Tet  |  face:  012 013 023 123
+  -----+------------------------
+    0  |           0   0   1   2
+    1  |           2   1   3   3
+
+
+0:3 1:1 1:2 0:0 | 1:3 0:1 0:2 1:0
+1:3 1:2 0:3 0:2 | 1:1 1:0 0:1 0:0
+Size of the skeleton:
+  Tetrahedra: 2
+  Triangles: 5
+  Edges: 4
+  Vertices: 1
+
+Tetrahedron gluing:
+  Tet  |  gluing:       (012)       (013)       (023)       (123)
+  -----+---------------------------------------------------------
+    0  |             boundary    boundary     1 (013)     1 (120)
+    1  |              0 (312)     0 (023)     1 (312)     1 (230)
+
+Vertices:
+  Tet  |  vertex:    0   1   2   3
+  -----+--------------------------
+    0  |             0   0   0   0
+    1  |             0   0   0   0
+
+Edges:
+  Tet  |  edge:   01  02  03  12  13  23
+  -----+--------------------------------
+    0  |           0   1   2   2   1   3
+    1  |           1   3   2   2   3   2
+
+Triangles:
+  Tet  |  face:  012 013 023 123
+  -----+------------------------
+    0  |           0   1   2   3
+    1  |           3   2   4   4
+
+
+Size of the skeleton:
+  Tetrahedra: 2
+  Triangles: 5
+  Edges: 4
+  Vertices: 1
+
+Tetrahedron gluing:
+  Tet  |  gluing:       (012)       (013)       (023)       (123)
+  -----+---------------------------------------------------------
+    0  |              1 (320)     0 (302)     0 (130)     1 (310)
+    1  |             boundary     0 (321)     0 (210)    boundary
+
+Vertices:
+  Tet  |  vertex:    0   1   2   3
+  -----+--------------------------
+    0  |             0   0   0   0
+    1  |             0   0   0   0
+
+Edges:
+  Tet  |  edge:   01  02  03  12  13  23
+  -----+--------------------------------
+    0  |           0   1   0   2   1   0
+    1  |           0   2   1   3   2   0
+
+Triangles:
+  Tet  |  face:  012 013 023 123
+  -----+------------------------
+    0  |           0   1   1   2
+    1  |           3   2   0   4
+
+
+1:3 1:2 bdry bdry | 1:1 1:0 0:1 0:0
+1:2 0:2 0:1 1:1 | bdry 0:3 0:0 bdry

regina/sageRegina/testsuite/operators.test

@@ -0,0 +1,59 @@
+# 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 bindings for various C++ operator overloads.
+#
+# 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/>.
+
+iso = Isomorphism3(2)
+iso.setSimpImage(0, 1)
+iso.setSimpImage(1, 0)
+iso.setFacetPerm(0, Perm4(1,2,3,0))
+iso.setFacetPerm(1, Perm4(0,2))
+print(iso)
+
+tri = Example3.s2xs1()
+p = FacetPairing3(tri)
+
+print(tri.detail())
+tri = iso(tri)
+print(tri.detail())
+
+print(p)
+p = iso(p)
+print(p)
+
+tri = Example3.lst(1,3)
+p = FacetPairing3(tri)
+
+print(tri.detail())
+tri = iso(tri)
+print(tri.detail())
+
+print(p)
+p = iso(p)
+print(p)