topologicpy 0.7.5__py3-none-any.whl → 0.7.6__py3-none-any.whl

topologicpy/Vertex.py

@@ -35,7 +35,7 @@ except:
 
 class Vertex():
     @staticmethod
-    def AreCollinear(vertices: list, tolerance: float = 0.0001):
+    def AreCollinear(vertices: list, mantissa: int = 6, tolerance: float = 0.0001):
         """
         Returns True if the input list of vertices form a straight line. Returns False otherwise.
 
@@ -43,6 +43,8 @@ class Vertex():
         ----------
         vertices : list
             The input list of vertices.
+        mantissa : int , optional
+            The desired length of the mantissa. The default is 6.
         tolerance : float, optional
             The desired tolerance. The default is 0.0001.
 
@@ -57,9 +59,9 @@ class Vertex():
         from topologicpy.Vector import Vector
         import sys
         def areCollinear(vertices, tolerance=0.0001):
-            point1 = [Vertex.X(vertices[0]), Vertex.Y(vertices[0]), Vertex.Z(vertices[0])]
-            point2 = [Vertex.X(vertices[1]), Vertex.Y(vertices[1]), Vertex.Z(vertices[1])]
-            point3 = [Vertex.X(vertices[2]), Vertex.Y(vertices[2]), Vertex.Z(vertices[2])]
+            point1 = Vertex.Coordinates(vertices[0], mantissa=mantissa)
+            point2 = Vertex.Coordinates(vertices[1], mantissa=mantissa)
+            point3 = Vertex.Coordinates(vertices[2], mantissa=mantissa)
 
             vector1 = [point2[0] - point1[0], point2[1] - point1[1], point2[2] - point1[2]]
             vector2 = [point3[0] - point1[0], point3[1] - point1[1], point3[2] - point1[2]]
@@ -306,7 +308,7 @@ class Vertex():
         return vertex
     
     @staticmethod
-    def Centroid(vertices):
+    def Centroid(vertices: list, mantissa: int = 6):
         """
         Returns the centroid of the input list of vertices.
 
@@ -314,6 +316,8 @@ class Vertex():
         -----------
         vertices : list
             The input list of vertices
+        mantissa : int , optional
+            The desired length of the mantissa. The default is 6.
 
         Return
         ----------
@@ -332,9 +336,9 @@ class Vertex():
             return None
         if len(vertices) == 1:
             return vertices[0]
-        cx = sum(Vertex.X(v) for v in vertices) / len(vertices)
-        cy = sum(Vertex.Y(v) for v in vertices) / len(vertices)
-        cz = sum(Vertex.Z(v) for v in vertices) / len(vertices)
+        cx = sum(Vertex.X(v, mantissa=mantissa) for v in vertices) / len(vertices)
+        cy = sum(Vertex.Y(v, mantissa=mantissa) for v in vertices) / len(vertices)
+        cz = sum(Vertex.Z(v, mantissa=mantissa) for v in vertices) / len(vertices)
         return Vertex.ByCoordinates(cx, cy, cz)
     
     @staticmethod
@@ -379,9 +383,9 @@ class Vertex():
 
         if not Topology.IsInstance(vertex, "Vertex"):
             return None
