#NEWLINE# def test_empty_flow_in_nested_flow( self ) : #NEWLINE# #INDENT# flow = lf . Flow ( 'lf' ) #NEWLINE# a = test_utils . ProvidesRequiresTask ( 'a' , provides = [ ] , requires = [ ] ) #NEWLINE# b = test_utils . ProvidesRequiresTask ( 'b' , provides = [ ] , requires = [ ] ) #NEWLINE# flow2 = lf . Flow ( 'lf-2' ) #NEWLINE# c = test_utils . ProvidesRequiresTask ( 'c' , provides = [ ] , requires = [ ] ) #NEWLINE# d = test_utils . ProvidesRequiresTask ( 'd' , provides = [ ] , requires = [ ] ) #NEWLINE# empty_flow = gf . Flow ( 'empty' ) #NEWLINE# flow2 . add ( c , empty_flow , u ) #NEWLINE# flow . add ( a , flow2 , b ) #NEWLINE# g = _replicate_graph_with_names ( compiler . PatternCompiler ( flow ) . compile ( ) ) #NEWLINE# for ( u , v ) in [ ( 'lf' , 'a' ) , ( 'a' , 'lf-2' ) , ( 'lf-2' , 'c' ) , ( 'c' , 'empty' ) , ( 'empty[$]' , 'd' ) , ( 'd' , 'lf-2[$]' ) , ( 'lf-2[$]' , 'b' ) , ( 'b' , 'lf[$]' ) ] : #NEWLINE# #INDENT# self . assertTrue ( g . has_edge ( u , v ) )