Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
b15a7884
提交
b15a7884
authored
9月 06, 2011
作者:
Frederic
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Added test related to subtensor optimization
上级
3392778a
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
34 行增加
和
14 行删除
+34
-14
test_opt.py
theano/tensor/tests/test_opt.py
+34
-14
没有找到文件。
theano/tensor/tests/test_opt.py
浏览文件 @
b15a7884
...
@@ -1856,11 +1856,11 @@ class Test_alloc_zero(unittest.TestCase):
...
@@ -1856,11 +1856,11 @@ class Test_alloc_zero(unittest.TestCase):
f
.
maker
.
env
.
toposort
()
])
f
.
maker
.
env
.
toposort
()
])
def
test_local_subtensor_
alloc0
():
def
test_local_subtensor_
of_alloc
():
x
=
tensor
.
matrix
(
'x'
)
x
=
tensor
.
matrix
(
'x'
)
y
=
tensor
.
vector
(
'y'
)
y
=
tensor
.
vector
(
'y'
)
# The rows of yx are copies of
x
# The rows of yx are copies of
y
yx
=
tensor
.
alloc
(
y
,
x
.
shape
[
0
],
x
.
shape
[
1
])
yx
=
tensor
.
alloc
(
y
,
x
.
shape
[
0
],
x
.
shape
[
1
])
# Slice of each row
# Slice of each row
...
@@ -1897,33 +1897,53 @@ def test_local_subtensor_alloc0():
...
@@ -1897,33 +1897,53 @@ def test_local_subtensor_alloc0():
def
test_local_fill_useless
():
def
test_local_fill_useless
():
m
=
theano
.
config
.
mode
#Test opt local_fill_cut
if
m
==
'FAST_COMPILE'
:
m
=
'FAST_RUN'
x
=
dvector
()
x
=
dvector
()
y
=
dvector
()
y
=
dvector
()
z
=
lvector
()
z
=
lvector
()
m
=
dmatrix
()
x_
=
numpy
.
random
.
rand
(
5
,)
y_
=
numpy
.
random
.
rand
(
5
,)
z_
=
(
numpy
.
random
.
rand
(
5
,)
*
5
)
.
astype
(
"int64"
)
m_
=
numpy
.
random
.
rand
(
5
,
5
)
# basic case
# basic case
f
=
function
([
x
],
T
.
fill
(
x
,
x
)
*
2
,
mode
=
m
)
f
=
function
([
x
],
T
.
fill
(
x
,
x
)
*
2
,
mode
=
mode_opt
)
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
f
(
x_
)
# basic case
# basic case
f
=
function
([
x
,
y
],
T
.
second
(
y
,
x
)
*
2
,
mode
=
m
)
f
=
function
([
x
,
y
],
T
.
second
(
y
,
x
)
*
2
,
mode
=
mode_opt
)
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
f
(
x_
,
y_
)
#
now with different typ
e
#
basic cas
e
f
=
function
([
x
,
z
],
T
.
fill
(
z
,
x
)
*
2
,
mode
=
m
)
f
=
function
([
x
,
y
],
T
.
fill
(
x
,
y
)
*
2
,
mode
=
mode_opt
)
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
f
(
x_
,
y_
)
# now
cutting out the input ??
# now
with different type(cast)
f
=
function
([
x
,
y
],
T
.
fill
(
x
,
y
)
*
2
,
mode
=
m
)
f
=
function
([
x
,
z
],
T
.
fill
(
z
,
x
)
*
2
,
mode
=
mode_opt
)
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
f
(
x_
,
z_
)
# now filll is serving as a cast
# now with different type(cast)
f
=
function
([
x
,
y
],
T
.
fill
(
x
,
y
)
*
2
,
mode
=
m
)
f
=
function
([
x
,
z
],
T
.
fill
(
x
,
z
)
*
2
,
mode
=
mode_opt
)
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
f
(
x_
,
z_
)
# now cutting out the input ??
f
=
function
([
x
,
y
],
T
.
fill
(
x
,
y
)
*
2
,
mode
=
mode_opt
)
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
assert
[
node
.
op
for
node
in
f
.
maker
.
env
.
toposort
()]
==
[
T
.
mul
]
f
(
x_
,
y_
)
# Test with different number of dimensions
# The fill is not useless, so it should stay
f
=
function
([
m
,
x
],
T
.
fill
(
m
,
x
)
*
2
,
mode
=
mode_opt
)
ops
=
[
node
.
op
.
__class__
for
node
in
f
.
maker
.
env
.
toposort
()]
assert
T
.
Alloc
in
ops
f
(
m_
,
x_
)
class
test_shapeoptimizer
(
unittest
.
TestCase
):
class
test_shapeoptimizer
(
unittest
.
TestCase
):
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论