| 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< T_t, MAX, idx_t >::pop_free(). |
|
|||||
|
|||||
|
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 >::entry_t::entry_t(), 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< T_t, MAX, idx_t >::pop_back(), ListMemBuf< T_t, MAX, idx_t >::pop_front(), ListMemBuf< Waypoint, MAX_WAYPOINTS >::prev(), and ListMemBuf< T_t, MAX, idx_t >::swap(). |
|
Tekkotsu v2.3 |
Generated Sat Jan 29 02:27:35 2005 by Doxygen 1.4.0 |