Boost-Commit :

Date view	Thread view	Subject view	Author view

From: troy_at_[hidden]
Date: 2008-06-29 11:46:35

Next message: troy_at_[hidden]: "[Boost-commit] svn:boost r46861 - branches/CMake/release/libs/tuple/test"
Previous message: troy_at_[hidden]: "[Boost-commit] svn:boost r46859 - branches/CMake/release/libs/lambda/test"

Author: troy
Date: 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
New Revision: 46860
URL: http://svn.boost.org/trac/boost/changeset/46860

Log:
merge from release branch
Text files modified:
   branches/CMake/release/libs/range/doc/boost_range.html | 110 ++++++++++++++++++++--------------------
   branches/CMake/release/libs/range/doc/examples.html | 8 +-
   branches/CMake/release/libs/range/doc/faq.html | 4
   branches/CMake/release/libs/range/doc/headers.html | 2
   branches/CMake/release/libs/range/doc/history_ack.html | 4
   branches/CMake/release/libs/range/doc/intro.html | 4
   branches/CMake/release/libs/range/doc/portability.html | 5 -
   branches/CMake/release/libs/range/doc/range.html | 14 ++--
   branches/CMake/release/libs/range/doc/style.html | 2
   branches/CMake/release/libs/range/doc/utility_class.html | 33 +++++------
   branches/CMake/release/libs/range/index.html | 4
   branches/CMake/release/libs/range/test/CMakeLists.txt | 1
   branches/CMake/release/libs/range/test/Jamfile.v2 | 4
   branches/CMake/release/libs/range/test/partial_workaround.cpp | 8 ++
   branches/CMake/release/libs/range/test/string.cpp | 34 +++++------
   15 files changed, 121 insertions(+), 116 deletions(-)

Modified: branches/CMake/release/libs/range/doc/boost_range.html
==============================================================================
--- branches/CMake/release/libs/range/doc/boost_range.html (original)
+++ branches/CMake/release/libs/range/doc/boost_range.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -152,7 +152,7 @@
 rend( const T& r );
 
- //
+ //
 // Random Access Range functions
 //

@@ -235,7 +235,7 @@
 <td><code>A[sz]</code>
 <td><code>a</code>
 <td>denotes an array of type <code>A</code> of size <code>sz</code>
- <tr>
+ </tr>
 <tr>
 <td><code>Char*</code>
 <td><code>s</code>
@@ -259,9 +259,9 @@
 <th>
 Complexity</th>
 </tr>
- <tr>
- <a name="range_iterator"></a>
- <td><code>range_iterator<X>::type</code></td>
+
+ <tr >
+ <td><a name="range_iterator"></a><code>range_iterator<X>::type</code></td>
 <td><code>T::iterator</code> 
 <code>P::first_type</code> 
 <code>A*</code> 
@@ -269,8 +269,8 @@
 <td>compile time</td>
 </tr>
 <tr>
- <a name="range_const_iterator"></a>
- <td><code>range_iterator<const X>::type</code></td>
+
+ <td><a name="range_const_iterator"></a><code>range_iterator<const X>::type</code></td>
 <td><code>T::const_iterator</code> 
 <code>P::first_type</code> 
 <code>const A*</code> 
@@ -278,54 +278,53 @@
 <td>compile time</td>
 </tr>
 <tr>
- <a name="range_value"></a>
- <td><code>range_value<X>::type</code></td>
+
+ <td><a name="range_value"></a><code>range_value<X>::type</code></td>
 <td><code>boost::iterator_value<range_iterator<X>::type>::type</code>
 </td>
 <td>compile time</td>
 </tr>
 <tr>
- <a name="range_reference"></a>
- <td><code>range_reference<X>::type</code></td>
+
+ <td><a name="range_reference"></a><code>range_reference<X>::type</code></td>
 <td><code>boost::iterator_reference<range_iterator<X>::type>::type</code>
 </td>
 <td>compile time</td>
 </tr>

 <tr>
