addData(const INDEX_T &index, DATA_T datap) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
addData(const INDEX_T &index) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
checkData(const INDEX_T &index) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
checkKey(const INDEX_T &index) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
compare typedef | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | |
defaultEquals(const INDEX_T &first, const INDEX_T &second) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline, static] |
deleteAllData() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
deleteCurrentData() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
deleteData(const INDEX_T &index) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
equals_func typedef | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | |
getCurrentData() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getCurrentDataWithoutIncrement() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getCurrentKeyWithoutIncrement() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getData(const INDEX_T &index) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getData(const INDEX_T &index, BOOL &b_new_entry) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getFirstData() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getFirstKey() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getIfThere(const INDEX_T &index) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getInterval(const INDEX_T &index, INDEX_T &index_before, INDEX_T &index_after, DATA_T &data_before, DATA_T &data_after) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getLength() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getNextData() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
getNextKey() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
init() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | |
insert_func typedef | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | |
LLPtrSkipMap() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
LLPtrSkipMap(insert_func insert_first, equals_func equals) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
LLPtrSkipMap(const LLPtrSkipMap &) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
mCurrentOperatingp | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
mCurrentp | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
mEquals | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
mHead | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
mInsertFirst | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
mLevel | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
mNumberOfSteps | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
mUpdate | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
operator=(const LLPtrSkipMap &) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [private] |
operator[](const INDEX_T &index) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
removeAllData() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | |
removeCurrentData() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
removeData(const INDEX_T &index) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
resetList() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
reverseLookup(const DATA_T datap) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
setEquals(equals_func equals) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
setInsertFirst(insert_func insert_first) | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |
~LLPtrSkipMap() | LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > | [inline] |