regina 7.3.1.1__cp311-cp311-manylinux_2_17_aarch64.manylinux2014_aarch64.whl

regina/sageRegina/testsuite/hypersurfaces.test

@@ -0,0 +1,90 @@
+# 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 various tests for normal surface 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, write to the Free
+# Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
+# MA 02110-1301, USA.
+
+def dumpSurfaces(name, tri, triName, coords = regina.HS_STANDARD, which = regina.HS_LIST_DEFAULT, alg = regina.HS_ALG_DEFAULT):
+	try:
+		slist = regina.NormalHypersurfaces(tri, coords, which)
+	except:
+		print("-------------------------------")
+		print(name)
+		print('ENUMERATION FAILED')
+		print("-------------------------------")
+		print()
+		return
+	
+	print("-------------------------------")
+	print(triName)
+	print(name)
+	print("-------------------------------")
+	print()
+	
+	# Dump the hypersurfaces in sort order, since we don't really mind if the
+	# ordering changes between releases.
+	surfaces = slist.detail().split('\n')
+	surfaces.sort()
+	# Let the text headers appear up top.
+	surfaces.reverse()
+	for s in surfaces:
+		print(s)
+	
+	# Nothing else to say.
+	print()
+
+def surfaceStats(tri, triName):
+	dumpSurfaces('Vertex hypersurfaces (std)',
+		tri, triName, regina.HS_STANDARD, regina.HS_VERTEX)
+	dumpSurfaces('Vertex hypersurfaces (prism)',
+		tri, triName, regina.HS_PRISM, regina.HS_VERTEX)
+	dumpSurfaces('Fundamental surfaces (std, primal)',
+		tri, triName, regina.HS_STANDARD, regina.HS_FUNDAMENTAL,
+		regina.HS_HILBERT_PRIMAL)
+	dumpSurfaces('Fundamental surfaces (std, dual)',
+		tri, triName, regina.HS_STANDARD, regina.HS_FUNDAMENTAL,
+		regina.HS_HILBERT_DUAL)
+	dumpSurfaces('Fundamental surfaces (prism, primal)',
+		tri, triName, regina.HS_PRISM, regina.HS_FUNDAMENTAL,
+		regina.HS_HILBERT_PRIMAL)
+	dumpSurfaces('Fundamental surfaces (prism, dual)',
+		tri, triName, regina.HS_PRISM, regina.HS_FUNDAMENTAL, regina.HS_HILBERT_DUAL)
+
+t = regina.Triangulation4()
+surfaceStats(t, 'Empty triangulation')
+
+surfaceStats(regina.Example4.fourSphere(), '4-sphere')
+# surfaceStats(regina.Example4.simplicialFourSphere(), 'Simplicial 4-sphere')
+surfaceStats(regina.Example4.rp4(), 'Real projective 4-space')
+surfaceStats(regina.Example4.s3xs1(), 'S3 x S1')
+surfaceStats(regina.Example4.s3xs1Twisted(), 'S3 x~ S1')
+surfaceStats(regina.Example4.cappellShaneson(), 'Cappell-Shaneson knot complement')
+# L(8,3) x S1:
+surfaceStats(regina.Triangulation4('kLLLzQMQQccefhihhgihijjijjKb9aGbKbebvbPadbaaebmb9aGasasamb'), 'L(8,3) x S1')

regina/sageRegina/testsuite/i18n-latin1.rga

@@ -0,0 +1,8 @@
+<?xml version="1.0"?>
+<reginadata engine="4.4">
+<packet label="�mit �zer"
+	type="Text" typeid="2"
+	parent="">
+  <text>3��</text>
+</packet> <!-- �mit �zer (Text) -->
+</reginadata>

regina/sageRegina/testsuite/i18n-utf8.rga

@@ -0,0 +1,8 @@
+<?xml version="1.0"?>
+<reginadata engine="4.5">
+<packet label="Ümit Özer"
+	type="Text" typeid="2"
+	parent="">
+  <text>3½°</text>
+</packet> <!-- Ümit Özer (Text) -->
+</reginadata>

