Check whether the first argument is a (strict) subset of the
second argument.
+=item * Order
+
+ int isl_set_plain_cmp(__isl_keep isl_set *set1,
+ __isl_keep isl_set *set2);
+
+This function is useful for sorting C<isl_set>s.
+The order depends on the internal representation of the inputs.
+The order is fixed over different calls to the function (assuming
+the internal representation of the inputs has not changed), but may
+change over different versions of C<isl>.
+
=back
=head2 Unary Operations
__isl_export
__isl_give isl_set *isl_set_coalesce(__isl_take isl_set *set);
+int isl_set_plain_cmp(__isl_keep isl_set *set1, __isl_keep isl_set *set2);
int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2);
int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2);
int isl_set_plain_is_disjoint(__isl_keep isl_set *set1,
return isl_basic_map_plain_cmp(bset1, bset2);
}
-int isl_set_plain_cmp(const __isl_keep isl_set *set1,
- const __isl_keep isl_set *set2)
+int isl_set_plain_cmp(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
{
int i, cmp;
__isl_take isl_basic_set *bset);
int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
const __isl_keep isl_basic_map *bmap2);
-int isl_set_plain_cmp(const __isl_keep isl_set *set1,
- const __isl_keep isl_set *set2);
int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
__isl_keep isl_basic_set *bset2);
int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
{
- const isl_set *set1 = *(const isl_set **)p1;
- const isl_set *set2 = *(const isl_set **)p2;
+ isl_set *set1 = *(isl_set * const *)p1;
+ isl_set *set2 = *(isl_set * const *)p2;
return isl_set_plain_cmp(set1, set2);
}