ListMemBuf< T_t, MAX, idx_t >::entry_t Struct Reference

holds data about an entry in the free/used lists More...

#include <ListMemBuf.h>

---

Detailed Description

template<class T_t, unsigned int MAX, class idx_t = unsigned short>
struct ListMemBuf< T_t, MAX, idx_t >::entry_t

holds data about an entry in the free/used lists

Definition at line 82 of file ListMemBuf.h.

List of all members.

Public Member Functions
	entry_t ()
	constructor
Public Attributes
double	data [(sizeof(T)-1)/sizeof(double)+1]
	The data being stored, not actually an instantiation of T, but big enough to hold it. (Funky array size is to ensure proper alignment of contents).
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 & Destructor Documentation

template<class T_t, unsigned int MAX, class idx_t = unsigned short>

ListMemBuf< T_t, MAX, idx_t >::entry_t::entry_t

(

)

constructor

Definition at line 84 of file ListMemBuf.h.

---

Member Data Documentation

template<class T_t, unsigned int MAX, class idx_t = unsigned short>

double ListMemBuf< T_t, MAX, idx_t >::entry_t::data[(sizeof(T)-1)/sizeof(double)+1]

The data being stored, not actually an instantiation of T, but big enough to hold it. (Funky array size is to ensure proper alignment of contents).

Definition at line 85 of file ListMemBuf.h.

Referenced by ListMemBuf< Move, MAXMOVE, Move_idx_t >::back(), ListMemBuf< Move, MAXMOVE, Move_idx_t >::front(), ListMemBuf< Move, MAXMOVE, Move_idx_t >::operator[](), and ListMemBuf< T_t, MAX, idx_t >::pop_free().

template<class T_t, unsigned int MAX, class idx_t = unsigned short>

index_t ListMemBuf< T_t, MAX, idx_t >::entry_t::next

The next element in the used or free chain.

Definition at line 86 of file ListMemBuf.h.

Referenced by ListMemBuf< T_t, MAX, idx_t >::clear(), ListMemBuf< T_t, MAX, idx_t >::erase(), ListMemBuf< T_t, MAX, idx_t >::ListMemBuf(), 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_back(), ListMemBuf< T_t, MAX, idx_t >::pop_free(), ListMemBuf< T_t, MAX, idx_t >::pop_front(), ListMemBuf< T_t, MAX, idx_t >::push_free(), and ListMemBuf< T_t, MAX, idx_t >::swap().

template<class T_t, unsigned int MAX, class idx_t = unsigned short>

index_t ListMemBuf< T_t, MAX, idx_t >::entry_t::prev

The previous element in the used chain, invalid if in the free chain.

Definition at line 87 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< T_t, MAX, idx_t >::pop_back(), ListMemBuf< T_t, MAX, idx_t >::pop_front(), ListMemBuf< Move, MAXMOVE, Move_idx_t >::prev(), and ListMemBuf< T_t, MAX, idx_t >::swap().

---

The documentation for this struct was generated from the following file:

• ListMemBuf.h