Skip to content
GitLab
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in
Toggle navigation
Menu
Open sidebar
Lst
lst-data-process-128
Commits
970aec43
Commit
970aec43
authored
May 18, 2016
by
legoc
Browse files
comments
parent
7a67c117
Pipeline
#337
skipped
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
src/lstdpp128/apps/common/IterativeVectorInsert.cpp
View file @
970aec43
...
...
@@ -71,36 +71,36 @@ int main(int argc, char * argv[]) {
cout
<<
listModeContext
<<
endl
;
// Define the algorithm using the class template EventArrayAlgorithm configured with the processor Insert.
//
EventArrayAlgorithm
<
Insert
>
algorithm
;
// Initialize
// Initialize
the Insert processor.
algorithm
.
processor
().
init
();
//
c
reat
ing
the event
s
//
C
reat
e
the event
array with a size (the size is not necessarily twice the size of the read buffer).
EventArray
events
(
blockSize
);
int
currentPercentage
=
0
;
// Measure the time for processing.
time_t
start
=
time
(
0
);
time_t
t1
=
start
;
//
reading list mode
//
Loop until there is no data.
while
(
true
)
{
//
r
ead
ing
next b
lock
//
R
ead
the
next b
uffer.
int32_t
size
=
reader
.
read
();
//
e
xit
ing
if
no data
//
E
xit if
the buffer is empty.
if
(
size
==
0
)
{
break
;
}
//
p
rocess
ing block
//
P
rocess
the buffer.
algorithm
.
process
(
reader
.
buffer
(),
size
,
events
);
}
// Call a terminal function.
algorithm
.
finish
(
events
);
// Print the results.
time_t
t2
=
time
(
0
);
cout
<<
"insertion terminated in "
<<
(
t2
-
t1
)
<<
"s"
<<
endl
;
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new 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