Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
4573a825
提交
4573a825
authored
5月 21, 2008
作者:
Olivier Breuleux
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
cleanup
上级
3d9074ac
全部展开
显示空白字符变更
内嵌
并排
正在显示
4 个修改的文件
包含
12 行增加
和
66 行删除
+12
-66
_test_opt.py
gof/_test_opt.py
+1
-57
_test_toolbox.py
gof/_test_toolbox.py
+9
-8
opt.py
gof/opt.py
+0
-0
utils.py
gof/utils.py
+2
-1
没有找到文件。
gof/_test_opt.py
浏览文件 @
4573a825
...
@@ -247,26 +247,6 @@ class _test_PatternOptimizer(unittest.TestCase):
...
@@ -247,26 +247,6 @@ class _test_PatternOptimizer(unittest.TestCase):
# assert str(g) == "[Op3(x, y)]"
# assert str(g) == "[Op3(x, y)]"
# class _test_PatternDescOptimizer(unittest.TestCase):
# def test_replace_output(self):
# # replacing the whole graph
# x, y, z = inputs()
# e = op1(op2(x, y), z)
# g = env([x, y, z], [e])
# PatternDescOptimizer((Op1, (Op2, '1', '2'), '3'),
# (Op4, '3', '2')).optimize(g)
# assert str(g) == "[Op4(z, y)]"
# def test_eq(self):
# x, y, z = inputs()
# e = op1(op_y(x, y, 37, 88), op2(op_y(y, z, 1, 7)))
# g = env([x, y, z], [e])
# PatternDescOptimizer((op_z, '1', '2'),
# (op3, '2', '1')).optimize(g)
# assert str(g) == "[Op1(Op3(y, x), Op2(OpZ(y, z)))]"
OpSubOptimizer
=
lambda
op1
,
op2
:
TopoOptimizer
(
OpSub
(
op1
,
op2
))
OpSubOptimizer
=
lambda
op1
,
op2
:
TopoOptimizer
(
OpSub
(
op1
,
op2
))
OpSubOptimizer
=
lambda
op1
,
op2
:
OpKeyOptimizer
(
OpSub
(
op1
,
op2
))
OpSubOptimizer
=
lambda
op1
,
op2
:
OpKeyOptimizer
(
OpSub
(
op1
,
op2
))
...
@@ -384,42 +364,6 @@ class _test_MergeOptimizer(unittest.TestCase):
...
@@ -384,42 +364,6 @@ class _test_MergeOptimizer(unittest.TestCase):
# class _test_ConstantFinder(unittest.TestCase):
# def test_straightforward(self):
# x, y, z = inputs()
# y.data = 2
# z.data = 2
# e = op1(x, y, z)
# g = env([x], [e])
# ConstantFinder().optimize(g)
# assert y.constant and z.constant
# MergeOptimizer().optimize(g)
# assert str(g) == "[Op1(x, y, y)]" \
# or str(g) == "[Op1(x, z, z)]"
# def test_deep(self):
# x, y, z = inputs()
# y.data = 2
# z.data = 2
# e = op1(op2(x, y), op2(x, y), op2(x, z))
# g = env([x], [e])
# ConstantFinder().optimize(g)
# assert y.constant and z.constant
# MergeOptimizer().optimize(g)
# assert str(g) == "[Op1(*1 -> Op2(x, y), *1, *1)]" \
# or str(g) == "[Op1(*1 -> Op2(x, z), *1, *1)]"
# def test_destroyed_orphan_not_constant(self):
# x, y, z = inputs()
# y.data = 2
# z.data = 2
# e = op_d(x, op2(y, z)) # here x is destroyed by op_d
# g = env([y], [e])
# ConstantFinder().optimize(g)
# assert not getattr(x, 'constant', False) and z.constant
# MergeOptimizer().optimize(g)
reenter
=
Exception
(
"Re-Entered"
)
reenter
=
Exception
(
"Re-Entered"
)
class
LoopyMacro
(
Macro
):
class
LoopyMacro
(
Macro
):
def
__init__
(
self
):
def
__init__
(
self
):
...
@@ -448,7 +392,7 @@ class _test_ExpandMacro(unittest.TestCase):
...
@@ -448,7 +392,7 @@ class _test_ExpandMacro(unittest.TestCase):
x
,
y
,
z
=
inputs
()
x
,
y
,
z
=
inputs
()
e
=
Macro1
()(
x
,
y
)
e
=
Macro1
()(
x
,
y
)
g
=
Env
([
x
,
y
],
[
e
])
g
=
Env
([
x
,
y
],
[
e
])
expand_macros
.
optimize
(
g
)
ExpandMacros
()
.
optimize
(
g
)
assert
str
(
g
)
==
"[Op1(y, x)]"
assert
str
(
g
)
==
"[Op1(y, x)]"
def
test_loopy_1
(
self
):
def
test_loopy_1
(
self
):
...
...
gof/_test_toolbox.py
浏览文件 @
4573a825
...
@@ -100,14 +100,15 @@ class _test_NodeFinder(unittest.TestCase):
...
@@ -100,14 +100,15 @@ class _test_NodeFinder(unittest.TestCase):
if
not
len
([
x
for
x
in
g
.
get_nodes
(
type
)])
==
num
:
if
not
len
([
x
for
x
in
g
.
get_nodes
(
type
)])
==
num
:
self
.
fail
((
type
,
num
))
self
.
fail
((
type
,
num
))
def
test_robustness
(
self
):
# def test_robustness(self):
x
,
y
,
z
=
inputs
()
# # this test used to make sense to have, but it doesn't work like that anymore
e
=
add
(
add
(
sigmoid
(
x
),
sigmoid
(
sigmoid
(
z
))),
dot
(
add
(
x
,
y
),
dot
(
y
,
z
)))
# x, y, z = inputs()
g
=
Env
([
x
,
y
,
z
],
[
e
])
# e = add(add(sigmoid(x), sigmoid(sigmoid(z))), dot(add(x, y), dot(y, z)))
g
.
extend
(
NodeFinder
())
# g = Env([x, y, z], [e])
gen
=
g
.
get_nodes
(
sigmoid
)
# I want to get Sigmoid instances
# g.extend(NodeFinder())
g
.
replace
(
e
,
add
(
x
,
y
))
# but here I prune them all
# gen = g.get_nodes(sigmoid) # I want to get Sigmoid instances
assert
len
([
x
for
x
in
gen
])
==
0
# the generator should not yield them
# g.replace(e, add(x, y)) # but here I prune them all
# assert len([x for x in gen]) == 0 # the generator should not yield them
...
...
gof/opt.py
浏览文件 @
4573a825
差异被折叠。
点击展开。
gof/utils.py
浏览文件 @
4573a825
...
@@ -34,8 +34,9 @@ class scratchpad:
...
@@ -34,8 +34,9 @@ class scratchpad:
self
.
__dict__
.
clear
()
self
.
__dict__
.
clear
()
def
__update__
(
self
,
other
):
def
__update__
(
self
,
other
):
self
.
__dict__
.
update
(
other
.
__dict__
)
self
.
__dict__
.
update
(
other
.
__dict__
)
return
self
def
__str__
(
self
):
def
__str__
(
self
):
print
"scratch"
+
str
(
self
.
__dict__
)
return
"scratch"
+
str
(
self
.
__dict__
)
def
memoize
(
f
):
def
memoize
(
f
):
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论