#include <EdgeIteratorTest.h>
Inheritance diagram for EdgeIteratorTest:
Public Member Functions | |
EdgeIteratorTest (TestSuite *s) | |
void | setup (void) |
void | cleanup (void) |
void | testReferenceIteration (void) |
void | testIterationLength (void) |
Private Member Functions | |
bool | genericTestGraphIteration (Graph *g, EdgeIterator::ITERATIONMODE m) |
bool | genericTestVertexIteration (Vertex *srcvertex, EdgeIterator::ITERATIONMODE m, const std::vector< Edge * > &edges) |
bool | genericTestIterationLength (Graph *g) |
Private Attributes | |
BitString * | bs1 |
BitString * | bs2 |
CvrStgFile * | f1 |
CvrStgFile * | f2 |
Selector * | s1 |
Selector * | s2 |
Graph * | g1 |
Graph * | g2 |
Globals | gl1 |
Globals | gl2 |
BitString * | bs10 |
BitString * | bs11 |
BitString * | bs12 |
CvrStgFile * | f10 |
CvrStgFile * | f11 |
CvrStgFile * | f12 |
Selector * | s10 |
Selector * | s11 |
Selector * | s12 |
Graph * | g10 |
Graph * | g11 |
Graph * | g12 |
Globals | gl10 |
Globals | gl11 |
Globals | gl12 |
EdgeIteratorTest::EdgeIteratorTest | ( | TestSuite * | s | ) |
void EdgeIteratorTest::setup | ( | void | ) | [virtual] |
setup the unit test - called before run
UnitTest::setup will (together with UnitTest::cleanup) save and restore the object stored in Globs so they should be called from the corresponding functions in the derived object if the derived unit test manipulates the Globs object.
Reimplemented from UnitTest.
void EdgeIteratorTest::cleanup | ( | void | ) | [virtual] |
cleanup the unit test - called after run
Reimplemented from UnitTest.
void EdgeIteratorTest::testReferenceIteration | ( | void | ) |
void EdgeIteratorTest::testIterationLength | ( | void | ) |
bool EdgeIteratorTest::genericTestGraphIteration | ( | Graph * | g, | |
EdgeIterator::ITERATIONMODE | m | |||
) | [private] |
bool EdgeIteratorTest::genericTestVertexIteration | ( | Vertex * | srcvertex, | |
EdgeIterator::ITERATIONMODE | m, | |||
const std::vector< Edge * > & | edges | |||
) | [private] |
check if an edge iterator for srcvertex with m iterates exactly through edges
bool EdgeIteratorTest::genericTestIterationLength | ( | Graph * | g | ) | [private] |
for all vertices in the graph test if getDegree() returns exactly the number of edges EdgeIterator iterates through
BitString* EdgeIteratorTest::bs1 [private] |
BitString * EdgeIteratorTest::bs2 [private] |
CvrStgFile* EdgeIteratorTest::f1 [private] |
CvrStgFile * EdgeIteratorTest::f2 [private] |
Selector* EdgeIteratorTest::s1 [private] |
Selector * EdgeIteratorTest::s2 [private] |
Graph* EdgeIteratorTest::g1 [private] |
Graph * EdgeIteratorTest::g2 [private] |
Globals EdgeIteratorTest::gl1 [private] |
Globals EdgeIteratorTest::gl2 [private] |
BitString* EdgeIteratorTest::bs10 [private] |
BitString * EdgeIteratorTest::bs11 [private] |
BitString * EdgeIteratorTest::bs12 [private] |
CvrStgFile* EdgeIteratorTest::f10 [private] |
CvrStgFile * EdgeIteratorTest::f11 [private] |
CvrStgFile * EdgeIteratorTest::f12 [private] |
Selector* EdgeIteratorTest::s10 [private] |
Selector * EdgeIteratorTest::s11 [private] |
Selector * EdgeIteratorTest::s12 [private] |
Graph* EdgeIteratorTest::g10 [private] |
Graph * EdgeIteratorTest::g11 [private] |
Graph * EdgeIteratorTest::g12 [private] |
Globals EdgeIteratorTest::gl10 [private] |
Globals EdgeIteratorTest::gl11 [private] |
Globals EdgeIteratorTest::gl12 [private] |