-        x = round(vertex.X(), mantissa)
-        y = round(vertex.Y(), mantissa)
-        z = round(vertex.Z(), mantissa)
+        x = Vertex.X(vertex, mantissa)
+        y = Vertex.Y(vertex, mantissa)
+        z = Vertex.Z(vertex, mantissa)
         matrix = [[1, 0, 0, x],
                 [0, 1, 0, y],
                 [0, 0, 1, z],
@@ -402,7 +406,7 @@ class Vertex():
         return output
 
     @staticmethod
-    def CounterClockwise2D(vertices):
+    def CounterClockwise2D(vertices: list, mantissa: int = 6):
         """
         Sorts the input list of vertices in a counterclockwise fashion. This method assumes that the vertices are on the XY plane. The Z coordinate is ignored.
 
@@ -410,6 +414,8 @@ class Vertex():
         -----------
         vertices : list
             The input list of vertices
+        mantissa : int , optional
+            The desired length of the mantissa. The default is 6.
 
         Return
         -----------
@@ -417,10 +423,22 @@ class Vertex():
             The input list of vertices sorted in a counter clockwise fashion
         
         """
+        from topologicpy.Topology import Topology
         import math
+
+        if not isinstance(vertices, list):
+            print("Vertex.CounterClockwise2D - Error: The input vertices parameter is not a valid list. Returning None.")
+            return None
+        vertices = [v for v in vertices if Topology.IsInstance(v, "Vertex")]
+        if len(vertices) < 1:
+            print("Vertex.CounterClockwise2D - Error: The input vertices parameter does not contain any valid vertices. Returning None.")
+            return None
+        if len(vertices) == 1:
+            return vertices[0]
+        
         # find the centroid of the points
-        cx = sum(Vertex.X(v) for v in vertices) / len(vertices)
-        cy = sum(Vertex.Y(v) for v in vertices) / len(vertices)
+        cx = sum(Vertex.X(v, mantissa=mantissa) for v in vertices) / len(vertices)
+        cy = sum(Vertex.Y(v, mantissa=mantissa) for v in vertices) / len(vertices)
 
         # sort the points based on their angle with respect to the centroid
         vertices.sort(key=lambda v: (math.atan2(Vertex.Y(v) - cy, Vertex.X(v) - cx) + 2 * math.pi) % (2 * math.pi))
@@ -457,8 +475,7 @@ class Vertex():
 
 
     @staticmethod
-    def Distance(vertex, topology, includeCentroid: bool =True,
-                 mantissa: int = 6) -> float:
+    def Distance(vertex, topology, includeCentroid: bool =True, mantissa: int = 6) -> float:
         """
         Returns the distance between the input vertex and the input topology. This method returns the distance to the closest sub-topology in the input topology, optionally including its centroid.
 
@@ -527,16 +544,16 @@ class Vertex():
             return distance
         
         def distance_to_vertex(vertexA, vertexB):
-            a = (Vertex.X(vertexA), Vertex.Y(vertexA), Vertex.Z(vertexA))
-            b = (Vertex.X(vertexB), Vertex.Y(vertexB), Vertex.Z(vertexB))
+            a = (Vertex.X(vertexA, mantissa=mantissa), Vertex.Y(vertexA, mantissa=mantissa), Vertex.Z(vertexA, mantissa=mantissa))
+            b = (Vertex.X(vertexB, mantissa=mantissa), Vertex.Y(vertexB, mantissa=mantissa), Vertex.Z(vertexB, mantissa=mantissa))
             return distance_point_to_point(a, b)
         
         def distance_to_edge(vertex, edge):
-            a = (Vertex.X(vertex), Vertex.Y(vertex), Vertex.Z(vertex))
+            a = (Vertex.X(vertex, mantissa=mantissa), Vertex.Y(vertex, mantissa=mantissa), Vertex.Z(vertex, mantissa=mantissa))
             sv = Edge.StartVertex(edge)
             ev = Edge.EndVertex(edge)
-            svp = (Vertex.X(sv), Vertex.Y(sv), Vertex.Z(sv))
-            evp = (Vertex.X(ev), Vertex.Y(ev), Vertex.Z(ev))
+            svp = (Vertex.X(sv, mantissa=mantissa), Vertex.Y(sv, mantissa=mantissa), Vertex.Z(sv, mantissa=mantissa))
+            evp = (Vertex.X(ev, mantissa=mantissa), Vertex.Y(ev, mantissa=mantissa), Vertex.Z(ev, mantissa=mantissa))
             return distance_point_to_line(a,svp, evp)
         
         def distance_to_face(vertex, face, includeCentroid):
@@ -554,7 +571,7 @@ class Vertex():
             b = dic["b"]
             c = dic["c"]
             d = dic["d"]
-            x1, y1, z1 = Vertex.Coordinates(vertex)
+            x1, y1, z1 = Vertex.Coordinates(vertex, mantissa=mantissa)
             d = abs((a * x1 + b * y1 + c * z1 + d))
             e = (math.sqrt(a * a + b * b + c * c))
             if e == 0:
@@ -598,7 +615,7 @@ class Vertex():
             return None
     
     @staticmethod
-    def EnclosingCell(vertex, topology, exclusive: bool = True, tolerance: float = 0.0001) -> list:
+    def EnclosingCell(vertex, topology, exclusive: bool = True, mantissa: int = 6, tolerance: float = 0.0001) -> list:
         """
         Returns the list of Cells found in the input topology that enclose the input vertex.
 
@@ -610,6 +627,8 @@ class Vertex():
             The input topology.
         exclusive : bool , optional
             If set to True, return only the first found enclosing cell. The default is True.
+        mantissa : int , optional
+            The desired length of the mantissa. The default is 6.
         tolerance : float , optional
             The tolerance for computing if the input vertex is enclosed in a cell. The default is 0.0001.
 
@@ -629,16 +648,15 @@ class Vertex():
             y = []
             z = []
             for aVertex in vertices:
-                x.append(aVertex.X())
-                y.append(aVertex.Y())
-                z.append(aVertex.Z())
+                x.append(Vertex.X(aVertex, mantissa=mantissa))
+                y.append(Vertex.Y(aVertex, mantissa=mantissa))
+                z.append(Vertex.Z(aVertex, mantissa=mantissa))
             return ([min(x), min(y), min(z), max(x), max(y), max(z)])
         
         if Topology.IsInstance(topology, "Cell"):
             cells = [topology]
         elif Topology.IsInstance(topology, "Cluster") or Topology.IsInstance(topology, "CellComplex"):
-            cells = []
-            _ = topology.Cells(None, cells)
+            cells = Topology.Cells(topology)
         else:
             return None
         if len(cells) < 1:
@@ -646,7 +664,7 @@ class Vertex():
         enclosingCells = []
         for i in range(len(cells)):
             bbox = boundingBox(cells[i])
-            if ((vertex.X() < bbox[0]) or (vertex.Y() < bbox[1]) or (vertex.Z() < bbox[2]) or (vertex.X() > bbox[3]) or (vertex.Y() > bbox[4]) or (vertex.Z() > bbox[5])) == False:
+            if ((Vertex.X(vertex, mantissa=mantissa) < bbox[0]) or (Vertex.Y(vertex, mantissa=mantissa) < bbox[1]) or (Vertex.Z(vertex, mantissa=mantissa) < bbox[2]) or (Vertex.X(vertex, mantissa=mantissa) > bbox[3]) or (Vertex.Y(vertex, mantissa=mantissa) > bbox[4]) or (Vertex.Z(vertex, mantissa=mantissa) > bbox[5])) == False:
                 if Vertex.IsInternal(vertex, cells[i], tolerance=tolerance):
                     if exclusive:
                         return([cells[i]])
@@ -770,7 +788,7 @@ class Vertex():
         return None
 
     @staticmethod
-    def InterpolateValue(vertex, vertices, n=3, key="intensity", tolerance=0.0001):
+    def InterpolateValue(vertex, vertices: list, n: int = 3, key: str = "intensity", mantissa: int = 6, tolerance: float = 0.0001):
         """
         Interpolates the value of the input vertex based on the values of the *n* nearest vertices.
 
@@ -784,6 +802,8 @@ class Vertex():
             The maximum number of nearest vertices to consider. The default is 3.
         key : str , optional
             The key that holds the value to be interpolated in the dictionaries of the vertices. The default is "intensity".
+        mantissa : int , optional
+            The desired length of the mantissa. The default is 6.
         tolerance : float , optional
             The tolerance for computing if the input vertex is coincident with another vertex in the input list of vertices. The default is 0.0001.
 
@@ -860,14 +880,14 @@ class Vertex():
         if len(vertices) == 0:
             return None
         
-        point = (Vertex.X(vertex), Vertex.Y(vertex), Vertex.Z(vertex))
+        point = (Vertex.X(vertex, mantissa=mantissa), Vertex.Y(vertex, mantissa=mantissa), Vertex.Z(vertex, mantissa=mantissa))
         data_points = []
         for v in vertices:
             d = Topology.Dictionary(v)
             value = Dictionary.ValueAtKey(d, key)
             if not value == None:
                 if type(value) == int or type(value) == float:
-                    data_points.append((Vertex.X(v), Vertex.Y(v), Vertex.Z(v), value))
+                    data_points.append((Vertex.X(v, mantissa=mantissa), Vertex.Y(v, mantissa=mantissa), Vertex.Z(v, mantissa=mantissa), value))
         if len(data_points) == 0:
             return None
         if n > len(data_points):
@@ -1155,7 +1175,7 @@ class Vertex():
         return False
     
     @staticmethod
-    def NearestVertex(vertex, topology, useKDTree: bool = True):
+    def NearestVertex(vertex, topology, useKDTree: bool = True, mantissa: int = 6):
         """
         Returns the vertex found in the input topology that is the nearest to the input vertex.
 
@@ -1167,7 +1187,9 @@ class Vertex():
             The input topology to be searched for the nearest vertex.
         useKDTree : bool , optional
             if set to True, the algorithm will use a KDTree method to search for the nearest vertex. The default is True.
-
+        mantissa : int , optional
+            The desired length of the mantissa. The default is 6.
+        
         Returns
         -------
         topologic_core.Vertex
@@ -1178,8 +1200,8 @@ class Vertex():
 
         def SED(a, b):
             """Compute the squared Euclidean distance between X and Y."""
-            p1 = (a.X(), a.Y(), a.Z())
-            p2 = (b.X(), b.Y(), b.Z())
+            p1 = (Vertex.X(a, mantissa=mantissa), Vertex.Y(a, mantissa=mantissa), Vertex.Z(a, mantissa=mantissa))
+            p2 = (Vertex.X(b, mantissa=mantissa), Vertex.Y(b, mantissa=mantissa), Vertex.Z(b, mantissa=mantissa))
             return sum((i-j)**2 for i, j in zip(p1, p2))
         
         BT = collections.namedtuple("BT", ["value", "left", "right"])
@@ -1188,19 +1210,19 @@ class Vertex():
         right-subtrees.
         """
         def firstItem(v):
-            return v.X()
+            return Vertex.X(v, mantissa=mantissa)
         def secondItem(v):
-            return v.Y()
+            return Vertex.Y(v, mantissa=mantissa)
         def thirdItem(v):
-            return v.Z()
+            return Vertex.Z(v, mantissa=mantissa)
 
         def itemAtIndex(v, index):
             if index == 0:
-                return v.X()
+                return Vertex.X(v, mantissa=mantissa)
             elif index == 1:
-                return v.Y()
+                return Vertex.Y(v, mantissa=mantissa)
             elif index == 2:
-                return v.Z()
+                return Vertex.Z(v, mantissa=mantissa)
 
         def sortList(vertices, index):
             if index == 0:

topologicpy/Wire.py

@@ -143,7 +143,7 @@ class Wire(Topology):
         return arc
     
     @staticmethod
-    def BoundingRectangle(topology, optimize: int = 0, tolerance=0.0001):
+    def BoundingRectangle(topology, optimize: int = 0, mantissa: int = 6, tolerance=0.0001):
         """
         Returns a wire representing a bounding rectangle of the input topology. The returned wire contains a dictionary with key "zrot" that represents rotations around the Z axis. If applied the resulting wire will become axis-aligned.
 
@@ -153,6 +153,8 @@ class Wire(Topology):
             The input topology.
         optimize : int , optional
             If set to an integer from 1 (low optimization) to 10 (high optimization), the method will attempt to optimize the bounding rectangle so that it reduces its surface area. The default is 0 which will result in an axis-aligned bounding rectangle. The default is 0.
+        mantissa : int , optional
+            The desired length of the mantissa. The default is 6.
         tolerance : float , optional
             The desired tolerance. The default is 0.0001.
         
@@ -177,8 +179,8 @@ class Wire(Topology):
             x = []
             y = []
             for aVertex in vertices:
-                x.append(aVertex.X())
-                y.append(aVertex.Y())
+                x.append(Vertex.X(aVertex, mantissa=mantissa))
+                y.append(Vertex.Y(aVertex, mantissa=mantissa))
             minX = min(x)
             minY = min(y)
             maxX = max(x)
@@ -205,7 +207,7 @@ class Wire(Topology):
         w = Wire.ByVertices(vList)
         f = Face.ByWire(w, tolerance=tolerance)
         f_origin = Topology.Centroid(f)
-        normal = Face.Normal(f)
+        normal = Face.Normal(f, mantissa=mantissa)
         topology = Topology.Flatten(topology, origin=f_origin, direction=normal)
         
         boundingRectangle = br(topology)
@@ -757,7 +759,7 @@ class Wire(Topology):
         return new_wire
 
     @staticmethod
-    def ConvexHull(topology, tolerance: float = 0.0001):
+    def ConvexHull(topology, mantissa: int = 6, tolerance: float = 0.0001):
         """
         Returns a wire representing the 2D convex hull of the input topology. The vertices of the topology are assumed to be coplanar.
 
@@ -765,6 +767,8 @@ class Wire(Topology):
         ----------
         topology : topologic_core.Topology
             The input topology.
+        mantissa : int , optional
+            The desired length of the mantissa. The default is 6.
         tolerance : float , optional
             The desired tolerance. The default is 0.0001.
                 
@@ -875,13 +879,13 @@ class Wire(Topology):
             w = Wire.ByVertices(v)
             f = Face.ByWire(w, tolerance=tolerance)
             origin = Topology.Centroid(f)
-            normal = Face.Normal(f)
+            normal = Face.Normal(f, mantissa=mantissa)
             f = Topology.Flatten(f, origin=origin, direction=normal)
         topology = Topology.Flatten(topology, origin=origin, direction=normal)
         vertices = Topology.Vertices(topology)
         points = []
         for v in vertices:
-            points.append((Vertex.X(v), Vertex.Y(v)))
+            points.append((Vertex.X(v, mantissa=mantissa), Vertex.Y(v, mantissa=mantissa)))
         hull = convex_hull(points, len(points))
         hull_vertices = []
         for p in hull:
@@ -1031,7 +1035,7 @@ class Wire(Topology):
         return edges
 
     @staticmethod
-    def Einstein(origin= None, radius: float = 0.5, direction: list = [0, 0, 1], placement: str = "center"):
+    def Einstein(origin= None, radius: float = 0.5, direction: list = [0, 0, 1], placement: str = "center", mantissa: int = 6):
         """
         Creates an aperiodic monotile, also called an 'einstein' tile (meaning one tile in German, not the name of the famous physist). See https://arxiv.org/abs/2303.10798
 
@@ -1045,11 +1049,18 @@ class Wire(Topology):
             The vector representing the up direction of the ellipse. The default is [0, 0, 1].
         placement : str , optional
             The description of the placement of the origin of the hexagon determining the location of the tile. This can be "center", or "lowerleft". It is case insensitive. The default is "center".
-        
+        mantissa : int , optional
+            The desired length of the mantissa. The default is 6.
+        Returns
+        -------
+        topologic_core.Wire
+            The created wire.
+
         """
         from topologicpy.Vertex import Vertex
         from topologicpy.Topology import Topology
         import math
+
         def cos(angle):
             return math.cos(math.radians(angle))
         def sin(angle):
@@ -1074,9 +1085,9 @@ class Wire(Topology):
         
         if placement.lower() == "lowerleft":
             einstein = Topology.Translate(einstein, radius, d, 0)
-        dx = Vertex.X(origin)
-        dy = Vertex.Y(origin)
-        dz = Vertex.Z(origin)
+        dx = Vertex.X(origin, mantissa=mantissa)
+        dy = Vertex.Y(origin, mantissa=mantissa)
+        dz = Vertex.Z(origin, mantissa=mantissa)
         einstein = Topology.Translate(einstein, dx, dy, dz)
         if direction != [0, 0, 1]:
             einstein = Topology.Orient(einstein, origin=origin, dirA=[0, 0, 1], dirB=direction)

topologicpy/version.py

@@ -1 +1 @@
-__version__ = '0.7.5'
+__version__ = '0.7.6'

{topologicpy-0.7.5.dist-info → topologicpy-0.7.6.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: topologicpy
-Version: 0.7.5
+Version: 0.7.6
 Summary: An Advanced Spatial Modelling and Analysis Software Library for Architecture, Engineering, and Construction.
 Author-email: Wassim Jabi <wassim.jabi@gmail.com>
 License: GNU AFFERO GENERAL PUBLIC LICENSE

topologicpy-0.7.6.dist-info/RECORD

@@ -0,0 +1,33 @@
+topologicpy/Aperture.py,sha256=p9pUzTQSBWoUaDiug1V1R1hnEIEwYSXFg2t7iRAmNRY,2723
+topologicpy/Cell.py,sha256=vaOq9wpkrsfOuLiGnrWFsJAmqNXkIsRnsEtvsDutZjQ,98858
+topologicpy/CellComplex.py,sha256=TcvDtN_ma66lMTpTyM-mRxoEhX9dS71Vei9eVvaPrkk,46679
+topologicpy/Cluster.py,sha256=HvomWm_V4bx76YMxqOEhAUrsvcU6z5e_zry6WxMuV2M,54819
+topologicpy/Color.py,sha256=UlmRcCSOhqcM_OyMWz4t3Kr75KcgXDhz3uctAJ2n7Ic,18031
+topologicpy/Context.py,sha256=ppApYKngZZCQBFWaxIMi2z2dokY23c935IDCBosxDAE,3055
+topologicpy/DGL.py,sha256=RpkLnAzjg6arY7cEMs2pDFYzRdkerVg1Wbm9hcE3QaM,138991
+topologicpy/Dictionary.py,sha256=pMbfE2RYGCNpVr2x58qiHRc-aBWnp1jLlyzwS9nz6-w,25891
+topologicpy/Edge.py,sha256=KCQm9QfwjsYO4yKE4p4elpha9c4MY6EWAEaK_6mTAjo,52239
+topologicpy/EnergyModel.py,sha256=ni0H1JgvLl1-q90yK9Sm1qj5P1fTuidlimEIcwuj6qE,53287
+topologicpy/Face.py,sha256=uPVVFF6CLzEW2JaTllQJp7nBsS2w3wAz7qwfujWTQAk,97474
+topologicpy/Graph.py,sha256=pw1nG4z1CZJshA7dACPRUHvOkAyQ6pV1U758MU0Z9xM,369948
+topologicpy/Grid.py,sha256=9izbPCocfS0SoI31_D5lUFlzTYwFPHJAfBhYQ1CyPqE,17770
+topologicpy/Helper.py,sha256=07V9IFu5ilMpvAdZVhIbdBOjBJSRTtJ0BfR1IoRaRXU,17743
+topologicpy/Honeybee.py,sha256=dlr5OEH93q51ZmEgvi8PXGfCHBDAjIZ1cm38Rft1Bz4,20235
+topologicpy/Matrix.py,sha256=VV-kbT0Qt5QO38HRFJmD4IMnQUzYbLjBF4xaFAqLh3Q,8352
+topologicpy/Neo4j.py,sha256=hNtKWzjb8dQvV2MARDyqW7OInn2LWNiVaA5JmcJl9RM,19569
+topologicpy/Plotly.py,sha256=IYyUIlLYn8YrjPnxXo4SkRzyrI3hVM9dtMZyA3KfWJ8,98845
+topologicpy/Polyskel.py,sha256=MYHKFOQBlUNqoUhAdOcKRIHpSk0dWWVrZgXK34NkvFM,15936
+topologicpy/Shell.py,sha256=uPf5Ch8wQ-pbKvXMY_DV9tPXyz4BPmofFVYdIzbWFh4,76960
+topologicpy/Speckle.py,sha256=rUS6PCaxIjEF5_fUruxvMH47FMKg-ohcoU0qAUb-yNM,14267
+topologicpy/Sun.py,sha256=3tYb8kssU882lE1gEWg2mxDvCCY_LAVElkyUT6wa-ZU,36935
+topologicpy/Topology.py,sha256=SymcisEpNIuqpKiBoz7zJrLtS_28R5GDbG-SiwJOirY,308743
+topologicpy/Vector.py,sha256=2OXmty9CKZZzfsg5T4ckml-lPUUvgDvqokcKDsZVN9Y,29806
+topologicpy/Vertex.py,sha256=WjQZf-r8h_Cjwkt_qNN483FCUql20fbv72Ymiq7ZYtw,67462
+topologicpy/Wire.py,sha256=efqePp91BvAdj4JitSW_f-xeGoTFg_AxP5g5pmbBVFw,139047
+topologicpy/__init__.py,sha256=D7ky87CAQMiS2KE6YLvcTLkTgA2PY7rASe6Z23pjp9k,872
+topologicpy/version.py,sha256=d_J-fGYyd_4FzGfbl6boN5XBrvTLiweHV0VC0aFvYVY,22
+topologicpy-0.7.6.dist-info/LICENSE,sha256=TfPDBt3ar0uv_f9cqCDMZ5rIzW3CY8anRRd4PkL6ejs,34522
+topologicpy-0.7.6.dist-info/METADATA,sha256=rZXhsrENM1-_IUT73GdvtHvZc99fdVrTw-F0eNy6TJE,46950
+topologicpy-0.7.6.dist-info/WHEEL,sha256=GJ7t_kWBFywbagK5eo9IoUwLW6oyOeTKmQ-9iHFVNxQ,92
+topologicpy-0.7.6.dist-info/top_level.txt,sha256=J30bDzW92Ob7hw3zA8V34Jlp-vvsfIkGzkr8sqvb4Uw,12
+topologicpy-0.7.6.dist-info/RECORD,,

topologicpy-0.7.5.dist-info/RECORD

@@ -1,33 +0,0 @@
-topologicpy/Aperture.py,sha256=p9pUzTQSBWoUaDiug1V1R1hnEIEwYSXFg2t7iRAmNRY,2723
-topologicpy/Cell.py,sha256=MeVDLetCH3ow0QnY94JpRLe8xhXL9nFXsv5_m6uk8qM,96684
-topologicpy/CellComplex.py,sha256=6BdCjiE3R4Gcm2K04eBzKyP-2ZeABfw4iUgNEuFQjAI,46352
-topologicpy/Cluster.py,sha256=HvomWm_V4bx76YMxqOEhAUrsvcU6z5e_zry6WxMuV2M,54819
-topologicpy/Color.py,sha256=UlmRcCSOhqcM_OyMWz4t3Kr75KcgXDhz3uctAJ2n7Ic,18031
-topologicpy/Context.py,sha256=ppApYKngZZCQBFWaxIMi2z2dokY23c935IDCBosxDAE,3055
-topologicpy/DGL.py,sha256=RpkLnAzjg6arY7cEMs2pDFYzRdkerVg1Wbm9hcE3QaM,138991
-topologicpy/Dictionary.py,sha256=pMbfE2RYGCNpVr2x58qiHRc-aBWnp1jLlyzwS9nz6-w,25891
-topologicpy/Edge.py,sha256=jbJHyPHlLF94RkUKL479B4dPC202K0Xd7bQsPcFwoHc,51296
-topologicpy/EnergyModel.py,sha256=UBLim01lZLikVQmJAHEeja-KvF4tgzTxsSxwNDaezz4,52500
-topologicpy/Face.py,sha256=clf0qf8c0SnzOUOHw11Z4e_Y4ovhRmSOGmPd5_50Fa8,97195
-topologicpy/Graph.py,sha256=GsWySXL-cTd7bl-QWpl3Aw9Hr0KyACzIa4iRenTB63s,368030
-topologicpy/Grid.py,sha256=XM0iQtQbMQoYHf7S0ppSe-dxy93Y9VpI_vUkElWqnYA,17050
-topologicpy/Helper.py,sha256=07V9IFu5ilMpvAdZVhIbdBOjBJSRTtJ0BfR1IoRaRXU,17743
-topologicpy/Honeybee.py,sha256=C0_Ity1CKGZwgOBh_iRypObF2ApQ7nAD5oAEIUGGnvU,19914
-topologicpy/Matrix.py,sha256=VV-kbT0Qt5QO38HRFJmD4IMnQUzYbLjBF4xaFAqLh3Q,8352
-topologicpy/Neo4j.py,sha256=Voj-0xnVJtYPzAPyL05YPb6ynX_2UQx9cyHTrI4r1hE,18860
-topologicpy/Plotly.py,sha256=WK4mtBFEWP_MTl_Dm4K_zNmgTO0PixUWWRB1278vZsw,99569
-topologicpy/Polyskel.py,sha256=MYHKFOQBlUNqoUhAdOcKRIHpSk0dWWVrZgXK34NkvFM,15936
-topologicpy/Shell.py,sha256=6hidTQ6MW5q_es-WbTeI_yt7Sd7BMxWU_qfoherVZhE,74343
-topologicpy/Speckle.py,sha256=rUS6PCaxIjEF5_fUruxvMH47FMKg-ohcoU0qAUb-yNM,14267
-topologicpy/Sun.py,sha256=3tYb8kssU882lE1gEWg2mxDvCCY_LAVElkyUT6wa-ZU,36935
-topologicpy/Topology.py,sha256=VShlTik3ggY4Ch4649p3SGZ8UyXIsQ7t3KQO7bjRN8A,305176
-topologicpy/Vector.py,sha256=FHbrCb9GVLOUV_kqcplh4D88CVxlID6qX_wEQOw4rD0,29565
-topologicpy/Vertex.py,sha256=YgbbCcqABvb97z2-yEytpp5T3yoZPlQplR_vMQkQ9OA,65180
-topologicpy/Wire.py,sha256=MUEboxo11kMgwnZySSkwiyzBG2wv0wPiinf2cW4UVv8,138424
-topologicpy/__init__.py,sha256=D7ky87CAQMiS2KE6YLvcTLkTgA2PY7rASe6Z23pjp9k,872
-topologicpy/version.py,sha256=YGgeu1tBDTiiHbKl1TkbKHeb7CjnrObEQKS9Miv1iBU,22
-topologicpy-0.7.5.dist-info/LICENSE,sha256=TfPDBt3ar0uv_f9cqCDMZ5rIzW3CY8anRRd4PkL6ejs,34522
-topologicpy-0.7.5.dist-info/METADATA,sha256=pTjF0iR8gLPPQ8E7s7A0-fDMrm5vepTlMF88sjztM2M,46950
-topologicpy-0.7.5.dist-info/WHEEL,sha256=GJ7t_kWBFywbagK5eo9IoUwLW6oyOeTKmQ-9iHFVNxQ,92
-topologicpy-0.7.5.dist-info/top_level.txt,sha256=J30bDzW92Ob7hw3zA8V34Jlp-vvsfIkGzkr8sqvb4Uw,12
-topologicpy-0.7.5.dist-info/RECORD,,