regina 7.4.1__cp314-cp314-macosx_10_13_x86_64.whl

regina/sageRegina/testsuite/alltypes.test

@@ -0,0 +1,85 @@
+# 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).
+#
+# Prints basic properties of all wrapped objects and 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/>.
+
+import enum
+
+def classInfo(name, object):
+    realName = object.__name__
+    if realName == name:
+        if name == 'Bitmask256' or name == 'Qitmask256':
+            # These classes are only present on 64-bit machines.
+            # Omit them here so that this test generates the same output
+            # across all platforms.
+            return
+        if object.__base__ is RuntimeError:
+            # Exception classes do not have equalityType.
+            print(name, ': exception')
+        else:
+            print(name, ': class ->', object.equalityType)
+    else:
+        print(name, ': alias ->', realName)
+
+def enumInfo(name, object):
+    realName = object.__name__
+    if realName == name:
+        print(name, ': enum')
+    else:
+        print(name, ': alias -> enum', realName)
+
+def functionInfo(name, object):
+    if not name.startswith('__'):
+        print(name, ': function')
+
+def objectInfo(name, object):
+    # print(name, ': object')
+    pass
+
+keys = sorted(regina.__dict__)
+
+for i in keys:
+    object = regina.__dict__[i]
+    if isinstance(object, type):
+        if versionPybind11Major() == 2:
+            try:
+                tmp = object.__members__ # Exists for enums, not classes
+                enumInfo(i, object)
+            except AttributeError:
+                classInfo(i, object)
+        else:
+            # pybind11v3 provides native Python enum types.
+            if object.__base__ in [ enum.Enum, enum.Flag ]:
+                enumInfo(i, object)
+            else:
+                classInfo(i, object)
+    elif 'builtin_function_or_method' in str(object.__class__):
+        functionInfo(i, object)
+    else:
+        objectInfo(i, object)

regina/sageRegina/testsuite/angles.out

@@ -0,0 +1,102 @@
+-------------------------------
+Empty triangulation
+Vertex angle structures
+-------------------------------
+
+1 vertex angle structure (no restrictions):
+
+
+
+-------------------------------
+Empty triangulation
+Taut angle structures
+-------------------------------
+
+1 vertex angle structure (taut only):
+
+
+
+-------------------------------
+Figure eight knot complement
+Vertex angle structures
+-------------------------------
+
+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
+
+
+-------------------------------
+Figure eight knot complement
+Taut angle structures
+-------------------------------
+
+3 vertex angle structures (taut only):
+1 0 0 ; 1 0 0
+0 1 0 ; 0 0 1
+0 0 1 ; 0 1 0
+
+
+-------------------------------
+Whitehead link complement
+Vertex angle structures
+-------------------------------
+
+18 vertex angle structures (no restrictions):
+1/2 1/2 0 ; 1/2 1/2 0 ; 1 0 0 ; 0 0 1
+1/2 1/2 0 ; 1/2 1/2 0 ; 0 0 1 ; 1 0 0
+1/2 1/2 0 ; 1 0 0 ; 1/2 1/2 0 ; 0 0 1
+1/2 1/2 0 ; 0 0 1 ; 1/2 1/2 0 ; 1 0 0
+1 0 0 ; 1/2 1/2 0 ; 0 0 1 ; 1/2 1/2 0
+1 0 0 ; 1 0 0 ; 0 1 0 ; 0 1 0
+1 0 0 ; 1 0 0 ; 0 0 1 ; 0 0 1
+1 0 0 ; 0 1 0 ; 1 0 0 ; 0 1 0
+1 0 0 ; 0 0 1 ; 1/2 1/2 0 ; 1/2 1/2 0
+1 0 0 ; 0 0 1 ; 1 0 0 ; 0 0 1
+1 0 0 ; 0 0 1 ; 0 0 1 ; 1 0 0
+0 1 0 ; 1 0 0 ; 0 1 0 ; 1 0 0
+0 1 0 ; 0 1 0 ; 1 0 0 ; 1 0 0
+0 0 1 ; 1/2 1/2 0 ; 1 0 0 ; 1/2 1/2 0
+0 0 1 ; 1 0 0 ; 1/2 1/2 0 ; 1/2 1/2 0
+0 0 1 ; 1 0 0 ; 1 0 0 ; 0 0 1
+0 0 1 ; 1 0 0 ; 0 0 1 ; 1 0 0
+0 0 1 ; 0 0 1 ; 1 0 0 ; 1 0 0
+
+
+-------------------------------
+Whitehead link complement
+Taut angle structures
+-------------------------------
+
+10 vertex angle structures (taut only):
+1 0 0 ; 1 0 0 ; 0 1 0 ; 0 1 0
+1 0 0 ; 1 0 0 ; 0 0 1 ; 0 0 1
+1 0 0 ; 0 1 0 ; 1 0 0 ; 0 1 0
+1 0 0 ; 0 0 1 ; 1 0 0 ; 0 0 1
+1 0 0 ; 0 0 1 ; 0 0 1 ; 1 0 0
+0 1 0 ; 1 0 0 ; 0 1 0 ; 1 0 0
+0 1 0 ; 0 1 0 ; 1 0 0 ; 1 0 0
+0 0 1 ; 1 0 0 ; 1 0 0 ; 0 0 1
+0 0 1 ; 1 0 0 ; 0 0 1 ; 1 0 0
+0 0 1 ; 0 0 1 ; 1 0 0 ; 1 0 0
+
+
+-------------------------------
+Poincare homology sphere
+Vertex angle structures
+-------------------------------
+
+0 vertex angle structures (no restrictions):
+
+
+-------------------------------
+Poincare homology sphere
+Taut angle structures
+-------------------------------
+
+0 vertex angle structures (taut only):
+
+

