seal::List< T > Class Template Reference

#include <list.h>

Inheritance diagram for seal::List< T >:

List of all members.

Public Member Functions
	List (void)
virtual void	pushBack (const T element)=0
virtual void	popBack (void)=0
virtual void	pushFront (const T element)=0
virtual void	popFront (void)=0
virtual void	insert (const T element, unsigned int index)=0
virtual void	remove (unsigned int index)=0

---

Detailed Description

template<typename T>
class seal::List< T >

This class is an abstract base class which defines the interface for linked list like data structures. Specifically, it defines an interface which a data structure supporting dynamic resizing should implement.

---

Constructor & Destructor Documentation

template<typename T>

seal::List< T >::List

(

void

)

[inline]

Default constructor. Does nothing.

---

Member Function Documentation

template<typename T>

virtual void seal::List< T >::pushBack

(

const T

element

)

[pure virtual]

In a concrete derived class, this function will append (or push) an element to the back (or end) of the data structure.

Implemented in seal::LinkedList< T >, seal::Vector< T >, seal::LinkedList< seal::BinTreeNode< T > * >, and seal::Vector< seal::Array1D< T > >.

template<typename T>

virtual void seal::List< T >::popBack

(

void

)

[pure virtual]

In a concrete derived class, this function will pop an element from the back (or end) of the data structure.

Implemented in seal::LinkedList< T >, seal::Vector< T >, seal::LinkedList< seal::BinTreeNode< T > * >, seal::Vector< seal::Vector >, and seal::Vector< seal::Array1D< T > >.

template<typename T>

virtual void seal::List< T >::pushFront

(

const T

element

)

[pure virtual]

In a concrete derived class, this function will append (or push) an element to the front (or begining) of the data structure.

Implemented in seal::LinkedList< T >, seal::Vector< T >, seal::LinkedList< seal::BinTreeNode< T > * >, and seal::Vector< seal::Array1D< T > >.

template<typename T>

virtual void seal::List< T >::popFront

(

void

)

[pure virtual]

In a concrete derived class, this function will pop an element from the front (or begining) of the data structure.

Implemented in seal::LinkedList< T >, seal::Vector< T >, seal::LinkedList< seal::BinTreeNode< T > * >, seal::Vector< seal::Vector >, and seal::Vector< seal::Array1D< T > >.

template<typename T>

virtual void seal::List< T >::insert	(	const T	element,
		unsigned int	index
	)			[pure virtual]

In a concrete derived clas, this function will insert an element at specified index in the data structure.

Parameters:

	element	The element to be inserted.
	index	The index where the element should be inserted.

Implemented in seal::LinkedList< T >, seal::Vector< T >, seal::LinkedList< seal::BinTreeNode< T > * >, and seal::Vector< seal::Array1D< T > >.

template<typename T>

virtual void seal::List< T >::remove

(

unsigned int

index

)

[pure virtual]

In a concrete derived class, this function will remove the element at the specified index.

Parameters:

index

The index of the element which should be removed.

Implemented in seal::LinkedList< T >, seal::Vector< T >, seal::LinkedList< seal::BinTreeNode< T > * >, seal::Vector< seal::Vector >, and seal::Vector< seal::Array1D< T > >.

---

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

• list.h