Inexor
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Public Member Functions | Public Attributes | List of all members
queue< T, SIZE > Struct Template Reference

Legacy implementation of queues. More...

#include <cube_queue.hpp>

Inheritance diagram for queue< T, SIZE >:
reversequeue< T, SIZE >

Public Member Functions

 queue ()
 
void clear ()
 
int length () const
 
bool empty () const
 
bool full () const
 
bool inrange (size_t i) const
 
bool inrange (int i) const
 
T & added ()
 
T & added (int offset)
 
T & adding ()
 
T & adding (int offset)
 
T & add ()
 
T & add (const T &e)
 
T & pop ()
 
T & removing ()
 
T & removing (int offset)
 
T & remove ()
 
T & operator[] (int offset)
 
const T & operator[] (int offset) const
 

Public Attributes

int head
 
int tail
 
int len
 
data [SIZE]
 

Detailed Description

template<class T, int SIZE>
struct queue< T, SIZE >

Legacy implementation of queues.

It's strongly advised to avoid these struct in new code. Use the stdlib (std::queue) in new code or an optimized thirdparty lib.

Constructor & Destructor Documentation

template<class T, int SIZE>
queue< T, SIZE >::queue ( )
inline

Member Function Documentation

template<class T, int SIZE>
T& queue< T, SIZE >::add ( )
inline
template<class T, int SIZE>
T& queue< T, SIZE >::add ( const T &  e)
inline
template<class T, int SIZE>
T& queue< T, SIZE >::added ( )
inline
template<class T, int SIZE>
T& queue< T, SIZE >::added ( int  offset)
inline
template<class T, int SIZE>
T& queue< T, SIZE >::adding ( )
inline
template<class T, int SIZE>
T& queue< T, SIZE >::adding ( int  offset)
inline
template<class T, int SIZE>
void queue< T, SIZE >::clear ( )
inline
template<class T, int SIZE>
bool queue< T, SIZE >::empty ( ) const
inline
template<class T, int SIZE>
bool queue< T, SIZE >::full ( ) const
inline
template<class T, int SIZE>
bool queue< T, SIZE >::inrange ( size_t  i) const
inline
template<class T, int SIZE>
bool queue< T, SIZE >::inrange ( int  i) const
inline
template<class T, int SIZE>
int queue< T, SIZE >::length ( ) const
inline
template<class T, int SIZE>
T& queue< T, SIZE >::operator[] ( int  offset)
inline
template<class T, int SIZE>
const T& queue< T, SIZE >::operator[] ( int  offset) const
inline
template<class T, int SIZE>
T& queue< T, SIZE >::pop ( )
inline
template<class T, int SIZE>
T& queue< T, SIZE >::remove ( )
inline
template<class T, int SIZE>
T& queue< T, SIZE >::removing ( )
inline
template<class T, int SIZE>
T& queue< T, SIZE >::removing ( int  offset)
inline

Member Data Documentation

template<class T, int SIZE>
T queue< T, SIZE >::data[SIZE]
template<class T, int SIZE>
int queue< T, SIZE >::head
template<class T, int SIZE>
int queue< T, SIZE >::len
template<class T, int SIZE>
int queue< T, SIZE >::tail

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