Homepage | Demos | Overview | Downloads | Tutorials | Reference | Credits |
ListMemBuf< T_t, MAX, idx_t >::entry_t Struct Reference#include <ListMemBuf.h>
Detailed Descriptiontemplate<class T_t, unsigned int MAX, class idx_t = unsigned short>
holds data about an entry in the free/used lists
|
Public Member Functions | |
entry_t () | |
constructor | |
Public Attributes | |
T | data |
The data being stored, not actually an instantiation of T, but big enough to hold it. | |
index_t | next |
The next element in the used or free chain. | |
index_t | prev |
The previous element in the used chain, invalid if in the free chain. |
|
constructor
Definition at line 80 of file ListMemBuf.h. |
|
The data being stored, not actually an instantiation of T, but big enough to hold it.
Definition at line 81 of file ListMemBuf.h. Referenced by ListMemBuf< T_t, MAX, idx_t >::entry_t::entry_t(), and ListMemBuf< Move, MAXMOVE, Move_idx_t >::operator[](). |
|
The next element in the used or free chain.
Definition at line 82 of file ListMemBuf.h. Referenced by ListMemBuf< T_t, MAX, idx_t >::erase(), ListMemBuf< T_t, MAX, idx_t >::new_back(), ListMemBuf< T_t, MAX, idx_t >::new_before(), ListMemBuf< T_t, MAX, idx_t >::new_front(), ListMemBuf< Move, MAXMOVE, Move_idx_t >::next(), ListMemBuf< T_t, MAX, idx_t >::pop_free(), ListMemBuf< T_t, MAX, idx_t >::pop_front(), and ListMemBuf< T_t, MAX, idx_t >::swap(). |
|
The previous element in the used chain, invalid if in the free chain.
Definition at line 83 of file ListMemBuf.h. Referenced by ListMemBuf< T_t, MAX, idx_t >::new_back(), ListMemBuf< T_t, MAX, idx_t >::new_before(), ListMemBuf< T_t, MAX, idx_t >::new_front(), ListMemBuf< T_t, MAX, idx_t >::pop_back(), ListMemBuf< Move, MAXMOVE, Move_idx_t >::prev(), and ListMemBuf< T_t, MAX, idx_t >::swap(). |
Tekkotsu v2.1 |
Generated Tue Mar 16 23:22:14 2004 by Doxygen 1.3.5 |