3pp-mirror/Meshroom
1
0
Fork 0
mirror of https://github.com/alicevision/Meshroom.git synced 2025-04-29 02:08:08 +02:00
Code Issues Projects Releases Packages Wiki Activity

[test] Extra partial serialization tests

Browse source
This commit is contained in:
Yann Lanthony 2025-02-06 16:46:05 +01:00
parent bb20786802
commit 4e29b83226
1 changed files with 61 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

66
tests/test_graphIO.py
View file

@ -13,6 +13,32 @@ class SimpleNode(desc.Node):
] ]
class NodeWithListAttributes(desc.Node):
inputs = [
desc.ListAttribute(
name="listInput",
label="List Input",
description="",
elementDesc=desc.File(name="file", label="File", description="", value=""),
exposed=True,
),
desc.GroupAttribute(
name="group",
label="Group",
description="",
groupDesc=[
desc.ListAttribute(
name="listInput",
label="List Input",
description="",
elementDesc=desc.File(name="file", label="File", description="", value=""),
exposed=True,
),
],
),
]
def compareGraphsContent(graphA: Graph, graphB: Graph) -> bool: def compareGraphsContent(graphA: Graph, graphB: Graph) -> bool:
"""Returns whether the content (node and deges) of two graphs are considered identical. """Returns whether the content (node and deges) of two graphs are considered identical.
@ -26,9 +52,10 @@ def compareGraphsContent(graphA: Graph, graphB: Graph) -> bool:
def _buildEdgesSet(graph: Graph): def _buildEdgesSet(graph: Graph):
return set([(edge.src.fullName, edge.dst.fullName) for edge in graph.edges]) return set([(edge.src.fullName, edge.dst.fullName) for edge in graph.edges])
return _buildNodesSet(graphA) == _buildNodesSet(graphB) and _buildEdgesSet(graphA) == _buildEdgesSet( nodesSetA, edgesSetA = _buildNodesSet(graphA), _buildEdgesSet(graphA)
graphB nodesSetB, edgesSetB = _buildNodesSet(graphB), _buildEdgesSet(graphB)
)
return nodesSetA == nodesSetB and edgesSetA == edgesSetB
class TestImportGraphContent: class TestImportGraphContent:
@ -197,7 +224,7 @@ class TestGraphPartialSerialization:
assert compareGraphsContent(graph, graphA) assert compareGraphsContent(graph, graphA)
assert compareGraphsContent(graphA, graphB) assert compareGraphsContent(graphA, graphB)
def test_serializeSingleNodeWithInputConnection(self): def test_singleNodeWithInputConnectionFromNonSerializedNodeRemovesEdge(self):
graph = Graph("") graph = Graph("")
with registeredNodeTypes([SimpleNode]): with registeredNodeTypes([SimpleNode]):
@ -215,6 +242,36 @@ class TestGraphPartialSerialization:
assert len(otherGraph.nodes) == 1 assert len(otherGraph.nodes) == 1
assert len(otherGraph.edges) == 0 assert len(otherGraph.edges) == 0
def test_serializeSingleNodeWithInputConnectionToListAttributeRemovesListEntry(self):
graph = Graph("")
with registeredNodeTypes([SimpleNode, NodeWithListAttributes]):
nodeA = graph.addNewNode(SimpleNode.__name__)
nodeB = graph.addNewNode(NodeWithListAttributes.__name__)
nodeB.listInput.append("")
graph.addEdge(nodeA.output, nodeB.listInput.at(0))
otherGraph = Graph("")
otherGraph._deserialize(graph.serializePartial([nodeB]))
assert len(otherGraph.node(nodeB.name).listInput) == 0
def test_serializeSingleNodeWithInputConnectionToNestedListAttributeRemovesListEntry(self):
graph = Graph("")
with registeredNodeTypes([SimpleNode, NodeWithListAttributes]):
nodeA = graph.addNewNode(SimpleNode.__name__)
nodeB = graph.addNewNode(NodeWithListAttributes.__name__)
nodeB.group.listInput.append("")
graph.addEdge(nodeA.output, nodeB.group.listInput.at(0))
otherGraph = Graph("")
otherGraph._deserialize(graph.serializePartial([nodeB]))
assert len(otherGraph.node(nodeB.name).group.listInput) == 0
class TestGraphCopy: class TestGraphCopy:
def test_graphCopyIsIdenticalToOriginalGraph(self): def test_graphCopyIsIdenticalToOriginalGraph(self):
@ -240,4 +297,3 @@ class TestGraphCopy:
graphCopy = graph.copy() graphCopy = graph.copy()
assert not compareGraphsContent(graph, graphCopy) assert not compareGraphsContent(graph, graphCopy)