summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorSven Verdoolaege <skimo@kotnet.org>2011-03-02 21:42:19 +0100
committerSven Verdoolaege <skimo@kotnet.org>2011-03-02 21:42:24 +0100
commit5c41f7d78755c0de542ed822d7feb2e2360392fa (patch)
tree7968139b88e0d58243b3c182d9fee0722e43599a
parent0cc0481810ae8611a0cd1865daa59460d30e18ad (diff)
downloadisl-5c41f7d78755c0de542ed822d7feb2e2360392fa.tar.gz
isl-5c41f7d78755c0de542ed822d7feb2e2360392fa.tar.bz2
isl-5c41f7d78755c0de542ed822d7feb2e2360392fa.zip
doc: drop long outdated note on transitive closures
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
-rw-r--r--doc/user.pod6
1 files changed, 1 insertions, 5 deletions
diff --git a/doc/user.pod b/doc/user.pod
index 25ae72c5..9c77ca8e 100644
--- a/doc/user.pod
+++ b/doc/user.pod
@@ -1424,10 +1424,8 @@ per space.
Compute a parametric representation for all positive powers I<k> of C<map>.
The power I<k> is equated to the parameter at position C<param>.
-The result may be an overapproximation. If the result is exact,
+The result may be an overapproximation. If the result is known to be exact,
then C<*exact> is set to C<1>.
-The current implementation only produces exact results for particular
-cases of piecewise translations (i.e., piecewise uniform dependences).
=item * Transitive closure
@@ -1439,8 +1437,6 @@ cases of piecewise translations (i.e., piecewise uniform dependences).
Compute the transitive closure of C<map>.
The result may be an overapproximation. If the result is known to be exact,
then C<*exact> is set to C<1>.
-The current implementation only produces exact results for particular
-cases of piecewise translations (i.e., piecewise uniform dependences).
=item * Reaching path lengths