Open
Graph Drawing
Framework

 v.2015.05
 

ogdf::List< E > Class Template Reference

The parameterized class ListPure<E> represents doubly linked lists with content type E. More...

#include <ogdf/basic/basic.h>

+ Inheritance diagram for ogdf::List< E >:

Public Types

typedef ListConstIterator< E > const_iterator
 
typedef ListElement< E > element_type
 
typedef ListIterator< E > iterator
 
typedef E value_type
 

Public Member Functions

 List ()
 Constructs an empty doubly linked list. More...
 
 List (const List< E > &L)
 Constructs a doubly linked list that is a copy of L. More...
 
 ~List ()
 
const E & back () const
 
E & back ()
 
const ListConstIterator< E > begin () const
 
ListIterator< E > begin ()
 
void bucketSort (int l, int h, BucketFunc< E > &f)
 
const E chooseElement () const
 Returns a random element from the list. More...
 
chooseElement ()
 Returns a random element from the list. More...
 
ListConstIterator< E > chooseIterator () const
 Returns an iterator to a random element in the list (or an invalid iterator if the list is empty) More...
 
ListIterator< E > chooseIterator ()
 Returns an iterator to a random element in the list (or an invalid iterator if the list is empty) More...
 
void clear ()
 
void conc (List< E > &L2)
 Appends L2 to this list and makes L2 empty. More...
 
void concFront (List< E > &L2)
 Prepends L2 to this list and makes L2 empty. More...
 
ListConstIterator< E > cyclicPred (ListConstIterator< E > it) const
 
ListIterator< E > cyclicPred (ListIterator< E > it)
 
ListConstIterator< E > cyclicSucc (ListConstIterator< E > it) const
 
ListIterator< E > cyclicSucc (ListIterator< E > it)
 
void del (ListIterator< E > it)
 
bool empty () const
 Returns true iff the list is empty. More...
 
ListConstIterator< E > end () const
 
ListIterator< E > end ()
 
void exchange (ListIterator< E > it1, ListIterator< E > it2)
 
void exchange (List< E > &L2)
 Exchanges too complete lists in O(1). More...
 
const E & front () const
 
E & front ()
 
ListConstIterator< E > get (int pos) const
 
ListIterator< E > get (int pos)
 
const ListPure< E > & getListPure () const
 Conversion to const SListPure. More...
 
ListIterator< E > insert (const E &x, ListIterator< E > it, Direction dir=after)
 
ListIterator< E > insertAfter (const E &x, ListIterator< E > it)
 
ListIterator< E > insertBefore (const E &x, ListIterator< E > it)
 
void moveToBack (ListIterator< E > it)
 Moves it to the end of the list. More...
 
void moveToBack (ListIterator< E > it, List< E > &L2)
 Moves it to the end of L2. More...
 
void moveToFront (ListIterator< E > it)
 Moves it to the beginning of the list. More...
 
void moveToFront (ListIterator< E > it, List< E > &L2)
 Moves it to the beginning of L2. More...
 
void moveToPrec (ListIterator< E > it, ListIterator< E > itAfter)
 Moves it before itAfter. More...
 
void moveToPrec (ListIterator< E > it, List< E > &L2, ListIterator< E > itAfter)
 Moves it to list L2 and inserts it after itBefore. More...
 
void moveToSucc (ListIterator< E > it, ListIterator< E > itBefore)
 Moves it after itBefore. More...
 
void moveToSucc (ListIterator< E > it, List< E > &L2, ListIterator< E > itBefore)
 Moves it to list L2 and inserts it after itBefore. More...
 
bool operator!= (const List< E > &L) const
 Inequality operator. More...
 
List< E > & operator= (const List< E > &L)
 
bool operator== (const List< E > &L) const
 Equality operator. More...
 
void permute ()
 
void popBack ()
 
popBackRet ()
 
void popFront ()
 
popFrontRet ()
 
int pos (ListConstIterator< E > it) const
 Returns the position (starting with 0) of iterator it in the list. More...
 
ListIterator< E > pushBack (const E &x)
 
ListIterator< E > pushFront (const E &x)
 
void quicksort ()
 
template<class COMPARER >
void quicksort (const COMPARER &comp)
 
const ListConstIterator< E > rbegin () const
 
ListIterator< E > rbegin ()
 
bool removeFirst (const E &x)
 Removes the first occurrence of x (if any) from the list. More...
 
ListConstIterator< E > rend () const
 
ListIterator< E > rend ()
 
void reverse ()
 
ListConstIterator< E > search (const E &e) const
 Scans the list for the specified element and returns an iterator to the first occurrence in the list, or an invalid iterator if not found. More...
 
ListIterator< E > search (const E &e)
 Scans the list for the specified element and returns an iterator to the first occurrence in the list, or an invalid iterator if not found. More...
 
template<class COMPARER >
ListConstIterator< E > search (const E &e, const COMPARER &comp) const
 Scans the list for the specified element (using the user-defined comparer) and returns an iterator to the first occurrence in the list, or an invalid iterator if not found. More...
 
template<class COMPARER >
ListIterator< E > search (const E &e, const COMPARER &comp)
 Scans the list for the specified element (using the user-defined comparer) and returns an iterator to the first occurrence in the list, or an invalid iterator if not found. More...
 
int size () const
 
void split (ListIterator< E > it, List< E > &L1, List< E > &L2, Direction dir=before)
 Splits the list at element it into lists L1 and L2. More...
 

Private Attributes

int m_count
 The length of the list. More...
 
- Private Attributes inherited from ogdf::ListPure< E >
ListElement< E > * m_head
 Pointer to first element. More...
 
ListElement< E > * m_tail
 Pointer to last element. More...
 

Additional Inherited Members

- Private Types inherited from ogdf::ListPure< E >
typedef ListConstIterator< E > const_iterator
 
typedef ListElement< E > element_type
 
typedef ListIterator< E > iterator
 
typedef E value_type
 
- Private Member Functions inherited from ogdf::ListPure< E >
 ListPure ()
 Constructs an empty doubly linked list. More...
 
 ListPure (const ListPure< E > &L)
 Constructs a doubly linked list that is a copy of L. More...
 
 ~ListPure ()
 
const E & back () const
 Returns a reference to the last element. More...
 
E & back ()
 Returns a reference to the last element. More...
 
const ListConstIterator< E > begin () const
 Returns an iterator to the first element of the list. More...
 
ListIterator< E > begin ()
 Returns an iterator to the first element of the list. More...
 
void bucketSort (int l, int h, BucketFunc< E > &f)
 Sorts the list using bucket sort. More...
 
const E chooseElement () const
 Returns a random element from the list. More...
 
chooseElement ()
 Returns a random element from the list. More...
 
ListConstIterator< E > chooseIterator () const
 Returns an iterator to a random element in the list (or an invalid iterator if the list is empty) More...
 
ListIterator< E > chooseIterator ()
 Returns an iterator to a random element in the list (or an invalid iterator if the list is empty) More...
 
void clear ()
 Removes all elements from the list. More...
 
void conc (ListPure< E > &L2)
 Appends L2 to this list and makes L2 empty. More...
 
void concFront (ListPure< E > &L2)
 Prepends L2 to this list and makes L2 empty. More...
 
ListConstIterator< E > cyclicPred (ListConstIterator< E > it) const
 Returns an iterator to the cyclic predecessor of it. More...
 
ListIterator< E > cyclicPred (ListIterator< E > it)
 Returns an iterator to the cyclic predecessor of it. More...
 
ListConstIterator< E > cyclicSucc (ListConstIterator< E > it) const
 Returns an iterator to the cyclic successor of it. More...
 
ListIterator< E > cyclicSucc (ListIterator< E > it)
 Returns an iterator to the cyclic successor of it. More...
 
void del (ListIterator< E > it)
 Removes it from the list. More...
 
bool empty () const
 Returns true iff the list is empty. More...
 
ListConstIterator< E > end () const
 Returns an iterator to one-past-last element of the list. More...
 
ListIterator< E > end ()
 Returns an iterator to one-past-last element of the list. More...
 
void exchange (ListIterator< E > it1, ListIterator< E > it2)
 Exchanges the positions of it1 and it2 in the list. More...
 
