DiaDes
0.1
DIAgnosis of Discrete-Event System
|
#include <GraphNodeSet.hh>
Public Types | |
using | Node = Diades::Graph::Node |
using | Exception = Diades::Utils::Exception< GraphNodeSet > |
using | Iterator = set< Node >::const_iterator |
Public Member Functions | |
GraphNodeSet (const Graph &graph) | |
GraphNodeSet (const Graph &graph, Node n) | |
GraphNodeSet (const Graph &graph, const set< Node > &n) | |
GraphNodeSet (const Graph &graph, const unordered_set< Node > &s) | |
GraphNodeSet (const GraphNodeSet &ns) | |
void | insertNode (Node n) |
template<class InputNodeIterator > | |
void | insertNodes (InputNodeIterator first, InputNodeIterator last) |
void | removeNode (Node n) |
Iterator | findNode (Node n) const |
bool | isEmpty () const |
int | size () const |
GraphNodeSet * | nextGraphNodeSet (const set< Edge > &edges) const |
GraphNodeSet * | previousGraphNodeSet (const set< Edge > &edges) const |
const Graph & | graph () const |
Iterator | begin () const |
Iterator | end () const |
set< Node > & | setOfNodes () |
bool | operator== (const GraphNodeSet &ns) const |
Static Public Member Functions | |
static string | typeName () |
Protected Attributes | |
const Graph & | _grph |
set< Node > | _nodes |
Friends | |
ostream & | operator<< (ostream &os, const GraphNodeSet &s) |
This class defines a set of Node objects in a Graph From a GraphNodeSet, a set of edges can be triggered and generate a new GraphNodeSet
Definition at line 30 of file GraphNodeSet.hh.
using Diades::Graph::GraphNodeSet::Exception = Diades::Utils::Exception<GraphNodeSet> |
Definition at line 39 of file GraphNodeSet.hh.
using Diades::Graph::GraphNodeSet::Iterator = set<Node>::const_iterator |
Iterator on the nodes
Definition at line 41 of file GraphNodeSet.hh.
using Diades::Graph::GraphNodeSet::Node = Diades::Graph::Node |
Definition at line 33 of file GraphNodeSet.hh.
|
inline |
Default constructor, build an empty set
graph | Graph of the set |
Definition at line 65 of file GraphNodeSet.hh.
Diades::Graph::GraphNodeSet::GraphNodeSet | ( | const GraphNodeSet & | ns | ) |
Copy constructor
|
inline |
Definition at line 196 of file GraphNodeSet.hh.
Referenced by Diades::Graph::GraphNodeSetTable< T >::getInfo(), Diades::Graph::GraphNodeSetTable< T >::insertIfNotFound(), Diades::Automata::Experimental::ManagedBeliefStateWithSourceStateCreator< StateMachine, StatePropertyCombination >::newState(), Diades::Automata::Experimental::ManagedBeliefStateBasedStateCreator< StateMachine, StatePropertyCombination >::newState(), and Diades::Automata::Experimental::BeliefState< StateMachine >::nextReachableBeliefState().
|
inline |
Definition at line 205 of file GraphNodeSet.hh.
Referenced by Diades::Graph::GraphNodeSetTable< T >::getInfo(), Diades::Graph::GraphNodeSetTable< T >::insertIfNotFound(), Diades::Automata::Experimental::ManagedBeliefStateWithSourceStateCreator< StateMachine, StatePropertyCombination >::newState(), Diades::Automata::Experimental::ManagedBeliefStateBasedStateCreator< StateMachine, StatePropertyCombination >::newState(), and Diades::Automata::Experimental::BeliefState< StateMachine >::nextReachableBeliefState().
Find a Node
n | Node to find in the GraphNodeSet |
Definition at line 137 of file GraphNodeSet.hh.
References require.
Referenced by Diades::Automata::Experimental::BeliefState< StateMachine >::findState().
|
inline |
void Diades::Graph::GraphNodeSet::insertNode | ( | Node | n | ) |
Insertion of a state
n | a Node |
Referenced by Diades::Automata::Experimental::BeliefState< StateMachine >::insertState().
|
inline |
Definition at line 119 of file GraphNodeSet.hh.
Referenced by Diades::Automata::Experimental::BeliefState< StateMachine >::insertStates().
|
inline |
Emptyness
Definition at line 149 of file GraphNodeSet.hh.
Referenced by Diades::Graph::GraphNodeSetTable< T >::getInfo(), and Diades::Graph::GraphNodeSetTable< T >::insertIfNotFound().
GraphNodeSet* Diades::Graph::GraphNodeSet::nextGraphNodeSet | ( | const set< Edge > & | edges | ) | const |
Next node set
edges | set of Edge objects |
|
inline |
ns | a GraphNodeSet |
Definition at line 223 of file GraphNodeSet.hh.
References _grph, _nodes, and Diades::Utils::operator<<().
Referenced by Diades::Automata::BeliefState::operator==().
GraphNodeSet* Diades::Graph::GraphNodeSet::previousGraphNodeSet | ( | const set< Edge > & | edges | ) | const |
Previous node set
egdes | set of Edge objects |
void Diades::Graph::GraphNodeSet::removeNode | ( | Node | n | ) |
Removal of a state
n | a Node |
Referenced by Diades::Automata::Experimental::BeliefState< StateMachine >::removeState().
|
inline |
set of _nodes
Definition at line 214 of file GraphNodeSet.hh.
|
inline |
Size of the set
Definition at line 158 of file GraphNodeSet.hh.
|
inlinestatic |
Definition at line 35 of file GraphNodeSet.hh.
|
friend |
output stream
|
protected |
Definition at line 44 of file GraphNodeSet.hh.
Referenced by Diades::Automata::BeliefState::operator=(), and operator==().
|
protected |
Definition at line 54 of file GraphNodeSet.hh.
Referenced by Diades::Automata::Experimental::BeliefState< StateMachine >::nextBeliefState(), Diades::Automata::Experimental::BeliefState< StateMachine >::nextPredicateBeliefState(), Diades::Automata::BeliefState::operator=(), operator==(), Diades::Automata::Experimental::BeliefState< StateMachine >::prevBeliefState(), and Diades::Automata::Experimental::BeliefState< StateMachine >::prevPredicateBeliefState().