#include <sdeque.hpp>
Public Types | |
typedef std::deque< value_t > | deque_t |
typedef deque_t::iterator | iterator |
typedef deque_t::const_iterator | const_iterator |
Public Member Functions | |
sdeque () | |
sdeque (sdeque const &orig) | |
value_t & | at (ssize_t ii) |
value_t const & | at (ssize_t ii) const |
void | resize_begin (ssize_t ibegin, value_t const &value) |
void | resize_begin (ssize_t ibegin) |
void | resize_end (ssize_t iend, value_t const &value) |
void | resize_end (ssize_t iend) |
void | resize (ssize_t ibegin, ssize_t iend, value_t const &value) |
This could be implemented a bit more smartly, but the performance hit of calling resize_begin() and resize_end() shouldn't be too bad. | |
void | resize (ssize_t ibegin, ssize_t iend) |
ssize_t | ibegin () const |
ssize_t | iend () const |
deque_t const & | get () const |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
Protected Attributes | |
ssize_t | m_ibegin |
ssize_t | m_iend |
deque_t | m_deque |
typedef std::deque<value_t> estar::sdeque< value_t >::deque_t |
typedef deque_t::iterator estar::sdeque< value_t >::iterator |
typedef deque_t::const_iterator estar::sdeque< value_t >::const_iterator |
estar::sdeque< value_t >::sdeque | ( | ) | [inline] |
estar::sdeque< value_t >::sdeque | ( | sdeque< value_t > const & | orig | ) | [inline] |
value_t& estar::sdeque< value_t >::at | ( | ssize_t | ii | ) | [inline] |
value_t const& estar::sdeque< value_t >::at | ( | ssize_t | ii | ) | const [inline] |
void estar::sdeque< value_t >::resize_begin | ( | ssize_t | ibegin, | |
value_t const & | value | |||
) | [inline] |
void estar::sdeque< value_t >::resize_begin | ( | ssize_t | ibegin | ) | [inline] |
void estar::sdeque< value_t >::resize_end | ( | ssize_t | iend, | |
value_t const & | value | |||
) | [inline] |
void estar::sdeque< value_t >::resize_end | ( | ssize_t | iend | ) | [inline] |
void estar::sdeque< value_t >::resize | ( | ssize_t | ibegin, | |
ssize_t | iend, | |||
value_t const & | value | |||
) | [inline] |
This could be implemented a bit more smartly, but the performance hit of calling resize_begin() and resize_end() shouldn't be too bad.
void estar::sdeque< value_t >::resize | ( | ssize_t | ibegin, | |
ssize_t | iend | |||
) | [inline] |
ssize_t estar::sdeque< value_t >::ibegin | ( | ) | const [inline] |
ssize_t estar::sdeque< value_t >::iend | ( | ) | const [inline] |
deque_t const& estar::sdeque< value_t >::get | ( | ) | const [inline] |
iterator estar::sdeque< value_t >::begin | ( | ) | [inline] |
const_iterator estar::sdeque< value_t >::begin | ( | ) | const [inline] |
iterator estar::sdeque< value_t >::end | ( | ) | [inline] |
const_iterator estar::sdeque< value_t >::end | ( | ) | const [inline] |
ssize_t estar::sdeque< value_t >::m_ibegin [protected] |
ssize_t estar::sdeque< value_t >::m_iend [protected] |
deque_t estar::sdeque< value_t >::m_deque [protected] |