GraphTool
1.0
Tool for analyzing and graphically visualizing code dependencies for Ericsson.
|
#include <graph_filter_list.h>
Public Types | |
typedef GraphType::node_value_type | V_type |
typedef GraphType::edge_value_type | E_type |
typedef std::map< std::string, GraphAction< GraphType > * > | FilterList |
typedef FilterList::iterator | iterator |
typedef FilterList::const_iterator | const_iterator |
Public Member Functions | |
void | add (GraphAction< GraphType > *action) |
void | remove (std::string name) |
GraphAction< GraphType > * | get (std::string name) |
void | clear () |
std::set< GraphAction < GraphType > * > | clear_type (std::string type) |
iterator | begin () |
iterator | end () |
FilterList & | filters () |
bool | operator() (V_type m) |
bool | operator() (E_type e) |
template<typename P1 , typename P2 > | |
bool | operator() (std::pair< P1, P2 > &m) |
List of filters that are applied consequtively with AND logic. Allows for the chaining of filters so that multiple filters can be applied at once.