void exchange (ListPure< E > &L2)
 Exchanges too complete lists in O(1). More...
 
const E & front () const
 Returns a reference to the first element. More...
 
E & front ()
 Returns a reference to the first element. More...
 
ListConstIterator< E > get (int pos) const
 Returns an iterator pointing to the element at position pos. More...
 
ListIterator< E > get (int pos)
 Returns an iterator pointing to the element at position pos. More...
 
ListIterator< E > insert (const E &x, ListIterator< E > it, Direction dir=after)
 Inserts element x before or after it. More...
 
ListIterator< E > insertAfter (const E &x, ListIterator< E > it)
 Inserts element x after it. More...
 
ListIterator< E > insertBefore (const E &x, ListIterator< E > it)
 Inserts element x before it. More...
 
void moveToBack (ListIterator< E > it)
 Moves it to the end of the list. More...
 
void moveToBack (ListIterator< E > it, ListPure< E > &L2)
 Moves it to the end of L2. More...
 
void moveToFront (ListIterator< E > it)
 Moves it to the begin of the list. More...
 
void moveToFront (ListIterator< E > it, ListPure< E > &L2)
 Moves it to the begin of L2. More...
 
void moveToPrec (ListIterator< E > it, ListIterator< E > itAfter)
 Moves it before itAfter. More...
 
void moveToPrec (ListIterator< E > it, ListPure< E > &L2, ListIterator< E > itAfter)
 Moves it to list L2 and inserts it before itAfter. More...
 
void moveToSucc (ListIterator< E > it, ListIterator< E > itBefore)
 Moves it after itBefore. More...
 
void moveToSucc (ListIterator< E > it, ListPure< E > &L2, ListIterator< E > itBefore)
 Moves it to list L2 and inserts it after itBefore. More...
 
bool operator!= (const ListPure< E > &L) const
 Inequality operator. More...
 
ListPure< E > & operator= (const ListPure< E > &L)
 Assignment operator. More...
 
bool operator== (const ListPure< E > &L) const
 Equality operator. More...
 
void permute ()
 Randomly permutes the elements in the list. More...
 
void popBack ()
 Removes the last element from the list. More...
 
popBackRet ()
 Removes the last element from the list and returns it. More...
 
void popFront ()
 Removes the first element from the list. More...
 
popFrontRet ()
 Removes the first element from the list and returns it. More...
 
int pos (ListConstIterator< E > it) const
 Returns the position (starting with 0) of iterator it in the list. More...
 
ListIterator< E > pushBack (const E &x)
 Adds element x at the end of the list. More...
 
ListIterator< E > pushFront (const E &x)
 Adds element x at the begin of the list. More...
 
void quicksort ()
 Sorts the list using Quicksort. More...
 
template<class COMPARER >
void quicksort (const COMPARER &comp)
 Sorts the list using Quicksort and comparer comp. More...
 
const ListConstIterator< E > rbegin () const
 Returns an iterator to the last element of the list. More...
 
ListIterator< E > rbegin ()
 Returns an iterator to the last element of the list. More...
 
bool removeFirst (const E &x)
 Removes the first occurrence of x (if any) from the list. More...
 
ListConstIterator< E > rend () const
 Returns an iterator to one-before-first element of the list. More...
 
ListIterator< E > rend ()
 Returns an iterator to one-before-first element of the list. More...
 
void reverse ()
 Reverses the order of the list elements. More...
 
ListConstIterator< E > search (const E &e) const
 Scans the list for the specified element and returns an iterator to the first occurrence in the list, or an invalid iterator if not found. More...
 
ListIterator< E > search (const E &e)
 Scans the list for the specified element and returns an iterator to the first occurrence in the list, or an invalid iterator if not found. More...
 
template<class COMPARER >
ListConstIterator< E > search (const E &e, const COMPARER &comp) const
 Scans the list for the specified element (using the user-defined comparer) and returns an iterator to the first occurrence in the list, or an invalid iterator if not found. More...
 
template<class COMPARER >
ListIterator< E > search (const E &e, const COMPARER &comp)
 Scans the list for the specified element (using the user-defined comparer) and returns an iterator to the first occurrence in the list, or an invalid iterator if not found. More...
 
