Lines Matching refs:Simplex

13 #include "mlir/Analysis/Presburger/Simplex.h"
360   Simplex simplex(b);
726   /// The list of `Simplex`s constructed from the elements of `disjuncts`.
727   SmallVector<Simplex, 2> simplices;
741   /// Given a Simplex `simp` and one of its inequalities `ineq`, check
744   bool isFacetContained(ArrayRef<DynamicAPInt> ineq, Simplex &simp);
768   LogicalResult typeInequality(ArrayRef<DynamicAPInt> ineq, Simplex &simp);
774   LogicalResult typeEquality(ArrayRef<DynamicAPInt> eq, Simplex &simp);
798     Simplex simp(disjuncts[i]);
848 /// Given a Simplex `simp` and one of its inequalities `ineq`, check
852                                     Simplex &simp) {
875     simplices[n - 2] = Simplex(disjuncts[n - 2]);
892     simplices[n - 2] = Simplex(disjuncts[n - 2]);
915   Simplex &simp = simplices[i];
934                                            Simplex &simp) {
935   Simplex::IneqType type = simp.findIneqType(ineq);
936   if (type == Simplex::IneqType::Redundant)
938   else if (type == Simplex::IneqType::Cut)
946                                          Simplex &simp) {
972   Simplex &simpA = simplices[i];
973   Simplex &simpB = simplices[j];