From d20121bf12bc0c425a28d5b3d221ecc830577b6e Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?= Date: Tue, 24 Jun 2008 15:39:28 +0000 Subject: [PATCH] html fix [SVN r46650] --- doc/boost_range.html | 110 ++++++++++++++++++++--------------------- doc/examples.html | 8 +-- doc/faq.html | 4 +- doc/headers.html | 2 +- doc/intro.html | 2 +- doc/portability.html | 5 +- doc/range.html | 14 +++--- doc/utility_class.html | 27 +++++----- index.html | 2 +- 9 files changed, 87 insertions(+), 87 deletions(-) mode change 100755 => 100644 doc/examples.html mode change 100755 => 100644 doc/faq.html mode change 100755 => 100644 doc/headers.html mode change 100755 => 100644 doc/portability.html mode change 100755 => 100644 doc/range.html diff --git a/doc/boost_range.html b/doc/boost_range.html index 465bd18..b9fd0ca 100644 --- a/doc/boost_range.html +++ b/doc/boost_range.html @@ -152,7 +152,7 @@ class=identifier>range_reverse_iterator; rend( const T& r ); - // + // // Random Access Range functions // @@ -235,7 +235,7 @@ class=identifier>T& A[sz] a denotes an array of type A of size sz - + Char* s @@ -259,9 +259,9 @@ class=identifier>T& Complexity - - - range_iterator<X>::type + + + range_iterator<X>::type T::iterator
P::first_type
A*
@@ -269,8 +269,8 @@ class=identifier>T& compile time - - range_iterator<const X>::type + + range_iterator<const X>::type T::const_iterator
P::first_type
const A*
@@ -278,54 +278,53 @@ class=identifier>T& compile time - - range_value<X>::type + + range_value<X>::type boost::iterator_value<range_iterator<X>::type>::type compile time - - range_reference<X>::type + + range_reference<X>::type boost::iterator_reference<range_iterator<X>::type>::type compile time - - range_pointer<X>::type + + range_pointer<X>::type boost::iterator_pointer<range_iterator<X>::type>::type compile time - - range_category<X>::type + + range_category<X>::type boost::iterator_category<range_iterator<X>::type>::type compile time - - range_difference<X>::type + + range_difference<X>::type boost::iterator_difference<range_iterator<X>::type>::type compile time - - - range_reverse_iterator<X>::type + + range_reverse_iterator<X>::type boost::reverse_iterator<range_iterator<X>::type>
compile time - - range_reverse_iterator<const X>::type + + range_reverse_iterator<const X>::type boost::reverse_iterator<range_iterator<const X>::type>
compile time @@ -346,11 +345,11 @@ class=identifier>T& - - begin(x) + + begin(x) range_iterator<X>::type - p.first if p is of type std::pair<T>
+ p.first if p is of type std::pair<T>
a if a is an array
range_begin(x) if that expression would invoke a function found by ADL
t.begin() otherwise @@ -358,11 +357,11 @@ class=identifier>T& constant time - - end(x) + + end(x) range_iterator<X>::type - p.second if p is of type std::pair<T>
+ p.second if p is of type std::pair<T>
a + sz if a is an array of size sz
@@ -373,16 +372,16 @@ class=identifier>T& - - empty(x) + + empty(x) bool boost::begin(x) == boost::end(x)
constant time
- - distance(x) + + distance(x) range_difference<X>::type @@ -394,16 +393,16 @@ class=identifier>T& - - size(x) + + size(x) range_difference<X>::type boost::end(x) - boost::begin(x) constant time - - rbegin(x) + + rbegin(x) range_reverse_iterator<X>::type range_reverse_iterator<X>::type( boost::end(x) )
@@ -411,15 +410,15 @@ class=identifier>T& - - rend(x) + + rend(x) range_reverse_iterator<X>::type range_reverse_iterator<X>::type( boost::begin(x) ) constant time - - const_begin(x) + + const_begin(x) range_iterator<const X>::type range_iterator<const X>::type( boost::begin(x) )
@@ -427,15 +426,15 @@ class=identifier>T& - - const_end(x) + + const_end(x) range_iterator<const X>::type range_iterator<const X>::type( boost::end(x) ) constant time - - const_rbegin(x) + + const_rbegin(x) range_reverse_iterator<const X>::type range_reverse_iterator<const X>::type( boost::rbegin(x) )
@@ -443,16 +442,16 @@ class=identifier>T& - - const_rend(x) + + const_rend(x) range_reverse_iterator<const X>::type range_reverse_iterator<const X>::type( boost::rend(x) ) constant time - - as_literal(x) + + as_literal(x) iterator_range<U> where U is Char* if x is a pointer to a string and U is @@ -460,20 +459,21 @@ class=identifier>T& - [a,a+sz-1) if a is an array of size sz
- [s,s + std::char_traits<X>::length(s)) if s is a Char* + + [s,s + std::char_traits<X>::length(s)) if s is a Char* or an array of Char
[boost::begin(x),boost::end(x)) otherwise - linear time for pointers to a string, constant time - otherwise + linear time for pointers to a string or arrays of + Char, constant time otherwise - - as_array(x) + + as_array(x) iterator_range<X> [boost::begin(x),boost::end(x)) @@ -561,7 +561,7 @@ class=identifier>T& Related concept - + iterator Single Pass Range diff --git a/doc/examples.html b/doc/examples.html old mode 100755 new mode 100644 index 0d24509..d1f9887 --- a/doc/examples.html +++ b/doc/examples.html @@ -23,16 +23,16 @@
  • string.cpp -
    • + shows how to implement a container version of std::find() that works with char[],wchar_t[],char*,wchar_t*. - +
  • algorithm_example.cpp -
    • + shows the replace example from the introduction. - +
  • iterator_range.cpp
  • sub_range.cpp
  • iterator_pair.cpp diff --git a/doc/faq.html b/doc/faq.html old mode 100755 new mode 100644 index 244df80..fcacf98 --- a/doc/faq.html +++ b/doc/faq.html @@ -22,7 +22,7 @@
  • Why is there no difference between range_iterator<C>::type and range_const_iterator<C>::type for std::pair<iterator, iterator>. -
    • +

    In general it is not possible nor desirable to find a corresponding const_iterator. When it is possible to come up with one, the client might choose to construct a std::pair<const_iterator,const_iterator> @@ -33,7 +33,7 @@ is somewhat more convenient than a pair and that a sub_range does propagate const-ness.

    - +
  • Why is there not supplied more types or more functions?

    diff --git a/doc/headers.html b/doc/headers.html old mode 100755 new mode 100644 index 7628591..c896bff --- a/doc/headers.html +++ b/doc/headers.html @@ -167,7 +167,7 @@ -

    diff --git a/doc/intro.html b/doc/intro.html index 82f10dc..89d3504 100644 --- a/doc/intro.html +++ b/doc/intro.html @@ -108,7 +108,7 @@ class=identifier>ForwardReadableRange >:: my_vector.assign( values, boost::end( values ) ); - typedef std::vector<int>::iterator iterator; + typedef std::vector<int>::iterator iterator; std::pair<iterator,iterator> my_view( boost::begin( my_vector ), boost::begin( my_vector ) + N ); char str_val[] = "a string"; diff --git a/doc/portability.html b/doc/portability.html old mode 100755 new mode 100644 index 9e63978..bb73e78 --- a/doc/portability.html +++ b/doc/portability.html @@ -29,9 +29,8 @@ href="http://boost.sourceforge.net/regression-logs/developer/range.html">here - - Visual C++ 6/7.0 has a limited support for arrays: as long as the arrays are - of built-in type it should work. +

    Visual C++ 6/7.0 has a limited support for arrays: as long as the arrays + are of built-in type it should work.

    Notice also that some compilers cannot do function template ordering properly. diff --git a/doc/range.html b/doc/range.html old mode 100755 new mode 100644 index b140888..8646141 --- a/doc/range.html +++ b/doc/range.html @@ -1,3 +1,4 @@ +

    - +

    Single Pass Range

    Notation

    @@ -227,7 +228,7 @@ otherwise
    -

    Forward Range

    +

    Forward Range

    Notation

    @@ -255,7 +256,7 @@ Range
    -

    Bidirectional Range

    +

    Bidirectional Range

    Notation

    @@ -283,7 +284,8 @@ s-lib-bidirectional-traversal-iterators">Bidirectional Traversal Iterator.
    -

    Random Access Range

    Description

    +

    Random Access Range

    +

    Description

    A range X where boost::range_iterator<X>::type is a model of Boost Concept Check library to insure that the type of a template parameter diff --git a/doc/utility_class.html b/doc/utility_class.html index e100859..956bf99 100644 --- a/doc/utility_class.html +++ b/doc/utility_class.html @@ -31,7 +31,6 @@

  • Class sub_range - The iterator_range class is templated on a Forward @@ -84,7 +83,7 @@ corresponding const_iterator is.

    typedef ForwardTraversalIterator const_iterator; typedef iterator_difference<iterator>::type difference_type; - public: // construction, assignment + public: // construction, assignment template< class ForwardTraversalIterator2 > iterator_range( ForwardTraversalIterator2 Begin, ForwardTraversalIterator2 End ); @@ -110,7 +109,7 @@ corresponding const_iterator is.

    operator     unspecified_bool_type() const; bool equal( const iterator_range& ) ( const iterator_range& ) const; reference front() const; reference back() const; @@ -119,7 +118,7 @@ class=keyword>const; // for Random Access Range only: reference operator[]( difference_type at ) const; value_type operator()( difference_type at ) const; - }; + }; // stream output template< class ForwardTraversalIterator, class T, class Traits > @@ -164,7 +163,7 @@ class=keyword>const; bool operator<( const ForwardRange& l, const iterator_range<ForwardTraversalIterator>& r ); - // external construction + // external construction template< class ForwardTraversalIterator > iterator_range< ForwardTraversalIterator > make_iterator_range( ForwardTraversalIterator Begin, @@ -190,7 +189,7 @@ class=keyword>const; typename range_difference<Range>::type advance_begin, typename range_difference<Range>::type advance_end ); - // convenience + // convenience template< class Sequence, class ForwardRange > Sequence copy_range(

    -bool equal( iterator_range& r ) const; +bool equal( iterator_range& r ) const;

    - Returns begin() == r.begin() && end() == r.end(); + Returns begin() == r.begin() && end() == r.end();

    @@ -236,21 +235,21 @@ non-const iterators from the same container.

    -bool operator==( const ForwardRange1& l, const ForwardRange2& r ); +bool operator==( const ForwardRange1& l, const ForwardRange2& r );

    Returns size(l) != size(r) ? false : std::equal( begin(l), end(l), begin(r) );

    -bool operator!=( const ForwardRange1& l, const ForwardRange2& r ); +bool operator!=( const ForwardRange1& l, const ForwardRange2& r );
    Returns !( l == r );
    -bool operator<( const ForwardRange1& l, const ForwardRange2& r ); +bool operator<( const ForwardRange1& l, const ForwardRange2& r );
    Returns std::lexicographical_compare( begin(l), end(l), begin(r), end(r) ); 

    -iterator_range make_iterator_range( Range& r, 
+iterator_range make_iterator_range( Range& r, 
                                     typename range_difference<Range>::type advance_begin, 
                                     typename range_difference<Range>::type advance_end );
    @@ -266,7 +265,7 @@ return make_iterator_range( new_begin, new_end );

    -Sequence copy_range( const ForwardRange& r ); +Sequence copy_range( const ForwardRange& r );

    Returns Sequence( begin(r), end(r) );
    @@ -292,7 +291,7 @@ class can propagate constness since it knows what a corresponding     class sub_range : public iterator_range< typename range_iterator<ForwardRange>::type > { public: - typedef typename range_iterator<ForwardRange>::    type iterator; + typedef typename range_iterator<ForwardRange>::type iterator; typedef typename range_iterator<const ForwardRange>::type const_iterator; typedef typename iterator_difference<iterator>::type difference_type; diff --git a/index.html b/index.html index 56ba4eb..e846421 100644 --- a/index.html +++ b/index.html @@ -34,7 +34,7 @@