regina 7.3.1__cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl

regina/sageRegina/testsuite/theta_in_solid_torus.orb

@@ -0,0 +1,65 @@
+% orb
+theta_in_solid_torus
+SolutionType geometric_solution
+vertices_known
+
+  1  0 1.000  1  1  4xu  3uw  1wx  2wx
+  2  3 0.000  3  2  4wv  1uv
+  3  1 0.000  3  2  2vu
+  4  2 0.000  2  3  3xv
+  5  0 1.000  1  3  4xv  3vw  3wx  4wx  1wv  2vx  2xu  1uw
+  6  0 1.000  1  2  4vu  1xu  3xu  3uv  1vx  4uw  2uw  2wv
+
+  1  -53.3333333333333570    0.0000000000000080    0.0000000000000080    1.5707963267948968    1.5707963267948968    1.5707963267948968    1.5707963267948968
+  2   -0.7655364486149963    0.7655364486149963    0.7655364486149961    0.0000000000000000    0.0000000000000000
+  3   -0.7655364486149963    0.7655364486149963    0.7655364486149961    0.0000000000000000
+  4   -0.7655364486149963    0.7655364486149961    0.7655364486149963    0.0000000000000000
+  5   -4.5182192616560677    0.0000000000000080    0.7655364486149963    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484
+  6   -4.5182192616560677    0.0000000000000080    0.7655364486149961    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484    0.7853981633974484
+
+  1    1  0  0  0 -1  1  0  0   -1  1  0  0  2 -2  0  0    0 -1  0  0 -1  1  0  0    0  0  0  0  0  0  0  0
+  2    0  0  0  0  0  0  0  0    0  0  0  0  0  0  0  0
+  3    0  0  0  0  0  0  0  0
+  4    0  0  0  0  0  0  0  0
+  5    0  0  0  0  0  0  0  0   -1  0  0  0  1  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0 -1  0  0  0    1  0  0  0 -1  0  0  0    0  0  0  0  0  0  0  0    0  0  0  0  1  0  0  0    0  0  0  0  0  0  0  0
+  6    0  0  0  0 -1  0  0  0    0  0  0  0  1  0  0  0    1  0  0  0 -2  0  0  0    0  0  0  0  1  0  0  0    0  0  0  0  0  0  0  0   -1  0  0  0  2  0  0  0    0  0  0  0 -1  0  0  0    0  0  0  0  0  0  0  0
+
+14
+0	136	118
+1	345	127
+2	317	387
+3	197	339
+4	82	344
+5	93	163
+6	296	164
+7	275	264
+8	196	309
+9	127	250
+10	262	207
+11	246	235
+12	365	257
+13	402	223
+
+15
+0	0	1	0
+1	1	2	0
+2	2	3	0
+3	3	4	0
+4	4	5	0
+5	5	6	0
+6	6	7	0
+7	7	8	0
+8	8	9	0
+9	9	0	0
+10	8	3	0
+11	10	11	1
+12	11	12	1
+13	12	13	1
+14	13	10	1
+
+5
+0	132	163	5	9	0.196642	0.657601
+1	331	250	12	1	0.719863	0.476296
+2	279	241	12	6	0.283854	0.772448
+3	335	215	1	14	0.339991	0.475141
+4	286	209	6	14	0.457868	0.825823

regina/sageRegina/testsuite/tightencode.out

