From fc94d429e2c7da41af64d519566cb419ebed0ede Mon Sep 17 00:00:00 2001 From: Michael Stevens Date: Mon, 18 Jul 2005 07:39:12 +0000 Subject: [PATCH] FIX doc no spaces in

[SVN r30154] --- doc/expression_concept.htm | 9 +++------ doc/iterator_concept.htm | 12 ++++-------- doc/range.htm | 2 +- doc/storage_sparse.htm | 4 ++-- doc/unbounded_array.htm | 2 +- 5 files changed, 11 insertions(+), 18 deletions(-) diff --git a/doc/expression_concept.htm b/doc/expression_concept.htm index edbe653d..ade2a507 100644 --- a/doc/expression_concept.htm +++ b/doc/expression_concept.htm @@ -9,8 +9,7 @@

Expression Concepts

-

Scalar -Expression

+

Scalar Expression

Description

A Scalar Expression is an expression convertible to a scalar type.

@@ -90,8 +89,7 @@ evaluated scalar expression.

  • vector_scalar_unary
  • vector_scalar_binary
    • -

    Vector -Expression

    +

    Vector Expression

    Description

    A Vector Expression is an expression evaluatable to a vector. Vector Expression provides an v.rend ().

  • matrix_vector_binary2
    • -

    Matrix -Expression

    +

    Matrix Expression

    Description

    A Matrix Expression is an expression evaluatable to a matrix. Matrix Expression provides an

    An Iterator is a restricted pointer-like object pointing into a vector or matrix container.

    Indexed Bidirectional -Iterator

    +"indexed_bidirectional_iterator">Indexed Bidirectional Iterator

    Description

    An Indexed Bidirectional Iterator is an iterator of a container that can be dereferenced, incremented, decremented and carries @@ -295,8 +294,7 @@ operator

  • sparse_vector::iterator

    • Indexed Random Access -Iterator

    +"indexed_random_access_iterator">Indexed Random Access Iterator

    Description

    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).

  • vector::iterator

    • Indexed Bidirectional -Column/Row Iterator

    +"indexed_bidirectional_cr_iterator">Indexed Bidirectional Column/Row Iterator

    Description

    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 () for all it2t with it2t ()

  • sparse_matrix::iterator2

    • Indexed Random Access -Column/Row Iterator

    +"indexed_random_access_cr_iterator">Indexed Random Access Column/Row Iterator

    Description

    An Indexed Random Access Column/Row Iterator is an iterator of a container that can be dereferenced, incremented, decremented and diff --git a/doc/range.htm b/doc/range.htm index 8bf82d3b..666c7fb7 100644 --- a/doc/range.htm +++ b/doc/range.htm @@ -101,7 +101,7 @@ end of the reversed range.

  • start () <= stop ()
    • -

    Slice<SizeType,DistanceType>

    +

    Slice<SizeType,DistanceType>

    Description

    The class slice 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. diff --git a/doc/storage_sparse.htm b/doc/storage_sparse.htm index de231aaf..a29d6aec 100644 --- a/doc/storage_sparse.htm +++ b/doc/storage_sparse.htm @@ -12,7 +12,7 @@

    Sparse Storage

    -

    Default Standard Map

    +

    Default Standard Map

    Description

    The templated class map_std<I, T, ALLOC> provides a wrapper for the standard library associative container @@ -66,7 +66,7 @@ int main () { Container.

    Public base classes

    std::map

    -

    Map Array

    +

    Map Array

    Description

    The templated class map_array<I, T, ALLOC> implements a std::map like associative container as a sorted array. It therefore some of the Associative Container interface without having the same semantics as an std::map.

    At any time the map_array has a capacity up to which new element can be inserted. diff --git a/doc/unbounded_array.htm b/doc/unbounded_array.htm index 1ca2651e..a24f4ad1 100644 --- a/doc/unbounded_array.htm +++ b/doc/unbounded_array.htm @@ -9,7 +9,7 @@

    Unbounded Array Storage

    -

    Unbounded Array<T,Alloc>

    +

    Unbounded Array<T,Alloc>

    Description

    The templated class unbounded_array<T, ALLOC> implements a unbounded storage array using an allocator. The unbounded array is similar to a std::vector in that in can grow in size beyond any fixed bound.