regina 7.4.1__cp314-cp314-macosx_10_13_x86_64.whl

regina/sageRegina/testsuite/trigeneral.test

@@ -0,0 +1,153 @@
+# 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 more thorough tests for different types of triangulation.
+#
+# 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 hashlib
+
+def checksum(str):
+	h = hashlib.md5()
+	h.update(str.encode('utf-8'))
+	return h.hexdigest()
+
+def vitalStats(tri, name):
+	# To guard against accidental changes.
+	old = tri.detail()
+	
+	print("-------------------------------")
+	print(name)
+	print("-------------------------------")
+	print()
+	print(tri.detail())
+	print(tri.countComponents(), "components")
+	print(tri.countBoundaryComponents(), "boundary components")
+	print(tri.countTetrahedra(), "tetrahedra")
+	print(tri.countTriangles(), "triangles")
+	print(tri.countEdges(), "edges")
+	print(tri.countVertices(), "vertices")
+	print("2-sphere boundaries:", tri.hasTwoSphereBoundaryComponents())
+	print("Negative ideal boundaries:", tri.hasNegativeIdealBoundaryComponents())
+	print("EC:", tri.eulerCharTri())
+	print("Valid:", tri.isValid())
+	print("Ideal:", tri.isIdeal())
+	print("Standard:", tri.isStandard())
+	print("Boundary Triangles:", tri.hasBoundaryTriangles())
+	print("Closed:", tri.isClosed())
+	print("Orientable:", tri.isOrientable())
+	print("Connected:", tri.isConnected())
+	print()
+	print("Fundamental group:", tri.fundamentalGroup().recogniseGroup())
+	# Don't print the full generators and relations for now, since this
+	# is not unique and can therefore lead to spurious test failures.
+	# print tri.fundamentalGroup().detail()
+	print("H1:", tri.homology())
+	if tri.isValid():
+		print("H1Bdry:", tri.homologyBdry())
+		print("H1Rel:", tri.homologyRel())
+		print("H2:", tri.homology(2))
+		print("H2Z2:", tri.homologyH2Z2(), "Z_2")
+	if tri.isValid() and tri.isClosed() and tri.countTetrahedra() > 0:
+		print("TV(5, 3) =", tri.turaevViro(5, 3))
+		
+		tv = tri.turaevViroApprox(5, 3)
+		
+		# We round the figures to 5 decimal places so that machines with
+		# different precisions do not give different output.
+		
+		# The case of 0 must also be handled specially, since rounding
+		# may give either 0 or -0.
+		
+		if tv < 0.00001 and tv > -0.00001:
+			tv = 0
+		print("TV(5, 3) ~ %.5f" % tv)
+	
+	# Normal surface computations should only be run on sufficiently
+	# small triangulations, so as to keep the tests relatively fast.
+	if tri.countTetrahedra() < 7:
+		print("0-efficient:", tri.isZeroEfficient())
+		if tri.isConnected():
+			print("Splitting surface:", tri.hasSplittingSurface())
+	
+	# Though this can use normal surfaces, its prechecks and
+	# optimisations should make it fast enough for our examples.
+	print("3-sphere:", tri.isSphere())
+	
+	# Some of the following operations can create large triangulations,
+	# which give *lots* of output when we try to dump their face gluings
+	# and skeletal details.  We'd like to keep the output files small,
+	# so dump checksums of the details instead of the details themselves.
+	print("Double cover:")
+	t = regina.Triangulation3(tri)
+	t.makeDoubleCover()
+	print("Checksum =", checksum(t.detail()))
+	
+	print("Ideal to finite:")
+	t = regina.Triangulation3(tri)
+	print("Result =", t.truncateIdeal())
+	print("Checksum =", checksum(t.detail()))
+	
+	print("Finite to ideal:")
+	t = regina.Triangulation3(tri)
+	print("Result =", t.makeIdeal())
+	print("Checksum =", checksum(t.detail()))
+	
+	print("Barycentric subdivision:")
+	t = regina.Triangulation3(tri)
+	t.subdivide()
+	print("Checksum =", checksum(t.detail()))
+	
+	try:
+		print("Dehydration:", tri.dehydrate())
+	except NotImplemented:
+		print("Dehydration: (none)")
+	print("Isomorphism signature:", tri.isoSig())
+	print("Result of splitIntoComponents:", len(tri.triangulateComponents()))
+	
+	if tri.detail() != old:
+		print("ERROR: Original triangulation has changed!")
+	
+	print()
+
+t = regina.Triangulation3()
+vitalStats(t, 'Empty triangulation')
+
+vitalStats(regina.Example3.threeSphere(), '3-sphere')
+vitalStats(regina.Example3.s2xs1(), 'S2 x S1')
+vitalStats(regina.Example3.rp2xs1(), 'RP2 x S1')
+vitalStats(regina.Example3.rp3rp3(), 'RP3 # RP3')
+vitalStats(regina.Example3.lens(8,3), 'L(8,3)')
+vitalStats(regina.Example3.poincare(), 'Poincare homology sphere')
+vitalStats(regina.Example3.smallClosedOrblHyperbolic(), 'Closed orientable hyperbolic 3-manifold')
+vitalStats(regina.Example3.smallClosedNonOrblHyperbolic(), 'Closed non-orientable hyperbolic 3-manifold')
+vitalStats(regina.Example3.lst(3,4), 'LST(3,4,7)')
+vitalStats(regina.Example3.solidKleinBottle(), 'Solid Klein bottle')
+vitalStats(regina.Example3.figureEight(), 'Figure eight knot complement')
+vitalStats(regina.Example3.whiteheadLink(), 'Whitehead link complement')
+vitalStats(regina.Example3.gieseking(), 'Gieseking manifold')
+vitalStats(regina.Example3.cuspedGenusTwoTorus(), 'Cusped genus two solid torus')