int size () const
 Returns the length of the list. More...
 
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. More...
 
void splitAfter (ListIterator< E > it, ListPure< E > &L2)
 Splits the list after it. More...
 
void splitBefore (ListIterator< E > it, ListPure< E > &L2)
 Splits the list before it. More...
 
void copy (const ListPure< E > &L)
 
void permute (const int n)
 

Detailed Description

template<class E>
class ogdf::List< E >

The parameterized class ListPure<E> represents doubly linked lists with content type E.

Elements of the list are instances of type ListElement<E>. Use ListConstIterator<E> or ListIterator<E> in order to iterate over the list.

In contrast to ListPure<E>, instances of List<E> store the length of the list.

See the forall_listiterators macros for the recommended way how to easily iterate through a list.

Template Parameters
Eis the data type stored in list elements.

Definition at line 242 of file basic.h.

Member Typedef Documentation

template<class E>
typedef ListConstIterator<E> ogdf::List< E >::const_iterator

Definition at line 1193 of file List.h.

template<class E>
typedef ListElement<E> ogdf::List< E >::element_type

Definition at line 1192 of file List.h.

template<class E>
typedef ListIterator<E> ogdf::List< E >::iterator

Definition at line 1194 of file List.h.

template<class E>
typedef E ogdf::List< E >::value_type

Definition at line 1191 of file List.h.

Constructor & Destructor Documentation

template<class E>
ogdf::List< E >::List ( )
inline

Constructs an empty doubly linked list.

Definition at line 1183 of file List.h.

template<class E>
ogdf::List< E >::List ( const List< E > &  L)
inline

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

Definition at line 1186 of file List.h.

template<class E>
ogdf::List< E >::~List ( )
inline

Definition at line 1189 of file List.h.

Member Function Documentation

template<class E>
const E& ogdf::List< E >::back ( ) const
inline

Definition at line 1228 of file List.h.

template<class E>
E& ogdf::List< E >::back ( )
inline

Definition at line 1230 of file List.h.

template<class E>
const ListConstIterator<E> ogdf::List< E >::begin ( ) const
inline

Definition at line 1203 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::begin ( )
inline

Definition at line 1205 of file List.h.

template<class E>
void ogdf::List< E >::bucketSort ( int  l,
int  h,
BucketFunc< E > &  f 
)
inline

Definition at line 1551 of file List.h.

template<class E>
const E ogdf::List< E >::chooseElement ( ) const
inline

Returns a random element from the list.

Precondition
The list is not empty!

This method takes linear time.

Definition at line 1295 of file List.h.

template<class E>
E ogdf::List< E >::chooseElement ( )
inline

Returns a random element from the list.

Precondition
The list is not empty!

This method takes linear time.

Definition at line 1306 of file List.h.

template<class E>
ListConstIterator<E> ogdf::List< E >::chooseIterator ( ) const
inline

Returns an iterator to a random element in the list (or an invalid iterator if the list is empty)

This method takes linear time.

Definition at line 1277 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::chooseIterator ( )
inline

Returns an iterator to a random element in the list (or an invalid iterator if the list is empty)

This method takes linear time.

Definition at line 1285 of file List.h.

template<class E>
void ogdf::List< E >::clear ( )
inline

Definition at line 1531 of file List.h.

template<class E>
void ogdf::List< E >::conc ( List< E > &  L2)
inline

Appends L2 to this list and makes L2 empty.

Definition at line 1483 of file List.h.

template<class E>
void ogdf::List< E >::concFront ( List< E > &  L2)
inline

Prepends L2 to this list and makes L2 empty.

Definition at line 1490 of file List.h.

template<class E>
ListConstIterator<E> ogdf::List< E >::cyclicPred ( ListConstIterator< E >  it) const
inline

Definition at line 1243 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::cyclicPred ( ListIterator< E >  it)
inline

Definition at line 1248 of file List.h.

template<class E>
ListConstIterator<E> ogdf::List< E >::cyclicSucc ( ListConstIterator< E >  it) const
inline

Definition at line 1233 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::cyclicSucc ( ListIterator< E >  it)
inline

