#include <sstream>
#include <string>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <vector>
#include <diades/utils/Loggable.hh>
#include <boost/archive/text_oarchive.hpp>
#include <boost/archive/text_iarchive.hpp>
#include <boost/serialization/vector.hpp>
#include <boost/serialization/set.hpp>
#include <boost/serialization/map.hpp>
#include <diades/utils/Exceptions.hh>
#include <diades/utils/Assertion.hh>
#include <diades/graph/Graph.hh>
#include <diades/graph/NodeMap.hh>
#include <diades/graph/ConstNodeMap.hh>
#include <diades/graph/EdgeMap.hh>
#include <diades/automata/Event.hh>
#include <diades/automata/BeliefState.hh>
Go to the source code of this file.
|
template<typename InputIterator > |
void | Diades::Automata::deleteTransition (Component &comp, InputIterator first, InputIterator last) |
|
template<typename InputIterator > |
void | Diades::Automata::deleteState (Component &comp, InputIterator first, InputIterator last) |
|
template<typename InputIterator , typename Predicate > |
void | Diades::Automata::deleteState (Component &comp, InputIterator first, InputIterator last, Predicate pred) |
|
template<typename InputIterator > |
void | Diades::Automata::purgeNonPredecessors (Component &comp, InputIterator first, InputIterator last) |
|