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
7f323097
Commit
7f323097
authored
May 19, 2016
by
legoc
Browse files
next
parent
6dc1cacc
Pipeline
#339
skipped
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
doc/UsersGuide.md
View file @
7f323097
...
...
@@ -88,14 +88,16 @@ There are two methods to read and process a file:
*
Use a simple reader event by event
*
Use a more advanced processor configured with an algorithm
An example of a simple reader
is provided
[
here
](
../src/lstdpp128/apps/common/SimpleReader.cpp
)
.
An example of a simple reader
application is provided by
[
SimpleReader.cpp
](
../src/lstdpp128/apps/common/SimpleReader.cpp
)
.
A more advanced strategy is to use a concept of algorithms used through arrays of events.
The advantage is that it is possible to read a block of events, sort them in time and process them.
It can be very interesting for very large files for which the entire sequence of events cannot reside in RAM.
The programmer defines a processor class and can use it by two read strategy (EventArray or EventBlockArray).
An example of such processor and algorithm is provided
[
here
](
../src/lstdpp128/apps/common/IterativeVectorInsert.cpp
)
.
An example of such processor and algorithm is provided by:
*
Processor
[
Insert.cpp
](
../src/lstdpp128/algorithm/common/Insert.h
)
[
Insert.cpp
]
(../src/lstdpp128/algorithm/common/Insert.cpp)
*
Main
[
IterativeVectorInsert.cpp
](
../src/lstdpp128/apps/common/IterativeVectorInsert.cpp
)
...
...
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