mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-02 14:04:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

add case_conv algorithms

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-04-09 19:27:06 +09:00
parent ef5aa728b0
commit 8885b115f7
83 changed files with 1300 additions and 44 deletions
Download patch file Download diff file Expand all files Collapse all files

8
sprout/algorithm/string/case_conv.hpp Normal file
View file

@ -0,0 +1,8 @@
#ifndef SPROUT_ALGORITHM_STRING_CASE_CONV_HPP
#define SPROUT_ALGORITHM_STRING_CASE_CONV_HPP
#include <sprout/config.hpp>
#include <sprout/algorithm/string/fixed/case_conv.hpp>
#include <sprout/algorithm/string/fit/case_conv.hpp>
#endif // #ifndef SPROUT_ALGORITHM_STRING_CASE_CONV_HPP

10
sprout/algorithm/string/fit/case_conv.hpp Normal file
View file

@ -0,0 +1,10 @@
#ifndef SPROUT_ALGORITHM_STRING_FIT_CASE_CONV_HPP
#define SPROUT_ALGORITHM_STRING_FIT_CASE_CONV_HPP
#include <sprout/config.hpp>
#include <sprout/algorithm/string/fit/to_lower_copy.hpp>
#include <sprout/algorithm/string/fit/to_upper_copy.hpp>
#include <sprout/algorithm/string/fit/to_lower.hpp>
#include <sprout/algorithm/string/fit/to_upper.hpp>
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIT_CASE_CONV_HPP

46
sprout/algorithm/string/fit/to_lower.hpp Normal file
View file

