Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
51de50be
提交
51de50be
authored
11月 25, 2021
作者:
Brandon T. Willard
提交者:
Brandon T. Willard
12月 05, 2021
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Extract general utility methods from Subtensor class
上级
df2a45d8
显示空白字符变更
内嵌
并排
正在显示
7 个修改的文件
包含
103 行增加
和
73 行删除
+103
-73
opt.py
aesara/scan/opt.py
+3
-2
basic.py
aesara/tensor/basic.py
+3
-1
basic.py
aesara/tensor/nnet/basic.py
+8
-3
subtensor.py
aesara/tensor/subtensor.py
+58
-58
subtensor_opt.py
aesara/tensor/subtensor_opt.py
+12
-5
var.py
aesara/tensor/var.py
+4
-4
test_subtensor.py
tests/tensor/test_subtensor.py
+15
-0
没有找到文件。
aesara/scan/opt.py
浏览文件 @
51de50be
...
@@ -50,6 +50,7 @@ from aesara.tensor.subtensor import (
...
@@ -50,6 +50,7 @@ from aesara.tensor.subtensor import (
Subtensor
,
Subtensor
,
get_canonical_form_slice
,
get_canonical_form_slice
,
get_idx_list
,
get_idx_list
,
get_slice_elements
,
set_subtensor
,
set_subtensor
,
)
)
from
aesara.tensor.var
import
TensorConstant
,
get_unique_value
from
aesara.tensor.var
import
TensorConstant
,
get_unique_value
...
@@ -1548,7 +1549,7 @@ def save_mem_new_scan(fgraph, node):
...
@@ -1548,7 +1549,7 @@ def save_mem_new_scan(fgraph, node):
subtens
=
Subtensor
(
nw_slice
)
subtens
=
Subtensor
(
nw_slice
)
# slice inputs
# slice inputs
sl_ins
=
Subtensor
.
collapse
(
sl_ins
=
get_slice_elements
(
nw_slice
,
lambda
entry
:
isinstance
(
entry
,
Variable
)
nw_slice
,
lambda
entry
:
isinstance
(
entry
,
Variable
)
)
)
new_o
=
subtens
(
new_outs
[
nw_pos
],
*
sl_ins
)
new_o
=
subtens
(
new_outs
[
nw_pos
],
*
sl_ins
)
...
@@ -1598,7 +1599,7 @@ def save_mem_new_scan(fgraph, node):
...
@@ -1598,7 +1599,7 @@ def save_mem_new_scan(fgraph, node):
nw_slice
=
(
sanitize
(
position
),)
+
tuple
(
old_slices
[
1
:])
nw_slice
=
(
sanitize
(
position
),)
+
tuple
(
old_slices
[
1
:])
subtens
=
Subtensor
(
nw_slice
)
subtens
=
Subtensor
(
nw_slice
)
sl_ins
=
Subtensor
.
collapse
(
sl_ins
=
get_slice_elements
(
nw_slice
,
lambda
entry
:
isinstance
(
entry
,
Variable
)
nw_slice
,
lambda
entry
:
isinstance
(
entry
,
Variable
)
)
)
new_o
=
subtens
(
new_outs
[
nw_pos
],
*
sl_ins
)
new_o
=
subtens
(
new_outs
[
nw_pos
],
*
sl_ins
)
...
...
aesara/tensor/basic.py
浏览文件 @
51de50be
...
@@ -417,7 +417,9 @@ def get_scalar_constant_value(
...
@@ -417,7 +417,9 @@ def get_scalar_constant_value(
and
v
.
ndim
==
0
and
v
.
ndim
==
0
):
):
if
isinstance
(
v
.
owner
.
inputs
[
0
],
TensorConstant
):
if
isinstance
(
v
.
owner
.
inputs
[
0
],
TensorConstant
):
cdata
=
tuple
(
v
.
owner
.
op
.
get_constant_idx
(
v
.
owner
.
inputs
))
from
aesara.tensor.subtensor
import
get_constant_idx
cdata
=
tuple
(
get_constant_idx
(
v
.
owner
.
op
.
idx_list
,
v
.
owner
.
inputs
))
try
:
try
:
return
v
.
owner
.
inputs
[
0
]
.
data
.
__getitem__
(
cdata
)
.
copy
()
return
v
.
owner
.
inputs
[
0
]
.
data
.
__getitem__
(
cdata
)
.
copy
()
except
IndexError
:
except
IndexError
:
...
...
aesara/tensor/nnet/basic.py
浏览文件 @
51de50be
...
@@ -58,7 +58,12 @@ from aesara.tensor.math import sum as aet_sum
...
@@ -58,7 +58,12 @@ from aesara.tensor.math import sum as aet_sum
from
aesara.tensor.math
import
tanh
,
tensordot
,
true_div
from
aesara.tensor.math
import
tanh
,
tensordot
,
true_div
from
aesara.tensor.nnet.blocksparse
import
sparse_block_dot
from
aesara.tensor.nnet.blocksparse
import
sparse_block_dot
from
aesara.tensor.shape
import
shape
,
shape_padleft
from
aesara.tensor.shape
import
shape
,
shape_padleft
from
aesara.tensor.subtensor
import
AdvancedIncSubtensor
,
AdvancedSubtensor
,
Subtensor
from
aesara.tensor.subtensor
import
(
AdvancedIncSubtensor
,
AdvancedSubtensor
,
Subtensor
,
get_constant_idx
,
)
from
aesara.tensor.type
import
(
from
aesara.tensor.type
import
(
TensorType
,
TensorType
,
discrete_dtypes
,
discrete_dtypes
,
...
@@ -1736,8 +1741,8 @@ def _check_rows_is_arange_len_labels(fgraph, rows, labels):
...
@@ -1736,8 +1741,8 @@ def _check_rows_is_arange_len_labels(fgraph, rows, labels):
# ShapeOptimizer, but we keep it if ShapeOptimizer is not present
# ShapeOptimizer, but we keep it if ShapeOptimizer is not present
if
isinstance
(
stop
.
owner
.
op
,
Subtensor
):
if
isinstance
(
stop
.
owner
.
op
,
Subtensor
):
shape_subtensor
=
stop
.
owner
shape_subtensor
=
stop
.
owner
if
shape_subtensor
.
op
.
get_constant_idx
(
if
get_constant_idx
(
shape_subtensor
.
inputs
,
allow_partial
=
True
shape_subtensor
.
op
.
idx_list
,
shape_subtensor
.
inputs
,
allow_partial
=
True
)
==
[
0
]:
)
==
[
0
]:
shape_var
=
shape_subtensor
.
inputs
[
0
]
shape_var
=
shape_subtensor
.
inputs
[
0
]
if
shape_var
.
owner
and
shape_var
.
owner
.
op
==
shape
:
if
shape_var
.
owner
and
shape_var
.
owner
.
op
==
shape
:
...
...
aesara/tensor/subtensor.py
浏览文件 @
51de50be
...
@@ -2,7 +2,7 @@ import logging
...
@@ -2,7 +2,7 @@ import logging
import
sys
import
sys
from
itertools
import
chain
,
groupby
from
itertools
import
chain
,
groupby
from
textwrap
import
dedent
from
textwrap
import
dedent
from
typing
import
Iterable
,
List
,
Optional
,
Tuple
,
Union
from
typing
import
Callable
,
Iterable
,
List
,
Optional
,
Tuple
,
Union
import
numpy
as
np
import
numpy
as
np
...
@@ -498,17 +498,9 @@ def indexed_result_shape(array_shape, indices, indices_are_shapes=False):
...
@@ -498,17 +498,9 @@ def indexed_result_shape(array_shape, indices, indices_are_shapes=False):
return
res_shape
return
res_shape
class
Subtensor
(
COp
)
:
def
get_slice_elements
(
idxs
:
List
,
cond
:
Callable
)
->
List
:
"""
Basic NumPy indexing operator."""
"""
Extract slice elements conditional on a given predicate function.
check_input
=
False
view_map
=
{
0
:
[
0
]}
_f16_ok
=
True
__props__
=
(
"idx_list"
,)
@staticmethod
def
collapse
(
idxs
,
cond
):
"""
Parameters
Parameters
----------
----------
idxs : a list of indices or slices.
idxs : a list of indices or slices.
...
@@ -536,15 +528,15 @@ class Subtensor(COp):
...
@@ -536,15 +528,15 @@ class Subtensor(COp):
return
ret
return
ret
@staticmethod
def
convert
(
entry
,
slice_ok
=
True
):
"""
Change references to Variables into references to Types.
The "idx_list" field is unique to each Subtensor instance.
def
index_vars_to_types
(
entry
,
slice_ok
=
True
):
It is not unique to each Apply node, so it should not refer to
r"""Change references to `Variable`s into references to `Type`s.
specific Variables.
TODO: WRITEME: This method also accepts "entry" already being a Type;
The `Subtensor.idx_list` field is unique to each `Subtensor` instance. It
is not unique to each `Apply` node, so it should not refer to specific
`Variable`s.
TODO WRITEME: This function also accepts an `entry` already being a `Type`;
when would that happen?
when would that happen?
"""
"""
...
@@ -583,7 +575,7 @@ class Subtensor(COp):
...
@@ -583,7 +575,7 @@ class Subtensor(COp):
c
=
entry
.
step
c
=
entry
.
step
if
a
is
not
None
:
if
a
is
not
None
:
slice_a
=
Subtensor
.
convert
(
a
,
False
)
slice_a
=
index_vars_to_types
(
a
,
False
)
else
:
else
:
slice_a
=
None
slice_a
=
None
...
@@ -591,59 +583,56 @@ class Subtensor(COp):
...
@@ -591,59 +583,56 @@ class Subtensor(COp):
# The special "maxsize" case is probably not needed here,
# The special "maxsize" case is probably not needed here,
# as slices containing maxsize are not generated by
# as slices containing maxsize are not generated by
# __getslice__ anymore.
# __getslice__ anymore.
slice_b
=
Subtensor
.
convert
(
b
,
False
)
slice_b
=
index_vars_to_types
(
b
,
False
)
else
:
else
:
slice_b
=
None
slice_b
=
None
if
c
is
not
None
:
if
c
is
not
None
:
slice_c
=
Subtensor
.
convert
(
c
,
False
)
slice_c
=
index_vars_to_types
(
c
,
False
)
else
:
else
:
slice_c
=
None
slice_c
=
None
return
slice
(
slice_a
,
slice_b
,
slice_c
)
return
slice
(
slice_a
,
slice_b
,
slice_c
)
elif
isinstance
(
entry
,
(
int
,
np
.
integer
)):
elif
isinstance
(
entry
,
(
int
,
np
.
integer
)):
# Disallow the use of python scalars in idx_list
raise
TypeError
()
raise
TypeError
(
"Python scalar in idx_list."
"Please report this error to aesara-dev."
)
else
:
else
:
raise
AdvancedIndexingError
(
"Invalid index type or slice for Subtensor"
)
raise
AdvancedIndexingError
(
"Invalid index type or slice for Subtensor"
)
def
get_constant_idx
(
self
,
inputs
,
allow_partial
=
False
,
only_process_constants
=
False
,
elemwise
=
True
):
"""
Return the idx_list with constant inputs replaced by their
python scalar equivalent.
May raise `NotScalarConstantError` if the idx contains
non-constant entries.
If allow_partial is True, then entries that are not constant will
def
get_constant_idx
(
idx_list
,
inputs
,
allow_partial
=
False
,
only_process_constants
=
False
,
elemwise
=
True
):
r"""Return an `idx_list` with its constant inputs replaced by their Python scalar equivalents.
May raise `NotScalarConstantError` if the indices contain non-constant entries.
If `allow_partial` is ``True``, then entries that are not constant will
stay as their input variable rather than raising an exception.
stay as their input variable rather than raising an exception.
None
entries are always left as-is.
``None``
entries are always left as-is.
Parameters
Parameters
----------
----------
only_process_constants
only_process_constants
If True
, we only attempt to obtain the value of an index/slice if
If ``True``
, we only attempt to obtain the value of an index/slice if
it's directly constant and don't try to dig through dimshuffle
s,
it's directly constant and don't try to dig through `DimShuffle`\
s,
fills, alloc
s, and other to figure out its value.
fills, `Alloc`\
s, and other to figure out its value.
Examples
Examples
--------
--------
Example usage where v, a are appropriately typed a
esara variables :
Example usage where `v` and `a` are appropriately typed A
esara variables :
>>> b = a[v, 1:3]
>>> b = a[v, 1:3]
>>> b.owner.op.idx_list
>>> b.owner.op.idx_list
(Scalar(int64), slice(Scalar(int64), Scalar(int64), None))
(Scalar(int64), slice(Scalar(int64), Scalar(int64), None))
>>> b.owner.op.get_constant_idx(
b.owner.inputs, allow_partial=True)
>>> get_constant_idx(b.owner.op.idx_list,
b.owner.inputs, allow_partial=True)
[v, slice(1, 3, None)]
[v, slice(1, 3, None)]
>>> b.owner.op.get_constant_idx(
b.owner.inputs)
>>> get_constant_idx(b.owner.op.idx_list,
b.owner.inputs)
NotScalarConstantError: v
NotScalarConstantError: v
"""
"""
real_idx
=
get_idx_list
(
inputs
,
self
.
idx_list
)
real_idx
=
get_idx_list
(
inputs
,
idx_list
)
# TODO: Combine this with `as_index_literal`
def
conv
(
val
):
def
conv
(
val
):
if
val
is
None
:
if
val
is
None
:
return
None
return
None
...
@@ -664,11 +653,9 @@ class Subtensor(COp):
...
@@ -664,11 +653,9 @@ class Subtensor(COp):
return
list
(
map
(
conv
,
real_idx
))
return
list
(
map
(
conv
,
real_idx
))
def
__init__
(
self
,
idx_list
):
self
.
idx_list
=
tuple
(
map
(
self
.
convert
,
idx_list
))
@staticmethod
def
as_nontensor_scalar
(
a
:
Variable
)
->
aes
.
ScalarVariable
:
def
my_as_scalar
(
a
):
"""Convert a value to a `Scalar` variable."""
# Since aes.as_scalar does not know about tensor types (it would
# Since aes.as_scalar does not know about tensor types (it would
# create a circular import) , this method converts either a
# create a circular import) , this method converts either a
# TensorVariable or a ScalarVariable to a scalar.
# TensorVariable or a ScalarVariable to a scalar.
...
@@ -677,6 +664,19 @@ class Subtensor(COp):
...
@@ -677,6 +664,19 @@ class Subtensor(COp):
else
:
else
:
return
aes
.
as_scalar
(
a
)
return
aes
.
as_scalar
(
a
)
class
Subtensor
(
COp
):
"""Basic NumPy indexing operator."""
check_input
=
False
view_map
=
{
0
:
[
0
]}
_f16_ok
=
True
__props__
=
(
"idx_list"
,)
def
__init__
(
self
,
idx_list
):
# TODO: Provide the type of `self.idx_list`
self
.
idx_list
=
tuple
(
map
(
index_vars_to_types
,
idx_list
))
def
make_node
(
self
,
x
,
*
inputs
):
def
make_node
(
self
,
x
,
*
inputs
):
"""
"""
Parameters
Parameters
...
@@ -688,13 +688,13 @@ class Subtensor(COp):
...
@@ -688,13 +688,13 @@ class Subtensor(COp):
"""
"""
x
=
aesara
.
tensor
.
as_tensor_variable
(
x
)
x
=
aesara
.
tensor
.
as_tensor_variable
(
x
)
inputs
=
tuple
(
self
.
my_as
_scalar
(
a
)
for
a
in
inputs
)
inputs
=
tuple
(
as_nontensor
_scalar
(
a
)
for
a
in
inputs
)
idx_list
=
list
(
self
.
idx_list
)
idx_list
=
list
(
self
.
idx_list
)
if
len
(
idx_list
)
>
x
.
type
.
ndim
:
if
len
(
idx_list
)
>
x
.
type
.
ndim
:
raise
IndexError
(
"too many indices for array"
)
raise
IndexError
(
"too many indices for array"
)
input_types
=
Subtensor
.
collapse
(
input_types
=
get_slice_elements
(
idx_list
,
lambda
entry
:
isinstance
(
entry
,
Type
)
idx_list
,
lambda
entry
:
isinstance
(
entry
,
Type
)
)
)
if
len
(
inputs
)
!=
len
(
input_types
):
if
len
(
inputs
)
!=
len
(
input_types
):
...
@@ -709,9 +709,9 @@ class Subtensor(COp):
...
@@ -709,9 +709,9 @@ class Subtensor(COp):
)
)
# infer the broadcasting pattern
# infer the broadcasting pattern
padded
=
self
.
get_constant_idx
((
None
,)
+
inputs
,
allow_partial
=
True
)
+
[
padded
=
get_constant_idx
(
s
lice
(
None
,
None
,
None
)
s
elf
.
idx_list
,
(
None
,)
+
inputs
,
allow_partial
=
True
]
*
(
x
.
type
.
ndim
-
len
(
idx_list
))
)
+
[
slice
(
None
,
None
,
None
)
]
*
(
x
.
type
.
ndim
-
len
(
idx_list
))
broadcastable
=
[]
broadcastable
=
[]
for
i
,
(
p
,
bc
)
in
enumerate
(
zip
(
padded
,
x
.
type
.
broadcastable
)):
for
i
,
(
p
,
bc
)
in
enumerate
(
zip
(
padded
,
x
.
type
.
broadcastable
)):
if
isinstance
(
p
,
slice
):
if
isinstance
(
p
,
slice
):
...
@@ -1435,7 +1435,7 @@ class IncSubtensor(COp):
...
@@ -1435,7 +1435,7 @@ class IncSubtensor(COp):
):
):
if
destroyhandler_tolerate_aliased
is
None
:
if
destroyhandler_tolerate_aliased
is
None
:
destroyhandler_tolerate_aliased
=
[]
destroyhandler_tolerate_aliased
=
[]
self
.
idx_list
=
list
(
map
(
Subtensor
.
convert
,
idx_list
))
self
.
idx_list
=
list
(
map
(
index_vars_to_types
,
idx_list
))
self
.
inplace
=
inplace
self
.
inplace
=
inplace
if
inplace
:
if
inplace
:
self
.
destroy_map
=
{
0
:
[
0
]}
self
.
destroy_map
=
{
0
:
[
0
]}
...
@@ -1483,13 +1483,13 @@ class IncSubtensor(COp):
...
@@ -1483,13 +1483,13 @@ class IncSubtensor(COp):
f
"Trying to increment a {int(x.ndim)}-dimensional "
f
"Trying to increment a {int(x.ndim)}-dimensional "
f
"subtensor with a {int(y.ndim)}-dimensional value."
f
"subtensor with a {int(y.ndim)}-dimensional value."
)
)
inputs
=
tuple
(
map
(
Subtensor
.
my_as
_scalar
,
inputs
))
inputs
=
tuple
(
map
(
as_nontensor
_scalar
,
inputs
))
idx_list
=
list
(
self
.
idx_list
)
idx_list
=
list
(
self
.
idx_list
)
if
len
(
idx_list
)
>
x
.
type
.
ndim
:
if
len
(
idx_list
)
>
x
.
type
.
ndim
:
raise
IndexError
(
"too many indices for array"
)
raise
IndexError
(
"too many indices for array"
)
input_types
=
Subtensor
.
collapse
(
input_types
=
get_slice_elements
(
idx_list
,
lambda
entry
:
isinstance
(
entry
,
Type
)
idx_list
,
lambda
entry
:
isinstance
(
entry
,
Type
)
)
)
if
len
(
inputs
)
!=
len
(
input_types
):
if
len
(
inputs
)
!=
len
(
input_types
):
...
@@ -1513,17 +1513,17 @@ class IncSubtensor(COp):
...
@@ -1513,17 +1513,17 @@ class IncSubtensor(COp):
x
,
y
=
inputs
[:
2
]
x
,
y
=
inputs
[:
2
]
indices
=
list
(
reversed
(
inputs
[
2
:]))
indices
=
list
(
reversed
(
inputs
[
2
:]))
def
convert
(
entry
):
def
_
convert
(
entry
):
if
isinstance
(
entry
,
Type
):
if
isinstance
(
entry
,
Type
):
return
indices
.
pop
()
return
indices
.
pop
()
elif
isinstance
(
entry
,
slice
):
elif
isinstance
(
entry
,
slice
):
return
slice
(
return
slice
(
convert
(
entry
.
start
),
convert
(
entry
.
stop
),
convert
(
entry
.
step
)
_convert
(
entry
.
start
),
_convert
(
entry
.
stop
),
_
convert
(
entry
.
step
)
)
)
else
:
else
:
return
entry
return
entry
cdata
=
tuple
(
map
(
convert
,
self
.
idx_list
))
cdata
=
tuple
(
map
(
_
convert
,
self
.
idx_list
))
if
len
(
cdata
)
==
1
:
if
len
(
cdata
)
==
1
:
cdata
=
cdata
[
0
]
cdata
=
cdata
[
0
]
if
not
self
.
inplace
:
if
not
self
.
inplace
:
...
...
aesara/tensor/subtensor_opt.py
浏览文件 @
51de50be
...
@@ -67,7 +67,9 @@ from aesara.tensor.subtensor import (
...
@@ -67,7 +67,9 @@ from aesara.tensor.subtensor import (
as_index_constant
,
as_index_constant
,
as_index_literal
,
as_index_literal
,
get_canonical_form_slice
,
get_canonical_form_slice
,
get_constant_idx
,
get_idx_list
,
get_idx_list
,
get_slice_elements
,
inc_subtensor
,
inc_subtensor
,
)
)
from
aesara.tensor.type
import
TensorType
from
aesara.tensor.type
import
TensorType
...
@@ -347,7 +349,7 @@ def local_useless_slice(fgraph, node):
...
@@ -347,7 +349,7 @@ def local_useless_slice(fgraph, node):
# check if we removed something
# check if we removed something
if
last_slice
<
len
(
slices
):
if
last_slice
<
len
(
slices
):
subtens
=
Subtensor
(
slices
[:
last_slice
])
subtens
=
Subtensor
(
slices
[:
last_slice
])
sl_ins
=
Subtensor
.
collapse
(
sl_ins
=
get_slice_elements
(
slices
[:
last_slice
],
lambda
x
:
isinstance
(
x
,
Variable
)
slices
[:
last_slice
],
lambda
x
:
isinstance
(
x
,
Variable
)
)
)
out
=
subtens
(
node
.
inputs
[
0
],
*
sl_ins
)
out
=
subtens
(
node
.
inputs
[
0
],
*
sl_ins
)
...
@@ -518,7 +520,7 @@ def local_subtensor_merge(fgraph, node):
...
@@ -518,7 +520,7 @@ def local_subtensor_merge(fgraph, node):
merged_slices
=
tuple
(
as_index_constant
(
s
)
for
s
in
merged_slices
)
merged_slices
=
tuple
(
as_index_constant
(
s
)
for
s
in
merged_slices
)
subtens
=
Subtensor
(
merged_slices
)
subtens
=
Subtensor
(
merged_slices
)
sl_ins
=
Subtensor
.
collapse
(
sl_ins
=
get_slice_elements
(
merged_slices
,
lambda
x
:
isinstance
(
x
,
Variable
)
merged_slices
,
lambda
x
:
isinstance
(
x
,
Variable
)
)
)
# Do not call make_node for test_value
# Do not call make_node for test_value
...
@@ -766,7 +768,9 @@ def local_subtensor_make_vector(fgraph, node):
...
@@ -766,7 +768,9 @@ def local_subtensor_make_vector(fgraph, node):
# The index is a slice. If it's a constant slice, we can perform the
# The index is a slice. If it's a constant slice, we can perform the
# index operation here.
# index operation here.
try
:
try
:
const_slice
=
node
.
op
.
get_constant_idx
(
node
.
inputs
,
allow_partial
=
False
)[
0
]
const_slice
=
get_constant_idx
(
node
.
op
.
idx_list
,
node
.
inputs
,
allow_partial
=
False
)[
0
]
ret
=
make_vector_op
(
*
x
.
owner
.
inputs
[
const_slice
])
ret
=
make_vector_op
(
*
x
.
owner
.
inputs
[
const_slice
])
copy_stack_trace
(
node
.
outputs
,
ret
)
copy_stack_trace
(
node
.
outputs
,
ret
)
ret
=
patternbroadcast
(
ret
,
node
.
outputs
[
0
]
.
broadcastable
)
ret
=
patternbroadcast
(
ret
,
node
.
outputs
[
0
]
.
broadcastable
)
...
@@ -896,8 +900,11 @@ def local_useless_subtensor(fgraph, node):
...
@@ -896,8 +900,11 @@ def local_useless_subtensor(fgraph, node):
shape_of
=
fgraph
.
shape_feature
.
shape_of
shape_of
=
fgraph
.
shape_feature
.
shape_of
if
isinstance
(
node
.
op
,
Subtensor
):
if
isinstance
(
node
.
op
,
Subtensor
):
cdata
=
node
.
op
.
get_constant_idx
(
cdata
=
get_constant_idx
(
node
.
inputs
,
allow_partial
=
True
,
only_process_constants
=
True
node
.
op
.
idx_list
,
node
.
inputs
,
allow_partial
=
True
,
only_process_constants
=
True
,
)
)
for
pos
,
idx
in
enumerate
(
cdata
):
for
pos
,
idx
in
enumerate
(
cdata
):
if
not
isinstance
(
idx
,
slice
):
if
not
isinstance
(
idx
,
slice
):
...
...
aesara/tensor/var.py
浏览文件 @
51de50be
...
@@ -526,8 +526,8 @@ class _tensor_py_operators:
...
@@ -526,8 +526,8 @@ class _tensor_py_operators:
)
)
# Determine if advanced indexing is needed or not. The logic is
# Determine if advanced indexing is needed or not. The logic is
# already in `
Subtensor.convert
`: if it succeeds, standard indexing is
# already in `
index_vars_to_types
`: if it succeeds, standard indexing is
# used; if it fails with
AdvancedIndexingError
, advanced indexing is
# used; if it fails with
`AdvancedIndexingError`
, advanced indexing is
# used
# used
advanced
=
False
advanced
=
False
for
i
,
arg
in
enumerate
(
args
):
for
i
,
arg
in
enumerate
(
args
):
...
@@ -537,7 +537,7 @@ class _tensor_py_operators:
...
@@ -537,7 +537,7 @@ class _tensor_py_operators:
if
arg
is
not
np
.
newaxis
:
if
arg
is
not
np
.
newaxis
:
try
:
try
:
aet
.
subtensor
.
Subtensor
.
convert
(
arg
)
aet
.
subtensor
.
index_vars_to_types
(
arg
)
except
AdvancedIndexingError
:
except
AdvancedIndexingError
:
if
advanced
:
if
advanced
:
break
break
...
@@ -589,7 +589,7 @@ class _tensor_py_operators:
...
@@ -589,7 +589,7 @@ class _tensor_py_operators:
else
:
else
:
return
aet
.
subtensor
.
Subtensor
(
args
)(
return
aet
.
subtensor
.
Subtensor
(
args
)(
self
,
self
,
*
aet
.
subtensor
.
Subtensor
.
collapse
(
*
aet
.
subtensor
.
get_slice_elements
(
args
,
lambda
entry
:
isinstance
(
entry
,
Variable
)
args
,
lambda
entry
:
isinstance
(
entry
,
Variable
)
),
),
)
)
...
...
tests/tensor/test_subtensor.py
浏览文件 @
51de50be
...
@@ -23,6 +23,7 @@ from aesara.tensor.math import sum as aet_sum
...
@@ -23,6 +23,7 @@ from aesara.tensor.math import sum as aet_sum
from
aesara.tensor.subtensor
import
(
from
aesara.tensor.subtensor
import
(
AdvancedIncSubtensor
,
AdvancedIncSubtensor
,
AdvancedIncSubtensor1
,
AdvancedIncSubtensor1
,
AdvancedIndexingError
,
AdvancedSubtensor
,
AdvancedSubtensor
,
AdvancedSubtensor1
,
AdvancedSubtensor1
,
IncSubtensor
,
IncSubtensor
,
...
@@ -35,6 +36,7 @@ from aesara.tensor.subtensor import (
...
@@ -35,6 +36,7 @@ from aesara.tensor.subtensor import (
basic_shape
,
basic_shape
,
get_canonical_form_slice
,
get_canonical_form_slice
,
inc_subtensor
,
inc_subtensor
,
index_vars_to_types
,
indexed_result_shape
,
indexed_result_shape
,
set_subtensor
,
set_subtensor
,
take
,
take
,
...
@@ -2558,3 +2560,16 @@ def test_pprint_IncSubtensor(indices, set_instead_of_inc, exp_res):
...
@@ -2558,3 +2560,16 @@ def test_pprint_IncSubtensor(indices, set_instead_of_inc, exp_res):
z
=
tensor3
(
"z"
)
z
=
tensor3
(
"z"
)
y
=
inc_subtensor
(
x
[
indices
],
z
,
set_instead_of_inc
=
set_instead_of_inc
)
y
=
inc_subtensor
(
x
[
indices
],
z
,
set_instead_of_inc
=
set_instead_of_inc
)
assert
pprint
(
y
)
==
exp_res
assert
pprint
(
y
)
==
exp_res
def
test_index_vars_to_types
():
x
=
aet
.
as_tensor_variable
(
np
.
array
([
True
,
False
]))
with
pytest
.
raises
(
AdvancedIndexingError
):
index_vars_to_types
(
x
)
with
pytest
.
raises
(
TypeError
):
index_vars_to_types
(
1
)
res
=
index_vars_to_types
(
iscalar
)
assert
isinstance
(
res
,
scal
.
Scalar
)
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论