, including all inherited members.
| add_congruence(const Congruence &cg) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| add_congruences(const Congruence_System &cgs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| add_constraint(const Constraint &c) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| add_constraints(const Constraint_System &cs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| add_dbm_constraint(dimension_type i, dimension_type j, const N &k) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| add_dbm_constraint(dimension_type i, dimension_type j, Coefficient_traits::const_reference num, Coefficient_traits::const_reference den) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| add_recycled_congruences(Congruence_System &cgs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| add_recycled_constraints(Constraint_System &cs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| add_space_dimensions_and_embed(dimension_type m) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| add_space_dimensions_and_project(dimension_type m) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| affine_dimension() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| affine_image(Variable var, const Linear_Expression &expr, Coefficient_traits::const_reference denominator=Coefficient_one()) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| affine_preimage(Variable var, const Linear_Expression &expr, Coefficient_traits::const_reference denominator=Coefficient_one()) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| ascii_dump() const | Parma_Polyhedra_Library::BD_Shape< T > | |
| ascii_dump(std::ostream &s) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| ascii_load(std::istream &s) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| BD_Shape(dimension_type num_dimensions=0, Degenerate_Element kind=UNIVERSE) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, explicit] |
| BD_Shape(const BD_Shape &y, Complexity_Class complexity=ANY_COMPLEXITY) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| BD_Shape(const BD_Shape< U > &y, Complexity_Class complexity=ANY_COMPLEXITY) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, explicit] |
| BD_Shape(const Constraint_System &cs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, explicit] |
| BD_Shape(const Congruence_System &cgs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, explicit] |
| BD_Shape(const Generator_System &gs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, explicit] |
| BD_Shape(const Polyhedron &ph, Complexity_Class complexity=ANY_COMPLEXITY) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, explicit] |
| BD_Shape(const Box< Interval > &box, Complexity_Class complexity=ANY_COMPLEXITY) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, explicit] |
| BD_Shape(const Grid &grid, Complexity_Class complexity=ANY_COMPLEXITY) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, explicit] |
| BD_Shape(const Octagonal_Shape< U > &os, Complexity_Class complexity=ANY_COMPLEXITY) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, explicit] |
| BFT00_upper_bound_assign_if_exact(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| BHMZ05_widening_assign(const BD_Shape &y, unsigned *tp=0) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| BHZ09_upper_bound_assign_if_exact(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| bounded_affine_image(Variable var, const Linear_Expression &lb_expr, const Linear_Expression &ub_expr, Coefficient_traits::const_reference denominator=Coefficient_one()) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| bounded_affine_preimage(Variable var, const Linear_Expression &lb_expr, const Linear_Expression &ub_expr, Coefficient_traits::const_reference denominator=Coefficient_one()) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| bounds(const Linear_Expression &expr, bool from_above) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| bounds_from_above(const Linear_Expression &expr) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| bounds_from_below(const Linear_Expression &expr) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| can_recycle_congruence_systems() | Parma_Polyhedra_Library::BD_Shape< T > | [inline, static] |
| can_recycle_constraint_systems() | Parma_Polyhedra_Library::BD_Shape< T > | [inline, static] |
| CC76_extrapolation_assign(const BD_Shape &y, unsigned *tp=0) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| CC76_extrapolation_assign(const BD_Shape &y, Iterator first, Iterator last, unsigned *tp=0) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| CC76_narrowing_assign(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| coefficient_type typedef | Parma_Polyhedra_Library::BD_Shape< T > | |
| coefficient_type_base typedef | Parma_Polyhedra_Library::BD_Shape< T > | |
| compute_leader_indices(const std::vector< dimension_type > &predecessor, std::vector< dimension_type > &indices) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| compute_leaders(std::vector< dimension_type > &leaders) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| compute_predecessors(std::vector< dimension_type > &predecessor) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| concatenate_assign(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| congruences() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| constrains(Variable var) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| constraints() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| contains(const BD_Shape &y) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| contains_integer_point() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| dbm | Parma_Polyhedra_Library::BD_Shape< T > | [private] |
| deduce_u_minus_v_bounds(dimension_type v, dimension_type last_v, const Linear_Expression &sc_expr, Coefficient_traits::const_reference sc_den, const N &minus_lb_v) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| deduce_v_minus_u_bounds(dimension_type v, dimension_type last_v, const Linear_Expression &sc_expr, Coefficient_traits::const_reference sc_den, const N &ub_v) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| difference_assign(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| drop_some_non_integer_points(Complexity_Class complexity=ANY_COMPLEXITY) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| drop_some_non_integer_points(const Variables_Set &vars, Complexity_Class complexity=ANY_COMPLEXITY) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| drop_some_non_integer_points_helper(N &elem) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| euclidean_distance_assign(Checked_Number< To, Extended_Number_Policy > &r, const BD_Shape< T > &x, const BD_Shape< T > &y, Rounding_Dir dir) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| euclidean_distance_assign(Checked_Number< To, Extended_Number_Policy > &r, const BD_Shape< T > &x, const BD_Shape< T > &y, Rounding_Dir dir, Temp &tmp0, Temp &tmp1, Temp &tmp2) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| expand_space_dimension(Variable var, dimension_type m) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| external_memory_in_bytes() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| extract_bounded_difference(const Constraint &c, dimension_type c_space_dim, dimension_type &c_num_vars, dimension_type &c_first_var, dimension_type &c_second_var, Coefficient &c_coeff) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| fold_space_dimensions(const Variables_Set &vars, Variable dest) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| forget_all_dbm_constraints(dimension_type v) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| forget_binary_dbm_constraints(dimension_type v) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| frequency(const Linear_Expression &expr, Coefficient &freq_n, Coefficient &freq_d, Coefficient &val_n, Coefficient &val_d) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| generalized_affine_image(Variable var, Relation_Symbol relsym, const Linear_Expression &expr, Coefficient_traits::const_reference denominator=Coefficient_one()) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| generalized_affine_image(const Linear_Expression &lhs, Relation_Symbol relsym, const Linear_Expression &rhs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| generalized_affine_preimage(Variable var, Relation_Symbol relsym, const Linear_Expression &expr, Coefficient_traits::const_reference denominator=Coefficient_one()) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| generalized_affine_preimage(const Linear_Expression &lhs, Relation_Symbol relsym, const Linear_Expression &rhs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| get_limiting_shape(const Constraint_System &cs, BD_Shape &limiting_shape) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| H79_widening_assign(const BD_Shape &y, unsigned *tp=0) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| hash_code() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| incremental_shortest_path_closure_assign(Variable var) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| integer_upper_bound_assign_if_exact(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| intersection_assign(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| is_bounded() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| is_discrete() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| is_disjoint_from(const BD_Shape &y) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| is_empty() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| is_shortest_path_reduced() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| is_topologically_closed() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| is_universe() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| l_infinity_distance_assign(Checked_Number< To, Extended_Number_Policy > &r, const BD_Shape< T > &x, const BD_Shape< T > &y, Rounding_Dir dir) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| l_infinity_distance_assign(Checked_Number< To, Extended_Number_Policy > &r, const BD_Shape< T > &x, const BD_Shape< T > &y, Rounding_Dir dir, Temp &tmp0, Temp &tmp1, Temp &tmp2) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| limited_BHMZ05_extrapolation_assign(const BD_Shape &y, const Constraint_System &cs, unsigned *tp=0) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| limited_CC76_extrapolation_assign(const BD_Shape &y, const Constraint_System &cs, unsigned *tp=0) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| limited_H79_extrapolation_assign(const BD_Shape &y, const Constraint_System &cs, unsigned *tp=0) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| map_space_dimensions(const Partial_Function &pfunc) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| marked_empty() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| marked_shortest_path_closed() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| marked_shortest_path_reduced() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| marked_zero_dim_univ() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| max_min(const Linear_Expression &expr, bool maximize, Coefficient &ext_n, Coefficient &ext_d, bool &included, Generator &g) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| max_min(const Linear_Expression &expr, bool maximize, Coefficient &ext_n, Coefficient &ext_d, bool &included) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| max_space_dimension() | Parma_Polyhedra_Library::BD_Shape< T > | [inline, static] |
| maximize(const Linear_Expression &expr, Coefficient &sup_n, Coefficient &sup_d, bool &maximum) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| maximize(const Linear_Expression &expr, Coefficient &sup_n, Coefficient &sup_d, bool &maximum, Generator &g) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| minimize(const Linear_Expression &expr, Coefficient &inf_n, Coefficient &inf_d, bool &minimum) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| minimize(const Linear_Expression &expr, Coefficient &inf_n, Coefficient &inf_d, bool &minimum, Generator &g) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| minimized_congruences() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| minimized_constraints() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| N typedef | Parma_Polyhedra_Library::BD_Shape< T > | [private] |
| OK() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| operator!=(const BD_Shape< T > &x, const BD_Shape< T > &y) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| operator<<(std::ostream &s, const BD_Shape< T > &bds) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| operator=(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| operator==(const BD_Shape< T > &x, const BD_Shape< T > &y) | Parma_Polyhedra_Library::BD_Shape< T > | [friend] |
| Parma_Polyhedra_Library::BD_Shape class | Parma_Polyhedra_Library::BD_Shape< T > | [friend] |
| Parma_Polyhedra_Library::Box class | Parma_Polyhedra_Library::BD_Shape< T > | [friend] |
| Parma_Polyhedra_Library::euclidean_distance_assign(Checked_Number< To, Extended_Number_Policy > &r, const BD_Shape< U > &x, const BD_Shape< U > &y, const Rounding_Dir dir, Temp &tmp0, Temp &tmp1, Temp &tmp2) | Parma_Polyhedra_Library::BD_Shape< T > | [friend] |
| Parma_Polyhedra_Library::IO_Operators::operator<<(std::ostream &s, const BD_Shape< T > &c) | Parma_Polyhedra_Library::BD_Shape< T > | [friend] |
| Parma_Polyhedra_Library::l_infinity_distance_assign(Checked_Number< To, Extended_Number_Policy > &r, const BD_Shape< U > &x, const BD_Shape< U > &y, const Rounding_Dir dir, Temp &tmp0, Temp &tmp1, Temp &tmp2) | Parma_Polyhedra_Library::BD_Shape< T > | [friend] |
| Parma_Polyhedra_Library::rectilinear_distance_assign(Checked_Number< To, Extended_Number_Policy > &r, const BD_Shape< U > &x, const BD_Shape< U > &y, const Rounding_Dir dir, Temp &tmp0, Temp &tmp1, Temp &tmp2) | Parma_Polyhedra_Library::BD_Shape< T > | [friend] |
| print() const | Parma_Polyhedra_Library::BD_Shape< T > | |
| rectilinear_distance_assign(Checked_Number< To, Extended_Number_Policy > &r, const BD_Shape< T > &x, const BD_Shape< T > &y, Rounding_Dir dir) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| rectilinear_distance_assign(Checked_Number< To, Extended_Number_Policy > &r, const BD_Shape< T > &x, const BD_Shape< T > &y, Rounding_Dir dir, Temp &tmp0, Temp &tmp1, Temp &tmp2) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| redundancy_dbm | Parma_Polyhedra_Library::BD_Shape< T > | [private] |
| refine(Variable var, Relation_Symbol relsym, const Linear_Expression &expr, Coefficient_traits::const_reference denominator=Coefficient_one()) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| refine_no_check(const Constraint &c) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| refine_no_check(const Congruence &cg) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| refine_with_congruence(const Congruence &cg) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| refine_with_congruences(const Congruence_System &cgs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| refine_with_constraint(const Constraint &c) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| refine_with_constraints(const Constraint_System &cs) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| relation_with(const Constraint &c) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| relation_with(const Congruence &cg) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| relation_with(const Generator &g) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| remove_higher_space_dimensions(dimension_type new_dimension) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| remove_space_dimensions(const Variables_Set &vars) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| reset_shortest_path_closed() | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| reset_shortest_path_reduced() | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| set_empty() | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| set_shortest_path_closed() | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| set_shortest_path_reduced() | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| set_zero_dim_univ() | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| shortest_path_closure_assign() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| shortest_path_reduction_assign() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| simplify_using_context_assign(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| space_dimension() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| status | Parma_Polyhedra_Library::BD_Shape< T > | [private] |
| strictly_contains(const BD_Shape &y) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| swap(BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| swap(Parma_Polyhedra_Library::BD_Shape< T > &x, Parma_Polyhedra_Library::BD_Shape< T > &y) | Parma_Polyhedra_Library::BD_Shape< T > | [related] |
| throw_dimension_incompatible(const char *method, const BD_Shape &x) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| throw_dimension_incompatible(const char *method, dimension_type required_dim) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| throw_dimension_incompatible(const char *method, const Constraint &c) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| throw_dimension_incompatible(const char *method, const Congruence &cg) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| throw_dimension_incompatible(const char *method, const Generator &g) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| throw_dimension_incompatible(const char *method, const char *name_row, const Linear_Expression &y) const | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private] |
| throw_expression_too_complex(const char *method, const Linear_Expression &e) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private, static] |
| throw_generic(const char *method, const char *reason) | Parma_Polyhedra_Library::BD_Shape< T > | [inline, private, static] |
| time_elapse_assign(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| topological_closure_assign() | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| total_memory_in_bytes() const | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| unconstrain(Variable var) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| unconstrain(const Variables_Set &vars) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| upper_bound_assign(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| upper_bound_assign_if_exact(const BD_Shape &y) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| widening_assign(const BD_Shape &y, unsigned *tp=0) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| wrap_assign(const Variables_Set &vars, Bounded_Integer_Type_Width w, Bounded_Integer_Type_Representation r, Bounded_Integer_Type_Overflow o, const Constraint_System *pcs=0, unsigned complexity_threshold=16, bool wrap_individually=true) | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |
| ~BD_Shape() | Parma_Polyhedra_Library::BD_Shape< T > | [inline] |