ddc
|
#include <ddcMMap.h>
Classes | |
struct | KeyLess |
Public Types | |
typedef ddcRecFile | RecFileT |
typedef vector< ValT > | VecT |
typedef map< KeyT, VecT > | MapT |
typedef KeyT | key_type |
typedef VecT | mapped_type |
typedef pair< KeyT, VecT > | value_type |
typedef RecFileT::iterator | iterator |
typedef RecFileT::const_iterator | const_iterator |
Public Member Functions | |
ddcMapFile () | |
ddcMapFile (const std::string &filename, size_t vsize_, bool useMMap=false) | |
construct and open More... | |
~ddcMapFile () | |
default destructor calls close() More... | |
void | clear () |
clear() method wraps close() More... | |
size_t | recsize () const |
returns the number of bytes per record More... | |
size_t | vecsize () const |
returns the number of elements per value-vector More... | |
size_t | size () const |
returns the number of records in this object More... | |
bool | empty () const |
STL-esque wrapper. More... | |
bool | opened () const |
returns true iff object is opened (or non-empty) More... | |
operator bool () const | |
implicit typecast to bool More... | |
VecT & | operator[] (const KeyT &key) |
indexing operator auto-demotes to slurp-mode More... | |
iterator | begin () |
iterator | end () |
const_iterator | begin () const |
const_iterator | end () const |
template<typename IterT > | |
const KeyT & | key (const IterT &it) const |
template<typename IterT > | |
const ValT * | val (const IterT &it) const |
const ValT * | find (const KeyT &key_) const |
simulate std::map::find(), returns NULL on error More... | |
ddcMapFile & | open (const std::string &filename, size_t vsize, bool useMMap=false) |
void | close () |
void | ensureMap () |
force map-implementation More... | |
Public Attributes | |
RecFileT | m_rfile |
data (read-only: mmap or slurp) More... | |
MapT | m_map |
data (read/write: demoted) More... | |
size_t | m_vsize |
number of elements per value-vector (constant) More... | |
simulate map<KeyT,ValT> using mmap, slurp, or demote. records should be stored as {KeyT,ValT[]} and sorted in ascending order by key
typedef ddcRecFile ddcMapFile< KeyT, ValT >::RecFileT |
typedef vector<ValT> ddcMapFile< KeyT, ValT >::VecT |
typedef map<KeyT, VecT> ddcMapFile< KeyT, ValT >::MapT |
typedef KeyT ddcMapFile< KeyT, ValT >::key_type |
typedef VecT ddcMapFile< KeyT, ValT >::mapped_type |
typedef pair<KeyT, VecT> ddcMapFile< KeyT, ValT >::value_type |
typedef RecFileT::iterator ddcMapFile< KeyT, ValT >::iterator |
typedef RecFileT::const_iterator ddcMapFile< KeyT, ValT >::const_iterator |
|
inline |
|
inline |
construct and open
|
inline |
default destructor calls close()
|
inline |
Referenced by CStringIndexSet::ConvertLoadIndexToWorkingIndex(), and CIndexSetForQueryingStage::DestroyIndexSet().
|
inline |
returns the number of bytes per record
|
inline |
returns the number of elements per value-vector
|
inline |
returns the number of records in this object
|
inline |
STL-esque wrapper.
|
inline |
returns true iff object is opened (or non-empty)
|
inline |
implicit typecast to bool
|
inline |
indexing operator auto-demotes to slurp-mode
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
simulate std::map::find(), returns NULL on error
Referenced by CIndexSetForQueryingStage::AddOccurs().
|
inline |
Referenced by CIndexSetForQueryingStage::LoadPeriodDivision().
|
inline |
|
inline |
force map-implementation
Referenced by CIndexSetForQueryingStage::BuildPeriodsDivisionAndCompress(), and CIndexSetForQueryingStage::WritePeriodsDivision().
RecFileT ddcMapFile< KeyT, ValT >::m_rfile |
data (read-only: mmap or slurp)
MapT ddcMapFile< KeyT, ValT >::m_map |
data (read/write: demoted)
Referenced by CIndexSetForQueryingStage::BuildPeriodsDivisionAndCompress(), and CIndexSetForQueryingStage::WritePeriodsDivision().
size_t ddcMapFile< KeyT, ValT >::m_vsize |
number of elements per value-vector (constant)