Open
Graph Drawing
Framework

  v.2010.10
 
Overview Class Hierarchy Class Index Class List Members Namespaces Source Files

Public Member Functions

ogdf::GraphList< T > Class Template Reference

Lists of graph objects (like nodes, edges, etc.). More...

#include <ogdf/basic/Graph_d.h>

Inheritance diagram for ogdf::GraphList< T >:
ogdf::GraphListBase

List of all members.

Public Member Functions

 GraphList ()
 Constructs an empty list.
 ~GraphList ()
T * begin () const
 Returns the first element in the list.
T * rbegin () const
 Returns the last element in the list.
bool empty ()
 Returns true iff the list is empty.
void pushBack (T *pX)
 Adds element pX at the end of the list.
void insertAfter (T *pX, T *pY)
 Inserts element pX after element pY.
void insertBefore (T *pX, T *pY)
 Inserts element pX before element pY.
void move (T *pX, GraphList< T > &L, T *pY, Direction dir)
 Moves element pX to list L and inserts it before or after pY.
void move (T *pX, GraphList< T > &L)
 Moves element pX to list L and inserts it at the end.
void moveAfter (T *pX, T *pY)
 Moves element pX from its current position to a position after pY.
void moveBefore (T *pX, T *pY)
 Moves element pX from its current position to a position before pY.
void del (T *pX)
 Removes element pX from the list and deletes it.
void delPure (T *pX)
 Only removes element pX from the list; does not delete it.
void clear ()
 Removes all elements from the list and deletes them.
template<class T_LIST >
void sort (const T_LIST &newOrder)
 Sorts all elements according to newOrder.
void reverse ()
 Reverses the order of the list elements.
void swap (T *pX, T *pY)
 Exchanges the positions of pX and pY in the list.
bool consistencyCheck ()
 Checks consistency of graph list; returns true if ok.
void * operator new (size_t nBytes)
void * operator new (size_t, void *p)
void operator delete (void *p, size_t nBytes)

Detailed Description

template<class T>
class ogdf::GraphList< T >

Lists of graph objects (like nodes, edges, etc.).

The template type T must be a class derived from GraphElement.

Definition at line 266 of file Graph_d.h.

Constructor & Destructor Documentation

template<class T>
ogdf::GraphList< T >::GraphList (  )  [inline]

Constructs an empty list.

Definition at line 269 of file Graph_d.h.

template<class T>
ogdf::GraphList< T >::~GraphList (  )  [inline]

Definition at line 271 of file Graph_d.h.

Member Function Documentation

template<class T>
T* ogdf::GraphList< T >::begin (  )  const [inline]

Returns the first element in the list.

Definition at line 277 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::clear (  )  [inline]

Removes all elements from the list and deletes them.

Definition at line 338 of file Graph_d.h.

template<class T>
bool ogdf::GraphList< T >::consistencyCheck (  )  [inline]

Checks consistency of graph list; returns true if ok.

Reimplemented from ogdf::GraphListBase.

Definition at line 364 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::del ( T *  pX  )  [inline]

Removes element pX from the list and deletes it.

Definition at line 327 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::delPure ( T *  pX  )  [inline]

Only removes element pX from the list; does not delete it.

Definition at line 333 of file Graph_d.h.

template<class T>
bool ogdf::GraphList< T >::empty (  )  [inline]

Returns true iff the list is empty.

Definition at line 282 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::insertAfter ( T *  pX,
T *  pY 
) [inline]

Inserts element pX after element pY.

Definition at line 290 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::insertBefore ( T *  pX,
T *  pY 
) [inline]

Inserts element pX before element pY.

Definition at line 295 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::move ( T *  pX,
GraphList< T > &  L 
) [inline]

Moves element pX to list L and inserts it at the end.

Definition at line 309 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::move ( T *  pX,
GraphList< T > &  L,
T *  pY,
Direction  dir 
) [inline]

Moves element pX to list L and inserts it before or after pY.

Definition at line 300 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::moveAfter ( T *  pX,
T *  pY 
) [inline]

Moves element pX from its current position to a position after pY.

Definition at line 315 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::moveBefore ( T *  pX,
T *  pY 
) [inline]

Moves element pX from its current position to a position before pY.

Definition at line 321 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::operator delete ( void *  p,
size_t  nBytes 
) [inline]

Reimplemented from ogdf::GraphListBase.

Definition at line 369 of file Graph_d.h.

template<class T>
void* ogdf::GraphList< T >::operator new ( size_t  ,
void *  p 
) [inline]

Reimplemented from ogdf::GraphListBase.

Definition at line 369 of file Graph_d.h.

template<class T>
void* ogdf::GraphList< T >::operator new ( size_t  nBytes  )  [inline]

Reimplemented from ogdf::GraphListBase.

Definition at line 369 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::pushBack ( T *  pX  )  [inline]

Adds element pX at the end of the list.

Definition at line 285 of file Graph_d.h.

template<class T>
T* ogdf::GraphList< T >::rbegin (  )  const [inline]

Returns the last element in the list.

Definition at line 279 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::reverse (  )  [inline]

Reverses the order of the list elements.

Reimplemented from ogdf::GraphListBase.

Definition at line 353 of file Graph_d.h.

template<class T>
template<class T_LIST >
void ogdf::GraphList< T >::sort ( const T_LIST &  newOrder  )  [inline]

Sorts all elements according to newOrder.

Definition at line 347 of file Graph_d.h.

template<class T>
void ogdf::GraphList< T >::swap ( T *  pX,
T *  pY 
) [inline]

Exchanges the positions of pX and pY in the list.

Definition at line 358 of file Graph_d.h.

The documentation for this class was generated from the following file:
© 1999-2010 by oreas GmbH, © 2005-2010 by Technische Universität Dortmund, University of Jena and University of Cologne.

Generated on Wed Oct 20 2010 11:14:12 by doxygen 1.7.1.