Here is a list of all struct and union fields with links to the structures/unions they belong to:

- i -

• id() : carl::BVConstraint , carl::BVTermContent , carl::Formula< Pol > , carl::FormulaContent< Pol > , carl::io::DIMACSExporter< Pol > , carl::Monomial , carl::pool::LocalPoolElement< Content > , carl::pool::LocalPoolElementWrapper< Content > , carl::pool::PoolElement< Content > , carl::pool::PoolElementWrapper< Content > , carl::Sort , carl::SortValue , carl::tree_detail::BaseIterator< T, Iterator, reverse > , carl::tree_detail::Node< T > , carl::UFInstance , carl::UninterpretedFunction , carl::Variable
• Ideal() : carl::Ideal< Polynomial, Datastructure, CacheSize >
• ideal_adic_coeff() : carl::TaylorExpansion< Integer >
• IdealDatastructureVector() : carl::IdealDatastructureVector< Polynomial >
• IDType : carl::TermAdditionManager< Polynomial, Ordering >
• in : carl::io::DIMACSImporter< Pol >
• inc() : carl::statistics::MultiCounter< T >
• increase_num_occurences() : carl::VarInfo< CoeffType >
• increaseCapacity() : carl::CompactTree< Entry, FastIndex >
• index() : carl::BVTerm , carl::SortManager
• IndexPairs : carl::MultiplicationTable< Number >
• indexPairs() : carl::MultiplicationTable< Number >
• indices : carl::SortContent
• infinity() : std::numeric_limits< carl::FLOAT_T< Number > >
• Info() : carl::Cache< T >::Info
• init() : carl::Formula< Pol > , carl::MultiplicationTable< Number >
• initialize() : carl::io::QEPCADStream , carl::io::SMTLIBStream
• initialize_bisection_by_approximation : carl::ran::interval::RealRootIsolation< Number >
• inputEmpty() : carl::GBProcedure< Polynomial, Procedure, AddingPolynomialPolicy >
• insert() : carl::Factorization< P > , carl::Model< Rational, Poly > , carl::Pool< Element > , carl::Reductor< InputPolynomial, PolynomialInIdeal, Datastructure, Configuration > , carl::tree< T >
• instance : carl::BuchbergerStats
• int_down() : carl::rounding< Number >
• int_up() : carl::rounding< Number >
• integer() : carl::carlVariables
• Integer : carl::EZGCD< Coeff, Ordering, Policies > , carl::MultivariateHensel< Coeff, Ordering, Policies >
• integer() : carl::variable_type_filter
• integer_below() : carl::RealAlgebraicNumberThom< Number > , carl::ThomEncoding< Number >
• integer_valued() : carl::Constraint< Pol > , carl::Monomial , carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::Term< Coefficient >
• integral_part() : carl::Interval< Number >
• integralPart_assign() : carl::Interval< Number >
• intermediatePoint() : carl::ThomEncoding< Number >
• Interval() : carl::Interval< Number >
• interval : carl::IntRepRealAlgebraicNumber< Number >::content , carl::IntRepRealAlgebraicNumber< Number >
• interval_int() : carl::IntRepRealAlgebraicNumber< Number >
• IntNumberType : carl::FactorizedPolynomial< P > , carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::UnivariatePolynomial< Coefficient >
• IntRepRealAlgebraicNumber() : carl::IntRepRealAlgebraicNumber< Number >
• InvalidInputStringException() : carl::io::InvalidInputStringException
• inverse() : carl::GFNumber< IntegerType > , carl::Interval< Number > , carl::RationalFunction< Pol, AutoSimplify >
• inverse_assign() : carl::Interval< Number >
• invert_relation() : carl::VariableComparison< Poly >
• is_atom() : carl::Formula< Pol >
• is_boolean_combination() : carl::Formula< Pol >
• is_bound() : carl::Formula< Pol >
• is_bounded : std::numeric_limits< carl::FLOAT_T< Number > >
• is_closed_interval() : carl::Interval< Number >
• is_consistent() : carl::BasicConstraint< Pol > , carl::Constraint< Pol > , carl::Interval< Number > , carl::IntRepRealAlgebraicNumber< Number > , carl::Monomial , carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::Term< Coefficient > , carl::tree< T > , carl::UnivariatePolynomial< Coefficient >
• is_constant() : carl::BVConstraint , carl::BVTerm , carl::FactorizedPolynomial< P > , carl::Ideal< Polynomial, Datastructure, CacheSize > , carl::Monomial , carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::RationalFunction< Pol, AutoSimplify > , carl::SqrtEx< Poly > , carl::Term< Coefficient > , carl::UnivariatePolynomial< Coefficient >
• is_constraint_conjunction() : carl::Formula< Pol >
• is_empty() : carl::checking< Number > , carl::Interval< Number >
• is_equality() : carl::VariableComparison< Poly >
• is_exact : std::numeric_limits< carl::FLOAT_T< Number > >
• is_false() : carl::Formula< Pol >
• is_half_bounded() : carl::Interval< Number >
• is_iec559 : std::numeric_limits< carl::FLOAT_T< Number > >
• is_infinite() : carl::Interval< Number >
• is_integer() : carl::SqrtEx< Poly > , std::numeric_limits< carl::FLOAT_T< Number > >
• is_integer_constraint_conjunction() : carl::Formula< Pol >
• is_integral() : carl::RealAlgebraicNumberThom< Number > , carl::ThomEncoding< Number >
• is_leaf() : carl::tree< T >
• is_leftmost() : carl::tree< T >
• is_linear() : carl::FactorizedPolynomial< P > , carl::Ideal< Polynomial, Datastructure, CacheSize > , carl::Monomial , carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::Term< Coefficient >
• is_linear_in_main_var() : carl::UnivariatePolynomial< Coefficient >
• is_literal() : carl::Formula< Pol >
• is_minus_infty() : carl::vs::Term< Poly >
• is_modulo : std::numeric_limits< carl::FLOAT_T< Number > >
• is_nan() : carl::checking< Number >
• is_nary() : carl::Formula< Pol > , carl::FormulaContent< Pol >
• is_negative() : carl::Interval< Number >
• is_non_univariate() : carl::RealRootsResult< RAN >
• is_normal() : carl::UnivariatePolynomial< Coefficient > , carl::vs::Term< Poly >
• is_nullified() : carl::RealRootsResult< RAN >
• is_number() : carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::ThomEncoding< Number > , carl::UnivariatePolynomial< Coefficient >
• is_numeric() : carl::IntRepRealAlgebraicNumber< Number >
• is_one() : carl::FactorizedPolynomial< P > , carl::GFNumber< IntegerType > , carl::Interval< Number > , carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::RationalFunction< Pol, AutoSimplify > , carl::Term< Coefficient > , carl::UnivariatePolynomial< Coefficient >
• is_only_propositional() : carl::Formula< Pol >
• is_open_interval() : carl::Interval< Number >
• is_plus_eps() : carl::vs::Term< Poly >
• is_plus_infty() : carl::vs::Term< Poly >
• is_point_interval() : carl::Interval< Number >
• is_polynomial() : carl::SqrtEx< Poly >
• is_positive() : carl::Interval< Number >
• is_real_constraint_conjunction() : carl::Formula< Pol >
• is_reducible_identity() : carl::MultivariatePolynomial< Coeff, Ordering, Policies >
• is_rightmost() : carl::tree< T >
• is_semi_negative() : carl::Interval< Number >
• is_semi_positive() : carl::Interval< Number >
• is_signed : std::numeric_limits< carl::FLOAT_T< Number > >
• is_single_variable() : carl::Term< Coefficient >
• is_specialized : std::numeric_limits< carl::FLOAT_T< Number > >
• is_square() : carl::Monomial , carl::Term< Coefficient >
• is_subset_of() : carl::Bitset
• is_trivial_false() : carl::BasicConstraint< Pol >
• is_trivial_true() : carl::BasicConstraint< Pol >
• is_true() : carl::Formula< Pol >
• is_tsos() : carl::MultivariatePolynomial< Coeff, Ordering, Policies >
• is_unbounded() : carl::Interval< Number >
• is_unit() : carl::GFNumber< IntegerType >
• is_univariate() : carl::FactorizedPolynomial< P > , carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::MultivariateRoot< Poly > , carl::RealRootsResult< RAN > , carl::UnivariatePolynomial< Coefficient >
• is_valid() : carl::tree< T >
• is_variable() : carl::ModelVariable , carl::MultivariatePolynomial< Coeff, Ordering, Policies >
• is_zero() : carl::BaseRepresentation< Number > , carl::BVValue , carl::FactorizedPolynomial< P > , carl::GFNumber< IntegerType > , carl::Interval< Number > , carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::RationalFunction< Pol, AutoSimplify > , carl::RealAlgebraicNumberThom< Number > , carl::Term< Coefficient > , carl::ThomEncoding< Number > , carl::UnivariatePolynomial< Coefficient >
• isAlwaysConsistent() : carl::BVConstraint
• isAlwaysInconsistent() : carl::BVConstraint
• isAtMostLinear() : carl::Monomial
• isBaseFormula() : carl::FormulaPool< Pol >
• isBool() : carl::ModelValue< Rational, Poly >
• isBVValue() : carl::ModelValue< Rational, Poly >
• isBVVariable() : carl::ModelVariable
• isDividable() : carl::Ideal< Polynomial, Datastructure, CacheSize >
• isEnd() : carl::BitVector::forward_iterator
• isFunction() : carl::ModelVariable
• isInterpreted() : carl::SortManager
• isInvalid() : carl::BVTerm , carl::BVTermContent
• isIrreducible() : carl::PolynomialFactorizationPair< P >
• isLeft() : carl::CompactTree< Entry, FastIndex >::Node
• isMinusInfinity() : carl::ModelValue< Rational, Poly >
• isolate_by_bisection() : carl::ran::interval::RealRootIsolation< Number >
• isolate_roots_trivially() : carl::ran::interval::RealRootIsolation< Number >
• isOrdered() : carl::MultivariatePolynomial< Coeff, Ordering, Policies >
• isPlusInfinity() : carl::ModelValue< Rational, Poly >
• isPrefixOf() : carl::SignCondition
• isPseudoBoolean() : carl::Constraint< Pol >
• isRAN() : carl::ModelValue< Rational, Poly >
• isRational() : carl::ModelValue< Rational, Poly > , carl::SqrtEx< Poly >
• isRight() : carl::CompactTree< Entry, FastIndex >::Node
• isRoot() : carl::CompactTree< Entry, FastIndex >::Node , carl::tree_detail::BaseIterator< T, Iterator, reverse >
• isSimplified() : carl::RationalFunction< Pol, AutoSimplify >
• isSortValue() : carl::ModelValue< Rational, Poly >
• isSqrtEx() : carl::ModelValue< Rational, Poly >
• isSubstitution() : carl::ModelValue< Rational, Poly >
• isSuffixOf() : carl::SignCondition
• isSymbolFree() : carl::SortManager
• isTrivialBase() : carl::GroebnerBase< Number >
• isUFInstance() : carl::UTerm
• isUFModel() : carl::ModelValue< Rational, Poly >
• isUnivariateManager() : carl::TarskiQueryManager< Number >
• isUVariable() : carl::ModelVariable , carl::UTerm
• isValid() : carl::CompactTree< Entry, FastIndex > , carl::Heap< C > , carl::tree_detail::BaseIterator< T, Iterator, reverse >
• iterator() : carl::Bitset::iterator , carl::carlVariables , carl::tree< T >
• iterator_category : carl::hash_inserter< T >