forked from boostorg/range
@ -558,7 +558,7 @@ namespace boost
|
||||
}
|
||||
|
||||
// If this is a non-null iterator then we need to put
|
||||
// a clone of this iterators impementation into the other
|
||||
// a clone of this iterators implementation into the other
|
||||
// iterator.
|
||||
// We can't just swap because of the small buffer optimization.
|
||||
if (m_impl)
|
||||
|
8
include/boost/range/detail/collection_traits_detail.hpp
Executable file → Normal file
8
include/boost/range/detail/collection_traits_detail.hpp
Executable file → Normal file
@ -208,7 +208,7 @@ namespace boost {
|
||||
|
||||
// array traits ( no partial specialization )
|
||||
/*
|
||||
without parial specialization we are able to
|
||||
without partial specialization we are able to
|
||||
provide support only for a limited number of
|
||||
types. Currently the primitive numeric types
|
||||
are supported
|
||||
@ -324,14 +324,14 @@ namespace boost {
|
||||
|
||||
#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
|
||||
|
||||
// array lenght resolving
|
||||
// array length resolving
|
||||
/*
|
||||
Lenght of string contained in a static array could
|
||||
be different from the size of the array.
|
||||
For string processing we need the lenght without
|
||||
For string processing we need the length without
|
||||
terminating 0.
|
||||
|
||||
Therefore, the lenght is calulated for char and wchar_t
|
||||
Therefore, the length is calculated for char and wchar_t
|
||||
using char_traits, rather then simply returning
|
||||
the array size.
|
||||
*/
|
||||
|
2
include/boost/range/empty.hpp
Executable file → Normal file
2
include/boost/range/empty.hpp
Executable file → Normal file
@ -28,7 +28,7 @@ namespace boost
|
||||
return boost::begin( r ) == boost::end( r );
|
||||
}
|
||||
|
||||
} // namepace 'boost'
|
||||
} // namespace 'boost'
|
||||
|
||||
|
||||
#endif
|
||||
|
@ -100,7 +100,7 @@ namespace boost
|
||||
// While this design is less performant than some less
|
||||
// safe alternatives, the use of ranges and iterators to
|
||||
// perform counting will never be optimal anyhow, hence
|
||||
// if optimal performance is desired a handcoded loop
|
||||
// if optimal performance is desired a hand-coded loop
|
||||
// is the solution.
|
||||
template<typename Integer>
|
||||
class integer_iterator_with_step
|
||||
|
4
include/boost/range/iterator_range_io.hpp
Executable file → Normal file
4
include/boost/range/iterator_range_io.hpp
Executable file → Normal file
@ -48,7 +48,7 @@ namespace boost
|
||||
|
||||
//! iterator_range output operator
|
||||
/*!
|
||||
Output the range to an ostream. Elements are outputed
|
||||
Output the range to an ostream. Elements are outputted
|
||||
in a sequence without separators.
|
||||
*/
|
||||
template< typename IteratorT, typename Elem, typename Traits >
|
||||
@ -67,7 +67,7 @@ namespace boost
|
||||
|
||||
//! iterator_range output operator
|
||||
/*!
|
||||
Output the range to an ostream. Elements are outputed
|
||||
Output the range to an ostream. Elements are outputted
|
||||
in a sequence without separators.
|
||||
*/
|
||||
template< typename IteratorT >
|
||||
|
Reference in New Issue
Block a user