Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
PointCloud
Flann
提交
ac536d4b
F
Flann
项目概览
PointCloud
/
Flann
通知
4
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
F
Flann
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
ac536d4b
编写于
12月 23, 2011
作者:
M
Marius Muja
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Renamed True/False enums to FLANN_True, FLANN_False to avoid conflicts
上级
dae66b0d
变更
5
隐藏空白更改
内联
并排
Showing
5 changed file
with
13 addition
and
21 deletion
+13
-21
src/cpp/flann/algorithms/dist.h
src/cpp/flann/algorithms/dist.h
+0
-8
src/cpp/flann/algorithms/lsh_index.h
src/cpp/flann/algorithms/lsh_index.h
+2
-2
src/cpp/flann/algorithms/nn_index.h
src/cpp/flann/algorithms/nn_index.h
+4
-4
src/cpp/flann/tbb/bodies.hpp
src/cpp/flann/tbb/bodies.hpp
+2
-2
src/cpp/flann/util/params.h
src/cpp/flann/util/params.h
+5
-5
未找到文件。
src/cpp/flann/algorithms/dist.h
浏览文件 @
ac536d4b
...
...
@@ -79,14 +79,6 @@ template<>
struct
Accumulator
<
int
>
{
typedef
float
Type
;
};
class
TrueType
{
};
class
FalseType
{
};
/**
* Squared Euclidean distance functor.
...
...
src/cpp/flann/algorithms/lsh_index.h
浏览文件 @
ac536d4b
...
...
@@ -198,7 +198,7 @@ public:
assert
(
dists
.
cols
>=
knn
);
int
count
=
0
;
if
(
params
.
use_heap
==
True
)
{
if
(
params
.
use_heap
==
FLANN_
True
)
{
KNNUniqueResultSet
<
DistanceType
>
resultSet
(
knn
);
for
(
size_t
i
=
0
;
i
<
queries
.
rows
;
i
++
)
{
resultSet
.
clear
();
...
...
@@ -239,7 +239,7 @@ public:
if
(
dists
.
size
()
<
queries
.
rows
)
dists
.
resize
(
queries
.
rows
);
int
count
=
0
;
if
(
params
.
use_heap
==
True
)
{
if
(
params
.
use_heap
==
FLANN_
True
)
{
KNNUniqueResultSet
<
DistanceType
>
resultSet
(
knn
);
for
(
size_t
i
=
0
;
i
<
queries
.
rows
;
i
++
)
{
resultSet
.
clear
();
...
...
src/cpp/flann/algorithms/nn_index.h
浏览文件 @
ac536d4b
...
...
@@ -89,11 +89,11 @@ public:
assert
(
dists
.
cols
>=
knn
);
bool
use_heap
;
if
(
params
.
use_heap
==
Undefined
)
{
if
(
params
.
use_heap
==
FLANN_
Undefined
)
{
use_heap
=
(
knn
>
KNN_HEAP_THRESHOLD
)
?
true
:
false
;
}
else
{
use_heap
=
(
params
.
use_heap
==
True
)
?
true
:
false
;
use_heap
=
(
params
.
use_heap
==
FLANN_
True
)
?
true
:
false
;
}
int
count
=
0
;
...
...
@@ -161,11 +161,11 @@ public:
{
assert
(
queries
.
cols
==
veclen
());
bool
use_heap
;
if
(
params
.
use_heap
==
Undefined
)
{
if
(
params
.
use_heap
==
FLANN_
Undefined
)
{
use_heap
=
(
knn
>
KNN_HEAP_THRESHOLD
)
?
true
:
false
;
}
else
{
use_heap
=
(
params
.
use_heap
==
True
)
?
true
:
false
;
use_heap
=
(
params
.
use_heap
==
FLANN_
True
)
?
true
:
false
;
}
if
(
indices
.
size
()
<
queries
.
rows
)
indices
.
resize
(
queries
.
rows
);
...
...
src/cpp/flann/tbb/bodies.hpp
浏览文件 @
ac536d4b
...
...
@@ -79,7 +79,7 @@ public:
*/
void
operator
()(
const
tbb
::
blocked_range
<
size_t
>&
r
)
const
{
if
(
params_
.
use_heap
==
True
)
if
(
params_
.
use_heap
==
FLANN_
True
)
{
KNNResultSet2
<
DistanceType
>
resultSet
(
knn_
);
for
(
size_t
i
=
r
.
begin
();
i
!=
r
.
end
();
++
i
)
...
...
@@ -169,7 +169,7 @@ public:
*/
void
operator
()(
const
tbb
::
blocked_range
<
size_t
>&
r
)
const
{
if
(
params_
.
use_heap
==
True
)
{
if
(
params_
.
use_heap
==
FLANN_
True
)
{
KNNResultSet2
<
DistanceType
>
resultSet
(
knn_
);
for
(
size_t
i
=
r
.
begin
();
i
!=
r
.
end
();
++
i
)
{
...
...
src/cpp/flann/util/params.h
浏览文件 @
ac536d4b
...
...
@@ -43,9 +43,9 @@ typedef std::map<std::string, any> IndexParams;
typedef
enum
{
False
=
0
,
True
=
1
,
Undefined
F
LANN_F
alse
=
0
,
FLANN_
True
=
1
,
FLANN_
Undefined
}
tri_type
;
struct
SearchParams
...
...
@@ -54,7 +54,7 @@ struct SearchParams
checks
(
checks_
),
eps
(
eps_
),
sorted
(
sorted_
)
{
max_neighbors
=
-
1
;
use_heap
=
Undefined
;
use_heap
=
FLANN_
Undefined
;
cores
=
1
;
matrices_in_gpu_ram
=
false
;
}
...
...
@@ -67,7 +67,7 @@ struct SearchParams
bool
sorted
;
// maximum number of neighbors radius search should return (-1 for unlimited)
int
max_neighbors
;
// use a heap to manage the result set (default: Undefined)
// use a heap to manage the result set (default:
FLANN_
Undefined)
tri_type
use_heap
;
// how many cores to assign to the search
// this parameter will be ignored if Intel TBB isn't available on the system or no "TBB" macro is defined
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录