regina/sageRegina/testsuite/i18n.out

@@ -0,0 +1,6 @@
+Ümit Özer
+3½°
+Ümit Özer
+3½°
+O2₁
+O2₁

regina/sageRegina/testsuite/i18n.test

@@ -0,0 +1,91 @@
+# 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).
+#
+# Tests for UTF-8 character encodings when loading and importing files
+#
+# 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.
+
+# Fetch the python/testsuite path in the source tree, since we will need
+# to access external files.
+import sys
+if (len(sys.argv) > 1):
+	testpath = sys.argv[1]
+else:
+	testpath = '.'
+
+# Make sure we get the transition between LATIN1 and UTF-8 regimes correct.
+oldVersions = [ '0', '01', '1', '2', '3', '4',
+	'0.0', '0.1', '0.4', '0.5', '0.9', '0.10',
+	'1.0', '1.1', '1.4', '1.5', '1.9', '1.10',
+	'2.0', '2.1', '2.4', '2.5', '2.9', '2.10',
+	'3.0', '3.1', '3.4', '3.5', '3.9', '3.10',
+	'4.0', '4.01', '4.1', '4.2', '4.3', '4.4', '4.4.1', '4.4.9' ]
+newVersions = [ '', '5', '6', '7', '8', '9', '10', '20', '30', '40', '50', '90',
+	'4.5', '4.6', '4.9', '4.10', '4.20', '4.30', '4.40', '4.50', '4.90',
+	'5.0', '5.1', '5.4', '5.5', '5.9', '9.1', '9.9', '10.1', '10.9',
+	'40.1', '40.9', '50.1', '50.9' ]
+suffixes = [ '', 'a', 'alpha', '.', '.0', '.01', '.0.1', '.1',
+	'+a', '-a', '-0', '-1', '-9', '-10' ]
+
+for v in oldVersions:
+	for s in suffixes:
+		if regina.versionUsesUTF8(v + s):
+			print('ERROR: Version ' + v + s + ' claims to use UTF-8.')
+
+for v in newVersions:
+	for s in suffixes:
+		if not regina.versionUsesUTF8(v + s):
+			print('ERROR: Version ' + v + s + ' does not claim to use UTF-8.')
+
+# Load a file created by an old version of regina.  This file stores it
+# strings as LATIN1, which should be converted to UTF-8 on import.
+i18nOld = regina.open(testpath + '/i18n-latin1.rga')
+if i18nOld != None:
+	print(i18nOld.label())
+	print(i18nOld.text())
+
+# Load a version of the same file created by a newer version of Regina,
+# which stores strings directly in UTF-8.
+i18nNew = regina.open(testpath + '/i18n-utf8.rga')
+if i18nNew != None:
+	print(i18nNew.label())
+	print(i18nNew.text())
+
+# Import a triangulation from SnapPea that uses a subscript character in
+# the triangulation name.
+subscriptImport = SnapPeaTriangulation(testpath + '/O2_1.tri')
+if subscriptImport != None:
+	print(subscriptImport.name())
+
+# Load a Regina data file with a pre-saved version of this same SnapPea
+# triangulation.
+subscriptLoad = regina.open(testpath + '/O2_1.rga')
+if subscriptLoad != None:
+	print(subscriptLoad.firstChild().label())
+

regina/sageRegina/testsuite/id.out

@@ -0,0 +1,2 @@
+True False False
+True False False

regina/sageRegina/testsuite/id.test

@@ -0,0 +1,47 @@
+# 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 variables that should be the same object in Python.
+#
+# 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.
+
+a = Integer.zero
+b = Integer.zero
+c = Integer(0)
+d = Integer(0)
+
+print(a is b, c is d, a is c)
+
+p = Rational.one
+q = Rational.one
+r = LargeInteger(1)
+s = LargeInteger(1)
+
+print(p is q, r is s, p is r)
+

