boost/ublas
2
0
Fork 0
mirror of https://github.com/boostorg/ublas.git synced 2026-02-19 02:42:16 +00:00
Code Issues Projects Releases Wiki Activity

FIX doc no spaces in <h2>

Browse Source 
[SVN r30154]
This commit is contained in:
Michael Stevens
2005-07-18 07:39:12 +00:00
parent bd8358c220
commit fc94d429e2
5 changed files with 11 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
doc/expression_concept.htm
View File

@@ -9,8 +9,7 @@
<body>
<h1><img src="../../../../boost.png" align="middle" />
Expression Concepts</h1>
<h2><a name="scalar_expression" id="scalar_expression"></a> Scalar
Expression</h2>
<h2><a name="scalar_expression" id="scalar_expression"></a>Scalar Expression</h2>
<h4>Description</h4>
<p>A Scalar Expression is an expression convertible to a scalar
type.</p>
@@ -90,8 +89,7 @@ evaluated scalar expression.</p>
<li><code>vector_scalar_unary</code></li>
<li><code>vector_scalar_binary</code></li>
</ul>
<h2><a name="vector_expression" id="vector_expression"></a> Vector
Expression</h2>
<h2><a name="vector_expression" id="vector_expression"></a>Vector Expression</h2>
<h4>Description</h4>
<p>A Vector Expression is an expression evaluatable to a vector.
Vector Expression provides an <a href=
@@ -503,8 +501,7 @@ to <code>v.rend ()</code>.</td>
<li><code>matrix_vector_binary2</code></li>
</ul>
<h2><a name="matrix_expression" id="matrix_expression"></a> Matrix
Expression</h2>
<h2><a name="matrix_expression" id="matrix_expression"></a>Matrix Expression</h2>
<h4>Description</h4>
<p>A Matrix Expression is an expression evaluatable to a matrix.
Matrix Expression provides an <a href=

12
doc/iterator_concept.htm
View File

@@ -15,8 +15,7 @@ Iterator Concepts</h1>
<p>An Iterator is a restricted pointer-like object pointing into a
vector or matrix container.</p>
<h2><a name="indexed_bidirectional_iterator" id=
"indexed_bidirectional_iterator"></a> Indexed Bidirectional
Iterator</h2>
"indexed_bidirectional_iterator"></a>Indexed Bidirectional Iterator</h2>
<h4>Description</h4>
<p>An Indexed Bidirectional Iterator is an iterator of a container
that can be dereferenced, incremented, decremented and carries
@@ -295,8 +294,7 @@ operator</td>
<li><code>sparse_vector::iterator</code></li>
</ul>
<h2><a name="indexed_random_access_iterator" id=
"indexed_random_access_iterator"></a> Indexed Random Access
Iterator</h2>
"indexed_random_access_iterator"></a>Indexed Random Access Iterator</h2>
<h4>Description</h4>
<p>An Indexed Random Access Iterator is an iterator of a container
that can be dereferenced, moved forward, moved backward and carries
@@ -526,8 +524,7 @@ it2 + (it1 - it2)</code>.</td>
<li><code>vector::iterator</code></li>
</ul>
<h2><a name="indexed_bidirectional_cr_iterator" id=
"indexed_bidirectional_cr_iterator"></a> Indexed Bidirectional
Column/Row Iterator</h2>
"indexed_bidirectional_cr_iterator"></a>Indexed Bidirectional Column/Row Iterator</h2>
<h4>Description</h4>
<p>An Indexed Bidirectional Column/Row Iterator is an iterator of a
container that can be dereferenced, incremented, decremented and
@@ -924,8 +921,7 @@ it2t.index1 ()</code> for all <code>it2t</code> with <code>it2t ()
<li><code>sparse_matrix::iterator2</code></li>
</ul>
<h2><a name="indexed_random_access_cr_iterator" id=
"indexed_random_access_cr_iterator"></a> Indexed Random Access
Column/Row Iterator</h2>
"indexed_random_access_cr_iterator"></a>Indexed Random Access Column/Row Iterator</h2>
<h4>Description</h4>
<p>An Indexed Random Access Column/Row Iterator is an iterator of a
container that can be dereferenced, incremented, decremented and

2
doc/range.htm
View File

@@ -101,7 +101,7 @@ end of the reversed <code>range</code>.</td>
<li><code>start () &lt;= stop ()</code></li>
</ul>
<h2><a name="slice" id="slice"></a> Slice&lt;SizeType,DistanceType&gt;</h2>
<h2><a name="slice" id="slice"></a>Slice&lt;SizeType,DistanceType&gt;</h2>
<h4>Description</h4>
<p>The class <code>slice</code> specifies a 'slice' of indicies. Slices are more general
then ranges, the stride allows the sequence of indicies to increase and decrease by the specified amount between element.

4
doc/storage_sparse.htm
View File

@@ -12,7 +12,7 @@
<body>
<h1><img src="../../../../boost.png" align="middle" />
Sparse Storage</h1>
<h2><a name="map_std" id="map_std"></a> Default Standard Map</h2>
<h2><a name="map_std" id="map_std"></a>Default Standard Map</h2>
<h4>Description</h4>
<p>The templated class <code>map_std&lt;I, T, ALLOC&gt;</code> provides a
wrapper for the standard library associative container
@@ -66,7 +66,7 @@ int main () {
Container.</p>
<h4>Public base classes</h4>
<p>std::map</p>
<h2><a name="map_array" id="map_array"></a> Map Array</h2>
<h2><a name="map_array" id="map_array"></a>Map Array</h2>
<h4>Description</h4>
<p>The templated class <code>map_array&lt;I, T, ALLOC&gt;</code> implements a <code>std::map</code> like associative container as a sorted array. It therefore some of the Associative Container interface without having the same semantics as an std::map.
<p>At any time the <code>map_array</code> has a capacity up to which new element can be inserted.

2
doc/unbounded_array.htm
View File

@@ -9,7 +9,7 @@
<body>
<h1><img src="../../../../boost.png" align="middle" />
Unbounded Array Storage</h1>
<h2><a name="unbounded_array" id="unbounded_array"></a> Unbounded Array&lt;T,Alloc&gt;</h2>
<h2><a name="unbounded_array" id="unbounded_array"></a>Unbounded Array&lt;T,Alloc&gt;</h2>
<h4>Description</h4>
<p>The templated class <code>unbounded_array&lt;T, ALLOC&gt;</code> implements a unbounded storage array using an allocator.
The unbounded array is similar to a <code>std::vector</code> in that in can grow in size beyond any fixed bound.