LinkedList::LinkedList< T > Class Template Reference

#include <LinkedList.hpp>

Public Member Functions
	LinkedList ()
	LinkedList (T val)
	~LinkedList ()
void	InsertFront (T val)
void	InsertBack (T val)
void	InsertBefore (LinkedListNode< T > *next, T val)
void	InsertAfter (LinkedListNode< T > *prev, T val)
void	Remove (LinkedListNode< T > *del)
LinkedListNode< T > *	RemoveFront ()
LinkedListNode< T > *	RemoveBack ()
LinkedListNode< T > *	RemoveBefore (LinkedListNode< T > *node)
LinkedListNode< T > *	RemoveAfter (LinkedListNode< T > *node)
LinkedListNode< T > *	Head ()
LinkedListNode< T > *	Tail ()
size_t	Count ()
bool	IsEmpty ()

Private Attributes
LinkedListNode< T > *	head
LinkedListNode< T > *	tail
size_t	count

Detailed Description

template<typename T>
class LinkedList::LinkedList< T >

Definition at line 126 of file LinkedList.hpp.

Constructor & Destructor Documentation

LinkedList() [1/2]

template<typename T >

LinkedList::LinkedList< T >::LinkedList ( )

inline

Definition at line 128 of file LinkedList.hpp.

        : head(NULL)
        , tail(NULL)
        , count(0)
    {
        // Default constructor
    }

LinkedList() [2/2]

template<typename T >

LinkedList::LinkedList< T >::LinkedList ( T  val )

inline

Definition at line 136 of file LinkedList.hpp.

        : LinkedList()
    {
        InsertFront(val);
    }

~LinkedList()

template<typename T >

LinkedList::LinkedList< T >::~LinkedList ( )

inline

Definition at line 142 of file LinkedList.hpp.

    {
        LinkedListNode<T>* back;
        while ((back = RemoveBack())) {
            delete back;
        }
    }

Member Function Documentation

Count()

template<typename T >

size_t LinkedList::LinkedList< T >::Count ( )

inline

Get the number of items in the linked list.

Returns

size_t Number of items in the linked list

Definition at line 278 of file LinkedList.hpp.

    {
        return count;
    }

Head()

template<typename T >

LinkedListNode<T>* LinkedList::LinkedList< T >::Head ( )

inline

Get pointer to the head node.

Returns

LinkedListNode* Pointer to head node

Definition at line 258 of file LinkedList.hpp.

    {
        return head;
    }

InsertAfter()

template<typename T >

void LinkedList::LinkedList< T >::InsertAfter ( LinkedListNode< T > *  prev, T  val  )

inline

Definition at line 188 of file LinkedList.hpp.

    {
        if (!prev)
            return;
        LinkedListNode<T>* newNode = new LinkedListNode<T>(val);
        newNode->SetNext(prev->Next());
        prev->SetNext(newNode);
        newNode->SetPrevious(prev);
        if (newNode->Next()) {
            newNode->Next()->SetPrevious(newNode);
        } else {
            tail = newNode;
        }
        ++count;
    }

Here is the call graph for this function:

InsertBack()

template<typename T >

void LinkedList::LinkedList< T >::InsertBack ( T  val )

inline

Definition at line 161 of file LinkedList.hpp.

    {
        if (tail) {
            InsertAfter(tail, val);
        } else {
            tail = new LinkedListNode<T>(val);
            head = tail;
            ++count;
        }
    }

InsertBefore()

template<typename T >

void LinkedList::LinkedList< T >::InsertBefore ( LinkedListNode< T > *  next, T  val  )

inline

Definition at line 172 of file LinkedList.hpp.

    {
        if (!next)
            return;
        LinkedListNode<T>* newNode = new LinkedListNode<T>(val);
        newNode->SetPrevious(next->Previous());
        next->SetPrevious(newNode);
        newNode->SetNext(next);
        if (newNode->Previous()) {
            newNode->Previous()->SetNext(newNode);
        } else {
            head = newNode;
        }
        ++count;
    }

Here is the call graph for this function:

InsertFront()

template<typename T >

void LinkedList::LinkedList< T >::InsertFront ( T  val )

inline

Definition at line 150 of file LinkedList.hpp.

    {
        if (head) {
            InsertBefore(head, val);
        } else {
            head = new LinkedListNode<T>(val);
            tail = head;
            ++count;
        }
    }

IsEmpty()

template<typename T >

bool LinkedList::LinkedList< T >::IsEmpty ( )

inline

Check if the linked list is empty.

Returns

true The list is empty

false The list is not empty

Definition at line 289 of file LinkedList.hpp.

    {
        return Count() == 0;
    }

Remove()

template<typename T >

void LinkedList::LinkedList< T >::Remove ( LinkedListNode< T > *  del )

inline

Definition at line 204 of file LinkedList.hpp.

    {
        if (del == head)
            head = del->Next();
        if (del == tail)
            tail = del->Previous();
        if (del->Next())
            del->Next()->SetPrevious(del->Previous());
        if (del->Previous())
            del->Previous()->SetNext(del->Next());
        count--;
    }

Here is the call graph for this function:

RemoveAfter()

template<typename T >

LinkedListNode<T>* LinkedList::LinkedList< T >::RemoveAfter ( LinkedListNode< T > *  node )

inline

Definition at line 244 of file LinkedList.hpp.

    {
        if (!node)
            return NULL;
        LinkedListNode<T>* after = node->Next();
        Remove(after);
        return after;
    }

Here is the call graph for this function:

RemoveBack()

template<typename T >

LinkedListNode<T>* LinkedList::LinkedList< T >::RemoveBack ( )

inline

Definition at line 226 of file LinkedList.hpp.

    {
        if (!tail)
            return NULL;
        LinkedListNode<T>* currTail = tail;
        Remove(currTail);
        return currTail;
    }

RemoveBefore()

template<typename T >

LinkedListNode<T>* LinkedList::LinkedList< T >::RemoveBefore ( LinkedListNode< T > *  node )

inline

Definition at line 235 of file LinkedList.hpp.

    {
        if (!node)
            return NULL;
        LinkedListNode<T>* before = node->Previous();
        Remove(before);
        return before;
    }

Here is the call graph for this function:

RemoveFront()

template<typename T >

LinkedListNode<T>* LinkedList::LinkedList< T >::RemoveFront ( )

inline

Definition at line 217 of file LinkedList.hpp.

    {
        if (!head)
            return NULL;
        LinkedListNode<T>* currHead = head;
        Remove(currHead);
        return currHead;
    }

Tail()

template<typename T >

LinkedListNode<T>* LinkedList::LinkedList< T >::Tail ( )

inline

Get pointer to the tail node.

Returns

LinkedListNode* Pointer to tail node

Definition at line 268 of file LinkedList.hpp.

    {
        return tail;
    }

Field Documentation

count

template<typename T >

size_t LinkedList::LinkedList< T >::count

private

Definition at line 297 of file LinkedList.hpp.

head

template<typename T >

LinkedListNode<T>* LinkedList::LinkedList< T >::head

private

Definition at line 295 of file LinkedList.hpp.

tail

template<typename T >

LinkedListNode<T>* LinkedList::LinkedList< T >::tail

private

Definition at line 296 of file LinkedList.hpp.

---

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

• LinkedList.hpp