#include <circularbuffer.h>
template<typename T, size_t N>
class RTML_buffer< T, N >
RTML_buffer implements a circular buffer. This buffer is the support for RTML_reader and RTML_writer classes. For instance, The monitor uses an instance of RTML_reader and SUO uses RTML_writer.
- See also
- Event
-
RTML_reader
-
RTML_monitor
- Author
- André Pedro
- Date
◆ event_t
template<typename T , size_t N>
◆ error_t
template<typename T , size_t N>
Enumerator |
---|
OK | |
EMPTY | |
OVERFLOW | |
OUT_OF_BOUND | |
◆ RTML_buffer()
template<typename T , size_t N>
◆ debug()
template<typename T , size_t N>
Print buffer into the stdout
◆ length()
template<typename T , size_t N>
Get buffer length
- Returns
- the template parameter N.
◆ operator++() [1/2]
template<typename T , size_t N>
Increment top of the buffer (++ is just a mnemonic)
◆ operator++() [2/2]
template<typename T , size_t N>
Increment top of the buffer (++ is just a mnemonic)
◆ operator--() [1/2]
template<typename T , size_t N>
Increment bottom of the buffer (– is just a mnemonic)
◆ operator--() [2/2]
template<typename T , size_t N>
Increment bottom of the buffer (– is just a mnemonic)
◆ pop()
template<typename T , size_t N>
◆ pull()
template<typename T , size_t N>
Pull a node in FIFO order
◆ push()
template<typename T , size_t N>
◆ read()
template<typename T , size_t N>
◆ state()
template<typename T , size_t N>
◆ array
template<typename T , size_t N>
The T buffer where data is kept. The size is defined via template parameter N which avoids dynamic memory usage.
- See also
- T
◆ bottom
template<typename T , size_t N>
The bottom of the circular buffer
◆ size
template<typename T , size_t N>
◆ top
template<typename T , size_t N>
The circular buffer contains a top and a bottom
◆ writer
template<typename T , size_t N>
The writer flag that indicates if a writer has been attached.
The documentation for this class was generated from the following file: