Meta::MList< T, Allocator > Class Template Reference

Extends the standard list type, adding some useful convenience methods. More...

#include <MList.h>

List of all members.

Public Types
typedef std::list< T, Allocator >	List_
typedef List_::reference	reference
typedef List_::const_reference	const_reference
typedef List_::iterator	iterator
typedef List_::const_iterator	const_iterator
typedef List_::allocator_type	allocator_type
typedef List_::reverse_iterator	reverse_iterator
typedef List_::const_reverse_iterator	const_reverse_iterator
Public Member Functions
	MList (const Allocator &allocator=Allocator())
	MList (size_t n, const T &value=T(), const Allocator &allocator=Allocator())
template<class InputIterator >
	MList (InputIterator first, InputIterator last, const Allocator &allocator=Allocator())
	MList (const MList< T, Allocator > &x)
const List_	list () const
List_	list ()
template<class InputIterator >
void	assign (InputIterator first, InputIterator last)
void	assign (size_t n, const T &u)
reference	back ()
const_reference	back () const
iterator	begin ()
const_iterator	begin () 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)
template<class InputIterator >
void	insert (iterator position, InputIterator first, InputIterator last)
void	append (const MList< T > l)
template<class S >
void	append (const MList< S > l)
size_t	max_size () const
size_t	maxSize () const
void	merge (MList< T, Allocator > &x)
template<class Compare >
void	merge (MList< T, Allocator > &x, Compare comp)
MList< T, Allocator > &	operator= (const MList< T, Allocator > &x)
void	pop_back ()
T	popBack ()
void	pop_front ()
T	popFront ()
void	push_back (const T &x)
void	pushBack (const T &x)
void	push_front (const T &x)
void	pushFront (const T &x)
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
void	remove (const T &value)
template<class Predicate >
void	remove_if (Predicate pred)
template<class Predicate >
void	removeIf (Predicate pred)
reverse_iterator	rend ()
const_reverse_iterator	rend () const
void	resize (size_t sz, T c=T())
void	reverse ()
size_t	size () const
void	sort ()
template<class Compare >
void	sort (Compare comp)
void	splice (iterator position, MList< T, Allocator > &x)
void	splice (iterator position, MList< T, Allocator > &x, iterator i)
void	splice (iterator position, MList< T, Allocator > &x, iterator first, iterator last)
void	swap (MList< T, Allocator > &lst)
void	unique ()
template<class BinaryPredicate >
void	unique (BinaryPredicate binary_pred)
MList< T, Allocator > &	operator<< (const T &x)
reference	operator[] (size_t i)
const_reference	operator[] (size_t i) const

---

Detailed Description

template<typename T, class Allocator = std::allocator<T>>
class Meta::MList< T, Allocator >

Extends the standard list type, adding some useful convenience methods.

Provides a list data type which is fully compatible with the standard list, adding some useful convenience functions. MList extends the standard list with nearly no loss of performance. One noteable added feature is the semi-random-access ability, e.g: an MList can be indexed as if it were a vector.

---

The documentation for this class was generated from the following file:

• AndroMeta/include/AndroMeta/MList.h