doc: drop long outdated note on transitive closures

Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>

diff --git a/doc/user.pod b/doc/user.pod
index 25ae72c..9c77ca8 100644 (file)
--- 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