Base class for GraphElement lists. More...
#include <ogdf/basic/GraphList.h>
 Inheritance diagram for ogdf::internal::GraphListBase:Public Member Functions | |
| GraphListBase () | |
| Constructs an empty list.   | |
| ~GraphListBase () | |
| Destruction.   | |
| void | consistencyCheck () const | 
| Asserts consistency of this list.   | |
| void | del (GraphElement *pX) | 
Removes element pX from the list.   | |
| bool | empty () const | 
| Returns true iff the list is empty.   | |
| void | insertAfter (GraphElement *pX, GraphElement *pY) | 
Inserts element pX after element pY.   | |
| void | insertBefore (GraphElement *pX, GraphElement *pY) | 
Inserts element pX before element pY.   | |
| void | permute () | 
| Permutes all list elements.   | |
| template<class RNG > | |
| void | permute (RNG &rng) | 
| Permutes all list elements.   | |
| void | pushBack (GraphElement *pX) | 
Adds element pX at the end of the list.   | |
| void | reverse () | 
| Reverses the order of the list elements.   | |
| int | size () const | 
| Returns the size of the list.   | |
| template<class LIST > | |
| void | sort (const LIST &newOrder) | 
Sorts the list according to newOrder.   | |
| template<class IT > | |
| void | sort (IT begin, IT end) | 
| Sorts the list according to the range defined by two iterators.   | |
| void | swap (GraphElement *pX, GraphElement *pY) | 
Exchanges the positions of pX and pY in the list.   | |
Protected Attributes | |
| GraphElement * | m_head | 
| Pointer to the first element in the list.   | |
| int | m_size | 
| The size of the list.   | |
| GraphElement * | m_tail | 
| Pointer to the last element in the list.   | |
Base class for GraphElement lists.
Definition at line 72 of file GraphList.h.
      
  | 
  inline | 
Constructs an empty list.
Definition at line 80 of file GraphList.h.
      
  | 
  inline | 
Destruction.
Definition at line 86 of file GraphList.h.
      
  | 
  inline | 
Asserts consistency of this list.
Definition at line 269 of file GraphList.h.
      
  | 
  inline | 
Removes element pX from the list. 
Definition at line 133 of file GraphList.h.
      
  | 
  inline | 
Returns true iff the list is empty.
Definition at line 92 of file GraphList.h.
      
  | 
  inline | 
Inserts element pX after element pY. 
Definition at line 107 of file GraphList.h.
      
  | 
  inline | 
Inserts element pX before element pY. 
Definition at line 120 of file GraphList.h.
      
  | 
  inline | 
Permutes all list elements.
Definition at line 262 of file GraphList.h.
      
  | 
  inline | 
Permutes all list elements.
Definition at line 235 of file GraphList.h.
      
  | 
  inline | 
Adds element pX at the end of the list. 
Definition at line 95 of file GraphList.h.
      
  | 
  inline | 
Reverses the order of the list elements.
Definition at line 176 of file GraphList.h.
      
  | 
  inline | 
Returns the size of the list.
Definition at line 89 of file GraphList.h.
      
  | 
  inline | 
Sorts the list according to newOrder. 
Definition at line 151 of file GraphList.h.
      
  | 
  inline | 
Sorts the list according to the range defined by two iterators.
Definition at line 159 of file GraphList.h.
      
  | 
  inline | 
Exchanges the positions of pX and pY in the list. 
Definition at line 188 of file GraphList.h.
      
  | 
  protected | 
Pointer to the first element in the list.
Definition at line 75 of file GraphList.h.
      
  | 
  protected | 
The size of the list.
Definition at line 74 of file GraphList.h.
      
  | 
  protected | 
Pointer to the last element in the list.
Definition at line 76 of file GraphList.h.