smtrat::cadcells::representation::util Namespace Reference

Data Structures
struct	IntervalCompare
struct	PolyDelineation
	Polynomial decomposition. More...
struct	PolyDelineations

Typedefs
template<typename T >
using	DerivationSet = boost::container::flat_set< datastructures::SampledDerivationRef< T >, IntervalCompare< T > >

Functions
template<typename T >
bool	is_covering (const DerivationSet< T > &set)
bool	compare_simplest (datastructures::Projections &proj, datastructures::PolyRef p1, datastructures::PolyRef p2)
bool	max_degree (datastructures::Projections &proj, datastructures::RootFunction rf)
bool	compare_simplest (datastructures::Projections &proj, datastructures::RootFunction rf1, datastructures::RootFunction rf2)
std::optional< datastructures::IndexedRoot >	simplest_bound (datastructures::Projections &proj, const std::vector< datastructures::TaggedIndexedRoot > &bounds, datastructures::PolyRef origin_filter)
datastructures::IndexedRoot	simplest_bound (datastructures::Projections &proj, const std::vector< datastructures::TaggedIndexedRoot > &bounds, bool enable_weak=false)
datastructures::SymbolicInterval	compute_simplest_cell (datastructures::Projections &proj, const datastructures::DelineationInterval &del, bool enable_weak=false)
void	simplest_biggest_cell_ordering (datastructures::Projections &, const datastructures::Delineation &delin, const datastructures::DelineationInterval &delin_interval, const datastructures::SymbolicInterval &interval, datastructures::IndexedRootOrdering &ordering, bool enable_weak=false)
void	simplest_chain_ordering (datastructures::Projections &proj, const datastructures::Delineation &delin, datastructures::IndexedRootOrdering &ordering, bool enable_weak=false)
void	simplest_ldb_ordering (datastructures::Projections &proj, const datastructures::Delineation &delin, const datastructures::DelineationInterval &delin_interval, const datastructures::SymbolicInterval &interval, datastructures::IndexedRootOrdering &ordering, boost::container::flat_set< datastructures::PolyRef > &equational, bool enable_weak, bool use_global_cache)
void	decompose (datastructures::Delineation &delin, const datastructures::DelineationInterval &delin_interval, PolyDelineations &poly_delins)
void	chain_ordering (const datastructures::PolyRef poly, const PolyDelineation &poly_delin, datastructures::IndexedRootOrdering &ordering)
void	biggest_cell_ordering (const datastructures::PolyRef poly, const PolyDelineation &poly_delin, datastructures::IndexedRootOrdering &ordering)
auto	get_local_del_polys (const datastructures::Delineation &delin)
	Local delineability. More...
bool	local_del_poly_independent (const datastructures::Delineation &delin, const datastructures::PolyRef &poly)
void	local_del_ordering (datastructures::Projections &proj, const datastructures::PolyRef poly, const cadcells::Assignment &ass, const cadcells::RAN &sample, datastructures::Delineation &delin, const datastructures::SymbolicInterval &interval, datastructures::IndexedRootOrdering &ordering)
void	simplify (const datastructures::PolyRef poly, datastructures::Delineation &delin)

Typedef Documentation

DerivationSet

template<typename T >

using smtrat::cadcells::representation::util::DerivationSet = typedef boost::container::flat_set<datastructures::SampledDerivationRef<T>, IntervalCompare<T> >

Definition at line 164 of file heuristics_covering.h.

Function Documentation

biggest_cell_ordering()

void smtrat::cadcells::representation::util::biggest_cell_ordering ( const datastructures::PolyRef  poly, const PolyDelineation &  poly_delin, datastructures::IndexedRootOrdering &  ordering  )

inline

Definition at line 406 of file util.h.

Here is the call graph for this function:

chain_ordering()

void smtrat::cadcells::representation::util::chain_ordering ( const datastructures::PolyRef  poly, const PolyDelineation &  poly_delin, datastructures::IndexedRootOrdering &  ordering  )

inline

Definition at line 399 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

compare_simplest() [1/2]

bool smtrat::cadcells::representation::util::compare_simplest ( datastructures::Projections &  proj, datastructures::PolyRef  p1, datastructures::PolyRef  p2  )

