theano/compile/builders.py
def inline_ofg_expansion(node):
    """
    This optimization expands internal graph of OpFromGraph.
    Only performed if node.op.is_inline == True
    Doing so can improve optimization at the cost of compilation speed.
    """
    op = node.op
    if not isinstance(op, OpFromGraph):
        return False
    if not op.is_inline:
        return False
    return theano.clone(
        op.local_outputs, {
            u: v for u, v in izip(
                node.op.local_inputs, node.inputs)})

    This optimization expands internal graph of OpFromGraph.
    Only performed if node.op.is_inline == True
    Doing so can improve optimization at the cost of compilation speed.
    
This optimization expands internal graph of OpFromGraph.
Only performed if node.op.is_inline == True
Doing so can improve optimization at the cost of compilation speed.
This optimization expands internal graph of OpFromGraph . Only performed if node . op . is_inline == True Doing so can improve optimization at the cost of compilation speed .
def inline_ofg_expansion(node):
    op = node.op
    if not isinstance(op, OpFromGraph):
        return False
    if not op.is_inline:
        return False
    return theano.clone(
        op.local_outputs, {
            u: v for u, v in izip(
                node.op.local_inputs, node.inputs)})
def inline_ofg_expansion ( node ) : op = node . op if not isinstance ( op , OpFromGraph ) : return False if not op . is_inline : return False return theano . clone ( op . local_outputs , { u : v for u , v in izip ( node . op . local_inputs , node . inputs ) } )
This optimization expands internal graph of OpFromGraph.
This optimization expands internal graph of OpFromGraph .
"""
    This optimization expands internal graph of OpFromGraph.
    Only performed if node.op.is_inline == True
    Doing so can improve optimization at the cost of compilation speed.
    """
node