提交 362e09b3 authored 作者: Arnaud Bergeron's avatar Arnaud Bergeron

Check the right thing to avoid useless recursion in shape_i().

This makes the the problem where the DLT would take over 24h to complete go away.
上级 5e9abd7c
......@@ -445,7 +445,7 @@ def shape_i(var, i, fgraph=None):
shape_of = shape_feature.shape_of
def recur(node):
if not hasattr(node.outputs[0], 'fgraph'):
if not node.outputs[0] in shape_of:
for inp in node.inputs:
if inp.owner:
recur(inp.owner)
......
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论