Datasets:
thisisanshgupta
/
Pycode

Dataset card Data Studio Files
xet
 Community
text
stringlengths
0
828
for graphviz API
""""""
graph = tree_to_graph(tree)
path = None
if dotfile: # first save the dot file.
path = graph.save(dotfile)
if render: # secondly, show it.
# As the dot file is known by the Graph object,
# it will be placed around the dot file.
graph.view()
return path"
4412,"def tree_to_graph(bbltree:BubbleTree) -> Graph or Digraph:
""""""Compute as a graphviz.Graph instance the given graph.
If given BubbleTree instance is oriented, returned value
is a graphviz.Digraph.
See http://graphviz.readthedocs.io/en/latest/examples.html#cluster-py
for graphviz API
""""""
GraphObject = Digraph if bbltree.oriented else Graph
def create(name:str):
""""""Return a graphviz graph figurating a powernode""""""
ret = GraphObject('cluster_' + name)
# dirty hack to get links between clusters: add a blank node inside
# so the subgraph don't take it's name directly, but the blank node do.
# ret.body.append('label = ""{}""'.format(name)) # replaced by:
ret.node(name, style='invis', shape='point')
# ret.body.append('style=plaintext')
ret.body.append('color=lightgrey')
ret.body.append('label=""""')
ret.body.append('shape=ellipse')
ret.body.append('penwidth=2')
ret.body.append('pencolor=black')
return ret
nodes = frozenset(bbltree.nodes())
subgraphs = {}
# build for each powernode the associated subgraph, and add its successors
for powernode in bbltree.powernodes():
if powernode not in subgraphs:
subgraphs[powernode] = create(powernode)
for succ in bbltree.inclusions[powernode]:
if succ not in subgraphs:
if succ not in nodes:
subgraphs[succ] = create(succ)
else:
subgraphs[powernode].node(succ)
# add to Graph instances the Graph of successors as subgraphs
for powernode, succs in bbltree.inclusions.items():
for succ in succs:
if succ not in nodes:
subgraphs[powernode].subgraph(subgraphs[succ])
# build the final graph by adding to it subgraphs of roots
graph = GraphObject('graph', graph_attr={'compound': 'true'})
for root in bbltree.roots:
if root in subgraphs:
graph.subgraph(subgraphs[root])
# add the edges to the final graph
for source, targets in bbltree.edges.items():
for target in targets:
if source <= target:
attrs = {}
if source not in nodes:
attrs.update({'ltail': 'cluster_' + source})
if target not in nodes:
attrs.update({'lhead': 'cluster_' + target})
graph.edge(source, target, **attrs)
# print(graph) # debug line
# graph.view() # debug line
return graph"
4413,"def fill(self, term_dict, terms):
# type: (Dict[int, Set[Type[Rule]]], Any) -> None
""""""
Fill first row of the structure witch nonterminal directly rewritable to terminal.
:param term_dict: Dictionary of rules directly rewritable to terminal.
Key is hash of terminal, value is set of rules with key terminal at the right side.
:param terms: Input sequence of terminal.
""""""
for i in range(len(terms)):
t = terms[i]
self._field[0][i] += term_dict[hash(t)]"
4414,"def rules(self, x, y):
# type: (int, int) -> List[Type[Rule]]
""""""
Get rules at specific position in the structure.
:param x: X coordinate
:param y: Y coordinate
:return: List of rules
""""""
return [r for r in self._field[y][x]]"
4415,"def positions(self, x, y):
# type: (int, int) -> List[(Point, Point)]
""""""
Get all positions, that can be combined to get word parsed at specified position.
:param x: X coordinate.
:param y: Y coordinate.
:return: List of tuples with two Point instances.
""""""