DoublyLinkedList< t > Class Template Reference

#include <DoubleLinkedList.h>

Collaboration diagram for DoublyLinkedList< t >:

Public Member Functions
	DoublyLinkedList ()
	DoublyLinkedList (const DoublyLinkedList &l)
void	insertAtEnd (t d)
void	insertAtStart (t x)
void	displayForward ()
void	displayBackward ()
bool	search (t data)
int	search__b (t data)
	~DoublyLinkedList ()
void	deleteAtPosition (int pos)
void	deleteAtStart ()
void	deleteAtEnd ()
void	insertAtAnyPosition (int pos, node< t > *n)
bool	isEmpty ()
DoublyLinkedList	Intersection (const DoublyLinkedList &d1)
int	getSize ()
node< t > *	getHead ()
node< t > *	getTail ()

Private Attributes
node< t > *	head
node< t > *	tail
int	size

Constructor & Destructor Documentation

DoublyLinkedList() [1/2]

template<class t>

DoublyLinkedList< t >::DoublyLinkedList ( )

inline

DoublyLinkedList() [2/2]

template<class t>

DoublyLinkedList< t >::DoublyLinkedList ( const DoublyLinkedList< t > & l )

inline

Here is the call graph for this function:

~DoublyLinkedList()

template<class t>

DoublyLinkedList< t >::~DoublyLinkedList ( )

inline

Here is the call graph for this function:

Member Function Documentation

deleteAtEnd()

template<class t>

void DoublyLinkedList< t >::deleteAtEnd ( )

inline

deleteAtPosition()

template<class t>

void DoublyLinkedList< t >::deleteAtPosition ( int pos )

inline

Here is the call graph for this function:

deleteAtStart()

template<class t>

void DoublyLinkedList< t >::deleteAtStart ( )

inline

displayBackward()

template<class t>

void DoublyLinkedList< t >::displayBackward ( )

inline

Here is the call graph for this function:

displayForward()

template<class t>

void DoublyLinkedList< t >::displayForward ( )

inline

Here is the call graph for this function:

getHead()

template<class t>

node< t > * DoublyLinkedList< t >::getHead ( )

inline

getSize()

template<class t>

int DoublyLinkedList< t >::getSize ( )

inline

getTail()

template<class t>

node< t > * DoublyLinkedList< t >::getTail ( )

inline

insertAtAnyPosition()

template<class t>

void DoublyLinkedList< t >::insertAtAnyPosition ( int pos, node< t > * n )

inline

Here is the call graph for this function:

insertAtEnd()

template<class t>

void DoublyLinkedList< t >::insertAtEnd ( t d )

inline

Here is the call graph for this function:

insertAtStart()

template<class t>

void DoublyLinkedList< t >::insertAtStart ( t x )

inline

Here is the call graph for this function:

Intersection()

template<class t>

DoublyLinkedList DoublyLinkedList< t >::Intersection ( const DoublyLinkedList< t > & d1 )

inline

Here is the call graph for this function:

isEmpty()

template<class t>

bool DoublyLinkedList< t >::isEmpty ( )

inline

search()

template<class t>

bool DoublyLinkedList< t >::search ( t data )

inline

Here is the call graph for this function:

search__b()

template<class t>

int DoublyLinkedList< t >::search__b ( t data )

inline

Here is the call graph for this function:

Member Data Documentation

head

template<class t>

node<t>* DoublyLinkedList< t >::head

private

size

template<class t>

int DoublyLinkedList< t >::size

private

tail

template<class t>

node<t> * DoublyLinkedList< t >::tail

private

---

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

• DoubleLinkedList.h