X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=doc%2Fuser.pod;h=69e962bf7f0f5a90866a27932af80fe43803ca52;hb=b9e709e0959c9edf7391b865281f20e48193b083;hp=b453b4d3dc0b68767f619be856bbb75b418be571;hpb=c62655f2ce5f558f913f739afed162ed5b8f658c;p=platform%2Fupstream%2Fisl.git

diff --git a/doc/user.pod b/doc/user.pod
index b453b4d..69e962b 100644
--- a/doc/user.pod
+++ b/doc/user.pod
@@ -2039,6 +2039,17 @@ the cells in the domain of the input piecewise quasipolynomial.
 The context is also exploited
 to simplify the quasipolynomials associated to each cell.
 
+	__isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial(
+		__isl_take isl_pw_qpolynomial *pwqp, int sign);
+	__isl_give isl_union_pw_qpolynomial *
+	isl_union_pw_qpolynomial_to_polynomial(
+		__isl_take isl_union_pw_qpolynomial *upwqp, int sign);
+
+Approximate each quasipolynomial by a polynomial.  If C<sign> is positive,
+the polynomial will be an overapproximation.  If C<sign> is negative,
+it will be an underapproximation.  If C<sign> is zero, the approximation
+will lie somewhere in between.
+
 =head2 Bounds on Piecewise Quasipolynomials and Piecewise Quasipolynomial Reductions
 
 A piecewise quasipolynomial reduction is a piecewise