LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH > Class Template Reference

#include <llptrskipmap.h>

Collaboration diagram for LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >:

Collaboration graph
[legend]

List of all members.

Public Member Functions

 LLPtrSkipMapNode ()
 LLPtrSkipMapNode (const INDEX_T &index)
 LLPtrSkipMapNode (const INDEX_T &index, DATA_T datap)
 ~LLPtrSkipMapNode ()
void deleteData ()
void removeData ()

Public Attributes

INDEX_T mIndex
DATA_T mData
LLPtrSkipMapNode * mForward [BINARY_DEPTH]

Private Member Functions

 LLPtrSkipMapNode (const LLPtrSkipMapNode &)
LLPtrSkipMapNode & operator= (const LLPtrSkipMapNode &rhs)

Detailed Description

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

Definition at line 39 of file llptrskipmap.h.

Constructor & Destructor Documentation

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMapNode (  )  [inline]

Definition at line 42 of file llptrskipmap.h.

References i, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex, NULL, and S32.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMapNode ( const INDEX_T &  index  )  [inline]

Definition at line 65 of file llptrskipmap.h.

References i, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, NULL, and S32.

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMapNode ( const INDEX_T &  index,
DATA_T  datap 
) [inline]

Definition at line 83 of file llptrskipmap.h.

References i, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData, LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mForward, NULL, and S32.

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

Definition at line 96 of file llptrskipmap.h.

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

Member Function Documentation

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
void LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::deleteData (  )  [inline]

Definition at line 101 of file llptrskipmap.h.

References LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData.

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

Here is the caller graph for this function:

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
void LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::removeData (  )  [inline]

Definition at line 108 of file llptrskipmap.h.

References LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData.

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

Here is the caller graph for this function:

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

Member Data Documentation

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
INDEX_T LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mIndex

Definition at line 113 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(), LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMapNode(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::reverseLookup().

template<class INDEX_T, class DATA_T, S32 BINARY_DEPTH = 8>
DATA_T LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::mData

Definition at line 114 of file llptrskipmap.h.

Referenced by LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::addData(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::checkData(), LLPtrSkipMapNode< 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(), LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMapNode(), LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::removeData(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::reverseLookup().

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

Definition at line 115 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 >::getLength(), LLPtrSkipMapNode< INDEX_T, DATA_T, BINARY_DEPTH >::LLPtrSkipMapNode(), LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::removeData(), and LLPtrSkipMap< INDEX_T, DATA_T, BINARY_DEPTH >::reverseLookup().

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