FASTAContainer<TFI_Vector> simply takes an existing vector of FASTAEntries and provides the same interface with a potentially huge speed benefit over FASTAContainer<TFI_File> since it does not need disk access, but at the cost of memory.
More...
#include <OpenMS/DATASTRUCTURES/FASTAContainer.h>
template<>
class OpenMS::FASTAContainer< TFI_Vector >
FASTAContainer<TFI_Vector> simply takes an existing vector of FASTAEntries and provides the same interface with a potentially huge speed benefit over FASTAContainer<TFI_File> since it does not need disk access, but at the cost of memory.
◆ FASTAContainer() [1/2]
◆ FASTAContainer() [2/2]
C'tor for already existing data (by reference).
An internal reference will be kept. Make sure the data is not deleted during the lifetime of FASTAContainer
◆ activateCache()
no-op (since data is already fully available as vector)
- Returns
- true only on the first call; false on subsequent calls
◆ cacheChunk()
no-op (since data is already fully available as vector)
- Returns
- true only on the first call; false on subsequent calls
◆ chunkAt()
fast access to chunked (i.e. all) entries
◆ chunkSize()
size_t chunkSize |
( |
| ) |
const |
|
inline |
active data spans the full range, i.e. size of container
- Returns
- the size of the underlying vector
◆ empty()
◆ getChunkOffset()
size_t getChunkOffset |
( |
| ) |
const |
|
inline |
always 0, since this specialization requires/supports no chunking
◆ readAt()
◆ reset()
required for template parameters!
◆ size()
calls size() on underlying vector
◆ activate_count_
◆ cache_count_
◆ data_
reference to existing data