Each RTree leaf points to Datablocks; they describe where the actual data that the index references resides via a filename and an offset into that file.
More...
#include <RTree.h>
Each RTree leaf points to Datablocks; they describe where the actual data that the index references resides via a filename and an offset into that file.
| const stdString& RTree::Datablock::getDataFilename |
( |
| ) |
const |
|
inline |
The file name referenced by this entry.
| FileOffset RTree::Datablock::getDataOffset |
( |
| ) |
const |
|
inline |
The file offset of this entry.
| virtual bool RTree::Datablock::getNextChainedBlock |
( |
| ) |
|
|
pure virtual |
Get a sub-block that's under the current block.
A record might not only point to the 'main' data block,
the one originally inserted and commonly used
for data retrieval. It can also contain a chain of
data blocks that were inserted later (at a lower priority).
In case you care about those, invoke getNextChainedBlock()
until it returns false.
A possible usage scenario would be to
-
Start with a valid data block.
-
iterate over chained blocks until getNextChainedBlock() returns false
-
then continue with getNextDatablock()
To allow for this, getNextChainedBlock() will leave the data block 'valid' when it reaches the last chained block.
@exception GenericException on read error, or when called
while isValid() == false.
| virtual bool RTree::Datablock::getNextDatablock |
( |
| ) |
|
|
pure virtual |
Get the data block for the next time interval from the RTree.
- Returns
- true if one found. Otherwise, false is returned and isValid() will also indicate false.
- See Also
- getPrevDatablock
- Exceptions
-
| virtual bool RTree::Datablock::getPrevDatablock |
( |
| ) |
|
|
pure virtual |
| virtual bool RTree::Datablock::isValid |
( |
| ) |
const |
|
pure virtual |
- Returns
- true if this data block info is valid.
The documentation for this class was generated from the following file:
- /home/malitsky/projects/epics-archiver/sourceforge/trunk/ea4-cpp/include/common/storage/RTree.h
1.8.5