LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > Class Template Reference

#include <llptrskipmap.h>

List of all members.

Public Types

typedef BOOL(* compare )(const DATA_T &first, const DATA_T &second)
typedef compare insert_func
typedef compare equals_func

Public Member Functions

void init ()
 LLPtrSkipMap ()
 LLPtrSkipMap (insert_func insert_first, equals_func equals)
 ~LLPtrSkipMap ()
void setInsertFirst (insert_func insert_first)
void setEquals (equals_func equals)
DATA_T & addData (const INDEX_T &index, DATA_T datap)
DATA_T & addData (const INDEX_T &index)
DATA_T & getData (const INDEX_T &index)
DATA_T & operator[] (const INDEX_T &index)
DATA_T & getData (const INDEX_T &index, BOOL &b_new_entry)
BOOL getInterval (const INDEX_T &index, INDEX_T &index_before, INDEX_T &index_after, DATA_T &data_before, DATA_T &data_after)
BOOL checkData (const INDEX_T &index)
BOOL checkKey (const INDEX_T &index)
DATA_T getIfThere (const INDEX_T &index)
INDEX_T reverseLookup (const DATA_T datap)
S32 getLength ()
BOOL removeData (const INDEX_T &index)
BOOL deleteData (const INDEX_T &index)
void removeAllData ()
void deleteAllData ()
void resetList ()
DATA_T getCurrentDataWithoutIncrement ()
DATA_T getCurrentData ()
DATA_T getNextData ()
INDEX_T getNextKey ()
INDEX_T getCurrentKeyWithoutIncrement ()
void removeCurrentData ()
void deleteCurrentData ()
DATA_T getFirstData ()
INDEX_T getFirstKey ()

Static Public Member Functions

static BOOL defaultEquals (const INDEX_T &first, const INDEX_T &second)

Private Member Functions

 LLPtrSkipMap (const LLPtrSkipMap &)
LLPtrSkipMap & operator= (const LLPtrSkipMap &)

Private Attributes

LLPtrSkipMapNode< INDEX_T,
DATA_T, BINARY_DEPTH > 		mHead
LLPtrSkipMapNode< INDEX_T,
DATA_T, BINARY_DEPTH > * 		mUpdate [BINARY_DEPTH]
LLPtrSkipMapNode< INDEX_T,
DATA_T, BINARY_DEPTH > * 		mCurrentp
LLPtrSkipMapNode< INDEX_T,
DATA_T, BINARY_DEPTH > * 		mCurrentOperatingp
S32 mLevel
BOOL(* mInsertFirst )(const INDEX_T &first, const INDEX_T &second)
BOOL(* mEquals )(const INDEX_T &first, const INDEX_T &second)
S32 mNumberOfSteps

Detailed Description

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
class LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >

Definition at line 126 of file llptrskipmap.h.

Member Typedef Documentation

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
typedef BOOL(* LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::compare)(const DATA_T &first, const DATA_T &second)

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
typedef compare LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::insert_func

Definition at line 130 of file llptrskipmap.h.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
typedef compare LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::equals_func

Definition at line 131 of file llptrskipmap.h.

Constructor & Destructor Documentation

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMap (  )  [inline]

Definition at line 239 of file llptrskipmap.h.

References i, llendl, llerrs, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, NULL, and S32.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMap ( insert_func  insert_first,
equals_func  equals 
) [inline]

Definition at line 260 of file llptrskipmap.h.

References i, llendl, llerrs, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, NULL, and S32.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::~LLPtrSkipMap (  )  [inline]

Definition at line 283 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeAllData().

Here is the call graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMap ( const LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > &   )  [private]

Member Function Documentation

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
void LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::init (  ) 

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
void LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::setInsertFirst ( insert_func  insert_first  )  [inline]

Definition at line 289 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
void LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::setEquals ( equals_func  equals  )  [inline]

Definition at line 295 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T & LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::addData ( const INDEX_T &  index,
DATA_T  datap 
) [inline]

Definition at line 301 of file llptrskipmap.h.

References ll_frand(), LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, NULL, and S32.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData().

Here is the call graph for this function:

Here is the caller graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T & LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::addData ( const INDEX_T &  index  )  [inline]

Definition at line 377 of file llptrskipmap.h.

References ll_frand(), LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, NULL, and S32.

Here is the call graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T & LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData ( const INDEX_T &  index  )  [inline]

Definition at line 443 of file llptrskipmap.h.

References ll_frand(), LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mNumberOfSteps, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, NULL, and S32.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::operator[]().

Here is the call graph for this function:

Here is the caller graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T & LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::operator[] ( const INDEX_T &  index  )  [inline]

Definition at line 601 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData().

Here is the call graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T & LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData ( const INDEX_T &  index,
BOOL &  b_new_entry 
) [inline]

Definition at line 610 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::addData(), LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mNumberOfSteps, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, S32, and TRUE.

Here is the call graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
BOOL LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getInterval ( const INDEX_T &  index,
INDEX_T &  index_before,
INDEX_T &  index_after,
DATA_T &  data_before,
DATA_T &  data_after 
) [inline]