- <a name="range_pointer"></a>
- <td><code>range_pointer<X>::type</code></td>
+
+ <td><a name="range_pointer"></a><code>range_pointer<X>::type</code></td>
 <td><code>boost::iterator_pointer<range_iterator<X>::type>::type</code>
 </td>
 <td>compile time</td>
 </tr>

 <tr>
- <a name="range_category"></a>
- <td><code>range_category<X>::type</code></td>
+
+ <td><a name="range_category"></a><code>range_category<X>::type</code></td>
 <td><code>boost::iterator_category<range_iterator<X>::type>::type</code>
 </td>
 <td>compile time</td>
 </tr>
 <tr>
- <a name="range_difference"></a>
- <td><code>range_difference<X>::type</code></td>
+
+ <td><a name="range_difference"></a><code>range_difference<X>::type</code></td>
 <td>
 <code>boost::iterator_difference<range_iterator<X>::type>::type</code></td>

 <td>compile time</td>
 </tr>
- </tr>

 <tr>
- <a name="range_reverse_iterator"></a>
- <td><code>range_reverse_iterator<X>::type</code></td>
+
+ <td><a name="range_reverse_iterator"></a><code>range_reverse_iterator<X>::type</code></td>
 <td><code>boost::reverse_iterator<range_iterator<X>::type></code> 
 <td>compile time</td>
 </tr>
 <tr>
- <a name="range_const_reverse_iterator"></a>
- <td><code>range_reverse_iterator<const X>::type</code></td>
+
+ <td><a name="range_const_reverse_iterator"></a><code>range_reverse_iterator<const X>::type</code></td>
 <td><code>boost::reverse_iterator<range_iterator<const X>::type></code>
 
 <td>compile time</td>
@@ -346,11 +345,11 @@
 Complexity</th>
 </tr>
 <tr>
- <a name="begin"></a>
- <td><code>begin(x)</code></td>
+
+ <td><a name="begin"></a><code>begin(x)</code></td>
 <td><code>range_iterator<X>::type</code></td>
 <td>
- <code>p.first</code> if <code>p</code> is of type <code>std::pair&ltT><code> 
+ <code>p.first</code> if <code>p</code> is of type <code>std::pair<T><code> 
 <code>a</code> if <code>a</code> is an array 
 <code>range_begin(x)</code> if that expression would invoke a function found by ADL 
 <code>t.begin()</code> otherwise
@@ -358,11 +357,11 @@
 <td>constant time</td>
 </tr>
 <tr>
- <a name="end"></a>
- <td><code>end(x)</code></td>
+
+ <td><a name="end"></a><code>end(x)</code></td>
 <td><code>range_iterator<X>::type</code></td>
 <td>
- <code>p.second</code> if <code>p</code> is of type <code>std::pair&ltT><code> 
+ <code>p.second</code> if <code>p</code> is of type <code>std::pair<T><code> 
 <code>a + sz</code> if <code>a</code> is an array of size <code>sz</code>

 
@@ -373,16 +372,16 @@
 constant time </td>
 </tr>
 <tr>
- <a name="empty"></a>
- <td><code>empty(x)</code></td>
+
+ <td><a name="empty"></a><code>empty(x)</code></td>
 <td><code>bool</code></td>
 <td><code>boost::begin(x) == boost::end(x)</code> 
 <td> constant time 
 </td>
 </tr>
 <tr>
- <a name="distance"></a>
- <td><code>distance(x)</code></td>
+
+ <td><a name="distance"></a><code>distance(x)</code></td>
 <td><code>range_difference<X>::type</code></td>
 <td>
 <code>
@@ -394,16 +393,16 @@
 </tr>

 <tr>
- <a name="size"></a>
- <td><code>size(x)</code></td>
+
+ <td><a name="size"></a><code>size(x)</code></td>
 <td><code>range_difference<X>::type</code></td>
 <td><code> boost::end(x) - boost::begin(x)</code>

 <td> constant time </td>
 </tr>
 <tr>