inline

Definition at line 7 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

compare_simplest() [2/2]

bool smtrat::cadcells::representation::util::compare_simplest ( datastructures::Projections &  proj, datastructures::RootFunction  rf1, datastructures::RootFunction  rf2  )

inline

Definition at line 25 of file util.h.

Here is the call graph for this function:

compute_simplest_cell()

datastructures::SymbolicInterval smtrat::cadcells::representation::util::compute_simplest_cell ( datastructures::Projections &  proj, const datastructures::DelineationInterval &  del, bool  enable_weak = false  )

inline

Definition at line 56 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

decompose()

void smtrat::cadcells::representation::util::decompose ( datastructures::Delineation &  delin, const datastructures::DelineationInterval &  delin_interval, PolyDelineations &  poly_delins  )

inline

Definition at line 361 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

get_local_del_polys()

auto smtrat::cadcells::representation::util::get_local_del_polys ( const datastructures::Delineation &  delin )

inline

Local delineability.

Definition at line 421 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

is_covering()

template<typename T >

bool smtrat::cadcells::representation::util::is_covering

(

const DerivationSet< T > &

set

)

Definition at line 166 of file heuristics_covering.h.

Here is the call graph for this function:

Here is the caller graph for this function:

local_del_ordering()

void smtrat::cadcells::representation::util::local_del_ordering ( datastructures::Projections &  proj, const datastructures::PolyRef  poly, const cadcells::Assignment &  ass, const cadcells::RAN &  sample, datastructures::Delineation &  delin, const datastructures::SymbolicInterval &  interval, datastructures::IndexedRootOrdering &  ordering  )

inline

Definition at line 446 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

local_del_poly_independent()

bool smtrat::cadcells::representation::util::local_del_poly_independent ( const datastructures::Delineation &  delin, const datastructures::PolyRef &  poly  )

inline

Definition at line 433 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

max_degree()

bool smtrat::cadcells::representation::util::max_degree ( datastructures::Projections &  proj, datastructures::RootFunction  rf  )

inline

Definition at line 12 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

simplest_biggest_cell_ordering()

void smtrat::cadcells::representation::util::simplest_biggest_cell_ordering ( datastructures::Projections &  , const datastructures::Delineation &  delin, const datastructures::DelineationInterval &  delin_interval, const datastructures::SymbolicInterval &  interval, datastructures::IndexedRootOrdering &  ordering, bool  enable_weak = false  )

inline

Definition at line 89 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

simplest_bound() [1/2]

datastructures::IndexedRoot smtrat::cadcells::representation::util::simplest_bound ( datastructures::Projections &  proj, const std::vector< datastructures::TaggedIndexedRoot > &  bounds, bool  enable_weak = false  )

inline

Definition at line 41 of file util.h.

Here is the call graph for this function:

simplest_bound() [2/2]

std::optional<datastructures::IndexedRoot> smtrat::cadcells::representation::util::simplest_bound ( datastructures::Projections &  proj, const std::vector< datastructures::TaggedIndexedRoot > &  bounds, datastructures::PolyRef  origin_filter  )

inline

Definition at line 29 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

simplest_chain_ordering()

void smtrat::cadcells::representation::util::simplest_chain_ordering ( datastructures::Projections &  proj, const datastructures::Delineation &  delin, datastructures::IndexedRootOrdering &  ordering, bool  enable_weak = false  )

inline

Definition at line 139 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

simplest_ldb_ordering()

void smtrat::cadcells::representation::util::simplest_ldb_ordering ( datastructures::Projections &  proj, const datastructures::Delineation &  delin, const datastructures::DelineationInterval &  delin_interval, const datastructures::SymbolicInterval &  interval, datastructures::IndexedRootOrdering &  ordering, boost::container::flat_set< datastructures::PolyRef > &  equational, bool  enable_weak, bool  use_global_cache  )

inline

Definition at line 161 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function:

simplify()

void smtrat::cadcells::representation::util::simplify ( const datastructures::PolyRef  poly, datastructures::Delineation &  delin  )

inline

Definition at line 619 of file util.h.

Here is the call graph for this function:

Here is the caller graph for this function: