From 5c41f7d78755c0de542ed822d7feb2e2360392fa Mon Sep 17 00:00:00 2001 From: Sven Verdoolaege Date: Wed, 2 Mar 2011 21:42:19 +0100 Subject: [PATCH] doc: drop long outdated note on transitive closures Signed-off-by: Sven Verdoolaege --- doc/user.pod | 6 +----- 1 file changed, 1 insertion(+), 5 deletions(-) diff --git a/doc/user.pod b/doc/user.pod index 25ae72c..9c77ca8 100644 --- a/doc/user.pod +++ b/doc/user.pod @@ -1424,10 +1424,8 @@ per space. Compute a parametric representation for all positive powers I of C. The power I is equated to the parameter at position C. -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. 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 -- 2.7.4