Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
0c4f1f05
提交
0c4f1f05
authored
1月 02, 2022
作者:
Brandon T. Willard
提交者:
Brandon T. Willard
1月 13, 2022
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Clean up ShapeFeature.same_shape and remove an overly restrictive assert
上级
105bcc8c
显示空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
39 行增加
和
19 行删除
+39
-19
basic_opt.py
aesara/tensor/basic_opt.py
+39
-19
没有找到文件。
aesara/tensor/basic_opt.py
浏览文件 @
0c4f1f05
...
@@ -6,6 +6,7 @@ import time
...
@@ -6,6 +6,7 @@ import time
import
traceback
import
traceback
from
collections
import
defaultdict
from
collections
import
defaultdict
from
io
import
StringIO
from
io
import
StringIO
from
typing
import
Optional
import
numpy
as
np
import
numpy
as
np
...
@@ -1355,51 +1356,70 @@ class ShapeFeature(features.Feature):
...
@@ -1355,51 +1356,70 @@ class ShapeFeature(features.Feature):
self
.
set_shape_i
(
v
,
ii
,
new_r
)
self
.
set_shape_i
(
v
,
ii
,
new_r
)
self
.
shape_of_reverse_index
[
r
]
=
set
()
self
.
shape_of_reverse_index
[
r
]
=
set
()
def
same_shape
(
self
,
x
,
y
,
dim_x
=
None
,
dim_y
=
None
):
def
same_shape
(
"""Return True if we are able to assert that x and y have the
self
,
same shape.
x
:
Variable
,
y
:
Variable
,
dim_x
:
Optional
[
int
]
=
None
,
dim_y
:
Optional
[
int
]
=
None
,
)
->
bool
:
"""Return ``True`` if `x` and `y` have the same shape.
dim_x and dim_y are optional. If used, they should be an index
Parameters
to compare only 1 dimension of x and y.
==========
x
The `Variable` for which its shape is to be compared with `y`'s shape.
y
The `Variable` for which its shape is to be compared with `x`'s shape.
dim_x
If non ``None``, compare only the dimension of `x` equal to
`dim_x`.
dim_y
If non ``None``, compare only the dimension of `y` equal to
`dim_y`.
"""
"""
sx
=
self
.
shape_of
[
x
]
sx
=
self
.
shape_of
[
x
]
sy
=
self
.
shape_of
[
y
]
sy
=
self
.
shape_of
[
y
]
if
sx
is
None
or
sy
is
None
:
if
sx
is
None
or
sy
is
None
:
return
False
return
False
if
dim_x
is
not
None
:
if
dim_x
is
not
None
:
sx
=
[
sx
[
dim_x
]]
sx
=
[
sx
[
dim_x
]]
if
dim_y
is
not
None
:
if
dim_y
is
not
None
:
sy
=
[
sy
[
dim_y
]]
sy
=
[
sy
[
dim_y
]]
assert
len
(
sx
)
==
len
(
sy
)
# We look on each dimensions we want to compare.
if
len
(
sx
)
!=
len
(
sy
):
# If any of them can't be asserted to be equal, return False.
return
False
# Otherwise, we return True at the end.
for
dx
,
dy
in
zip
(
sx
,
sy
):
for
dx
,
dy
in
zip
(
sx
,
sy
):
if
dx
is
dy
:
if
dx
is
dy
:
continue
continue
# Need to try to find that they are the same shape. We
#
need to compare the full graph. It could be slow. So I
#
For now, only the `Shape_i` case is (explicitly) supported.
#
just implement for now the case of Shape_i.
#
TODO: How necessary is this with the `equal_computations` below?
if
not
dx
.
owner
or
not
dy
.
owner
:
if
not
dx
.
owner
or
not
dy
.
owner
:
return
False
return
False
if
not
isinstance
(
dx
.
owner
.
op
,
Shape_i
)
or
not
isinstance
(
dy
.
owner
.
op
,
Shape_i
):
return
False
opx
=
dx
.
owner
.
op
opx
=
dx
.
owner
.
op
opy
=
dy
.
owner
.
op
opy
=
dy
.
owner
.
op
if
not
isinstance
(
opx
,
Shape_i
)
or
not
isinstance
(
opy
,
Shape_i
):
return
False
if
opx
.
i
!=
opy
.
i
:
if
opx
.
i
!=
opy
.
i
:
return
False
return
False
# FB I'm not sure if this handle correctly constants.
if
dx
.
owner
.
inputs
[
0
]
==
dy
.
owner
.
inputs
[
0
]:
if
dx
.
owner
.
inputs
[
0
]
==
dy
.
owner
.
inputs
[
0
]:
continue
continue
# To be sure to cover all case, call equal_computation.
# To be sure to cover all case, call equal_computation.
# Can't use aesara.graph.basic.is_same_graph(dx, dy)
# As it currently expect that dx and dy aren't in a FunctionGraph
if
not
equal_computations
([
dx
],
[
dy
]):
if
not
equal_computations
([
dx
],
[
dy
]):
return
False
return
False
return
True
return
True
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论