Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
lst-data-process-128
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Lst
lst-data-process-128
Commits
970aec43
There was a problem fetching the pipeline summary.
Commit
970aec43
authored
9 years ago
by
legoc
Browse files
Options
Downloads
Patches
Plain Diff
comments
parent
7a67c117
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Pipeline
#
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/lstdpp128/apps/common/IterativeVectorInsert.cpp
+9
-9
9 additions, 9 deletions
src/lstdpp128/apps/common/IterativeVectorInsert.cpp
with
9 additions
and
9 deletions
src/lstdpp128/apps/common/IterativeVectorInsert.cpp
+
9
−
9
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
;
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
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!
Save comment
Cancel
Please
register
or
sign in
to comment