提交 3c6d4240 authored 作者: David Warde-Farley's avatar David Warde-Farley 提交者: Arnaud Bergeron

sys.maxint no longer exists, sys.maxsize works.

上级 030c7b96
...@@ -104,7 +104,7 @@ verify_grad.E_grad = T.verify_grad.E_grad ...@@ -104,7 +104,7 @@ verify_grad.E_grad = T.verify_grad.E_grad
class TestOptimizationMixin(object): class TestOptimizationMixin(object):
def assertFunctionContains(self, f, op, min=1, max=sys.maxint): def assertFunctionContains(self, f, op, min=1, max=sys.maxsize):
toposort = f.maker.fgraph.toposort() toposort = f.maker.fgraph.toposort()
matches = [node for node in toposort if node.op == op] matches = [node for node in toposort if node.op == op]
assert (min <= len(matches) <= max), (toposort, matches, assert (min <= len(matches) <= max), (toposort, matches,
...@@ -119,7 +119,7 @@ class TestOptimizationMixin(object): ...@@ -119,7 +119,7 @@ class TestOptimizationMixin(object):
def assertFunctionContainsN(self, f, op, N): def assertFunctionContainsN(self, f, op, N):
return self.assertFunctionContains(f, op, min=N, max=N) return self.assertFunctionContains(f, op, min=N, max=N)
def assertFunctionContainsClass(self, f, op, min=1, max=sys.maxint): def assertFunctionContainsClass(self, f, op, min=1, max=sys.maxsize):
toposort = f.maker.fgraph.toposort() toposort = f.maker.fgraph.toposort()
matches = [node for node in toposort if isinstance(node.op, op)] matches = [node for node in toposort if isinstance(node.op, op)]
assert (min <= len(matches) <= max), (toposort, matches, assert (min <= len(matches) <= max), (toposort, matches,
......
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论