ogdf: ogdf::ListPure< E > Class Template Reference

template<class E>

typedef E ogdf::ListPure< E >::value_type

Definition at line 297 of file List.h.

template<class E>

typedef ListElement<E> ogdf::ListPure< E >::element_type

Definition at line 298 of file List.h.

template<class E>

typedef ListConstIterator<E> ogdf::ListPure< E >::const_iterator

Definition at line 299 of file List.h.

template<class E>

typedef ListIterator<E> ogdf::ListPure< E >::iterator

Definition at line 300 of file List.h.

template<class E>

ogdf::ListPure< E >::ListPure ( ) [inline]

Constructs an empty doubly linked list.

Definition at line 287 of file List.h.

template<class E>

ogdf::ListPure< E >::ListPure ( const ListPure< E > & L ) [inline]

Constructs a doubly linked list that is a copy of L.

Definition at line 290 of file List.h.

template<class E>

ogdf::ListPure< E >::~ListPure ( ) [inline]

Definition at line 295 of file List.h.

template<class E>

bool ogdf::ListPure< E >::empty ( ) const [inline]

Returns true iff the list is empty.

Definition at line 303 of file List.h.

template<class E>

int ogdf::ListPure< E >::size ( ) const [inline]

Returns the length of the list.

Notice that this method requires to run through the whole list and takes linear running time!

Definition at line 309 of file List.h.

template<class E>

const ListConstIterator<E> ogdf::ListPure< E >::begin ( ) const [inline]

Returns an iterator to the first element of the list.

If the list is empty, a null pointer iterator is returned.

Definition at line 320 of file List.h.

template<class E>

ListIterator<E> ogdf::ListPure< E >::begin ( ) [inline]

Returns an iterator to the first element of the list.

If the list is empty, a null pointer iterator is returned.

Definition at line 325 of file List.h.

template<class E>

ListConstIterator<E> ogdf::ListPure< E >::end ( ) const [inline]

Returns an iterator to one-past-last element of the list.

This is always a null pointer iterator.

Definition at line 331 of file List.h.

template<class E>

ListIterator<E> ogdf::ListPure< E >::end ( ) [inline]

Returns an iterator to one-past-last element of the list.

This is always a null pointer iterator.

Definition at line 336 of file List.h.

template<class E>

const ListConstIterator<E> ogdf::ListPure< E >::rbegin ( ) const [inline]

Returns an iterator to the last element of the list.

If the list is empty, a null pointer iterator is returned.

Definition at line 342 of file List.h.

template<class E>

ListIterator<E> ogdf::ListPure< E >::rbegin ( ) [inline]

Returns an iterator to the last element of the list.

If the list is empty, a null pointer iterator is returned.

Definition at line 347 of file List.h.

template<class E>

ListConstIterator<E> ogdf::ListPure< E >::rend ( ) const [inline]

Returns an iterator to one-before-first element of the list.

This is always a null pointer iterator.

Definition at line 353 of file List.h.

template<class E>

ListIterator<E> ogdf::ListPure< E >::rend ( ) [inline]

Returns an iterator to one-before-first element of the list.

This is always a null pointer iterator.

Definition at line 358 of file List.h.

template<class E>

const E& ogdf::ListPure< E >::front ( ) const [inline]

Returns a reference to the first element.

Precondition:: The list is not empty!

Definition at line 364 of file List.h.

template<class E>

E& ogdf::ListPure< E >::front ( ) [inline]

Returns a reference to the first element.

Precondition:: The list is not empty!


Public Types
typedef E	value_type
typedef ListElement< E >	element_type
typedef ListConstIterator< E >	const_iterator
typedef ListIterator< E >	iterator
Public Member Functions
	ListPure ()
	Constructs an empty doubly linked list.
	ListPure (const ListPure< E > &L)
	Constructs a doubly linked list that is a copy of L.
	~ListPure ()
bool	empty () const
	Returns true iff the list is empty.
int	size () const
	Returns the length of the list.
const ListConstIterator< E >	begin () const
	Returns an iterator to the first element of the list.
ListIterator< E >	begin ()
	Returns an iterator to the first element of the list.
ListConstIterator< E >	end () const
	Returns an iterator to one-past-last element of the list.
ListIterator< E >	end ()
	Returns an iterator to one-past-last element of the list.
const ListConstIterator< E >	rbegin () const
	Returns an iterator to the last element of the list.
ListIterator< E >	rbegin ()
	Returns an iterator to the last element of the list.
ListConstIterator< E >	rend () const
	Returns an iterator to one-before-first element of the list.
ListIterator< E >	rend ()
	Returns an iterator to one-before-first element of 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.
