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

Library adapted to use official Boost.Range instead of the internal version

Browse Source 
Internal version removed


[SVN r26787]
This commit is contained in:
Pavol Droba
2005-01-21 16:45:29 +00:00
parent 54092d7934
commit aea6f39c11
30 changed files with 212 additions and 1331 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -11,9 +11,14 @@
#define BOOST_STRING_FINDER_HPP
#include <boost/algorithm/string/config.hpp>
#include <boost/range/iterator_range.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/iterator.hpp>
#include <boost/range/const_iterator.hpp>
#include <boost/algorithm/string/constants.hpp>
#include <boost/algorithm/string/collection_traits.hpp>
#include <boost/algorithm/string/iterator_range.hpp>
#include <boost/algorithm/string/detail/finder.hpp>
#include <boost/algorithm/string/compare.hpp>
@ -42,14 +47,14 @@ namespace boost {
*/
template<typename ContainerT>
inline detail::first_finderF<
BOOST_STRING_TYPENAME const_iterator_of<ContainerT>::type,
BOOST_STRING_TYPENAME range_const_iterator<ContainerT>::type,
is_equal>
first_finder( const ContainerT& Search )
{
return
detail::first_finderF<
BOOST_STRING_TYPENAME
const_iterator_of<ContainerT>::type,
range_const_iterator<ContainerT>::type,
is_equal>( Search, is_equal() ) ;
}
@ -59,7 +64,7 @@ namespace boost {
*/
template<typename ContainerT,typename PredicateT>
inline detail::first_finderF<
BOOST_STRING_TYPENAME const_iterator_of<ContainerT>::type,
BOOST_STRING_TYPENAME range_const_iterator<ContainerT>::type,
PredicateT>
first_finder(
const ContainerT& Search, PredicateT Comp )
@ -67,7 +72,7 @@ namespace boost {
return
detail::first_finderF<
BOOST_STRING_TYPENAME
const_iterator_of<ContainerT>::type,
range_const_iterator<ContainerT>::type,
PredicateT>( Search, Comp );
}
@ -83,14 +88,14 @@ namespace boost {
*/
template<typename ContainerT>
inline detail::last_finderF<
BOOST_STRING_TYPENAME const_iterator_of<ContainerT>::type,
BOOST_STRING_TYPENAME range_const_iterator<ContainerT>::type,
is_equal>
last_finder( const ContainerT& Search )
{
return
detail::last_finderF<
BOOST_STRING_TYPENAME
const_iterator_of<ContainerT>::type,
range_const_iterator<ContainerT>::type,
is_equal>( Search, is_equal() );
}
//! "Last" finder
@ -99,14 +104,14 @@ namespace boost {
*/
template<typename ContainerT, typename PredicateT>
inline detail::last_finderF<
BOOST_STRING_TYPENAME const_iterator_of<ContainerT>::type,
BOOST_STRING_TYPENAME range_const_iterator<ContainerT>::type,
PredicateT>
last_finder( const ContainerT& Search, PredicateT Comp )
{
return
detail::last_finderF<
BOOST_STRING_TYPENAME
const_iterator_of<ContainerT>::type,
range_const_iterator<ContainerT>::type,
PredicateT>( Search, Comp ) ;
}
@ -123,7 +128,7 @@ namespace boost {
*/
template<typename ContainerT>
inline detail::nth_finderF<
BOOST_STRING_TYPENAME const_iterator_of<ContainerT>::type,
BOOST_STRING_TYPENAME range_const_iterator<ContainerT>::type,
is_equal>
nth_finder(
const ContainerT& Search,
@ -132,7 +137,7 @@ namespace boost {
return
detail::nth_finderF<
BOOST_STRING_TYPENAME
const_iterator_of<ContainerT>::type,
range_const_iterator<ContainerT>::type,
is_equal>( Search, Nth, is_equal() ) ;
}
//! "Nth" finder
@ -141,7 +146,7 @@ namespace boost {
*/
template<typename ContainerT, typename PredicateT>
inline detail::nth_finderF<
BOOST_STRING_TYPENAME const_iterator_of<ContainerT>::type,
BOOST_STRING_TYPENAME range_const_iterator<ContainerT>::type,
PredicateT>
nth_finder(
const ContainerT& Search,
@ -151,7 +156,7 @@ namespace boost {
return
detail::nth_finderF<
BOOST_STRING_TYPENAME
const_iterator_of<ContainerT>::type,
range_const_iterator<ContainerT>::type,
PredicateT>( Search, Nth, Comp );
}