Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Pinoxchio
apollo
提交
1a4fe801
A
apollo
项目概览
Pinoxchio
/
apollo
与 Fork 源项目一致
从无法访问的项目Fork
通知
2
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
A
apollo
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
1a4fe801
编写于
12月 13, 2019
作者:
X
Xiangquan Xiao
提交者:
Jiaming Tao
12月 13, 2019
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Planning: Avoid duplicate code.
上级
4831bf88
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
1 addition
and
38 deletion
+1
-38
modules/planning/common/speed/st_boundary.cc
modules/planning/common/speed/st_boundary.cc
+0
-35
modules/planning/common/speed/st_boundary.h
modules/planning/common/speed/st_boundary.h
+1
-3
未找到文件。
modules/planning/common/speed/st_boundary.cc
浏览文件 @
1a4fe801
...
...
@@ -32,41 +32,6 @@ namespace planning {
using
apollo
::
common
::
math
::
LineSegment2d
;
using
apollo
::
common
::
math
::
Vec2d
;
STBoundary
::
STBoundary
(
const
std
::
vector
<
std
::
pair
<
STPoint
,
STPoint
>>&
point_pairs
)
{
CHECK
(
IsValid
(
point_pairs
))
<<
"The input point_pairs are NOT valid"
;
std
::
vector
<
std
::
pair
<
STPoint
,
STPoint
>>
reduced_pairs
(
point_pairs
);
RemoveRedundantPoints
(
&
reduced_pairs
);
for
(
const
auto
&
item
:
reduced_pairs
)
{
// use same t for both points
const
double
t
=
item
.
first
.
t
();
lower_points_
.
emplace_back
(
item
.
first
.
s
(),
t
);
upper_points_
.
emplace_back
(
item
.
second
.
s
(),
t
);
}
for
(
const
auto
&
point
:
lower_points_
)
{
points_
.
emplace_back
(
point
.
t
(),
point
.
s
());
}
for
(
auto
rit
=
upper_points_
.
rbegin
();
rit
!=
upper_points_
.
rend
();
++
rit
)
{
points_
.
emplace_back
(
rit
->
t
(),
rit
->
s
());
}
BuildFromPoints
();
for
(
const
auto
&
point
:
lower_points_
)
{
min_s_
=
std
::
fmin
(
min_s_
,
point
.
s
());
}
for
(
const
auto
&
point
:
upper_points_
)
{
max_s_
=
std
::
fmax
(
max_s_
,
point
.
s
());
}
min_t_
=
lower_points_
.
front
().
t
();
max_t_
=
lower_points_
.
back
().
t
();
obstacle_road_right_ending_t_
=
std
::
numeric_limits
<
double
>::
lowest
();
}
STBoundary
::
STBoundary
(
const
std
::
vector
<
std
::
pair
<
STPoint
,
STPoint
>>&
point_pairs
,
bool
is_accurate_boundary
)
{
...
...
modules/planning/common/speed/st_boundary.h
浏览文件 @
1a4fe801
...
...
@@ -45,11 +45,9 @@ class STBoundary : public common::math::Polygon2d {
* Each pair refers to a time t, with (lower_s, upper_s).
*/
STBoundary
()
=
default
;
explicit
STBoundary
(
const
std
::
vector
<
std
::
pair
<
STPoint
,
STPoint
>>&
point_pairs
);
explicit
STBoundary
(
const
std
::
vector
<
std
::
pair
<
STPoint
,
STPoint
>>&
point_pairs
,
bool
is_accurate_boundary
);
bool
is_accurate_boundary
=
false
);
explicit
STBoundary
(
const
common
::
math
::
Box2d
&
box
)
=
delete
;
explicit
STBoundary
(
std
::
vector
<
common
::
math
::
Vec2d
>
points
)
=
delete
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录