#include <mi32/milist.h>
Inheritance diagram for MILIST< _LIT >:
Public Member Functions | |
| CONST_ITERATOR | Begin () const |
| ITERATOR | Begin () |
| void | Clear () |
| bool | Contains (const _LIT &item) const |
| CONST_ITERATOR | End () const |
| ITERATOR | End () |
| _LIT & | GetBack () |
| const _LIT & | GetBack () const |
| _LIT & | GetFront () |
| const _LIT & | GetFront () const |
| INT32 | GetNumItems () const |
| _LIT & | Insert (ITERATOR p, const _LIT &item) |
| bool | IsEmpty () const |
| bool | IsEqual (const MILIST< _LIT > &rhs) const |
| void | Lower (ITERATOR it) |
| void | Merge (MILIST< _LIT > &other) |
| MILIST (const MILIST< _LIT > &rhs) | |
| MILIST () | |
| void | MoveToBack (ITERATOR it) |
| void | MoveToFront (ITERATOR it) |
| MILIST< _LIT > & | operator= (const MILIST< _LIT > &rhs) |
| void | PopBack () |
| void | PopFront () |
| _LIT & | PushBack (const _LIT &item) |
| _LIT & | PushFront (const _LIT &item) |
| void | Raise (ITERATOR it) |
| void | Remove (ITERATOR start, ITERATOR end) |
| void | Remove (ITERATOR it) |
| void | RemoveDuplicates () |
| void | RemovePos (int pos) |
| void | Reverse () |
| void | Sort (bool(*PredFunc)(const _LIT &lhs, const _LIT &rhs)) |
| template<class _Pr1> void | Sort (_Pr1 _Pr) |
| void | Sort () |
| ~MILIST () | |
|
|||||||||
|
Constructor for an empty list. Deliberate MmAllocC instead of new |
|
||||||||||
|
Copy constructor. Deliberate MmAllocC instead of new |
|
|||||||||
|
Destructor.
|
|
|||||||||
|
Return a CONST_ITERATOR that refers to the beginning of the list.
|
|
|||||||||
|
Return an ITERATOR that refers to the beginning of the list.
|
|
|||||||||
|
Remove all entries from the list.
|
|
||||||||||
|
Determine if specified item is contained in list. This does a linear search of the list, so consider efficiency implications when using. List item must support equality comparison operator. |
|
|||||||||
|
Return a CONST_ITERATOR that refers to the end of the list, not a valid list item.
|
|
|||||||||
|
Return an ITERATOR that refers to the end of the list, not a valid list item.
|
|
|||||||||
|
Return a reference to a _LIT item from the front of the list.
|
|
|||||||||
|
Return a reference to a const _LIT item from the front of the list.
|
|
|||||||||
|
Return a reference to a _LIT item from the front of the list.
|
|
|||||||||
|
Return a reference to a const _LIT item from the front of the list.
|
|
|||||||||
|
Return the number of items in the list.
|
|
||||||||||||||||
|
Insert an item into the place BEFORE the iterator.
|
|
|||||||||
|
Determine if any list entries exist.
|
|
||||||||||
|
Determine equality with another list of same type.
|
|
||||||||||
|
Moves the item referenced by the iterator toward the beginning of the list.
|
|
||||||||||
|
Merge two lists together, the list copied from is cleared, does not sort.
|
|
||||||||||
|
Moves the item referenced by the iterator to the back of the list.
|
|
||||||||||
|
Moves the item referenced by the iterator to the front of the list.
|
|
||||||||||
|
Assignment operator.
|
|
|||||||||
|
Remove the last item from the list.
|
|
|||||||||
|
Remove an item from the beginning of the list.
|
|
||||||||||
|
Insert an item on the end of the list.
|
|
||||||||||
|
Insert an item at the beginning of the list.
|
|
||||||||||
|
Moves the item referenced by the iterator toward the end of the list.
|
|
||||||||||||||||
|
Remove a range of items from the list.
|
|
||||||||||
|
Remove item specified by ITERATOR from the list. Do not use the specified iterator after using this method as it will be invalid. |
|
|||||||||
|
Remove duplicate entries.
|
|
||||||||||
|
Remove item at specified position.
|
|
|||||||||
|
Reverse order of items in list.
|
|
||||||||||
|
Sort the list in operator< () order.
|
|
||||||||||||||
|
Sort the list in operator< () order.
|
|
|||||||||
|
Sort the list in operator< () order.
|
1.3.8-20040913