feedc0de/boost_algorithm
1
0
Fork 0
forked from boostorg/algorithm
Code Pull Requests Activity

Documentation updates and new Doxyfile; new unit test and minor fix;

Browse Source 
moved minmax_macro; new example.


[SVN r52655]
This commit is contained in:
Jesse Williamson
2009-04-28 19:57:54 +00:00
parent 3f2bbf41d2
commit e9c9685fe9
22 changed files with 1575 additions and 835 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
include/boost/algorithm/all.hpp
View File

@ -16,13 +16,13 @@
#include <boost/range.hpp> // For boost::begin and boost::end
/// \file all.hpp
/// \brief Boost implementation of various STL-type logical algorithms
/// \brief Test ranges against predicates.
/// \author Marshall Clow
namespace boost { namespace algorithm {
/// \fn all ( I first, I last, V val )
/// \fn all ( I first, I last, const V &val )
/// \brief Returns true if all elements in [first, last) are equal to 'val'
///
/// \param first The start of the input sequence
@ -39,7 +39,7 @@ namespace boost { namespace algorithm {
return true;
}
/// \fn all ( Range range, V val )
/// \fn all ( Range range, const V &val )
/// \brief Returns true if all elements in the range are equal to 'val'
///
/// \param range The input range
@ -81,7 +81,7 @@ template<typename I, typename Pred>
return all_if ( boost::begin ( range ), boost::end ( range ), p );
}
/// \fn none ( I first, I last, V val )
/// \fn none ( I first, I last, const V &val )
/// \brief Returns true if none of the elements in [first, last) are equal to 'val'
///
/// \param first The start of the input sequence
@ -93,12 +93,12 @@ template<typename I, typename Pred>
{
while (first != last) {
if ( *first++ == val )
return true;
return false;
}
return false;
return true;
}
/// \fn none ( Range range, V val )
/// \fn none ( Range range, const V &val )
/// \brief Returns true if none of the elements in the range are equal to 'val'
///
/// \param range The input range
@ -140,7 +140,7 @@ template<typename I, typename Pred>
return none_if ( boost::begin ( range ), boost::end ( range ), p );
}
/// \fn any ( I first, I last, V val )
/// \fn any ( I first, I last, const V &val )
/// \brief Returns true if any of the elements in [first, last) are equal to 'val'
///
/// \param first The start of the input sequence
@ -157,7 +157,7 @@ template<typename I, typename Pred>
return false;
}
/// \fn any ( Range range, V val )
/// \fn any ( Range range, const V &val )
/// \brief Returns true if any of the elements in the range are equal to 'val'
///
/// \param range The input range
@ -198,7 +198,7 @@ template<typename I, typename Pred>
return any_if ( boost::begin ( range ), boost::end ( range ), p );
}
/// \fn exists_and_only ( I first, I last, V val )
/// \fn exists_and_only ( I first, I last, const V &val )
/// \brief Returns true if the value 'val' exists only once in [first, last).
///
/// \param first The start of the input sequence
@ -214,7 +214,7 @@ template<typename I, typename Pred>
return true;
}
/// \fn exists_and_only ( Range range, V val )
/// \fn exists_and_only ( Range range, const V &val )
/// \brief Returns true if the value 'val' exists only once in the range.
///
/// \param range The input range

10
include/boost/algorithm/apply.hpp
View File

