FM / string

/usr/include/boost/algorithm/string

Name	Size	Mode	Actions
detail/	-	0755	rm
std/	-	0755	rm
case_conv.hpp	6169	0644	edit dl rm
classification.hpp	11642	0644	edit dl rm
compare.hpp	6391	0644	edit dl rm
concept.hpp	2344	0644	edit dl rm
config.hpp	790	0644	edit dl rm
constants.hpp	999	0644	edit dl rm
erase.hpp	31813	0644	edit dl rm
find.hpp	13071	0644	edit dl rm
finder.hpp	9386	0644	edit dl rm
find_format.hpp	10243	0644	edit dl rm
find_iterator.hpp	12209	0644	edit dl rm
formatter.hpp	4223	0644	edit dl rm
iter_find.hpp	7513	0644	edit dl rm
join.hpp	5046	0644	edit dl rm
predicate.hpp	17359	0644	edit dl rm
predicate_facade.hpp	1322	0644	edit dl rm
regex.hpp	24966	0644	edit dl rm
regex_find_format.hpp	3204	0644	edit dl rm
replace.hpp	35947	0644	edit dl rm
sequence_traits.hpp	3892	0644	edit dl rm
split.hpp	6838	0644	edit dl rm
std_containers_traits.hpp	836	0644	edit dl rm
trim.hpp	14189	0644	edit dl rm
trim_all.hpp	8213	0644	edit dl rm
yes_no_type.hpp	999	0644	edit dl rm

Edit: /usr/include/boost/algorithm/string/concept.hpp (2344B)

//  Boost string_algo library concept.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_CONCEPT_HPP
#define BOOST_STRING_CONCEPT_HPP

#include <boost/concept_check.hpp>
#include <boost/range/iterator_range_core.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>

/*! \file 
    Defines concepts used in string_algo library
*/

namespace boost {
    namespace algorithm {

//! Finder concept
        /*!
            Defines the Finder concept. Finder is a functor which selects
            an arbitrary part of a string. Search is performed on
            the range specified by starting and ending iterators.

Result of the find operation must be convertible to iterator_range.
        */
        template<typename FinderT, typename IteratorT>
        struct FinderConcept
        {
        private:
            typedef iterator_range<IteratorT> range;
        public:
            void constraints()
            {
                // Operation
                r=(*pF)(i,i);
            }
        private:
            range r;
            IteratorT i;
            FinderT* pF;    
        }; // Finder_concept

//! Formatter concept
        /*!
            Defines the Formatter concept. Formatter is a functor, which
            takes a result from a finder operation and transforms it
            in a specific way.

Result must be a container supported by container_traits, 
            or a reference to it.
        */
        template<typename FormatterT, typename FinderT, typename IteratorT>
        struct FormatterConcept
        {
        public:
            void constraints()
            {
                // Operation
                ::boost::begin((*pFo)( (*pF)(i,i) ));
                ::boost::end((*pFo)( (*pF)(i,i) ));
            }
        private:
            IteratorT i;
            FinderT* pF;
            FormatterT *pFo;
        }; // FormatterConcept;

} // namespace algorithm
} // namespace boost

#endif  // BOOST_STRING_CONCEPT_HPP

// Boost string_algo library concept.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_CONCEPT_HPP #define BOOST_STRING_CONCEPT_HPP #include #include #include #include /*! \file Defines concepts used in string_algo library */ namespace boost { namespace algorithm { //! Finder concept /*! Defines the Finder concept. Finder is a functor which selects an arbitrary part of a string. Search is performed on the range specified by starting and ending iterators. Result of the find operation must be convertible to iterator_range. */ template struct FinderConcept { private: typedef iterator_range range; public: void constraints() { // Operation r=(*pF)(i,i); } private: range r; IteratorT i; FinderT* pF; }; // Finder_concept //! Formatter concept /*! Defines the Formatter concept. Formatter is a functor, which takes a result from a finder operation and transforms it in a specific way. Result must be a container supported by container_traits, or a reference to it. */ template struct FormatterConcept { public: void constraints() { // Operation ::boost::begin((*pFo)( (*pF)(i,i) )); ::boost::end((*pFo)( (*pF)(i,i) )); } private: IteratorT i; FinderT* pF; FormatterT *pFo; }; // FormatterConcept; } // namespace algorithm } // namespace boost #endif // BOOST_STRING_CONCEPT_HPP