regina 7.3.1.1__cp38-cp38-macosx_11_0_x86_64.whl

regina/sageRegina/testsuite/treedecomp.test

@@ -0,0 +1,66 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2007-2023, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Provides tests for tree decompositions.
+#
+# 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, write to the Free
+# Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
+# MA 02110-1301, USA.
+
+t = TreeDecomposition(Example3.poincare())
+print(t.detail())
+t.makeNice()
+print(t.detail())
+
+t = TreeDecomposition(Example3.poincare())
+print(t.detail())
+t.makeNice(None)
+print(t.detail())
+
+t = TreeDecomposition(Example3.poincare())
+print(t.detail())
+t.makeNice([10,15,20,5,0])
+print(t.detail())
+
+x = [ 0.5, 0.1, 0.2, 0.6, 0.9, 0.8, 0.3, 0.7, 0.4, 1.0, 0.0]
+y = [ -9, -5, -3, -8, 0, -1, -7, -10, -4, -6, -2]
+z = [ 100, 100, 100, 100, 100, 0, 100, 100, 100, 100, 100]
+
+t = TreeDecomposition(Example3.sfsOverSphere(5,2,4,1,7,2))
+print(t.detail())
+t.reroot(x, y)
+print(t.detail())
+
+t = TreeDecomposition(Example3.sfsOverSphere(5,2,4,1,7,2))
+print(t.detail())
+t.reroot(x, y, None)
+print(t.detail())
+
+t = TreeDecomposition(Example3.sfsOverSphere(5,2,4,1,7,2))
+print(t.detail())
+t.reroot(x, y, z)
+print(t.detail())

regina/sageRegina/testsuite/treetraversal.out

@@ -0,0 +1,52 @@
+Found: 0 0 0 0 ; 1 0 0 || 1 0 0 0 ; 0 0 0 || 0 0 0 0 ; 0 0 0 || 0 1 0 0 ; 0 0 0
+Visited: 23
+
+Found: 1 0 0 ; 1 0 0
+Found: 0 1 0 ; 0 0 1
+Found: 0 0 1 ; 0 1 0
+Visited: 13
+Solutions: 3
+
+Found: inf inf inf inf ; 0 2 0 || inf inf inf inf ; 1 0 0
+Found: inf inf inf inf ; 0 0 2 || inf inf inf inf ; 1 0 0
+Found: inf inf inf inf ; 1 0 0 || inf inf inf inf ; 0 2 0
+Found: inf inf inf inf ; 1 0 0 || inf inf inf inf ; 0 0 2
+Visited: 21
+Solutions: 4
+
+Found: 1 1 0 0 ; 1 0 0 || 1 1 0 0 ; 1 0 0
+Visited: 13
+Solutions: 1
+
+System: True False False True
+Columns: 6 -> 8
+Perm: [3, 4, 5, 0, 1, 2, 6, 7]
+0 -1 1 0 -1 1 0 0
+-1 1 0 1 -1 0 -1 0
+0 1 -1 0 -1 1 0 -1
+
+( 0 0 0 0 0 0 )
+( 0 0 0 1 1 1 )
+( 0 0 0 1 1 1 )
+( 0 1 1 0 1 1 )
+Not feasible
+
+[]
+[[-1, -1, -1, -1, 0, 0, 0, 0, 1, 0, 1, 0, -1, 0, -1, 0, 0, 1, -1, 0, 1, 1, 0, 0, 0, 2, 0, 0, -1]]
+[[-1, -1, -1, -1, 0, 0, 0, 0, 1, 0, 1, 0, -1, 0, -1, 0, 0, 1, -1, 0, 1, 1, 0, 0, 0, 2, 0, 0, -1]]
+
+System: True False True False
+Columns: 21 -> 21
+Perm: [4, 5, 6, 18, 19, 20, 11, 12, 13, 0, 1, 2, 3, 14, 15, 16, 17, 7, 8, 9, 10]
+( 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 1 1 0 0 0 0 0 0 0 0 0 0 1 0 )
+Not feasible
+
+0 0 1 1 ; 1 0 0 || 0 0 1 1 ; 1 0 0 || 0 0 2 0 ; 0 0 0 || 1 1 1 1 ; 0 0 0 || 0 0 2 0 ; 0 0 0 || 0 0 0 0 ; 0 0 0
+System: True False True False
+Columns: 42 -> 42
+Perm: [25, 26, 27, 39, 40, 41, 18, 19, 20, 11, 12, 13, 4, 5, 6, 32, 33, 34, 21, 22, 23, 24, 35, 36, 37, 38, 14, 15, 16, 17, 7, 8, 9, 10, 0, 1, 2, 3, 28, 29, 30, 31]
+( 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 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 )
+( 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 )
+Not feasible

regina/sageRegina/testsuite/treetraversal.test