regina/sageRegina/testsuite/angles.test

@@ -0,0 +1,70 @@
+# 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 various tests for angle structure enumeration.
+#
+# 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 dumpAngles(name, tri, triName, tautOnly = False):
+	try:
+		slist = regina.AngleStructures(tri, tautOnly)
+	except:
+		print("-------------------------------")
+		print(name)
+		print('ENUMERATION FAILED')
+		print("-------------------------------")
+		print()
+		return
+	
+	print("-------------------------------")
+	print(triName)
+	print(name)
+	print("-------------------------------")
+	print()
+	
+	# Dump the angle structures in sort order, since we don't really mind if
+	# the ordering changes between releases.
+	structures = slist.detail().split('\n')
+	structures.sort()
+	# Let the text headers appear up top.
+	structures.reverse()
+	for s in structures:
+		print(s)
+	
+	# Nothing else to say.
+	print()
+
+def angleStats(tri, triName):
+	dumpAngles('Vertex angle structures', tri, triName, False)
+	dumpAngles('Taut angle structures', tri, triName, True)
+
+t = regina.Triangulation3()
+angleStats(t, 'Empty triangulation')
+
+angleStats(regina.Example3.figureEight(), 'Figure eight knot complement')
+angleStats(regina.Example3.whiteheadLink(), 'Whitehead link complement')
+angleStats(regina.Example3.poincare(), 'Poincare homology sphere')

regina/sageRegina/testsuite/arrow.out

