Skip to content

Commit

Permalink
rewrite evaluable loops w/ Loop base class (#861)
Browse files Browse the repository at this point in the history
  • Loading branch information
joostvanzwieten committed Mar 26, 2024
2 parents bebe0d7 + de07c59 commit 0286339
Show file tree
Hide file tree
Showing 7 changed files with 412 additions and 320 deletions.
2 changes: 1 addition & 1 deletion nutils/__init__.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
'Numerical Utilities for Finite Element Analysis'

__version__ = version = '9a23'
__version__ = version = '9a24'
version_name = 'jook-sing'
21 changes: 17 additions & 4 deletions nutils/_graph.py
Original file line number Diff line number Diff line change
Expand Up @@ -58,7 +58,7 @@ def generate_graphviz_source(self, *, fill_color: Optional[GraphvizColorCallback
subgraph_children = _collect_subgraphs(self)
id_gen = map(str, itertools.count())
self._collect_graphviz_nodes_edges({}, id_gen, nodes, edges, None, fill_color)
return ''.join(itertools.chain(['digraph {bgcolor="darkgray";'], _generate_graphviz_subgraphs(subgraph_children, nodes, None, id_gen), edges, ['}']))
return ''.join(itertools.chain(['digraph {bgcolor="darkgray";'], _generate_graphviz_subgraphs(subgraph_children, nodes, None, id_gen, 0), edges, ['}']))

def export_graphviz(self, *, fill_color: Optional[GraphvizColorCallback] = None, dot_path: str = 'dot', image_type: str = 'svg') -> None:
src = self.generate_graphviz_source(fill_color=fill_color)
Expand Down Expand Up @@ -156,6 +156,19 @@ def walk(self, seen: MutableSet[Node[Metadata]]) -> Iterator[Node[Metadata]]:
yield from arg.walk(seen)


class TupleNode(RegularNode[Metadata]):

def __init__(self, items: Tuple[Node, ...], metadata: Metadata, subgraph: Optional[Subgraph] = None) -> None:
self.items = items
super().__init__(label='Tuple', args=items, kwargs={}, metadata=metadata, subgraph=subgraph)

def __len__(self) -> int:
return len(self.items)

def __getitem__(self, index: int) -> Node:
return self.items[index]


class DuplicatedLeafNode(Node[Metadata]):

def __init__(self, label: str, metadata: Metadata) -> None:
Expand Down Expand Up @@ -237,9 +250,9 @@ def _generate_asciitree_subgraphs(children: Mapping[Optional[Subgraph], Sequence
yield from _generate_asciitree_subgraphs(children, id_gen_map, child, bridge+('├ ' if i else '└ '), bridge+('│ ' if i else ' '))


def _generate_graphviz_subgraphs(children: Mapping[Optional[Subgraph], Sequence[Subgraph]], nodes: Mapping[Optional[Subgraph], Sequence[str]], subgraph: Optional[Subgraph], id_gen: Iterator[str]) -> Iterator[str]:
def _generate_graphviz_subgraphs(children: Mapping[Optional[Subgraph], Sequence[Subgraph]], nodes: Mapping[Optional[Subgraph], Sequence[str]], subgraph: Optional[Subgraph], id_gen: Iterator[str], depth: int) -> Iterator[str]:
for child in children[subgraph]:
yield 'subgraph cluster{} {{bgcolor="lightgray";color="none";'.format(next(id_gen))
yield from _generate_graphviz_subgraphs(children, nodes, child, id_gen)
yield 'subgraph cluster{} {{bgcolor="{}";color="none";'.format(next(id_gen), 'darkgray' if depth % 2 else 'lightgray')
yield from _generate_graphviz_subgraphs(children, nodes, child, id_gen, depth + 1)
yield '}'
yield from nodes.get(subgraph, ())
Loading

0 comments on commit 0286339

Please sign in to comment.