boostorg/algorithm
1
0
Fork 1
mirror of https://github.com/boostorg/algorithm.git synced 2025-07-06 09:16:33 +02:00
Code Issues Packages Projects Releases Wiki Activity

Spellchecker applied

Browse Source 
[SVN r23562]
This commit is contained in:
Pavol Droba
2004-07-14 22:24:12 +00:00
parent dd8d053685
commit cc683155c7
14 changed files with 136 additions and 136 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
include/boost/algorithm/string/case_conv.hpp
View File

@ -41,9 +41,9 @@ namespace boost {
An output iterator pointing just after last inserted character or An output iterator pointing just after last inserted character or
a copy of the input a copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename OutputIteratorT, typename CollectionT> template<typename OutputIteratorT, typename CollectionT>
inline OutputIteratorT inline OutputIteratorT
@ -116,9 +116,9 @@ namespace boost {
An output iterator pointing just after last inserted character or An output iterator pointing just after last inserted character or
a copy of the input a copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename OutputIteratorT, typename CollectionT> template<typename OutputIteratorT, typename CollectionT>
inline OutputIteratorT inline OutputIteratorT

8
include/boost/algorithm/string/collection_traits.hpp
View File

@ -17,8 +17,8 @@
// "as is" without express or implied warranty, and with no claim as // "as is" without express or implied warranty, and with no claim as
// to its suitability for any purpose. // to its suitability for any purpose.
// Orignal idea of container traits was proposed by Jeremy Siek and // Original idea of container traits was proposed by Jeremy Siek and
// Thorsten Ottosen. This implemenetation is lightweighted version // Thorsten Ottosen. This implementation is lightweighted version
// of container_traits adapter for usage with string_algo library // of container_traits adapter for usage with string_algo library
#ifndef BOOST_STRING_COLLECTION_TRAITS_HPP #ifndef BOOST_STRING_COLLECTION_TRAITS_HPP
@ -104,7 +104,7 @@ namespace boost {
//! Const iterator type //! Const iterator type
typedef BOOST_STRING_TYPENAME typedef BOOST_STRING_TYPENAME
container_helper_type::const_iterator const_iterator; container_helper_type::const_iterator const_iterator;
//! Result iterator type ( iterator of const_iterator, depending on the constness of the conainer ) //! Result iterator type ( iterator of const_iterator, depending on the constness of the container )
typedef BOOST_STRING_TYPENAME typedef BOOST_STRING_TYPENAME
container_helper_type::result_iterator result_iterator; container_helper_type::result_iterator result_iterator;
//! Difference type //! Difference type
@ -117,7 +117,7 @@ namespace boost {
//! Container value_type trait //! Container value_type trait
/*! /*!
Extract the type of elements conained in a container Extract the type of elements contained in a container
*/ */
template< typename C > template< typename C >
struct value_type_of struct value_type_of

46
include/boost/algorithm/string/erase.hpp
View File

@ -19,7 +19,7 @@
/*! \file /*! \file
Defines various erase algorithms. Each algorithm removes Defines various erase algorithms. Each algorithm removes
a part(s) of the input according to a searching criterium. a part(s) of the input according to a searching criteria.
*/ */
namespace boost { namespace boost {
@ -38,9 +38,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename OutputIteratorT, typename CollectionT> template<typename OutputIteratorT, typename CollectionT>
inline OutputIteratorT erase_range_copy( inline OutputIteratorT erase_range_copy(
@ -109,9 +109,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
@ -180,9 +180,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -252,9 +252,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
@ -323,9 +323,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
@ -398,9 +398,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -473,9 +473,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -551,9 +551,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -621,9 +621,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -695,9 +695,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -765,9 +765,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,

32
include/boost/algorithm/string/find.hpp
View File

@ -64,9 +64,9 @@ namespace boost {
\c CollectionT::const_iterator, depending on the constness of \c CollectionT::const_iterator, depending on the constness of
the input parameter. the input parameter.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T> template<typename Collection1T, typename Collection2T>
inline iterator_range< inline iterator_range<
@ -93,9 +93,9 @@ namespace boost {
\c Collection1T::const_iterator, depending on the constness of \c Collection1T::const_iterator, depending on the constness of
the input parameter. the input parameter.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T> template<typename Collection1T, typename Collection2T>
inline iterator_range< inline iterator_range<
@ -123,9 +123,9 @@ namespace boost {
\c Collection1T::const_iterator, depending on the constness of \c Collection1T::const_iterator, depending on the constness of
the input parameter. the input parameter.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T> template<typename Collection1T, typename Collection2T>
inline iterator_range< inline iterator_range<
@ -152,9 +152,9 @@ namespace boost {
\c Collection1T::const_iterator, depending on the constness of \c Collection1T::const_iterator, depending on the constness of
the input parameter. the input parameter.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T> template<typename Collection1T, typename Collection2T>
inline iterator_range< inline iterator_range<
@ -212,9 +212,9 @@ namespace boost {
the input parameter. the input parameter.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T> template<typename Collection1T, typename Collection2T>
inline iterator_range< inline iterator_range<
@ -245,9 +245,9 @@ namespace boost {
\c Collection1T::const_iterator, depending on the constness of \c Collection1T::const_iterator, depending on the constness of
the input parameter. the input parameter.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename CollectionT> template<typename CollectionT>
inline iterator_range< inline iterator_range<
@ -277,9 +277,9 @@ namespace boost {
the input parameter. the input parameter.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename CollectionT> template<typename CollectionT>
inline iterator_range< inline iterator_range<
@ -309,9 +309,9 @@ namespace boost {
\c CollectionT::const_iterator, depending on the constness of \c CollectionT::const_iterator, depending on the constness of
the input parameter. the input parameter.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename CollectionT, typename PredicateT> template<typename CollectionT, typename PredicateT>
inline iterator_range< inline iterator_range<

8
include/boost/algorithm/string/find_format.hpp
View File

@ -43,9 +43,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -156,9 +156,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,

2
include/boost/algorithm/string/finder.hpp
View File

@ -19,7 +19,7 @@
/*! \file /*! \file
Defines Finder generators. Finder object is a functor which is able to Defines Finder generators. Finder object is a functor which is able to
find a substring matching a specific criterium in the input. find a substring matching a specific criteria in the input.
Finders are used as a pluggable components for replace, find Finders are used as a pluggable components for replace, find
and split facilities. This header contains generator functions and split facilities. This header contains generator functions
for finders provided in this library. for finders provided in this library.

2
include/boost/algorithm/string/iter_find.hpp
View File

@ -23,7 +23,7 @@
/*! \file /*! \file
Defines generic split algorithms. Split algorithms can be Defines generic split algorithms. Split algorithms can be
used to divide a sequence into several part according used to divide a sequence into several part according
to a given criterium. Result is given as a 'container to a given criteria. Result is given as a 'container
of containers' where elements are copies or references of containers' where elements are copies or references
to extracted parts. to extracted parts.

38
include/boost/algorithm/string/predicate.hpp
View File

@ -24,7 +24,7 @@
In addition the algorithm \c all() checks all elements of a container to satisfy a In addition the algorithm \c all() checks all elements of a container to satisfy a
condition. condition.
All predicates provide strong exception guarantie if input parameters satisfy All predicates provide strong exception guarantee if input parameters satisfy
second assumption about exception safety. second assumption about exception safety.
*/ */
@ -45,9 +45,9 @@ namespace boost {
\param Comp An element comparison predicate \param Comp An element comparison predicate
\return A result of the test \return A result of the test
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T, typename PredicateT> template<typename Collection1T, typename Collection2T, typename PredicateT>
inline bool starts_with( inline bool starts_with(
@ -99,9 +99,9 @@ namespace boost {
\param Loc a locale used for case insensitive comparison \param Loc a locale used for case insensitive comparison
\return A result of the test \return A result of the test
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T> template<typename Collection1T, typename Collection2T>
inline bool istarts_with( inline bool istarts_with(
@ -128,9 +128,9 @@ namespace boost {
\param Comp An element comparison predicate \param Comp An element comparison predicate
\return A result of the test \return A result of the test
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T, typename PredicateT> template<typename Collection1T, typename Collection2T, typename PredicateT>
inline bool ends_with( inline bool ends_with(
@ -177,9 +177,9 @@ namespace boost {
\param Loc a locale used for case insensitive comparison \param Loc a locale used for case insensitive comparison
\return A result of the test \return A result of the test
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T> template<typename Collection1T, typename Collection2T>
inline bool iends_with( inline bool iends_with(
@ -203,9 +203,9 @@ namespace boost {
\param Comp An element comparison predicate \param Comp An element comparison predicate
\return A result of the test \return A result of the test
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T, typename PredicateT> template<typename Collection1T, typename Collection2T, typename PredicateT>
inline bool contains( inline bool contains(
@ -244,9 +244,9 @@ namespace boost {
\param Loc a locale used for case insensitive comparison \param Loc a locale used for case insensitive comparison
\return A result of the test \return A result of the test
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T> template<typename Collection1T, typename Collection2T>
inline bool icontains( inline bool icontains(
@ -273,9 +273,9 @@ namespace boost {
\note This is two-way version of \c std::equal algorithm \note This is two-way version of \c std::equal algorithm
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T, typename PredicateT> template<typename Collection1T, typename Collection2T, typename PredicateT>
inline bool equals( inline bool equals(
@ -329,9 +329,9 @@ namespace boost {
\note This is two-way version of \c std::equal algorithm \note This is two-way version of \c std::equal algorithm
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename Collection1T, typename Collection2T> template<typename Collection1T, typename Collection2T>
inline bool iequals( inline bool iequals(
@ -353,9 +353,9 @@ namespace boost {
\param Pred A predicate \param Pred A predicate
\return A result of the test \return A result of the test
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename CollectionT, typename PredicateT> template<typename CollectionT, typename PredicateT>
inline bool all( inline bool all(

32
include/boost/algorithm/string/regex.hpp
View File

@ -41,9 +41,9 @@ namespace boost {
\c InputContainerT::const_iterator, depending on the constness of \c InputContainerT::const_iterator, depending on the constness of
the input parameter. the input parameter.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename CollectionT, typename CollectionT,
@ -77,9 +77,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -165,9 +165,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -252,9 +252,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -333,9 +333,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -420,9 +420,9 @@ namespace boost {
\note Prior content of the result will be overridden. \note Prior content of the result will be overridden.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety and result's container swap() method have strong exception guarantie, about exception safety and result's container swap() method have strong exception guarantee,
this function provides strong exception guarantie. this function provides strong exception guarantee.
*/ */
template< template<
typename SequenceSequenceT, typename SequenceSequenceT,
@ -463,9 +463,9 @@ namespace boost {
\note Prior content of the result will be overridden. \note Prior content of the result will be overridden.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety and result's container swap() method have strong exception guarantie, about exception safety and result's container swap() method have strong exception guarantee,
this function provides strong exception guarantie. this function provides strong exception guarantee.
*/ */
template< template<
typename SequenceSequenceT, typename SequenceSequenceT,

46
include/boost/algorithm/string/replace.hpp
View File

@ -20,7 +20,7 @@
/*! \file /*! \file
Defines various replace algorithms. Each algorithm replaces Defines various replace algorithms. Each algorithm replaces
a part(s) of the input according to a searching and a replace criterium. a part(s) of the input according to a searching and a replace criteria.
*/ */
namespace boost { namespace boost {
@ -41,9 +41,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -121,9 +121,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -198,9 +198,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
@ -279,9 +279,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -356,9 +356,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -438,9 +438,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -520,9 +520,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -604,9 +604,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -682,9 +682,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -764,9 +764,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,
@ -842,9 +842,9 @@ namespace boost {
\return An output iterator pointing just after last inserted character or \return An output iterator pointing just after last inserted character or
a modified copy of the input a modified copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, second variant of this function provides strong about exception safety, second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template< template<
typename OutputIteratorT, typename OutputIteratorT,

4
include/boost/algorithm/string/sequence_traits.hpp
View File

@ -23,7 +23,7 @@
function. function.
Due to language restriction, it is not currently possible to define specialization for Due to language restriction, it is not currently possible to define specialization for
stl containers without including the coresponding header. To decrease the overhead stl containers without including the corresponding header. To decrease the overhead
needed by this inclusion, user can selectively include specialization needed by this inclusion, user can selectively include specialization
header for a specific container. They are located in boost/algorithm/string/stl header for a specific container. They are located in boost/algorithm/string/stl
directory. Alternatively she can include boost/algorithm/string/std_collection_traits.hpp directory. Alternatively she can include boost/algorithm/string/std_collection_traits.hpp
@ -52,7 +52,7 @@ namespace boost {
Declare an override of this tester function with return Declare an override of this tester function with return
type boost::string_algo::yes_type for a sequence with this property. type boost::string_algo::yes_type for a sequence with this property.
\return yes_type if the seqeunce's insert/replace/erase methods do not invalidate \return yes_type if the sequence's insert/replace/erase methods do not invalidate
existing iterators. existing iterators.
*/ */
no_type has_stable_iterators_tester(...); no_type has_stable_iterators_tester(...);

20
include/boost/algorithm/string/split.hpp
View File

@ -20,7 +20,7 @@
/*! \file /*! \file
Defines basic split algorithms. Defines basic split algorithms.
Split algorithms can be used to divide a string Split algorithms can be used to divide a string
into several parts according to a given criterium. into several parts according to a given criteria.
Each part is copied and added as a new element to the Each part is copied and added as a new element to the
output container. output container.
@ -56,9 +56,9 @@ namespace boost {
\note Prior content of the result will be overridden. \note Prior content of the result will be overridden.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety and result's container swap method have strong exception guarantie, about exception safety and result's container swap method have strong exception guarantee,
this function provides strong exception guarantie. this function provides strong exception guarantee.
*/ */
template< typename SequenceSequenceT, typename Collection1T, typename Collection2T > template< typename SequenceSequenceT, typename Collection1T, typename Collection2T >
inline SequenceSequenceT& find_all( inline SequenceSequenceT& find_all(
@ -93,9 +93,9 @@ namespace boost {
\note Prior content of the result will be overridden. \note Prior content of the result will be overridden.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety and result's container swap method have strong exception guarantie, about exception safety and result's container swap method have strong exception guarantee,
this function provides strong exception guarantie. this function provides strong exception guarantee.
*/ */
template< typename SequenceSequenceT, typename Collection1T, typename Collection2T > template< typename SequenceSequenceT, typename Collection1T, typename Collection2T >
inline SequenceSequenceT& ifind_all( inline SequenceSequenceT& ifind_all(
@ -138,9 +138,9 @@ namespace boost {
\note Prior content of the result will be overridden. \note Prior content of the result will be overridden.
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety and result's container swap() method have strong exception guarantie, about exception safety and result's container swap() method have strong exception guarantee,
this function provides strong exception guarantie. this function provides strong exception guarantee.
*/ */
template< typename SequenceSequenceT, typename CollectionT, typename PredicateT > template< typename SequenceSequenceT, typename CollectionT, typename PredicateT >
inline SequenceSequenceT& split( inline SequenceSequenceT& split(

24
include/boost/algorithm/string/trim.hpp
View File

@ -48,9 +48,9 @@ namespace boost {
An output iterator pointing just after last inserted character or An output iterator pointing just after last inserted character or
a copy of the input a copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, the second variant of this function provides strong about exception safety, the second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename OutputIteratorT, typename CollectionT, typename PredicateT> template<typename OutputIteratorT, typename CollectionT, typename PredicateT>
inline OutputIteratorT trim_left_copy_if( inline OutputIteratorT trim_left_copy_if(
@ -93,9 +93,9 @@ namespace boost {
\param Loc a locale used for 'space' classification \param Loc a locale used for 'space' classification
\return A trimmed copy of the input \return A trimmed copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename SequenceT> template<typename SequenceT>
inline SequenceT trim_left_copy(const SequenceT& Input, const std::locale& Loc=std::locale()) inline SequenceT trim_left_copy(const SequenceT& Input, const std::locale& Loc=std::locale())
@ -158,9 +158,9 @@ namespace boost {
An output iterator pointing just after last inserted character or An output iterator pointing just after last inserted character or
a copy of the input a copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, the second variant of this function provides strong about exception safety, the second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename OutputIteratorT, typename CollectionT, typename PredicateT> template<typename OutputIteratorT, typename CollectionT, typename PredicateT>
inline OutputIteratorT trim_right_copy_if( inline OutputIteratorT trim_right_copy_if(
@ -204,9 +204,9 @@ namespace boost {
\param Loc A locale used for 'space' classification \param Loc A locale used for 'space' classification
\return A trimmed copy of the input \return A trimmed copy of the input
\note If the input paramters satisfy second assumption \note If the input parameters satisfy second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename SequenceT> template<typename SequenceT>
inline SequenceT trim_right_copy(const SequenceT& Input, const std::locale& Loc=std::locale()) inline SequenceT trim_right_copy(const SequenceT& Input, const std::locale& Loc=std::locale())
@ -272,9 +272,9 @@ namespace boost {
An output iterator pointing just after last inserted character or An output iterator pointing just after last inserted character or
a copy of the input a copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, the second variant of this function provides strong about exception safety, the second variant of this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename OutputIteratorT, typename CollectionT, typename PredicateT> template<typename OutputIteratorT, typename CollectionT, typename PredicateT>
inline OutputIteratorT trim_copy_if( inline OutputIteratorT trim_copy_if(
@ -331,9 +331,9 @@ namespace boost {
\param Loc A locale used for 'space' classification \param Loc A locale used for 'space' classification
\return A trimmed copy of the input \return A trimmed copy of the input
\note If the input paramters satisfy the second assumption \note If the input parameters satisfy the second assumption
about exception safety, this function provides strong about exception safety, this function provides strong
exception guarantie. exception guarantee.
*/ */
template<typename SequenceT> template<typename SequenceT>
inline SequenceT trim_copy( const SequenceT& Input, const std::locale& Loc=std::locale() ) inline SequenceT trim_copy( const SequenceT& Input, const std::locale& Loc=std::locale() )

2
include/boost/algorithm/string/yes_no_type.hpp
View File

@ -14,7 +14,7 @@ namespace boost {
namespace algorithm { namespace algorithm {
// taken from boost mailing-list // taken from boost mailing-list
// when yes_no_type will become officialy // when yes_no_type will become officially
// a part of boost distribution, this header // a part of boost distribution, this header
// will be deprecated // will be deprecated
template<int I> struct size_descriptor template<int I> struct size_descriptor