SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Projection_F.h File Reference
#include <iostream>
#include <map>
#include <vector>
#include "../common.h"
#include "../debug/DotHelper.h"
#include "BaseProjection.h"
#include "ProjectionComparator.h"
Include dependency graph for Projection_F.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  smtrat::cad::Projection< Incrementality::FULL, BT, Settings >
 
struct  smtrat::cad::Projection< Incrementality::FULL, BT, Settings >::QueueEntry
 
struct  smtrat::cad::Projection< Incrementality::FULL, BT, Settings >::ProjectionCandidateComparator
 
struct  smtrat::cad::Projection< Incrementality::FULL, BT, Settings >::PurgedPolynomials
 
struct  smtrat::cad::Projection< Incrementality::FULL, BT, Settings >::PurgedPolynomials::PurgedLevel
 

Namespaces

 smtrat
 Class to create the formulas for axioms.
 
 smtrat::cad
 
 smtrat::cad::full
 

Typedefs

using smtrat::cad::full::Polynomial = std::optional< std::pair< UPoly, Origin > >
 

Functions

std::ostream & smtrat::cad::operator<< (std::ostream &os, const full::Polynomial &p)
 
template<typename S , Backtracking B>
std::ostream & smtrat::cad::operator<< (std::ostream &os, const Projection< Incrementality::FULL, B, S > &p)