#include <>>

Public Member Functions
	SLList (void)

SLNode *	first (void) const

SLNode *	last (void) const

int	count (void) const

bool	isEmpty (void) const

void	addFirst (SLNode *node)

void	addLast (SLNode *node)

void	removeFirst (void)

void	removeLast (void)

Detailed Description

This class implements a single-link list data structure with nodes (SLNode) that must be extended to contain useful information.

Constructor & Destructor Documentation

◆ SLList()

SLList ( void )

inline

Member Function Documentation

◆ addFirst()

void addFirst ( SLNode * node )

inline

Add a node at the first position in the list.

Parameters

node	Node to add.

Warning: It is an error to add the same nodes many times to one or to many lists.; It is an error to call this method on an empty list.

Referenced by List< Pair< K, T >, CompareEquiv< AssocComparator< K, T, Comparator< K > > >, DefaultAlloc >::addFirst(), and SLList::addLast().

◆ addLast()

void addLast ( SLNode * node )

Add a node to the end of the list.

Parameters

node	Node to add at the last position of the list. Remark that this method is really inefficient.bIts working time is in O(n), n number of nodes in the list. Use it only with small list or revert to more powerful data structures.

Warning: It is an error to add the same nodes many times to one or to many lists.

References SLList::addFirst(), SLNode::insertAfter(), and SLList::last().

Referenced by List< Pair< K, T >, CompareEquiv< AssocComparator< K, T, Comparator< K > > >, DefaultAlloc >::addLast().

◆ count()

int count ( void ) const

Count the nodes in the list.

Returns: Count of nodes in the list.

References SLNode::next().

Referenced by List< Pair< K, T >, CompareEquiv< AssocComparator< K, T, Comparator< K > > >, DefaultAlloc >::count().

◆ first()

SLNode * first ( void ) const

inline

Get te first node of the list.

Returns: First list node.

Warning: It is an error to call this method on an empty list.

◆ isEmpty()

bool isEmpty ( void ) const

inline

Test if the list is empty.

Returns: True if it is empty, false else.

Referenced by List< Pair< K, T >, CompareEquiv< AssocComparator< K, T, Comparator< K > > >, DefaultAlloc >::clear(), and List< Pair< K, T >, CompareEquiv< AssocComparator< K, T, Comparator< K > > >, DefaultAlloc >::isEmpty().

◆ last()

SLNode * last ( void ) const

Get te first node of the list. Remark that this method is really inefficient. Its working time is in O(n), n number of nodes in the list. Use it only with small list or revert to more powerful data structures.