Open
Graph Drawing
Framework

 v.2010.10
 

Public Member Functions

ogdf::kList Class Reference

Class kList extends the class List by functions needed in the FastHierarchLayout algorithm. More...

#include <ogdf/layered/FastHierarchyLayout.h>

Inheritance diagram for ogdf::kList:
ogdf::List< withKey > ogdf::ListPure< withKey >

List of all members.

Public Member Functions

bool pop (int &e, double &k)
double peek ()
void add (int e, double k)
double median () const
void reduce (kList &newList)
 Scans the list for pairs of elements with the same double key.
withKey popFrontRet ()
 remove first element and return it

Detailed Description

Class kList extends the class List by functions needed in the FastHierarchLayout algorithm.

Especially, it computes the median of a list and reduces it.

Definition at line 116 of file FastHierarchyLayout.h.


Member Function Documentation

void ogdf::kList::add ( int  e,
double  k 
) [inline]

Definition at line 132 of file FastHierarchyLayout.h.

double ogdf::kList::median (  )  const [inline]

Definition at line 139 of file FastHierarchyLayout.h.

double ogdf::kList::peek (  )  [inline]

Definition at line 128 of file FastHierarchyLayout.h.

bool ogdf::kList::pop ( int &  e,
double &  k 
) [inline]

Definition at line 120 of file FastHierarchyLayout.h.

withKey ogdf::kList::popFrontRet (  )  [inline]

remove first element and return it

Reimplemented from ogdf::List< withKey >.

Definition at line 177 of file FastHierarchyLayout.h.

void ogdf::kList::reduce ( kList newList  )  [inline]

Scans the list for pairs of elements with the same double key.

Replaces them by one element. If integer key is 0, it removes element from list. Precondition : list is sorted.

Definition at line 156 of file FastHierarchyLayout.h.


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