Skip to content

Commit

Permalink
Does it reduce complexity?
Browse files Browse the repository at this point in the history
  • Loading branch information
tonioo committed Nov 4, 2024
1 parent 2b014ba commit cad731d
Show file tree
Hide file tree
Showing 2 changed files with 10 additions and 10 deletions.
10 changes: 5 additions & 5 deletions neomodel/async_/match.py
Original file line number Diff line number Diff line change
Expand Up @@ -1505,11 +1505,11 @@ async def resolve_subgraph(self) -> list:
for name, node in row.items():
if node.__class__ is self.source and "_" not in name:
root_node = node
else:
if isinstance(node, list) and isinstance(node[0], list):
other_nodes[name] = node[0]
else:
other_nodes[name] = node
continue
if isinstance(node, list) and isinstance(node[0], list):
other_nodes[name] = node[0]
continue
other_nodes[name] = node
results.append(
self._to_subgraph(root_node, other_nodes, qbuilder._ast.subgraph)
)
Expand Down
10 changes: 5 additions & 5 deletions neomodel/sync_/match.py
Original file line number Diff line number Diff line change
Expand Up @@ -1505,11 +1505,11 @@ def resolve_subgraph(self) -> list:
for name, node in row.items():
if node.__class__ is self.source and "_" not in name:
root_node = node
else:
if isinstance(node, list) and isinstance(node[0], list):
other_nodes[name] = node[0]
else:
other_nodes[name] = node
continue
if isinstance(node, list) and isinstance(node[0], list):
other_nodes[name] = node[0]
continue
other_nodes[name] = node
results.append(
self._to_subgraph(root_node, other_nodes, qbuilder._ast.subgraph)
)
Expand Down

0 comments on commit cad731d

Please sign in to comment.