snappy 3.0.3__cp38-cp38-macosx_11_0_arm64.whl → 3.2__cp38-cp38-macosx_11_0_arm64.whl

snappy/snap/t3mlite/edge.py

@@ -1,18 +1,27 @@
-#$Id: edge.py,v 1.3 2002/09/20 03:52:16 culler Exp $
+# $Id: edge.py,v 1.3 2002/09/20 03:52:16 culler Exp $
 #   t3m - software for studying triangulated 3-manifolds
 #   Copyright (C) 2002 Marc Culler, Nathan Dunfield and others
 #
-#   This program is distributed under the terms of the 
+#   This program is distributed under the terms of the
 #   GNU General Public License, version 2 or later, as published by
 #   the Free Software Foundation.  See the file GPL.txt for details.
 
 from .simplex import *
-from .tetrahedron import *
-from .corner import *
-from .arrow import *
-from .perm4 import *
+from .corner import Corner
+from .arrow import Arrow
+from .perm4 import Perm4
 import sys
 
+# A table used for _add_corner, equivalent to:
+# other_arrow = arrow.copy().opposite()
+# tail, head = other_arrow.tail(), other_arrow.head()
+
+_edge_add_corner_dict = {}
+for edge, face in EdgeFacePairs:
+    other_arrow = Arrow(edge, face, None).opposite()
+    _edge_add_corner_dict[edge, face] = other_arrow.tail(), other_arrow.head()
+
+
 # An edge has an initial and terminal vertex, but these are determined
 # arbitrarily when the 1-skeleton is constructed.
 
@@ -23,17 +32,17 @@ class Edge:
         self.Name = ''
         self.IntOrBdry = ''         # value: '', 'int' or 'bdry'
         self.Corners = []           # Corners of type "1-simplex in Tetrahedron"
-        self.Vertices = []          # pairs: (initial Vertex, terminal Vertex) 
+        self.Vertices = []          # pairs: (initial Vertex, terminal Vertex)
         self.LeftBdryArrow = None   # Arrows representing the two boundary faces,
-        self.RightBdryArrow = None  # if this is a boundary edge. 
-        self._edge_orient_cache = dict()
+        self.RightBdryArrow = None  # if this is a boundary edge.
+        self._edge_orient_cache = {}
 
     def __repr__(self):
         if self.Index > -1:
             return ('e' + str(self.Index) + self.Name +
                     ' (' + self.IntOrBdry + ')')
         else:
-            return '< floating edge' + str(id(self)) +' >'
+            return '< floating edge' + str(id(self)) + ' >'
 
     # below added by NMD for more detailed printing
 
@@ -43,7 +52,7 @@ class Edge:
         e = self.Corners[0].Subsimplex
         return Arrow(e, RightFace[e], self.Corners[0].Tetrahedron)
 
-    def info(self, out = sys.stdout):
+    def info(self, out=sys.stdout):
         out.write(repr(self) + "\t Edge of valence %d\tEndpoints %s\n"
                   % (self.valence(), self.Vertices))
         if self.IntOrBdry == 'bdry':
@@ -55,9 +64,9 @@ class Edge:
         for i in range(self.valence()):
             s = s + repr(a) + "  "
             a.next()
-            if i > 0 and (i +1) % 3 == 0 and i != (self.valence()-1):
+            if i > 0 and (i + 1) % 3 == 0 and i != (self.valence()-1):
                 s = s + "\n\t"
-        out.write(s + '\n')            
+        out.write(s + '\n')
 
     def valence(self):
         return len(self.Corners)
@@ -79,9 +88,9 @@ class Edge:
             for one_subsimplex in AdjacentEdges[corner.Subsimplex]:
                 if corner.Tetrahedron.Class[one_subsimplex] is self:
                     return 1
-        return 0 
+        return 0
 
-# Return 1 if two opposite edges of a 3-simplex are identified to 
+# Return 1 if two opposite edges of a 3-simplex are identified to
 # the edge.
     def self_opposite(self):
         count = 0
@@ -93,7 +102,7 @@ class Edge:
 # Remove all references to self from adjoining Tetrahedra and Vertices
     def erase(self):
         for corner in self.Corners:
-            corner.Tetrahedron.Class[corner.Subsimplex] = None 
+            corner.Tetrahedron.Class[corner.Subsimplex] = None
         for vertex in self.Vertices:
             try:
                 vertex.Edges.remove(self)
@@ -146,7 +155,7 @@ class Edge:
         tet, perm = self._first_embedding()
         for i in range(order):
             yield tet, perm
-            face = perm.image(1 | 2 | 8)
+            face = perm.image(F2)
             tet, perm = (
                 tet.Neighbor[face], tet.Gluing[face] * perm * Perm4( (0,1,3,2) ))
 
