LinkedList_t< T > Class Template Reference
Template linked list class. The template type T must inherit from LinkedListNode_t < class T >.
#include <UTLists.h>
Inheritance diagram for LinkedList_t< T >:
Public Member Functions | |
| LinkedList_t () | |
| T * | AddHead (T *item) |
| T * | AddTail (T *item) |
| T * | AddItemBefore (T *new_item, T *after_item) |
| T * | AddItemAfter (T *before_item, T *new_item) |
| T * | RemoveHead () |
| T * | RemoveTail () |
| T * | RemoveItem (T *item) |
| int | CountItems () const |
| T * | Head () const |
| T * | Tail () const |
| void | operator+= (T *item) |
| void | operator-= (T *item) |
| void | SortSmallOrSlow () |
Detailed Description
template<class T>
class LinkedList_t< T >
Definition at line 199 of file UTLists.h.
Constructor & Destructor Documentation
template<class T >
| LinkedList_t< T >::LinkedList_t | ( | ) | [inline] |
Member Function Documentation
template<class T>
| T * LinkedList_t< T >::AddHead | ( | T * | item | ) | [inline] |
template<class T>
| T * LinkedList_t< T >::AddTail | ( | T * | item | ) | [inline] |
template<class T>
| T * LinkedList_t< T >::AddItemBefore | ( | T * | new_item, | |
| T * | after_item | |||
| ) | [inline] |
template<class T>
| T * LinkedList_t< T >::AddItemAfter | ( | T * | before_item, | |
| T * | new_item | |||
| ) | [inline] |
template<class T >
| T * LinkedList_t< T >::RemoveHead | ( | ) | [inline] |
template<class T >
| T * LinkedList_t< T >::RemoveTail | ( | ) | [inline] |
template<class T>
| T * LinkedList_t< T >::RemoveItem | ( | T * | item | ) | [inline] |
template<class T >
| int LinkedList_t< T >::CountItems | ( | ) | const [inline] |
template<class T >
| T * LinkedList_t< T >::Head | ( | ) | const [inline] |
Returns the item at the head of the list. Use LinkedListNode_t < class T >Next to walk the list.
template<class T >
| T * LinkedList_t< T >::Tail | ( | ) | const [inline] |
Returns the item at the end of the list. Use LinkedListNode_t < class T >Prev to walk the list.
template<class T>
| void LinkedList_t< T >::operator+= | ( | T * | item | ) | [inline] |
template<class T>
| void LinkedList_t< T >::operator-= | ( | T * | item | ) | [inline] |
template<class T >
| void LinkedList_t< T >::SortSmallOrSlow | ( | ) | [inline] |
Sorts the linked list. LinkedListNode_t must implement an operator <, in the form of (inline being optional):
inline bool operator <(const T& other) const;
This performs a bubble sort, and thus is inherently slow and should only be performed on reasonably small linked lists.
The documentation for this class was generated from the following file:
- D:/develop/svn/utlib/utlib/trunk/UT/src_UT/UTLists.h