regina/sageRegina/testsuite/utf8.out

@@ -0,0 +1,42 @@
+3 Z
+3 Z
+3 ℤ
+3 Z
+
+3 Z + Z_17
+3 Z + Z_17
+3 ℤ + ℤ₁₇
+3 Z + Z_17
+
+2 Z (Z^2 -> Z^2 -> Z^2)
+2 Z (Z^2 -> Z^2 -> Z^2)
+2 ℤ (ℤ² → ℤ² → ℤ²)
+2 Z (Z^2 -> Z^2 -> Z^2)
+
+Z + Z_23 (Z^2 -> Z^2 -> Z^2)
+Z + Z_23 (Z^2 -> Z^2 -> Z^2)
+ℤ + ℤ₂₃ (ℤ² → ℤ² → ℤ²)
+Z + Z_23 (Z^2 -> Z^2 -> Z^2)
+
+- x^3 + 4 x - 2
+- x^3 + 4 x - 2
+- z^3 + 4 z - 2
+- x³ + 4 x - 2
+- z³ + 4 z - 2
+3 x^4 - x
+3 x^4 - x
+3 z^4 - z
+3 x⁴ - x
+3 z⁴ - z
+x^4 + 2 x^-3
+x^4 + 2 x^-3
+z^4 + 2 z^-3
+x⁴ + 2 x⁻³
+z⁴ + 2 z⁻³
+4 y^-3 + x^-1 y^2
+4 y^-3 + x^-1 y^2
+4 y^-3 + z^-1 y^2
+4 w^-3 + z^-1 w^2
+4 y⁻³ + x⁻¹ y²
+4 y⁻³ + z⁻¹ y²
+4 w⁻³ + z⁻¹ w²

regina/sageRegina/testsuite/utf8.test

@@ -0,0 +1,92 @@
+# 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 UTF-8 representations of various objects.
+#
+# 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/>.
+
+g = AbelianGroup(3)
+print(g)
+print(g.str())
+print(g.utf8())
+print(g.detail())
+g.addTorsion(17)
+print(g)
+print(g.str())
+print(g.utf8())
+print(g.detail())
+
+m = MatrixInt(2, 2)
+n = MatrixInt(2, 2)
+g = MarkedAbelianGroup(m, n)
+print(g)
+print(g.str())
+print(g.utf8())
+print(g.detail())
+n.set(0, 0, 23)
+g = MarkedAbelianGroup(m, n)
+print(g)
+print(g.str())
+print(g.utf8())
+print(g.detail())
+
+p = Polynomial()
+p[3] = -1
+p[1] = 4
+p[0] = -2
+print(p)
+print(p.str())
+print(p.str('z'))
+print(p.utf8())
+print(p.utf8('z'))
+
+p = Cyclotomic(7)
+p[4] = 3
+p[1] = -1
+print(p)
+print(p.str())
+print(p.str('z'))
+print(p.utf8())
+print(p.utf8('z'))
+
+p = Laurent(4)
+p[-3] = 2
+print(p)
+print(p.str())
+print(p.str('z'))
+print(p.utf8())
+print(p.utf8('z'))
+
+p = Laurent2(-1, 2)
+p[0, -3] = 4
+print(p)
+print(p.str())
+print(p.str('z'))
+print(p.str('z', 'w'))
+print(p.utf8())
+print(p.utf8('z'))
+print(p.utf8('z', 'w'))

regina/sageRegina/testsuite/whitehead.tri

@@ -0,0 +1,47 @@
+% Triangulation
+m129
+geometric_solution  3.66386238
+oriented_manifold
+CS_unknown
+
+2 0
+    torus   0.000000000000   0.000000000000
+    torus   0.000000000000   0.000000000000
+
+4
+   1    2    3    1 
+ 0132 0132 0132 3201
+   0    1    0    1 
+  0  1 -1  0 -1  0  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 -1  0  1  0  0 -1  1 -1  0  0  1  0  0  0  0
+  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0
+  1.000000000000   1.000000000000
+
+   0    0    3    2 
+ 0132 2310 3120 3120
+   0    1    1    0 
+  0  0  0  0  1  0 -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 -1  1  0  0  0  0  0  0 -1  0  1  1 -1  0  0
+  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0
+  0.500000000000   0.500000000000
+
+   1    0    3    3 
+ 3120 0132 0213 3120
+   0    1    1    0 
+  0 -1  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  1  0 -1  0  0 -1  1 -1  0  0  1  0  0  0  0
+  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0
+  0.500000000000   0.500000000000
+
+   2    2    1    0 
+ 3120 0213 3120 0132
+   0    1    1    0 
+  0 -1  0  1  0  0  1 -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 -1  0  0  1 -1  1  0  0  1  0 -1  0
+  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0
+  0.500000000000   0.500000000000
+

regina/sageRegina/version.py

@@ -0,0 +1,5 @@
+version = '7.4.1'
+release_date = 'December 24, 2025'
+
+
+

regina/sageSetup.py

@@ -0,0 +1,41 @@
+# Additional initialisation that takes place only when running Regina
+# from within Sage:
+
+from . import engine
+import sage.all
+
+# -------------------------------------------------------------------------
+# Sage-related hacks implemented at the C++ level in Regina
+# -------------------------------------------------------------------------
+
+# These hacks include making pybind11 work with Sage's Integer type.
+engine._addSageHacks()
+
+# -------------------------------------------------------------------------
+# Conversion from Regina objects to Sage objects
+# -------------------------------------------------------------------------
+
+from .engine import GroupPresentation
+
+# Additional methods for GroupPresentation
+
+# Follow convention that .sage() yields a representation of
+# a mathematical object native to sage
+
+def _convertRel(generators, rel):
+    return sage.all.prod([
+            generators[term.generator] ** term.exponent
+            for term in rel.terms()])
+
+def _convertGroupPresentation(self):
+    """
+    Returns a Sage version of this finitely presented group.
+    """
+    F = sage.all.FreeGroup(self.countGenerators())
+    gens = F.generators()
+    rels = [
+        _convertRel(gens, self.relation(i))
+        for i in range(self.countRelations())]
+    return F/rels
+
+GroupPresentation.sage = _convertGroupPresentation

regina/test.py

@@ -0,0 +1,6 @@
+import sys
+from .sageRegina.test import runTests
+
+if __name__ == '__main__':
+    success = runTests()
+    sys.exit(not success)

