regina 7.4.1__cp314-cp314-macosx_10_13_x86_64.whl

regina/sageRegina/testsuite/iterators.test

@@ -0,0 +1,126 @@
+# 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 custom python iterators.
+#
+# 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/>.
+
+root = Container(); root.setLabel('root')
+a = Container(); a.setLabel('a')
+aa = Container(); aa.setLabel('aa')
+aaa = Container(); aaa.setLabel('aaa')
+aab = Container(); aab.setLabel('aab')
+ab = Container(); ab.setLabel('ab')
+aba = Container(); aba.setLabel('aba')
+abb = Container(); abb.setLabel('abb')
+b = Container(); b.setLabel('b')
+ba = Container(); ba.setLabel('ba')
+baa = Container(); baa.setLabel('baa')
+bab = Container(); bab.setLabel('bab')
+bb = Container(); bb.setLabel('bb')
+bba = Container(); bba.setLabel('bba')
+bbb = Container(); bbb.setLabel('bbb')
+
+root.append(a)
+root.append(b)
+a.append(aa)
+a.append(ab)
+b.append(ba)
+b.append(bb)
+aa.append(aaa)
+aa.append(aab)
+ab.append(aba)
+ab.append(abb)
+ba.append(baa)
+ba.append(bab)
+bb.append(bba)
+bb.append(bbb)
+
+print('a.children():')
+for i in a.children():
+    print(i.label())
+
+print('a.subtree():')
+for i in a.subtree():
+    print(i.label())
+
+print('a.descendants():')
+for i in a.descendants():
+    print(i.label())
+
+print('a as iterable:')
+for i in a:
+    print(i.label())
+
+print('Angle structure iteration:')
+for a in AngleStructures(Example3.figureEight()):
+    print(a)
+
+print('Normal surface iteration:')
+surfaces = NormalSurfaces(Example3.figureEight(), NormalCoords.Quad)
+for s in surfaces:
+    print(s)
+
+for s in surfaces.vectors():
+    print(s)
+
+print('Normal disc iteration:')
+for d in DiscSetSurface(NormalSurfaces(Example3.poincare(), NormalCoords.Standard).surface(0)):
+    print(d)
+
+print('Normal hypersurface iteration:')
+hypersurfaces = NormalHypersurfaces(Example4.rp4(), HyperCoords.Standard)
+for s in hypersurfaces:
+    print(s)
+
+for s in hypersurfaces.vectors():
+    print(s)
+
+print('Model link graph cell arc iteration:')
+g = ModelLinkGraph.fromPlantri('bcdd,aeec,abfd,acfa,bffb,ceed')
+c = g.cells()
+for i in range(c.countCells()):
+	bdry = []
+	for a in c.arcs(i):
+		bdry.append(str(a.node().index()) + ':' + str(a.arc()))
+	print(bdry)
+
+print('Vector<Integer> iteration:')
+for i in VectorInt([3,5,-1]):
+	print(i)
+
+print('Vector<LargeInteger> iteration:')
+for i in VectorLarge([3,5,-1]):
+	print(i)
+
+print('PermGroup iteration:')
+for i in PermGroup4(NamedPermGroup.Alternating):
+	print(i)
+
+print('TableView iteration:')
+for i in quadString:
+	print(i)

regina/sageRegina/testsuite/knotted-Y.orb

@@ -0,0 +1,47 @@
+% orb
+knotted-Y
+SolutionType geometric_solution
+vertices_known
+
+  1  0 1.000  1  1  1xw  2wv  1uv  2vx  1vx  2uw  1uw  2wx  1wv  2vu  1ux  2ux
+
+  1   -0.8058307013735850    0.6811682580285615    0.6811682580285615    0.5235987755982991    0.5235987755982991    0.5235987755982991    0.5235987755982991    0.5235987755982991    0.5235987755982991    0.5235987755982991    0.5235987755982991    0.5235987755982991    0.5235987755982991    0.5235987755982991    0.5235987755982991
+
+  1    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+
+12
+0	84	143
+1	84	92
+2	54	92
+3	85	211
+4	37	176
+5	66	194
+6	148	90
+7	120	178
+8	137	142
+9	21	90
+10	21	211
+11	148	211
+
+13
+0	0	1	1
+1	1	2	1
+2	2	3	1
+3	0	4	1
+4	4	5	1
+5	5	6	1
+6	0	7	1
+7	7	8	1
+8	8	9	1
+9	9	10	1
+10	10	3	1
+11	11	3	1
+12	6	11	1
+
+6
+0	84	118	0	8	0.485463	0.456897
+1	96	155	6	5	0.349259	0.372845
+2	114	132	5	8	0.595541	0.191083
+3	69	152	3	2	0.300635	0.511941
+4	76	180	2	5	0.74041	0.13357
+5	57	106	8	2	0.682989	0.121719