- <a name="rbegin"></a>
- <td><code>rbegin(x)</code></td>
+
+ <td><a name="rbegin"></a><code>rbegin(x)</code></td>
 <td><code>range_reverse_iterator<X>::type</code></td>
 <td><code>range_reverse_iterator<X>::type( boost::end(x) )</code>
 
@@ -411,15 +410,15 @@
 </td>
 </tr>
 <tr>
- <a name="rend"></a>
- <td><code>rend(x)</code></td>
+
+ <td> <a name="rend"></a><code>rend(x)</code></td>
 <td><code>range_reverse_iterator<X>::type</code></td>
 <td><code>range_reverse_iterator<X>::type( boost::begin(x) )</code>
 <td>constant time</td>
 </tr>
 <tr>
- <a name="const_begin"></a>
- <td><code>const_begin(x)</code></td>
+
+ <td><a name="const_begin"></a><code>const_begin(x)</code></td>
 <td><code>range_iterator<const X>::type</code></td>
 <td><code>range_iterator<const X>::type( boost::begin(x) )</code>
 
@@ -427,15 +426,15 @@
 </td>
 </tr>
 <tr>
- <a name="const_end"></a>
- <td><code>const_end(x)</code></td>
+
+ <td><a name="const_end"></a><code>const_end(x)</code></td>
 <td><code>range_iterator<const X>::type</code></td>
 <td><code>range_iterator<const X>::type( boost::end(x) )</code>
 <td>constant time</td>
 </tr>
 <tr>
- <a name="const_rbegin"></a>
- <td><code>const_rbegin(x)</code></td>
+
+ <td><a name="const_rbegin"></a><code>const_rbegin(x)</code></td>
 <td><code>range_reverse_iterator<const X>::type</code></td>
 <td><code>range_reverse_iterator<const X>::type( boost::rbegin(x) )</code>
 
@@ -443,16 +442,16 @@
 </td>
 </tr>
 <tr>
- <a name="const_rend"></a>
- <td><code>const_rend(x)</code></td>
+
+ <td><a name="const_rend"></a><code>const_rend(x)</code></td>
 <td><code>range_reverse_iterator<const X>::type</code></td>
 <td><code>range_reverse_iterator<const X>::type( boost::rend(x) )</code>

 <td>constant time</td>
 </tr>
 <tr>
- <a name="as_literal"></a>
- <td><code>as_literal(x)</code></td>
+
+ <td><a name="as_literal"></a><code>as_literal(x)</code></td>
 <td><code>iterator_range</code> where <code>U</code> is
 <code>Char*</code> if <code>x</code> is a pointer to a
 string and <code>U</code> is
@@ -460,20 +459,21 @@
 </td>
 <td>

- <code>[a,a+sz-1)</code> if <code>a</code> is an array of size <code>sz</code> 
- <code>[s,s + std::char_traits<X>::length(s))</code> if <code>s</code> is a <code>Char*</code>
+ 
+ <code>[s,s + std::char_traits<X>::length(s))</code> if <code>s</code> is a <code>Char*</code> or an array of <code>Char</code>
 
 <code>[boost::begin(x),boost::end(x))</code> otherwise


 </td>
- <td>linear time for pointers to a string, constant time
- otherwise</td>
+ <td>linear time for pointers to a string or arrays of
+ <code>Char</code>, constant time otherwise</td>
 </tr>
 <tr>
- <a name="as_array"></a>
- <td><code>as_array(x)</code></td>
+
+ <td><a name="as_array"></a><code>as_array(x)</code></td>
 <td><code>iterator_range<X></code> </td>
 <td>
 <code>[boost::begin(x),boost::end(x))</code>
@@ -561,7 +561,7 @@
 Member type</th>
 <th>
 Related concept</th>
- <tr>
+ </tr>
 <tr>
 <td><code>iterator</code></td>
 <td>Single Pass Range</td>

Modified: branches/CMake/release/libs/range/doc/examples.html
==============================================================================
--- branches/CMake/release/libs/range/doc/examples.html (original)
+++ branches/CMake/release/libs/range/doc/examples.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -23,16 +23,16 @@
 <ul >
 <li >
 <a href="../test/string.cpp" target="_self" ><code >string.cpp</code></a>