@@ -155,7 +164,9 @@ class Edge:
         Used by Mcomplex.build_edge_classes
         """
         self.Corners.append(Corner(arrow.Tetrahedron, arrow.Edge))
-        other_arrow = arrow.copy().opposite()
-        tail, head = other_arrow.tail(), other_arrow.head()
-        self._edge_orient_cache[(arrow.Tetrahedron, tail, head)] = 1
-        self._edge_orient_cache[(arrow.Tetrahedron, head, tail)] = -1
+        # Next line equivalent to:
+        # other_arrow = arrow.copy().opposite()
+        # tail, head = other_arrow.tail(), other_arrow.head()
+        tail, head = _edge_add_corner_dict[arrow.Edge, arrow.Face]
+        self._edge_orient_cache[arrow.Tetrahedron, tail, head] = 1
+        self._edge_orient_cache[arrow.Tetrahedron, head, tail] = -1

snappy/snap/t3mlite/face.py

@@ -1,15 +1,14 @@
-#$$
+# $$
 #   t3m - software for studying triangulated 3-manifolds
 #   Copyright (C) 2002 Marc Culler, Nathan Dunfield and others
 #
-#   This program is distributed under the terms of the 
+#   This program is distributed under the terms of the
 #   GNU General Public License, version 2 or later, as published by
 #   the Free Software Foundation.  See the file GPL.txt for details.
 
-from .arrow import *
-from .simplex import *
-from .tetrahedron import *
-from .corner import *
+from .arrow import Arrow
+from .simplex import PickAnEdge
+
 
 class Face:
     def __init__(self):
@@ -19,7 +18,7 @@ class Face:
 
     def __repr__(self):
         if self.Index > -1:
-            return ('f' + str(self.Index) 
+            return ('f' + str(self.Index)
                     + ' (' + self.IntOrBdry + ')')
         else:
             return '< floating face' + str(id(self)) + ' >'
@@ -35,5 +34,4 @@ class Face:
         face = self.Corners[0].Subsimplex
         tet = self.Corners[0].Tetrahedron
         edge = PickAnEdge[face]
-        return Arrow(edge, face, tet) 
-
+        return Arrow(edge, face, tet)

snappy/snap/t3mlite/files.py

@@ -1,15 +1,14 @@
-from __future__ import unicode_literals
 #   t3m - software for studying triangulated 3-manifolds
 #   Copyright (C) 2002 Marc Culler, Nathan Dunfield and others
 #
-#   This program is distributed under the terms of the 
+#   This program is distributed under the terms of the
 #   GNU General Public License, version 2 or later, as published by
 #   the Free Software Foundation.  See the file GPL.txt for details.
 
 from .arrow import eArrow
 from .simplex import *
 from .tetrahedron import Tetrahedron
-import os, sys, re
+import re
 
 # Nathan's code for importing and exporting snappea files.
 # Converts a SnapPea file to MComplex.  Doesn't really use all the
@@ -17,11 +16,12 @@ import os, sys, re
 # gluing data for the ith pair of tetrahedra is given by the ith pair
 # of lines like:
 #
-#      2    5    1   34 
+#      2    5    1   34
 #   3120 0321 0132 0132
 
-def read_SnapPea_file(file_name=None, data = None):
-    if data is None: 
+
+def read_SnapPea_file(file_name=None, data=None):
+    if data is None:
         data = open(file_name).read().decode('ascii')
     count = 0
 
@@ -29,7 +29,7 @@ def read_SnapPea_file(file_name=None, data = None):
     perm_match = r"\s*([0123]{4,4})\s+([0123]{4,4})\s+([0123]{4,4})\s+([0123]{4,4})\s*$"
     snappea_re = re.compile(neighbors_match + perm_match, re.MULTILINE)
 
-    fake_tets =[]
+    fake_tets = []
 
     curr_poss = 0
     while 1:
@@ -46,7 +46,7 @@ def read_SnapPea_file(file_name=None, data = None):
             curr_poss = m.end(8)
     return fake_tets
 
-#------------End function SnapPea to Mcomplex--------------------
+# ------------End function SnapPea to Mcomplex--------------------
 
 
 # Exports an Mcomplex in SnapPea 2.0 format.
@@ -99,8 +99,19 @@ def write_SnapPea_file(mcomplex, fileobject):
             else:
                 out("-1 ")
         out("\n")
-        for i in range(4):
-            out("0 0 0 0  0 0 0 0   0 0 0 0   0 0 0 0\n")
+        if hasattr(tet, 'PeripheralCurves'):
+            for curve in tet.PeripheralCurves:
+                for sheet in curve:
+                    for v in ZeroSubsimplices:
+                        for f in TwoSubsimplices:
+                            out("%d " % sheet[v][f])
+                        if v == V3:
+                            out("\n")
+                        else:
+                            out("  ")
+        else:
+            for i in range(4):
+                out("0 0 0 0  0 0 0 0   0 0 0 0   0 0 0 0\n")
         out("0.0 0.0\n\n")
 
 
@@ -116,6 +127,7 @@ conv_back = {V0: "u", V1 : "v", V2 : "w", V3: "x"}
 # starts his indexing of tets at 1 and Jeff starts at 0,
 # we subtract 1.
 
+
 def read_edge(edge):
     m = re.match("([0-9]+)([uvwx])([uvwx])", edge)
     return (int(m.group(1)) - 1, conv[m.group(2)], conv[m.group(3)])
@@ -124,9 +136,10 @@ def read_edge(edge):
 #  function takes two successive edges in the link and glues the
 #  corresponding tetrahedra together.
 
+
 def read_geo_file(file_name, num_tet=None):
     data = open(file_name).readlines()
-    if num_tet == None:
+    if num_tet is None:
         num_tet = len(data) - 2
     tets = []
     for i in range(num_tet):
@@ -137,14 +150,15 @@ def read_geo_file(file_name, num_tet=None):
         cycle = re.split(r"\s+", line[ : -1])[1 : ]
         for i in range(len(cycle)):
             t1, v1, v2 = read_edge(cycle[i])
-            t2, w1, w2 = read_edge(cycle[(i+1)%len(cycle)]) #Yes, that's w2, w1
+            t2, w1, w2 = read_edge(cycle[(i+1) % len(cycle)])  # Yes, that's w2, w1
             a = eArrow(tets[t1], v1, v2)
             b = eArrow(tets[t2], w1, w2)
             a.glue(b)
 
     return Mcomplex(tets)
 
-#---------Code to go from Mcomplex to Geo---------------------
+# ---------Code to go from Mcomplex to Geo---------------------
+
 
 def write_geo_file(mcomplex, fileobject):
     out = fileobject.write
@@ -168,6 +182,7 @@ def write_geo_file(mcomplex, fileobject):
         i = i + 1
         out("\n")
 
+
 # writing a file for Matveev's program Spine
 
 def write_spine_file(mcomplex, fileobject):
@@ -183,19 +198,12 @@ def write_spine_file(mcomplex, fileobject):
             back_local_faces.append(comp(A.head()))
             A.next()
 
-
-        signs = [1 if (tets[i], local_faces[i]) < (tets[(i + 1) % n], back_local_faces[(i + 1)%n]) else -1 for i in range(n)]
-        ans= repr([signs[i]*global_faces[i] for i in range(n)])[1:-1].replace(",", "")
+        signs = [1 if (tets[i], local_faces[i]) < (tets[(i + 1) % n], back_local_faces[(i + 1) % n]) else -1 for i in range(n)]
+        ans = repr([signs[i]*global_faces[i] for i in range(n)])[1:-1].replace(",", "")
         out(ans + "\n")
 
 
-
-
-
-
-
-
-__all__  = ('read_SnapPea_file',
+__all__ = ('read_SnapPea_file',
             'write_SnapPea_file',
             'read_geo_file',
             'write_geo_file',

snappy/snap/t3mlite/homology.py

@@ -1,15 +1,17 @@
 from .simplex import *
 from .linalg import Matrix
 
+
 def boundary_three(manifold):
-    F, T = len(manifold.Faces), len(manifold.Tetrahedra) 
+    F, T = len(manifold.Faces), len(manifold.Tetrahedra)
     ans = Matrix(F, T)
     for F in manifold.Faces:
-        t0, t1 = [C.Tetrahedron.Index for C in F.Corners]
-        ans[F.Index, t0] +=  1
+        t0, t1 = (C.Tetrahedron.Index for C in F.Corners)
+        ans[F.Index, t0] += 1
         ans[F.Index, t1] += -1
     return ans
 
+
 def boundary_two(manifold):
     VerticesOfFace = { F0 : (V1, V2, V3), F1 : (V0, V3, V2), F2 : (V0, V1, V3), F3 :
                        (V0, V2, V1) }
@@ -17,27 +19,29 @@ def boundary_two(manifold):
     E, F = len(manifold.Edges), len(manifold.Faces)
     ans = Matrix(E, F)
     for F in manifold.Faces:
-        C  = F.Corners[0]
+        C = F.Corners[0]
         tet = C.Tetrahedron
-        vertices =  VerticesOfFace[C.Subsimplex]
+        vertices = VerticesOfFace[C.Subsimplex]
         for i in range(3):
-            a, b = vertices[i], vertices[(i + 1)%3]
+            a, b = vertices[i], vertices[(i + 1) % 3]
             e = tet.Class[a | b]
             ans[e.index(), F.Index] += e.orientation_with_respect_to(tet, a, b)
-    return ans 
+    return ans
+
 
 def boundary_one(manifold):
     V, E = len(manifold.Vertices), len(manifold.Edges)
     ans = Matrix(V, E)
     for e in manifold.Edges:
-        v_init, v_term = [v.Index for v in e.Vertices]
+        v_init, v_term = (v.Index for v in e.Vertices)
         ans[v_term, e.Index] += 1
         ans[v_init, e.Index] += -1
     return ans
 
+
 def boundary_maps(manifold):
     """
-    The boundary maps in the homology chain complex of the 
+    The boundary maps in the homology chain complex of the
     underlying cell-complex of a Mcomplex.
 
     >>> M = Mcomplex('o9_12345')
@@ -45,5 +49,5 @@ def boundary_maps(manifold):
     True
     """
     B1, B2, B3 = boundary_one(manifold), boundary_two(manifold), boundary_three(manifold)
-    assert B1*B2 == 0 and B2*B3 == 0 
+    assert B1*B2 == 0 and B2*B3 == 0
     return B1, B2, B3