Variables.h

Go to the documentation of this file.

#pragma once
 
#include "Visit.h"
#include <carl-arith/core/Variables.h>
 
namespace carl{
 
template<typename Pol>
void variables(const Formula<Pol>& f, carlVariables& vars) {
    carl::visit(f,
        [&vars](const Formula<Pol>& f) {
            switch (f.type()) {
                case FormulaType::BOOL:
                    vars.add(f.boolean());
                    break;
                case FormulaType::CONSTRAINT:
                    carl::variables(f.constraint(), vars);
                    break;
                case FormulaType::VARCOMPARE:
                    carl::variables(f.variable_comparison(), vars);
                    break;
                case FormulaType::VARASSIGN:
                    carl::variables(f.variable_assignment(), vars);
                    break;
                case FormulaType::BITVECTOR:
                    f.bv_constraint().gatherVariables(vars);
                    break;
                case FormulaType::UEQ:
                    f.u_equality().gatherVariables(vars);
                    break;
                case FormulaType::EXISTS:
                case FormulaType::FORALL:
                    vars.add(f.quantified_variables().begin(),f.quantified_variables().end());
                    break;
                default: break;
            }
        }
    );
}
 
template<typename Pol>
void uninterpreted_functions(const Formula<Pol>& f, std::set<UninterpretedFunction>& ufs) {
    carl::visit(f,
        [&ufs](const Formula<Pol>& f) {
            if (f.type() == FormulaType::UEQ) {
                f.u_equality().gatherUFs(ufs);
            }
        }
    );
}
 
template<typename Pol>
void uninterpreted_variables(const Formula<Pol>& f, std::set<UVariable>& uvs) {
    carl::visit(f,
        [&uvs](const Formula<Pol>& f) {
            if (f.type() == FormulaType::UEQ) {
                f.u_equality().gatherUVariables(uvs);
            }
        }
    );
}
 
template<typename Pol>
void bitvector_variables(const Formula<Pol>& f, std::set<BVVariable>& bvvs) {
    carl::visit(f,
        [&bvvs](const Formula<Pol>& f) {
            if (f.type() == FormulaType::BITVECTOR) {
                f.bv_constraint().gatherBVVariables(bvvs);
            }
        }
    );
}
 
/**
 * Collects all constraint occurring in this formula.
 * @param constraints The container to insert the constraint into.
 */
template<typename Pol>
void arithmetic_constraints(const Formula<Pol>& f, std::vector<Constraint<Pol>>& constraints ) {
    carl::visit(f,
        [&constraints](const Formula<Pol>& f) {
            switch (f.type()) {
                case FormulaType::CONSTRAINT:
                    constraints.push_back(f.constraint());
                    break;
                default: break;
            }
        }
    );
}
 
/**
 * Collects all constraint occurring in this formula.
 * @param constraints The container to insert the constraint into.
 */
template<typename Pol>
void arithmetic_constraints(const Formula<Pol>& f, std::vector<Formula<Pol>>& constraints ) {
    carl::visit(f,
        [&constraints](const Formula<Pol>& f) {
            switch (f.type()) {
                case FormulaType::CONSTRAINT:
                    constraints.push_back(f);
                    break;
                default: break;
            }
        }
    );
}
 
}