[Mlir-commits] [mlir] [MLIR][Presburger] Implement vertex enumeration and chamber decomposition for polytope generating function computation. (PR #78987)

[Arjun P]

================
@@ -217,6 +217,11 @@ class PresburgerRelation {
   /// redundencies.
   PresburgerRelation simplify() const;
 
+  /// We consider a disjunct to be full-dimensional if it is not flat along the
+  /// dimension of any of its inequalities.
+  /// A PresburgerRelation is full-dimensional if any of its disjuncts is.
----------------
Superty wrote:

`Return whether the given PresburgerRelation is full-dimensional. By full-dimensional we mean that it is not flat along any dimension.`

Dimension of inequalities is an implementation detail. Checking each disjuncts is an implementation detail. Ultimately a presburgerrelation represents a set of points and we are asking if its affine hull is full-dimensional



https://github.com/llvm/llvm-project/pull/78987