Definition at line 1238 of file List.h.

template<class E>
void ogdf::List< E >::del ( ListIterator< E >  it)
inline

Definition at line 1464 of file List.h.

template<class E>
bool ogdf::List< E >::empty ( ) const
inline

Returns true iff the list is empty.

Definition at line 1197 of file List.h.

template<class E>
ListConstIterator<E> ogdf::List< E >::end ( ) const
inline

Definition at line 1208 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::end ( )
inline

Definition at line 1210 of file List.h.

template<class E>
void ogdf::List< E >::exchange ( ListIterator< E >  it1,
ListIterator< E >  it2 
)
inline

Definition at line 1394 of file List.h.

template<class E>
void ogdf::List< E >::exchange ( List< E > &  L2)
inline

Exchanges too complete lists in O(1).

The list's content is moved to L2 and vice versa.

Definition at line 1500 of file List.h.

template<class E>
const E& ogdf::List< E >::front ( ) const
inline

Definition at line 1223 of file List.h.

template<class E>
E& ogdf::List< E >::front ( )
inline

Definition at line 1225 of file List.h.

template<class E>
ListConstIterator<E> ogdf::List< E >::get ( int  pos) const
inline

Definition at line 1253 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::get ( int  pos)
inline

Definition at line 1259 of file List.h.

template<class E>
const ListPure<E>& ogdf::List< E >::getListPure ( ) const
inline

Conversion to const SListPure.

Definition at line 1537 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::insert ( const E &  x,
ListIterator< E >  it,
Direction  dir = after 
)
inline

Definition at line 1351 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::insertAfter ( const E &  x,
ListIterator< E >  it 
)
inline

Definition at line 1363 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::insertBefore ( const E &  x,
ListIterator< E >  it 
)
inline

Definition at line 1357 of file List.h.

template<class E>
void ogdf::List< E >::moveToBack ( ListIterator< E >  it)
inline

Moves it to the end of the list.

Precondition
it points to an element in the list.

Definition at line 1409 of file List.h.

template<class E>
void ogdf::List< E >::moveToBack ( ListIterator< E >  it,
List< E > &  L2 
)
inline

Moves it to the end of L2.

Precondition
it points to an element in this list.

Definition at line 1439 of file List.h.

template<class E>
void ogdf::List< E >::moveToFront ( ListIterator< E >  it)
inline

Moves it to the beginning of the list.

Precondition
it points to an element in the list.

Definition at line 1402 of file List.h.

template<class E>
void ogdf::List< E >::moveToFront ( ListIterator< E >  it,
List< E > &  L2 
)
inline

Moves it to the beginning of L2.

Precondition
it points to an element in this list.

Definition at line 1431 of file List.h.

template<class E>
void ogdf::List< E >::moveToPrec ( ListIterator< E >  it,
ListIterator< E >  itAfter 
)
inline

Moves it before itAfter.

Precondition
it and itAfter point to elements in this list.

Definition at line 1423 of file List.h.

template<class E>
void ogdf::List< E >::moveToPrec ( ListIterator< E >  it,
List< E > &  L2,
ListIterator< E >  itAfter 
)
inline

Moves it to list L2 and inserts it after itBefore.

Precondition
it points to an element in this list, and itBefore points to an element in L2.

Definition at line 1458 of file List.h.

template<class E>
void ogdf::List< E >::moveToSucc ( ListIterator< E >  it,
ListIterator< E >  itBefore 
)
inline

Moves it after itBefore.

Precondition
it and itBefore point to elements in this list.

Definition at line 1416 of file List.h.

template<class E>
void ogdf::List< E >::moveToSucc ( ListIterator< E >  it,
List< E > &  L2,
ListIterator< E >  itBefore 
)
inline

Moves it to list L2 and inserts it after itBefore.

Precondition
it points to an element in this list, and itBefore points to an element in L2.

Definition at line 1449 of file List.h.

template<class E>
bool ogdf::List< E >::operator!= ( const List< E > &  L) const
inline

Inequality operator.

Definition at line 1334 of file List.h.

template<class E>
List<E>& ogdf::List< E >::operator= ( const List< E > &  L)
inline

