|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for tpl_indexArc.H (IndexArc) More...
Go to the source code of this file.
Functions | |
| TEST (IndexArcUndirected, SearchIsSymmetric) | |
| TEST (IndexArcDirected, SearchRespectsDirection) | |
| TEST (IndexArc, InsertDoesNotDuplicateSamePointer) | |
| TEST (IndexArc, InsertDuplicateEndpointsReturnsExisting) | |
| TEST (IndexArc, InsertInGraphAndRemoveFromGraph) | |
| TEST (IndexArc, ClearIndexAndRebuild) | |
| TEST (IndexArc, ConstructorWithFilterOnlyIndexesMatchingArcs) | |
Tests for tpl_indexArc.H (IndexArc)
Definition in file tpl_indexArc_test.cc.
| TEST | ( | IndexArc | , |
| ClearIndexAndRebuild | |||
| ) |
Definition at line 163 of file tpl_indexArc_test.cc.
References Aleph::IndexArc< GT, Tree, SA >::build_index(), Aleph::IndexArc< GT, Tree, SA >::clear_index(), GraphCommon< GT, Node, Arc >::get_num_arcs(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and Aleph::IndexArc< GT, Tree, SA >::size().
| TEST | ( | IndexArc | , |
| ConstructorWithFilterOnlyIndexesMatchingArcs | |||
| ) |
Definition at line 185 of file tpl_indexArc_test.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and Aleph::search_arc().
| TEST | ( | IndexArc | , |
| InsertDoesNotDuplicateSamePointer | |||
| ) |
| TEST | ( | IndexArc | , |
| InsertDuplicateEndpointsReturnsExisting | |||
| ) |
Definition at line 118 of file tpl_indexArc_test.cc.
References Aleph::IndexArc< GT, Tree, SA >::insert(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), Aleph::IndexArc< GT, Tree, SA >::remove(), and Aleph::IndexArc< GT, Tree, SA >::size().
| TEST | ( | IndexArc | , |
| InsertInGraphAndRemoveFromGraph | |||
| ) |
Definition at line 141 of file tpl_indexArc_test.cc.
References GraphCommon< GT, Node, Arc >::get_num_arcs(), Aleph::IndexArc< GT, Tree, SA >::insert_in_graph(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), Aleph::IndexArc< GT, Tree, SA >::remove_from_graph(), Aleph::IndexArc< GT, Tree, SA >::search(), and Aleph::IndexArc< GT, Tree, SA >::size().
| TEST | ( | IndexArcDirected | , |
| SearchRespectsDirection | |||
| ) |
Definition at line 82 of file tpl_indexArc_test.cc.
References Aleph::IndexArc< GT, Tree, SA >::insert(), Aleph::maps(), Aleph::IndexArc< GT, Tree, SA >::search(), and Aleph::IndexArc< GT, Tree, SA >::size().
| TEST | ( | IndexArcUndirected | , |
| SearchIsSymmetric | |||
| ) |
Definition at line 66 of file tpl_indexArc_test.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), Aleph::IndexArc< GT, Tree, SA >::search(), Aleph::IndexArc< GT, Tree, SA >::search_directed(), and Aleph::IndexArc< GT, Tree, SA >::size().