regina-7.4.1.dist-info/METADATA

@@ -0,0 +1,109 @@
+Metadata-Version: 2.4
+Name: regina
+Version: 7.4.1
+Summary: Regina-Normal
+Home-page: http://github.com/3-manifolds/regina_wheels
+Author: The Regina developers, Marc Culler, Nathan Dunfield, and Matthias Goerner
+Author-email: snappy-help@computop.org
+License: GPLv2+
+Keywords: triangulations,topology
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: GNU General Public License v2 or later (GPLv2+)
+Classifier: Operating System :: POSIX :: Linux
+Classifier: Operating System :: MacOS :: MacOS X
+Classifier: Programming Language :: C
+Classifier: Programming Language :: C++
+Classifier: Programming Language :: Python
+Classifier: Programming Language :: Cython
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.6
+Description-Content-Type: text/x-rst
+Dynamic: author
+Dynamic: author-email
+Dynamic: classifier
+Dynamic: description
+Dynamic: description-content-type
+Dynamic: home-page
+Dynamic: keywords
+Dynamic: license
+Dynamic: requires-python
+Dynamic: summary
+
+Self-contained Python packages of Regina
+========================================
+
+The program `Regina`_ is a powerful tool for studying low-dimensional
+topology. It comes with a full `Python`_ interface that lets one
+interact with it programmatically without writing any C++ code. Our
+goal here is to provide self-contained binaries ("wheels") of Regina's
+Python package that can be installed in seconds from Python's `PyPI`_
+package repository using ``pip``.
+
+It is offered for macOS (10.15 and newer) and Linux, but not
+Windows. To try it out, do::
+
+  python3 -m pip install --user --upgrade "regina>=7.0"
+  python3 -m regina.test
+
+On older versions of Linux, e.g. Ubuntu 18.04, you may need to update
+``pip`` first via::
+
+  python3 -m pip install --user --upgrade pip wheel
+
+For more on using Regina in Python see the `main docs`_.
+
+These binaries are produced and maintained by Marc Culler, Nathan
+Dunfield, and Matthias Goerner, though of course 99.9% of the code and
+credit is due to Ben Burton and the other authors of Regina
+itself. This project evolved out of Goerner's `sageRegina`_
+but works both with and without `SageMath`_. To install and test in
+SageMath do the following in a terminal window::
+
+  sage -pip install --user --upgrade "regina>=7.0"
+  sage -python -m regina.test
+
+One can also do this from **inside** SageMath (including from a
+notebook) by::
+
+  sage: %pip install --user "regina>=7.0"
+  sage: import regina.test; regina.test.runTests()
+
+Please report any technical problems via the `issue tracker`_ on the
+`GitHub site`_ devoted to this repackaging of Regina.
+
+
+Building from source
+--------------------
+
+If the available binaries do not work for you, you can try building
+from source.  You will need have the development versions of the
+libraries gmp, zlib, and bzip2 installed::
+
+  git clone https://github.com/3-manifolds/regina_wheel
+  cd regina_wheel
+  python3 setup.py package_assemble
+  python3 setup.py bdist_wheel
+  python3 -m pip install dist/regina*.whl
+
+This can easily take an hour or more.
+
+
+License
+-------
+
+Copyright Ben Burton, Ryan Budney, William Pettersson, Marc Culler,
+Nathan M. Dunfield, Matthias Goerner, and others 1999-present. This
+code is released under the `GNU General Public License, version 2`_ or
+(at your option) any later version as published by the Free Software
+Foundation.
+
+.. _Regina: https://regina-normal.github.io/
+.. _Python: https://python.org
+.. _PyPI: https://pypi.org
+.. _main docs: https://regina-normal.github.io/#docs
+.. _sageRegina: https://sageregina.unhyperbolic.org
+.. _SageMath: https://sagemath.org
+.. _issue tracker: https://github.com/3-manifolds/regina_wheels/issues
+.. _GitHub site: https://github.com/3-manifolds/regina_wheels/
+.. _GNU General Public License, version 2: https://www.gnu.org/licenses/old-licenses/gpl-2.0.txt