Definition at line 522 of file llptrskipmap.h.

References FALSE, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mNumberOfSteps, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, S32, and TRUE.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
BOOL LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkData ( const INDEX_T &  index  )  [inline]

Definition at line 668 of file llptrskipmap.h.

References FALSE, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, and S32.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
BOOL LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkKey ( const INDEX_T &  index  )  [inline]

Definition at line 722 of file llptrskipmap.h.

References FALSE, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, and S32.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getIfThere ( const INDEX_T &  index  )  [inline]

Definition at line 773 of file llptrskipmap.h.

References LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mNumberOfSteps, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, and S32.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
INDEX_T LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::reverseLookup ( const DATA_T  datap  )  [inline]

Definition at line 830 of file llptrskipmap.h.

References LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, and LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
S32 LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getLength (  )  [inline]

Definition at line 850 of file llptrskipmap.h.

References LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, and NULL.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
BOOL LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData ( const INDEX_T &  index  )  [inline]

Definition at line 863 of file llptrskipmap.h.

References FALSE, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::removeData(), S32, and TRUE.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeCurrentData().

Here is the call graph for this function:

Here is the caller graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
BOOL LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData ( const INDEX_T &  index  )  [inline]

Definition at line 955 of file llptrskipmap.h.

References LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData(), FALSE, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, S32, and TRUE.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteCurrentData().

Here is the call graph for this function:

Here is the caller graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
void LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeAllData (  )  [inline]

Definition at line 1048 of file llptrskipmap.h.

References i, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, NULL, and S32.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::~LLPtrSkipMap().

Here is the caller graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
void LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteAllData (  )  [inline]

Definition at line 1074 of file llptrskipmap.h.

References i, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate, NULL, and S32.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
void LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::resetList (  )  [inline]

Definition at line 1101 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getCurrentDataWithoutIncrement (  )  [inline]

Definition at line 1110 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getCurrentData (  )  [inline]

Definition at line 1125 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getNextData (  )  [inline]

Definition at line 1142 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
INDEX_T LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getNextKey (  )  [inline]

Definition at line 1158 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
INDEX_T LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getCurrentKeyWithoutIncrement (  )  [inline]

Definition at line 1174 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
void LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeCurrentData (  )  [inline]

Definition at line 1191 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData().

Here is the call graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
void LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteCurrentData (  )  [inline]

Definition at line 1200 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp.

Here is the call graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
DATA_T LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getFirstData (  )  [inline]

Definition at line 1210 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH>
INDEX_T LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getFirstKey (  )  [inline]

Definition at line 1228 of file llptrskipmap.h.

References LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp, LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp, and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
static BOOL LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::defaultEquals ( const INDEX_T &  first,
const INDEX_T &  second 
) [inline, static]

Definition at line 211 of file llptrskipmap.h.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
LLPtrSkipMap& LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::operator= ( const LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH > &   )  [private]

Member Data Documentation

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
LLPtrSkipMapNode<INDEX_T, DATA_T, BINARY_DEPTH> LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mHead [private]

Definition at line 222 of file llptrskipmap.h.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::addData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteAllData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getFirstData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getFirstKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getIfThere(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getInterval(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getLength(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getNextKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMap(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeAllData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::resetList(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::reverseLookup().

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
LLPtrSkipMapNode<INDEX_T, DATA_T, BINARY_DEPTH>* LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mUpdate[BINARY_DEPTH] [private]

Definition at line 223 of file llptrskipmap.h.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::addData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteAllData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getIfThere(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getInterval(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMap(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeAllData(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData().

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
LLPtrSkipMapNode<INDEX_T, DATA_T, BINARY_DEPTH>* LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentp [private]

Definition at line 224 of file llptrskipmap.h.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteAllData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getCurrentData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getFirstData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getFirstKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getNextData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getNextKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMap(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeAllData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::resetList().

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
LLPtrSkipMapNode<INDEX_T, DATA_T, BINARY_DEPTH>* LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mCurrentOperatingp [private]

Definition at line 225 of file llptrskipmap.h.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteAllData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteCurrentData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getCurrentData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getCurrentDataWithoutIncrement(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getCurrentKeyWithoutIncrement(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getFirstData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getFirstKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getNextData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getNextKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMap(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeAllData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeCurrentData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::resetList().

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
S32 LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mLevel [private]

Definition at line 226 of file llptrskipmap.h.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::addData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getIfThere(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getInterval(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMap(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData().

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
BOOL(* LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mInsertFirst)(const INDEX_T &first, const INDEX_T &second) [private]

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::addData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getIfThere(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getInterval(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::setInsertFirst().

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
BOOL(* LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mEquals)(const INDEX_T &first, const INDEX_T &second) [private]

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::addData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkKey(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getIfThere(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::setEquals().

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
S32 LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::mNumberOfSteps [private]

Definition at line 229 of file llptrskipmap.h.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getIfThere(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::getInterval().

The documentation for this class was generated from the following file:
Generated on Fri May 16 09:01:00 2008 for SecondLife by  doxygen 1.5.5