| ►Ccarl::AbstractGBProcedure< Polynomial > | |
| Ccarl::GBProcedure< Polynomial, Procedure, AddingPolynomialPolicy > | A general class for Groebner Basis calculation |
| ►CAddingPolicy | |
| Ccarl::Buchberger< Polynomial, AddingPolicy > | Gebauer and Moeller style implementation of the Buchberger algorithm |
| Ccarl::AuxQuantifierContent< Pol > | |
| Ccarl::tree_detail::BaseIterator< T, Iterator, reverse > | This is the base class for all iterators |
| ►Ccarl::tree_detail::BaseIterator< T, ChildrenIterator< T, false >, false > | |
| Ccarl::tree_detail::ChildrenIterator< T, reverse > | Iterator class for iterations over all children of a given element |
| ►Ccarl::tree_detail::BaseIterator< T, DepthIterator< T, false >, false > | |
| Ccarl::tree_detail::DepthIterator< T, reverse > | Iterator class for iterations over all elements of a certain depth |
| ►Ccarl::tree_detail::BaseIterator< T, LeafIterator< T, false >, false > | |
| Ccarl::tree_detail::LeafIterator< T, reverse > | Iterator class for iterations over all leaf elements |
| ►Ccarl::tree_detail::BaseIterator< T, PathIterator< T >, false > | |
| Ccarl::tree_detail::PathIterator< T > | Iterator class for iterations from a given element to the root |
| ►Ccarl::tree_detail::BaseIterator< T, PostorderIterator< T, false >, false > | |
| Ccarl::tree_detail::PostorderIterator< T, reverse > | Iterator class for post-order iterations over all elements |
| ►Ccarl::tree_detail::BaseIterator< T, PreorderIterator< T, false >, false > | |
| Ccarl::tree_detail::PreorderIterator< T, reverse > | Iterator class for pre-order iterations over all elements |
| Ccarl::BasicConstraint< Pol > | Represent a polynomial (in)equality against zero |
| Ccarl::settings::binary_quantity | Helper type to parse quantities with binary SI-style suffixes |
| Ccarl::Bitset | This class is a simple wrapper around boost::dynamic_bitset |
| ►Cstd::bitset< Bits > | STL class |
| Ccarl::Condition | |
| Ccarl::BitVector | |
| Ccarl::helper::BitvectorSubstitutor< Pol > | |
| ►CBool | |
| Ccarl::all< T > | Meta-logical conjunction |
| Ccarl::any< T > | Meta-logical disjunction |
| Ccarl::BuchbergerStats | A little class for gathering statistics about the Buchberger algorithm calls |
| Ccarl::BVBinaryContent | |
| Ccarl::BVConstraint | |
| Ccarl::BVExtractContent | |
| Ccarl::BVReasons | |
| Ccarl::BVTerm | |
| Ccarl::BVTermContent | |
| Ccarl::BVUnaryContent | |
| Ccarl::BVValue | |
| Ccarl::BVVariable | Represent a BitVector-Variable |
| Ccarl::Heap< C >::c_iterator | |
| Ccarl::Cache< T > | |
| Ccarl::CachedConstraintContent< Pol > | |
| Ccarl::CArLConverter | |
| Ccarl::carlVariables | |
| Ccarl::Chebyshev< Number > | Implements a generator for Chebyshev polynomials |
| Ccarl::checking< Number > | |
| Ccarl::checkpoints::CheckpointVector | |
| Ccarl::CMakeOptionPrinter | |
| Ccarl::formula::symmetry::ColorGenerator< Number > | Provides unique ids (colors) for all kinds of different objects in the formula: variable types, relations, formula types, numbers, special colors and indexes |
| Ccarl::CompactTree< Entry, FastIndex > | This class packs a complete binary tree in a vector |
| Ccarl::CompactTree< Entry, Configuration::fastIndex > | |
| Ccarl::CompileInfo | Compile time generated structure holding information about compiler and system version |
| ►CConditional | |
| Ccarl::all< Head, Tail... > | |
| Ccarl::any< Head, Tail... > | |
| Ccarl::constant_one< T > | |
| Ccarl::constant_zero< T > | |
| Ccarl::Constraint< Pol > | Represent a polynomial (in)equality against zero |
| Ccarl::IntRepRealAlgebraicNumber< Number >::content | |
| Ccarl::RealAlgebraicNumberThom< Number >::Content | |
| Ccarl::MonomialPool::content_equal | |
| Ccarl::pool::LocalPool< Content >::content_equal< Key > | |
| Ccarl::pool::Pool< Content >::content_equal< Key > | |
| Ccarl::MonomialPool::content_hash | |
| Ccarl::pool::LocalPool< Content >::content_hash< Key > | |
| Ccarl::pool::Pool< Content >::content_hash< Key > | |
| Ccarl::Context | |
| Ccarl::ContextPolynomial< Coeff, Ordering, Policies > | |
| Ccarl::contractor::Contractor< Origin, Polynomial, Number > | |
| Ccarl::ConvertFrom< C > | |
| Ccarl::convert_poly::ConvertHelper< T, S > | |
| Ccarl::convert_ran::ConvertHelper< T, S > | |
| Ccarl::convert_poly::ConvertHelper< ContextPolynomial< A, B, C >, MultivariatePolynomial< A, B, C > > | |
| Ccarl::convert_poly::ConvertHelper< MultivariatePolynomial< A, B, C >, ContextPolynomial< A, B, C > > | |
| Ccarl::convertible_to_variant< T, Variant > | |
| Ccarl::ConvertTo< C > | |
| Ccarl::convRnd< NumberType > | |
| Ccarl::CriticalPairConfiguration< Compare > | |
| Ccarl::CriticalPairs< Datastructure, Configuration > | A data structure to store all the SPolynomial pairs which have to be checked |
| Ccarl::CriticalPairsEntry< Compare > | A list of SPol pairs which have to be checked by the Buchberger algorithm |
| Ccarl::DefaultBuchbergerSettings | Standard settings used if the Buchberger object is not instantiated with another template parameter |
| Ccarl::io::DIMACSExporter< Pol > | Write formulas to the DIMAS format |
| Ccarl::io::DIMACSImporter< Pol > | Parser for the DIMACS format |
| Ccarl::DiophantineEquations< Integer > | Includes the algorithms 6.2 and 6.3 from the book Algorithms for Computer Algebra by Geddes, Czaper, Labahn |
| Ccarl::DivisionLookupResult< Polynomial > | The result of |
| Ccarl::DivisionResult< Type > | A strongly typed pair encoding the result of a division, being a quotient and a remainder |
| Ccarl::EEA< IntegerType > | Extended euclidean algorithm for numbers |
| ►Cstd::enable_shared_from_this | |
| Ccarl::MultivariateHorner< Polynomial, carl::strategy > | |
| Ccarl::MultivariateHorner< PolynomialType, strategy > | |
| Ccarl::equal_to< T, mayBeNull > | Alternative specialization of std::equal_to for pointer types |
| Cstd::equal_to< carl::Monomial::Arg > | |
| Ccarl::equal_to< std::shared_ptr< T >, mayBeNull > | |
| Ccarl::equal_to< T *, mayBeNull > | |
| Ccarl::io::helper::ErrorHandler | |
| Ccarl::contractor::Evaluation< Polynomial > | Represents a contraction operation of the form |
| ►Cstd::exception | STL class |
| ►Cstd::runtime_error | STL class |
| Ccarl::io::InvalidInputStringException | |
| CExecuteBenchmarks< C, O, P > | |
| Ccarl::EZGCD< Coeff, Ordering, Policies > | Extended Zassenhaus algorithm for multivariate GCD calculation |
| Ccarl::FactorizationFactory< T > | This class provides a cached factorization for numbers |
| Ccarl::FactorizationFactory< uint > | This class provides a cached prime factorization for std::size_t |
| Ccarl::FactorizedPolynomial< P > | |
| ►Cstd::false_type | |
| Ccarl::is_finite_type< GFNumber< C > > | Type trait is_finite_type_domain |
| Ccarl::is_instantiation_of | |
| Ccarl::is_integer_type< T > | States if a type is an integer type |
| Ccarl::is_interval_type< Number > | States whether a given type is an Interval |
| Ccarl::is_polynomial_type< T > | |
| Ccarl::is_ran_type< T > | |
| Ccarl::is_rational_type< T > | States if a type is a rational type |
| Ccarl::needs_cache_type< T > | |
| Ccarl::needs_context_type< T > | |
| Ccarl::ran::interval::FieldExtensions< Rational, Poly > | This class can be used to construct iterated field extensions from a sequence of real algebraic numbers |
| Ccarl::logging::Filter | This class checks if some log message shall be forwarded to some sink |
| Ccarl::FLOAT_T< FloatType > | Templated wrapper class which allows universal usage of different IEEE 754 implementations |
| Ccarl::FloatConv< T1, T2 > | Struct which holds the conversion operator for any two instanciations of FLOAT_T with different underlying floating point implementations |
| Ccarl::logging::Formatter | Formats a log messages |
| Ccarl::Formula< Pol > | Represent an SMT formula, which can be an atom for some background theory or a boolean combination of (sub)formulas |
| Ccarl::Formula< Poly > | |
| Ccarl::BitVector::forward_iterator | |
| Ccarl::FromGiNaC< C > | |
| Ccarl::GaloisField< IntegerType > | A finite field |
| Ccarl::GaloisField< Integer > | |
| CGbBenchmark< C, O, P > | |
| Ccarl::GFNumber< IntegerType > | Galois Field numbers, i.e |
| Ccarl::GiNaCConversion | |
| ►Cboost::spirit::qi::grammar | |
| Ccarl::io::OPBParser | |
| Ccarl::io::Skipper | |
| Ccarl::io::parser::ExpressionParser< Pol > | |
| Ccarl::io::parser::FormulaParser< Pol > | |
| Ccarl::io::parser::PolynomialParser< Pol > | |
| Ccarl::io::parser::RationalFunctionParser< Pol > | |
| Ccarl::parser::RationalParser< T, Iterator > | Parses rationals, being two decimals separated by a slash |
| Ccarl::formula::symmetry::GraphBuilder< Poly > | |
| Ccarl::greater< T, mayBeNull > | |
| Ccarl::greater< std::shared_ptr< T >, mayBeNull > | |
| Ccarl::greater< T *, mayBeNull > | |
| Ccarl::GroebnerBase< Number > | |
| ►Ccarl::has_subtype< T > | This template is designed to provide types that are related to other types |
| Ccarl::UnderlyingNumberType< T > | Gives the underlying number type of a complex object |
| ►Ccarl::has_subtype< cln::cl_I > | |
| Ccarl::IntegralType< cln::cl_I > | States that IntegralType of cln::cl_I is cln::cl_I |
| Ccarl::IntegralType< cln::cl_RA > | States that IntegralType of cln::cl_RA is cln::cl_I |
| ►Ccarl::has_subtype< mpz_class > | |
| Ccarl::IntegralType< mpq_class > | States that IntegralType of mpq_class is mpz_class |
| Ccarl::IntegralType< mpz_class > | States that IntegralType of mpz_class is mpz_class |
| ►Ccarl::has_subtype< sint > | |
| Ccarl::IntegralType< double > | States that IntegralType of double is sint |
| Ccarl::IntegralType< float > | States that IntegralType of float is sint |
| Ccarl::IntegralType< long double > | States that IntegralType of long double is sint |
| ►Ccarl::has_subtype< UnderlyingNumberType< C >::type > | |
| Ccarl::UnderlyingNumberType< MultivariatePolynomial< C, O, P > > | States that UnderlyingNumberType of MultivariatePolynomial<C,O,P> is UnderlyingNumberType<C>::type |
| Ccarl::UnderlyingNumberType< UnivariatePolynomial< C > > | States that UnderlyingNumberType of UnivariatePolynomial<T> is UnderlyingNumberType<C>::type |
| Ccarl::hash< T, mayBeNull > | Alternative specialization of std::hash for pointer types |
| Cstd::hash< carl::BasicConstraint< Pol > > | Implements std::hash for constraints |
| Cstd::hash< carl::Bitset > | |
| Cstd::hash< carl::BoundType > | Specialization of std::hash for BoundType |
| Cstd::hash< carl::BVBinaryContent > | |
| Cstd::hash< carl::BVCompareRelation > | |
| Cstd::hash< carl::BVConstraint > | Implements std::hash for bit-vector constraints |
| Cstd::hash< carl::BVExtractContent > | |
| Cstd::hash< carl::BVTerm > | Implements std::hash for bit vector terms |
| Cstd::hash< carl::BVTermContent > | Implements std::hash for bit vector term contents |
| Cstd::hash< carl::BVUnaryContent > | |
| Cstd::hash< carl::BVValue > | Implements std::hash for bit vector values |
| Cstd::hash< carl::BVVariable > | Implement std::hash for bitvector variables |
| Cstd::hash< carl::Constraint< Pol > > | Implements std::hash for constraints |
| Cstd::hash< carl::ContextPolynomial< Coeff, Ordering, Policies > > | |
| Cstd::hash< carl::FactorizedPolynomial< P > > | |
| Cstd::hash< carl::FLOAT_T< Number > > | |
| Cstd::hash< carl::Formula< Pol > > | Implements std::hash for formulas |
| Cstd::hash< carl::FormulaContent< Pol > > | Implements std::hash for formula contents |
| Cstd::hash< carl::Interval< Number > > | Specialization of std::hash for an interval |
| Cstd::hash< carl::IntRepRealAlgebraicNumber< Number > > | |
| Cstd::hash< carl::ModelVariable > | |
| Cstd::hash< carl::Monomial > | The template specialization of std::hash for carl::Monomial |
| Cstd::hash< carl::Monomial::Arg > | The template specialization of std::hash for a shared pointer of a carl::Monomial |
| Cstd::hash< carl::MultivariatePolynomial< C, O, P > > | Specialization of std::hash for MultivariatePolynomial |
| Cstd::hash< carl::MultivariateRoot< Pol > > | |
| Cstd::hash< carl::PolynomialFactorizationPair< P > > | |
| Cstd::hash< carl::RationalFunction< Pol, AS > > | |
| Cstd::hash< carl::RealAlgebraicNumberThom< Number > > | |
| Cstd::hash< carl::Relation > | |
| Cstd::hash< carl::Sort > | Implements std::hash for sort |
| Cstd::hash< carl::SortValue > | Implements std::hash for sort value |
| Cstd::hash< carl::SqrtEx< Poly > > | Implements std::hash for square root expressions |
| Cstd::hash< carl::Term< Coefficient > > | Specialization of std::hash for a Term |
| Cstd::hash< carl::TypeInfoPair< T, I > > | |
| Cstd::hash< carl::UEquality > | Implements std::hash for uninterpreted equalities |
| Cstd::hash< carl::UFContent > | Implements std::hash for uninterpreted function's contents |
| Cstd::hash< carl::UFInstance > | Implements std::hash for uninterpreted function instances |
| Cstd::hash< carl::UFInstanceContent > | Implements std::hash for uninterpreted function instance's contents |
| Cstd::hash< carl::UFModel > | Implements std::hash for uninterpreted function model |
| Cstd::hash< carl::UninterpretedFunction > | Implements std::hash for uninterpreted functions |
| Cstd::hash< carl::UnivariatePolynomial< Coefficient > > | Specialization of std::hash for univariate polynomials |
| Cstd::hash< carl::UTerm > | Implements std::hash for uninterpreted terms |
| Cstd::hash< carl::UVariable > | Implements std::hash for uninterpreted variables |
| Cstd::hash< carl::Variable > | Specialization of std::hash for Variable |
| Cstd::hash< carl::VariableAssignment< Pol > > | |
| Cstd::hash< carl::VariableComparison< Pol > > | |
| Cstd::hash< carl::vs::Term< Poly > > | |
| Cstd::hash< cln::cl_I > | |
| Cstd::hash< cln::cl_RA > | |
| Cstd::hash< mpq_class > | |
| Cstd::hash< mpz_class > | |
| Ccarl::hash< std::shared_ptr< T >, mayBeNull > | |
| Cstd::hash< std::vector< carl::BasicConstraint< Pol > > > | Implements std::hash for vectors of constraints |
| Cstd::hash< std::vector< carl::Constraint< Pol > > > | Implements std::hash for vectors of constraints |
| Cstd::hash< std::vector< T > > | |
| Ccarl::hash< T *, mayBeNull > | |
| Ccarl::hash_inserter< T > | Utility functor to hash a sequence of object using an output iterator |
| Ccarl::hashEqual | |
| Ccarl::hashLess | |
| Ccarl::Heap< C > | A heap priority queue |
| Ccarl::Heap< ReductorConfiguration< InputPolynomial > > | |
| Ccarl::Ideal< Polynomial, Datastructure, CacheSize > | |
| Ccarl::Ideal< PolynomialInIdeal > | |
| Ccarl::IdealDatastructureVector< Polynomial > | |
| Ccarl::IDPool | |
| Ccarl::InfinityValue | This class represents infinity or minus infinity, depending on its flag positive |
| Ccarl::Cache< T >::Info | |
| ►Cboost::spirit::qi::int_parser | |
| Ccarl::parser::IntegerParser< T > | Parses (signed) integers |
| Ccarl::IntegerPairCompare< IntegerType > | |
| ►Cstd::integral_constant | |
| Ccarl::characteristic< type > | Type trait for the characteristic of the given field (template argument) |
| Ccarl::dependent_bool_type< B,... > | |
| Ccarl::is_field_type< T > | States if a type is a field |
| Ccarl::is_finite_type< T > | States if a type represents only a finite domain |
| Ccarl::is_float_type< T > | States if a type is a floating point type |
| Ccarl::is_rational_type< FLOAT_T< C > > | |
| Ccarl::is_subset_of_integers_type< Type > | States if a type represents a subset of all integers |
| Ccarl::IntegralType< RationalType > | Gives the corresponding integral type |
| Ccarl::IntegralType< carl::FLOAT_T< F > > | |
| Ccarl::IntegralType< GFNumber< C > > | |
| Ccarl::IntRepRealAlgebraicNumber< Number > | |
| Ccarl::IntRepRealAlgebraicNumber< Rational > | |
| Ccarl::is_from_variant< T, Variant > | |
| Ccarl::detail::is_from_variant_wrapper< Check, T, Variant > | |
| Ccarl::detail::is_from_variant_wrapper< Check, T, Variant< Args... > > | |
| Ccarl::is_number_type< T > | States if a type is a number type |
| Ccarl::is_ran_type< RealAlgebraicNumberThom< Number > > | |
| Ccarl::is_subset_of_rationals_type< T > | States if a type represents a subset of all rationals and the representation is similar to a rational |
| Ccarl::parser::isDivisible< is_int > | |
| Ccarl::parser::isDivisible< false > | |
| Ccarl::parser::isDivisible< true > | |
| Ccarl::Bitset::iterator | Iterate for iterate over all bits of a Bitset that are set to true |
| ►Cstd::iterator | |
| Ccarl::tree_detail::ChildrenIterator< T, reverse > | Iterator class for iterations over all children of a given element |
| Ccarl::tree_detail::DepthIterator< T, reverse > | Iterator class for iterations over all elements of a certain depth |
| Ccarl::tree_detail::LeafIterator< T, reverse > | Iterator class for iterations over all leaf elements |
| Ccarl::tree_detail::PathIterator< T > | Iterator class for iterations from a given element to the root |
| Ccarl::tree_detail::PostorderIterator< T, reverse > | Iterator class for post-order iterations over all elements |
| Ccarl::tree_detail::PreorderIterator< T, reverse > | Iterator class for pre-order iterations over all elements |
| Ccarl::ran::interval::LazardEvaluation< Rational, Poly > | |
| Ccarl::less< T, mayBeNull > | Alternative specialization of std::less for pointer types |
| Cstd::less< carl::Monomial::Arg > | |
| Cstd::less< carl::UnivariatePolynomial< Coefficient > > | Specialization of std::less for univariate polynomials |
| Ccarl::less< std::shared_ptr< T >, mayBeNull > | |
| Ccarl::less< T *, mayBeNull > | |
| ►Cstd::list< T > | STL class |
| Ccarl::SignCondition | |
| Ccarl::pool::LocalPool< Content > | |
| Ccarl::pool::LocalPoolElement< Content > | |
| Ccarl::LowerBound< Number > | |
| ►Cstd::map< K, T > | STL class |
| Ccarl::BaseRepresentation< Number > | |
| Ccarl::Factorization< P > | |
| Ccarl::io::MapleStream | |
| Ccarl::settings::metric_quantity | Helper type to parse quantities with SI-style suffixes |
| Ccarl::Model< Rational, Poly > | Represent a collection of assignments/mappings from variables to values |
| ►Ccarl::ModelSubstitution< Rational, Poly > | Represent a expression for a ModelValue with variables as placeholders, where the final expression's value depends on the bindings/values of these variables |
| Ccarl::ModelConditionalSubstitution< Rational, Poly > | |
| Ccarl::ModelFormulaSubstitution< Rational, Poly > | |
| Ccarl::ModelMVRootSubstitution< Rational, Poly > | |
| Ccarl::ModelPolynomialSubstitution< Rational, Poly > | |
| Ccarl::ModelValue< Rational, Poly > | Represent a sum type/variant over the different kinds of values that can be assigned to the different kinds of variables that exist in CARL and to use them in a more uniform way, e.g |
| Ccarl::ModelVariable | Represent a sum type/variant over the different kinds of variables that exist in CARL to use them in a more uniform way, e.g |
| Ccarl::MonomialComparator< f, degreeOrdered > | A class for term orderings |
| Ccarl::mpl_concatenate< T > | |
| Ccarl::mpl_concatenate_impl< S, Front, Tail > | |
| Ccarl::mpl_concatenate_impl< 1, Front, Tail... > | |
| Ccarl::mpl_unique< T > | |
| Ccarl::mpl_variant_of< Vector > | |
| Ccarl::mpl_variant_of_impl< bool, Vector, Unpacked > | |
| Ccarl::mpl_variant_of_impl< true, Vector, Unpacked... > | |
| Ccarl::statistics::MultiCounter< T > | |
| Ccarl::MultiplicationTable< Number > | |
| Ccarl::MultivariateHensel< Coeff, Ordering, Policies > | |
| Ccarl::MultivariateRoot< Poly > | |
| ►Cstd::chrono::nanoseconds | |
| Ccarl::settings::duration | Helper type to parse duration as std::chrono values with boost::program_options |
| Ccarl::NoAllocator | |
| Ccarl::CompactTree< Entry, FastIndex >::Node | |
| Ccarl::tree_detail::Node< T > | |
| Ccarl::RealRootsResult< RAN >::non_univariate_t | |
| ►Ccarl::NoReasons | |
| ►Ccarl::StdMultivariatePolynomialPolicies< ReasonsAdaptor, Allocator > | The default policy for polynomials |
| Ccarl::MultivariatePolynomial< Number > | |
| Ccarl::MultivariatePolynomial< Rational > | |
| Ccarl::MultivariatePolynomial< Coeff, Ordering, Policies > | The general-purpose multivariate polynomial class |
| Ccarl::not_equal_to< T, mayBeNull > | |
| Ccarl::not_equal_to< std::shared_ptr< T >, mayBeNull > | |
| Ccarl::not_equal_to< T *, mayBeNull > | |
| Ccarl::RealRootsResult< RAN >::nullified_t | |
| Cstd::numeric_limits< carl::FLOAT_T< Number > > | |
| Ccarl::io::OPBFile | |
| Ccarl::io::OPBImporter< Pol > | |
| ►COperator | |
| Ccarl::Contraction< Operator, Polynomial > | |
| Ccarl::settings::OptionPrinter | Helper class to nicely print the options that are available |
| Ccarl::io::parser::Parser< Pol > | |
| Ccarl::formula::symmetry::Permutation | |
| ►Ccarl::policies< Number, Interval > | Struct which holds the rounding and checking policies required for boost interval |
| Ccarl::Interval< double > | |
| Ccarl::policies< double, Interval > | Template specialization for rounding and checking policies for native double |
| ►Ccarl::policies< Number, Interval< Number > > | |
| Ccarl::Interval< Number > | The class which contains the interval arithmetic including trigonometric functions |
| Ccarl::PolynomialFactorizationPair< P > | |
| Ccarl::helper::PolynomialSubstitutor< Pol > | |
| Ccarl::Pool< Element > | |
| ►Ccarl::Pool< BVConstraint > | |
| Ccarl::BVConstraintPool | |
| ►Ccarl::Pool< BVTermContent > | |
| Ccarl::BVTermPool | |
| Ccarl::pool::PoolElement< Content > | |
| Ccarl::pool::PoolElement< carl::CachedConstraintContent< Pol > > | |
| Ccarl::PreventConversion< T > | |
| Ccarl::PrimeFactory< T > | This class provides a convenient way to enumerate primes |
| Ccarl::PrimeFactory< Integer > | |
| Ccarl::PrimeFactory< uint > | |
| ►CProcedure | |
| Ccarl::GBProcedure< Polynomial, Procedure, AddingPolynomialPolicy > | A general class for Groebner Basis calculation |
| Ccarl::io::QEPCADStream | |
| Ccarl::QuantifierContent< Pol > | Stores the variables and the formula bound by a quantifier |
| Ccarl::RadicalAwareAdding< Polynomial > | |
| Ccarl::ran::interval::ran_evaluator< Number > | |
| Ccarl::RationalFunction< Pol, AutoSimplify > | |
| ►Cboost::spirit::qi::real_parser | |
| Ccarl::parser::DecimalParser< T > | Parses decimals, including floating point and scientific notation |
| ►Cboost::spirit::qi::real_policies | |
| Ccarl::parser::RationalPolicies< T > | Specialization of qi::real_policies for our rational types |
| Ccarl::RealAlgebraicNumber< Number > | |
| Ccarl::RealAlgebraicNumberThom< Number > | |
| Ccarl::RealRadicalAwareAdding< Polynomial > | |
| Ccarl::ran::interval::RealRootIsolation< Number > | Compact class to isolate real roots from a univariate polynomial using bisection |
| Ccarl::RealRootsResult< RAN > | |
| Ccarl::logging::RecordInfo | Additional information about a log message |
| Ccarl::Reductor< InputPolynomial, PolynomialInIdeal, Datastructure, Configuration > | A dedicated algorithm for calculating the remainder of a polynomial modulo a set of other polynomials |
| Ccarl::ReductorConfiguration< Polynomial > | Class with the settings for the reduction algorithm |
| Ccarl::ReductorConfiguration< InputPolynomial > | |
| Ccarl::ReductorEntry< Polynomial > | An entry in the reduction polynomial |
| Ccarl::pool::RehashPolicy | Mimics stdlibs default rehash policy for hashtables |
| Ccarl::remove_all< T, U > | |
| Ccarl::remove_all< T, T > | |
| Ccarl::io::helper::ErrorHandler::result< typename > | |
| Ccarl::rounding< Number > | |
| Ccarl::statistics::Series | |
| Ccarl::covering::SetCover | Represents a set cover problem |
| Ccarl::settings::Settings | Base class for central settings class |
| Ccarl::settings::SettingsParser | Base class for a settings parser |
| Ccarl::settings::SettingsPrinter | Helper class to nicely print the settings that were parsed |
| Ccarl::SignDetermination< Number > | |
| Ccarl::SimpleNewton< Polynomial > | |
| Ccarl::Singleton< T > | Base class that implements a singleton |
| ►Ccarl::Singleton< BVConstraintPool > | |
| Ccarl::BVConstraintPool | |
| ►Ccarl::Singleton< BVTermPool > | |
| Ccarl::BVTermPool | |
| ►Ccarl::Singleton< CheckpointVerifier > | |
| Ccarl::checkpoints::CheckpointVerifier | |
| ►Ccarl::Singleton< FormulaPool< Pol > > | |
| Ccarl::FormulaPool< Pol > | |
| ►Ccarl::Singleton< GaloisFieldManager< IntegerType > > | |
| Ccarl::GaloisFieldManager< IntegerType > | |
| ►Ccarl::Singleton< Logger > | |
| Ccarl::logging::Logger | Main logger class |
| ►Ccarl::Singleton< MonomialPool > | |
| Ccarl::MonomialPool | |
| ►Ccarl::Singleton< Pool< Content > > | |
| Ccarl::pool::Pool< Content > | |
| ►Ccarl::Singleton< SortManager > | |
| Ccarl::SortManager | Implements a manager for sorts, containing the actual contents of these sort and allocating their ids |
| ►Ccarl::Singleton< SortValueManager > | |
| Ccarl::SortValueManager | Implements a manager for sort values, containing the actual contents of these sort and allocating their ids |
| ►Ccarl::Singleton< StatisticsCollector > | |
| Ccarl::statistics::StatisticsCollector | |
| ►Ccarl::Singleton< UFInstanceManager > | |
| Ccarl::UFInstanceManager | Implements a manager for uninterpreted function instances, containing their actual contents and allocating their ids |
| ►Ccarl::Singleton< UFManager > | |
| Ccarl::UFManager | Implements a manager for uninterpreted functions, containing their actual contents and allocating their ids |
| ►Ccarl::Singleton< VariablePool > | |
| Ccarl::VariablePool | This class generates new variables and stores human-readable names for them |
| ►Ccarl::logging::Sink | Base class for a logging sink |
| Ccarl::logging::FileSink | Logging sink for file output |
| Ccarl::logging::StreamSink | Logging sink that wraps an arbitrary std::ostream |
| Ccarl::io::detail::SMTLIBOutputContainer< Args > | |
| Ccarl::io::detail::SMTLIBScriptContainer< Pol > | Shorthand to allow writing SMTLIB scripts in one line |
| Ccarl::io::SMTLIBStream | Allows to print carl data structures in SMTLIB syntax |
| Ccarl::Sort | Implements a sort (for defining types of variables and functions) |
| CsortByLeadingTerm< Polynomial > | Sorts generators of an ideal by their leading terms |
| CsortByPolSize< Polynomial > | Sorts generators of an ideal by their number of terms |
| Ccarl::SortContent | The actual content of a sort |
| Ccarl::SortValue | Implements a sort value, being a value of the uninterpreted domain specified by this sort |
| Ccarl::SPolPair | Basic spol-pair |
| Ccarl::SPolPairCompare< Compare > | |
| Ccarl::SqrtEx< Poly > | |
| ►Cboost::static_visitor | |
| Ccarl::detail::variant_extend_visitor< Target > | |
| Ccarl::detail::variant_hash | |
| Ccarl::detail::variant_is_type_visitor< T > | |
| Ccarl::io::parser::ExpressionParser< Pol >::perform_addition | |
| Ccarl::io::parser::ExpressionParser< Pol >::perform_division | |
| Ccarl::io::parser::ExpressionParser< Pol >::perform_multiplication | |
| Ccarl::io::parser::ExpressionParser< Pol >::perform_negate | |
| Ccarl::io::parser::ExpressionParser< Pol >::perform_power | |
| Ccarl::io::parser::ExpressionParser< Pol >::perform_subtraction | |
| Ccarl::io::parser::ExpressionParser< Pol >::print_expr_type | |
| Ccarl::statistics::Statistics | |
| Ccarl::statistics::StatisticsPrinter< SOF > | |
| Ccarl::StdAdding< Polynomial > | |
| Ccarl::strategy | |
| Ccarl::detail::stream_joined_impl< T, F > | |
| Ccarl::io::StringParser | |
| Ccarl::vs::detail::Substitution< Poly > | |
| Ccarl::helper::Substitutor< Pol > | |
| Ccarl::MultiplicationTable< Number >::TableContent | |
| Ccarl::TarskiQueryManager< Number > | |
| Ccarl::TaylorExpansion< Integer > | |
| Ccarl::Term< Coefficient > | Represents a single term, that is a numeric coefficient and a monomial |
| Ccarl::vs::Term< Poly > | |
| Ccarl::Term< Coeff > | |
| Ccarl::Term< typename Polynomial::CoeffType > | |
| Ccarl::TermAdditionManager< Polynomial, Ordering > | |
| Ccarl::TermAdditionManager< carl::MultivariatePolynomial, GrLexOrdering > | |
| Ccarl::ThomEncoding< Number > | |
| Ccarl::statistics::Timer | |
| Ccarl::Timer | This classes provides an easy way to obtain the current number of milliseconds that the program has been running |
| Ccarl::ToGiNaC | |
| Ccarl::tree< T > | This class represents a tree |
| ►Cstd::true_type | |
| Ccarl::is_factorized_type< T > | |
| Ccarl::is_factorized_type< FactorizedPolynomial< P > > | |
| Ccarl::is_field_type< GFNumber< C > > | States that a Gallois field is a field |
| Ccarl::is_float_type< carl::FLOAT_T< C > > | |
| Ccarl::is_instantiation_of< Template, Template< Args... > > | |
| Ccarl::is_integer_type< cln::cl_I > | States that cln::cl_I has the trait is_integer_type |
| Ccarl::is_integer_type< mpz_class > | States that mpz_class has the trait is_integer_type |
| Ccarl::is_interval_type< carl::Interval< Number > > | |
| Ccarl::is_interval_type< const carl::Interval< Number > > | |
| Ccarl::is_number_type< GFNumber< C > > | |
| Ccarl::is_number_type< Interval< T > > | |
| Ccarl::is_polynomial_type< ContextPolynomial< Coeff, Ordering, Policies > > | |
| Ccarl::is_polynomial_type< carl::MultivariatePolynomial< T, O, P > > | |
| Ccarl::is_polynomial_type< carl::UnivariatePolynomial< T > > | |
| Ccarl::is_ran_type< IntRepRealAlgebraicNumber< Number > > | |
| Ccarl::is_rational_type< cln::cl_RA > | States that cln::cl_RA has the trait is_rational_type |
| Ccarl::is_rational_type< mpq_class > | States that mpq_class has the trait is_rational_type |
| Ccarl::is_subset_of_integers_type< int > | States that int has the trait is_subset_of_integers_type |
| Ccarl::is_subset_of_integers_type< long int > | States that long int has the trait is_subset_of_integers_type |
| Ccarl::is_subset_of_integers_type< long long int > | States that long long int has the trait is_subset_of_integers_type |
| Ccarl::is_subset_of_integers_type< short int > | States that short int has the trait is_subset_of_integers_type |
| Ccarl::is_subset_of_integers_type< signed char > | States that signed char has the trait is_subset_of_integers_type |
| Ccarl::is_subset_of_integers_type< unsigned char > | States that unsigned char has the trait is_subset_of_integers_type |
| Ccarl::is_subset_of_integers_type< unsigned int > | States that unsigned int has the trait is_subset_of_integers_type |
| Ccarl::is_subset_of_integers_type< unsigned long int > | States that unsigned long int has the trait is_subset_of_integers_type |
| Ccarl::is_subset_of_integers_type< unsigned long long int > | States that unsigned long long int has the trait is_subset_of_integers_type |
| Ccarl::is_subset_of_integers_type< unsigned short int > | States that unsigned short int has the trait is_subset_of_integers_type |
| Ccarl::needs_cache_type< FactorizedPolynomial< P > > | |
| Ccarl::needs_context_type< ContextPolynomial< Coeff, Ordering, Policies > > | |
| Ccarl::detail::tuple_accumulate_impl< Tuple, T, F > | Helper functor for carl::tuple_accumulate that actually does the work |
| Ccarl::tuple_convert< Converter, Information, FOut, TOut > | |
| Ccarl::tuple_convert< Converter, Information, Out > | |
| Ccarl::covering::TypedSetCover< Set > | Represents a set cover problem where a set is represented by some type |
| Ccarl::UEquality | Implements an uninterpreted equality, that is an equality of either two uninterpreted function instances, two uninterpreted variables, or an uninterpreted function instance and an uninterpreted variable |
| Ccarl::UFContent | The actual content of an uninterpreted function instance |
| Ccarl::UFInstance | Implements an uninterpreted function instance |
| Ccarl::UFInstanceContent | The actual content of an uninterpreted function instance |
| Ccarl::UFModel | Implements a sort value, being a value of the uninterpreted domain specified by this sort |
| Ccarl::UninterpretedFunction | Implements an uninterpreted function |
| Ccarl::helper::UninterpretedSubstitutor< Pol > | |
| Ccarl::UnivariatePolynomial< Coefficient > | This class represents a univariate polynomial with coefficients of an arbitrary type |
| Ccarl::UnivariatePolynomial< carl::MultivariatePolynomial< Coeff, GrLexOrdering, StdMultivariatePolynomialPolicies<> > > | |
| Ccarl::UnivariatePolynomial< carl::MultivariatePolynomial< Number > > | |
| Ccarl::UnivariatePolynomial< Number > | |
| ►Cboost::intrusive::unordered_set_base_hook | |
| Ccarl::FormulaContent< Pol > | |
| Ccarl::Monomial | The general-purpose monomials |
| Ccarl::pool::LocalPoolElementWrapper< Content > | |
| Ccarl::pool::PoolElementWrapper< Content > | |
| ►Ccarl::UpdateFnc | |
| Ccarl::UpdateFnct< carl::Buchberger< Polynomial, AddingPolicy > > | |
| Ccarl::UpdateFnct< BuchbergerProc > | |
| Ccarl::UpperBound< Number > | |
| ►Cboost::spirit::qi::ureal_policies | |
| Ccarl::io::parser::RationalPolicies< Coeff > | |
| Ccarl::UTerm | Implements an uninterpreted term, that is either an uninterpreted variable or an uninterpreted function instance |
| Ccarl::UVariable | Implements an uninterpreted variable |
| Ccarl::Variable | A Variable represents an algebraic variable that can be used throughout carl |
| Ccarl::variable_type_filter | |
| Ccarl::VariableAssignment< Poly > | |
| Ccarl::VariableComparison< Poly > | Represent a sum type/variant of an (in)equality between a variable on the left-hand side and multivariateRoot or algebraic real on the right-hand side |
| Ccarl::VarInfo< CoeffType > | |
| Ccarl::VarsInfo< CoeffType > | |
| Ccarl::VarsInfo< Pol > | |
| Ccarl::VarSolutionFormula< Polynomial > | |
| Ccarl::Void< typename > | |
| Ccarl::vs::zero< Poly > | A square root expression with side conditions |
| ►Ccarl::Ts | |
| Ccarl::overloaded< Ts > | |
1.9.1