@@ -0,0 +1,86 @@
+0 True
+--------
+K_1^3 K_3 K_4^2 False
+Exception caught
+Exception caught
+K_1^3 K_3 K_4^2 False
+2 K_1^3 K_3 K_4^2 False K_1^3 K_3 K_4^2 False
+0 True K_1^3 K_3 K_4^2 False
+--------
+Exception caught
+Exception caught
+(-A^2 + 2 A^-1) + (-A^-1 + 3 A^-2) K_1 False
+--------
+(-A^-1 + 3 A^-2) K_1
+(-A^2 + 2 A^-1) + (-2 A^-1 + 6 A^-2) K_1
+-A^2 + 2 A^-1
+(-A^2 + 2 A^-1) + (-2 A^-1 + 6 A^-2) K_1
+A^2 - 2 A^-1
+(A^2 - 2 A^-1) + (A^-1 - 3 A^-2) K_1
+--------
+(-A^2 + 2 A^-1) + (-2 A^-1 + 6 A^-2) K_1
+(-A^2 + 2 A^-1) + (-A^-1 + 3 A^-2) K_1
+-A^2 + 2 A^-1
+--------
+(-A^2 + 2 A^-1) + (-A^-1 + 3 A^-2) K_1 vs (-A^-1 + 3 A^-2) K_1
+(-A^-1 + 3 A^-2) K_1 vs (-A^2 + 2 A^-1) + (-A^-1 + 3 A^-2) K_1
+(-A^2 + 2 A^-1) + (-A^-1 + 3 A^-2) K_1 vs (-A^-1 + 3 A^-2) K_1
+--------
+(3 A^2 - 6 A^-1) + (3 A^-1 - 9 A^-2) K_1
+(3 A^2 - 6 A^-1) + (3 A^-1 - 9 A^-2) K_1
+(-A^4 + 2 A) + (-A + 3) K_1
+(-A^4 + 2 A) + (-A + 3) K_1
+--------
+-x^2 + 2 x^-1
+-x^-1 + 3 x^-2
+0
+0
+(-A^2 + 2 A^-1) + (-5 A^5 + 2 A^3) K_2 + (-A^-1 + 3 A^-2) K_1
+-5 x^5 + 2 x^3
+Exception caught
+(-A^2 + 2 A^-1) + (-A^-1 + 3 A^-2) K_1
+--------
+(3 A^2 - 6 A^-1) + (3 A^-1 - 9 A^-2) K_1
+(3 A^4 - 6 A) + (3 A - 9) K_1
+--------
+(3 A^2 - 6 A^-1) + (3 A^-1 - 9 A^-2) K_1
+(-3 A^2 + 6 A^-1) + (-3 A^-1 + 9 A^-2) K_1
+(6 A - 3 A^-2) + (9 A^2 - 3 A) K_1
+(6 A^2 - 3 A^-4) + (9 A^4 - 3 A^2) K_1
+(-3 A^2 + 6 A^-1) + (-3 A^-1 + 9 A^-2) K_1
+--------
+SLJOMMVKJLMNNM
+(-3 A^2 + 6 A^-1) + (-3 A^-1 + 9 A^-2) K_1
+0 True
+M
+0
+--------
+A^-4 + (A^-6 - A^-10) K_1
+A^-4 + (A^-6 - A^-10) K_1
+3 A^-4 + (A^-6 - A^-10) K_1
+(A^-6 - A^-10) K_1
+Exception caught
+Exception caught
+True
+False
+False
+True
+--------
+1-crossing, 2-component virtual link: - ( ^0 ) ( _0 )
+-A^2 - A^4 K_1
+3-crossing virtual knot: ++- ( ^0 _1 ^2 _0 ^1 _2 )
+A^-8 + (1 - A^-8) K_1^2
+4-crossing virtual knot: +-+- ( ^0 _1 ^3 _2 _3 ^2 _0 ^1 )
+(A^4 + 1 + A^-4) + 2 K_2 + (-A^4 - 2 - A^-4) K_1^2
+5-crossing virtual knot: ++--- ( ^0 _2 ^3 _0 ^1 _4 ^2 _3 ^4 _1 )
+1
+4-crossing virtual knot: +-++ ( ^0 _1 _2 _0 ^2 ^3 ^1 _3 )
+(2 A^-4 + A^-8) + (A^-4 + A^-8) K_2 + (A^-6 - A^-10) K_1 + (-2 A^-4 - 2 A^-8) K_1^2
+4-crossing virtual knot: ---+ ( ^0 ^1 ^2 ^3 _0 _2 _1 _3 )
+A^8 + A^10 K_3 + A^6 K_1 + (-A^10 - A^6) K_1 K_2 + (-A^8 + 1) K_1^2
+4-crossing virtual knot: ---+ ( ^0 ^1 _2 ^3 _1 _0 ^2 _3 )
+A^8 + A^6 K_3 + A^10 K_1 + (-A^10 - A^6) K_1 K_2 + (-A^8 + 1) K_1^2
+3-crossing, 2-component virtual link: +++ ( ^0 _1 ^2 ) ( _0 ^1 _2 )
+-A^-6 + (-A^-8 + A^-12 - A^-16) K_1
+3-crossing, 2-component virtual link: --- ( ^2 _1 ^0 ) ( _0 ^1 _2 )
+(-A^10 + A^6 - A^2) - A^12 K_1

