Cpl::Container::SList< ITEM > Class Template Reference

This template class implements a singly linked list which maintains the ordering imposed on it by the application. More...

Detailed Description

template<class ITEM>
class Cpl::Container::SList< ITEM >

This template class implements a singly linked list which maintains the ordering imposed on it by the application.

NOTE: ITEM must be a subclass of Item.

#include <SList.h>

Inheritance diagram for Cpl::Container::SList< ITEM >:

Public Member Functions
	SList () noexcept
	Public constructor initializes head and tail pointers.
	SList (const char *ignoreThisParameter_usedToCreateAUniqueConstructor) noexcept
	This is a special constructor for when the list is statically declared (i.e.
Operations on the List itself
void	move (SList< ITEM > &dst) noexcept
	Moves the content of the this queue to the specified queue.
void	clearTheList () noexcept
	Empties the list.
View as a FIFO
ITEM *	get (void) noexcept
	Removes the first item in the list.
void	put (ITEM &item) noexcept
	Adds the item as the last item in the list.
ITEM *	head (void) const noexcept
	Return a pointer to the first item in the list.
ITEM *	tail (void) const noexcept
	Return a pointer to the last item in the list.
View as a STACK
ITEM *	pop (void) noexcept
	Removes the top element from stack and return a pointer to it as a result.
void	push (ITEM &item) noexcept
	Adds the ITEM item to top of the stack.
ITEM *	top (void) const noexcept
	Return a pointer to the top ITEM item in the stack.
View as Ordered List
ITEM *	getFirst (void) noexcept
	Removes the first item in the list.
ITEM *	getLast (void) noexcept
	Removes the last item in the list.
void	putFirst (ITEM &item) noexcept
	Adds the item as the first item in the list.
void	putLast (ITEM &item) noexcept
	Adds the item as the last item in the list.
bool	remove (ITEM &item) noexcept
	Remove specified ITEM element from the list.
void	insertAfter (ITEM &after, ITEM &item) noexcept
	Insert the "item" ITEM into the list behind the "after" ITEM element.
void	insertBefore (ITEM &before, ITEM &item) noexcept
	Insert the "item" ITEM into the list ahead of the "before" ITEM element.
bool	find (const ITEM &item) const noexcept
	Returns true if the specified item is already in the list, else false.
ITEM *	first (void) const noexcept
	Return a pointer to the first item in the list.
ITEM *	last (void) const noexcept
	Return a pointer to the last item in the list.
ITEM *	next (const ITEM &item) const noexcept
	Return a pointer to the item after the item "item".

Constructor & Destructor Documentation

SList() [1/2]

template<class ITEM >

Cpl::Container::SList< ITEM >::SList ( void  )

noexcept

Public constructor initializes head and tail pointers.

SList() [2/2]

template<class ITEM >

Cpl::Container::SList< ITEM >::SList ( const char *  ignoreThisParameter_usedToCreateAUniqueConstructor )

noexcept

This is a special constructor for when the list is statically declared (i.e.

it is initialized as part of C++ startup BEFORE main() is executed. C/C++ guarantees that all statically declared data will be initialized to zero by default (see r.8.4 in C++ Programming Language, Second Edition). Since the head & tail pointers are initialized to zero - then the C/C++ default is OK. Why do I care about all this? Because if you attempt to build static list(s), then the order of when the list is constructed vs. when the static elements are added to the list is a problem! To avoid this problem, a alternate constructor that does NOT initialize the head & tail pointers is provided. It assumes that the pointers are already set zero because the list is "static". Whew!

Member Function Documentation

clearTheList()

template<class ITEM >

void Cpl::Container::SList< ITEM >::clearTheList ( )

inlinenoexcept

Empties the list.

All references to the item(s) in the list are lost.

find()

template<class ITEM >

bool Cpl::Container::SList< ITEM >::find ( const ITEM &  item ) const

inlinenoexcept

Returns true if the specified item is already in the list, else false.

first()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::first ( void  ) const

inlinenoexcept

Return a pointer to the first item in the list.

The returned item remains in the list. Returns 0 if the list is empty.

get()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::get ( void  )

inlinenoexcept

Removes the first item in the list.

Returns 0 if the list is empty.

getFirst()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::getFirst ( void  )

inlinenoexcept

Removes the first item in the list.

Returns 0 if the list is empty.

getLast()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::getLast ( void  )

inlinenoexcept

Removes the last item in the list.

Returns 0 if the list is empty.

head()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::head ( void  ) const

inlinenoexcept

Return a pointer to the first item in the list.

The returned item remains in the list. Returns 0 if the list is empty.

insertAfter()

template<class ITEM >

void Cpl::Container::SList< ITEM >::insertAfter ( ITEM &  after, ITEM &  item  )

inlinenoexcept

Insert the "item" ITEM into the list behind the "after" ITEM element.

If 'after' is 0, then 'item' is added to the head of the list.

insertBefore()

template<class ITEM >

void Cpl::Container::SList< ITEM >::insertBefore ( ITEM &  before, ITEM &  item  )

inlinenoexcept

Insert the "item" ITEM into the list ahead of the "before" ITEM element.

If 'before' is 0, then 'item' is added to the tail of the list. Note: This insert operation is more expensive than insertAfter() because a traversal of the list is required to find the 'before' item

last()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::last ( void  ) const

inlinenoexcept

Return a pointer to the last item in the list.

The returned item remains in the list. Returns 0 if the list is empty.

move()

template<class ITEM >

void Cpl::Container::SList< ITEM >::move ( SList< ITEM > &  dst )

inlinenoexcept

Moves the content of the this queue to the specified queue.

next()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::next ( const ITEM &  item ) const

inlinenoexcept

Return a pointer to the item after the item "item".

Both items remain in the list. Returns 0 when the end-of-list is reached.

pop()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::pop ( void  )

inlinenoexcept

Removes the top element from stack and return a pointer to it as a result.

Returns 0, if the stack is empty

push()

template<class ITEM >

void Cpl::Container::SList< ITEM >::push ( ITEM &  item )

inlinenoexcept

Adds the ITEM item to top of the stack.

put()

template<class ITEM >

void Cpl::Container::SList< ITEM >::put ( ITEM &  item )

inlinenoexcept

Adds the item as the last item in the list.

putFirst()

template<class ITEM >

void Cpl::Container::SList< ITEM >::putFirst ( ITEM &  item )

inlinenoexcept

Adds the item as the first item in the list.

putLast()

template<class ITEM >

void Cpl::Container::SList< ITEM >::putLast ( ITEM &  item )

inlinenoexcept

Adds the item as the last item in the list.

remove()

template<class ITEM >

bool Cpl::Container::SList< ITEM >::remove ( ITEM &  item )

inlinenoexcept

Remove specified ITEM element from the list.

Returns true if the specified element was found and removed from the list, else false.

tail()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::tail ( void  ) const

inlinenoexcept

Return a pointer to the last item in the list.

The returned item remains in the list. Returns 0 if the list is empty.

top()

template<class ITEM >

ITEM * Cpl::Container::SList< ITEM >::top ( void  ) const

inlinenoexcept

Return a pointer to the top ITEM item in the stack.

The returned item remains in the queue. Returns 0 if the stack is empty.

---

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

• Cpl/Container/SList.h