mirror of
https://github.com/boostorg/algorithm.git
synced 2025-07-12 03:56:35 +02:00
- tabs removed
- find_tail/head_impl functions rearranged to avoid the dependency problem [SVN r32676]
This commit is contained in:
@ -333,20 +333,6 @@ namespace boost {
|
|||||||
|
|
||||||
// find head functor -----------------------------------------------//
|
// find head functor -----------------------------------------------//
|
||||||
|
|
||||||
// Find head implementation
|
|
||||||
template<typename ForwardIteratorT>
|
|
||||||
iterator_range<ForwardIteratorT>
|
|
||||||
find_head_impl(
|
|
||||||
ForwardIteratorT Begin,
|
|
||||||
ForwardIteratorT End,
|
|
||||||
unsigned int N )
|
|
||||||
{
|
|
||||||
typedef BOOST_STRING_TYPENAME boost::detail::
|
|
||||||
iterator_traits<ForwardIteratorT>::iterator_category category;
|
|
||||||
|
|
||||||
return find_head_impl( Begin, End, N, category() );
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename ForwardIteratorT>
|
template<typename ForwardIteratorT>
|
||||||
iterator_range<ForwardIteratorT>
|
iterator_range<ForwardIteratorT>
|
||||||
find_head_impl(
|
find_head_impl(
|
||||||
@ -383,6 +369,20 @@ namespace boost {
|
|||||||
return result_type(Begin,Begin+N);
|
return result_type(Begin,Begin+N);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Find head implementation
|
||||||
|
template<typename ForwardIteratorT>
|
||||||
|
iterator_range<ForwardIteratorT>
|
||||||
|
find_head_impl(
|
||||||
|
ForwardIteratorT Begin,
|
||||||
|
ForwardIteratorT End,
|
||||||
|
unsigned int N )
|
||||||
|
{
|
||||||
|
typedef BOOST_STRING_TYPENAME boost::detail::
|
||||||
|
iterator_traits<ForwardIteratorT>::iterator_category category;
|
||||||
|
|
||||||
|
return find_head_impl( Begin, End, N, category() );
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
// find a head in the sequence ( functor )
|
// find a head in the sequence ( functor )
|
||||||
/*
|
/*
|
||||||
@ -421,19 +421,6 @@ namespace boost {
|
|||||||
|
|
||||||
// find tail functor -----------------------------------------------//
|
// find tail functor -----------------------------------------------//
|
||||||
|
|
||||||
// Operation
|
|
||||||
template< typename ForwardIteratorT >
|
|
||||||
iterator_range<ForwardIteratorT>
|
|
||||||
find_tail_impl(
|
|
||||||
ForwardIteratorT Begin,
|
|
||||||
ForwardIteratorT End,
|
|
||||||
unsigned int N )
|
|
||||||
{
|
|
||||||
typedef BOOST_STRING_TYPENAME boost::detail::
|
|
||||||
iterator_traits<ForwardIteratorT>::iterator_category category;
|
|
||||||
|
|
||||||
return find_tail_impl( Begin, End, N, category() );
|
|
||||||
}
|
|
||||||
|
|
||||||
template< typename ForwardIteratorT >
|
template< typename ForwardIteratorT >
|
||||||
iterator_range<ForwardIteratorT>
|
iterator_range<ForwardIteratorT>
|
||||||
@ -495,6 +482,21 @@ namespace boost {
|
|||||||
return result_type( End-N, End );
|
return result_type( End-N, End );
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Operation
|
||||||
|
template< typename ForwardIteratorT >
|
||||||
|
iterator_range<ForwardIteratorT>
|
||||||
|
find_tail_impl(
|
||||||
|
ForwardIteratorT Begin,
|
||||||
|
ForwardIteratorT End,
|
||||||
|
unsigned int N )
|
||||||
|
{
|
||||||
|
typedef BOOST_STRING_TYPENAME boost::detail::
|
||||||
|
iterator_traits<ForwardIteratorT>::iterator_category category;
|
||||||
|
|
||||||
|
return find_tail_impl( Begin, End, N, category() );
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
// find a tail in the sequence ( functor )
|
// find a tail in the sequence ( functor )
|
||||||
/*
|
/*
|
||||||
This functor find a tail of the specified range. For
|
This functor find a tail of the specified range. For
|
||||||
|
Reference in New Issue
Block a user