regina/sageRegina/testsuite/index.out

@@ -0,0 +1,2 @@
+Edge 3, internal, degree 5: 0 (12), 1 (32), 2 (30), 3 (01), 4 (12)
+3

regina/sageRegina/testsuite/index.test

@@ -0,0 +1,43 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2019, Matthias Goerner
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Provides tests for recognising the special __index__ method (PEP 357).
+#
+# 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.
+
+class C:
+    def __index__(self):
+        return 3
+
+c = C()
+t = Example3.poincare()
+print(t.edge(c))
+
+n = regina.Integer(c)
+print(n)

regina/sageRegina/testsuite/integer.out

@@ -0,0 +1,74 @@
+1
+-1
+100
+-100
+10000
+-10000
+1000000
+-1000000
+100000000
+-100000000
+10000000000
+-10000000000
+1000000000000
+-1000000000000
+100000000000000
+-100000000000000
+10000000000000000
+-10000000000000000
+1000000000000000000
+-1000000000000000000
+100000000000000000000
+-100000000000000000000
+10000000000000000000000
+-10000000000000000000000
+1000000000000000000000000
+-1000000000000000000000000
+100000000000000000000000000
+-100000000000000000000000000
+10000000000000000000000000000
+-10000000000000000000000000000
+3141592
+1234567
+1
+-1
+100
+-100
+10000
+-10000
+1000000
+-1000000
+100000000
+-100000000
+10000000000
+-10000000000
+1000000000000
+-1000000000000
+100000000000000
+-100000000000000
+10000000000000000
+-10000000000000000
+1000000000000000000
+-1000000000000000000
+100000000000000000000
+-100000000000000000000
+10000000000000000000000
+-10000000000000000000000
+1000000000000000000000000
+-1000000000000000000000000
+100000000000000000000000000
+-100000000000000000000000000
+10000000000000000000000000000
+-10000000000000000000000000000
+3141592
+1234567
+123
+<class 'int'> 123
+-123456789123456789123456789123456789123456789123456789
+<class 'int'> -123456789123456789123456789123456789123456789123456789
+123
+<class 'int'> 123
+-123456789123456789123456789123456789123456789123456789
+<class 'int'> -123456789123456789123456789123456789123456789123456789
+inf
+Could not convert

regina/sageRegina/testsuite/integer.test

@@ -0,0 +1,56 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2019, Matthias Goerner
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Provides tests for working with the python long integer type.
+#
+# 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.
+
+for IntegerType in [Integer, LargeInteger]:
+    
+    for i in range(0,30,2):
+        print(IntegerType(10**i))
+        print(IntegerType(-(10**i)))
+    
+    print(IntegerType('3141592'))
+    print(IntegerType(1234567.89))
+    
+    x = IntegerType(123)
+    y = IntegerType(-123456789123456789123456789123456789123456789123456789)
+
+for IntegerType in [Integer, LargeInteger]:
+    for i in [ x, y ]:
+        print(i)
+        z = i.pythonValue()
+        print(type(z), z)
+
+try:
+    print(LargeInteger.infinity)
+    print(LargeInteger.infinity.pythonValue())
+except:
+    print('Could not convert')

regina/sageRegina/testsuite/italian.orb

