boostorg/regex
1
0
Fork 1
mirror of https://github.com/boostorg/regex.git synced 2025-07-18 14:52:08 +02:00
Code Issues Packages Projects Releases Wiki Activity

Consolidated patches and performance tweeks.

Browse Source 
[SVN r31492]
This commit is contained in:
John Maddock
2005-10-27 10:24:50 +00:00
parent 5fb9181efa
commit ffa362ce17
8 changed files with 65 additions and 64 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
include/boost/regex/v4/perl_matcher_recursive.hpp
View File

@ -501,25 +501,39 @@ bool perl_matcher<BidiIterator, Allocator, traits>::match_char_repeat()
const re_repeat* rep = static_cast<const re_repeat*>(pstate);
BOOST_ASSERT(1 == static_cast<const re_literal*>(rep->next.p)->length);
const char_type what = *reinterpret_cast<const char_type*>(static_cast<const re_literal*>(rep->next.p) + 1);
unsigned count = 0;
//
// start by working out how much we can skip:
//
bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);
std::size_t desired = greedy ? rep->max : rep->min;
std::size_t count, desired;
if(::boost::is_random_access_iterator<BidiIterator>::value)
{
BidiIterator end = position;
std::advance(end, (std::min)((unsigned)::boost::re_detail::distance(position, last), desired));
BidiIterator origin(position);
while((position != end) && (traits_inst.translate(*position, icase) == what))
desired =
(std::min)(
(std::size_t)(greedy ? rep->max : rep->min),
(std::size_t)::boost::re_detail::distance(position, last));
count = desired;
++desired;
if(icase)
{
++position;
while(--desired && (traits_inst.translate_nocase(*position) == what))
{
++position;
}
}
count = (unsigned)::boost::re_detail::distance(origin, position);
else
{
while(--desired && (traits_inst.translate(*position) == what))
{
++position;
}
}
count = count - desired;
}
else
{
count = 0;
desired = greedy ? rep->max : rep->min;
while((count < desired) && (position != last) && (traits_inst.translate(*position, icase) == what))
{
++position;