Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
机器未来
Paddle
提交
7429067a
P
Paddle
项目概览
机器未来
/
Paddle
与 Fork 源项目一致
Fork自
PaddlePaddle / Paddle
通知
1
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
1
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
P
Paddle
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
1
Issue
1
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
7429067a
编写于
9月 11, 2018
作者:
B
bingyanghuang
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
clean code
上级
cdbc5e73
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
16 addition
and
15 deletion
+16
-15
paddle/fluid/operators/math/sequence_pooling.cc
paddle/fluid/operators/math/sequence_pooling.cc
+16
-15
未找到文件。
paddle/fluid/operators/math/sequence_pooling.cc
浏览文件 @
7429067a
...
@@ -113,34 +113,35 @@ class LastFirstSeqPoolFunctor {
...
@@ -113,34 +113,35 @@ class LastFirstSeqPoolFunctor {
auto
*
in_data
=
input
.
data
<
T
>
();
auto
*
in_data
=
input
.
data
<
T
>
();
auto
*
out_data
=
output
->
data
<
T
>
();
auto
*
out_data
=
output
->
data
<
T
>
();
//Calculate
length of each word
//Calculate
the size of each item in sequence
int64_t
word_len
=
input
.
numel
()
/
input
.
dims
()[
0
];
int64_t
item_size
=
input
.
numel
()
/
input
.
dims
()[
0
];
auto
lod
=
input
.
lod
()[
0
];
auto
lod
=
input
.
lod
()[
0
];
int
seq_num
=
static_cast
<
int
>
(
lod
.
size
())
-
1
;
if
(
pooltype
==
"LAST"
){
if
(
pooltype
==
"LAST"
){
for
(
int
i
=
0
;
i
<
s
tatic_cast
<
int
>
(
lod
.
size
())
-
1
;
++
i
){
for
(
int
i
=
0
;
i
<
s
eq_num
;
++
i
){
//Calculate the length of each sequence
//Calculate the length of each sequence
int64_t
seq_len
=
static_cast
<
int64_t
>
(
lod
[
i
+
1
]
-
lod
[
i
]);
int64_t
seq_len
=
static_cast
<
int64_t
>
(
lod
[
i
+
1
]
-
lod
[
i
]);
//Point to the begin of next sequence
//Point to the begin of next sequence
in_data
+=
seq_len
*
word_len
;
in_data
+=
seq_len
*
item_size
;
//Copy the last words to output
//Copy the last item to output
std
::
memcpy
(
out_data
,(
in_data
-
word_len
),
word_len
*
sizeof
(
T
));
std
::
memcpy
(
out_data
,(
in_data
-
item_size
),
item_size
*
sizeof
(
T
));
out_data
+=
word_len
;
out_data
+=
item_size
;
}
}
}
}
else
if
(
pooltype
==
"FIRST"
){
else
if
(
pooltype
==
"FIRST"
){
for
(
int
i
=
0
;
i
<
s
tatic_cast
<
int
>
(
lod
.
size
())
-
1
;
++
i
){
for
(
int
i
=
0
;
i
<
s
eq_num
;
++
i
){
//Calculate the length of each sequence
//Calculate the length of each sequence
int64_t
seq_len
=
static_cast
<
int64_t
>
(
lod
[
i
+
1
]
-
lod
[
i
]);
int64_t
seq_len
=
static_cast
<
int64_t
>
(
lod
[
i
+
1
]
-
lod
[
i
]);
//Copy the first
words
of sequence to output
//Copy the first
item
of sequence to output
std
::
memcpy
(
out_data
,
in_data
,
word_len
*
sizeof
(
T
));
std
::
memcpy
(
out_data
,
in_data
,
item_size
*
sizeof
(
T
));
//Point to the next sequence
//Point to the next sequence
in_data
+=
seq_len
*
word_len
;
in_data
+=
seq_len
*
item_size
;
out_data
+=
word_len
;
out_data
+=
item_size
;
}
}
}
}
else
{
PADDLE_THROW
(
"it's not LAST or FIRST pool type"
);
}
}
}
};
};
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录