regina/sageRegina/testsuite/arrow.test

@@ -0,0 +1,224 @@
+# 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 some simple tests for arrow polynomials.
+#
+# 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/>.
+
+a = Arrow()
+print(a, a.isZero())
+
+print('--------')
+
+a.initDiagram(3, 0, 1, 2)
+print(a, a.isZero())
+
+try:
+    a.initDiagram(3, 0, 'a')
+except InvalidArgument:
+    print('Exception caught')
+
+try:
+    a.initDiagram(1, 1, 0)
+except InvalidArgument:
+    print('Exception caught')
+
+print(a, a.isZero())
+b = Arrow(a)
+a += a
+print(a, a.isZero(), b, b.isZero())
+a -= a
+print(a, a.isZero(), b, b.isZero())
+
+print('--------')
+
+a.set(Laurent(-1, [2, 0, 0, -1]))
+a.set(1, Laurent(-2, [3, -1]))
+
+try:
+    a.set(3, 0)
+except InvalidArgument:
+    print('Exception caught')
+
+try:
+    a.set(2, 0, Laurent(-2, [3, -1]))
+except InvalidArgument:
+    print('Exception caught')
+
+print(a, a.isZero())
+
+print('--------')
+
+b = Arrow()
+b.set(1, Laurent(-2, [3, -1]))
+print(b)
+print(a + b)
+print(a - b)
+print(b + a)
+print(b - a)
+print(- a)
+
+print('--------')
+
+a += b
+print(a)
+a -= b
+print(a)
+a -= b
+print(a)
+
+print('--------')
+
+a += b
+print(a, 'vs', b)
+a.swap(b)
+print(a, 'vs', b)
+swap(b, a)
+print(a, 'vs', b)
+
+print('--------')
+
+print(a * -3)
+print(-3 * a)
+print(a * Laurent(2, [1]))
+print(Laurent(2, [1]) * a)
+
+print('--------')
+
+print(a[[]])
+print(a[[1]])
+print(a[[2]])
+print(a[[0, 1]])
+a[[0, 1]] = Laurent(3, [2, 0, -5])
+print(a)
+print(a[[0, 1]])
+
+try:
+    print(a[[0, 1, 0]])
+except InvalidArgument:
+    print('Exception caught')
+
+a[[0, 1]] = Laurent()
+print(a)
+
+print('--------')
+
+a *= -3
+print(a)
+a *= Laurent(2, [1])
+print(a)
+
+print('--------')
+
+a.shift(-2)
+print(a)
+a.negate()
+print(a)
+a.invertA()
+print(a)
+a.scaleUp(2)
+print(a)
+a.scaleDown(-2)
+print(a)
+
+print('--------')
+
+print(a.tightEncoding())
+print(Arrow.tightDecoding(a.tightEncoding()))
+a.init()
+print(a, a.isZero())
+print(a.tightEncoding())
+print(Arrow.tightDecoding(a.tightEncoding()))
+
+print('--------')
+
+print(Arrow([([], Laurent(-4, [1])), ([1], Laurent(-10, [-1,0,0,0,1]))]))
+print(Arrow([([], (-4, [1])), ([1], (-10, [-1,0,0,0,1]))]))
+print(Arrow([([], (-4, [1])), ([], (-4, [2])), ([1], (-10, [-1,0,0,0,1]))]))
+print(Arrow([([], (-4, [1])), ([], (-4, [-1])), ([1], (-10, [-1,0,0,0,1]))]))
+
+try:
+    print(Arrow([([], (-4, [1])), ([1, 'a'], (-10, [-1,0,0,0,1]))]))
+except InvalidArgument:
+    print('Exception caught')
+
+try:
+    print(Arrow([([], (-4, [1])), ([1, -2], (-10, [-1,0,0,0,1]))]))
+except InvalidArgument:
+    print('Exception caught')
+
+laurent = Laurent(-2, [4,0,0,-1])
+print(Arrow([([], laurent)]) == laurent)
+print(Arrow([([1], laurent)]) == laurent)
+print(Arrow([([], laurent), ([1], laurent)]) == laurent)
+print(Arrow([([], laurent), ([1], laurent)])[[1]] == laurent)
+
+print('--------')
+
+# Compute some actual arrow polynomials.
+# The following examples are all taken from Dye & Kauffman, JKTR 18 (2009).
+# These are also in the C++ test suite; see there for further discussion
+# (including the reasons why some of our answers differ from Dye-Kauffman).
+
+# Section 3.1: Virtual Hopf link
+l = Link.fromData([-1], [[1], [-1]])
+print(l); print(l.arrow())
+
+# Section 3.2: Virtualised trefoil (not the virtual trefoil!)
+l = Link.fromData([+1, +1, -1], [1, -2, 3, -1, 2, -3])
+print(l); print(l.arrow())
+
+# Section 3.3: Kishino's knot
+l = Link.fromData([+1, -1, +1, -1], [1, -2, 4, -3, -4, 3, -1, 2])
+print(l); print(l.arrow())
+
+# Section 3.4: Slavik's knot
+l = Link.fromData([+1, +1, -1, -1, -1], [1, -3, 4, -1, 2, -5, 3, -4, 5, -2])
+print(l); print(l.arrow())
+
+# Section 3.5: Miyazawa's knot
+# Note: our answer differs by sign (+/-) for the coefficient of K_1^2 A^-4.
+# However: our answer is consistent with the Jones polynomial for that same
+# knot, and so it seems likely that the sign error is in the Dye-Kauffman paper.
+l = Link.fromData([+1, -1, +1, +1], [1, -2, -3, -1, 3, 4, 2, -4])
+print(l); print(l.arrow())
+
+# Section 3.6: Two knots differentiated only by K_1 and K_3
+l1 = Link.fromSignedGauss('O1-O2-O3-O4+U1-U3-U2-U4+') # knot 4.93
+l2 = Link.fromSignedGauss('O1-O2-U3-O4+U2-U1-O3-U4+') # knot 4.103
+print(l1); print(l1.arrow());
+print(l2); print(l2.arrow());
+
+# Section 3.8: Two virtual torus links
+# Note: In the Dye-Kauffman paper, the polynomials for these links do not
+# appear to be normalised using the writhe (though this is perhaps explicitly
+# noted in the paper since they use the subscript <..>_A instead of <..>_NA.
+l1 = Link.fromData([+1, +1, +1], [[1, -2, 3], [-1, 2, -3]])
+l2 = Link.fromData([-1, -1, -1], [[3, -2, 1], [-1, 2, -3]])
+print(l1); print(l1.arrow());
+print(l2); print(l2.arrow());
+

regina/sageRegina/testsuite/base64.out

@@ -0,0 +1,2 @@
+cde
+[2, 3, 4]

regina/sageRegina/testsuite/base64.test

@@ -0,0 +1,37 @@
+# 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).
+#
+# Some simple tests for base64 encoders and decoders.
+#
+# 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/>.
+
+enc = Base64SigEncoder()
+enc.encodeInts([2,3,4], 1)
+print(enc.str())
+
+dec = Base64SigDecoder('cdefg')
+print(dec.decodeInts(3, 1))