Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
O
opencv
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Packages
Packages
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
submodule
opencv
Commits
032c363e
Commit
032c363e
authored
Aug 08, 2014
by
Maksim Shabunin
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Revert "Fix a heap issue with static on Windows"
This reverts commit
8e93c19d
.
parent
0be18aca
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
7 additions
and
13 deletions
+7
-13
lsh_table.h
modules/flann/include/opencv2/flann/lsh_table.h
+7
-13
No files found.
modules/flann/include/opencv2/flann/lsh_table.h
View file @
032c363e
...
...
@@ -346,27 +346,21 @@ inline LshTable<unsigned char>::LshTable(unsigned int feature_size, unsigned int
mask_
=
std
::
vector
<
size_t
>
((
size_t
)
ceil
((
float
)(
feature_size
*
sizeof
(
char
))
/
(
float
)
sizeof
(
size_t
)),
0
);
// A bit brutal but fast to code
static
std
::
vector
<
size_t
>
*
indices
=
NULL
;
static
std
::
vector
<
size_t
>
indices
(
feature_size
*
CHAR_BIT
)
;
//Ensure the Nth bit will be selected only once among the different LshTables
//to avoid having two different tables with signatures sharing many dimensions/many bits
if
(
indices
==
NULL
)
if
(
(
indices
.
size
()
==
feature_size
*
CHAR_BIT
)
||
(
indices
.
size
()
<
key_size_
)
)
{
indices
=
new
std
::
vector
<
size_t
>
(
feature_size
*
CHAR_BIT
);
}
else
if
(
indices
->
size
()
<
key_size_
)
{
indices
->
resize
(
feature_size
*
CHAR_BIT
);
for
(
size_t
i
=
0
;
i
<
feature_size
*
CHAR_BIT
;
++
i
)
{
(
*
indices
)[
i
]
=
i
;
}
std
::
random_shuffle
(
indices
->
begin
(),
indices
->
end
());
indices
.
resize
(
feature_size
*
CHAR_BIT
);
for
(
size_t
i
=
0
;
i
<
feature_size
*
CHAR_BIT
;
++
i
)
indices
[
i
]
=
i
;
std
::
random_shuffle
(
indices
.
begin
(),
indices
.
end
());
}
// Generate a random set of order of subsignature_size_ bits
for
(
unsigned
int
i
=
0
;
i
<
key_size_
;
++
i
)
{
size_t
index
=
(
*
indices
)
[
0
];
indices
->
erase
(
indices
->
begin
()
);
size_t
index
=
indices
[
0
];
indices
.
erase
(
indices
.
begin
()
);
// Set that bit in the mask
size_t
divisor
=
CHAR_BIT
*
sizeof
(
size_t
);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment