invariantSets.h File Reference

#include "capd/invset/Scope.h"
#include "capd/auxil/logger_deprecated.h"

Classes
struct	capd::invset::GetKey

Namespaces
	capd
	capd::invset

Functions
template<typename GraphT >
void	capd::invset::noVisualization (const GraphT &g)
template<class GraphT >
void	capd::invset::computePositiveInvariantSet (GraphT &graph, std::list< typename GraphT::VectorType > &domain, int subdiv, void(*showGraph)(const GraphT &g)=noVisualization< GraphT >)
	computes enclosure of the positive invariant set More...
template<class GraphT >
void	capd::invset::computeInvariantSet (GraphT &graph, std::list< typename GraphT::VectorType > &domain, int subdiv, void(*showGraph)(const GraphT &g)=noVisualization< GraphT >)
	computes enclosure of the positive invariant set More...
template<class GraphT >
void	capd::invset::computeInvariantSet (GraphT &graph, typename GraphT::VectorType &domain, int subdiv, void(*showGraph)(const GraphT &g)=noVisualization< GraphT >)
	computes enclosure of the positive invariant set More...
template<typename MapType , typename SetType >
void	capd::invset::insertMapKeysIntoSet (const MapType &map, SetType &set)
	inserts all map keys into set More...
template<typename GraphT , typename ConstraintsT >
void	capd::invset::propagateGraph (GraphT &graph, ConstraintsT &constraints, void(*showGraph)(const GraphT &g)=noVisualization< GraphT >)
	it iteratively compute image of all cubes in the graph and adds them if they satisfy constraints until no more new cubes can be added More...
template<typename GraphT , typename ConstraintsT >
void	capd::invset::propagateVertexSet (GraphT &graph, ConstraintsT &constraints, typename GraphT::VertexSet &result)
	it iteratively compute image of all cubes in the graph and adds them if they satisfy constraints until no more new cubes can be added More...

Detailed Description

Author

Tomasz Kapela

Date

2009-12-15