@@ -0,0 +1,90 @@
+% orb
+italian
+SolutionType geometric_solution
+vertices_known
+
+  1  0 1.000  1  1  3vu  3xu  2uw  1wu  3uw  3xv  2vw  1wv  3xw  2xw  1wx  3vw
+  2  0 1.000  2  1  2vu  1xv  2ux  1vu  2xv  1ux
+
+  1   -0.7962776727648548    0.6563031871196925    0.6563031871196925    0.5538708696492985    0.5538708696492985    0.4933266815472988    0.4933266815472988    0.5538708696492985    0.5538708696492985    0.4933266815472988    0.4933266815472988    0.5538708696492985    0.4933266815472988    0.4933266815472988    0.5538708696492985
+  2   -2.8959419028600042    0.0000000000000088    0.6563031871196925    1.0471975511965974    1.0471975511965974    1.0471975511965972    1.0471975511965974    1.0471975511965974    1.0471975511965972
+
+  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
+  2   -1  0  0  0 -3  0  0  0    0  0  0  0  1  0  0  0    1  0  0  0  4  0  0  0    1  0  0  0  3  0  0  0    0  0  0  0 -1  0  0  0   -1  0  0  0 -4  0  0  0
+
+26
+0	47	47
+1	47	205
+2	142	205
+3	142	47
+4	265	47
+5	265	205
+6	103	65
+7	306	65
+8	306	158
+9	219	158
+10	189	85
+11	85	84
+12	85	157
+13	178	157
+14	223	84
+15	283	84
+16	283	131
+17	242	131
+18	242	104
+19	317	104
+20	317	182
+21	120	182
+22	120	101
+23	161	100
+24	161	134
+25	103	134
+
+27
+0	0	1	1
+1	1	2	1
+2	2	3	1
+3	3	4	1
+4	4	5	1
+5	5	2	1
+6	3	0	1
+7	6	7	1
+8	7	8	1
+9	8	9	1
+10	9	10	1
+11	10	11	1
+12	11	12	1
+13	12	13	1
+14	13	14	1
+15	14	15	1
+16	15	16	1
+17	16	17	1
+18	17	18	1
+19	18	19	1
+20	19	20	1
+21	20	21	1
+22	21	22	1
+23	22	23	1
+24	23	24	1
+25	24	25	1
+26	25	6	1
+
+18
+0	202	117	14	10	0.541187	0.554886
+1	306	104	8	19	0.419355	0.853333
+2	265	158	9	4	0.471264	0.702532
+3	265	104	4	19	0.360759	0.306667
+4	265	182	21	4	0.263959	0.85443
+5	265	65	4	7	0.113924	0.79803
+6	120	134	25	22	0.706897	0.592593
+7	103	84	26	11	0.722129	0.826923
+8	120	157	13	22	0.376344	0.308642
+9	142	65	2	7	0.886076	0.192118
+10	142	84	2	11	0.762354	0.451923
+11	142	157	13	2	0.612903	0.303797
+12	142	182	21	2	0.888325	0.14557
+13	142	100	2	23	0.661624	0.536585
+14	142	134	25	2	0.327586	0.449367
+15	265	131	17	4	0.439024	0.531646
+16	265	84	4	15	0.234177	0.7
+17	283	104	16	19	0.425532	0.546667

regina/sageRegina/testsuite/iterators.out

