Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
97c61d06
提交
97c61d06
authored
3月 21, 2011
作者:
Frederic Bastien
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Test that gemv are inserted into the graph. Disable the gemv test on complex as…
Test that gemv are inserted into the graph. Disable the gemv test on complex as they don't get inserted.
上级
0226809b
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
39 行增加
和
12 行删除
+39
-12
test_blas.py
theano/tensor/tests/test_blas.py
+39
-12
没有找到文件。
theano/tensor/tests/test_blas.py
浏览文件 @
97c61d06
...
...
@@ -809,6 +809,9 @@ class BaseGemv(object):
oy_func
=
theano
.
function
([],
oy
,
mode
=
mode_blas_opt
)
topo
=
oy_func
.
maker
.
env
.
toposort
()
assert
sum
([
isinstance
(
node
.
op
,
theano
.
tensor
.
blas
.
Gemv
)
for
node
in
topo
])
==
1
oy_val
=
oy_func
()
assert_array_almost_equal
(
desired_oy
,
oy_val
)
...
...
@@ -826,6 +829,20 @@ class BaseGemv(object):
oy_func
=
theano
.
function
([],
oy
,
mode
=
mode_blas_opt
)
topo
=
oy_func
.
maker
.
env
.
toposort
()
# The only op in the graph is a dot.
# In the gemm case, we create a dot22 for that case
# There is no dot21.
# Creating one is not usefull as this is not faster(in fact it would be slower!
# as more code would be in python, numpy.dot will call gemv itself)
"""
>>> t0=time.time();x=scipy.linalg.blas.fblas.dgemv(1,a.T,b,1,z.T);t1=time.time();print t1-t0
0.00192999839783
>>> t0=time.time();x=numpy.dot(a,b);t1=time.time();print t1-t0
0.00158381462097
"""
assert
sum
([
isinstance
(
node
.
op
,
theano
.
tensor
.
blas
.
Gemv
)
for
node
in
topo
])
==
0
oy_v
=
oy_func
()
assert_array_almost_equal
(
desired_oy
,
oy_v
)
...
...
@@ -841,6 +858,9 @@ class BaseGemv(object):
oy_func
=
theano
.
function
([],
oy
,
mode
=
mode_blas_opt
)
topo
=
oy_func
.
maker
.
env
.
toposort
()
assert
sum
([
isinstance
(
node
.
op
,
theano
.
tensor
.
blas
.
Gemv
)
for
node
in
topo
])
==
1
oy_v
=
oy_func
()
assert_array_almost_equal
(
desired_oy
,
oy_v
)
...
...
@@ -855,6 +875,9 @@ class BaseGemv(object):
oy_func
=
theano
.
function
([],
oy
,
mode
=
mode_blas_opt
)
topo
=
oy_func
.
maker
.
env
.
toposort
()
assert
sum
([
isinstance
(
node
.
op
,
theano
.
tensor
.
blas
.
Gemv
)
for
node
in
topo
])
==
1
oy_v
=
oy_func
()
assert_array_almost_equal
(
desired_oy
,
oy_v
)
...
...
@@ -869,6 +892,9 @@ class BaseGemv(object):
oy_func
=
theano
.
function
([],
oy
,
mode
=
mode_blas_opt
)
topo
=
oy_func
.
maker
.
env
.
toposort
()
assert
sum
([
isinstance
(
node
.
op
,
theano
.
tensor
.
blas
.
Gemv
)
for
node
in
topo
])
==
1
oy_v
=
oy_func
()
assert_array_almost_equal
(
desired_oy
,
oy_v
)
...
...
@@ -883,6 +909,9 @@ class BaseGemv(object):
oy_func
=
theano
.
function
([],
oy
,
mode
=
mode_blas_opt
)
topo
=
oy_func
.
maker
.
env
.
toposort
()
assert
sum
([
isinstance
(
node
.
op
,
theano
.
tensor
.
blas
.
Gemv
)
for
node
in
topo
])
==
1
oy_v
=
oy_func
()
assert_array_almost_equal
(
desired_oy
,
oy_v
)
...
...
@@ -897,25 +926,23 @@ class BaseGemv(object):
oy_func
=
theano
.
function
([],
oy
,
mode
=
mode_blas_opt
)
topo
=
oy_func
.
maker
.
env
.
toposort
()
assert
sum
([
isinstance
(
node
.
op
,
theano
.
tensor
.
blas
.
Gemv
)
for
node
in
topo
])
==
1
oy_v
=
oy_func
()
assert_array_almost_equal
(
desired_oy
,
oy_v
)
try
:
class
TestSgmev
(
TestCase
,
BaseGemv
):
dtype
=
float32
except
AttributeError
:
class
TestSgmev
:
pass
class
TestSgemv
(
TestCase
,
BaseGemv
):
dtype
=
float32
class
TestDgemv
(
TestCase
,
BaseGemv
):
dtype
=
float64
try
:
class
TestCgemv
(
TestCase
,
BaseGemv
):
dtype
=
complex64
except
AttributeError
:
class
TestCgemv
:
pass
#The optimization to put Gemv don't work for complex type for now.
#class TestCgemv(TestCase, BaseGemv):
# dtype = complex64
class
TestZgemv
(
TestCase
,
BaseGemv
):
dtype
=
complex128
#
class TestZgemv(TestCase, BaseGemv):
#
dtype = complex128
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论