| commit | 87763f78b8dbcb6c383a311f5908f5924cdb9a7a | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Tue, 25 Nov 2014 15:57:46 +0000 (25 16:57 +0100) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Mon, 2 Feb 2015 22:16:15 +0000 (2 23:16 +0100) | ||
| tree | f646bb687671eb91ad0b16be135c36b90c4b8b84 | treesnapshot (tar.gz zip) |
| parent | a15a4b1c6c95e743648d125c403dd135a83d452f | commitdiff |
add isl_union_map_eq_at_multi_union_pw_aff
In principle, it would be possible to construct a map expressing
the order in the target space, map both domain and range of this map
back to the spaces of the union map and perform the intersection
at the end. However, the intermediate union map could contain
many more maps than are needed. Only determining the order
for maps that are actually present in the input union map should
be more efficient.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
In principle, it would be possible to construct a map expressing
the order in the target space, map both domain and range of this map
back to the spaces of the union map and perform the intersection
at the end. However, the intermediate union map could contain
many more maps than are needed. Only determining the order
for maps that are actually present in the input union map should
be more efficient.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
| doc/user.pod | diffblobblamehistory | |
| include/isl/union_map.h | diffblobblamehistory | |
| isl_union_map.c | diffblobblamehistory |