#include <List.hpp>
Public Types | |
typedef L::value_type | value_type |
typedef L::pointer | pointer |
typedef L::const_pointer | const_pointer |
typedef L::reference | reference |
typedef L::const_reference | const_reference |
typedef L::size_type | size_type |
typedef L::difference_type | difference_type |
typedef L::iterator | iterator |
typedef L::const_iterator | const_iterator |
typedef L::reverse_iterator | reverse_iterator |
typedef L::const_reverse_iterator | const_reverse_iterator |
Public Member Functions | |
List () | |
Default Constructor. | |
List (L *toWrap) | |
Constructor. | |
template<class InputIterator> | |
List (InputIterator first, InputIterator last) | |
Construct a List from a range specified with InputIterators. | |
List (size_type n, const T &value) | |
Construct a List that consist of a specified number of elements that are copies of a given object. | |
List (int n, const T &value) | |
Construct a List that consist of a specified number of elements that are copies of a given object. | |
List (long n, const T &value) | |
Construct a List that consist of a specified number of elements that are copies of a given object. | |
List (size_type n) | |
Construct a List that consist of a specified number of elements that have be constructed using the default constructor of class T. | |
L * | getImpl () |
| |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
bool | empty () const |
size_type | size () const |
size_type | max_size () const |
reference | front () |
const_reference | front () const |
reference | back () |
const_reference | back () const |
void | swap (List< T > &x) |
Exchanges the elements of the current list with those of another. | |
iterator | insert (iterator position, const T &x) |
Insert an element to the List before the element specified by the iterator. | |
iterator | insert (iterator position) |
Insert an default-constructed element to the List before the element specified by the iterator. | |
template<class InputIterator> | |
void | insert (iterator position, InputIterator first, InputIterator last) |
Insert a range of elements before a given position in the List. | |
void | insert (iterator pos, size_type n, const T &x) |
Insert a specified number of elements that are copies of a given object before the given position in the List. | |
void | insert (iterator pos, int n, const T &x) |
Insert a specified number of elements that are copies of a given object before the given position in the List. | |
void | insert (iterator pos, long n, const T &x) |
Insert a specified number of elements that are copies of a given object before the given position in the List. | |
void | push_front (const T &x) |
Prepend the specified element at the front of the List. | |
void | push_back (const T &x) |
Append the specified element to the end of the List. | |
iterator | erase (iterator position) |
Remove an element from the List specified with an iterator. | |
iterator | erase (iterator first, iterator last) |
Remove elements from the List specified by a beginning and ending iterator. | |
void | resize (size_type new_size, const T &x) |
Ensure the List has a given size. | |
void | resize (size_type new_size) |
Ensure the List has a given size appending a default-constructed object to the end of the List if it is enlarged. | |
void | clear () |
Remove all items from the List. | |
const_iterator | find (const T &x, const_iterator first, const_iterator last) const |
Find element x in the list range specified by the first and last iterators. | |
const_iterator | find (const T &x) const |
Find element x in the list. | |
iterator | find (const T &x, iterator first, iterator last) |
Find element x in the list range specified by the first and last iterators. | |
iterator | find (const T &x) |
Find element x in the list. | |
bool | contains (const T &x, const_iterator first, const_iterator last) const |
Determine if element x is contained in the list range specified by the first and last iterators. | |
bool | contains (const T &x) const |
Determine if element x is contained in the list. | |
void | pop_front () |
Remove the first element in the List. | |
void | pop_back () |
Remove the last element in the List. | |
void | splice (iterator position, List &x) |
Move the specified list into the current list at the given position. | |
void | splice (iterator position, List &x, iterator i) |
Move the specified element from list x pointed to by iterator i into the current list at the given position. | |
void | splice (iterator position, List &x, iterator first, iterator last) |
Move the elements from list x specified by first and last iterators into the current list at the given position. | |
void | remove (const T &value) |
Remove the specified element from the List. | |
void | unique () |
Remove all duplicate elements from the List. | |
void | merge (List &x) |
Merge the current and specified lists, producing a combined list that is ordered with respect to the < operator. | |
void | reverse () |
Reverse the order of elements in the list. | |
void | sort () |
Sort the list using the < operator to compare elements. | |
template<class Predicate> | |
void | remove_if (Predicate p) |
Removes all elements from the list for which the unary predicate p is true. | |
template<class BinaryPredicate> | |
void | unique (BinaryPredicate bp) |
Remove all elements from the List for which the binary predicate bp is true. | |
template<class StrictWeakOrdering> | |
void | merge (List &x, StrictWeakOrdering swo) |
Merge the current and specified list, producing a combined list that is ordered with respect to the specified comparisation class. | |
template<class StrictWeakOrdering> | |
void | sort (StrictWeakOrdering swo) |
Sort the list using the specified comparisation class. | |
Private Types | |
typedef std::list< T > | L |
Private Attributes | |
COWReference< L > | m_impl |
Friends | |
bool | operator== (const List< T > &x, const List< T > &y) |
Determine equality of two Lists comparing the size of both lists and all elements in the same position using the elements "==" operator. | |
bool | operator< (const List< T > &x, const List< T > &y) |
Determine if one Lists is less than another comparing the size of both lists and all their elements. |
Definition at line 60 of file List.hpp.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Default Constructor.
|
|
Constructor.
|
|
Construct a List from a range specified with InputIterators.
|
|
Construct a List that consist of a specified number of elements that are copies of a given object.
|
|
Construct a List that consist of a specified number of elements that are copies of a given object.
|
|
Construct a List that consist of a specified number of elements that are copies of a given object.
|
|
Construct a List that consist of a specified number of elements that have be constructed using the default constructor of class T.
|
|
Definition at line 262 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 255 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 159 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 150 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Remove all items from the List. The size() of the List should be zero after calling this method. Definition at line 414 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Determine if element x is contained in the list.
|
|
Determine if element x is contained in the list range specified by the first and last iterators.
|
|
Definition at line 220 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 177 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 168 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. Referenced by BLOCXX_NAMESPACE::List< T >::find(). |
|
Remove elements from the List specified by a beginning and ending iterator.
Definition at line 386 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Remove an element from the List specified with an iterator.
Definition at line 373 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Find element x in the list.
|
|
Find element x in the list range specified by the first and last iterators.
|
|
Find element x in the list.
|
|
Find element x in the list range specified by the first and last iterators.
Definition at line 427 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::end(). |
|
Definition at line 248 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 241 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 141 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Insert a specified number of elements that are copies of a given object before the given position in the List.
Definition at line 344 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Insert a specified number of elements that are copies of a given object before the given position in the List.
Definition at line 331 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Insert a specified number of elements that are copies of a given object before the given position in the List.
Definition at line 318 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Insert a range of elements before a given position in the List.
Definition at line 305 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Insert an default-constructed element to the List before the element specified by the iterator.
Definition at line 293 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Insert an element to the List before the element specified by the iterator.
Definition at line 282 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 234 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Merge the current and specified list, producing a combined list that is ordered with respect to the specified comparisation class.
Definition at line 612 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Merge the current and specified lists, producing a combined list that is ordered with respect to the < operator.
Definition at line 571 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Remove the last element in the List.
|
|
Remove the first element in the List.
|
|
Append the specified element to the end of the List.
Definition at line 362 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Prepend the specified element at the front of the List.
Definition at line 353 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 195 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 186 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Remove the specified element from the List.
|
|
Removes all elements from the list for which the unary predicate p is true.
|
|
Definition at line 213 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Definition at line 204 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Ensure the List has a given size appending a default-constructed object to the end of the List if it is enlarged.
Definition at line 406 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Ensure the List has a given size.
Definition at line 396 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Reverse the order of elements in the list.
|
|
Definition at line 227 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Sort the list using the specified comparisation class.
|
|
Sort the list using the < operator to compare elements.
|
|
Move the elements from list x specified by first and last iterators into the current list at the given position.
Definition at line 547 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Move the specified element from list x pointed to by iterator i into the current list at the given position.
Definition at line 534 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Move the specified list into the current list at the given position.
Definition at line 522 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl. |
|
Exchanges the elements of the current list with those of another.
Definition at line 270 of file List.hpp. References BLOCXX_NAMESPACE::List< T >::m_impl, and BLOCXX_NAMESPACE::COWReference< T >::swap(). Referenced by BLOCXX_NAMESPACE::swap(). |
|
Remove all elements from the List for which the binary predicate bp is true.
|
|
Remove all duplicate elements from the List.
|
|
Determine if one Lists is less than another comparing the size of both lists and all their elements.
|
|
Determine equality of two Lists comparing the size of both lists and all elements in the same position using the elements "==" operator.
|
|