@@ -0,0 +1,118 @@
+a.children():
+aa
+ab
+a.subtree():
+a
+aa
+aaa
+aab
+ab
+aba
+abb
+a.descendants():
+aa
+aaa
+aab
+ab
+aba
+abb
+a as iterable:
+a
+aa
+aaa
+aab
+ab
+aba
+abb
+Angle structure iteration:
+1 0 0 ; 1 0 0
+0 0 1 ; 0 1 0
+0 1 0 ; 0 0 1
+0 1/2 1/2 ; 1 0 0
+1 0 0 ; 0 1/2 1/2
+Normal surface iteration:
+inf inf inf inf ; 0 2 0 || inf inf inf inf ; 1 0 0
+inf inf inf inf ; 0 0 2 || inf inf inf inf ; 1 0 0
+inf inf inf inf ; 1 0 0 || inf inf inf inf ; 0 2 0
+inf inf inf inf ; 1 0 0 || inf inf inf inf ; 0 0 2
+( inf inf inf inf 0 2 0 inf inf inf inf 1 0 0 )
+( inf inf inf inf 0 0 2 inf inf inf inf 1 0 0 )
+( inf inf inf inf 1 0 0 inf inf inf inf 0 2 0 )
+( inf inf inf inf 1 0 0 inf inf inf inf 0 0 2 )
+Normal disc iteration:
+0:1 #0
+0:3 #0
+0:5 #0
+1:2 #0
+1:3 #0
+1:4 #0
+2:0 #0
+2:2 #0
+2:5 #0
+3:1 #0
+3:3 #0
+3:5 #0
+4:0 #0
+4:1 #0
+4:4 #0
+Normal hypersurface iteration:
+0 0 0 0 0 ; 0 0 0 0 0 0 0 1 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 0 0 0 1 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 0 1 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 1 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 0 0 ; 0 0 0 0 1 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 0 1 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 0 ; 0 0 1 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 0 ; 0 0 0 0 1 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 1 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 0 0 ; 0 0 0 0 0 1 0 0 0 0 || 0 0 0 0 0 ; 0 0 0 0 0 1 0 0 0 0
+0 0 0 0 0 ; 1 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 0 0 0 ; 1 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 0 0 1 ; 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 0 0 0 1 ; 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 0 0 1 0 ; 0 0 0 0 0 0 0 0 1 0 || 0 0 0 1 0 ; 0 0 0 0 0 0 0 0 1 0 || 0 0 1 0 0 ; 0 0 0 0 0 0 0 0 0 1 || 0 0 1 0 0 ; 0 0 0 0 0 0 0 0 0 1
+0 0 1 0 0 ; 0 0 0 0 0 0 0 0 0 1 || 0 0 1 0 0 ; 0 0 0 0 0 0 0 0 0 1 || 0 0 0 1 0 ; 0 0 0 0 0 0 0 0 1 0 || 0 0 0 1 0 ; 0 0 0 0 0 0 0 0 1 0
+0 0 1 1 0 ; 0 0 0 0 0 0 0 0 0 0 || 0 0 1 1 0 ; 0 0 0 0 0 0 0 0 0 0 || 0 0 1 1 0 ; 0 0 0 0 0 0 0 0 0 0 || 0 0 1 1 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 1 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 || 1 0 0 0 0 ; 0 0 0 0 0 0 1 0 0 0
+1 0 0 0 0 ; 0 0 0 0 0 0 1 0 0 0 || 1 0 0 0 0 ; 0 0 0 0 0 0 1 0 0 0 || 0 1 0 0 0 ; 0 0 0 1 0 0 0 0 0 0 || 0 1 0 0 0 ; 0 0 0 1 0 0 0 0 0 0
+1 1 0 0 0 ; 0 0 0 0 0 0 0 0 0 0 || 1 1 0 0 0 ; 0 0 0 0 0 0 0 0 0 0 || 1 1 0 0 0 ; 0 0 0 0 0 0 0 0 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 1 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 0 0 0 1 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 0 1 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 1 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 0 0 0 0 0 0 1 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 0 1 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 0 0 0 1 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 0 0 0 0 0 1 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 1 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 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 )
+( 0 0 0 0 0 1 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 0 0 0 1 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 0 0 1 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 0 0 0 1 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 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 )
+( 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 )
+( 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 )
+( 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 )
+( 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 )
+Model link graph cell arc iteration:
+['0:0', '1:1', '4:1', '5:3', '3:3']
+['0:1', '2:1', '1:0']
+['0:2', '3:1', '2:0']
+['0:3', '3:0']
+['1:2', '4:0']
+['1:3', '2:2', '5:1', '4:3']
+['2:3', '3:2', '5:0']
+['4:2', '5:2']
+Vector<Integer> iteration:
+3
+5
+-1
+Vector<LargeInteger> iteration:
+3
+5
+-1
+PermGroup iteration:
+3210
+2130
+1320
+0231
+2301
+3021
+1032
+0312
+3102
+1203
+2013
+0123
+TableView iteration:
+01/23
+02/13
+03/12