- </li>
+
 shows how to implement a container version of <code >std::find()</code> that
 works with <code >char[],wchar_t[],char*,wchar_t*.</code>
-
+ </li>
 <li >
 <a href="../test/algorithm_example.cpp" target="_self" ><code >algorithm_example.cpp</code></a>

- </li>
+
 shows the replace example from the introduction.
-
+ </li>
 <li> iterator_range.cpp
 <li> sub_range.cpp
 <li> iterator_pair.cpp

Modified: branches/CMake/release/libs/range/doc/faq.html
==============================================================================
--- branches/CMake/release/libs/range/doc/faq.html (original)
+++ branches/CMake/release/libs/range/doc/faq.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -22,7 +22,7 @@
 <li >
 Why is there no difference between <code >range_iterator<C>::type</code>
 and <code >range_const_iterator<C>::type</code> for <code>std::pair<iterator, iterator></code>.
- </li>
+
 
 In general it is not possible nor desirable to find a corresponding <code >const_iterator</code>.
 When it is possible to come up with one, the client might choose to construct a <code >std::pair<const_iterator,const_iterator></code>
@@ -33,7 +33,7 @@
 is somewhat more convenient than a <code>pair</code> and that a <a
 href="utility_class.html#sub_range"><code>sub_range</code></a> does
 propagate const-ness. 
-
+ </li>
 <li >
 Why is there not supplied more types or more functions?

Modified: branches/CMake/release/libs/range/doc/headers.html
==============================================================================
--- branches/CMake/release/libs/range/doc/headers.html (original)
+++ branches/CMake/release/libs/range/doc/headers.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -167,7 +167,7 @@
 </tr>

 </table>
-

Modified: branches/CMake/release/libs/range/doc/history_ack.html
==============================================================================
--- branches/CMake/release/libs/range/doc/history_ack.html (original)
+++ branches/CMake/release/libs/range/doc/history_ack.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -19,9 +19,9 @@
 <h2 >History and Acknowledgement</h2><a name="History" ></a>
 
 The library was under way for a long time. Dietmar Kühl originally intended
- to submit an <code>array_traits</code> class template which had most of
+ to submit an <code >array_traits</code> class template which had most of
 the functionality present now, but only for arrays and standard containers.
- I believe this was back in 2001 or 2002.
+ I believe this was back in 2001 or 2002.

Modified: branches/CMake/release/libs/range/doc/intro.html
==============================================================================
--- branches/CMake/release/libs/range/doc/intro.html (original)
+++ branches/CMake/release/libs/range/doc/intro.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -24,7 +24,7 @@
 to a somewhat clumsy use of the algorithms with redundant specification
 of container names. Therefore we would like to raise the abstraction level
 for algorithms so they specify their interface in terms of <a
- href=range.html>Ranges</a> as much as possible.
+ href="range.html">Ranges</a> as much as possible.
 

 
@@ -108,7 +108,7 @@
 
 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";

Modified: branches/CMake/release/libs/range/doc/portability.html
==============================================================================
--- branches/CMake/release/libs/range/doc/portability.html (original)
+++ branches/CMake/release/libs/range/doc/portability.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -29,9 +29,8 @@
 template partial specialization. For non-conforming compilers there might be a
 chance that it works anyway thanks to workarounds in the type traits library.
 
- <pp>
- 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.

Modified: branches/CMake/release/libs/range/doc/range.html
==============================================================================
--- branches/CMake/release/libs/range/doc/range.html (original)
+++ branches/CMake/release/libs/range/doc/range.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -1,3 +1,4 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>


 <hr>
- <a name="single_pass_range">
+ <a name="single_pass_range"></a>
 <H2>Single Pass Range</H2>

 <h3>Notation</h3>
@@ -227,7 +228,7 @@


 <hr>
