-
Notifications
You must be signed in to change notification settings - Fork 77
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
8b79c57
commit e5a1937
Showing
4,984 changed files
with
889,031 additions
and
10,672 deletions.
The diff you're trying to view is too large. We only load the first 3000 changed files.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,31 @@ | ||
| // Boost string_algo library string_algo.hpp header file ---------------------------// | ||
|
|
||
| // Copyright Pavol Droba 2002-2004. | ||
| // | ||
| // Distributed under the Boost Software License, Version 1.0. | ||
| // (See accompanying file LICENSE_1_0.txt or copy at | ||
| // http://www.boost.org/LICENSE_1_0.txt) | ||
|
|
||
| // See http://www.boost.org/ for updates, documentation, and revision history. | ||
|
|
||
| #ifndef BOOST_STRING_ALGO_HPP | ||
| #define BOOST_STRING_ALGO_HPP | ||
|
|
||
| /*! \file | ||
| Cumulative include for string_algo library | ||
| */ | ||
|
|
||
| #include <boost/algorithm/string/std_containers_traits.hpp> | ||
| #include <boost/algorithm/string/trim.hpp> | ||
| #include <boost/algorithm/string/case_conv.hpp> | ||
| #include <boost/algorithm/string/predicate.hpp> | ||
| #include <boost/algorithm/string/find.hpp> | ||
| #include <boost/algorithm/string/split.hpp> | ||
| #include <boost/algorithm/string/join.hpp> | ||
| #include <boost/algorithm/string/replace.hpp> | ||
| #include <boost/algorithm/string/erase.hpp> | ||
| #include <boost/algorithm/string/classification.hpp> | ||
| #include <boost/algorithm/string/find_iterator.hpp> | ||
|
|
||
|
|
||
| #endif // BOOST_STRING_ALGO_HPP |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,176 @@ | ||
| // Boost string_algo library case_conv.hpp header file ---------------------------// | ||
|
|
||
| // Copyright Pavol Droba 2002-2003. | ||
| // | ||
| // Distributed under the Boost Software License, Version 1.0. | ||
| // (See accompanying file LICENSE_1_0.txt or copy at | ||
| // http://www.boost.org/LICENSE_1_0.txt) | ||
|
|
||
| // See http://www.boost.org/ for updates, documentation, and revision history. | ||
|
|
||
| #ifndef BOOST_STRING_CASE_CONV_HPP | ||
| #define BOOST_STRING_CASE_CONV_HPP | ||
|
|
||
| #include <boost/algorithm/string/config.hpp> | ||
| #include <algorithm> | ||
| #include <locale> | ||
| #include <boost/iterator/transform_iterator.hpp> | ||
|
|
||
| #include <boost/range/as_literal.hpp> | ||
| #include <boost/range/begin.hpp> | ||
| #include <boost/range/end.hpp> | ||
| #include <boost/range/value_type.hpp> | ||
|
|
||
| #include <boost/algorithm/string/detail/case_conv.hpp> | ||
|
|
||
| /*! \file | ||
| Defines sequence case-conversion algorithms. | ||
| Algorithms convert each element in the input sequence to the | ||
| desired case using provided locales. | ||
| */ | ||
|
|
||
| namespace boost { | ||
| namespace algorithm { | ||
|
|
||
| // to_lower -----------------------------------------------// | ||
|
|
||
| //! Convert to lower case | ||
| /*! | ||
| Each element of the input sequence is converted to lower | ||
| case. The result is a copy of the input converted to lower case. | ||
| It is returned as a sequence or copied to the output iterator. | ||
| \param Output An output iterator to which the result will be copied | ||
| \param Input An input range | ||
| \param Loc A locale used for conversion | ||
| \return | ||
| An output iterator pointing just after the last inserted character or | ||
| a copy of the input | ||
| \note The second variant of this function provides the strong exception-safety guarantee | ||
| */ | ||
| template<typename OutputIteratorT, typename RangeT> | ||
| inline OutputIteratorT | ||
| to_lower_copy( | ||
| OutputIteratorT Output, | ||
| const RangeT& Input, | ||
| const std::locale& Loc=std::locale()) | ||
| { | ||
| return ::boost::algorithm::detail::transform_range_copy( | ||
| Output, | ||
| ::boost::as_literal(Input), | ||
| ::boost::algorithm::detail::to_lowerF< | ||
| typename range_value<RangeT>::type >(Loc)); | ||
| } | ||
|
|
||
| //! Convert to lower case | ||
| /*! | ||
| \overload | ||
| */ | ||
| template<typename SequenceT> | ||
| inline SequenceT to_lower_copy( | ||
| const SequenceT& Input, | ||
| const std::locale& Loc=std::locale()) | ||
| { | ||
| return ::boost::algorithm::detail::transform_range_copy<SequenceT>( | ||
| Input, | ||
| ::boost::algorithm::detail::to_lowerF< | ||
| typename range_value<SequenceT>::type >(Loc)); | ||
| } | ||
|
|
||
| //! Convert to lower case | ||
| /*! | ||
| Each element of the input sequence is converted to lower | ||
| case. The input sequence is modified in-place. | ||
| \param Input A range | ||
| \param Loc a locale used for conversion | ||
| */ | ||
| template<typename WritableRangeT> | ||
| inline void to_lower( | ||
| WritableRangeT& Input, | ||
| const std::locale& Loc=std::locale()) | ||
| { | ||
| ::boost::algorithm::detail::transform_range( | ||
| ::boost::as_literal(Input), | ||
| ::boost::algorithm::detail::to_lowerF< | ||
| typename range_value<WritableRangeT>::type >(Loc)); | ||
| } | ||
|
|
||
| // to_upper -----------------------------------------------// | ||
|
|
||
| //! Convert to upper case | ||
| /*! | ||
| Each element of the input sequence is converted to upper | ||
| case. The result is a copy of the input converted to upper case. | ||
| It is returned as a sequence or copied to the output iterator | ||
| \param Output An output iterator to which the result will be copied | ||
| \param Input An input range | ||
| \param Loc A locale used for conversion | ||
| \return | ||
| An output iterator pointing just after the last inserted character or | ||
| a copy of the input | ||
| \note The second variant of this function provides the strong exception-safety guarantee | ||
| */ | ||
| template<typename OutputIteratorT, typename RangeT> | ||
| inline OutputIteratorT | ||
| to_upper_copy( | ||
| OutputIteratorT Output, | ||
| const RangeT& Input, | ||
| const std::locale& Loc=std::locale()) | ||
| { | ||
| return ::boost::algorithm::detail::transform_range_copy( | ||
| Output, | ||
| ::boost::as_literal(Input), | ||
| ::boost::algorithm::detail::to_upperF< | ||
| typename range_value<RangeT>::type >(Loc)); | ||
| } | ||
|
|
||
| //! Convert to upper case | ||
| /*! | ||
| \overload | ||
| */ | ||
| template<typename SequenceT> | ||
| inline SequenceT to_upper_copy( | ||
| const SequenceT& Input, | ||
| const std::locale& Loc=std::locale()) | ||
| { | ||
| return ::boost::algorithm::detail::transform_range_copy<SequenceT>( | ||
| Input, | ||
| ::boost::algorithm::detail::to_upperF< | ||
| typename range_value<SequenceT>::type >(Loc)); | ||
| } | ||
|
|
||
| //! Convert to upper case | ||
| /*! | ||
| Each element of the input sequence is converted to upper | ||
| case. The input sequence is modified in-place. | ||
| \param Input An input range | ||
| \param Loc a locale used for conversion | ||
| */ | ||
| template<typename WritableRangeT> | ||
| inline void to_upper( | ||
| WritableRangeT& Input, | ||
| const std::locale& Loc=std::locale()) | ||
| { | ||
| ::boost::algorithm::detail::transform_range( | ||
| ::boost::as_literal(Input), | ||
| ::boost::algorithm::detail::to_upperF< | ||
| typename range_value<WritableRangeT>::type >(Loc)); | ||
| } | ||
|
|
||
| } // namespace algorithm | ||
|
|
||
| // pull names to the boost namespace | ||
| using algorithm::to_lower; | ||
| using algorithm::to_lower_copy; | ||
| using algorithm::to_upper; | ||
| using algorithm::to_upper_copy; | ||
|
|
||
| } // namespace boost | ||
|
|
||
| #endif // BOOST_STRING_CASE_CONV_HPP |
Oops, something went wrong.