MRPT  1.9.9
xsens::FifoQueueBasic< T > Class Template Reference

Detailed Description

template<class T>
class xsens::FifoQueueBasic< T >

A FIFO queue with limited length (cyclic).

The class is based on the STL queue class, but has a limited size. If more items are inserted than would fit, the oldest item is overwritten. The class can only handle non-pointer types.

Definition at line 282 of file xsens_fifoqueue.h.

#include <xSens_MT3/xsens_fifoqueue.h>

Public Types

typedef T value_type
 The type of the value stored in this queue. More...
 
typedef size_t size_type
 The type of a 'size' value. More...
 

Public Member Functions

 FifoQueueBasic (size_type size=16)
 Create an empty queue with capacity size. More...
 
 FifoQueueBasic (const FifoQueueBasic< T > &q)
 The copy constructor. More...
 
void eraseAndClear (void)
 
 ~FifoQueueBasic ()
 The destructor. More...
 
FifoQueueBasic< T > & operator= (const FifoQueueBasic< T > &q)
 The assignment operator. More...
 
void resize (const size_t size)
 Resize the queue, note that this function clears the queue. More...
 
bool empty () const
 Return true if the queue is empty. More...
 
size_type size () const
 Return the maximum number of elements in the queue. More...
 
size_type length () const
 Return the number of elements currnetly in the queue. More...
 
value_typefront ()
 Return the oldest element in the queue. More...
 
const value_typefront () const
 Return the oldest element in the queue. More...
 
value_typeback ()
 Return the newest element in the queue. More...
 
const value_typeback () const
 Return the newest element in the queue. More...
 
void push (const value_type &x)
 Insert x at the back of the queue. More...
 
void push_front (const value_type &x)
 Insert x at the front of the queue (LIFO operation). More...
 
void pop (void)
 Remove the element at the front of the queue. More...
 
void popBack (void)
 Remove the element at the back of the queue. More...
 
const value_typeoperator[] (size_t index) const
 Return the index'th oldest item from the queue. More...
 
value_typeoperator[] (size_t index)
 Return the index'th oldest item from the queue. More...
 
void clear (void)
 
void remove (size_t index)
 

Protected Attributes

size_t m_maxCount
 
size_t m_currentCount
 
size_t m_first
 
T * m_list
 

Member Typedef Documentation

◆ size_type

template<class T>
typedef size_t xsens::FifoQueueBasic< T >::size_type

The type of a 'size' value.

Definition at line 316 of file xsens_fifoqueue.h.

◆ value_type

template<class T>
typedef T xsens::FifoQueueBasic< T >::value_type

The type of the value stored in this queue.

Definition at line 314 of file xsens_fifoqueue.h.

Constructor & Destructor Documentation

◆ FifoQueueBasic() [1/2]

template<class T>
xsens::FifoQueueBasic< T >::FifoQueueBasic ( size_type  size = 16)
inline

Create an empty queue with capacity size.

Definition at line 319 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_currentCount, xsens::FifoQueueBasic< T >::m_first, xsens::FifoQueueBasic< T >::m_list, xsens::FifoQueueBasic< T >::m_maxCount, QUEUELOG, and xsens::FifoQueueBasic< T >::size().

Here is the call graph for this function:

◆ FifoQueueBasic() [2/2]

◆ ~FifoQueueBasic()

Member Function Documentation

◆ back() [1/2]

template<class T>
value_type& xsens::FifoQueueBasic< T >::back ( )
inline

◆ back() [2/2]

template<class T>
const value_type& xsens::FifoQueueBasic< T >::back ( ) const
inline

◆ clear()

◆ empty()

template<class T>
bool xsens::FifoQueueBasic< T >::empty ( ) const
inline

Return true if the queue is empty.

Definition at line 407 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_currentCount.

◆ eraseAndClear()

◆ front() [1/2]

template<class T>
value_type& xsens::FifoQueueBasic< T >::front ( )
inline

Return the oldest element in the queue.

Definition at line 413 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_first, and xsens::FifoQueueBasic< T >::m_list.

◆ front() [2/2]

template<class T>
const value_type& xsens::FifoQueueBasic< T >::front ( ) const
inline

Return the oldest element in the queue.

Definition at line 415 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_first, and xsens::FifoQueueBasic< T >::m_list.

◆ length()

template<class T>
size_type xsens::FifoQueueBasic< T >::length ( ) const
inline

Return the number of elements currnetly in the queue.

Definition at line 411 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_currentCount.

◆ operator=()

◆ operator[]() [1/2]

template<class T>
const value_type& xsens::FifoQueueBasic< T >::operator[] ( size_t  index) const
inline

◆ operator[]() [2/2]

template<class T>
value_type& xsens::FifoQueueBasic< T >::operator[] ( size_t  index)
inline

◆ pop()

template<class T>
void xsens::FifoQueueBasic< T >::pop ( void  )
inline

Remove the element at the front of the queue.

Definition at line 458 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_currentCount, xsens::FifoQueueBasic< T >::m_first, xsens::FifoQueueBasic< T >::m_maxCount, and QUEUELOG.

Referenced by xsens::FifoQueueBasic< T >::remove().

Here is the caller graph for this function:

◆ popBack()

template<class T>
void xsens::FifoQueueBasic< T >::popBack ( void  )
inline

Remove the element at the back of the queue.

Definition at line 471 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_currentCount, xsens::FifoQueueBasic< T >::m_maxCount, and QUEUELOG.

◆ push()

template<class T>
void xsens::FifoQueueBasic< T >::push ( const value_type x)
inline

◆ push_front()

template<class T>
void xsens::FifoQueueBasic< T >::push_front ( const value_type x)
inline

◆ remove()

template<class T>
void xsens::FifoQueueBasic< T >::remove ( size_t  index)
inline

Definition at line 506 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_currentCount, xsens::FifoQueueBasic< T >::m_first, xsens::FifoQueueBasic< T >::m_list, xsens::FifoQueueBasic< T >::m_maxCount, xsens::FifoQueueBasic< T >::pop(), and QUEUELOG.

Here is the call graph for this function:

◆ resize()

template<class T>
void xsens::FifoQueueBasic< T >::resize ( const size_t  size)
inline

Resize the queue, note that this function clears the queue.

Definition at line 391 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_currentCount, xsens::FifoQueueBasic< T >::m_first, xsens::FifoQueueBasic< T >::m_list, xsens::FifoQueueBasic< T >::m_maxCount, QUEUELOG, and xsens::FifoQueueBasic< T >::size().

Here is the call graph for this function:

◆ size()

template<class T>
size_type xsens::FifoQueueBasic< T >::size ( ) const
inline

Return the maximum number of elements in the queue.

Definition at line 409 of file xsens_fifoqueue.h.

References xsens::FifoQueueBasic< T >::m_maxCount.

Referenced by xsens::FifoQueueBasic< T >::FifoQueueBasic(), and xsens::FifoQueueBasic< T >::resize().

Here is the caller graph for this function:

Member Data Documentation

◆ m_currentCount

◆ m_first

◆ m_list

◆ m_maxCount




Page generated by Doxygen 1.8.14 for MRPT 1.9.9 Git: 8fe78517f Sun Jul 14 19:43:28 2019 +0200 at lun oct 28 02:10:00 CET 2019