regina 7.4.1__cp314-cp314-macosx_10_13_x86_64.whl

regina/sageRegina/testsuite/lst.test

@@ -0,0 +1,195 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2013-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests the construction of layered solid tori.
+#
+# 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(Example3.lst(0,1).detail())
+print(Example3.lst(1,1).detail())
+print(Example3.lst(1,2).detail())
+print(Example3.lst(1,3).detail())
+print(Example3.lst(1,4).detail())
+print(Example3.lst(2,3).detail())
+print(Example3.lst(2,5).detail())
+print(Example3.lst(2,7).detail())
+print(Example3.lst(3,4).detail())
+print(Example3.lst(3,5).detail())
+print(Example3.lst(3,7).detail())
+
+t = Example3.poincare()
+print(t.detail())
+
+try:
+    t.insertLayeredSolidTorus(0,0)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    t.insertLayeredSolidTorus(0,2)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    t.insertLayeredSolidTorus(2,2)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    t.insertLayeredSolidTorus(0,3)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    t.insertLayeredSolidTorus(0,4)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    t.insertLayeredSolidTorus(2,4)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    t.insertLayeredSolidTorus(2,6)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    t.insertLayeredSolidTorus(9,12)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    t.insertLayeredSolidTorus(20,35)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    t.insertLayeredSolidTorus(2,1)
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+# Check that t is unchanged.
+print(t.detail())
+
+print(Example3.lens(0,1).detail())
+print(Example3.lens(1,0).detail())
+print(Example3.lens(2,1).detail())
+print(Example3.lens(3,1).detail())
+print(Example3.lens(3,2).detail())
+print(Example3.lens(4,1).detail())
+print(Example3.lens(4,3).detail())
+
+try:
+    print(Example3.lens(0,0).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(0,2).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(1,1).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(1,2).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(2,0).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(2,2).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(2,3).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(3,0).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(3,3).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(3,4).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(4,0).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(4,2).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(4,4).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.lens(4,6).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+print(Example3.augTriSolidTorus(1,0, 0,-1, 1,-1).detail())
+print(Example3.augTriSolidTorus(2,-1, 1,1, 1,-2).detail())
+print(Example3.augTriSolidTorus(3,-1, 1,2, 2,-3).detail())
+
+try:
+    print(Example3.augTriSolidTorus(3,-1, 1,2, 0,0).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.augTriSolidTorus(3,-1, 2,2, 1,2).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')
+
+try:
+    print(Example3.augTriSolidTorus(4,-6, 3,-1, 1,2).detail())
+except regina.InvalidArgument:
+    print('Caught exception!')

regina/sageRegina/testsuite/memory1.out

@@ -0,0 +1,62 @@
+Insertion case
+Step 1
+Step 2
+Step 3
+Step 4
+Step 5
+Destroying: t
+Destroying: c
+Step 6
+Root destruction case
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: a
+Step 5
+b
+None
+Orphan case
+Step 1
+Step 2
+Step 3
+Step 4
+Step 5
+Destroying: p
+Step 6
+Destroying: q
+Step 7
+Multiple orphan case
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: x
+Step 5
+Destroying: y
+Step 6
+Many references case
+Step 1
+Step 2
+Step 3
+Step 4
+Step 5
+Destroying: f
+Step 6
+Step 7
+Destroying: g
+Destroying: g
+Step 8
+Empty 3-D triangulation
+b
+Deep reference case
+Step 1
+Step 2
+Step 3
+Destroying: z2
+Destroying: x
+Step 4
+Destroying: z1
+Step 5
+Destroying: y
+Step 6

regina/sageRegina/testsuite/memory1.test

@@ -0,0 +1,152 @@
+# 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 lifetime management of 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/>.
+
+# 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 __init__(self, packet):
+        PacketListener.__init__(self)
+        packet.listen(self)
+    def packetBeingDestroyed(self, packet):
+        print('Destroying: ' + packet.label())
+
+
+print('Insertion case')
+print('Step 1')
+c = Container(); cw = Watcher(c); c.setLabel('c')
+print('Step 2')
+t = PacketOfTriangulation3(); t.newTetrahedron(); tw = Watcher(t); t.setLabel('t')
+print('Step 3')
+c.append(t)
+print('Step 4')
+t = None
+print('Step 5')
+c = None # Should destroy both c and t
+print('Step 6')
+
+print('Root destruction case')
+print('Step 1')
+a = Container(); aw = Watcher(a); a.setLabel('a')
+print('Step 2')
+b = PacketOfTriangulation3(); bw = Watcher(b); b.setLabel('b')
+print('Step 3')
+a.append(b)
+print('Step 4')
+a = None # Should destroy a only, since we are holding a reference to b
+print('Step 5')
+# b remains alive but orphaned
+print(b.label())
+print(b.parent())
+
+print('Orphan case')
+print('Step 1')
+p = Container(); pw = Watcher(p); p.setLabel('p')
+print('Step 2')
+q = PacketOfTriangulation3(); qw = Watcher(q); q.setLabel('q')
+print('Step 3')
+p.append(q)
+print('Step 4')
+q.makeOrphan()
+print('Step 5')
+p = None # Should destroy p
+print('Step 6')
+q = None # Should destroy q
+print('Step 7')
+
+# An example of makeOrphan where we never held the reference to the
+# child in the first place.
+print('Multiple orphan case')
+print('Step 1')
+x = regina.open(testpath + '/file1.rga'); xw = Watcher(x); x.setLabel('x')
+print('Step 2')
+y = x.lastChild(); yw = Watcher(y); y.setLabel('y')
+print('Step 3')
+y.makeOrphan()
+print('Step 4')
+x = None # Should destroy x
+print('Step 5')
+y = None # Should destroy y
+print('Step 6')
+
+# An example like above, but where we hold many references to the same
+# child packet.
+print('Many references case')
+print('Step 1')
+f = regina.open(testpath + '/file2.rga'); fw = Watcher(f); f.setLabel('f')
+print('Step 2')
+g = f.lastChild(); gw = Watcher(g); g.setLabel('g')
+print('Step 3')
+h = f.lastChild(); hw = Watcher(h) # h is the same packet as g
+print('Step 4')
+g.makeOrphan()
+print('Step 5')
+f = None # Should destroy f
+print('Step 6')
+g = None
+print('Step 7')
+h = None # Should destroy g (and there are two watchers now)
+print('Step 8')
+
+# b should still be alive at this point.
+print(b)
+print(b.label())
+
+# Destroy b's watcher now, so it does not try to call print() as the
+# entire python system is shutting down
+bw = None
+
+# An example where we drop the root of a tree but hang on to references
+# deeper within the tree.
+print('Deep reference case')
+x = Container(); x.setLabel('x'); xw = Watcher(x);
+y = Container(); y.setLabel('y'); yw = Watcher(y);
+z1 = Container(); z1.setLabel('z1'); z1w = Watcher(z1);
+z2 = Container(); z2.setLabel('z2'); z2w = Watcher(z2);
+print('Step 1')
+x.append(z1)
+x.append(z2)
+z1.append(y)
+print('Step 2')
+z2 = None
+print('Step 3')
+x = None # Should delete x and z2, with the child z2 going first
+print('Step 4')
+z1 = None # Should delete z1
+print('Step 5')
+y = None # Should delete y
+print('Step 6')
+

regina/sageRegina/testsuite/memory2.out

@@ -0,0 +1,62 @@
+Script variables #1
+Step 1
+Step 2
+Step 3
+Step 4
+Step 5
+Step 6
+Step 7
+Step 8
+Destroying: a1
+Step 9
+Bounded orientable 3-D triangulation, f = ( 4 6 4 1 )
+b1
+None
+Empty script, foo = <b1>
+c1
+None
+Script variables #2
+Step 1
+Step 2
+Step 3
+Destroying: c1
+Step 4
+Step 5
+Step 6
+Step 7
+Destroying: b1
+Step 8
+Step 9
+Destroying: a2
+Step 10
+Bounded orientable 3-D triangulation, f = ( 4 6 4 1 )
+b2
+None
+Empty script, foo = (null)
+c2
+None
+Example triangulation
+Step 1
+Step 2
+Destroying: f
+Step 3
+Vertex link #1
+Step 1
+Step 2
+Step 3
+Destroying: t1
+Step 4
+qvLLMvvMQegfhlnpopaabcbcaeb
+Vertex link #2
+Step 1
+Step 2
+Step 3
+Destroying: t2
+Step 4
+Step 5
+Bounded orientable 3-D triangulation, f = ( 4 6 4 1 )
+b2
+None
+Empty script, foo = (null)
+c2
+None

regina/sageRegina/testsuite/memory2.test

@@ -0,0 +1,122 @@
+# 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('Script variables #1')
+print('Step 1')
+a = Container(); aw1 = Watcher(a, 'a1')
+print('Step 2')
+b = PacketOfTriangulation3(); dummy = b.newSimplex(); bw1 = Watcher(b, 'b1')
+print('Step 3')
+c = Script(); cw1 = Watcher(c, 'c1')
+print('Step 4')
+a.append(b)
+print('Step 5')
+a.append(c)
+print('Step 6')
+dummy = c.addVariable('foo', b)
+print('Step 7')
+val = c.variableValue('foo')
+print('Step 8')
+a = None # destroys a1
+print('Step 9')
+# (b1 == val) and c1 are orphaned but alive
+print(b); print(b.label()); print(b.parent())
+print(c); print(c.label()); print(c.parent())
+
+print('Script variables #2')
+print('Step 1')
+a = Container(); aw2 = Watcher(a, 'a2')
+print('Step 2')
+b = PacketOfTriangulation3(); dummy = b.newSimplex(); bw2 = Watcher(b, 'b2')
+print('Step 3')
+c = Script(); cw2 = Watcher(c, 'c2') # destroys c1
+print('Step 4')
+a.append(b)
+print('Step 5')
+a.append(c)
+print('Step 6')
+dummy = c.addVariable('foo', a)
+print('Step 7')
+val = c.variableValue('foo') # destroys b1
+print('Step 8')
+a = None
+print('Step 9')
+val = None # destroys a
+print('Step 10')
+# b2 and c2 are orphaned but alive
+print(b); print(b.label()); print(b.parent())
+print(c); print(c.label()); print(c.parent())
+
+print('Example triangulation')
+print('Step 1')
+f = PacketOfSnapPeaTriangulation(ExampleSnapPea.figureEight()); fw = Watcher(f, 'f')
+print('Step 2')
+f = None # destroys f
+print('Step 3')
+
+print('Vertex link #1')
+print('Step 1')
+t = PacketOfTriangulation3(Example3.lens(7,1)); tw = Watcher(t, 't1')
+print('Step 2')
+v = t.vertex(0).buildLink()
+print('Step 3')
+t = None # destroys t1 but not v1
+print('Step 4')
+print(v.isoSig())
+
+print('Vertex link #2')
+print('Step 1')
+t = PacketOfTriangulation3(Example3.lens(7,1)); tw = Watcher(t, 't2')
+print('Step 2')
+v = t.vertex(0).buildLink() # destroys v1
+print('Step 3')
+t = None # destroys t2
+print('Step 4')
+v = None # destroys v2
+print('Step 5')
+
+# b2 and c2 are still alive at this point
+print(b); print(b.label()); print(b.parent())
+print(c); print(c.label()); print(c.parent())
+
+# Destroy their watchers now, so they do not try to call print() as the
+# entire python system is shutting down
+bw2 = None
+cw2 = None

regina/sageRegina/testsuite/memory3.out

@@ -0,0 +1,92 @@
+Vertices of triangulation: vertices()
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: t
+Step 5
+Vertices of triangulation: edges()
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: t
+Step 5
+Vertices of triangulation: vertex()
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: t
+Step 5
+Vertices of triangulation: edge()
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: t
+Step 5
+Vertices of triangulation: faces<0>()
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: t
+Step 5
+Vertices of triangulation: faces<1>()
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: t
+Step 5
+Vertices of triangulation: face<0>()
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: t
+Step 5
+Vertices of triangulation: face<1>()
+Step 1
+Step 2
+Step 3
+Step 4
+Destroying: t
+Step 5
+Vertices of simplex
+Step 1
+Step 2
+Step 3
+Step 4
+Step 5
+Destroying: t
+Step 6
+Step 7
+Vertices of face
+Step 1
+Step 2
+Step 3
+Step 4
+Step 5
+Destroying: t
+Step 6
+Step 7
+Vertices of component
+Step 1
+Step 2
+Step 3
+Step 4
+Step 5
+Destroying: t
+Step 6
+Step 7
+Vertices of boundary component
+Step 1
+Step 2
+Step 3
+Step 4
+Step 5
+Destroying: t
+Step 6
+Step 7