Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: downloads/boost_1_33_1/libs/numeric/ublas/doc/triangular.htm @ 12

Last change on this file since 12 was 12, checked in by landauf, 17 years ago

added boost

File size: 19.4 KB
Line 
1<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
2    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
3<html xmlns="http://www.w3.org/1999/xhtml">
4<head>
5<meta name="generator" content=
6"HTML Tidy for Linux/x86 (vers 1st March 2004), see www.w3.org" />
7<meta http-equiv="Content-Type" content=
8"text/html; charset=us-ascii" />
9<link href="ublas.css" type="text/css" />
10<title>Triangular Matrix</title>
11</head>
12<body>
13<h1><img src="../../../../boost.png" align="middle" />
14Triangular Matrix</h1>
15<h2><a name="triangular_matrix" id="triangular_matrix"></a>Triangular Matrix</h2>
16<h4>Description</h4>
17<p>The templated class <code>triangular_matrix&lt;T, F1, F2,
18A&gt;</code> is the base container adaptor for triangular matrices.
19For a <em>(n x n</em> )-dimensional lower triangular matrix and
20<em>0 &lt;= i &lt; n</em>,<em>0 &lt;= j &lt; n</em> holds
21<em>t</em><sub><em>i, j</em></sub> <em>= 0</em> , if <em>i &gt;
22j</em>. If furthermore holds t<sub><em>i, i</em></sub><em>= 1</em>
23the matrix is called unit lower triangular. For a <em>(n x n</em>
24)-dimensional upper triangular matrix and <em>0 &lt;= i &lt;
25n</em>,<em>0 &lt;= j &lt; n</em> holds <em>t</em><sub><em>i,
26j</em></sub> <em>= 0</em> , if <em>i &lt; j</em>. If furthermore
27holds t<sub><em>i, i</em></sub><em>= 1</em> the matrix is called
28unit lower triangular. The storage of triangular matrices is
29packed.</p>
30<h4>Example</h4>
31<pre>
32#include &lt;boost/numeric/ublas/triangular.hpp&gt;
33#include &lt;boost/numeric/ublas/io.hpp&gt;
34
35int main () {
36    using namespace boost::numeric::ublas;
37    triangular_matrix&lt;double, lower&gt; ml (3, 3);
38    for (unsigned i = 0; i &lt; ml.size1 (); ++ i)
39        for (unsigned j = 0; j &lt;= i; ++ j)
40            ml (i, j) = 3 * i + j;
41    std::cout &lt;&lt; ml &lt;&lt; std::endl;
42    triangular_matrix&lt;double, upper&gt; mu (3, 3);
43    for (unsigned i = 0; i &lt; mu.size1 (); ++ i)
44        for (unsigned j = i; j &lt; mu.size2 (); ++ j)
45            mu (i, j) = 3 * i + j;
46    std::cout &lt;&lt; mu &lt;&lt; std::endl;
47}
48</pre>
49<h4>Definition</h4>
50<p>Defined in the header triangular.hpp.</p>
51<h4>Template parameters</h4>
52<table border="1" summary="parameters">
53<tbody>
54<tr>
55<th>Parameter</th>
56<th>Description</th>
57<th>Default</th>
58</tr>
59<tr>
60<td><code>T</code></td>
61<td>The type of object stored in the matrix.</td>
62<td></td>
63</tr>
64<tr>
65<td><code>F1</code></td>
66<td>Functor describing the type of the triangular matrix. <a href=
67"#triangular_matrix_1">[1]</a></td>
68<td><code>lower</code></td>
69</tr>
70<tr>
71<td><code>F2</code></td>
72<td>Functor describing the storage organization. <a href=
73"#triangular_matrix_2">[2]</a></td>
74<td><code>row_major</code></td>
75</tr>
76<tr>
77<td><code>A</code></td>
78<td>The type of the adapted array. <a href=
79"#triangular_matrix_3">[3]</a></td>
80<td><code>unbounded_array&lt;T&gt;</code></td>
81</tr>
82</tbody>
83</table>
84<h4>Model of</h4>
85<p><a href="container_concept.htm#matrix">Matrix</a> .</p>
86<h4>Type requirements</h4>
87<p>None, except for those imposed by the requirements of <a href=
88"container_concept.htm#matrix">Matrix</a> .</p>
89<h4>Public base classes</h4>
90<p><code>matrix_container&lt;triangular_matrix&lt;T, F1, F2, A&gt;
91&gt;</code></p>
92<h4>Members</h4>
93<table border="1" summary="members">
94<tbody>
95<tr>
96<th>Member</th>
97<th>Description</th>
98</tr>
99<tr>
100<td><code>triangular_matrix ()</code></td>
101<td>Allocates an uninitialized <code>triangular_matrix</code> that
102holds zero rows of zero elements.</td>
103</tr>
104<tr>
105<td><code>triangular_matrix (size_type size1, size_type
106size2)</code></td>
107<td>Allocates an uninitialized <code>triangular_matrix</code> that
108holds <code>size1</code> rows of <code>size2</code> elements.</td>
109</tr>
110<tr>
111<td><code>triangular_matrix (const triangular_matrix
112&amp;m)</code></td>
113<td>The copy constructor.</td>
114</tr>
115<tr>
116<td><code>template&lt;class AE&gt;<br />
117triangular_matrix (const matrix_expression&lt;AE&gt;
118&amp;ae)</code></td>
119<td>The extended copy constructor.</td>
120</tr>
121<tr>
122<td><code>void resize (size_type size1, size_type size2, bool
123preserve = true)</code></td>
124<td>Reallocates a <code>triangular_matrix</code> to hold
125<code>size1</code> rows of <code>size2</code> elements. The
126existing elements of the <code>triangular_matrix</code> are
127preseved when specified.</td>
128</tr>
129<tr>
130<td><code>size_type size1 () const</code></td>
131<td>Returns the number of rows.</td>
132</tr>
133<tr>
134<td><code>size_type size2 () const</code></td>
135<td>Returns the number of columns.</td>
136</tr>
137<tr>
138<td><code>const_reference operator () (size_type i, size_type j)
139const</code></td>
140<td>Returns a <code>const</code> reference of the <code>j</code>
141-th element in the <code>i</code>-th row.</td>
142</tr>
143<tr>
144<td><code>reference operator () (size_type i, size_type
145j)</code></td>
146<td>Returns a reference of the <code>j</code>-th element in the
147<code>i</code>-th row.</td>
148</tr>
149<tr>
150<td><code>triangular_matrix &amp;operator = (const
151triangular_matrix &amp;m)</code></td>
152<td>The assignment operator.</td>
153</tr>
154<tr>
155<td><code>triangular_matrix &amp;assign_temporary
156(triangular_matrix &amp;m)</code></td>
157<td>Assigns a temporary. May change the triangular matrix
158<code>m</code>.</td>
159</tr>
160<tr>
161<td><code>template&lt;class AE&gt;<br />
162triangular_matrix &amp;operator = (const
163matrix_expression&lt;AE&gt; &amp;ae)</code></td>
164<td>The extended assignment operator.</td>
165</tr>
166<tr>
167<td><code>template&lt;class AE&gt;<br />
168triangular_matrix &amp;assign (const matrix_expression&lt;AE&gt;
169&amp;ae)</code></td>
170<td>Assigns a matrix expression to the triangular matrix. Left and
171right hand side of the assignment should be independent.</td>
172</tr>
173<tr>
174<td><code>template&lt;class AE&gt;<br />
175triangular_matrix &amp;operator += (const
176matrix_expression&lt;AE&gt; &amp;ae)</code></td>
177<td>A computed assignment operator. Adds the matrix expression to
178the triangular matrix.</td>
179</tr>
180<tr>
181<td><code>template&lt;class AE&gt;<br />
182triangular_matrix &amp;plus_assign (const
183matrix_expression&lt;AE&gt; &amp;ae)</code></td>
184<td>Adds a matrix expression to the triangular matrix. Left and
185right hand side of the assignment should be independent.</td>
186</tr>
187<tr>
188<td><code>template&lt;class AE&gt;<br />
189triangular_matrix &amp;operator -= (const
190matrix_expression&lt;AE&gt; &amp;ae)</code></td>
191<td>A computed assignment operator. Subtracts the matrix expression
192from the triangular matrix.</td>
193</tr>
194<tr>
195<td><code>template&lt;class AE&gt;<br />
196triangular_matrix &amp;minus_assign (const
197matrix_expression&lt;AE&gt; &amp;ae)</code></td>
198<td>Subtracts a matrix expression from the triangular matrix. Left
199and right hand side of the assignment should be independent.</td>
200</tr>
201<tr>
202<td><code>template&lt;class AT&gt;<br />
203triangular_matrix &amp;operator *= (const AT &amp;at)</code></td>
204<td>A computed assignment operator. Multiplies the triangular
205matrix with a scalar.</td>
206</tr>
207<tr>
208<td><code>template&lt;class AT&gt;<br />
209triangular_matrix &amp;operator /= (const AT &amp;at)</code></td>
210<td>A computed assignment operator. Divides the triangular matrix
211through a scalar.</td>
212</tr>
213<tr>
214<td><code>void swap (triangular_matrix &amp;m)</code></td>
215<td>Swaps the contents of the triangular matrices.</td>
216</tr>
217<tr>
218<td><code>void insert (size_type i, size_type j, const_reference
219t)</code></td>
220<td>Inserts the value <code>t</code> at the <code>j</code>-th
221element of the <code>i</code>-th row.</td>
222</tr>
223<tr>
224<td><code>void erase (size_type i, size_type j)</code></td>
225<td>Erases the value at the <code>j</code>-th elemenst of the
226<code>i</code>-th row.</td>
227</tr>
228<tr>
229<td><code>void clear ()</code></td>
230<td>Clears the matrix.</td>
231</tr>
232<tr>
233<td><code>const_iterator1 begin1 () const</code></td>
234<td>Returns a <code>const_iterator1</code> pointing to the
235beginning of the <code>triangular_matrix</code>.</td>
236</tr>
237<tr>
238<td><code>const_iterator1 end1 () const</code></td>
239<td>Returns a <code>const_iterator1</code> pointing to the end of
240the <code>triangular_matrix</code>.</td>
241</tr>
242<tr>
243<td><code>iterator1 begin1 ()</code></td>
244<td>Returns a <code>iterator1</code> pointing to the beginning of
245the <code>triangular_matrix</code>.</td>
246</tr>
247<tr>
248<td><code>iterator1 end1 ()</code></td>
249<td>Returns a <code>iterator1</code> pointing to the end of the
250<code>triangular_matrix</code>.</td>
251</tr>
252<tr>
253<td><code>const_iterator2 begin2 () const</code></td>
254<td>Returns a <code>const_iterator2</code> pointing to the
255beginning of the <code>triangular_matrix</code>.</td>
256</tr>
257<tr>
258<td><code>const_iterator2 end2 () const</code></td>
259<td>Returns a <code>const_iterator2</code> pointing to the end of
260the <code>triangular_matrix</code>.</td>
261</tr>
262<tr>
263<td><code>iterator2 begin2 ()</code></td>
264<td>Returns a <code>iterator2</code> pointing to the beginning of
265the <code>triangular_matrix</code>.</td>
266</tr>
267<tr>
268<td><code>iterator2 end2 ()</code></td>
269<td>Returns a <code>iterator2</code> pointing to the end of the
270<code>triangular_matrix</code>.</td>
271</tr>
272<tr>
273<td><code>const_reverse_iterator1 rbegin1 () const</code></td>
274<td>Returns a <code>const_reverse_iterator1</code> pointing to the
275beginning of the reversed <code>triangular_matrix</code>.</td>
276</tr>
277<tr>
278<td><code>const_reverse_iterator1 rend1 () const</code></td>
279<td>Returns a <code>const_reverse_iterator1</code> pointing to the
280end of the reversed <code>triangular_matrix</code>.</td>
281</tr>
282<tr>
283<td><code>reverse_iterator1 rbegin1 ()</code></td>
284<td>Returns a <code>reverse_iterator1</code> pointing to the
285beginning of the reversed <code>triangular_matrix</code>.</td>
286</tr>
287<tr>
288<td><code>reverse_iterator1 rend1 ()</code></td>
289<td>Returns a <code>reverse_iterator1</code> pointing to the end of
290the reversed <code>triangular_matrix</code>.</td>
291</tr>
292<tr>
293<td><code>const_reverse_iterator2 rbegin2 () const</code></td>
294<td>Returns a <code>const_reverse_iterator2</code> pointing to the
295beginning of the reversed <code>triangular_matrix</code>.</td>
296</tr>
297<tr>
298<td><code>const_reverse_iterator2 rend2 () const</code></td>
299<td>Returns a <code>const_reverse_iterator2</code> pointing to the
300end of the reversed <code>triangular_matrix</code>.</td>
301</tr>
302<tr>
303<td><code>reverse_iterator2 rbegin2 ()</code></td>
304<td>Returns a <code>reverse_iterator2</code> pointing to the
305beginning of the reversed <code>triangular_matrix</code>.</td>
306</tr>
307<tr>
308<td><code>reverse_iterator2 rend2 ()</code></td>
309<td>Returns a <code>reverse_iterator2</code> pointing to the end of
310the reversed <code>triangular_matrix</code>.</td>
311</tr>
312</tbody>
313</table>
314<h4>Notes</h4>
315<p><a name="triangular_matrix_1" id="triangular_matrix_1">[1]</a>
316Supported parameters for the type of the triangular matrix are
317<code>lower</code> , <code>unit_lower</code>, <code>upper</code>
318and <code>unit_upper</code> .</p>
319<p><a name="triangular_matrix_2" id="triangular_matrix_2">[2]</a>
320Supported parameters for the storage organization are
321<code>row_major</code> and <code>column_major</code>.</p>
322<p><a name="triangular_matrix_3" id="triangular_matrix_3">[3]</a>
323Supported parameters for the adapted array are
324<code>unbounded_array&lt;T&gt;</code> ,
325<code>bounded_array&lt;T&gt;</code> and
326<code>std::vector&lt;T&gt;</code> .</p>
327<h2><a name="triangular_adaptor" id="triangular_adaptor"></a>Triangular Adaptor</h2>
328<h4>Description</h4>
329<p>The templated class <code>triangular_adaptor&lt;M, F&gt;</code>
330is a triangular matrix adaptor for other matrices.</p>
331<h4>Example</h4>
332<pre>
333#include &lt;boost/numeric/ublas/triangular.hpp&gt;
334#include &lt;boost/numeric/ublas/io.hpp&gt;
335
336int main () {
337    using namespace boost::numeric::ublas;
338    matrix&lt;double&gt; m (3, 3);
339    triangular_adaptor&lt;matrix&lt;double&gt;, lower&gt; tal (m);
340    for (unsigned i = 0; i &lt; tal.size1 (); ++ i)
341        for (unsigned j = 0; j &lt;= i; ++ j)
342            tal (i, j) = 3 * i + j;
343    std::cout &lt;&lt; tal &lt;&lt; std::endl;
344    triangular_adaptor&lt;matrix&lt;double&gt;, upper&gt; tau (m);
345    for (unsigned i = 0; i &lt; tau.size1 (); ++ i)
346        for (unsigned j = i; j &lt; tau.size2 (); ++ j)
347            tau (i, j) = 3 * i + j;
348    std::cout &lt;&lt; tau &lt;&lt; std::endl;
349}
350</pre>
351<h4>Definition</h4>
352<p>Defined in the header triangular.hpp.</p>
353<h4>Template parameters</h4>
354<table border="1" summary="parameters">
355<tbody>
356<tr>
357<th>Parameter</th>
358<th>Description</th>
359<th>Default</th>
360</tr>
361<tr>
362<td><code>M</code></td>
363<td>The type of the adapted matrix.</td>
364<td></td>
365</tr>
366<tr>
367<td><code>F</code></td>
368<td>Functor describing the type of the triangular adaptor. <a href=
369"#triangular_adaptor_1">[1]</a></td>
370<td><code>lower</code></td>
371</tr>
372</tbody>
373</table>
374<h4>Model of</h4>
375<p><a href="expression_concept.htm#matrix_expression">Matrix Expression</a>
376.</p>
377<h4>Type requirements</h4>
378<p>None, except for those imposed by the requirements of <a href=
379"expression_concept.htm#matrix_expression">Matrix Expression</a> .</p>
380<h4>Public base classes</h4>
381<p><code>matrix_expression&lt;triangular_adaptor&lt;M, F&gt;
382&gt;</code></p>
383<h4>Members</h4>
384<table border="1" summary="members">
385<tbody>
386<tr>
387<th>Member</th>
388<th>Description</th>
389</tr>
390<tr>
391<td><code>triangular_adaptor (matrix_type &amp;data)</code></td>
392<td>Constructs a <code>triangular_adaptor</code> of a matrix.</td>
393</tr>
394<tr>
395<td><code>triangular_adaptor (const triangular_adaptor
396&amp;m)</code></td>
397<td>The copy constructor.</td>
398</tr>
399<tr>
400<td><code>template&lt;class AE&gt;<br />
401triangular_adaptor (const matrix_expression&lt;AE&gt;
402&amp;ae)</code></td>
403<td>The extended copy constructor.</td>
404</tr>
405<tr>
406<td><code>size_type size1 () const</code></td>
407<td>Returns the number of rows.</td>
408</tr>
409<tr>
410<td><code>size_type size2 () const</code></td>
411<td>Returns the number of columns.</td>
412</tr>
413<tr>
414<td><code>const_reference operator () (size_type i, size_type j)
415const</code></td>
416<td>Returns a <code>const</code> reference of the <code>j</code>
417-th element in the <code>i</code>-th row.</td>
418</tr>
419<tr>
420<td><code>reference operator () (size_type i, size_type
421j)</code></td>
422<td>Returns a reference of the <code>j</code>-th element in the
423<code>i</code>-th row.</td>
424</tr>
425<tr>
426<td><code>triangular_adaptor &amp;operator = (const
427triangular_adaptor &amp;m)</code></td>
428<td>The assignment operator.</td>
429</tr>
430<tr>
431<td><code>triangular_adaptor &amp;assign_temporary
432(triangular_adaptor &amp;m)</code></td>
433<td>Assigns a temporary. May change the triangular adaptor
434<code>m</code>.</td>
435</tr>
436<tr>
437<td><code>template&lt;class AE&gt;<br />
438triangular_adaptor &amp;operator = (const
439matrix_expression&lt;AE&gt; &amp;ae)</code></td>
440<td>The extended assignment operator.</td>
441</tr>
442<tr>
443<td><code>template&lt;class AE&gt;<br />
444triangular_adaptor &amp;assign (const matrix_expression&lt;AE&gt;
445&amp;ae)</code></td>
446<td>Assigns a matrix expression to the triangular adaptor. Left and
447right hand side of the assignment should be independent.</td>
448</tr>
449<tr>
450<td><code>template&lt;class AE&gt;<br />
451triangular_adaptor &amp;operator += (const
452matrix_expression&lt;AE&gt; &amp;ae)</code></td>
453<td>A computed assignment operator. Adds the matrix expression to
454the triangular adaptor.</td>
455</tr>
456<tr>
457<td><code>template&lt;class AE&gt;<br />
458triangular_adaptor &amp;plus_assign (const
459matrix_expression&lt;AE&gt; &amp;ae)</code></td>
460<td>Adds a matrix expression to the triangular adaptor. Left and
461right hand side of the assignment should be independent.</td>
462</tr>
463<tr>
464<td><code>template&lt;class AE&gt;<br />
465triangular_adaptor &amp;operator -= (const
466matrix_expression&lt;AE&gt; &amp;ae)</code></td>
467<td>A computed assignment operator. Subtracts the matrix expression
468from the triangular adaptor.</td>
469</tr>
470<tr>
471<td><code>template&lt;class AE&gt;<br />
472triangular_adaptor &amp;minus_assign (const
473matrix_expression&lt;AE&gt; &amp;ae)</code></td>
474<td>Subtracts a matrix expression from the triangular adaptor. Left
475and right hand side of the assignment should be independent.</td>
476</tr>
477<tr>
478<td><code>template&lt;class AT&gt;<br />
479triangular_adaptor &amp;operator *= (const AT &amp;at)</code></td>
480<td>A computed assignment operator. Multiplies the triangular
481adaptor with a scalar.</td>
482</tr>
483<tr>
484<td><code>template&lt;class AT&gt;<br />
485triangular_adaptor &amp;operator /= (const AT &amp;at)</code></td>
486<td>A computed assignment operator. Divides the triangular adaptor
487through a scalar.</td>
488</tr>
489<tr>
490<td><code>void swap (triangular_adaptor &amp;m)</code></td>
491<td>Swaps the contents of the triangular adaptors.</td>
492</tr>
493<tr>
494<td><code>const_iterator1 begin1 () const</code></td>
495<td>Returns a <code>const_iterator1</code> pointing to the
496beginning of the <code>triangular_adaptor</code>.</td>
497</tr>
498<tr>
499<td><code>const_iterator1 end1 () const</code></td>
500<td>Returns a <code>const_iterator1</code> pointing to the end of
501the <code>triangular_adaptor</code>.</td>
502</tr>
503<tr>
504<td><code>iterator1 begin1 ()</code></td>
505<td>Returns a <code>iterator1</code> pointing to the beginning of
506the <code>triangular_adaptor</code>.</td>
507</tr>
508<tr>
509<td><code>iterator1 end1 ()</code></td>
510<td>Returns a <code>iterator1</code> pointing to the end of the
511<code>triangular_adaptor</code>.</td>
512</tr>
513<tr>
514<td><code>const_iterator2 begin2 () const</code></td>
515<td>Returns a <code>const_iterator2</code> pointing to the
516beginning of the <code>triangular_adaptor</code>.</td>
517</tr>
518<tr>
519<td><code>const_iterator2 end2 () const</code></td>
520<td>Returns a <code>const_iterator2</code> pointing to the end of
521the <code>triangular_adaptor</code>.</td>
522</tr>
523<tr>
524<td><code>iterator2 begin2 ()</code></td>
525<td>Returns a <code>iterator2</code> pointing to the beginning of
526the <code>triangular_adaptor</code>.</td>
527</tr>
528<tr>
529<td><code>iterator2 end2 ()</code></td>
530<td>Returns a <code>iterator2</code> pointing to the end of the
531<code>triangular_adaptor</code>.</td>
532</tr>
533<tr>
534<td><code>const_reverse_iterator1 rbegin1 () const</code></td>
535<td>Returns a <code>const_reverse_iterator1</code> pointing to the
536beginning of the reversed <code>triangular_adaptor</code>.</td>
537</tr>
538<tr>
539<td><code>const_reverse_iterator1 rend1 () const</code></td>
540<td>Returns a <code>const_reverse_iterator1</code> pointing to the
541end of the reversed <code>triangular_adaptor</code>.</td>
542</tr>
543<tr>
544<td><code>reverse_iterator1 rbegin1 ()</code></td>
545<td>Returns a <code>reverse_iterator1</code> pointing to the
546beginning of the reversed <code>triangular_adaptor</code>.</td>
547</tr>
548<tr>
549<td><code>reverse_iterator1 rend1 ()</code></td>
550<td>Returns a <code>reverse_iterator1</code> pointing to the end of
551the reversed <code>triangular_adaptor</code>.</td>
552</tr>
553<tr>
554<td><code>const_reverse_iterator2 rbegin2 () const</code></td>
555<td>Returns a <code>const_reverse_iterator2</code> pointing to the
556beginning of the reversed <code>triangular_adaptor</code>.</td>
557</tr>
558<tr>
559<td><code>const_reverse_iterator2 rend2 () const</code></td>
560<td>Returns a <code>const_reverse_iterator2</code> pointing to the
561end of the reversed <code>triangular_adaptor</code>.</td>
562</tr>
563<tr>
564<td><code>reverse_iterator2 rbegin2 ()</code></td>
565<td>Returns a <code>reverse_iterator2</code> pointing to the
566beginning of the reversed <code>triangular_adaptor</code>.</td>
567</tr>
568<tr>
569<td><code>reverse_iterator2 rend2 ()</code></td>
570<td>Returns a <code>reverse_iterator2</code> pointing to the end of
571the reversed <code>triangular_adaptor</code>.</td>
572</tr>
573</tbody>
574</table>
575<h4>Notes</h4>
576<p><a name="triangular_adaptor_1" id="triangular_adaptor_1">[1]</a>
577Supported parameters for the type of the triangular adaptor are
578<code>lower</code> , <code>unit_lower</code>, <code>upper</code>
579and <code>unit_upper</code> .</p>
580<hr />
581<p>Copyright (&copy;) 2000-2002 Joerg Walter, Mathias Koch<br />
582Permission to copy, use, modify, sell and distribute this document
583is granted provided this copyright notice appears in all copies.
584This document is provided ``as is'' without express or implied
585warranty, and with no claim as to its suitability for any
586purpose.</p>
587</body>
588</html>
Note: See TracBrowser for help on using the repository browser.