ListConstIterator< E >	cyclicSucc (ListConstIterator< E > it) const
	Returns an iterator to the cyclic successor of it.
ListIterator< E >	cyclicSucc (ListIterator< E > it)
	Returns an iterator to the cyclic successor of it.
ListConstIterator< E >	cyclicPred (ListConstIterator< E > it) const
	Returns an iterator to the cyclic predecessor of it.
ListIterator< E >	cyclicPred (ListIterator< E > it)
	Returns an iterator to the cyclic predecessor of it.
ListConstIterator< E >	get (int pos) const
	Returns an iterator pointing to the element at position pos.
ListIterator< E >	get (int pos)
	Returns an iterator pointing to the element at position pos.
int	pos (ListConstIterator< E > it) const
	Returns the position (starting with 0) of it in the list.
ListPure< E > &	operator= (const ListPure< E > &L)
	Assignment operator.
ListIterator< E >	pushFront (const E &x)
	Adds element x at the begin of the list.
ListIterator< E >	pushBack (const E &x)
	Adds element x at the end of the list.
ListIterator< E >	insert (const E &x, ListIterator< E > it, Direction dir=after)
	Inserts element x before or after it.
ListIterator< E >	insertBefore (const E &x, ListIterator< E > it)
	Inserts element x before it.
ListIterator< E >	insertAfter (const E &x, ListIterator< E > it)
	Inserts element x after it.
void	popFront ()
	Removes the first element from the list.
E	popFrontRet ()
	Removes the first element from the list and returns it.
void	popBack ()
	Removes the last element from the list.
E	popBackRet ()
	Removes the last element from the list and returns it.
void	del (ListIterator< E > it)
	Removes it from the list.
void	exchange (ListIterator< E > it1, ListIterator< E > it2)
	Exchanges the positions of it1 and it2 in the list.
void	moveToFront (ListIterator< E > it)
	Moves it to the begin of the list.
void	moveToBack (ListIterator< E > it)
	Moves it to the end of the list.
void	moveToSucc (ListIterator< E > it, ListIterator< E > itBefore)
	Moves it after itBefore.
void	moveToPrec (ListIterator< E > it, ListIterator< E > itAfter)
	Moves it before itAfter.
void	moveToFront (ListIterator< E > it, ListPure< E > &L2)
	Moves it to the begin of L2.
void	moveToBack (ListIterator< E > it, ListPure< E > &L2)
	Moves it to the end of L2.
void	moveToSucc (ListIterator< E > it, ListPure< E > &L2, ListIterator< E > itBefore)
	Moves it to list L2 and inserts it after itBefore.
void	moveToPrec (ListIterator< E > it, ListPure< E > &L2, ListIterator< E > itAfter)
	Moves it to list L2 and inserts it before itAfter.
void	conc (ListPure< E > &L2)
	Appends L2 to this list and makes L2 empty.
void	concFront (ListPure< E > &L2)
	Prepends L2 to this list and makes L2 empty.
void	exchange (ListPure< E > &L2)
	Exchanges too complete lists in O(1).
void	split (ListIterator< E > it, ListPure< E > &L1, ListPure< E > &L2, Direction dir=before)
	Splits the list at element it into lists L1 and L2.
void	splitAfter (ListIterator< E > it, ListPure< E > &L2)
	Splits the list after it.
void	splitBefore (ListIterator< E > it, ListPure< E > &L2)
	Splits the list before it.
void	reverse ()
	Reverses the order of the list elements.
void	clear ()
	Removes all elements from the list.
void	quicksort ()
	Sorts the list using Quicksort.
void	quicksort (Comparer< E > &comp)
	Sorts the list using Quicksort and comparer comp.
template<class C>
void	quicksortCT (C &comp)
	Sorts the list using Quicksort and parameterized comparer comp.
void	bucketSort (int l, int h, BucketFunc< E > &f)
	Sorts the list using bucket sort.
void	permute ()
	Randomly permutes the elements in the list.
int	search (const E &e) const
int	search (const E &e, Comparer< E > &comp) const
void *	operator new (size_t nBytes)
void *	operator new (size_t, void *p)
void	operator delete (void *p, size_t nBytes)
Protected Member Functions
void	copy (const ListPure< E > &L)
void	permute (const int n)
Protected Attributes
ListElement< E > *	m_head
	Pointer to first element.
ListElement< E > *	m_tail
	Pointer to last element.

Open
Graph Drawing
Framework

ogdf::ListPure< E > Class Template Reference

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

template<class E>
class ogdf::ListPure< E >

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

OpenGraph DrawingFramework

ogdf::ListPure< E > Class Template Reference

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

template<class E> class ogdf::ListPure< E >

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Open
Graph Drawing
Framework

template<class E>
class ogdf::ListPure< E >