Public Member Functions | |
| fast_back_stack () | |
| fast_back_stack (const fast_back_stack &fbs) | |
| fast_back_stack (const T &value) | |
| fast_back_stack & | operator= (const fast_back_stack &fbs) |
| void | clear () |
| bool | empty () const |
| unsigned int | size () const |
| T & | back () |
| const T & | back () const |
| void | push_back () |
| void | push_back (const T &value) |
| void | pop_back () |
Public Attributes | |
| T | _value |
| std::vector< T > | _stack |
| unsigned int | _size |
A conventional std::vector<> stores the rest of the stack. Although fast_back_stack contains a stl container it only implements the back push_back(),pop_back() and back() methods so is not as general purpose as stl stack implementation. The focus of the fast_back_stack is purely to maximize the speed at which the back can be accessed.
| osg::fast_back_stack< T >::fast_back_stack | ( | ) | [inline] |
| osg::fast_back_stack< T >::fast_back_stack | ( | const fast_back_stack< T > & | fbs | ) | [inline] |
| osg::fast_back_stack< T >::fast_back_stack | ( | const T & | value | ) | [inline] |
| fast_back_stack& osg::fast_back_stack< T >::operator= | ( | const fast_back_stack< T > & | fbs | ) | [inline] |
| void osg::fast_back_stack< T >::clear | ( | ) | [inline] |
| bool osg::fast_back_stack< T >::empty | ( | ) | const [inline] |
| unsigned int osg::fast_back_stack< T >::size | ( | ) | const [inline] |
| T& osg::fast_back_stack< T >::back | ( | ) | [inline] |
| const T& osg::fast_back_stack< T >::back | ( | ) | const [inline] |
| void osg::fast_back_stack< T >::push_back | ( | ) | [inline] |
| void osg::fast_back_stack< T >::push_back | ( | const T & | value | ) | [inline] |
| void osg::fast_back_stack< T >::pop_back | ( | ) | [inline] |
| T osg::fast_back_stack< T >::_value |
| std::vector<T> osg::fast_back_stack< T >::_stack |
| unsigned int osg::fast_back_stack< T >::_size |