- i -

• I_Constraint() : Parma_Polyhedra_Library::I_Constraint< T, Val_Or_Ref_Criteria, extended >
• I_Constraint_Rel() : Parma_Polyhedra_Library::I_Constraint_Rel
• id() : Parma_Polyhedra_Library::Variable
• Impl() : Parma_Polyhedra_Library::DB_Row_Impl_Handler< T >::Impl , Parma_Polyhedra_Library::Dense_Row::Impl
• implies() : Parma_Polyhedra_Library::Poly_Con_Relation , Parma_Polyhedra_Library::Poly_Gen_Relation
• In_Assert() : Parma_Polyhedra_Library::In_Assert
• inc() : Parma_Polyhedra_Library::float_ibm_single , Parma_Polyhedra_Library::float_ieee754_double , Parma_Polyhedra_Library::float_ieee754_half , Parma_Polyhedra_Library::float_ieee754_quad , Parma_Polyhedra_Library::float_ieee754_single , Parma_Polyhedra_Library::float_intel_double_extended
• increase_keys_from() : Parma_Polyhedra_Library::CO_Tree
• incremental_shortest_path_closure_assign() : Parma_Polyhedra_Library::BD_Shape< T >
• incremental_strong_closure_assign() : Parma_Polyhedra_Library::Octagonal_Shape< T >
• indent_and_print() : Parma_Polyhedra_Library::PIP_Tree_Node
• index() : Parma_Polyhedra_Library::CO_Tree::const_iterator , Parma_Polyhedra_Library::CO_Tree::iterator , Parma_Polyhedra_Library::CO_Tree::tree_iterator , Parma_Polyhedra_Library::Dense_Row::const_iterator , Parma_Polyhedra_Library::Dense_Row::iterator , Parma_Polyhedra_Library::OR_Matrix< T >::any_row_iterator< U >
• Indirect_Sort_Compare() : Parma_Polyhedra_Library::Implementation::Indirect_Sort_Compare< RA_Container, Compare >
• Indirect_Swapper() : Parma_Polyhedra_Library::Implementation::Indirect_Swapper< RA_Container >
• Indirect_Swapper2() : Parma_Polyhedra_Library::Implementation::Indirect_Swapper2< RA_Container1, RA_Container2 >
• Indirect_Unique_Compare() : Parma_Polyhedra_Library::Implementation::Indirect_Unique_Compare< RA_Container >
• inf_sign() : Parma_Polyhedra_Library::float_ibm_single , Parma_Polyhedra_Library::float_ieee754_double , Parma_Polyhedra_Library::float_ieee754_half , Parma_Polyhedra_Library::float_ieee754_quad , Parma_Polyhedra_Library::float_ieee754_single , Parma_Polyhedra_Library::float_intel_double_extended
• infinity() : std::numeric_limits< Checked_Number< mpq_class, Policy > > , std::numeric_limits< Checked_Number< mpz_class, Policy > > , std::numeric_limits< mpq_class > , std::numeric_limits< mpz_class >
• infinity_sign() : Parma_Polyhedra_Library::Checked_Number< T, Policy > , Parma_Polyhedra_Library::Interval< Boundary, Info >
• info() : Parma_Polyhedra_Library::Interval< Boundary, Info >
• inhomogeneous_affine_form_image() : Parma_Polyhedra_Library::BD_Shape< T >
• inhomogeneous_term() : Parma_Polyhedra_Library::Congruence , Parma_Polyhedra_Library::Constraint , Parma_Polyhedra_Library::Expression_Adapter< T > , Parma_Polyhedra_Library::Expression_Hide_Inhomo< T > , Parma_Polyhedra_Library::Linear_Expression , Parma_Polyhedra_Library::Linear_Expression_Impl< Row > , Parma_Polyhedra_Library::Linear_Expression_Interface , Parma_Polyhedra_Library::Linear_Form< C >
• init() : Parma_Polyhedra_Library::CO_Tree , Parma_Polyhedra_Library::Dense_Row
• Init() : Parma_Polyhedra_Library::Init
• initialize() : Parma_Polyhedra_Library::Congruence , Parma_Polyhedra_Library::Congruence_System , Parma_Polyhedra_Library::Constraint , Parma_Polyhedra_Library::Constraint_System , Parma_Polyhedra_Library::Generator , Parma_Polyhedra_Library::Generator_System , Parma_Polyhedra_Library::Grid_Generator , Parma_Polyhedra_Library::Grid_Generator_System , Parma_Polyhedra_Library::Linear_Expression , Parma_Polyhedra_Library::Polyhedron
• inner() : Parma_Polyhedra_Library::Expression_Adapter< T >
• input() : Parma_Polyhedra_Library::Checked_Number< T, Policy >
• insert() : Parma_Polyhedra_Library::CO_Tree , Parma_Polyhedra_Library::Congruence_System , Parma_Polyhedra_Library::Constraint_System , Parma_Polyhedra_Library::Dense_Row , Parma_Polyhedra_Library::Generator_System , Parma_Polyhedra_Library::Grid_Generator_System , Parma_Polyhedra_Library::Implementation::EList< T > , Parma_Polyhedra_Library::Implementation::Watchdog::Pending_List< Traits > , Parma_Polyhedra_Library::Linear_System< Row > , Parma_Polyhedra_Library::Partial_Function , Parma_Polyhedra_Library::Sparse_Row , Parma_Polyhedra_Library::Variables_Set
• insert_after() : Parma_Polyhedra_Library::Implementation::Doubly_Linked_Object
• insert_before() : Parma_Polyhedra_Library::Implementation::Doubly_Linked_Object
• insert_in_empty_tree() : Parma_Polyhedra_Library::CO_Tree
• insert_no_ok() : Parma_Polyhedra_Library::Linear_System< Row >
• insert_pending() : Parma_Polyhedra_Library::Constraint_System , Parma_Polyhedra_Library::Generator_System , Parma_Polyhedra_Library::Linear_System< Row >
• insert_pending_no_ok() : Parma_Polyhedra_Library::Linear_System< Row >
• insert_precise() : Parma_Polyhedra_Library::CO_Tree
• insert_precise_aux() : Parma_Polyhedra_Library::CO_Tree
• insert_verbatim() : Parma_Polyhedra_Library::Congruence_System , Parma_Polyhedra_Library::Grid_Generator_System
• integer_log2() : Parma_Polyhedra_Library::CO_Tree
• integer_space_dimensions() : Parma_Polyhedra_Library::MIP_Problem
• integer_upper_bound_assign_if_exact() : Parma_Polyhedra_Library::BD_Shape< T > , Parma_Polyhedra_Library::Octagonal_Shape< T >
• intersect_assign() : Parma_Polyhedra_Library::Interval< Boundary, Info >
• intersection_assign() : Parma_Polyhedra_Library::Affine_Space , Parma_Polyhedra_Library::Any_Pointset , Parma_Polyhedra_Library::BD_Shape< T > , Parma_Polyhedra_Library::Bit_Row , Parma_Polyhedra_Library::Box< ITV > , Parma_Polyhedra_Library::Grid , Parma_Polyhedra_Library::Octagonal_Shape< T > , Parma_Polyhedra_Library::Partially_Reduced_Product< D1, D2, R > , Parma_Polyhedra_Library::Pointset_Ask_Tell< PSET > , Parma_Polyhedra_Library::Pointset_Powerset< PSET > , Parma_Polyhedra_Library::Polyhedron
• intersection_preserving_enlarge_element() : Parma_Polyhedra_Library::Pointset_Powerset< PSET >
• Interval() : Parma_Polyhedra_Library::Interval< Boundary, Info >
• interval_coefficient_upper_bound() : Parma_Polyhedra_Library::Octagonal_Shape< T >
• Interval_Info_Bitset() : Parma_Polyhedra_Library::Interval_Info_Bitset< T, Policy >
• Interval_Info_Null() : Parma_Polyhedra_Library::Interval_Info_Null< Policy >
• Interval_Info_Null_Open() : Parma_Polyhedra_Library::Interval_Info_Null_Open< Policy >
• intervalize() : Parma_Polyhedra_Library::Floating_Point_Expression< FP_Interval_Type, FP_Format > , Parma_Polyhedra_Library::Linear_Form< C >
• is() : Parma_Polyhedra_Library::Concrete_Expression_Common< Target >
• is_always_topologically_closed() : Parma_Polyhedra_Library::Interval< Boundary, Info >
• is_better_pivot() : Parma_Polyhedra_Library::PIP_Solution_Node::Tableau
• is_bottom() : Parma_Polyhedra_Library::Ask_Tell< D > , Parma_Polyhedra_Library::Determinate< PSET > , Parma_Polyhedra_Library::Powerset< D >
• is_bounded() : Parma_Polyhedra_Library::Affine_Space , Parma_Polyhedra_Library::Any_Pointset , Parma_Polyhedra_Library::BD_Shape< T > , Parma_Polyhedra_Library::Box< ITV > , Parma_Polyhedra_Library::Grid , Parma_Polyhedra_Library::Interval< Boundary, Info > , Parma_Polyhedra_Library::Octagonal_Shape< T > , Parma_Polyhedra_Library::Partially_Reduced_Product< D1, D2, R > , Parma_Polyhedra_Library::Pointset_Powerset< PSET > , Parma_Polyhedra_Library::Polyhedron
• is_bounded_integer() : Parma_Polyhedra_Library::Concrete_Expression_Type
• is_cert_multiset_stabilizing() : Parma_Polyhedra_Library::Pointset_Ask_Tell< PSET > , Parma_Polyhedra_Library::Pointset_Powerset< PSET >
• is_closure_point() : Parma_Polyhedra_Library::Generator
• is_definitely_equivalent_to() : Parma_Polyhedra_Library::Determinate< PSET >
• is_discrete() : Parma_Polyhedra_Library::Affine_Space , Parma_Polyhedra_Library::Any_Pointset , Parma_Polyhedra_Library::BD_Shape< T > , Parma_Polyhedra_Library::Box< ITV > , Parma_Polyhedra_Library::Grid , Parma_Polyhedra_Library::Octagonal_Shape< T > , Parma_Polyhedra_Library::Partially_Reduced_Product< D1, D2, R > , Parma_Polyhedra_Library::Pointset_Powerset< PSET > , Parma_Polyhedra_Library::Polyhedron
• is_disjoint() : Parma_Polyhedra_Library::Poly_Con_Relation
• is_disjoint_from() : Parma_Polyhedra_Library::Affine_Space , Parma_Polyhedra_Library::Any_Pointset , Parma_Polyhedra_Library::BD_Shape< T > , Parma_Polyhedra_Library::Box< ITV > , Parma_Polyhedra_Library::Grid , Parma_Polyhedra_Library::Interval< Boundary, Info > , Parma_Polyhedra_Library::Octagonal_Shape< T > , Parma_Polyhedra_Library::Partially_Reduced_Product< D1, D2, R > , Parma_Polyhedra_Library::Pointset_Powerset< PSET > , Parma_Polyhedra_Library::Polyhedron
• is_empty() : Parma_Polyhedra_Library::Affine_Space , Parma_Polyhedra_Library::Any_Pointset , Parma_Polyhedra_Library::BD_Shape< T > , Parma_Polyhedra_Library::Box< ITV > , Parma_Polyhedra_Library::Grid , Parma_Polyhedra_Library::Interval< Boundary, Info > , Parma_Polyhedra_Library::Octagonal_Shape< T > , Parma_Polyhedra_Library::Partially_Reduced_Product< D1, D2, R > , Parma_Polyhedra_Library::Pointset_Powerset< PSET > , Parma_Polyhedra_Library::Polyhedron
• is_equal_at_dimension() : Parma_Polyhedra_Library::Congruence , Parma_Polyhedra_Library::Grid_Generator
• is_equal_to() : Parma_Polyhedra_Library::Congruence_System , Parma_Polyhedra_Library::Constraint , Parma_Polyhedra_Library::Expression_Adapter< T > , Parma_Polyhedra_Library::Expression_Hide_Inhomo< T > , Parma_Polyhedra_Library::Expression_Hide_Last< T > , Parma_Polyhedra_Library::Generator , Parma_Polyhedra_Library::Grid_Generator , Parma_Polyhedra_Library::Grid_Generator_System , Parma_Polyhedra_Library::Linear_Expression , Parma_Polyhedra_Library::Linear_Expression_Impl< Row > , Parma_Polyhedra_Library::Linear_Expression_Interface
• is_equality() : Parma_Polyhedra_Library::Congruence , Parma_Polyhedra_Library::Constraint
• is_equivalent_to() : Parma_Polyhedra_Library::Constraint , Parma_Polyhedra_Library::Generator , Parma_Polyhedra_Library::Grid_Generator
• is_floating_point() : Parma_Polyhedra_Library::Concrete_Expression_Type
• is_greater_than_ratio() : Parma_Polyhedra_Library::CO_Tree
• is_in_base() : Parma_Polyhedra_Library::MIP_Problem
• is_included() : Parma_Polyhedra_Library::Poly_Con_Relation
• is_included_in() : Parma_Polyhedra_Library::Grid , Parma_Polyhedra_Library::Polyhedron
• is_inconsistent() : Parma_Polyhedra_Library::Congruence , Parma_Polyhedra_Library::Constraint
• is_inequality() : Parma_Polyhedra_Library::Constraint
• is_integer() : Parma_Polyhedra_Library::Checked_Number< T, Policy > , Parma_Polyhedra_Library::PIP_Solution_Node::Tableau
• is_leaf() : Parma_Polyhedra_Library::CO_Tree::tree_iterator
• is_less_precise_than() : Parma_Polyhedra_Library::Float< T >
• is_less_than_ratio() : Parma_Polyhedra_Library::CO_Tree
• is_line() : Parma_Polyhedra_Library::Generator , Parma_Polyhedra_Library::Grid_Generator
• is_line_or_equality() : Parma_Polyhedra_Library::Constraint , Parma_Polyhedra_Library::Generator , Parma_Polyhedra_Library::Grid_Generator
• is_line_or_parameter() : Parma_Polyhedra_Library::Grid_Generator
• is_line_or_ray() : Parma_Polyhedra_Library::Generator
• is_lp_satisfiable() : Parma_Polyhedra_Library::MIP_Problem
• is_matching_closure_point() : Parma_Polyhedra_Library::Generator
• is_minus_infinity() : Parma_Polyhedra_Library::Checked_Number< T, Policy >
• is_mip_satisfiable() : Parma_Polyhedra_Library::MIP_Problem
• is_nan() : Parma_Polyhedra_Library::float_ibm_single , Parma_Polyhedra_Library::float_ieee754_double , Parma_Polyhedra_Library::float_ieee754_half , Parma_Polyhedra_Library::float_ieee754_quad , Parma_Polyhedra_Library::float_ieee754_single , Parma_Polyhedra_Library::float_intel_double_extended
• is_necessarily_closed() : Parma_Polyhedra_Library::Constraint , Parma_Polyhedra_Library::Constraint_System , Parma_Polyhedra_Library::Generator , Parma_Polyhedra_Library::Generator_System , Parma_Polyhedra_Library::Grid_Generator , Parma_Polyhedra_Library::Linear_System< Row > , Parma_Polyhedra_Library::Polyhedron
• is_nonstrict_inequality() : Parma_Polyhedra_Library::Constraint
• is_normalized() : Parma_Polyhedra_Library::Ask_Tell< D >
• is_not_a_number() : Parma_Polyhedra_Library::Checked_Number< T, Policy >
• is_not_necessarily_closed() : Parma_Polyhedra_Library::Constraint , Parma_Polyhedra_Library::Generator , Parma_Polyhedra_Library::Grid_Generator
• is_omega_reduced() : Parma_Polyhedra_Library::Powerset< D >
• is_parameter() : Parma_Polyhedra_Library::Grid_Generator
• is_parameter_or_point() : Parma_Polyhedra_Library::Grid_Generator
• is_plus_infinity() : Parma_Polyhedra_Library::Checked_Number< T, Policy >
• is_point() : Parma_Polyhedra_Library::Generator , Parma_Polyhedra_Library::Grid_Generator
• is_proper_congruence() : Parma_Polyhedra_Library::Congruence
• is_ray() : Parma_Polyhedra_Library::Generator
• is_ray_or_point() : Parma_Polyhedra_Library::Generator
• is_ray_or_point_or_inequality() : Parma_Polyhedra_Library::Constraint , Parma_Polyhedra_Library::Generator , Parma_Polyhedra_Library::Grid_Generator
• is_reduced() : Parma_Polyhedra_Library::Partially_Reduced_Product< D1, D2, R >
• is_right_child() : Parma_Polyhedra_Library::CO_Tree::tree_iterator
• is_root() : Parma_Polyhedra_Library::CO_Tree::tree_iterator
• is_satisfiable() : Parma_Polyhedra_Library::MIP_Problem , Parma_Polyhedra_Library::PIP_Problem
• is_satisfied() : Parma_Polyhedra_Library::MIP_Problem
• is_saturated() : Parma_Polyhedra_Library::MIP_Problem
• is_shared() : Parma_Polyhedra_Library::Determinate< PSET >::Rep
• is_shortest_path_reduced() : Parma_Polyhedra_Library::BD_Shape< T >
• is_singleton() : Parma_Polyhedra_Library::Interval< Boundary, Info >
• is_sorted() : Parma_Polyhedra_Library::Constraint_System , Parma_Polyhedra_Library::Generator_System , Parma_Polyhedra_Library::Linear_System< Row >
• is_stabilizing() : Parma_Polyhedra_Library::BHRZ03_Certificate , Parma_Polyhedra_Library::Grid_Certificate
• is_strict_inequality() : Parma_Polyhedra_Library::Constraint
• is_strong_coherent() : Parma_Polyhedra_Library::Octagonal_Shape< T >
• is_strongly_reduced() : Parma_Polyhedra_Library::Octagonal_Shape< T >
• is_tautological() : Parma_Polyhedra_Library::Congruence , Parma_Polyhedra_Library::Constraint
• is_top() : Parma_Polyhedra_Library::Ask_Tell< D > , Parma_Polyhedra_Library::Determinate< PSET > , Parma_Polyhedra_Library::Powerset< D >
• is_topologically_closed() : Parma_Polyhedra_Library::Affine_Space , Parma_Polyhedra_Library::Any_Pointset , Parma_Polyhedra_Library::BD_Shape< T > , Parma_Polyhedra_Library::Box< ITV > , Parma_Polyhedra_Library::Grid , Parma_Polyhedra_Library::Interval< Boundary, Info > , Parma_Polyhedra_Library::Octagonal_Shape< T > , Parma_Polyhedra_Library::Partially_Reduced_Product< D1, D2, R > , Parma_Polyhedra_Library::Pointset_Powerset< PSET > , Parma_Polyhedra_Library::Polyhedron
• is_unbounded_obj_function() : Parma_Polyhedra_Library::MIP_Problem
• is_universe() : Parma_Polyhedra_Library::Affine_Space , Parma_Polyhedra_Library::Any_Pointset , Parma_Polyhedra_Library::BD_Shape< T > , Parma_Polyhedra_Library::Box< ITV > , Parma_Polyhedra_Library::Grid , Parma_Polyhedra_Library::Interval< Boundary, Info > , Parma_Polyhedra_Library::Octagonal_Shape< T > , Parma_Polyhedra_Library::Partially_Reduced_Product< D1, D2, R > , Parma_Polyhedra_Library::Pointset_Powerset< PSET > , Parma_Polyhedra_Library::Polyhedron
• is_zero() : Parma_Polyhedra_Library::Expression_Adapter< T > , Parma_Polyhedra_Library::Expression_Hide_Inhomo< T > , Parma_Polyhedra_Library::Expression_Hide_Last< T > , Parma_Polyhedra_Library::Linear_Expression , Parma_Polyhedra_Library::Linear_Expression_Impl< Row > , Parma_Polyhedra_Library::Linear_Expression_Interface
• item() : Parma_Polyhedra_Library::Temp_Item< T > , Parma_Polyhedra_Library::Temp_Reference_Holder< T > , Parma_Polyhedra_Library::Temp_Value_Holder< T >
• iter_swap() : Parma_Polyhedra_Library::Bit_Row , Parma_Polyhedra_Library::DB_Row< T > , Parma_Polyhedra_Library::Dense_Row
• iterator() : Parma_Polyhedra_Library::CO_Tree::iterator , Parma_Polyhedra_Library::Dense_Row::iterator
• iterator_to_const() : Parma_Polyhedra_Library::iterator_to_const< Container >