|
AndroMeta
2.0.0
|
Extends the standard vector type, adding some useful convenience methods. More...
#include <MVector.h>
Classes | |
| class | addA1_ |
| class | addA2_ |
| class | divA1_ |
| class | divA2_ |
| class | modA1_ |
| class | modA2_ |
| class | mulA1_ |
| class | mulA2_ |
| class | neg_ |
| class | subA1_ |
| class | subA2_ |
Public Types | |
| typedef std::vector< T, A > | Vector_ |
| typedef Vector_::iterator | iterator |
| typedef Vector_::const_iterator | const_iterator |
| typedef Vector_::reverse_iterator | reverse_iterator |
|
typedef Vector_::const_reverse_iterator | const_reverse_iterator |
| typedef Vector_::reference | reference |
| typedef Vector_::const_reference | const_reference |
| typedef Vector_::allocator_type | allocator_type |
Public Member Functions | |
| MVector (const A &allocator=A()) | |
| MVector (size_t n, const T &value=T(), const A &allocator=A()) | |
| template<class InputIterator > | |
| MVector (InputIterator first, InputIterator last, const A &allocator=A()) | |
| MVector (const MVector< T, A > &x) | |
| const Vector_ | vector () const |
| Vector_ | vector () |
| template<class InputIterator > | |
| void | assign (InputIterator first, InputIterator last) |
| void | assign (size_t n, const T &u) |
| const_reference | at (size_t n) const |
| reference | at (size_t n) |
| reference | back () |
| const_reference | back () const |
| iterator | begin () |
| const_iterator | begin () const |
| size_t | capacity () const |
| void | clear () |
| bool | empty () const |
| bool | isEmpty () const |
| iterator | end () |
| const_iterator | end () const |
| iterator | erase (iterator position) |
| iterator | erase (iterator first, iterator last) |
| reference | front () |
| const_reference | front () const |
| allocator_type | get_allocator () const |
| allocator_type | getAllocator () const |
| iterator | insert (iterator position, const T &x) |
| void | insert (iterator position, size_t n, const T &x) |
| void | append (const MVector< T > v) |
| template<class S > | |
| void | append (const MVector< S > v) |
| template<class InputIterator > | |
| void | insert (iterator position, InputIterator first, InputIterator last) |
| size_t | max_size () const |
| size_t | maxSize () const |
| MVector< T, A > & | operator= (const MVector< T, A > &x) |
| reference | operator[] (size_t n) |
| const_reference | operator[] (size_t n) const |
| const T & | uget (size_t n, const T &def) const |
| void | pop_back () |
| T | popBack () |
| T | popFront () |
| void | pop_front () |
| void | push_back (const T &x) |
| void | pushBack (const T &x) |
| void | pushFront (const T &x) |
| void | push (const T &x) |
| void | pop (const T &x) |
| reverse_iterator | rbegin () |
| const_reverse_iterator | rbegin () const |
| reverse_iterator | rend () |
| const_reverse_iterator | rend () const |
| void | reserve (size_t n) |
| void | resize (size_t sz, T c=T()) |
| size_t | size () const |
| void | swap (MVector< T, A > &vec) |
| MVector< T, A > | operator- () const |
| MVector< T, A > & | operator+= (const T &x) |
| MVector< T, A > & | operator+= (const MVector< T, A > &v) |
| MVector< T, A > & | operator%= (const T &x) |
| MVector< T, A > & | operator%= (const MVector< T, A > &v) |
| MVector< T, A > | operator+ (const T &x) const |
| MVector< T, A > | operator+ (const MVector< T, A > &v) const |
| MVector< T, A > & | operator-= (const T &x) |
| MVector< T, A > & | operator-= (const MVector< T, A > &v) |
| MVector< T, A > | operator- (const T &x) const |
| MVector< T, A > | operator- (const MVector< T, A > &v) const |
| MVector< T, A > & | operator*= (const T &x) |
| MVector< T, A > & | operator*= (const MVector< T, A > &v) |
| MVector< T, A > | operator* (const T &x) const |
| MVector< T, A > | operator* (const MVector< T, A > &v) const |
| MVector< T, A > & | operator/= (const T &x) |
| MVector< T, A > & | operator/= (const MVector< T, A > &v) |
| MVector< T, A > | operator/ (const T &x) const |
| MVector< T, A > | operator/ (const MVector< T, A > &v) const |
| MVector< T, A > & | operator<< (const T &x) |
Extends the standard vector type, adding some useful convenience methods.
Provides a vector data type which is fully compatible with the standard vector, adding some useful convenience functions. MVector extends the standard vector with nearly no loss of performance.
1.7.6.1