- <a name=forward_range><h2>Forward Range</h2>
+ <a name=forward_range></a><h2>Forward Range</h2>

 <h3>Notation</h3>
 <Table>
@@ -255,7 +256,7 @@

 <hr>

- <a name="bidirectional_range"><h2>Bidirectional Range</h2>
+ <a name="bidirectional_range"></a><h2>Bidirectional Range</h2>

 <h3>Notation</h3>
 <Table>
@@ -283,7 +284,8 @@

 <hr>

- <a name=random_access_range><h2>Random Access Range</h2> <h3>Description</h3>
+ <a name=random_access_range></a><h2>Random Access Range</h2>
+ <h3>Description</h3>
 
 A range <code>X</code> where <code>boost::range_iterator<X>::type</code> is a model
of <a
@@ -299,10 +301,10 @@

 <hr>

- <a name=concept_checking><h2>Concept Checking</h2>
+ <a name=concept_checking></a><h2>Concept Checking</h2>

 Each of the range concepts has a corresponding concept checking
- class in the file <code><boost/range/concepts.hpp></codE>. These classes may be
+ class in the file <code><boost/range/concepts.hpp></code>. These classes may be
 used in conjunction with the <a
 href="../../concept_check/concept_check.htm">Boost Concept
 Check</a> library to insure that the type of a template parameter

Modified: branches/CMake/release/libs/range/doc/style.html
==============================================================================
--- branches/CMake/release/libs/range/doc/style.html (original)
+++ branches/CMake/release/libs/range/doc/style.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -53,7 +53,7 @@
 <a href="range.html#bidirectional_range">Bidirectional Range</a> <li>
 <a href="range.html#random_access_range">Random Access Range</a> </ul>
 </ul>
- Notice how we have used the categories from the <a href=../../iterator/doc/new-iter-concepts.html>new
+ Notice how we have used the categories from the <a href="../../iterator/doc/new-iter-concepts.html">new
 style iterators</a>.

Modified: branches/CMake/release/libs/range/doc/utility_class.html
==============================================================================
--- branches/CMake/release/libs/range/doc/utility_class.html (original)
+++ branches/CMake/release/libs/range/doc/utility_class.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -27,10 +27,9 @@

 <ul>
 <li>
- Class <a href=#iter_range><code>iterator_range</code></a>
+ Class iterator_range
 <li>
- Class <a href=#sub_range><code>sub_range</code></a>
- </ul>
+ Class sub_range
 </ul>

 The <code>iterator_range</code> class is templated on a <a
@@ -84,7 +83,7 @@
 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 @@
 operator unspecified_bool_type() const;
 bool equal( const iterator_range& ) ( const iterator_range& ) const;
 reference front() const;
 reference back() const;
@@ -119,7 +118,7 @@
 // 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 @@
 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 @@
 typename range_difference<Range>::type advance_begin,
 typename range_difference<Range>::type advance_end );

- // convenience
+ // convenience
 template< class Sequence, class ForwardRange >
 Sequence <a href="#copy_range">copy_range</a>( 
<a name="equal"></a>
-<code>bool equal( iterator_range& r ) const;</code>
+<code>bool equal( iterator_range& r ) const;</code>
<blockquote>
- Returns <code>begin() == r.begin() && end() == r.end();</code>
+ Returns <code>begin() == r.begin() && end() == r.end();</code>
</blockquote>


@@ -236,21 +235,21 @@


<a name="comparison"></a>
-<code>bool operator==( const ForwardRange1& l, const ForwardRange2& r );</code>
+<code>bool operator==( const ForwardRange1& l, const ForwardRange2& r );</code>
<blockquote>
 Returns <code>size(l) != size(r) ? false : std::equal( begin(l), end(l), begin(r) );</code> </blockquote> 
-<code>bool operator!=( const ForwardRange1& l, const ForwardRange2& r );</code>
+<code>bool operator!=( const ForwardRange1& l, const ForwardRange2& r );</code>
<blockquote>
 Returns <code>!( l == r );</code>
</blockquote>
-<code>bool operator<( const ForwardRange1& l, const ForwardRange2& r );</code>
+<code>bool operator<( const ForwardRange1& l, const ForwardRange2& r );</code>
<blockquote>
 Returns <code>std::lexicographical_compare( begin(l), end(l), begin(r), end(r) );</code> </blockquote>


<a name="make_iterator_range"></a>
<pre>
-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 );
</pre>
@@ -266,7 +265,7 @@
</blockquote>

