commit 79bae2da8dc19bbd3355112bb9abb64c4c48ecb2 Author: Julien Puydt Date: Fri May 17 19:39:48 2013 +0200 Patch fixing the compilation with texinfo 5 diff --git a/Bugs.texi b/Bugs.texi index 0d1bf5e..3032459 100644 --- a/Bugs.texi +++ b/Bugs.texi @@ -17,7 +17,7 @@ answer, but are marked as known bugs. @code{run_testsuite} takes the following optional keyword arguments -@table @var +@table @code @item display_all Display all tests. Normally, the tests are not displayed, unless the test fails. (Defaults to @code{false}). diff --git a/Integration.texi b/Integration.texi index a5443b5..09b39a7 100644 --- a/Integration.texi +++ b/Integration.texi @@ -1000,7 +1000,7 @@ achieved. The keyword arguments are optional and may be specified in any order. They all take the form @code{key=val}. The keyword arguments are: -@table @var +@table @code @item epsrel Desired relative error of approximation. Default is 1d-8. @item epsabs @@ -1092,7 +1092,7 @@ operator, a Maxima lambda expression, or a general Maxima expression. The keyword arguments are optional and may be specified in any order. They all take the form @code{key=val}. The keyword arguments are: -@table @var +@table @code @item epsrel Desired relative error of approximation. Default is 1d-8. @item epsabs @@ -1200,7 +1200,7 @@ One of the limits of integration must be infinity. If not, then The keyword arguments are optional and may be specified in any order. They all take the form @code{key=val}. The keyword arguments are: -@table @var +@table @code @item epsrel Desired relative error of approximation. Default is 1d-8. @item epsabs @@ -1297,7 +1297,7 @@ operator, a Maxima lambda expression, or a general Maxima expression. The keyword arguments are optional and may be specified in any order. They all take the form @code{key=val}. The keyword arguments are: -@table @var +@table @code @item epsrel Desired relative error of approximation. Default is 1d-8. @item epsabs @@ -1414,7 +1414,7 @@ operator, a Maxima lambda expression, or a general Maxima expression. The keyword arguments are optional and may be specified in any order. They all take the form @code{key=val}. The keyword arguments are: -@table @var +@table @code @item epsabs Desired absolute error of approximation. Default is 1d-10. @item limit @@ -1551,7 +1551,7 @@ operator, a Maxima lambda expression, or a general Maxima expression. The keyword arguments are optional and may be specified in any order. They all take the form @code{key=val}. The keyword arguments are: -@table @var +@table @code @item epsrel Desired relative error of approximation. Default is 1d-8. @item epsabs @@ -1684,7 +1684,7 @@ operator, a Maxima lambda expression, or a general Maxima expression. The keyword arguments are optional and may be specified in any order. They all take the form @code{key=val}. The keyword arguments are: -@table @var +@table @code @item epsrel Desired relative error of approximation. Default is 1d-8. @item epsabs @@ -1788,7 +1788,7 @@ the integrand is singular or discontinous. The keyword arguments are optional and may be specified in any order. They all take the form @code{key=val}. The keyword arguments are: -@table @var +@table @code @item epsrel Desired relative error of approximation. Default is 1d-8. @item epsabs diff --git a/Numerical.texi b/Numerical.texi index 6ce826a..a788ac6 100644 --- a/Numerical.texi +++ b/Numerical.texi @@ -422,7 +422,7 @@ The accuracy of @code{find_root} is governed by @code{abserr} and @code{find_root}. These keyword arguments take the form @code{key=val}. The keyword arguments are -@table @var +@table @code @item abserr Desired absolute error of function value at root. Default is @code{find_root_abs}. diff --git a/category-macros.texi b/category-macros.texi index f8984ae..c7cf8ab 100644 --- a/category-macros.texi +++ b/category-macros.texi @@ -25,32 +25,38 @@ @c Macros for cross references -@macro mref {nodename} @ifhtml +@macro mref {nodename} @code{@ref{\nodename\}} +@end macro @end ifhtml @ifnothtml +@macro mref {nodename} @code{\nodename\} -@end ifnothtml @end macro +@end ifnothtml -@macro mxref {nodename, text} @ifhtml +@macro mxref {nodename, text} @code{@ref{\nodename\, \text\}} +@end macro @end ifhtml @ifnothtml +@macro mxref {nodename, text} @code{\text\} -@end ifnothtml @end macro +@end ifnothtml -@macro mrefdot {nodename} @ifhtml +@macro mrefdot {nodename} @code{@ref{\nodename\}}. +@end macro @end ifhtml @ifnothtml +@macro mrefdot {nodename} @code{\nodename\}. -@end ifnothtml @end macro +@end ifnothtml @macro mxrefdot {nodename, text} @ifhtml @@ -61,30 +67,36 @@ @end ifnothtml @end macro -@macro mrefcomma {nodename} @ifhtml +@macro mrefcomma {nodename} @code{@ref{\nodename\}}, +@end macro @end ifhtml @ifnothtml +@macro mrefcomma {nodename} @code{\nodename\}, -@end ifnothtml @end macro +@end ifnothtml -@macro mxrefcomma {nodename, text} @ifhtml +@macro mxrefcomma {nodename, text} @code{@ref{\nodename\, \text\}}, +@end macro @end ifhtml @ifnothtml +@macro mxrefcomma {nodename, text} @code{\text\}, -@end ifnothtml @end macro +@end ifnothtml -@macro mrefparen {nodename} @ifhtml +@macro mrefparen {nodename} @code{@ref{\nodename\}}) +@end macro @end ifhtml @ifnothtml +@macro mrefparen {nodename} @code{\nodename\}) -@end ifnothtml @end macro +@end ifnothtml diff --git a/lapack.texi b/lapack.texi index 01ddeeb..8702ade 100644 --- a/lapack.texi +++ b/lapack.texi @@ -417,7 +417,7 @@ specifed by optional keyword arguments: The keyword arguments are optional and may be specified in any order. They all take the form @code{key=val}. The keyword arguments are: -@table @var +@table @code @item C The matrix @var{C} that should be added. The default is @code{false}, which means no matrix is added. diff --git a/zeilberger.texi b/zeilberger.texi index 7caf72b..ad36fb6 100644 --- a/zeilberger.texi +++ b/zeilberger.texi @@ -21,7 +21,7 @@ summation. @category{Sums and products} @category{Share packages} @category{Package zeilberger} @closecatbox -@subsubsection The indefinite summation problem +@subsection The indefinite summation problem @code{zeilberger} implements Gosper's algorithm for indefinite hypergeometric summation. Given a hypergeometric term @math{F_k} in @math{k} we want to find its hypergeometric @@ -34,7 +34,7 @@ $$F_k = f_{k+1} - f_k.$$ @math{F_k = f_(k+1) - f_k}. @end ifnottex -@subsubsection The definite summation problem +@subsection The definite summation problem @code{zeilberger} implements Zeilberger's algorithm for definite hypergeometric summation. Given a proper hypergeometric term (in @math{n} and @math{k})