| commit | 91c6aa5e30ab344c3f3b6d07af44e17a88d2b1b6 | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Fri, 18 Feb 2011 12:09:02 +0000 (18 13:09 +0100) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Sun, 20 Feb 2011 09:03:57 +0000 (20 10:03 +0100) | ||
| tree | 7f44e6f4ab2ee934f87094e619a21cb843271118 | treesnapshot (tar.gz zip) |
| parent | 483011dd69205bffb75b07ec26107ed947b15651 | commitdiff |
isl_basic_map_sort_constraints: change comparison routine
In particular, before we would simply sort the constraints lexicographically.
Now, we first check for the last non-zero coefficients and only when those
positions are the same do we continue with the lexicographical order.
The new ordering is the same as that used to order divs in isl_polynomial.c
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
In particular, before we would simply sort the constraints lexicographically.
Now, we first check for the last non-zero coefficients and only when those
positions are the same do we continue with the lexicographical order.
The new ordering is the same as that used to order divs in isl_polynomial.c
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
| isl_map.c | diffblobblamehistory |