@@ -71,13 +71,13 @@ def incoming_edge_map(self):
7171
7272
7373DagEdge = namedtuple (
74- " DagEdge" ,
74+ ' DagEdge' ,
7575 [
76- " downstream_node" ,
77- " downstream_label" ,
78- " upstream_node" ,
79- " upstream_label" ,
80- " upstream_selector" ,
76+ ' downstream_node' ,
77+ ' downstream_label' ,
78+ ' upstream_node' ,
79+ ' upstream_label' ,
80+ ' upstream_selector' ,
8181 ],
8282)
8383
@@ -137,7 +137,7 @@ def __upstream_hashes(self):
137137
138138 @property
139139 def __inner_hash (self ):
140- props = {" args" : self .args , " kwargs" : self .kwargs }
140+ props = {' args' : self .args , ' kwargs' : self .kwargs }
141141 return get_hash (props )
142142
143143 def __get_hash (self ):
@@ -159,16 +159,16 @@ def __eq__(self, other):
159159
160160 @property
161161 def short_hash (self ):
162- return " {:x}" .format (abs (hash (self )))[:12 ]
162+ return ' {:x}' .format (abs (hash (self )))[:12 ]
163163
164164 def long_repr (self , include_hash = True ):
165- formatted_props = [" {!r}" .format (arg ) for arg in self .args ]
165+ formatted_props = [' {!r}' .format (arg ) for arg in self .args ]
166166 formatted_props += [
167- " {}={!r}" .format (key , self .kwargs [key ]) for key in sorted (self .kwargs )
167+ ' {}={!r}' .format (key , self .kwargs [key ]) for key in sorted (self .kwargs )
168168 ]
169- out = " {}({})" .format (self .name , ", " .join (formatted_props ))
169+ out = ' {}({})' .format (self .name , ', ' .join (formatted_props ))
170170 if include_hash :
171- out += " <{}>" .format (self .short_hash )
171+ out += ' <{}>' .format (self .short_hash )
172172 return out
173173
174174 def __repr__ (self ):
@@ -200,7 +200,7 @@ def visit(
200200 downstream_selector = None ,
201201 ):
202202 if upstream_node in marked_nodes :
203- raise RuntimeError (" Graph is not a DAG" )
203+ raise RuntimeError (' Graph is not a DAG' )
204204
205205 if downstream_node is not None :
206206 outgoing_edge_map = outgoing_edge_maps .get (upstream_node , {})
0 commit comments