@ -11,7 +11,7 @@
#define BOOST_ALGORITHM_APPLY_HPP
/// \file apply.hpp
/// \brief Boost implementation of sequence-modifying algorithms.
/// \brief Apply predicates to ranges.
/// \author Jesse Williamson
#include <boost/range.hpp>
@ -22,7 +22,7 @@ namespace boost { namespace algorithm { namespace sequence {
/// \brief Applies m to all elements from (begin, end) for which c is true.
///
/// \param begin The start of the sequence to modify
/// \param last One past the end of the input sequence
/// \param end One past the end of the input sequence
/// \param m Unary mutator function object
/// \param c Unary condition function object
/// \return The mutator function object
@ -38,7 +38,7 @@ Mutator apply_if(ForwardIter begin, ForwardIter end, Mutator m, ConditionPredica
return m;
}
/// \fn apply_if (Range r, Mutator m, ConditionPredicate c)
/// \fn apply_if (ForwardReadableRange& r, Mutator m, ConditionPredicate c)
/// \brief Applies m to all elements in the range r for which c is true.
///
/// \param r The range to modify
@ -56,7 +56,7 @@ Mutator apply_if(ForwardReadableRange& R, Mutator m, ConditionPredicate c)
/// \brief Applies m to all elements from (begin, end).
///
/// \param begin The start of the sequence to modify
/// \param last One past the end of the input sequence
/// \param end One past the end of the input sequence
/// \param m Unary mutator function object
/// \return The mutator function object
///
@ -69,7 +69,7 @@ Mutator apply(ForwardIter begin, ForwardIter end, Mutator m)
return m;
}
/// \fn apply (ForwardReadableRange r, Mutator m)
/// \fn apply (ForwardReadableRange& r, Mutator m)
/// \brief Applies m to all elements in the range r
///
/// \param r The range to modify

24
include/boost/algorithm/copy.hpp
View File

@ -18,8 +18,7 @@
#include <iterator> // for std::iterator_traits<>
/// \file copy.hpp
/// \brief Boost implementation of various STL-type copying algorithms
/// that were left out of the standard.
/// \brief STL-type copy()-type algorithms that were left out of the standard.
/// \author Marshall Clow
namespace boost { namespace algorithm { namespace sequence {
@ -141,7 +140,7 @@ template<typename I,typename O>
/// \return The (modified) output iterator
///
template<typename Range, typename O, typename Pred>
std::pair<I,O> copy_while ( Range range, O res, Pred p )
std::pair<typename Range::type,O> copy_while ( Range range, O res, Pred p )
{
return copy_while ( boost::begin ( range ), boost::end ( range ), res, p );
}
@ -175,7 +174,7 @@ template<typename I,typename O>
/// \return The (modified) output iterator
///
template<typename Range, typename O, typename Pred>
std::pair<I,O> reverse_copy_while ( Range range, O res, Pred p )
std::pair<typename Range::type,O> reverse_copy_while ( Range range, O res, Pred p )
{
return reverse_copy_while ( boost::begin ( range ), boost::end ( range ), res, p );
}
@ -190,9 +189,14 @@ template<typename I,typename O>
//
// Marshall sez: What's the advantage of templatizing on count, rather than using std::size_t?
//
// Jesse says: I've kept the signature that was uncommented to stop Doxygen from complaining. Here's
// the signature that was being discussed:
// template <typename I, typename O>
// O copy_n ( I first, typename std::iterator_traits<I>::difference_type count, O res )
//
// No range-based version here
/// \fn copy_n ( I first, typename iterator_traits<I>::difference_type count, O res )
/// \fn copy_n ( I first, Size count, O res )
/// \brief Copies n elements starting at 'first' into 'res'.
///
/// \param first The start of the input sequence
@ -202,8 +206,6 @@ template<typename I,typename O>
///
template <typename I, typename Size, typename O>
O copy_n ( I first, Size count, O res )
// template <typename I, typename O>
// O copy_n ( I first, typename std::iterator_traits<I>::difference_type count, O res )
{
for ( ; count > 0; ++res, ++first, --count )
*res = *first;
@ -269,7 +271,7 @@ template<typename I,typename O>
/// \param last One past the end of the input sequence
/// \param out_true An output iterator to copy into
/// \param out_false An output iterator to copy into
/// \param p A predicate to determine which output sequence to copy into.
/// \param pred A predicate to determine which output sequence to copy into.
///
///
template <typename I, typename O1, typename O2, typename Pred>
@ -287,14 +289,16 @@ template<typename I,typename O>
}
/// \fn partition_copy ( I first, I last, O1 out_true, O2 out_false, Pred pred )
/// \fn partition_copy ( Range range, O1 out_true, O2 out_false, Pred pred )
/// \brief Copies each element from the range into one of the two output sequences,
/// depending on the result of the predicate
///
/// \param range The input range
/// \param out_true An output iterator to copy into
/// \param out_false An output iterator to copy into
/// \param p A predicate to determine which output sequence to copy into.
/// \param pred A predicate to determine which output sequence to copy into.
///
/// \note A range-based version of partition_copy.
///
template <typename Range, typename O1, typename O2, typename Pred>
std::pair <O1, O2> partition_copy ( Range range, O1 out_true, O2 out_false, Pred pred )

176
include/boost/algorithm/detail/minmax_macro_comeau.hpp
View File

@ -1,176 +0,0 @@
///////////////////////////////////////////////////////////////////////////////
// minmax_macro_comeau.hpp header file
//
// Copyright 2006 Eric Niebler.
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Credits:
// Scott Meyers - for carefully detailing the shortcomings of
// std::min and std::max in his article "Min, max and more"
// Andrei Alexandrescu - for the suggestion that ?: operator couls be useful
// in solving Scott's long-standing min/max challenge.
#ifndef BOOST_MIN
#include <boost/mpl/or.hpp>
#include <boost/mpl/eval_if.hpp>
#include <boost/type_traits/is_array.hpp>
#include <boost/type_traits/is_abstract.hpp>
#include <boost/type_traits/remove_const.hpp>
namespace boost { namespace minmax_macro_detail_
{
template<typename Type>
Type *encode_type(Type &) { return 0; }
template<typename Type>
Type const *encode_type(Type const &) { return 0; }
///////////////////////////////////////////////////////////////////////////////
// max_impl
template<typename Ret, typename Left, typename Right>
struct max_impl
{
max_impl(Left &left, Right &right)
: left_(left)
, right_(right)
{}
struct private_type_ { typedef private_type_ type; };
// can't ever return an array or an abstract type by value
typedef BOOST_DEDUCED_TYPENAME boost::mpl::eval_if<
boost::mpl::or_<boost::is_abstract<Ret>, boost::is_array<Ret> >
, private_type_
, boost::remove_const<Ret>
>::type value_type;
operator value_type()
{
return this->left_ < this->right_ ? this->right_ : this->left_;
}
operator Ret &() const
{
return this->left_ < this->right_ ? this->right_ : this->left_;
}
private:
Left &left_;
Right &right_;
};
///////////////////////////////////////////////////////////////////////////////
// max_fun
template<typename Left, typename Right, typename Ret>
max_impl<Ret, Left, Right>
max_fun(Left &left, Right &right, Ret *)
{
return max_impl<Ret, Left, Right>(left, right);
}
template<typename Left, typename Right, typename Ret>
max_impl<Ret, Left const, Right>
max_fun(Left const &left, Right &right, Ret *)
{
return max_impl<Ret, Left const, Right>(left, right);
}
template<typename Left, typename Right, typename Ret>
max_impl<Ret, Left, Right const>
max_fun(Left &left, Right const &right, Ret *)
{
return max_impl<Ret, Left, Right const>(left, right);
}
template<typename Left, typename Right, typename Ret>
max_impl<Ret, Left const, Right const>
max_fun(Left const &left, Right const &right, Ret *)
{
return max_impl<Ret, Left const, Right const>(left, right);
}
#define BOOST_MAX(a,b)\
(true\
? boost::minmax_macro_detail_::max_fun((a), (b), \
(true? 0 : boost::minmax_macro_detail_::encode_type(true? (a) : (b))))\
: (true? (a) : (b)))
///////////////////////////////////////////////////////////////////////////////
// min_impl
template<typename Ret, typename Left, typename Right>
struct min_impl
{
min_impl(Left &left, Right &right)
: left_(left)
, right_(right)
{}
struct private_type_ { typedef private_type_ type; };
// can't ever return an array or an abstract type by value
typedef BOOST_DEDUCED_TYPENAME boost::mpl::eval_if<
boost::mpl::or_<boost::is_abstract<Ret>, boost::is_array<Ret> >
, private_type_
, boost::remove_const<Ret>
>::type value_type;
operator value_type()
{
return this->left_ < this->right_ ? this->left_ : this->right_;
}
operator Ret &() const
{
return this->left_ < this->right_ ? this->left_ : this->right_;
}
private:
Left &left_;
Right &right_;
};
///////////////////////////////////////////////////////////////////////////////
// min_fun
template<typename Left, typename Right, typename Ret>
min_impl<Ret, Left, Right>
min_fun(Left &left, Right &right, Ret *)
{
return min_impl<Ret, Left, Right>(left, right);
}
template<typename Left, typename Right, typename Ret>
min_impl<Ret, Left const, Right>
min_fun(Left const &left, Right &right, Ret *)
{
return min_impl<Ret, Left const, Right>(left, right);
}
template<typename Left, typename Right, typename Ret>
min_impl<Ret, Left, Right const>
min_fun(Left &left, Right const &right, Ret *)
{
return min_impl<Ret, Left, Right const>(left, right);
}
template<typename Left, typename Right, typename Ret>
min_impl<Ret, Left const, Right const>
min_fun(Left const &left, Right const &right, Ret *)
{
return min_impl<Ret, Left const, Right const>(left, right);
}
#define BOOST_MIN(a,b)\
(true\
? boost::minmax_macro_detail_::min_fun((a), (b), \
(true? 0 : boost::minmax_macro_detail_::encode_type(true? (a) : (b))))\
: (true? (a) : (b)))
}}
#endif

167
include/boost/algorithm/detail/minmax_macro_msvc.hpp
View File

@ -1,167 +0,0 @@
///////////////////////////////////////////////////////////////////////////////
// minmax_macro_msvc.hpp header file
//
// Copyright 2006 Eric Niebler.
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Credits:
// Scott Meyers - for carefully detailing the shortcomings of
// std::min and std::max in his article "Min, max and more"
// Andrei Alexandrescu - for the suggestion that ?: operator couls be useful
// in solving Scott's long-standing min/max challenge.
#ifndef BOOST_MIN
#include <boost/mpl/if.hpp>
#include <boost/mpl/bool.hpp>
#include <boost/mpl/logical.hpp>
#include <boost/type_traits/is_array.hpp>
#include <boost/type_traits/is_abstract.hpp>
namespace boost { namespace minmax_macro_detail_
{
///////////////////////////////////////////////////////////////////////////////
// Define some utilities for assessing the properties of expressions
//
typedef char yes_type;
typedef char (&no_type)[2];
yes_type is_true(boost::mpl::true_ *);
no_type is_true(boost::mpl::false_ *);
// Extracts the desired property from the expression without evaluating it
#define BOOST_MINMAX_PROTECT(expr) \
(static_cast<boost::mpl::bool_<1 == sizeof(boost::minmax_macro_detail_::is_true(expr))> *>(0))
template<typename Bool1, typename Bool2>
inline boost::mpl::and_<Bool1, Bool2> *and_(Bool1 *, Bool2 *) { return 0; }
template<typename Bool>
inline boost::mpl::not_<Bool> *not_(Bool *) { return 0; }
template<typename T>
inline boost::mpl::false_ *is_rvalue_(T &, int) { return 0; }
template<typename T>
inline boost::mpl::true_ *is_rvalue_(T const &, ...) { return 0; }
template<typename T>
inline boost::is_array<T> *is_array_(T const &) { return 0; }
///////////////////////////////////////////////////////////////////////////////
// Detect at compile-time whether an expression yields an rvalue or
// an lvalue. This is rather non-standard, but MSVC seems to like it.
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
// rvalue_probe
//
template<typename T>
struct rvalue_probe
{
struct private_type_ {};
// can't ever return an array by value
typedef typename boost::mpl::if_<
boost::mpl::or_<boost::is_abstract<T>, boost::is_array<T> >, private_type_, T
>::type value_type;
operator value_type();
operator T &() const;
};
template<typename T>
rvalue_probe<T> const make_probe(T const &t);
# define BOOST_MINMAX_IS_RVALUE(T) \
BOOST_MINMAX_PROTECT( \
boost::minmax_macro_detail_::and_( \
boost::minmax_macro_detail_::not_(boost::minmax_macro_detail_::is_array_(T)) \
, boost::minmax_macro_detail_::is_rvalue_( \
(true ? boost::minmax_macro_detail_::make_probe(T) : (T)), 0)))
template<typename Type>
Type *encode_type(Type &) { return 0; }
template<typename Type>
Type const *encode_type(Type const &) { return 0; }
///////////////////////////////////////////////////////////////////////////////
// max_fun
template<typename Left, typename Right, typename Ret, typename IsRvalue>
typename mpl::if_<IsRvalue, Ret, Ret &>::type
max_fun(Left &left, Right &right, Ret *, IsRvalue *)
{
return left < right ? right : left;
}
template<typename Left, typename Right, typename Ret, typename IsRvalue>
typename mpl::if_<IsRvalue, Ret, Ret &>::type
max_fun(Left const &left, Right &right, Ret *, IsRvalue *)
{
return left < right ? right : left;
}
template<typename Left, typename Right, typename Ret, typename IsRvalue>
typename mpl::if_<IsRvalue, Ret, Ret &>::type
max_fun(Left &left, Right const &right, Ret *, IsRvalue *)
{
return left < right ? right : left;
}
template<typename Left, typename Right, typename Ret, typename IsRvalue>
typename mpl::if_<IsRvalue, Ret, Ret &>::type
max_fun(Left const &left, Right const &right, Ret *, IsRvalue *)
{
return left < right ? right : left;
}
#define BOOST_MAX(a,b)\
boost::minmax_macro_detail_::max_fun(\
(a) \
, (b) \
, (true? 0 : boost::minmax_macro_detail_::encode_type(true? (a) : (b))) \
, BOOST_MINMAX_IS_RVALUE(true? (a) : (b)))
///////////////////////////////////////////////////////////////////////////////
// min_fun
template<typename Left, typename Right, typename Ret, typename IsRvalue>
typename mpl::if_<IsRvalue, Ret, Ret &>::type
min_fun(Left &left, Right &right, Ret *, IsRvalue *)
{
return left < right ? left : right;
}
template<typename Left, typename Right, typename Ret, typename IsRvalue>
typename mpl::if_<IsRvalue, Ret, Ret &>::type
min_fun(Left const &left, Right &right, Ret *, IsRvalue *)
{
return left < right ? left : right;
}
template<typename Left, typename Right, typename Ret, typename IsRvalue>
typename mpl::if_<IsRvalue, Ret, Ret &>::type
min_fun(Left &left, Right const &right, Ret *, IsRvalue *)
{
return left < right ? left : right;
}
template<typename Left, typename Right, typename Ret, typename IsRvalue>
typename mpl::if_<IsRvalue, Ret, Ret &>::type
min_fun(Left const &left, Right const &right, Ret *, IsRvalue *)
{
return left < right ? left : right;
}
#define BOOST_MIN(a,b)\
boost::minmax_macro_detail_::min_fun(\
(a) \
, (b) \
, (true? 0 : boost::minmax_macro_detail_::encode_type(true? (a) : (b))) \
, BOOST_MINMAX_IS_RVALUE(true? (a) : (b)))
}}
#endif

2
include/boost/algorithm/find_if_not.hpp
View File

@ -13,7 +13,7 @@
#include <boost/range.hpp>
/// \file find_if_not.hpp
/// \brief Boost implementation of find_if_not() algorithm.
/// \brief Return the first iterator in a range for which a predicate is false.
/// \author Jesse Williamson
namespace boost { namespace algorithm { namespace sequence {

4
include/boost/algorithm/for_each_if.hpp
View File

@ -14,7 +14,7 @@
#include <boost/range.hpp> // For boost::begin and boost::end
/// \file for_each_if.hpp
/// \brief Boost implementation for_each_if, which was left out of the standard.
/// \brief Apply a functor to a range when a predicate is satisfied.
/// \author Marshall Clow
namespace boost { namespace algorithm {
@ -31,7 +31,7 @@ namespace boost { namespace algorithm {
///
///
template<typename InputIterator, typename Pred, typename Func>
UnaryFunction for_each_if ( InputIterator first, InputIterator last, Pred p, Func f )
Func for_each_if ( InputIterator first, InputIterator last, Pred p, Func f )
{
while ( first != last )
{

1
include/boost/algorithm/iota.hpp
View File

@ -14,6 +14,7 @@
// #include <boost/range.hpp> // For boost::begin and boost::end
/// \file iota.hpp
/// \brief Generate and write sequences.
/// \brief Boost implementation of iota, a proposed algorithm for TR2
/// \author Marshall Clow

165
include/boost/algorithm/minmax_macro.hpp
View File

@ -1,165 +0,0 @@
///////////////////////////////////////////////////////////////////////////////
// minmax_macro.hpp header file
//
// Copyright 2006 Eric Niebler.
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Credits:
// Scott Meyers - for carefully detailing the shortcomings of
// std::min and std::max in his article "Min, max and more"
// Andrei Alexandrescu - for the suggestion that ?: operator couls be useful
// in solving Scott's long-standing min/max challenge.
#ifndef BOOST_MIN
#include <boost/config.hpp>
#include <boost/detail/workaround.hpp>
#if BOOST_WORKAROUND(__COMO_VERSION__, BOOST_TESTED_AT(4245))
# include <boost/algorithm/detail/minmax_macro_comeau.hpp>
#elif BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400))
# include <boost/algorithm/detail/minmax_macro_msvc.hpp>
#else
namespace boost { namespace minmax_macro_detail_
{
///////////////////////////////////////////////////////////////////////////////
// max_impl
template<typename Left, typename Right>
struct max_impl
{
max_impl(Left &left, Right &right)
: left_(left)
, right_(right)
{}
template<typename Rvalue>
operator Rvalue ()
{
return this->left_ < this->right_ ? this->right_ : this->left_;
}
template<typename Lvalue>
operator Lvalue &() const
{
return this->left_ < this->right_ ? this->right_ : this->left_;
}
#if BOOST_WORKAROUND(__GNUC__, BOOST_TESTED_AT(3))
operator max_impl & () { return *this; }
#endif
private:
Left &left_;
Right &right_;
};
///////////////////////////////////////////////////////////////////////////////
// max_fun
template<typename Left, typename Right>
max_impl<Left, Right>
max_fun(Left &left, Right &right)
{
return max_impl<Left, Right>(left, right);
}
template<typename Left, typename Right>
max_impl<Left const, Right>
max_fun(Left const &left, Right &right)
{
return max_impl<Left const, Right>(left, right);
}
template<typename Left, typename Right>
max_impl<Left, Right const>
max_fun(Left &left, Right const &right)
{
return max_impl<Left, Right const>(left, right);
}
template<typename Left, typename Right>
max_impl<Left const, Right const>
max_fun(Left const &left, Right const &right)
{
return max_impl<Left const, Right const>(left, right);
}
#define BOOST_MAX(a,b)\
(true? boost::minmax_macro_detail_::max_fun((a), (b)) : (true? (a) : (b)))
///////////////////////////////////////////////////////////////////////////////
// min_impl
template<typename Left, typename Right>
struct min_impl
{
min_impl(Left &left, Right &right)
: left_(left)
, right_(right)
{}
template<typename Rvalue>
operator Rvalue ()
{
return this->left_ < this->right_ ? this->left_ : this->right_;
}
template<typename Lvalue>
operator Lvalue &() const
{
return this->left_ < this->right_ ? this->left_ : this->right_;
}
#if BOOST_WORKAROUND(__GNUC__, BOOST_TESTED_AT(3))
operator min_impl & () { return *this; }
#endif
private:
Left &left_;
Right &right_;
};
///////////////////////////////////////////////////////////////////////////////
// min_fun
template<typename Left, typename Right>
min_impl<Left, Right>
min_fun(Left &left, Right &right)
{
return min_impl<Left, Right>(left, right);
}
template<typename Left, typename Right>
min_impl<Left const, Right>
min_fun(Left const &left, Right &right)
{
return min_impl<Left const, Right>(left, right);
}
template<typename Left, typename Right>
min_impl<Left, Right const>
min_fun(Left &left, Right const &right)
{
return min_impl<Left, Right const>(left, right);
}
template<typename Left, typename Right>
min_impl<Left const, Right const>
min_fun(Left const &left, Right const &right)
{
return min_impl<Left const, Right const>(left, right);
}
#define BOOST_MIN(a,b)\
(true? boost::minmax_macro_detail_::min_fun((a), (b)) : (true? (a) : (b)))
}}
#endif
#endif

6
include/boost/algorithm/select.hpp
View File

@ -16,12 +16,12 @@
/// \file select.hpp
/// \brief Boost implementation select1st and select2nd.
/// \brief Choose the first or second element of a Pair.
/// \author Marshall Clow
namespace boost { namespace algorithm {
/// \fn select1st
/// \struct select1st
/// \brief Unary function that returns the first element of a std::pair
///
/// \param p The pair.
@ -35,7 +35,7 @@ namespace boost { namespace algorithm {
typename Pair::first_type& operator()( Pair& p) const { return p.first; }
};
/// \fn select2nd
/// \struct select2nd
/// \brief Unary function that returns the first element of a std::pair
///
/// \param p The pair.

2
include/boost/algorithm/transform_if.hpp
View File

@ -13,7 +13,7 @@
#include <boost/range.hpp>
/// \file transform_if.hpp
/// \brief Boost implementation of transform_if() algorithm.
/// \brief Apply operations across ranges when a predicate is true, storing returned values.
/// \author Jesse Williamson
namespace boost { namespace algorithm { namespace sequence {