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

Boland "using problem" fix

Browse Source 
[SVN r29448]
This commit is contained in:
Pavol Droba
2005-06-06 20:03:18 +00:00
parent 04a40de48d
commit a4137bbae6
2 changed files with 16 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -59,7 +59,7 @@ namespace boost {
begin(Input),
end(Input),
Output,
detail::to_lowerF<
::boost::algorithm::detail::to_lowerF<
typename range_value<RangeT>::type >(Loc));
}
@ -75,11 +75,11 @@ namespace boost {
return SequenceT(
make_transform_iterator(
begin(Input),
detail::to_lowerF<
::boost::algorithm::detail::to_lowerF<
typename range_value<SequenceT>::type >(Loc)),
make_transform_iterator(
end(Input),
detail::to_lowerF<
::boost::algorithm::detail::to_lowerF<
typename range_value<SequenceT>::type >(Loc)));
}
@ -100,7 +100,7 @@ namespace boost {
begin(Input),
end(Input),
begin(Input),
detail::to_lowerF<
::boost::algorithm::detail::to_lowerF<
typename range_value<WritableRangeT>::type >(Loc));
}
@ -132,7 +132,7 @@ namespace boost {
begin(Input),
end(Input),
Output,
detail::to_upperF<
::boost::algorithm::detail::to_upperF<
typename range_value<RangeT>::type >(Loc));
}
@ -148,11 +148,11 @@ namespace boost {
return SequenceT(
make_transform_iterator(
begin(Input),
detail::to_upperF<
::boost::algorithm::detail::to_upperF<
typename range_value<SequenceT>::type >(Loc)),
make_transform_iterator(
end(Input),
detail::to_upperF<
::boost::algorithm::detail::to_upperF<
typename range_value<SequenceT>::type >(Loc)));
}
@ -174,7 +174,7 @@ namespace boost {
begin(Input),
end(Input),
begin(Input),
detail::to_upperF<
::boost::algorithm::detail::to_upperF<
typename range_value<WritableRangeT>::type >(Loc));
}

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

@ -61,7 +61,7 @@ namespace boost {
PredicateT IsSpace)
{
std::copy(
detail::trim_begin(
::boost::algorithm::detail::trim_begin(
begin(Input),
end(Input),
IsSpace ),
@ -79,7 +79,7 @@ namespace boost {
inline SequenceT trim_left_copy_if(const SequenceT& Input, PredicateT IsSpace)
{
return SequenceT(
detail::trim_begin(
::boost::algorithm::detail::trim_begin(
begin(Input),
end(Input),
IsSpace ),
@ -120,7 +120,7 @@ namespace boost {
{
Input.erase(
begin(Input),
detail::trim_begin(
::boost::algorithm::detail::trim_begin(
begin(Input),
end(Input),
IsSpace));
@ -168,7 +168,7 @@ namespace boost {
{
std::copy(
begin(Input),
detail::trim_end(
::boost::algorithm::detail::trim_end(
begin(Input),
end(Input),
IsSpace ),
@ -186,7 +186,7 @@ namespace boost {
{
return SequenceT(
begin(Input),
detail::trim_end(
::boost::algorithm::detail::trim_end(
begin(Input),
end(Input),
IsSpace)
@ -227,7 +227,7 @@ namespace boost {
inline void trim_right_if(SequenceT& Input, PredicateT IsSpace)
{
Input.erase(
detail::trim_end(
::boost::algorithm::detail::trim_end(
begin(Input),
end(Input),
IsSpace ),
@ -278,7 +278,7 @@ namespace boost {
{
BOOST_STRING_TYPENAME
range_const_iterator<RangeT>::type TrimEnd=
detail::trim_end(
::boost::algorithm::detail::trim_end(
begin(Input),
end(Input),
IsSpace);
@ -302,7 +302,7 @@ namespace boost {
{
BOOST_STRING_TYPENAME
range_const_iterator<SequenceT>::type TrimEnd=
detail::trim_end(
::boost::algorithm::detail::trim_end(
begin(Input),
end(Input),
IsSpace);