<a name="copy_range"></a>
-<code>Sequence copy_range( const ForwardRange& r );</code>
+<code>Sequence copy_range( const ForwardRange& r );</code>
<blockquote>
 Returns <code>Sequence( begin(r), end(r) );</code>
</blockquote>
@@ -292,7 +291,7 @@
 class sub_range : public iterator_range< typename range_iterator<ForwardRange>::type >
 {
 public: 
- typedef typename range_iterator<ForwardRange<spanclass=special>>::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;

@@ -329,7 +328,7 @@
 const value_type& operator[]( difference_type at ) const;

 public:
- // rest of interface inherited from <a href=#iter_range><code>iterator_range</code></a>
+ // rest of interface inherited from iterator_range
 };
 
} // namespace 'boost'

Modified: branches/CMake/release/libs/range/index.html
==============================================================================
--- branches/CMake/release/libs/range/index.html (original)
+++ branches/CMake/release/libs/range/index.html 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -22,7 +22,7 @@
 
 
 Use, modification and distribution is subject to the Boost Software License, Version 1.0
- (see <a href=http://www.boost.org/LICENSE_1_0.txt>
+ (see <a href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>).
 

@@ -34,7 +34,7 @@
 

 <ul>
- <li> Introduction </code>
+ <li> Introduction

 <li>Range concepts:
 <ul>

Modified: branches/CMake/release/libs/range/test/CMakeLists.txt
==============================================================================
--- branches/CMake/release/libs/range/test/CMakeLists.txt (original)
+++ branches/CMake/release/libs/range/test/CMakeLists.txt 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -1,3 +1,4 @@
+message(STATUS "libs/range/test: need -Wall -Wunused here when under gcc")
boost_test_run(array DEPENDS boost_unit_test_framework)
boost_test_run(iterator_pair DEPENDS boost_unit_test_framework)
boost_test_run(std_container DEPENDS boost_unit_test_framework)

Modified: branches/CMake/release/libs/range/test/Jamfile.v2
==============================================================================
--- branches/CMake/release/libs/range/test/Jamfile.v2 (original)
+++ branches/CMake/release/libs/range/test/Jamfile.v2 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -12,9 +12,9 @@
{
 return [
 run $(name).cpp /boost/test//boost_unit_test_framework/<link>static
+ :
 :
- :
- : $(includes)
+ : <toolset>gcc:<cxxflags>"-Wall -Wunused "
 ] ;
}

Modified: branches/CMake/release/libs/range/test/partial_workaround.cpp
==============================================================================
--- branches/CMake/release/libs/range/test/partial_workaround.cpp (original)
+++ branches/CMake/release/libs/range/test/partial_workaround.cpp 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -10,6 +10,8 @@

#include <boost/config.hpp>
#include <boost/detail/workaround.hpp>
+#include <boost/range/detail/implementation_help.hpp>
+#include <boost/test/test_tools.hpp>

#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
# pragma warn -8091 // supress warning in Boost.Test
@@ -30,7 +32,6 @@

#include <boost/static_assert.hpp>
#include <boost/type_traits.hpp>
-#include <boost/test/test_tools.hpp>
#include <iostream>
#include <vector>

@@ -91,6 +92,11 @@

void check_partial_workaround()
{
+ //
+ // test if warnings are generated
+ //
+ std::size_t s = boost::range_detail::array_size( "foo" );
+ BOOST_CHECK_EQUAL( s, 4u );
}

#endif

Modified: branches/CMake/release/libs/range/test/string.cpp
==============================================================================
--- branches/CMake/release/libs/range/test/string.cpp (original)
+++ branches/CMake/release/libs/range/test/string.cpp 2008-06-29 11:46:33 EDT (Sun, 29 Jun 2008)
@@ -137,14 +137,7 @@
 BOOST_CHECK_EQUAL( str_end( char_s ), str_end1 );
 BOOST_CHECK_EQUAL( str_empty( char_s ), (char_s == 0 || char_s[0] == char()) );
 BOOST_CHECK_EQUAL( sz, std::char_traits<char>::length( char_s ) );
-/*
- BOOST_CHECK_EQUAL( str_begin( char_s2 ), char_s2 );
- std::size_t sz2 = size( char_s2 );
- const char* str_end12 = str_begin( char_s2 ) + sz;
- BOOST_CHECK_EQUAL( str_end( char_s2 ), str_end12 );
- BOOST_CHECK_EQUAL( empty( char_s2 ), (char_s2 == 0 || char_s2[0] == char()) );
- BOOST_CHECK_EQUAL( sz2, std::char_traits<char>::length( char_s2 ) );
-*/
+
 BOOST_CHECK_EQUAL( str_begin( my_string ), my_string );
 range_iterator<char_array_t>::type str_end2 = str_begin( my_string ) + str_size(my_string);
 range_iterator<char_array_t>::type str_end3 = str_end(my_string);
@@ -165,6 +158,20 @@

 BOOST_CHECK( find_const( as_array( my_string ), to_search ) != str_end(my_string) );
 BOOST_CHECK( find_const( as_array( my_const_string ), to_search ) != str_end(my_string) );
+
+ //
+ // Test that as_literal() always scan for null terminator
+ //
+ char an_array[] = "foo\0bar";
+ BOOST_CHECK_EQUAL( str_begin( an_array ), an_array );
+ BOOST_CHECK_EQUAL( str_end( an_array ), an_array + 3 );
+ BOOST_CHECK_EQUAL( str_size( an_array ), 3 );
+
+ const char a_const_array[] = "foobar\0doh";
+ BOOST_CHECK_EQUAL( str_begin( a_const_array ), a_const_array );
+ BOOST_CHECK_EQUAL( str_end( a_const_array ), a_const_array + 6 );
+ BOOST_CHECK_EQUAL( str_size( a_const_array ), 6 );
+
}

