Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
24102962
提交
24102962
authored
3月 18, 2011
作者:
Pascal Lamblin
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Test new cases for local_subtensor_merge, and fix one of them.
上级
3944c371
隐藏空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
100 行增加
和
61 行删除
+100
-61
opt.py
theano/tensor/opt.py
+17
-9
test_opt.py
theano/tensor/tests/test_opt.py
+83
-52
没有找到文件。
theano/tensor/opt.py
浏览文件 @
24102962
...
@@ -1152,11 +1152,13 @@ def local_subtensor_merge(node):
...
@@ -1152,11 +1152,13 @@ def local_subtensor_merge(node):
1) var[int:][-1] -> var[-1] # a little different for when the first subtensor is empty.
1) var[int:][-1] -> var[-1] # a little different for when the first subtensor is empty.
2) var[::-1][int] -> var[-int-1]
2) var[::-1][int] -> var[-int-1]
3) var[::-1][:int] -> var[:-int-1:-1]
3) var[::-1][:int] -> var[:-int-1:-1]
4) var[int1::][:int2] -> var[int1:switch(idx1>=0,
4) var[int1::][:int2] ->
idx1,
var[int1:int2 + switch(int2<0,
maximum(u.owner.inputs[0].shape[0]+idx1, 0)
0,
) + idx2]
switch(int1>=0,
int1,
maximum(u.owner.inputs[0].shape[0]+int1,
0))]
"""
"""
if
(
isinstance
(
node
.
op
,
T
.
Subtensor
)
and
if
(
isinstance
(
node
.
op
,
T
.
Subtensor
)
and
len
(
node
.
op
.
idx_list
)
==
1
):
len
(
node
.
op
.
idx_list
)
==
1
):
...
@@ -1270,11 +1272,17 @@ def local_subtensor_merge(node):
...
@@ -1270,11 +1272,17 @@ def local_subtensor_merge(node):
elif
isinstance
(
idx2
,
int
):
elif
isinstance
(
idx2
,
int
):
idx2
=
T
.
as_tensor_variable
(
idx2
)
idx2
=
T
.
as_tensor_variable
(
idx2
)
# The maximum is needed to don't have shape[0] - idx1 < 0
# Get positive version of idx1
idx2_neg
=
T
.
maximum
(
u
.
owner
.
inputs
[
0
]
.
shape
[
0
]
+
idx1
,
0
)
# TODO: use Razvan's code for that
new_idx2
=
T
.
switch
(
idx1
>=
0
,
idx1
,
idx2_neg
)
+
idx2
# The maximum is needed so that shape[0] + idx1 >= 0
neg_idx1
=
T
.
maximum
(
u
.
owner
.
inputs
[
0
]
.
shape
[
0
]
+
idx1
,
0
)
new_idx1
=
T
.
switch
((
idx1
>=
0
),
idx1
,
neg_idx1
)
# If idx2<0, we are indexing from the end, so idx2 is OK
# If we are indexing from the beginning, we need to add pos_idx1
new_idx2
=
idx2
+
T
.
switch
((
idx2
<
0
),
0
,
new_idx1
)
return
[
u
.
owner
.
inputs
[
0
][
idx1
:
new_idx2
]]
return
[
u
.
owner
.
inputs
[
0
][
new_
idx1
:
new_idx2
]]
@register_canonicalize
@register_canonicalize
@gof.local_optimizer
([
None
])
@gof.local_optimizer
([
None
])
...
...
theano/tensor/tests/test_opt.py
浏览文件 @
24102962
...
@@ -1271,13 +1271,17 @@ class test_local_subtensor_lift(unittest.TestCase):
...
@@ -1271,13 +1271,17 @@ class test_local_subtensor_lift(unittest.TestCase):
f
([
1
,
2
,
3
],
4
)
# let debugmode test something
f
([
1
,
2
,
3
],
4
)
# let debugmode test something
class
test_local_subtensor_merge
(
unittest
.
TestCase
):
class
test_local_subtensor_merge
(
unittest
.
TestCase
):
def
setUp
(
self
):
utt
.
seed_rng
()
self
.
x_shapes
=
[(
2
,
2
),
(
5
,
3
),
(
4
,
1
),
(
1
,
2
),
(
0
,
2
),
(
2
,
0
),
(
1
,
0
),
(
0
,
0
)]
self
.
rng
=
numpy
.
random
.
RandomState
(
seed
=
utt
.
fetch_seed
())
def
test_const
(
self
):
def
test_const
(
self
):
# var[const::][-1] -> var[-1]
# var[const::][-1] -> var[-1]
x
=
TT
.
matrix
(
'x'
)
x
=
TT
.
matrix
(
'x'
)
x_val
=
[[
0
,
1
],[
2
,
3
]]
for
idx
in
range
(
-
7
,
6
):
for
idx
in
range
(
-
5
,
4
):
f
=
function
([
x
],
x
[
idx
::][
-
1
],
mode
=
mode_opt
)
f
=
function
([
x
],
x
[
idx
::][
-
1
],
mode
=
mode_opt
)
g
=
function
([
x
],
x
[
idx
::][
-
1
],
mode
=
mode_opt
.
excluding
(
'local_subtensor_merge'
))
#theano.printing.debugprint(f, print_type=True)
#theano.printing.debugprint(f, print_type=True)
topo
=
f
.
maker
.
env
.
toposort
()
topo
=
f
.
maker
.
env
.
toposort
()
...
@@ -1286,20 +1290,23 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1286,20 +1290,23 @@ class test_local_subtensor_merge(unittest.TestCase):
#print topo[-1].op
#print topo[-1].op
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
if
idx
<
2
:
for
x_s
in
self
.
x_shapes
:
# The first subtensor is non-empty, so it makes sense
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
)
# let debugmode test something
else
:
if
idx
<
x_s
[
0
]
and
x_s
[
0
]
>
0
:
# A non-empty subtensor of an empty one should be an IndexError
# The first subtensor is non-empty, so it makes sense
self
.
assertRaises
(
IndexError
,
f
,
x_val
)
f
(
x_val
)
# let debugmode test something
f
=
function
([
x
],
x
[::
-
1
][
idx
],
mode
=
mode_opt
.
excluding
(
'local_subtensor_merge'
))
else
:
self
.
assertRaises
(
IndexError
,
f
,
x_val
)
# A non-empty subtensor of an empty one should be an IndexError
self
.
assertRaises
(
IndexError
,
f
,
x_val
)
self
.
assertRaises
(
IndexError
,
g
,
x_val
)
def
test_scalar
(
self
):
def
test_scalar
(
self
):
# var[int::][-1] -> var[-1]
# var[int::][-1] -> var[-1]
x
=
TT
.
matrix
(
'x'
)
x
=
TT
.
matrix
(
'x'
)
y
=
TT
.
iscalar
(
'y'
)
y
=
TT
.
iscalar
(
'y'
)
f
=
function
([
x
,
y
],
x
[
y
::][
-
1
],
mode
=
mode_opt
)
f
=
function
([
x
,
y
],
x
[
y
::][
-
1
],
mode
=
mode_opt
)
g
=
function
([
x
,
y
],
x
[
y
::][
-
1
],
mode
=
mode_opt
.
excluding
(
'local_subtensor_merge'
))
#theano.printing.debugprint(f, print_type=True)
#theano.printing.debugprint(f, print_type=True)
topo
=
f
.
maker
.
env
.
toposort
()
topo
=
f
.
maker
.
env
.
toposort
()
...
@@ -1308,13 +1315,16 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1308,13 +1315,16 @@ class test_local_subtensor_merge(unittest.TestCase):
#print topo[-1].op
#print topo[-1].op
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
x_val
=
[[
0
,
1
],[
2
,
3
]]
for
x_s
in
self
.
x_shapes
:
for
idx
in
range
(
-
10
,
2
):
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
,
idx
)
# let debugmode test something
for
idx
in
range
(
2
,
5
):
for
idx
in
range
(
-
9
,
8
):
self
.
assertRaises
(
IndexError
,
f
,
x_val
,
idx
)
if
(
idx
<
x_s
[
0
])
and
(
x_s
[
0
]
>
0
):
f
=
function
([
x
,
y
],
x
[::
-
1
][
y
],
mode
=
mode_opt
.
excluding
(
'local_subtensor_merge'
))
# The first subtensor is non-empty
self
.
assertRaises
(
IndexError
,
f
,
x_val
,
idx
)
f
(
x_val
,
idx
)
# let debugmode test something
else
:
self
.
assertRaises
(
IndexError
,
f
,
x_val
,
idx
)
self
.
assertRaises
(
IndexError
,
g
,
x_val
,
idx
)
def
test_dont_opt
(
self
):
def
test_dont_opt
(
self
):
# Test that we don't optimize some case
# Test that we don't optimize some case
...
@@ -1329,14 +1339,18 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1329,14 +1339,18 @@ class test_local_subtensor_merge(unittest.TestCase):
assert
isinstance
(
topo
[
0
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
0
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
1
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
1
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
2
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
2
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
f
([[
0
,
1
],[
2
,
3
]])
# let debugmode test something
# let debugmode test something
for
x_s
in
self
.
x_shapes
:
if
x_s
[
0
]
>
1
:
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
)
def
test_const2
(
self
):
def
test_const2
(
self
):
# var[::-1][const] -> var[-1]
# var[::-1][const] -> var[-1]
x
=
TT
.
matrix
(
'x'
)
x
=
TT
.
matrix
(
'x'
)
x_val
=
[[
0
,
1
],[
2
,
3
]]
for
idx
in
range
(
-
8
,
7
):
for
idx
in
range
(
-
5
,
4
):
f
=
function
([
x
],
x
[::
-
1
][
idx
],
mode
=
mode_opt
)
f
=
function
([
x
],
x
[::
-
1
][
idx
],
mode
=
mode_opt
)
g
=
function
([
x
],
x
[::
-
1
][
idx
],
mode
=
mode_opt
.
excluding
(
'local_subtensor_merge'
))
#theano.printing.debugprint(f, print_type=True)
#theano.printing.debugprint(f, print_type=True)
topo
=
f
.
maker
.
env
.
toposort
()
topo
=
f
.
maker
.
env
.
toposort
()
...
@@ -1345,20 +1359,22 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1345,20 +1359,22 @@ class test_local_subtensor_merge(unittest.TestCase):
#print topo[-1].op
#print topo[-1].op
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
if
idx
<
2
and
idx
>=-
2
:
for
x_s
in
self
.
x_shapes
:
# The first subtensor is non-empty, so it makes sense
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
)
# let debugmode test something
if
(
idx
<
x_s
[
0
])
and
(
idx
>=
-
x_s
[
0
]):
else
:
# The first subtensor is non-empty, so it makes sense
# A non-empty subtensor of an empty one should be an IndexError
f
(
x_val
)
# let debugmode test something
self
.
assertRaises
(
IndexError
,
f
,
x_val
)
else
:
f2
=
function
([
x
],
x
[::
-
1
][
idx
],
mode
=
mode_opt
.
excluding
(
'local_subtensor_merge'
))
# A non-empty subtensor of an empty one should be an IndexError
self
.
assertRaises
(
IndexError
,
f2
,
x_val
)
self
.
assertRaises
(
IndexError
,
f
,
x_val
)
self
.
assertRaises
(
IndexError
,
g
,
x_val
)
def
test_scalar2
(
self
):
def
test_scalar2
(
self
):
# var[::-1][int] -> var[-1]
# var[::-1][int] -> var[-1]
x
=
TT
.
matrix
(
'x'
)
x
=
TT
.
matrix
(
'x'
)
y
=
TT
.
iscalar
(
'y'
)
y
=
TT
.
iscalar
(
'y'
)
f
=
function
([
x
,
y
],
x
[::
-
1
][
y
],
mode
=
mode_opt
)
f
=
function
([
x
,
y
],
x
[::
-
1
][
y
],
mode
=
mode_opt
)
g
=
function
([
x
,
y
],
x
[::
-
1
][
y
],
mode
=
mode_opt
.
excluding
(
'local_subtensor_merge'
))
#theano.printing.debugprint(f, print_type=True)
#theano.printing.debugprint(f, print_type=True)
topo
=
f
.
maker
.
env
.
toposort
()
topo
=
f
.
maker
.
env
.
toposort
()
...
@@ -1367,13 +1383,14 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1367,13 +1383,14 @@ class test_local_subtensor_merge(unittest.TestCase):
#print topo[-1].op
#print topo[-1].op
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
x_val
=
[[
0
,
1
],[
2
,
3
]]
for
x_s
in
self
.
x_shapes
:
for
idx
in
range
(
-
2
,
2
):
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
,
idx
)
# let debugmode test something
for
idx
in
range
(
2
,
5
)
+
range
(
-
5
,
-
2
):
for
idx
in
range
(
-
x_s
[
0
],
x_s
[
0
]):
self
.
assertRaises
(
IndexError
,
f
,
x_val
,
idx
)
f
(
x_val
,
idx
)
# let debugmode test something
f
=
function
([
x
,
y
],
x
[::
-
1
][
y
],
mode
=
mode_opt
.
excluding
(
'local_subtensor_merge'
))
for
idx
in
(
range
(
x_s
[
0
],
9
)
+
range
(
-
9
,
-
x_s
[
0
])):
self
.
assertRaises
(
IndexError
,
f
,
x_val
,
idx
)
self
.
assertRaises
(
IndexError
,
f
,
x_val
,
idx
)
self
.
assertRaises
(
IndexError
,
g
,
x_val
,
idx
)
def
test_dont_opt2
(
self
):
def
test_dont_opt2
(
self
):
# Test that we don't optimize some case
# Test that we don't optimize some case
...
@@ -1388,13 +1405,16 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1388,13 +1405,16 @@ class test_local_subtensor_merge(unittest.TestCase):
assert
isinstance
(
topo
[
0
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
0
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
1
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
1
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
2
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
2
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
f
([[
0
,
1
],[
2
,
3
]])
# let debugmode test something
# let debugmode test something
for
x_s
in
self
.
x_shapes
:
if
x_s
[
0
]
>
0
:
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
)
def
test_const3
(
self
):
def
test_const3
(
self
):
# var[::-1][:const] -> var[-1]
# var[::-1][:const] -> var[-1]
x
=
TT
.
matrix
(
'x'
)
x
=
TT
.
matrix
(
'x'
)
x_val
=
[[
0
,
1
],[
2
,
3
]]
for
idx
in
range
(
-
9
,
8
):
for
idx
in
range
(
-
5
,
4
):
f
=
function
([
x
],
x
[::
-
1
][:
idx
],
mode
=
mode_opt
)
f
=
function
([
x
],
x
[::
-
1
][:
idx
],
mode
=
mode_opt
)
#theano.printing.debugprint(f, print_type=True)
#theano.printing.debugprint(f, print_type=True)
...
@@ -1404,7 +1424,9 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1404,7 +1424,9 @@ class test_local_subtensor_merge(unittest.TestCase):
#print topo[-1].op
#print topo[-1].op
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
f
(
x_val
)
# let debugmode test something
for
x_s
in
self
.
x_shapes
:
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
)
# let debugmode test something
def
test_scalar3
(
self
):
def
test_scalar3
(
self
):
# var[::-1][:int] -> var[-1]
# var[::-1][:int] -> var[-1]
...
@@ -1419,9 +1441,10 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1419,9 +1441,10 @@ class test_local_subtensor_merge(unittest.TestCase):
#print topo[-1].op
#print topo[-1].op
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
x_val
=
[[
0
,
1
],[
2
,
3
]]
for
x_s
in
self
.
x_shapes
:
for
idx
in
range
(
-
5
,
5
):
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
,
idx
)
# let debugmode test something
for
idx
in
range
(
-
7
,
7
):
f
(
x_val
,
idx
)
# let debugmode test something
def
test_dont_opt3
(
self
):
def
test_dont_opt3
(
self
):
# Test that we don't optimize some case
# Test that we don't optimize some case
...
@@ -1436,14 +1459,16 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1436,14 +1459,16 @@ class test_local_subtensor_merge(unittest.TestCase):
assert
isinstance
(
topo
[
0
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
0
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
1
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
1
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
2
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
2
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
f
([[
0
,
1
],[
2
,
3
]])
# let debugmode test something
# let debugmode test something
for
x_s
in
self
.
x_shapes
:
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
)
def
test_const4
(
self
):
def
test_const4
(
self
):
# var[const1::][:const2]
# var[const1::][:const2]
x
=
TT
.
matrix
(
'x'
)
x
=
TT
.
matrix
(
'x'
)
x_val
=
[[
0
,
1
],[
2
,
3
]]
for
idx1
in
range
(
-
7
,
7
):
for
idx1
in
range
(
-
3
,
3
):
for
idx2
in
range
(
-
7
,
7
):
for
idx2
in
range
(
-
3
,
3
):
f
=
function
([
x
],
x
[
idx1
:][:
idx2
],
mode
=
mode_opt
)
f
=
function
([
x
],
x
[
idx1
:][:
idx2
],
mode
=
mode_opt
)
#theano.printing.debugprint(f, print_type=True)
#theano.printing.debugprint(f, print_type=True)
...
@@ -1453,7 +1478,9 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1453,7 +1478,9 @@ class test_local_subtensor_merge(unittest.TestCase):
#print topo[-1].op
#print topo[-1].op
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
f
(
x_val
)
# let debugmode test something
for
x_s
in
self
.
x_shapes
:
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
)
# let debugmode test something
def
test_scalar4
(
self
):
def
test_scalar4
(
self
):
# var[int1:][:int2]
# var[int1:][:int2]
...
@@ -1469,10 +1496,11 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1469,10 +1496,11 @@ class test_local_subtensor_merge(unittest.TestCase):
#print topo[-1].op
#print topo[-1].op
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
-
1
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
x_val
=
[[
0
,
1
],[
2
,
3
]]
for
x_s
in
self
.
x_shapes
:
for
idx1
in
range
(
-
5
,
5
):
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
for
idx2
in
range
(
-
5
,
5
):
for
idx1
in
range
(
-
11
,
11
):
f
(
x_val
,
idx1
,
idx2
)
# let debugmode test something
for
idx2
in
range
(
-
11
,
11
):
f
(
x_val
,
idx1
,
idx2
)
# let debugmode test something
def
test_dont_opt4
(
self
):
def
test_dont_opt4
(
self
):
# Test that we don't optimize some case
# Test that we don't optimize some case
...
@@ -1487,7 +1515,10 @@ class test_local_subtensor_merge(unittest.TestCase):
...
@@ -1487,7 +1515,10 @@ class test_local_subtensor_merge(unittest.TestCase):
assert
isinstance
(
topo
[
0
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
0
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
1
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
1
]
.
op
,
TT
.
Subtensor
)
assert
isinstance
(
topo
[
2
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
assert
isinstance
(
topo
[
2
]
.
op
,
theano
.
compile
.
function_module
.
DeepCopyOp
)
f
([[
0
,
1
],[
2
,
3
]])
# let debugmode test something
# let debugmode test something
for
x_s
in
self
.
x_shapes
:
x_val
=
self
.
rng
.
uniform
(
size
=
x_s
)
.
astype
(
config
.
floatX
)
f
(
x_val
)
def
test_local_fill_useless
():
def
test_local_fill_useless
():
m
=
theano
.
config
.
mode
m
=
theano
.
config
.
mode
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论