tests

Author: tomvanmele

src/compas/datastructures/volmesh/core/halfface.py

@@ -900,7 +900,7 @@ def edge_attribute(self, edge, name, value=None):
         u, v = edge
         if u not in self._plane or v not in self._plane[u]:
             raise KeyError(edge)
-        key = ",".join(map(str, sorted(edge)))
+        key = str(tuple(sorted(edge)))
         if value is not None:
             if key not in self._edge_data:
                 self._edge_data[key] = {}
@@ -934,7 +934,7 @@ def unset_edge_attribute(self, edge, name):
         u, v = edge
         if u not in self._plane or v not in self._plane[u]:
             raise KeyError(edge)
-        key = ",".join(map(str, sorted(edge)))
+        key = str(tuple(sorted(edge)))
         if key in self._edge_data and name in self._edge_data[key]:
             del self._edge_data[key][name]
 
@@ -967,7 +967,7 @@ def edge_attributes(self, edge, names=None, values=None):
         u, v = edge
         if u not in self._plane or v not in self._plane[u]:
             raise KeyError(edge)
-        key = ",".join(map(str, sorted(edge)))
+        key = str(tuple(sorted(edge)))
         if values:
             for name, value in zip(names, values):
                 if key not in self._edge_data:

tests/compas/datastructures/test_graph.py

@@ -23,6 +23,21 @@ def graph():
 # ==============================================================================
 
 
+# def test_edgedata_directionality(graph):
+#     graph.update_default_edge_attributes({'index': 0})
+#     for index, (u, v) in enumerate(graph.edges()):
+#         graph.edge_attribute((u, v), 'index', index)
+#     assert all(graph.edge_attribute((u, v), 'index') != graph.edge_attribute((v, u), 'index') for u, v in graph.edges())
+
+
+def test_edgedata_io(graph):
+    graph.update_default_edge_attributes({'index': 0})
+    for index, (u, v) in enumerate(graph.edges()):
+        graph.edge_attribute((u, v), 'index', index)
+    other = Graph.from_data(graph.data)
+    assert all(other.edge_attribute(edge, 'index') == index for index, edge in enumerate(other.edges()))
+
+
 def test_data_schema(graph):
     if compas.IPY:
         return

tests/compas/datastructures/test_halfedge.py

@@ -40,6 +40,21 @@ def edge_key():
 # ==============================================================================
 
 
+def test_edgedata_nondirectionality(mesh):
+    mesh.update_default_edge_attributes({'index': 0})
+    for index, (u, v) in enumerate(mesh.edges()):
+        mesh.edge_attribute((u, v), 'index', index)
+    assert all(mesh.edge_attribute((u, v), 'index') == mesh.edge_attribute((v, u), 'index') for u, v in mesh.edges())
+
+
+def test_edgedata_io(mesh):
+    mesh.update_default_edge_attributes({'index': 0})
+    for index, (u, v) in enumerate(mesh.edges()):
+        mesh.edge_attribute((u, v), 'index', index)
+    other = HalfEdge.from_data(mesh.data)
+    assert all(other.edge_attribute(edge, 'index') == index for index, edge in enumerate(other.edges()))
+
+
 def test_data_schema(mesh):
     if not compas.IPY:
         mesh.validate_data()