@@ -172,9 +179,6 @@
void check_string()
{
 check_char();
-// check_char<volatile char>();
-// check_char<const char>();
-// check_char<const volatile char>();

#ifndef BOOST_NO_STD_WSTRING
 typedef wchar_t* wchar_iterator_t;
@@ -197,13 +201,7 @@
 BOOST_CHECK_EQUAL( str_end(char_ws), (str_begin( char_ws ) + sz) );
 BOOST_CHECK_EQUAL( str_empty( char_ws ), (char_ws == 0 || char_ws[0] == wchar_t()) );
 BOOST_CHECK_EQUAL( sz, std::char_traits<wchar_t>::length( char_ws ) );
- /*
- std::size_t sz2 = size( char_ws2 );
- BOOST_CHECK_EQUAL( str_begin( char_ws2 ), char_ws2 );
- BOOST_CHECK_EQUAL( str_end( char_ws2 ), (begin( char_ws2 ) + sz2) );
- BOOST_CHECK_EQUAL( empty( char_ws2 ), (char_ws2 == 0 || char_ws2[0] == wchar_t()) );
- BOOST_CHECK_EQUAL( sz2, std::char_traits<wchar_t>::length( char_ws2 ) );
- */
+
 wchar_t to_search = L'n';
 BOOST_CHECK( find( char_ws, to_search ) != str_end(char_ws) );

Next message: troy_at_[hidden]: "[Boost-commit] svn:boost r46861 - branches/CMake/release/libs/tuple/test"
Previous message: troy_at_[hidden]: "[Boost-commit] svn:boost r46859 - branches/CMake/release/libs/lambda/test"

Date view	Thread view	Subject view	Author view

Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk