- n -

• n() : carl::settings::binary_quantity , carl::settings::metric_quantity
• name() : carl::statistics::Statistics , carl::UFContent , carl::UninterpretedFunction , carl::Variable
• name_of_config_file() : carl::settings::SettingsParser
• nan() : carl::checking< Number >
• needRehash() : carl::pool::RehashPolicy
• needsUpdate() : carl::SignDetermination< Number >
• neg_inf() : carl::checking< Number >
• negate() : carl::Term< Coefficient >
• negate_variable() : carl::UnivariatePolynomial< Coefficient >
• negated() : carl::Formula< Pol > , carl::UEquality , carl::VariableAssignment< Poly > , carl::VariableComparison< Poly >
• negation() : carl::BasicConstraint< Pol > , carl::Constraint< Pol > , carl::UEquality , carl::VariableAssignment< Poly > , carl::VariableComparison< Poly >
• newMonomial() : carl::io::parser::PolynomialParser< Pol >
• newNode() : carl::tree< T >
• newSortValue() : carl::SortValueManager
• newTerm() : carl::io::parser::PolynomialParser< Pol >
• newUF() : carl::UFManager
• newUFInstance() : carl::UFInstanceManager
• newUninterpretedFunction() : carl::UFManager
• newVariable() : carl::io::parser::ExpressionParser< Pol > , carl::io::parser::FormulaParser< Pol > , carl::io::parser::PolynomialParser< Pol >
• next() : carl::BitVector::forward_iterator , carl::checkpoints::CheckpointVector , carl::CompactTree< Entry, FastIndex >::Node , carl::formula::symmetry::ColorGenerator< Number > , carl::Heap< C >::c_iterator , carl::io::DIMACSImporter< Pol > , carl::tree_detail::ChildrenIterator< T, reverse > , carl::tree_detail::DepthIterator< T, reverse > , carl::tree_detail::LeafIterator< T, reverse > , carl::tree_detail::PathIterator< T > , carl::tree_detail::PostorderIterator< T, reverse > , carl::tree_detail::PreorderIterator< T, reverse >
• next_prime() : carl::PrimeFactory< T >
• nextID() : carl::VariablePool
• no_roots_response() : carl::RealRootsResult< RAN >
• Node() : carl::CompactTree< Entry, FastIndex >::Node
• node() : carl::tree_detail::BaseIterator< T, Iterator, reverse >
• Node() : carl::tree_detail::Node< T >
• nodes() : carl::tree_detail::BaseIterator< T, Iterator, reverse >
• nominator() : carl::RationalFunction< Pol, AutoSimplify >
• nominatorAsNumber() : carl::RationalFunction< Pol, AutoSimplify >
• nominatorAsPolynomial() : carl::RationalFunction< Pol, AutoSimplify >
• non_univariate_response() : carl::RealRootsResult< RAN >
• none() : carl::Bitset
• NonZeroReduction() : carl::BuchbergerStats
• normal() : carl::vs::Term< Poly >
• normalize() : carl::contractor::Evaluation< Polynomial > , carl::GFNumber< IntegerType > , carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::SqrtEx< Poly >
• normalizeCoefficients() : carl::UnivariatePolynomial< Coefficient >
• normalized() : carl::ContextPolynomial< Coeff, Ordering, Policies > , carl::UnivariatePolynomial< Coefficient >
• nr_terms() : carl::FactorizedPolynomial< P > , carl::MultivariatePolynomial< Coeff, Ordering, Policies >
• nrGenerators() : carl::Ideal< Polynomial, Datastructure, CacheSize >
• nrOrigGenerators() : carl::GBProcedure< Polynomial, Procedure, AddingPolynomialPolicy >
• nullified_response() : carl::RealRootsResult< RAN >
• num_blocks() : carl::Bitset
• num_occurences() : carl::VarInfo< CoeffType >
• num_variables() : carl::Monomial , carl::Term< Coefficient >
• number() : carl::ConvertFrom< C > , carl::ConvertTo< C >
• numBucketsFor() : carl::pool::RehashPolicy
• numerator() : carl::contractor::Evaluation< Polynomial >
• numeric_content() : carl::MultivariatePolynomial< Coeff, Ordering, Policies > , carl::UnivariatePolynomial< Coefficient >
• numeric_unit() : carl::UnivariatePolynomial< Coefficient >