提交 f9135eed authored 作者: James Bergstra's avatar James Bergstra

merge

......@@ -214,7 +214,7 @@ def test_badoptimization():
3,
numpy.asarray([[0.,1.,2.],[3.,4.,5.],[6.,7.,8.]]))
except debugmode.BadOptimization, e:
assert str(e.reasons[e.new_r][0][0]) == 'insert_broken_csc'
assert str(e.reason) == 'insert_broken_csc'
return #TEST PASS
assert False
......
......@@ -73,7 +73,10 @@ def test_merge_opt_runtime():
else:
r = x
t = time.time()
f = theano.function([x], r)
f = theano.function([x], r, mode='FAST_COMPILE')
# FAST_RUN does in-place optimizer which requires a lot of toposorting, which is actually
# pretty slow at the moment. This test was designed to test MergeOptimizer... so I'm
# leaving toposort optimizations for a later date.
dt = time.time() - t
assert dt < 5.0 #it should never take longer than 5 seconds to compile this graph
......@@ -13,7 +13,7 @@ from theano import pprint
import numpy
#import scalar_opt
from theano.sandbox.debugmode import DebugMode
from theano.compile.debugmode import DebugMode
from theano import function
......
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论