104 lines
3.5 KiB
C++
104 lines
3.5 KiB
C++
|
/*
|
||
|
|
*
|
||
|
|
* Copyright (c) 1998-2002
|
||
|
|
* John Maddock
|
||
|
|
*
|
||
|
|
* Use, modification and distribution are subject to 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)
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
/*
|
||
|
|
* LOCATION: see http://www.boost.org for most recent version.
|
||
|
|
* FILE regex_search.hpp
|
||
|
|
* VERSION see <boost/version.hpp>
|
||
|
|
* DESCRIPTION: Provides regex_search implementation.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef BOOST_REGEX_V5_REGEX_SEARCH_HPP
|
||
|
|
#define BOOST_REGEX_V5_REGEX_SEARCH_HPP
|
||
|
|
|
||
|
|
|
||
|
|
namespace boost{
|
||
|
|
|
||
|
|
template <class BidiIterator, class Allocator, class charT, class traits>
|
||
|
|
bool regex_search(BidiIterator first, BidiIterator last,
|
||
|
|
match_results<BidiIterator, Allocator>& m,
|
||
|
|
const basic_regex<charT, traits>& e,
|
||
|
|
match_flag_type flags = match_default)
|
||
|
|
{
|
||
|
|
return regex_search(first, last, m, e, flags, first);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class BidiIterator, class Allocator, class charT, class traits>
|
||
|
|
bool regex_search(BidiIterator first, BidiIterator last,
|
||
|
|
match_results<BidiIterator, Allocator>& m,
|
||
|
|
const basic_regex<charT, traits>& e,
|
||
|
|
match_flag_type flags,
|
||
|
|
BidiIterator base)
|
||
|
|
{
|
||
|
|
if(e.flags() & regex_constants::failbit)
|
||
|
|
return false;
|
||
|
|
|
||
|
|
BOOST_REGEX_DETAIL_NS::perl_matcher<BidiIterator, Allocator, traits> matcher(first, last, m, e, flags, base);
|
||
|
|
return matcher.find();
|
||
|
|
}
|
||
|
|
|
||
|
|
//
|
||
|
|
// regex_search convenience interfaces:
|
||
|
|
//
|
||
|
|
template <class charT, class Allocator, class traits>
|
||
|
|
inline bool regex_search(const charT* str,
|
||
|
|
match_results<const charT*, Allocator>& m,
|
||
|
|
const basic_regex<charT, traits>& e,
|
||
|
|
match_flag_type flags = match_default)
|
||
|
|
{
|
||
|
|
return regex_search(str, str + traits::length(str), m, e, flags);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class ST, class SA, class Allocator, class charT, class traits>
|
||
|
|
inline bool regex_search(const std::basic_string<charT, ST, SA>& s,
|
||
|
|
match_results<typename std::basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
|
||
|
|
const basic_regex<charT, traits>& e,
|
||
|
|
match_flag_type flags = match_default)
|
||
|
|
{
|
||
|
|
return regex_search(s.begin(), s.end(), m, e, flags);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class BidiIterator, class charT, class traits>
|
||
|
|
bool regex_search(BidiIterator first, BidiIterator last,
|
||
|
|
const basic_regex<charT, traits>& e,
|
||
|
|
match_flag_type flags = match_default)
|
||
|
|
{
|
||
|
|
if(e.flags() & regex_constants::failbit)
|
||
|
|
return false;
|
||
|
|
|
||
|
|
match_results<BidiIterator> m;
|
||
|
|
typedef typename match_results<BidiIterator>::allocator_type match_alloc_type;
|
||
|
|
BOOST_REGEX_DETAIL_NS::perl_matcher<BidiIterator, match_alloc_type, traits> matcher(first, last, m, e, flags | regex_constants::match_any, first);
|
||
|
|
return matcher.find();
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class charT, class traits>
|
||
|
|
inline bool regex_search(const charT* str,
|
||
|
|
const basic_regex<charT, traits>& e,
|
||
|
|
match_flag_type flags = match_default)
|
||
|
|
{
|
||
|
|
return regex_search(str, str + traits::length(str), e, flags);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class ST, class SA, class charT, class traits>
|
||
|
|
inline bool regex_search(const std::basic_string<charT, ST, SA>& s,
|
||
|
|
const basic_regex<charT, traits>& e,
|
||
|
|
match_flag_type flags = match_default)
|
||
|
|
{
|
||
|
|
return regex_search(s.begin(), s.end(), e, flags);
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace boost
|
||
|
|
|
||
|
|
#endif // BOOST_REGEX_V5_REGEX_SEARCH_HPP
|
||
|
|
|
||
|
|
|