The parameterized class SList<E> represents singly linked lists with content type E. More...

#include <ogdf/basic/SList.h>

Inheritance diagram for ogdf::SList< E >:

Public Types
typedef E	value_type
typedef SListElement< E >	element_type
typedef SListConstIterator< E >	const_iterator
typedef SListIterator< E >	iterator
Public Member Functions
	SList ()
	Constructs an empty singly linked list.
	SList (const SList< E > &L)
	Constructs a singly linked list that is a copy of L.
	~SList ()
bool	empty () const
	Returns true iff the list is empty.
int	size () const
	Returns the length of the list.
const SListConstIterator< E >	begin () const
	Returns an iterator to the first element of the list.
SListIterator< E >	begin ()
	Returns an iterator to the first element of the list.
SListConstIterator< E >	end () const
	Returns an iterator to one-past-last element of the list.
SListIterator< E >	end ()
	Returns an iterator to one-past-last element of the list.
const SListConstIterator< E >	rbegin () const
	Returns an iterator to the last element of the list.
SListIterator< E >	rbegin ()
	Returns an iterator to the last element of the list.
SListConstIterator< E >	get (int pos) const
	Returns an iterator pointing to the element at position pos.
SListIterator< E >	get (int pos)
	Returns an iterator pointing to the element at position pos.
int	pos (SListConstIterator< E > it) const
	Returns the position (starting with 0) of it in the list.
const E &	front () const
	Returns a reference to the first element.
E &	front ()
	Returns a reference to the first element.
const E &	back () const
	Returns a reference to the last element.
E &	back ()
	Returns a reference to the last element.
SListConstIterator< E >	cyclicSucc (SListConstIterator< E > it) const
	Returns an iterator to the cyclic successor of it.
SListIterator< E >	cyclicSucc (SListIterator< E > it)
	Returns an iterator to the cyclic successor of it.
SList< E > &	operator= (const SList< E > &L)
	Assignment operator.
SListIterator< E >	pushFront (const E &x)
	Adds element x at the begin of the list.
SListIterator< E >	pushBack (const E &x)
	Adds element x at the end of the list.
SListIterator< E >	insertAfter (const E &x, SListIterator< E > itBefore)
	Inserts element x after pBefore.
void	popFront ()
	Removes the first element from the list.
E	popFrontRet ()
	Removes the first element from the list and returns it.
void	delSucc (SListIterator< E > itBefore)
	Removes the succesor of pBefore.
void	moveFrontToFront (SList< E > &L2)
	Moves the first element of this list to the begin of list L2.
void	moveFrontToBack (SList< E > &L2)
	Moves the first element of this list to the end of list L2.
void	moveFrontToSucc (SList< E > &L2, SListIterator< E > itBefore)
	Moves the first element of this list to list L2 inserted after itBefore.
void	clear ()
	Removes all elements from the list.
void	conc (SList< E > &L2)
	Appends L2 to this list and makes L2 empty.
void	reverse ()
	Reverses the order of the list elements.
const SListPure< E > &	getListPure () const
	Conversion to const SListPure.
void	quicksort ()
	Sorts the list using Quicksort.
template<class COMPARER >
void	quicksort (const COMPARER &comp)
	Sorts the list using Quicksort and comparer comp.
void	bucketSort (int l, int h, BucketFunc< E > &f)
	Sorts the list using bucket sort.
void	bucketSort (BucketFunc< E > &f)
	Sorts the list using bucket sort.
void	permute ()
	Randomly permutes the elements in the list.
void *	operator new (size_t nBytes)
void *	operator new (size_t, void *p)
void	operator delete (void *p, size_t nBytes)
Private Attributes
int	m_count
	The length of the list.

Detailed Description

template<class E>
class ogdf::SList< E >

The parameterized class SList<E> represents singly linked lists with content type E.

Elements of the list are instances of type SListElement<E>. Use SListConstIterator<E> or SListIterator<E> in order to iterate over the list. In contrast to SListPure<E>, instances of SList<E> store the length of the list and thus allow constant time access to the length.

Definition at line 615 of file SList.h.

Member Typedef Documentation

template<class E>

typedef SListConstIterator<E> ogdf::SList< E >::const_iterator

void ogdf::SList< E >::bucketSort	(	int	l,
		int	h,
		BucketFunc< E > &	f
	)			`[inline]`

	l	is the lowest bucket that will occur.
	h	is the highest bucket that will occur.
	f	returns the bucket for each element.

SListIterator<E> ogdf::SList< E >::insertAfter	(	const E &	x,
		SListIterator< E >	itBefore
	)			`[inline]`

void ogdf::SList< E >::moveFrontToSucc	(	SList< E > &	L2,
		SListIterator< E >	itBefore
	)			`[inline]`

void ogdf::SList< E >::operator delete	(	void *	p,
		size_t	nBytes
	)			`[inline]`

void* ogdf::SList< E >::operator new	(	size_t	,
		void *	p
	)			`[inline]`

OpenGraph DrawingFramework

ogdf::SList< E > Class Template Reference

Public Types

Public Member Functions

Private Attributes

Detailed Description

template<class E> class ogdf::SList< E >

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

Open
Graph Drawing
Framework

template<class E>
class ogdf::SList< E >