提交 48e862bd authored 作者: lamblin's avatar lamblin

Merge pull request #961 from mrocklin/depends-import

use make_(depends/dependence) rather than old fn
...@@ -162,6 +162,7 @@ def sort_schedule_fn(*cmps): ...@@ -162,6 +162,7 @@ def sort_schedule_fn(*cmps):
See also: See also:
sort_apply_nodes sort_apply_nodes
""" """
dependence = make_dependence_cmp()
cmps = (dependence,) + cmps cmps = (dependence,) + cmps
def schedule(fgraph): def schedule(fgraph):
""" Order nodes in a FunctionGraph """ """ Order nodes in a FunctionGraph """
......
...@@ -166,7 +166,7 @@ class TestWrapLinker(unittest.TestCase): ...@@ -166,7 +166,7 @@ class TestWrapLinker(unittest.TestCase):
def test_sort_schedule_fn(): def test_sort_schedule_fn():
import theano import theano
from theano.gof.sched import sort_schedule_fn, depends from theano.gof.sched import sort_schedule_fn, make_depends
x = theano.tensor.matrix('x') x = theano.tensor.matrix('x')
y = theano.tensor.dot(x[:5]*2, x.T+1).T y = theano.tensor.dot(x[:5]*2, x.T+1).T
str_cmp = lambda a, b: cmp(str(a), str(b)) # lexicographical sort str_cmp = lambda a, b: cmp(str(a), str(b)) # lexicographical sort
...@@ -175,6 +175,7 @@ def test_sort_schedule_fn(): ...@@ -175,6 +175,7 @@ def test_sort_schedule_fn():
f = theano.function((x,), (y,), mode=mode) f = theano.function((x,), (y,), mode=mode)
nodes = f.maker.linker.make_all()[-1] nodes = f.maker.linker.make_all()[-1]
depends = make_depends()
for a, b in zip(nodes[:-1], nodes[1:]): for a, b in zip(nodes[:-1], nodes[1:]):
if not depends((b,a)): if not depends((b,a)):
assert str(a) < str(b) assert str(a) < str(b)
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论