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

stripped tabs from files

Browse Source 
[SVN r18526]
This commit is contained in:
John Maddock
2003-05-24 11:14:53 +00:00
parent 8fb69853fc
commit a69678c3c6
3 changed files with 52 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
include/boost/regex/v4/perl_matcher_non_recursive.hpp
View File

@ -34,7 +34,7 @@ namespace boost{
namespace re_detail{ namespace re_detail{
template <class T> template <class T>
inline void destroy(T* p) inline void inplace_destroy(T* p)
{ {
(void)p; // warning suppression (void)p; // warning suppression
p->~T(); p->~T();
@ -761,14 +761,14 @@ bool perl_matcher<BidiIterator, Allocator, traits, Allocator2>::unwind_paren(boo
} }
// unwind stack: // unwind stack:
m_backup_state = pmp+1; m_backup_state = pmp+1;
boost::re_detail::destroy(pmp); boost::re_detail::inplace_destroy(pmp);
return true; // keep looking return true; // keep looking
} }
template <class BidiIterator, class Allocator, class traits, class Allocator2> template <class BidiIterator, class Allocator, class traits, class Allocator2>
bool perl_matcher<BidiIterator, Allocator, traits, Allocator2>::unwind_recursion_stopper(bool) bool perl_matcher<BidiIterator, Allocator, traits, Allocator2>::unwind_recursion_stopper(bool)
{ {
boost::re_detail::destroy(m_backup_state++); boost::re_detail::inplace_destroy(m_backup_state++);
pstate = 0; // nothing left to search pstate = 0; // nothing left to search
return false; // end of stack nothing more to search return false; // end of stack nothing more to search
} }
@ -781,7 +781,7 @@ bool perl_matcher<BidiIterator, Allocator, traits, Allocator2>::unwind_assertion
position = pmp->position; position = pmp->position;
bool result = (r == pmp->positive); bool result = (r == pmp->positive);
m_recursive_result = pmp->positive ? r : !r; m_recursive_result = pmp->positive ? r : !r;
boost::re_detail::destroy(pmp++); boost::re_detail::inplace_destroy(pmp++);
m_backup_state = pmp; m_backup_state = pmp;
return !result; // return false if the assertion was matched to stop search. return !result; // return false if the assertion was matched to stop search.
} }
@ -795,7 +795,7 @@ bool perl_matcher<BidiIterator, Allocator, traits, Allocator2>::unwind_alt(bool
pstate = pmp->pstate; pstate = pmp->pstate;
position = pmp->position; position = pmp->position;
} }
boost::re_detail::destroy(pmp++); boost::re_detail::inplace_destroy(pmp++);
m_backup_state = pmp; m_backup_state = pmp;
return r; return r;
} }
@ -804,7 +804,7 @@ template <class BidiIterator, class Allocator, class traits, class Allocator2>
bool perl_matcher<BidiIterator, Allocator, traits, Allocator2>::unwind_repeater_counter(bool) bool perl_matcher<BidiIterator, Allocator, traits, Allocator2>::unwind_repeater_counter(bool)
{ {
saved_repeater<BidiIterator>* pmp = static_cast<saved_repeater<BidiIterator>*>(m_backup_state); saved_repeater<BidiIterator>* pmp = static_cast<saved_repeater<BidiIterator>*>(m_backup_state);
boost::re_detail::destroy(pmp++); boost::re_detail::inplace_destroy(pmp++);
m_backup_state = pmp; m_backup_state = pmp;
return true; // keep looking return true; // keep looking
} }
@ -816,7 +816,7 @@ bool perl_matcher<BidiIterator, Allocator, traits, Allocator2>::unwind_extra_blo
void* condemmed = m_stack_base; void* condemmed = m_stack_base;
m_stack_base = pmp->base; m_stack_base = pmp->base;
m_backup_state = pmp->end; m_backup_state = pmp->end;
boost::re_detail::destroy(pmp); boost::re_detail::inplace_destroy(pmp);
block_cache.put(condemmed); block_cache.put(condemmed);
return true; // keep looking return true; // keep looking
} }
@ -825,7 +825,7 @@ template <class BidiIterator, class Allocator, class traits, class Allocator2>
inline void perl_matcher<BidiIterator, Allocator, traits, Allocator2>::destroy_single_repeat() inline void perl_matcher<BidiIterator, Allocator, traits, Allocator2>::destroy_single_repeat()
{ {
saved_single_repeat<BidiIterator>* p = static_cast<saved_single_repeat<BidiIterator>*>(m_backup_state); saved_single_repeat<BidiIterator>* p = static_cast<saved_single_repeat<BidiIterator>*>(m_backup_state);
boost::re_detail::destroy(p++); boost::re_detail::inplace_destroy(p++);
m_backup_state = p; m_backup_state = p;
} }
@ -1195,7 +1195,7 @@ bool perl_matcher<BidiIterator, Allocator, traits, Allocator2>::unwind_non_greed
pstate = pmp->pstate; pstate = pmp->pstate;
++(*next_count); ++(*next_count);
} }
boost::re_detail::destroy(pmp++); boost::re_detail::inplace_destroy(pmp++);
m_backup_state = pmp; m_backup_state = pmp;
return r; return r;
} }
@ -1228,3 +1228,4 @@ perl_matcher<BidiIterator, Allocator, traits, Allocator2>::s_unwind_table[] =
#endif #endif
#endif #endif