Public Member Functions |
| void | computeAdd (double &D, double &W) |
| | List () |
| | Constructs an empty doubly linked list.
|
| | List (const List< Group > &L) |
| | Constructs a doubly linked list that is a copy of L.
|
| | ~List () |
| const Group & | back () const |
| | Returns a reference to the last element.
|
| Group & | back () |
| | Returns a reference to the last element.
|
| const ListConstIterator< Group > | begin () const |
| | Returns an iterator to the first element of the list.
|
| ListIterator< Group > | begin () |
| | Returns an iterator to the first element of the list.
|
| void | bucketSort (int l, int h, BucketFunc< Group > &f) |
| | Sorts the list using bucket sort.
|
| const Group | chooseElement () const |
| | Returns a random element from the list.
|
| Group | chooseElement () |
| | Returns a random element from the list.
|
| ListConstIterator< Group > | chooseIterator () const |
| | Returns an iterator to a random element in the list (or an invalid iterator if the list is empty)
|
| ListIterator< Group > | chooseIterator () |
| | Returns an iterator to a random element in the list (or an invalid iterator if the list is empty)
|
| void | clear () |
| | Removes all elements from the list.
|
| void | conc (List< Group > &L2) |
| | Appends L2 to this list and makes L2 empty.
|
| void | concFront (List< Group > &L2) |
| | Prepends L2 to this list and makes L2 empty.
|
| ListConstIterator< Group > | cyclicPred (ListConstIterator< Group > it) const |
| | Returns an iterator to the cyclic predecessor of it.
|
| ListIterator< Group > | cyclicPred (ListIterator< Group > it) |
| | Returns an iterator to the cyclic predecessor of it.
|
| ListConstIterator< Group > | cyclicSucc (ListConstIterator< Group > it) const |
| | Returns an iterator to the cyclic successor of it.
|
| ListIterator< Group > | cyclicSucc (ListIterator< Group > it) |
| | Returns an iterator to the cyclic successor of it.
|
| void | del (ListIterator< Group > it) |
| | Removes it from the list.
|
| bool | empty () const |
| | Returns true iff the list is empty.
|
| ListConstIterator< Group > | end () const |
| | Returns an iterator to one-past-last element of the list.
|
| ListIterator< Group > | end () |
| | Returns an iterator to one-past-last element of the list.
|
| void | exchange (ListIterator< Group > it1, ListIterator< Group > it2) |
| | Exchanges the positions of it1 and it2 in the list.
|
| void | exchange (List< Group > &L2) |
| | Exchanges too complete lists in O(1).
|
| const Group & | front () const |
| | Returns a reference to the first element.
|
| Group & | front () |
| | Returns a reference to the first element.
|
| ListConstIterator< Group > | get (int pos) const |
| | Returns an iterator pointing to the element at position pos.
|
| ListIterator< Group > | get (int pos) |
| | Returns an iterator pointing to the element at position pos.
|
| const ListPure< Group > & | getListPure () const |
| | Conversion to const SListPure.
|
| ListIterator< Group > | insert (const Group &x, ListIterator< Group > it, Direction dir=after) |
| | Inserts element x before or after it.
|
| ListIterator< Group > | insertAfter (const Group &x, ListIterator< Group > it) |
| | Inserts element x after it.
|
| ListIterator< Group > | insertBefore (const Group &x, ListIterator< Group > it) |
| | Inserts element x before it.
|
| void | moveToBack (ListIterator< Group > it) |
| | Moves it to the end of the list.
|
| void | moveToBack (ListIterator< Group > it, List< Group > &L2) |
| | Moves it to the end of L2.
|
| void | moveToFront (ListIterator< Group > it) |
| | Moves it to the beginning of the list.
|
| void | moveToFront (ListIterator< Group > it, List< Group > &L2) |
| | Moves it to the beginning of L2.
|
| void | moveToPrec (ListIterator< Group > it, ListIterator< Group > itAfter) |
| | Moves it before itAfter.
|
| void | moveToPrec (ListIterator< Group > it, List< Group > &L2, ListIterator< Group > itAfter) |
| | Moves it to list L2 and inserts it after itBefore.
|
| void | moveToSucc (ListIterator< Group > it, ListIterator< Group > itBefore) |
| | Moves it after itBefore.
|
| void | moveToSucc (ListIterator< Group > it, List< Group > &L2, ListIterator< Group > itBefore) |
| | Moves it to list L2 and inserts it after itBefore.
|
| bool | operator!= (const List< Group > &L) const |
| | Inequality operator.
|
| List< Group > & | operator= (const List< Group > &L) |
| bool | operator== (const List< Group > &L) const |
| | Equality operator.
|
| void | permute () |
| | Randomly permutes the elements in the list.
|
| void | popBack () |
| | Removes the last element from the list.
|
| Group | popBackRet () |
| | Removes the last element from the list and returns it.
|
| void | popFront () |
| | Removes the first element from the list.
|
| Group | popFrontRet () |
| | Removes the first element from the list and returns it.
|
| int | pos (ListConstIterator< Group > it) const |
| | Returns the position (starting with 0) of iterator it in the list.
|
| ListIterator< Group > | pushBack (const Group &x) |
| | Adds element x at the end of the list.
|
| ListIterator< Group > | pushFront (const Group &x) |
| | Adds element x at the begin of the list.
|
| void | quicksort () |
| | Sorts the list using Quicksort.
|
| void | quicksort (const COMPARER &comp) |
| | Sorts the list using Quicksort and comparer comp.
|
| const ListConstIterator< Group > | rbegin () const |
| | Returns an iterator to the last element of the list.
|
| ListIterator< Group > | rbegin () |
| | Returns an iterator to the last element of the list.
|
| ListConstIterator< Group > | rend () const |
| | Returns an iterator to one-before-first element of the list.
|
| ListIterator< Group > | rend () |
| | Returns an iterator to one-before-first element of the list.
|
| void | reverse () |
| | Reverses the order of the list elements.
|
| int | search (const Group &e) const |
| | Scans the list for the specified element and returns its position in the list, or -1 if not found.
|
| int | search (const Group &e, const COMPARER &comp) const |
| | Scans the list for the specified element (using the user-defined comparer) and returns its position in the list, or -1 if not found.
|
| int | size () const |
| | Returns the length of the list.
|
| void | split (ListIterator< Group > it, List< Group > &L1, List< Group > &L2, Direction dir=before) |
| | Splits the list at element it into lists L1 and L2.
|
Inheritance diagram for ogdf::RadialTreeLayout::Grouping:
