Home
last modified time | relevance | path

Searched refs:bounds_from_below (Results 1 – 25 of 28) sorted by relevance

12

/dports/devel/ppl/ppl-1.2/tests/Grid/
H A Dbounds1.cc88 && gr_gs_min.bounds_from_below(le) in test04()
90 && gr_gs_needs_min.bounds_from_below(le) in test04()
124 && !gr_gs_min.bounds_from_below(le) in test05()
126 && !gr_gs_needs_min.bounds_from_below(le) in test05()
159 && !gr_gs_min.bounds_from_below(le) in test06()
194 && gr_gs_min.bounds_from_below(le) in test07()
231 && gr_gs_min.bounds_from_below(le) in test08()
267 && !gr_gs_min.bounds_from_below(le) in test09()
307 && !gr_gs_min.bounds_from_below(le) in test10()
345 && gr_gs_min.bounds_from_below(le) in test11()
[all …]
/dports/devel/ppl/ppl-1.2/tests/Octagonal_Shape/
H A Dbounds1.cc40 && oct2.bounds_from_below(A); in test01()
57 oct.bounds_from_below(A + B); in test02()
75 !oct.bounds_from_below(A - B); in test03()
93 && !oct.bounds_from_below(A + B - C); in test04()
135 && oct.bounds_from_below(A + B - C + 2*E - 2*D); in test06()
178 && oct.bounds_from_below(Linear_Expression(3)); in test08()
197 oct.bounds_from_below(z); in test09()
243 !oct.bounds_from_below(A - B); in test11()
258 !oct.bounds_from_below(A + B); in test12()
274 !oct.bounds_from_below(A + B + C); in test13()
[all …]
/dports/devel/ppl/ppl-1.2/tests/BD_Shape/
H A Dbounds1.cc39 && bds2.bounds_from_below(A); in test01()
55 bool ok = !bds.bounds_from_above(A + B) && bds.bounds_from_below(A + B); in test02()
72 bool ok = bds.bounds_from_above(A - B) && !bds.bounds_from_below(A - B); in test03()
90 && !bds.bounds_from_below(A + B - C); in test04()
111 && !bds.bounds_from_below(A + B - C + 2*E - 2*D); in test05()
132 && bds.bounds_from_below(A + B - C + 2*E - 2*D); in test06()
154 && bds.bounds_from_below(A + B - C + 2*E - 2*D); in test07()
175 && bds.bounds_from_below(Linear_Expression(3)); in test08()
194 bds.bounds_from_below(z); in test09()
239 bool ok = !bds.bounds_from_above(A - B) && !bds.bounds_from_below(A - B); in test11()
[all …]
/dports/devel/ppl/ppl-1.2/tests/Powerset/
H A Dbounds1.cc35 bool ok2 = ps.bounds_from_below(LE); in test01()
42 ok2 = ps.bounds_from_below(LE); in test01()
65 bool ok2 = ps.bounds_from_below(LE); in test02()
78 bool ok2 = ps.bounds_from_below(LE); in test03()
86 ok2 = !ps.bounds_from_below(LE); in test03()
/dports/devel/ppl/ppl-1.2/tests/Partially_Reduced_Product/
H A Dboundedaffineimage1.cc40 && prp.bounds_from_below(Linear_Expression(0))); in test01()
54 && prp.bounds_from_below(Linear_Expression(3))); in test02()
68 && prp.bounds_from_below(Linear_Expression(1))); in test03()
88 && prp.bounds_from_below(le); in test04()
109 && prp.bounds_from_below(le); in test05()
129 && !prp.bounds_from_below(le); in test06()
H A Dbounds1.cc40 && prp.bounds_from_below(Linear_Expression(0))); in test01()
54 && prp.bounds_from_below(Linear_Expression(3))); in test02()
68 && prp.bounds_from_below(Linear_Expression(1))); in test03()
88 && prp.bounds_from_below(le); in test04()
116 && prp.bounds_from_below(le); in test05()
136 && !prp.bounds_from_below(le); in test06()
/dports/devel/ppl/ppl-1.2/tests/Polyhedron/
H A Dbounds1.cc39 && ph2.bounds_from_below(A); in test01()
55 bool ok = !ph.bounds_from_above(A + B) && ph.bounds_from_below(A + B); in test02()
/dports/devel/ppl/ppl-1.2/src/
H A DPartially_Reduced_Product_inlines.hh553 ::bounds_from_below(const Linear_Expression& expr) const { in bounds_from_below() function in Parma_Polyhedra_Library::Partially_Reduced_Product
555 return d1.bounds_from_below(expr) || d2.bounds_from_below(expr); in bounds_from_below()
H A DGrid_inlines.hh327 Grid::bounds_from_below(const Linear_Expression& expr) const { in bounds_from_below() function in Parma_Polyhedra_Library::Grid
H A DPolyhedron_inlines.hh319 Polyhedron::bounds_from_below(const Linear_Expression& expr) const { in bounds_from_below() function in Parma_Polyhedra_Library::Polyhedron
H A DPointset_Powerset_defs.hh341 bool bounds_from_below(const Linear_Expression& expr) const;
H A DPartially_Reduced_Product_defs.hh778 bool bounds_from_below(const Linear_Expression& expr) const;
H A DGrid_defs.hh735 bool bounds_from_below(const Linear_Expression& expr) const;
H A DPolyhedron_defs.hh644 bool bounds_from_below(const Linear_Expression& expr) const;
H A DBox_defs.hh571 bool bounds_from_below(const Linear_Expression& expr) const;
H A DOctagonal_Shape_defs.hh733 bool bounds_from_below(const Linear_Expression& expr) const;
H A DBox_inlines.hh195 Box<ITV>::bounds_from_below(const Linear_Expression& expr) const { in bounds_from_below() function in Parma_Polyhedra_Library::Box
H A DBD_Shape_defs.hh642 bool bounds_from_below(const Linear_Expression& expr) const;
H A DPointset_Powerset_templates.hh925 ::bounds_from_below(const Linear_Expression& expr) const { in bounds_from_below() function in Parma_Polyhedra_Library::Pointset_Powerset
930 if (!si->pointset().bounds_from_below(expr)) { in bounds_from_below()
H A DBD_Shape_inlines.hh390 BD_Shape<T>::bounds_from_below(const Linear_Expression& expr) const { in bounds_from_below() function in Parma_Polyhedra_Library::BD_Shape
H A DOctagonal_Shape_inlines.hh280 Octagonal_Shape<T>::bounds_from_below(const Linear_Expression& expr) const { in bounds_from_below() function in Parma_Polyhedra_Library::Octagonal_Shape
/dports/devel/ppl/ppl-1.2/interfaces/Java/parma_polyhedra_library/
H A DFake_Class_for_Doxygen.java121 public native boolean bounds_from_below(Linear_Expression expr); in bounds_from_below() method in Polyhedron
/dports/devel/ppl/ppl-1.2/interfaces/Prolog/tests/
H A Dpl_check.pl232 bounds_from_below.
1862 bounds_from_below :- label
1864 bounds_from_below(c, [B >= 0, B =< 1], [A >= 1], A),
1865 bounds_from_below(nnc, [B > 0, B < 1], [A > 2], A).
1867 bounds_from_below(T, CS1, CS2, Var) :-
/dports/devel/ppl/ppl-1.2/interfaces/
H A Dppl_interface_generator_common_dat.m4938 dnl Used for the bounds_from_above and bounds_from_below methods.
/dports/devel/ppl/ppl-1.2/
H A DNEWS558 Grid::bounds_from_above(), Grid::bounds_from_below(),
1917 and Polyhedron::bounds_from_below(const LinExpression& e): they

12