regina/sageRegina/testsuite/listener.out

@@ -0,0 +1,43 @@
+Creating...
+Inserting children t,u...
+ADDING CHILD: c -> t
+ADDED CHILD: c -> t
+ADDING CHILD: c -> u
+ADDED CHILD: c -> u
+Renaming...
+RENAMING: t
+RENAMING CHILD: c -> t
+RENAMED: t2
+RENAMED CHILD: c -> t2
+Editing...
+CHANGING: text
+CHANGED: text2
+Orphaning child t...
+REMOVING CHILD: c -> t2
+REMOVED CHILD: c -> t2
+Reparenting child t...
+ADDING CHILD: c -> t2
+ADDED CHILD: c -> t2
+Dropping reference to u...
+Destroying child u...
+REMOVING CHILD: c -> u
+REMOVED CHILD: c -> u
+DESTROYING: u
+Destroying parent...
+DESTROYING: c
+Destroying child t...
+DESTROYING: t2
+Preparing order test...
+ADDING CHILD: x -> z1
+ADDED CHILD: x -> z1
+ADDING CHILD: x -> z2
+ADDED CHILD: x -> z2
+ADDING CHILD: z1 -> y
+ADDED CHILD: z1 -> y
+Dropping children...
+Dropping root...
+DESTROYING: y
+DESTROYING: z1
+DESTROYING: z2
+DESTROYING: x
+Finished.

regina/sageRegina/testsuite/listener.test

@@ -0,0 +1,99 @@
+# 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 the behaviour of packet listeners
+#
+# 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 packetToBeChanged(self, packet):
+        print('CHANGING: ' + packet.text())
+    def packetWasChanged(self, packet):
+        print('CHANGED: ' + packet.text())
+    def packetToBeRenamed(self, packet):
+        print('RENAMING: ' + packet.label())
+    def packetWasRenamed(self, packet):
+        print('RENAMED: ' + packet.label())
+    def packetBeingDestroyed(self, packet):
+        print('DESTROYING: ' + packet.label())
+    def childToBeAdded(self, packet, child):
+        print('ADDING CHILD: ' + packet.label() + ' -> ' + child.label())
+    def childWasAdded(self, packet, child):
+        print('ADDED CHILD: ' + packet.label() + ' -> ' + child.label())
+    def childToBeRemoved(self, packet, child):
+        print('REMOVING CHILD: ' + packet.label() + ' -> ' + child.label())
+    def childWasRemoved(self, packet, child):
+        print('REMOVED CHILD: ' + packet.label() + ' -> ' + child.label())
+    def childToBeRenamed(self, packet, child):
+        print('RENAMING CHILD: ' + packet.label() + ' -> ' + child.label())
+    def childWasRenamed(self, packet, child):
+        print('RENAMED CHILD: ' + packet.label() + ' -> ' + child.label())
+
+w = Watcher()
+
+print('Creating...')
+c = Container(); c.setLabel('c'); cw = Watcher(); dummy = c.listen(cw)
+t = Text('text'); t.setLabel('t'); tw = Watcher(); dummy = t.listen(tw)
+u = Text('essay'); u.setLabel('u'); uw = Watcher(); dummy = u.listen(uw)
+print('Inserting children t,u...')
+c.append(t)
+c.append(u)
+print('Renaming...')
+t.setLabel('t2')
+print('Editing...')
+t.setText('text2')
+print('Orphaning child t...')
+t.makeOrphan()
+print('Reparenting child t...')
+c.prepend(t)
+# The only way to destroy a child from python is to drop all references
+# to it and orphan it.
+print('Dropping reference to u...')
+u = None
+print('Destroying child u...')
+c.lastChild().makeOrphan() # u destroyed
+print('Destroying parent...')
+c = None # t lives, since it is managed by python
+print('Destroying child t...')
+t = None
+
+# Now test the order in which destruction events are fired.
+print('Preparing order test...')
+x = Container(); x.setLabel('x'); xw = Watcher(); dummy = x.listen(xw)
+y = Container(); y.setLabel('y'); yw = Watcher(); dummy = y.listen(yw)
+z1 = Container(); z1.setLabel('z1'); z1w = Watcher(); dummy = z1.listen(z1w)
+z2 = Container(); z2.setLabel('z2'); z2w = Watcher(); dummy = z2.listen(z2w)
+x.append(z1)
+x.append(z2)
+z1.append(y)
+print('Dropping children...')
+y = None; z1 = None; z2 = None
+print('Dropping root...')
+x = None
+
+print('Finished.')
+