Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
59edf4f8
提交
59edf4f8
authored
7月 09, 2012
作者:
Nicolas Bouchard
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add tests and rewrite SpSum.
上级
56888c31
隐藏空白字符变更
内嵌
并排
正在显示
3 个修改的文件
包含
218 行增加
和
199 行删除
+218
-199
basic.py
theano/sparse/basic.py
+127
-64
sp.py
theano/sparse/sandbox/sp.py
+3
-70
test_basic.py
theano/sparse/tests/test_basic.py
+88
-65
没有找到文件。
theano/sparse/basic.py
浏览文件 @
59edf4f8
...
@@ -28,7 +28,6 @@ def register_specialize(lopt, *tags, **kwargs):
...
@@ -28,7 +28,6 @@ def register_specialize(lopt, *tags, **kwargs):
lopt
.
__name__
,
lopt
,
'fast_run'
,
lopt
.
__name__
,
lopt
,
'fast_run'
,
*
tags
)
*
tags
)
""" Types of sparse matrices to use for testing """
""" Types of sparse matrices to use for testing """
_mtypes
=
[
scipy
.
sparse
.
csc_matrix
,
scipy
.
sparse
.
csr_matrix
]
_mtypes
=
[
scipy
.
sparse
.
csc_matrix
,
scipy
.
sparse
.
csr_matrix
]
#_mtypes = [sparse.csc_matrix, sparse.csr_matrix, sparse.dok_matrix,
#_mtypes = [sparse.csc_matrix, sparse.csr_matrix, sparse.dok_matrix,
...
@@ -354,6 +353,7 @@ class SparseConstant(gof.Constant, _sparse_py_operators):
...
@@ -354,6 +353,7 @@ class SparseConstant(gof.Constant, _sparse_py_operators):
def
__repr__
(
self
):
def
__repr__
(
self
):
return
str
(
self
)
return
str
(
self
)
class
SparseType
(
gof
.
Type
):
class
SparseType
(
gof
.
Type
):
"""
"""
@type dtype: numpy dtype string such as 'int64' or 'float64' (among others)
@type dtype: numpy dtype string such as 'int64' or 'float64' (among others)
...
@@ -1286,54 +1286,148 @@ class Neg(gof.op.Op):
...
@@ -1286,54 +1286,148 @@ class Neg(gof.op.Op):
neg
=
Neg
()
neg
=
Neg
()
class
SpSum
(
gof
.
op
.
Op
):
class
ColScaleCSC
(
gof
.
op
.
Op
):
"""
TODO: rewrite
"""
Scale each columns of a sparse matrix by the
Scale each columns of a sparse matrix by the
corresponding element
corresponding element
of a dense vector
of a dense vector
"""
"""
axis
=
None
def
make_node
(
self
,
x
,
s
):
sparse_grad
=
False
if
x
.
format
!=
'csc'
:
raise
ValueError
(
'x was not a csc matrix'
)
return
gof
.
Apply
(
self
,
[
x
,
s
],
[
x
.
type
()])
def
__init__
(
self
,
axis
,
sparse_grad
=
True
):
def
perform
(
self
,
node
,
(
x
,
s
),
(
z
,)):
"""
M
,
N
=
x
.
shape
:param sparse_grad: if True, this instance ignores the
assert
x
.
format
==
'csc'
gradient on matrix elements which are implicitly 0.
assert
s
.
shape
==
(
N
,)
"""
y
=
x
.
copy
()
for
j
in
xrange
(
0
,
N
):
y
.
data
[
y
.
indptr
[
j
]:
y
.
indptr
[
j
+
1
]]
*=
s
[
j
]
z
[
0
]
=
y
def
grad
(
self
,
(
x
,
s
),
(
gz
,)):
return
[
col_scale
(
gz
,
s
),
sp_sum
(
x
*
gz
,
axis
=
0
)]
class
RowScaleCSC
(
gof
.
op
.
Op
):
"""
Scale each row of a sparse matrix by the corresponding element of
a dense vector
"""
def
make_node
(
self
,
x
,
s
):
return
gof
.
Apply
(
self
,
[
x
,
s
],
[
x
.
type
()])
def
perform
(
self
,
node
,
(
x
,
s
),
(
z
,)):
M
,
N
=
x
.
shape
assert
x
.
format
==
'csc'
assert
s
.
shape
==
(
M
,)
indices
=
x
.
indices
indptr
=
x
.
indptr
y_data
=
x
.
data
.
copy
()
for
j
in
xrange
(
0
,
N
):
for
i_idx
in
xrange
(
indptr
[
j
],
indptr
[
j
+
1
]):
y_data
[
i_idx
]
*=
s
[
indices
[
i_idx
]]
z
[
0
]
=
scipy
.
sparse
.
csc_matrix
((
y_data
,
indices
,
indptr
),
(
M
,
N
))
def
grad
(
self
,
(
x
,
s
),
(
gz
,)):
return
[
row_scale
(
gz
,
s
),
sp_sum
(
x
*
gz
,
axis
=
1
)]
def
col_scale
(
x
,
s
):
if
x
.
format
==
'csc'
:
return
ColScaleCSC
()(
x
,
s
)
elif
x
.
format
==
'csr'
:
return
RowScaleCSC
()(
x
.
T
,
s
)
.
T
else
:
raise
NotImplementedError
()
def
row_scale
(
x
,
s
):
return
col_scale
(
x
.
T
,
s
)
.
T
class
SpSum
(
gof
.
op
.
Op
):
"""Calculate the sum of a sparse matrix along a specify
axis.
It operates a reduction along the axis specified. When
`axis` is `None`, it is apply along all axis.
:param x: Sparse matrix.
:param axis: Axis along the sum is apply. Integers or `None`.
:param sparse_grad: `True` to have a structured grad. Boolean.
:return: The sum of `x` in a dense format.
:note:
- The grad implementation is controlled with the `sparse_grad`
parameter. `True` will provide a structured grad and `False`
will provide a regular grad.
- This op does not return a sparse matrix.
"""
def
__init__
(
self
,
axis
=
None
,
sparse_grad
=
False
):
super
(
SpSum
,
self
)
.
__init__
()
super
(
SpSum
,
self
)
.
__init__
()
self
.
axis
=
axis
self
.
axis
=
axis
self
.
s
parse_gra
d
=
sparse_grad
self
.
s
tructure
d
=
sparse_grad
if
self
.
axis
not
in
(
None
,
0
,
1
):
if
self
.
axis
not
in
(
None
,
0
,
1
):
raise
ValueError
(
'
illegal value for self.axis
'
)
raise
ValueError
(
'
Illegal value for self.axis.
'
)
def
__eq__
(
self
,
other
):
def
__eq__
(
self
,
other
):
#WARNING: judgement call...
# WARNING: judgement call...
#not using the sparse_grad in the comparison or hashing
# We are not using the structured in the comparison or hashing
#because it doesn't change the perform method therefore, we
# because it doesn't change the perform method therefore, we
#*do* want Sums with different sparse_grad values to be merged
# *do* want Sums with different structured values to be merged
#by the merge optimization.
# by the merge optimization and this requires them to compare equal.
# This requires them to compare equal.
return
type
(
self
)
==
type
(
other
)
and
self
.
axis
==
other
.
axis
return
type
(
self
)
==
type
(
other
)
and
self
.
axis
==
other
.
axis
def
__hash__
(
self
):
def
__hash__
(
self
):
# WARNING: judgement call...
# We are not using the structured in the comparison or hashing
# because it doesn't change the perform method therefore, we
# *do* want Sums with different structured values to be merged
# by the merge optimization and this requires them to compare equal.
return
76324
^
hash
(
type
(
self
))
^
hash
(
self
.
axis
)
return
76324
^
hash
(
type
(
self
))
^
hash
(
self
.
axis
)
def
__str__
(
self
):
return
self
.
__class__
.
__name__
+
"{axis=
%
s}"
%
str
(
self
.
axis
)
def
make_node
(
self
,
x
):
def
make_node
(
self
,
x
):
###
x
=
as_sparse_variable
(
x
)
# At least for small matrices (5x5), the .sum() method of a
# csc matrix returns a dense matrix as the result whether axis
# is 0 or 1... weird!
###
assert
isinstance
(
x
.
type
,
theano
.
sparse
.
SparseType
)
b
=
()
b
=
()
if
self
.
axis
is
not
None
:
if
self
.
axis
is
not
None
:
b
=
(
False
,)
b
=
(
False
,)
z
=
tensor
.
tensor
(
broadcastable
=
b
,
dtype
=
x
.
dtype
)
z
=
tensor
.
TensorType
(
broadcastable
=
b
,
dtype
=
x
.
dtype
)()
return
gof
.
Apply
(
self
,
[
x
],
[
z
])
return
gof
.
Apply
(
self
,
[
x
],
[
z
])
def
perform
(
self
,
node
,
(
x
,),
(
z
,)):
if
self
.
axis
==
None
:
z
[
0
]
=
numpy
.
asarray
(
x
.
sum
())
else
:
z
[
0
]
=
numpy
.
asarray
(
x
.
sum
(
self
.
axis
))
.
ravel
()
def
grad
(
self
,
(
x
,),
(
gz
,)):
if
self
.
structured
:
if
self
.
axis
is
None
:
r
=
gz
*
theano
.
sparse
.
sp_ones_like
(
x
)
elif
self
.
axis
==
0
:
r
=
col_scale
(
theano
.
sparse
.
sp_ones_like
(
x
),
gz
)
elif
self
.
axis
==
1
:
r
=
row_scale
(
theano
.
sparse
.
sp_ones_like
(
x
),
gz
)
else
:
raise
ValueError
(
'Illegal value for self.axis.'
)
else
:
# TODO
raise
NotImplementedError
()
return
[
r
]
def
infer_shape
(
self
,
node
,
shapes
):
def
infer_shape
(
self
,
node
,
shapes
):
r
=
None
r
=
None
if
self
.
axis
is
None
:
if
self
.
axis
is
None
:
...
@@ -1344,39 +1438,8 @@ class SpSum(gof.op.Op):
...
@@ -1344,39 +1438,8 @@ class SpSum(gof.op.Op):
r
=
[(
shapes
[
0
][
0
],)]
r
=
[(
shapes
[
0
][
0
],)]
return
r
return
r
def
perform
(
self
,
node
,
(
x
,),
(
z
,)):
def
__str__
(
self
):
if
self
.
axis
is
None
:
return
self
.
__class__
.
__name__
+
"{axis=
%
s}"
%
str
(
self
.
axis
)
z
[
0
]
=
numpy
.
asarray
(
x
.
sum
())
else
:
if
self
.
axis
==
0
:
if
x
.
format
==
'csc'
:
z
[
0
]
=
numpy
.
asarray
(
x
.
sum
(
axis
=
self
.
axis
))
.
reshape
(
(
x
.
shape
[
1
],
))
else
:
z
[
0
]
=
numpy
.
asarray
(
x
.
asformat
(
x
.
format
)
.
sum
(
axis
=
self
.
axis
))
.
reshape
((
x
.
shape
[
1
],))
elif
self
.
axis
==
1
:
if
x
.
format
==
'csr'
:
z
[
0
]
=
numpy
.
asarray
(
x
.
sum
(
axis
=
self
.
axis
))
.
reshape
(
(
x
.
shape
[
0
],))
else
:
z
[
0
]
=
numpy
.
asarray
(
x
.
asformat
(
x
.
format
)
.
sum
(
axis
=
self
.
axis
))
.
reshape
((
x
.
shape
[
0
],))
def
grad
(
self
,
(
x
,),
(
gz
,)):
if
self
.
axis
is
None
:
r
=
gz
*
theano
.
sparse
.
sp_ones_like
(
x
)
elif
self
.
axis
==
0
:
r
=
col_scale
(
theano
.
sparse
.
sp_ones_like
(
x
),
gz
)
elif
self
.
axis
==
1
:
r
=
row_scale
(
theano
.
sparse
.
sp_ones_like
(
x
),
gz
)
else
:
assert
False
if
not
self
.
sparse_grad
:
r
=
theano
.
sparse
.
dense_from_sparse
(
r
)
return
[
r
]
def
sp_sum
(
x
,
axis
=
None
,
sparse_grad
=
False
):
def
sp_sum
(
x
,
axis
=
None
,
sparse_grad
=
False
):
...
@@ -2293,7 +2356,7 @@ class HStack(gof.op.Op):
...
@@ -2293,7 +2356,7 @@ class HStack(gof.op.Op):
def
grad
(
self
,
inputs
,
(
gz
,
)):
def
grad
(
self
,
inputs
,
(
gz
,
)):
is_continuous
=
[(
inputs
[
i
]
.
dtype
in
tensor
.
continuous_dtypes
)
is_continuous
=
[(
inputs
[
i
]
.
dtype
in
tensor
.
continuous_dtypes
)
for
i
in
range
(
len
(
inputs
))]
for
i
in
range
(
len
(
inputs
))]
if
_is_sparse_variable
(
gz
):
if
_is_sparse_variable
(
gz
):
gz
=
DenseFromSparse
()(
gz
)
gz
=
DenseFromSparse
()(
gz
)
...
...
theano/sparse/sandbox/sp.py
浏览文件 @
59edf4f8
...
@@ -18,7 +18,9 @@ from theano.gof.python25 import all, any
...
@@ -18,7 +18,9 @@ from theano.gof.python25 import all, any
from
theano.sparse.basic
import
Remove0
,
remove0
from
theano.sparse.basic
import
Remove0
,
remove0
# To maintain compatibility
# To maintain compatibility
from
theano.sparse
import
SpSum
,
sp_sum
from
theano.sparse
import
(
SpSum
,
sp_sum
,
ColScaleCSC
,
RowScaleCSC
,
col_scale
,
row_scale
)
def
register_specialize
(
lopt
,
*
tags
,
**
kwargs
):
def
register_specialize
(
lopt
,
*
tags
,
**
kwargs
):
...
@@ -117,75 +119,6 @@ class SquareDiagonal(Op):
...
@@ -117,75 +119,6 @@ class SquareDiagonal(Op):
square_diagonal
=
SquareDiagonal
()
square_diagonal
=
SquareDiagonal
()
class
ColScaleCSC
(
Op
):
"""
Scale each columns of a sparse matrix by the corresponding element
of a dense vector
"""
def
make_node
(
self
,
x
,
s
):
if
x
.
format
!=
'csc'
:
raise
ValueError
(
'x was not a csc matrix'
)
return
gof
.
Apply
(
self
,
[
x
,
s
],
[
x
.
type
()])
def
perform
(
self
,
node
,
(
x
,
s
),
(
z
,)):
M
,
N
=
x
.
shape
assert
x
.
format
==
'csc'
assert
s
.
shape
==
(
N
,)
y
=
x
.
copy
()
for
j
in
xrange
(
0
,
N
):
y
.
data
[
y
.
indptr
[
j
]:
y
.
indptr
[
j
+
1
]]
*=
s
[
j
]
z
[
0
]
=
y
def
grad
(
self
,
(
x
,
s
),
(
gz
,)):
return
[
col_scale
(
gz
,
s
),
sp_sum
(
x
*
gz
,
axis
=
0
)]
class
RowScaleCSC
(
Op
):
"""
Scale each row of a sparse matrix by the corresponding element of
a dense vector
"""
def
make_node
(
self
,
x
,
s
):
return
gof
.
Apply
(
self
,
[
x
,
s
],
[
x
.
type
()])
def
perform
(
self
,
node
,
(
x
,
s
),
(
z
,)):
M
,
N
=
x
.
shape
assert
x
.
format
==
'csc'
assert
s
.
shape
==
(
M
,)
indices
=
x
.
indices
indptr
=
x
.
indptr
y_data
=
x
.
data
.
copy
()
for
j
in
xrange
(
0
,
N
):
for
i_idx
in
xrange
(
indptr
[
j
],
indptr
[
j
+
1
]):
y_data
[
i_idx
]
*=
s
[
indices
[
i_idx
]]
z
[
0
]
=
scipy_sparse
.
csc_matrix
((
y_data
,
indices
,
indptr
),
(
M
,
N
))
def
grad
(
self
,
(
x
,
s
),
(
gz
,)):
return
[
row_scale
(
gz
,
s
),
sp_sum
(
x
*
gz
,
axis
=
1
)]
def
col_scale
(
x
,
s
):
if
x
.
format
==
'csc'
:
return
ColScaleCSC
()(
x
,
s
)
elif
x
.
format
==
'csr'
:
return
RowScaleCSC
()(
x
.
T
,
s
)
.
T
else
:
raise
NotImplementedError
()
def
row_scale
(
x
,
s
):
return
col_scale
(
x
.
T
,
s
)
.
T
class
EnsureSortedIndices
(
Op
):
class
EnsureSortedIndices
(
Op
):
"""
"""
Remove explicit zeros from a sparse matrix, and resort indices
Remove explicit zeros from a sparse matrix, and resort indices
...
...
theano/sparse/tests/test_basic.py
浏览文件 @
59edf4f8
...
@@ -72,6 +72,49 @@ def random_lil(shape, dtype, nnz):
...
@@ -72,6 +72,49 @@ def random_lil(shape, dtype, nnz):
return
rval
return
rval
def
sparse_random_inputs
(
format
,
shape
,
n
=
1
,
out_dtype
=
None
,
p
=
0.5
):
"""Return a tuple containing everything needed to
perform a test.
If `out_dtype` is `None`, theano.config.floatX is
used.
:param format: Sparse format.
:param shape: Shape of data.
:param n: Number of variable.
:param out_dtype: dtype of output.
:param p: Sparsity proportion.
:return: (variable, data) where both `variable`
and `data` are list.
"""
if
out_dtype
is
None
:
out_dtype
=
theano
.
config
.
floatX
assert
0
<=
p
and
p
<=
1
assert
len
(
shape
)
==
2
assert
out_dtype
in
sparse
.
all_dtypes
variable
=
[
getattr
(
theano
.
sparse
,
format
+
'_matrix'
)(
dtype
=
out_dtype
)
for
k
in
range
(
n
)]
def
_rand
():
where
=
numpy
.
random
.
binomial
(
1
,
p
,
size
=
shape
)
.
astype
(
'int8'
)
if
out_dtype
in
sparse
.
discrete_dtypes
:
value
=
numpy
.
random
.
randint
(
20
,
size
=
shape
)
.
astype
(
out_dtype
)
else
:
value
=
numpy
.
random
.
random
(
shape
)
return
where
*
value
data
=
[
getattr
(
scipy
.
sparse
,
format
+
'_matrix'
)(
_rand
())
for
k
in
range
(
n
)]
return
(
variable
,
data
)
class
T_verify_grad_sparse
(
unittest
.
TestCase
):
class
T_verify_grad_sparse
(
unittest
.
TestCase
):
class
FailOp
(
gof
.
op
.
Op
):
class
FailOp
(
gof
.
op
.
Op
):
def
__init__
(
self
,
structured
):
def
__init__
(
self
,
structured
):
...
@@ -1329,71 +1372,51 @@ def test_size():
...
@@ -1329,71 +1372,51 @@ def test_size():
check
()
check
()
def
test_sp_sum
():
class
SpSumTester
(
utt
.
InferShapeTester
):
from
theano.sparse
import
SpSum
possible_axis
=
[
None
,
0
,
1
]
# TODO: test both grad.
def
setUp
(
self
):
rng
=
numpy
.
random
.
RandomState
(
42
)
super
(
SpSumTester
,
self
)
.
setUp
()
from
theano.sparse.basic
import
SparseFromDense
,
DenseFromSparse
self
.
op_class
=
sparse
.
SpSum
cases
=
[(
"csc"
,
scipy
.
sparse
.
csc_matrix
),
(
"csr"
,
scipy
.
sparse
.
csr_matrix
)]
self
.
op
=
sparse
.
sp_sum
for
format
,
cast
in
cases
:
def
test_op
(
self
):
for
format
in
sparse
.
sparse_formats
:
#print 'format: %(format)s' % locals()
for
axis
in
self
.
possible_axis
:
x
=
theano
.
sparse
.
SparseType
(
format
=
format
,
variable
,
data
=
sparse_random_inputs
(
format
,
dtype
=
theano
.
config
.
floatX
)()
shape
=
(
10
,
10
))
x_data
=
numpy
.
arange
(
20
)
.
reshape
(
5
,
4
)
.
astype
(
theano
.
config
.
floatX
)
z
=
theano
.
sparse
.
sp_sum
(
*
variable
,
axis
=
axis
)
# Sum on all axis
if
axis
==
None
:
#print 'sum on all axis...'
assert
z
.
type
.
broadcastable
==
()
z
=
theano
.
sparse
.
sp_sum
(
x
)
else
:
assert
z
.
type
.
broadcastable
==
()
assert
z
.
type
.
broadcastable
==
(
False
,
)
f
=
theano
.
function
([
x
],
z
)
x_val
=
cast
(
x_data
)
f
=
theano
.
function
(
variable
,
self
.
op
(
*
variable
,
axis
=
axis
))
out
=
f
(
x_val
)
tested
=
f
(
*
data
)
expected
=
x_val
.
sum
()
expected
=
data
[
0
]
.
todense
()
.
sum
(
axis
)
.
ravel
()
assert
out
==
expected
assert
numpy
.
allclose
(
tested
,
expected
)
# Sum on axis 0
def
test_infer_shape
(
self
):
#print 'sum on axis 0...'
for
format
in
sparse
.
sparse_formats
:
z
=
theano
.
sparse
.
sp_sum
(
x
,
axis
=
0
)
for
axis
in
self
.
possible_axis
:
assert
z
.
type
.
broadcastable
==
(
False
,)
variable
,
data
=
sparse_random_inputs
(
format
,
f
=
theano
.
function
([
x
],
z
)
shape
=
(
10
,
10
))
x_val
=
cast
(
x_data
)
self
.
_compile_and_check
(
variable
,
out
=
f
(
x_val
)
[
self
.
op
(
*
variable
,
axis
=
axis
)],
expected
=
x_val
.
sum
(
axis
=
0
)
data
,
assert
(
out
==
expected
)
.
all
()
self
.
op_class
)
# Sum on axis 1
def
test_grad
(
self
):
#print 'sum on axis 1...'
for
format
in
sparse
.
sparse_formats
:
z
=
theano
.
sparse
.
sp_sum
(
x
,
axis
=
1
)
for
axis
in
self
.
possible_axis
:
assert
z
.
type
.
broadcastable
==
(
False
,)
for
struct
in
[
True
]:
f
=
theano
.
function
([
x
],
z
)
variable
,
data
=
sparse_random_inputs
(
format
,
x_val
=
cast
(
x_data
)
shape
=
(
10
,
10
))
out
=
f
(
x_val
)
verify_grad_sparse
(
expected
=
numpy
.
asarray
(
x_val
.
sum
(
axis
=
1
))
.
reshape
(
x_val
.
shape
[
0
])
self
.
op_class
(
axis
=
axis
,
sparse_grad
=
struct
),
assert
(
out
==
expected
)
.
all
()
data
,
structured
=
struct
)
# Sparse gradient on Sum on all axis
# unfinished, and suspended until verify_grad get fixed
if
False
:
# print 'grad on sum on all axis...'
def
fun
(
x
):
## verify_grad does not handle sparse data, so here's some casting as a workaround.
# x is a dense matrix: make it sparse
sparse_var
=
SparseFromDense
(
format
)(
x
)
# apply op
dense_sum
=
theano
.
sparse
.
SpSum
(
axis
=
None
,
sparse_grad
=
False
)(
sparse_var
)
return
dense_sum
# cast back to dense so that verify_grad can work
dense_sum
=
theano
.
sparse
.
DenseFromSparse
()(
sparse_sum
)
return
dense_sum
x_val
=
x_data
.
copy
()
# print type(x_val)
import
pdb
;
pdb
.
set_trace
()
tensor
.
verify_grad
(
fun
,
[
x_val
],
rng
=
rng
)
#utt.verify_grad(SpSum(axis=None), [x_val])
# print 'ok'
class
Remove0Tester
(
utt
.
InferShapeTester
):
class
Remove0Tester
(
utt
.
InferShapeTester
):
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论