@ -0,0 +1,46 @@
#ifndef SPROUT_ALGORITHM_STRING_FIT_TO_LOWER_HPP
#define SPROUT_ALGORITHM_STRING_FIT_TO_LOWER_HPP
#include <sprout/config.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/string/fixed/to_lower.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/sub_array/sub_array.hpp>
#include <sprout/sub_array/sub.hpp>
namespace sprout {
namespace algorithm {
namespace fit {
namespace detail {
template<typename Container>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
to_lower_impl(
Container const& cont,
typename sprout::container_traits<Container>::difference_type offset
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::algorithm::fixed::to_lower(cont)),
offset,
offset + sprout::size(cont)
);
}
} // namespace detail
//
// to_lower
//
template<typename Container>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
to_lower(Container const& cont) {
return sprout::algorithm::fit::detail::to_lower_impl(cont, sprout::internal_begin_offset(cont));
}
} // namespace fit
} // namespace algorithm
namespace fit {
using sprout::algorithm::fit::to_lower;
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIT_TO_LOWER_HPP

49
sprout/algorithm/string/fit/to_lower_copy.hpp Normal file
View file

@ -0,0 +1,49 @@
#ifndef SPROUT_ALGORITHM_STRING_FIT_TO_LOWER_COPY_HPP
#define SPROUT_ALGORITHM_STRING_FIT_TO_LOWER_COPY_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/distance.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/string/fixed/to_lower_copy.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/sub_array/sub_array.hpp>
#include <sprout/sub_array/sub.hpp>
#include <sprout/iterator/type_traits/category.hpp>
namespace sprout {
namespace algorithm {
namespace fit {
namespace detail {
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
to_lower_copy_impl(
InputIterator first, InputIterator last, Result const& result,
typename sprout::container_traits<Result>::difference_type offset
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::algorithm::fixed::to_lower_copy(first, last, result)),
offset,
offset + sprout::fit_size(result, sprout::distance(first, last))
);
}
} // namespace detail
//
// to_lower_copy
//
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
to_lower_copy(InputIterator first, InputIterator last, Result const& result) {
static_assert(sprout::is_forward_iterator<InputIterator>::value, "Sorry, not implemented.");
return sprout::algorithm::fit::detail::to_lower_copy_impl(first, last, result, sprout::internal_begin_offset(result));
}
} // namespace fit
} // namespace algorithm
namespace fit {
using sprout::algorithm::fit::to_lower_copy;
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIT_TO_LOWER_COPY_HPP

46
sprout/algorithm/string/fit/to_upper.hpp Normal file
View file

@ -0,0 +1,46 @@
#ifndef SPROUT_ALGORITHM_STRING_FIT_TO_UPPER_HPP
#define SPROUT_ALGORITHM_STRING_FIT_TO_UPPER_HPP
#include <sprout/config.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/string/fixed/to_upper.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/sub_array/sub_array.hpp>
#include <sprout/sub_array/sub.hpp>
namespace sprout {
namespace algorithm {
namespace fit {
namespace detail {
template<typename Container>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
to_upper_impl(
Container const& cont,
typename sprout::container_traits<Container>::difference_type offset
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::algorithm::fixed::to_upper(cont)),
offset,
offset + sprout::size(cont)
);
}
} // namespace detail
//
// to_upper
//
template<typename Container>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
to_upper(Container const& cont) {
return sprout::algorithm::fit::detail::to_upper_impl(cont, sprout::internal_begin_offset(cont));
}
} // namespace fit
} // namespace algorithm
namespace fit {
using sprout::algorithm::fit::to_upper;
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIT_TO_UPPER_HPP

49
sprout/algorithm/string/fit/to_upper_copy.hpp Normal file
View file

@ -0,0 +1,49 @@
#ifndef SPROUT_ALGORITHM_STRING_FIT_TO_UPPER_COPY_HPP
#define SPROUT_ALGORITHM_STRING_FIT_TO_UPPER_COPY_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/distance.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/string/fixed/to_upper_copy.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/sub_array/sub_array.hpp>
#include <sprout/sub_array/sub.hpp>
#include <sprout/iterator/type_traits/category.hpp>
namespace sprout {
namespace algorithm {
namespace fit {
namespace detail {
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
to_upper_copy_impl(
InputIterator first, InputIterator last, Result const& result,
typename sprout::container_traits<Result>::difference_type offset
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::algorithm::fixed::to_upper_copy(first, last, result)),
offset,
offset + sprout::fit_size(result, sprout::distance(first, last))
);
}
} // namespace detail
//
// to_upper_copy
//
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
to_upper_copy(InputIterator first, InputIterator last, Result const& result) {
static_assert(sprout::is_forward_iterator<InputIterator>::value, "Sorry, not implemented.");
return sprout::algorithm::fit::detail::to_upper_copy_impl(first, last, result, sprout::internal_begin_offset(result));
}
} // namespace fit
} // namespace algorithm
namespace fit {
using sprout::algorithm::fit::to_upper_copy;
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIT_TO_UPPER_COPY_HPP

10
sprout/algorithm/string/fixed/case_conv.hpp Normal file
View file

@ -0,0 +1,10 @@
#ifndef SPROUT_ALGORITHM_STRING_FIXED_CASE_CONV_HPP
#define SPROUT_ALGORITHM_STRING_FIXED_CASE_CONV_HPP
#include <sprout/config.hpp>
#include <sprout/algorithm/string/fixed/to_lower_copy.hpp>
#include <sprout/algorithm/string/fixed/to_upper_copy.hpp>
#include <sprout/algorithm/string/fixed/to_lower.hpp>
#include <sprout/algorithm/string/fixed/to_upper.hpp>
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIXED_CASE_CONV_HPP

32
sprout/algorithm/string/fixed/to_lower.hpp Normal file
View file

@ -0,0 +1,32 @@
#ifndef SPROUT_ALGORITHM_STRING_FIXED_TO_LOWER_HPP
#define SPROUT_ALGORITHM_STRING_FIXED_TO_LOWER_HPP
#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/algorithm/string/fixed/to_lower_copy.hpp>
namespace sprout {
namespace algorithm {
namespace fixed {
//
// to_lower
//
template<typename Container>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
to_lower(Container const& cont) {
return sprout::algorithm::fixed::to_lower_copy(sprout::begin(cont), sprout::end(cont), cont);
}
} // namespace fixed
using sprout::algorithm::fixed::to_lower;
} // namespace algorithm
namespace fixed {
using sprout::algorithm::fixed::to_lower;
} // namespace fixed
using sprout::algorithm::fixed::to_lower;
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIXED_TO_LOWER_HPP

39
sprout/algorithm/string/fixed/to_lower_copy.hpp Normal file
View file

@ -0,0 +1,39 @@
#ifndef SPROUT_ALGORITHM_STRING_FIXED_TO_LOWER_COPY_HPP
#define SPROUT_ALGORITHM_STRING_FIXED_TO_LOWER_COPY_HPP
#include <sprout/config.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/algorithm/fixed/transform.hpp>
#include <sprout/pit/pit.hpp>
#include <sprout/ctype/functor.hpp>
namespace sprout {
namespace algorithm {
namespace fixed {
//
// to_lower_copy
//
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
to_lower_copy(InputIterator first, InputIterator last, Result const& result) {
return sprout::fixed::transform(first, last, sprout::ctypes::to_lower<>(), result);
}
template<typename Result, typename InputIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
to_lower_copy(InputIterator first, InputIterator last) {
return sprout::algorithm::fixed::to_lower_copy(first, last, sprout::pit<Result>());
}
} // namespace fixed
using sprout::algorithm::fixed::to_lower_copy;
} // namespace algorithm
namespace fixed {
using sprout::algorithm::fixed::to_lower_copy;
} // namespace fixed
using sprout::algorithm::fixed::to_lower_copy;
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIXED_TO_LOWER_COPY_HPP

32
sprout/algorithm/string/fixed/to_upper.hpp Normal file
View file

@ -0,0 +1,32 @@
#ifndef SPROUT_ALGORITHM_STRING_FIXED_TO_UPPER_HPP
#define SPROUT_ALGORITHM_STRING_FIXED_TO_UPPER_HPP
#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/algorithm/string/fixed/to_upper_copy.hpp>
namespace sprout {
namespace algorithm {
namespace fixed {
//
// to_upper
//
template<typename Container>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
to_upper(Container const& cont) {
return sprout::algorithm::fixed::to_upper_copy(sprout::begin(cont), sprout::end(cont), cont);
}
} // namespace fixed
using sprout::algorithm::fixed::to_upper;
} // namespace algorithm
namespace fixed {
using sprout::algorithm::fixed::to_upper;
} // namespace fixed
using sprout::algorithm::fixed::to_upper;
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIXED_TO_UPPER_HPP

39
sprout/algorithm/string/fixed/to_upper_copy.hpp Normal file
View file

@ -0,0 +1,39 @@
#ifndef SPROUT_ALGORITHM_STRING_FIXED_TO_UPPER_COPY_HPP
#define SPROUT_ALGORITHM_STRING_FIXED_TO_UPPER_COPY_HPP
#include <sprout/config.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/algorithm/fixed/transform.hpp>
#include <sprout/pit/pit.hpp>
#include <sprout/ctype/functor.hpp>
namespace sprout {
namespace algorithm {
namespace fixed {
//
// to_upper_copy
//
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
to_upper_copy(InputIterator first, InputIterator last, Result const& result) {
return sprout::fixed::transform(first, last, sprout::ctypes::to_upper<>(), result);
}
template<typename Result, typename InputIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
to_upper_copy(InputIterator first, InputIterator last) {
return sprout::algorithm::fixed::to_upper_copy(first, last, sprout::pit<Result>());
}
} // namespace fixed
using sprout::algorithm::fixed::to_upper_copy;
} // namespace algorithm
namespace fixed {
using sprout::algorithm::fixed::to_upper_copy;
} // namespace fixed
using sprout::algorithm::fixed::to_upper_copy;
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_STRING_FIXED_TO_UPPER_COPY_HPP

8
sprout/algorithm/string/to_lower.hpp Normal file
View file

@ -0,0 +1,8 @@
#ifndef SPROUT_ALGORITHM_STRING_TO_LOWER_HPP
#define SPROUT_ALGORITHM_STRING_TO_LOWER_HPP
#include <sprout/config.hpp>
#include <sprout/algorithm/string/fixed/to_lower.hpp>
#include <sprout/algorithm/string/fit/to_lower.hpp>
#endif // #ifndef SPROUT_ALGORITHM_STRING_TO_LOWER_HPP

8
sprout/algorithm/string/to_lower_copy.hpp Normal file
View file

@ -0,0 +1,8 @@
#ifndef SPROUT_ALGORITHM_STRING_TO_LOWER_COPY_HPP
#define SPROUT_ALGORITHM_STRING_TO_LOWER_COPY_HPP
#include <sprout/config.hpp>
#include <sprout/algorithm/string/fixed/to_lower_copy.hpp>
#include <sprout/algorithm/string/fit/to_lower_copy.hpp>
#endif // #ifndef SPROUT_ALGORITHM_STRING_TO_LOWER_COPY_HPP

8
sprout/algorithm/string/to_upper.hpp Normal file
View file

@ -0,0 +1,8 @@
#ifndef SPROUT_ALGORITHM_STRING_TO_UPPER_HPP
#define SPROUT_ALGORITHM_STRING_TO_UPPER_HPP
#include <sprout/config.hpp>
#include <sprout/algorithm/string/fixed/to_upper.hpp>
#include <sprout/algorithm/string/fit/to_upper.hpp>
#endif // #ifndef SPROUT_ALGORITHM_STRING_TO_UPPER_HPP

8
sprout/algorithm/string/to_upper_copy.hpp Normal file
View file

@ -0,0 +1,8 @@
#ifndef SPROUT_ALGORITHM_STRING_TO_UPPER_COPY_HPP
#define SPROUT_ALGORITHM_STRING_TO_UPPER_COPY_HPP
#include <sprout/config.hpp>
#include <sprout/algorithm/string/fixed/to_upper_copy.hpp>
#include <sprout/algorithm/string/fit/to_upper_copy.hpp>
#endif // #ifndef SPROUT_ALGORITHM_STRING_TO_UPPER_COPY_HPP