Gentoo Archives: gentoo-commits

From: "Andrey Grozin (grozin)" <grozin@g.o>
To: gentoo-commits@l.g.o
Subject: [gentoo-commits] gentoo-x86 commit in sci-mathematics/maxima/files: texinfo51.patch
Date: Wed, 05 Jun 2013 15:53:59
Message-Id: 20130605155353.847CD20081@flycatcher.gentoo.org
1 grozin 13/06/05 15:53:53
2
3 Added: texinfo51.patch
4 Log:
5 Improvements from the sage-on-maxima overlay: texinfo-5.x is OK, ecls library is built and installed
6
7 (Portage version: 2.2.0_alpha177/cvs/Linux i686, signed Manifest commit with key 0x3AFFCE974D34BD8C!)
8
9 Revision Changes Path
10 1.1 sci-mathematics/maxima/files/texinfo51.patch
11
12 file : http://sources.gentoo.org/viewvc.cgi/gentoo-x86/sci-mathematics/maxima/files/texinfo51.patch?rev=1.1&view=markup
13 plain: http://sources.gentoo.org/viewvc.cgi/gentoo-x86/sci-mathematics/maxima/files/texinfo51.patch?rev=1.1&content-type=text/plain
14
15 Index: texinfo51.patch
16 ===================================================================
17 commit 79bae2da8dc19bbd3355112bb9abb64c4c48ecb2
18 Author: Julien Puydt <julien.puydt@×××××××.net>
19 Date: Fri May 17 19:39:48 2013 +0200
20
21 Patch fixing the compilation with texinfo 5
22
23 diff --git a/Bugs.texi b/Bugs.texi
24 index 0d1bf5e..3032459 100644
25 --- a/doc/info/Bugs.texi
26 +++ b/doc/info/Bugs.texi
27 @@ -17,7 +17,7 @@ answer, but are marked as known bugs.
28
29 @code{run_testsuite} takes the following optional keyword arguments
30
31 -@table @var
32 +@table @code
33 @item display_all
34 Display all tests. Normally, the tests are not displayed, unless the test
35 fails. (Defaults to @code{false}).
36 diff --git a/Integration.texi b/Integration.texi
37 index a5443b5..09b39a7 100644
38 --- a/doc/info/Integration.texi
39 +++ b/doc/info/Integration.texi
40 @@ -1000,7 +1000,7 @@ achieved.
41 The keyword arguments are optional and may be specified in any order.
42 They all take the form @code{key=val}. The keyword arguments are:
43
44 -@table @var
45 +@table @code
46 @item epsrel
47 Desired relative error of approximation. Default is 1d-8.
48 @item epsabs
49 @@ -1092,7 +1092,7 @@ operator, a Maxima lambda expression, or a general Maxima expression.
50 The keyword arguments are optional and may be specified in any order.
51 They all take the form @code{key=val}. The keyword arguments are:
52
53 -@table @var
54 +@table @code
55 @item epsrel
56 Desired relative error of approximation. Default is 1d-8.
57 @item epsabs
58 @@ -1200,7 +1200,7 @@ One of the limits of integration must be infinity. If not, then
59 The keyword arguments are optional and may be specified in any order.
60 They all take the form @code{key=val}. The keyword arguments are:
61
62 -@table @var
63 +@table @code
64 @item epsrel
65 Desired relative error of approximation. Default is 1d-8.
66 @item epsabs
67 @@ -1297,7 +1297,7 @@ operator, a Maxima lambda expression, or a general Maxima expression.
68 The keyword arguments are optional and may be specified in any order.
69 They all take the form @code{key=val}. The keyword arguments are:
70
71 -@table @var
72 +@table @code
73 @item epsrel
74 Desired relative error of approximation. Default is 1d-8.
75 @item epsabs
76 @@ -1414,7 +1414,7 @@ operator, a Maxima lambda expression, or a general Maxima expression.
77 The keyword arguments are optional and may be specified in any order.
78 They all take the form @code{key=val}. The keyword arguments are:
79
80 -@table @var
81 +@table @code
82 @item epsabs
83 Desired absolute error of approximation. Default is 1d-10.
84 @item limit
85 @@ -1551,7 +1551,7 @@ operator, a Maxima lambda expression, or a general Maxima expression.
86 The keyword arguments are optional and may be specified in any order.
87 They all take the form @code{key=val}. The keyword arguments are:
88
89 -@table @var
90 +@table @code
91 @item epsrel
92 Desired relative error of approximation. Default is 1d-8.
93 @item epsabs
94 @@ -1684,7 +1684,7 @@ operator, a Maxima lambda expression, or a general Maxima expression.
95 The keyword arguments are optional and may be specified in any order.
96 They all take the form @code{key=val}. The keyword arguments are:
97
98 -@table @var
99 +@table @code
100 @item epsrel
101 Desired relative error of approximation. Default is 1d-8.
102 @item epsabs
103 @@ -1788,7 +1788,7 @@ the integrand is singular or discontinous.
104 The keyword arguments are optional and may be specified in any order.
105 They all take the form @code{key=val}. The keyword arguments are:
106
107 -@table @var
108 +@table @code
109 @item epsrel
110 Desired relative error of approximation. Default is 1d-8.
111 @item epsabs
112 diff --git a/Numerical.texi b/Numerical.texi
113 index 6ce826a..a788ac6 100644
114 --- a/doc/info/Numerical.texi
115 +++ b/doc/info/Numerical.texi
116 @@ -422,7 +422,7 @@ The accuracy of @code{find_root} is governed by @code{abserr} and
117 @code{find_root}. These keyword arguments take the form
118 @code{key=val}. The keyword arguments are
119
120 -@table @var
121 +@table @code
122 @item abserr
123 Desired absolute error of function value at root. Default is
124 @code{find_root_abs}.
125 diff --git a/category-macros.texi b/category-macros.texi
126 index f8984ae..c7cf8ab 100644
127 --- a/doc/info/category-macros.texi
128 +++ b/doc/info/category-macros.texi
129 @@ -25,32 +25,38 @@
130
131 @c Macros for cross references
132
133 -@macro mref {nodename}
134 @ifhtml
135 +@macro mref {nodename}
136 @code{@ref{\nodename\}}
137 +@end macro
138 @end ifhtml
139 @ifnothtml
140 +@macro mref {nodename}
141 @code{\nodename\}
142 -@end ifnothtml
143 @end macro
144 +@end ifnothtml
145
146 -@macro mxref {nodename, text}
147 @ifhtml
148 +@macro mxref {nodename, text}
149 @code{@ref{\nodename\, \text\}}
150 +@end macro
151 @end ifhtml
152 @ifnothtml
153 +@macro mxref {nodename, text}
154 @code{\text\}
155 -@end ifnothtml
156 @end macro
157 +@end ifnothtml
158
159 -@macro mrefdot {nodename}
160 @ifhtml
161 +@macro mrefdot {nodename}
162 @code{@ref{\nodename\}}.
163 +@end macro
164 @end ifhtml
165 @ifnothtml
166 +@macro mrefdot {nodename}
167 @code{\nodename\}.
168 -@end ifnothtml
169 @end macro
170 +@end ifnothtml
171
172 @macro mxrefdot {nodename, text}
173 @ifhtml
174 @@ -61,30 +67,36 @@
175 @end ifnothtml
176 @end macro
177
178 -@macro mrefcomma {nodename}
179 @ifhtml
180 +@macro mrefcomma {nodename}
181 @code{@ref{\nodename\}},
182 +@end macro
183 @end ifhtml
184 @ifnothtml
185 +@macro mrefcomma {nodename}
186 @code{\nodename\},
187 -@end ifnothtml
188 @end macro
189 +@end ifnothtml
190
191 -@macro mxrefcomma {nodename, text}
192 @ifhtml
193 +@macro mxrefcomma {nodename, text}
194 @code{@ref{\nodename\, \text\}},
195 +@end macro
196 @end ifhtml
197 @ifnothtml
198 +@macro mxrefcomma {nodename, text}
199 @code{\text\},
200 -@end ifnothtml
201 @end macro
202 +@end ifnothtml
203
204 -@macro mrefparen {nodename}
205 @ifhtml
206 +@macro mrefparen {nodename}
207 @code{@ref{\nodename\}})
208 +@end macro
209 @end ifhtml
210 @ifnothtml
211 +@macro mrefparen {nodename}
212 @code{\nodename\})
213 -@end ifnothtml
214 @end macro
215 +@end ifnothtml
216
217 diff --git a/lapack.texi b/lapack.texi
218 index 01ddeeb..8702ade 100644
219 --- a/doc/info/lapack.texi
220 +++ b/doc/info/lapack.texi
221 @@ -417,7 +417,7 @@ specifed by optional keyword arguments: The keyword arguments are
222 optional and may be specified in any order. They all take the form
223 @code{key=val}. The keyword arguments are:
224
225 -@table @var
226 +@table @code
227 @item C
228 The matrix @var{C} that should be added. The default is @code{false},
229 which means no matrix is added.
230 diff --git a/zeilberger.texi b/zeilberger.texi
231 index 7caf72b..ad36fb6 100644
232 --- a/doc/info/zeilberger.texi
233 +++ b/doc/info/zeilberger.texi
234 @@ -21,7 +21,7 @@ summation.
235 @category{Sums and products} @category{Share packages} @category{Package zeilberger}
236 @closecatbox
237
238 -@subsubsection The indefinite summation problem
239 +@subsection The indefinite summation problem
240
241 @code{zeilberger} implements Gosper's algorithm for indefinite hypergeometric summation.
242 Given a hypergeometric term @math{F_k} in @math{k} we want to find its hypergeometric
243 @@ -34,7 +34,7 @@ $$F_k = f_{k+1} - f_k.$$
244 @math{F_k = f_(k+1) - f_k}.
245 @end ifnottex
246
247 -@subsubsection The definite summation problem
248 +@subsection The definite summation problem
249
250 @code{zeilberger} implements Zeilberger's algorithm for definite hypergeometric summation.
251 Given a proper hypergeometric term (in @math{n} and @math{k})