@@ -0,0 +1,190 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2007-2023, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Provides tests for the linear programm tree traversal algorithms.
+#
+# 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, write to the Free
+# Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
+# MA 02110-1301, USA.
+
+def dumpSurface(tree):
+	print('Found:', tree.buildSurface())
+	return False
+
+def dumpStructure(tree):
+	print('Found:', tree.buildStructure())
+	return False
+
+t = Example3.rp3rp3()
+tree = TreeSingleSoln_EulerPositive(t, NS_STANDARD)
+if tree.find():
+	print('Found:', tree.buildSurface())
+else:
+	print('No solution')
+
+print('Visited:', tree.visited())
+print()
+
+t = Example3.figureEight()
+tree = TautEnumeration(t)
+dummy = tree.run(dumpStructure)
+print('Visited:', tree.visited())
+print('Solutions:', tree.solutions())
+
+print()
+
+t = Example3.figureEight()
+tree = TreeEnumeration(t, NS_QUAD)
+dummy = tree.run(dumpSurface)
+print('Visited:', tree.visited())
+print('Solutions:', tree.solutions())
+
+print()
+
+t = Example3.trefoil()
+tree = TreeEnumeration_NonSpun(t, NS_QUAD)
+dummy = tree.run(dumpSurface)
+print('Visited:', tree.visited())
+print('Solutions:', tree.solutions())
+
+print()
+
+t = Example3.trefoil()
+tab = LPInitialTableaux_NonSpun(t, NS_QUAD)
+sys = tab.system()
+print('System:', sys.normal(), sys.angle(), sys.standard(), sys.quad())
+print('Columns:', tab.coordinateColumns(), '->', tab.columns())
+print('Perm:', tab.columnPerm())
+m = LPMatrix(tab.rank(), tab.columns())
+tab.fillInitialTableaux(m)
+print(m.detail())
+dat = LPData_NonSpun()
+dat.reserve(tab)
+dat.initStart()
+if dat.isFeasible():
+	print(dat.extractSolution([0, 0]))
+else:
+	print('Not feasible')
+
+dat.constrainPositive(2)
+if dat.isFeasible():
+	print(dat.extractSolution([3, 0]))
+else:
+	print('Not feasible')
+
+dat.constrainZero(3) # already zero, should do nothing
+if dat.isFeasible():
+	print(dat.extractSolution([3, 0]))
+else:
+	print('Not feasible')
+
+dat.constrainPositive(5)
+if dat.isFeasible():
+	print(dat.extractSolution([3, 3]))
+else:
+	print('Not feasible')
+
+dat.constrainZero(4)
+if dat.isFeasible():
+	print(dat.extractSolution([3, 3]))
+else:
+	print('Not feasible')
+
+print()
+
+t = Example3.rp3rp3()
+tab = LPInitialTableaux(t, NS_STANDARD)
+print(LPConstraintNone.addRows(tab))
+tab = LPInitialTableaux_EulerPositive(t, NS_STANDARD)
+print(LPConstraintEulerPositive.addRows(tab))
+tab = LPInitialTableaux_EulerZero(t, NS_STANDARD)
+print(LPConstraintEulerZero.addRows(tab))
+
+print()
+
+t = Example3.lst(3,4)
+tab = LPInitialTableaux(t, NS_STANDARD)
+sys = tab.system()
+print('System:', sys.normal(), sys.angle(), sys.standard(), sys.quad())
+print('Columns:', tab.coordinateColumns(), '->', tab.columns())
+print('Perm:', tab.columnPerm())
+dat = LPData()
+dat.reserve(tab)
+dat.initStart()
+if dat.isFeasible():
+	print(dat.extractSolution([0, 0, 0] + [0] * 12))
+else:
+	print('Not feasible')
+
+dat.constrainPositive(0)
+if dat.isFeasible():
+	print(dat.extractSolution([1, 0, 0] + [0] * 12))
+else:
+	print('Not feasible')
+
+ban = BanBoundary(tab)
+ban.enforceBans(dat)
+if dat.isFeasible():
+	print(dat.extractSolution([1, 0, 0] + [0] * 12))
+else:
+	print('Not feasible')
+
+print()
+
+t = Triangulation3.fromIsoSig('gHLLOcbcdeffafwfss') # Solid torus # RP^3
+print(t.nonTrivialSphereOrDisc())
+tab = LPInitialTableaux(t, NS_STANDARD)
+sys = tab.system()
+print('System:', sys.normal(), sys.angle(), sys.standard(), sys.quad())
+print('Columns:', tab.coordinateColumns(), '->', tab.columns())
+print('Perm:', tab.columnPerm())
+dat = LPData()
+dat.reserve(tab)
+dat.initStart()
+if dat.isFeasible():
+	print(dat.extractSolution([0] * 30))
+else:
+	print('Not feasible')
+
+dat.constrainPositive(35) # should be the "real" triangle coordinate #1
+if dat.isFeasible():
+	print(dat.extractSolution([0] * 23 + [1] + [0] * 6))
+else:
+	print('Not feasible')
+
+ban = BanBoundary(tab)
+ban.enforceBans(dat)
+if dat.isFeasible():
+	print(dat.extractSolution([0] * 23 + [1] + [0] * 6))
+else:
+	print('Not feasible')
+
+dat.constrainPositive(36) # should be the "real" triangle coordinate #2
+if dat.isFeasible():
+	print(dat.extractSolution([0] * 23 + [1,1] + [0] * 5))
+else:
+	print('Not feasible')