__isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset);
__isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set);
__isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set);
+int isl_basic_set_foreach_lexmax(__isl_keep isl_basic_set *bset,
+ int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list,
+ void *user),
+ void *user);
+
__isl_give isl_set *isl_basic_set_union(
__isl_take isl_basic_set *bset1,
__isl_take isl_basic_set *bset2);
return isl_basic_map_foreach_lexopt(bmap, 1, fn, user);
}
+int isl_basic_set_foreach_lexmax(__isl_keep isl_basic_set *bset,
+ int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list,
+ void *user),
+ void *user)
+{
+ return isl_basic_map_foreach_lexmax(bset, fn, user);
+}
+
/* Check if the given sequence of len variables starting at pos
* represents a trivial (i.e., zero) solution.
* The variables are assumed to be non-negative and to come in pairs,