@@ -0,0 +1,40 @@
+M
+!
+z
+~!
+~M
+~N
+~z
+|!!
+|zM
+|!N
+|zz
+}!!!
+}zzM
+}!!N
+}zzz
+{z}
+{N}
+{"}
+{M}
+{z"}
+{N"}
+{!"}
+{M"}
+{+5p4(lG]&IOQRD6RDt%["}
+{X5p4(lG]&IOQRD6RDt%["}
+{}
+{}
+MM
+NM
+zM
+~NM
+~zM
+|!NM
+|zzM
+}!!NM
+}zzzM
+{"}M
+{M}M
+{!"}M
+{M"}M

regina/sageRegina/testsuite/tightencode.test

@@ -0,0 +1,108 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2015-2023, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests the tightEncode() functions.
+#
+# 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 doLong(val):
+	enc = tightEncoding(val)
+	print(enc)
+	for i in [ tightEncoding(Integer(val)), tightEncoding(LargeInteger(val)),
+			Integer(val).tightEncoding(), LargeInteger(val).tightEncoding() ]:
+		if i != enc:
+			print("ERROR: Inconsistent encodings")
+	if tightDecoding(enc) != val:
+		print("ERROR: Inconsistent decoding")
+
+def doLarge(val):
+	enc = tightEncoding(Integer(val))
+	print(enc)
+	for i in [ tightEncoding(Integer(val)), tightEncoding(LargeInteger(val)),
+			Integer(val).tightEncoding(), LargeInteger(val).tightEncoding() ]:
+		if i != enc:
+			print("ERROR: Inconsistent encodings")
+	if str(tightDecoding(enc)) != val:
+		print("ERROR: Inconsistent decoding")
+
+def doUnsigned(val):
+	# We can test encodings for unsigned types via AbelianGroup,
+	# which stores the rank as an unsigned integer.
+	a = AbelianGroup(val)
+	print(a.tightEncoding())
+
+doLong(0)
+doLong(-44)
+doLong(45)
+
+doLong(-89)
+doLong(-45)
+doLong(46)
+doLong(90)
+
+doLong(-4139)
+doLong(-90)
+doLong(91)
+doLong(4140)
+
+doLong(-368639)
+doLong(-4140)
+doLong(4141)
+doLong(368640)
+
+doLong(-368684)
+doLong(-368640)
+doLong(368641)
+doLong(368684)
+
+doLong(-368729)
+doLong(-368685)
+doLong(368685)
+doLong(368729)
+
+doLarge('1000000000000000000000000000000000000000')
+doLarge('-1000000000000000000000000000000000000000')
+
+print(tightEncoding(LargeInteger.infinity))
+print(LargeInteger.infinity.tightEncoding())
+
+doUnsigned(0)
+doUnsigned(1)
+doUnsigned(45)
+doUnsigned(46)
+doUnsigned(90)
+doUnsigned(91)
+doUnsigned(4140)
+doUnsigned(4141)
+doUnsigned(368640)
+doUnsigned(368641)
+doUnsigned(368684)
+doUnsigned(368685)
+doUnsigned(368729)
+

regina/sageRegina/testsuite/treedecomp.out

@@ -0,0 +1,135 @@
+Tree decomposition: width 4, size 5
+Bag 4 [1]: 4
+  Bag 3 [2]: 3 4
+    Bag 2 [3]: 2 3 4
+      Bag 1 [4]: 1 2 3 4
+        Bag 0 [5]: 0 1 2 3 4
+
+Tree decomposition: width 4, size 10
+Bag 9 [0]:
+  Bag 8 [1]: 0
+    Bag 7 [2]: 0 1
+      Bag 6 [3]: 0 1 2
+        Bag 5 [4]: 0 1 2 3
+          Bag 4 [5]: 0 1 2 3 4
+            Bag 3 [4]: 0 1 2 3
+              Bag 2 [3]: 0 1 2
+                Bag 1 [2]: 0 1
+                  Bag 0 [1]: 0
+
+Tree decomposition: width 4, size 5
+Bag 4 [1]: 4
+  Bag 3 [2]: 3 4
+    Bag 2 [3]: 2 3 4
+      Bag 1 [4]: 1 2 3 4
+        Bag 0 [5]: 0 1 2 3 4
+
+Tree decomposition: width 4, size 10
+Bag 9 [0]:
+  Bag 8 [1]: 0
+    Bag 7 [2]: 0 1
+      Bag 6 [3]: 0 1 2
+        Bag 5 [4]: 0 1 2 3
+          Bag 4 [5]: 0 1 2 3 4
+            Bag 3 [4]: 0 1 2 3
+              Bag 2 [3]: 0 1 2
+                Bag 1 [2]: 0 1
+                  Bag 0 [1]: 0
+
+Tree decomposition: width 4, size 5
+Bag 4 [1]: 4
+  Bag 3 [2]: 3 4
+    Bag 2 [3]: 2 3 4
+      Bag 1 [4]: 1 2 3 4
+        Bag 0 [5]: 0 1 2 3 4
+
+Tree decomposition: width 4, size 10
+Bag 9 [0]:
+  Bag 8 [1]: 2
+    Bag 7 [2]: 1 2
+      Bag 6 [3]: 0 1 2
+        Bag 5 [4]: 0 1 2 3
+          Bag 4 [5]: 0 1 2 3 4
+            Bag 3 [4]: 0 1 2 3
+              Bag 2 [3]: 0 1 2
+                Bag 1 [2]: 0 1
+                  Bag 0 [1]: 0
+
+Tree decomposition: width 2, size 11
+Bag 10 [1]: 10
+  Bag 9 [2]: 9 10
+    Bag 8 [2]: 8 9
+      Bag 7 [2]: 7 8
+        Bag 6 [2]: 2 7
+          Bag 5 [3]: 0 2 7
+            Bag 4 [3]: 0 1 2
+              Bag 1 [3]: 1 2 5
+                Bag 0 [2]: 5 6
+              Bag 3 [3]: 0 1 3
+                Bag 2 [2]: 3 4
+
+Tree decomposition: width 2, size 11
+Bag 10 [2]: 3 4
+  Bag 9 [3]: 0 1 3
+    Bag 8 [3]: 0 1 2
+      Bag 5 [3]: 0 2 7
+        Bag 4 [2]: 2 7
+          Bag 3 [2]: 7 8
+            Bag 2 [2]: 8 9
+              Bag 1 [2]: 9 10
+                Bag 0 [1]: 10
+      Bag 7 [3]: 1 2 5
+        Bag 6 [2]: 5 6
+
+Tree decomposition: width 2, size 11
+Bag 10 [1]: 10
+  Bag 9 [2]: 9 10
+    Bag 8 [2]: 8 9
+      Bag 7 [2]: 7 8
+        Bag 6 [2]: 2 7
+          Bag 5 [3]: 0 2 7
+            Bag 4 [3]: 0 1 2
+              Bag 1 [3]: 1 2 5
+                Bag 0 [2]: 5 6
+              Bag 3 [3]: 0 1 3
+                Bag 2 [2]: 3 4
+
+Tree decomposition: width 2, size 11
+Bag 10 [2]: 3 4
+  Bag 9 [3]: 0 1 3
+    Bag 8 [3]: 0 1 2
+      Bag 5 [3]: 0 2 7
+        Bag 4 [2]: 2 7
+          Bag 3 [2]: 7 8
+            Bag 2 [2]: 8 9
+              Bag 1 [2]: 9 10
+                Bag 0 [1]: 10
+      Bag 7 [3]: 1 2 5
+        Bag 6 [2]: 5 6
+
+Tree decomposition: width 2, size 11
+Bag 10 [1]: 10
+  Bag 9 [2]: 9 10
+    Bag 8 [2]: 8 9
+      Bag 7 [2]: 7 8
+        Bag 6 [2]: 2 7
+          Bag 5 [3]: 0 2 7
+            Bag 4 [3]: 0 1 2
+              Bag 1 [3]: 1 2 5
+                Bag 0 [2]: 5 6
+              Bag 3 [3]: 0 1 3
+                Bag 2 [2]: 3 4
+
+Tree decomposition: width 2, size 11
+Bag 10 [3]: 0 2 7
+  Bag 4 [2]: 2 7
+    Bag 3 [2]: 7 8
+      Bag 2 [2]: 8 9
+        Bag 1 [2]: 9 10
+          Bag 0 [1]: 10
+  Bag 9 [3]: 0 1 2
+    Bag 6 [3]: 1 2 5
+      Bag 5 [2]: 5 6
+    Bag 8 [3]: 0 1 3
+      Bag 7 [2]: 3 4
+

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')