| commit | 591e80b37aa76168b16cf5470f82292887688456 | |
| author | Tobias Grosser <tobias@grosser.es> | |
| Mon, 28 May 2018 09:08:33 +0000 (28 11:08 +0200) | ||
| committer | Sven Verdoolaege <sven.verdoolaege@gmail.com> | |
| Tue, 29 May 2018 21:30:12 +0000 (29 23:30 +0200) | ||
| tree | 40e4da5e26bef8f2a990d86719ee55d8e7f63847 | treesnapshot (tar.gz zip) |
| parent | b324c0c32e39997b3e044d2aa69de00a2f4fc5da | commitdiff |
Add, document and test isl_union_set_get_set_list
As with the previous commit, the same motivation applies:
It is sometimes more convenient to manipulate a list of sets rather than
to iterate over them individually.
Sorting elements (e.g., dependence distances, access offsets) according
to some priority function is one use case where lists are more
convenient to use than the foreach callback.
Signed-off-by: Tobias Grosser <tobias@grosser.es>
Signed-off-by: Sven Verdoolaege <sven.verdoolaege@gmail.com>
As with the previous commit, the same motivation applies:
It is sometimes more convenient to manipulate a list of sets rather than
to iterate over them individually.
Sorting elements (e.g., dependence distances, access offsets) according
to some priority function is one use case where lists are more
convenient to use than the foreach callback.
Signed-off-by: Tobias Grosser <tobias@grosser.es>
Signed-off-by: Sven Verdoolaege <sven.verdoolaege@gmail.com>