Definition at line 1312 of file List.h.

template<class E>
bool ogdf::List< E >::operator== ( const List< E > &  L) const
inline

Equality operator.

Definition at line 1319 of file List.h.

template<class E>
void ogdf::List< E >::permute ( )
inline

Definition at line 1556 of file List.h.

template<class E>
void ogdf::List< E >::popBack ( )
inline

Definition at line 1382 of file List.h.

template<class E>
E ogdf::List< E >::popBackRet ( )
inline

Definition at line 1388 of file List.h.

template<class E>
void ogdf::List< E >::popFront ( )
inline

Definition at line 1369 of file List.h.

template<class E>
E ogdf::List< E >::popFrontRet ( )
inline

Definition at line 1375 of file List.h.

template<class E>
int ogdf::List< E >::pos ( ListConstIterator< E >  it) const
inline

Returns the position (starting with 0) of iterator it in the list.

Precondition
it is a valid iterator pointing to an element in this list!

Definition at line 1268 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::pushBack ( const E &  x)
inline

Definition at line 1345 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::pushFront ( const E &  x)
inline

Definition at line 1339 of file List.h.

template<class E>
void ogdf::List< E >::quicksort ( )
inline

Definition at line 1540 of file List.h.

template<class E>
template<class COMPARER >
void ogdf::List< E >::quicksort ( const COMPARER &  comp)
inline

Definition at line 1546 of file List.h.

template<class E>
const ListConstIterator<E> ogdf::List< E >::rbegin ( ) const
inline

Definition at line 1213 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::rbegin ( )
inline

Definition at line 1215 of file List.h.

template<class E>
bool ogdf::List< E >::removeFirst ( const E &  x)
inline

Removes the first occurrence of x (if any) from the list.

If the list contains x several times, only the first element containing x is removed.

Definition at line 1474 of file List.h.

template<class E>
ListConstIterator<E> ogdf::List< E >::rend ( ) const
inline

Definition at line 1218 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::rend ( )
inline

Definition at line 1220 of file List.h.

template<class E>
void ogdf::List< E >::reverse ( )
inline

Definition at line 1528 of file List.h.

template<class E>
ListConstIterator<E> ogdf::List< E >::search ( const E &  e) const
inline

Scans the list for the specified element and returns an iterator to the first occurrence in the list, or an invalid iterator if not found.

Definition at line 1561 of file List.h.

template<class E>
ListIterator<E> ogdf::List< E >::search ( const E &  e)
inline

Scans the list for the specified element and returns an iterator to the first occurrence in the list, or an invalid iterator if not found.

Definition at line 1566 of file List.h.

template<class E>
template<class COMPARER >
ListConstIterator<E> ogdf::List< E >::search ( const E &  e,
const COMPARER &  comp 
) const
inline

Scans the list for the specified element (using the user-defined comparer) and returns an iterator to the first occurrence in the list, or an invalid iterator if not found.

Definition at line 1572 of file List.h.

template<class E>
template<class COMPARER >
ListIterator<E> ogdf::List< E >::search ( const E &  e,
const COMPARER &  comp 
)
inline

Scans the list for the specified element (using the user-defined comparer) and returns an iterator to the first occurrence in the list, or an invalid iterator if not found.

Definition at line 1578 of file List.h.

template<class E>
int ogdf::List< E >::size ( ) const
inline

Definition at line 1200 of file List.h.

template<class E>
void ogdf::List< E >::split ( ListIterator< E >  it,
List< E > &  L1,
List< E > &  L2,
Direction  dir = before 
)
inline

Splits the list at element it into lists L1 and L2.

If it is not a null pointer and L = x1,...,x{k-1}, it,x_{k+1},xn, then L1 = x1,...,x{k-1} and L2 = it,x{k+1},...,xn if dir = before. If it is a null pointer, then L1 is made empty and L2 = L. Finally L is made empty if it is not identical to L1 or L2.

Precondition
it points to an element in this list.

Definition at line 1516 of file List.h.

Member Data Documentation

template<class E>
int ogdf::List< E >::m_count
private

The length of the list.

Definition at line 1179 of file List.h.


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