mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-16 15:14:13 +00:00
add case_conv algorithms
This commit is contained in:
parent
ef5aa728b0
commit
8885b115f7
83 changed files with 1300 additions and 44 deletions
8
sprout/range/algorithm/string/case_conv.hpp
Normal file
8
sprout/range/algorithm/string/case_conv.hpp
Normal file
|
@ -0,0 +1,8 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_STRING_CASE_CONV_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_STRING_CASE_CONV_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/range/algorithm/string/fixed/case_conv.hpp>
|
||||
#include <sprout/range/algorithm/string/fit/case_conv.hpp>
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_STRING_CASE_CONV_HPP
|
8
sprout/range/algorithm/string/fit/case_conv.hpp
Normal file
8
sprout/range/algorithm/string/fit/case_conv.hpp
Normal file
|
@ -0,0 +1,8 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_STRING_FIT_CASE_CONV_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_STRING_FIT_CASE_CONV_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/range/algorithm/string/fit/to_lower_copy.hpp>
|
||||
#include <sprout/range/algorithm/string/fit/to_upper_copy.hpp>
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_STRING_FIT_CASE_CONV_HPP
|
32
sprout/range/algorithm/string/fit/to_lower_copy.hpp
Normal file
32
sprout/range/algorithm/string/fit/to_lower_copy.hpp
Normal file
|
@ -0,0 +1,32 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_STRING_FIT_TO_LOWER_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_STRING_FIT_TO_LOWER_COPY_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/container/functions.hpp>
|
||||
#include <sprout/algorithm/fit/result_of.hpp>
|
||||
#include <sprout/algorithm/string/fit/to_lower_copy.hpp>
|
||||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
namespace algorithm {
|
||||
namespace fit {
|
||||
//
|
||||
// to_lower_copy
|
||||
//
|
||||
template<typename InputRange, typename Result>
|
||||
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
|
||||
to_lower_copy(InputRange const& rng, Result const& result) {
|
||||
return sprout::fit::to_lower_copy(sprout::begin(rng), sprout::end(rng), result);
|
||||
}
|
||||
} // namespace fit
|
||||
|
||||
using sprout::range::algorithm::fit::to_lower_copy;
|
||||
} // namespace algorithm
|
||||
|
||||
namespace fit {
|
||||
using sprout::range::algorithm::fit::to_lower_copy;
|
||||
} // namespace fit
|
||||
} // namespace range
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_STRING_FIT_TO_LOWER_COPY_HPP
|
32
sprout/range/algorithm/string/fit/to_upper_copy.hpp
Normal file
32
sprout/range/algorithm/string/fit/to_upper_copy.hpp
Normal file
|
@ -0,0 +1,32 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_STRING_FIT_TO_UPPER_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_STRING_FIT_TO_UPPER_COPY_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/container/functions.hpp>
|
||||
#include <sprout/algorithm/fit/result_of.hpp>
|
||||
#include <sprout/algorithm/string/fit/to_upper_copy.hpp>
|
||||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
namespace algorithm {
|
||||
namespace fit {
|
||||
//
|
||||
// to_upper_copy
|
||||
//
|
||||
template<typename InputRange, typename Result>
|
||||
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
|
||||
to_upper_copy(InputRange const& rng, Result const& result) {
|
||||
return sprout::fit::to_upper_copy(sprout::begin(rng), sprout::end(rng), result);
|
||||
}
|
||||
} // namespace fit
|
||||
|
||||
using sprout::range::algorithm::fit::to_upper_copy;
|
||||
} // namespace algorithm
|
||||
|
||||
namespace fit {
|
||||
using sprout::range::algorithm::fit::to_upper_copy;
|
||||
} // namespace fit
|
||||
} // namespace range
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_STRING_FIT_TO_UPPER_COPY_HPP
|
8
sprout/range/algorithm/string/fixed/case_conv.hpp
Normal file
8
sprout/range/algorithm/string/fixed/case_conv.hpp
Normal file
|
@ -0,0 +1,8 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_STRING_FIXED_CASE_CONV_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_STRING_FIXED_CASE_CONV_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/range/algorithm/string/fixed/to_lower_copy.hpp>
|
||||
#include <sprout/range/algorithm/string/fixed/to_upper_copy.hpp>
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_STRING_FIXED_CASE_CONV_HPP
|
41
sprout/range/algorithm/string/fixed/to_lower_copy.hpp
Normal file
41
sprout/range/algorithm/string/fixed/to_lower_copy.hpp
Normal file
|
@ -0,0 +1,41 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_STRING_FIXED_TO_LOWER_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_STRING_FIXED_TO_LOWER_COPY_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/container/traits.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 range {
|
||||
namespace algorithm {
|
||||
namespace fixed {
|
||||
//
|
||||
// to_lower_copy
|
||||
//
|
||||
template<typename InputRange, typename Result>
|
||||
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
to_lower_copy(InputRange const& rng, Result const& result) {
|
||||
return sprout::algorithm::fixed::to_lower_copy(sprout::begin(rng), sprout::end(rng), result);
|
||||
}
|
||||
|
||||
template<typename Result, typename InputRange>
|
||||
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
to_lower_copy(InputRange const& rng) {
|
||||
return sprout::algorithm::fixed::to_lower_copy<Result>(sprout::begin(rng), sprout::end(rng));
|
||||
}
|
||||
} // namespace fixed
|
||||
|
||||
using sprout::range::algorithm::fixed::to_lower_copy;
|
||||
} // namespace algorithm
|
||||
|
||||
namespace fixed {
|
||||
using sprout::range::algorithm::fixed::to_lower_copy;
|
||||
} // namespace fixed
|
||||
|
||||
using sprout::range::algorithm::fixed::to_lower_copy;
|
||||
} // namespace range
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_STRING_FIXED_TO_LOWER_COPY_HPP
|
41
sprout/range/algorithm/string/fixed/to_upper_copy.hpp
Normal file
41
sprout/range/algorithm/string/fixed/to_upper_copy.hpp
Normal file
|
@ -0,0 +1,41 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_STRING_FIXED_TO_UPPER_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_STRING_FIXED_TO_UPPER_COPY_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/container/traits.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 range {
|
||||
namespace algorithm {
|
||||
namespace fixed {
|
||||
//
|
||||
// to_upper_copy
|
||||
//
|
||||
template<typename InputRange, typename Result>
|
||||
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
to_upper_copy(InputRange const& rng, Result const& result) {
|
||||
return sprout::algorithm::fixed::to_upper_copy(sprout::begin(rng), sprout::end(rng), result);
|
||||
}
|
||||
|
||||
template<typename Result, typename InputRange>
|
||||
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
to_upper_copy(InputRange const& rng) {
|
||||
return sprout::algorithm::fixed::to_upper_copy<Result>(sprout::begin(rng), sprout::end(rng));
|
||||
}
|
||||
} // namespace fixed
|
||||
|
||||
using sprout::range::algorithm::fixed::to_upper_copy;
|
||||
} // namespace algorithm
|
||||
|
||||
namespace fixed {
|
||||
using sprout::range::algorithm::fixed::to_upper_copy;
|
||||
} // namespace fixed
|
||||
|
||||
using sprout::range::algorithm::fixed::to_upper_copy;
|
||||
} // namespace range
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_STRING_FIXED_TO_UPPER_COPY_HPP
|
8
sprout/range/algorithm/string/to_lower_copy.hpp
Normal file
8
sprout/range/algorithm/string/to_lower_copy.hpp
Normal file
|
@ -0,0 +1,8 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_STRING_TO_LOWER_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_STRING_TO_LOWER_COPY_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/range/algorithm/string/fixed/to_lower_copy.hpp>
|
||||
#include <sprout/range/algorithm/string/fit/to_lower_copy.hpp>
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_STRING_TO_LOWER_COPY_HPP
|
8
sprout/range/algorithm/string/to_upper_copy.hpp
Normal file
8
sprout/range/algorithm/string/to_upper_copy.hpp
Normal file
|
@ -0,0 +1,8 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_STRING_TO_UPPER_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_STRING_TO_UPPER_COPY_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/range/algorithm/string/fixed/to_upper_copy.hpp>
|
||||
#include <sprout/range/algorithm/string/fit/to_upper_copy.hpp>
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_STRING_TO_UPPER_COPY_HPP
|
Loading…
Add table
Add a link
Reference in a new issue