const_iterator BOOST_REGEX_CALL expression()const

{

return this->m_expression;

}

std::pair<const_iterator, const_iterator> BOOST_REGEX_CALL subexpression(std::size_t n)const

{

std::pair<const_iterator, const_iterator> p(expression() + pi.first, expression() + pi.second);

return p;

}

//

// begin, end:

const_iterator BOOST_REGEX_CALL begin()const

int BOOST_REGEX_CALL status()const

{

return this->m_status;

}

size_type BOOST_REGEX_CALL mark_count()const

{

}

const re_detail::re_syntax_base* get_first_state()const

{

return this->m_first_state;

}

unsigned get_restart_type()const

struct digraph : public std::pair<charT, charT>

{

digraph() : std::pair<charT, charT>(0, 0){}

digraph(charT c1) : std::pair<charT, charT>(c1, 0){}

digraph(charT c1, charT c2) : std::pair<charT, charT>(c1, c2)

{}

digraph(const digraph<charT>& d) : std::pair<charT, charT>(d.first, d.second){}

template <class Seq>

digraph(const Seq& s) : std::pair<charT, charT>()

{

BOOST_ASSERT(s.size() <= 2);

BOOST_ASSERT(s.size());

this->first = s[0];

// we have an existing re_literal, extend it:

std::ptrdiff_t off = getoffset(m_last_state);

m_pdata->m_data.extend(sizeof(charT));

m_last_state = result = static_cast<re_literal*>(getaddress(off));

charT* characters = static_cast<charT*>(static_cast<void*>(result+1));

characters[result->length] = m_traits.translate(c, m_icase);

}

return result;

}

template <class charT, class traits>

inline re_syntax_base* basic_regex_creator<charT, traits>::append_set(

++first;

string_type s1, s2;

// different actions now depending upon whether collation is turned on:

if(flags() & regex_constants::collate)

{

// we need to transform our range into sort keys:

charT a1[3] = { c1.first, c1.second, charT(0), };

charT a2[3] = { c2.first, c2.second, charT(0), };

s1 = this->m_traits.transform(a1, (a1[1] ? a1+2 : a1+1));

s2 = this->m_traits.transform(a2, (a2[1] ? a2+2 : a2+1));

if(s1.size() == 0)

s1 = string_type(1, charT(0));

if(s2.size() == 0)

s2 = string_type(1, charT(0));

}

else

last = char_set.equivalents_end();

while(first != last)

{

string_type s;

if(first->second)

{

charT cs[3] = { first->first, first->second, charT(0), };

s = m_traits.transform_primary(cs, cs+2);

}

else

s = m_traits.transform_primary(&first->first, &first->first+1);

if(s.empty())

return 0; // invalid or unsupported equivalence class

charT* p = static_cast<charT*>(this->m_pdata->m_data.extend(sizeof(charT) * (s.size()+1) ) );

case syntax_element_dot_rep:

case syntax_element_char_rep:

case syntax_element_short_set_rep:

case syntax_element_long_set_rep:

// set the state_id of this repeat:

static_cast<re_repeat*>(state)->state_id = m_repeater_id++;

case syntax_element_alt:

std::memset(static_cast<re_alt*>(state)->_map, 0, sizeof(static_cast<re_alt*>(state)->_map));

static_cast<re_alt*>(state)->can_be_null = 0;

case syntax_element_jump:

static_cast<re_jump*>(state)->alt.p = getaddress(static_cast<re_jump*>(state)->alt.i, state);

default:

if(state->next.i)

state->next.p = getaddress(state->next.i, state);

else

state->next.p = 0;

}

std::string message = "Encountered a forward reference to a recursive sub-expression that does not exist.";

boost::regex_error e(message, boost::regex_constants::error_bad_pattern, 0);

e.raise();

}

}

}

default:

break;

}

state = state->next.p;

}

}

{

std::string message = "Invalid lookbehind assertion encountered in the regular expression.";

boost::regex_error e(message, boost::regex_constants::error_bad_pattern, 0);

e.raise();

}

}

default:

state = state->next.p;

}

}

// now work through our list, building all the maps as we go:

recursion_restart = state->next.p;

state = static_cast<re_jump*>(state)->alt.p;

m_recursion_checks[recursion_sub] = true;

break;

}

m_recursion_checks[recursion_sub] = true;

}

case syntax_element_backref:

// can be null, and any character can match:

if(pnull)

*pnull |= mask;

case syntax_element_wild:

{

// can't be null, any character can match:

set_all_masks(l_map, mask);

return;

}

// need to handle independent subs as a special case:

if(static_cast<re_brace*>(state)->index == -3)

{

state = state->next.p->next.p;

break;

}

default:

state = state->next.p;

}

++not_last_jump;

}

}

{

unsigned state_id = static_cast<re_repeat*>(pt)->state_id;

static const boost::uintmax_t one = 1uL;

if(state_id <= sizeof(m_bad_repeats) * CHAR_BIT)

m_bad_repeats |= (one << state_id);

}

default:

break;

}

}

template <class charT, class traits>

case syntax_element_dot_rep:

case syntax_element_char_rep:

case syntax_element_short_set_rep:

case syntax_element_long_set_rep:

if(this->m_has_backrefs == 0)

static_cast<re_repeat*>(state)->leading = true;

default:

return;

}

}while(state);

}

& (regbase::no_perl_ex|regbase::mod_x))

== regbase::mod_x)

{

while((m_position != m_end) && !is_separator(*m_position++)){}

return true;

}

default:

result = parse_literal();

break;

}

return result;

}

{

bool negate = true;

switch(*m_position)

{

case 'w':

negate = false;

case 'W':

{

basic_char_set<charT, traits> char_set;

if(negate)

char_set.negate();

char_set.add_class(this->m_word_mask);

}

++m_position;

return true;

}

case 's':

negate = false;

case 'S':

return add_emacs_code(negate);

case 'c':

case 'C':

// not supported yet:

fail(regex_constants::error_escape, m_position - m_base, "The \\c and \\C escape sequences are not supported by POSIX basic regular expressions: try the Perl syntax instead.");

}

bool negate = false; // in case this is a character class escape: \w \d etc

switch(this->m_traits.escape_syntax_type(*m_position))

{

case regex_constants::escape_type_not_class:

negate = true;

case regex_constants::escape_type_class:

{

escape_type_class_jump:

typedef typename traits::char_class_type m_type;

m_type m = this->m_traits.lookup_classname(m_position, m_position+1);

if(m != 0)

case regex_constants::escape_type_G:

++m_position;

this->append_state(syntax_element_restart_continue);

break;

case regex_constants::escape_type_not_property:

negate = true;

case regex_constants::escape_type_property:

{

++m_position;

char_class_type m;

if(m_position == m_end)

{

return true;

}

goto escape_type_class_jump;

case regex_constants::escape_type_control_v:

if(0 == (this->flags() & (regbase::main_option_type | regbase::no_perl_ex)))

goto escape_type_class_jump;

default:

this->append_literal(unescape_character());

break;

}

return true;

}

}

else if((this->m_last_state->type == syntax_element_literal) && (static_cast<re_literal*>(this->m_last_state)->length > 1))

{

// the last state was a literal with more than one character, split it in two:

re_literal* lit = static_cast<re_literal*>(this->m_last_state);

charT c = (static_cast<charT*>(static_cast<void*>(lit+1)))[lit->length - 1];

// now append new state:

lit = static_cast<re_literal*>(this->append_state(syntax_element_literal, sizeof(re_literal) + sizeof(charT)));

lit->length = 1;

(static_cast<charT*>(static_cast<void*>(lit+1)))[0] = c;

insert_point = this->getoffset(this->m_last_state);

}

//

std::size_t min, max;

int v;

// skip whitespace:

while((m_position != m_end) && this->m_traits.isctype(*m_position, this->m_mask_space))

++m_position;

if(this->m_position == this->m_end)

{

}

// get min:

v = this->m_traits.toi(m_position, m_end, 10);

// skip whitespace:

if(v < 0)

{

}

{

}

min = v;

// see if we have a comma:

if(this->m_traits.syntax_type(*m_position) == regex_constants::syntax_comma)

{

// move on and error check:

++m_position;

// skip whitespace:

while((m_position != m_end) && this->m_traits.isctype(*m_position, this->m_mask_space))

++m_position;

if(this->m_position == this->m_end)

{

}

// get the value if any:

v = this->m_traits.toi(m_position, m_end, 10);

}

else

{

// no comma, max = min:

max = min;

}

// skip whitespace:

while((m_position != m_end) && this->m_traits.isctype(*m_position, this->m_mask_space))

++m_position;

// OK now check trailing }:

if(this->m_position == this->m_end)

{

}

if(isbasic)

{

if(this->m_traits.syntax_type(*m_position) == regex_constants::syntax_escape)

{

++m_position;

}

}

if(this->m_traits.syntax_type(*m_position) == regex_constants::syntax_close_brace)

++m_position;

else

{

}

//

// finally go and add the repeat, unless error:

//

if(min > max)

{

// select the actual extension used:

//

switch(this->m_traits.syntax_type(*m_position))

{

case regex_constants::syntax_or:

m_mark_reset = m_mark_count;

case regex_constants::syntax_colon:

//

// a non-capturing mark:

//

pb->index = markid = 0;

++m_position;

*/

#ifndef BOOST_CPP_REGEX_TRAITS_HPP_INCLUDED

#define BOOST_CPP_REGEX_TRAITS_HPP_INCLUDED

#include <boost/config.hpp>

#ifndef BOOST_NO_STD_LOCALE

#ifndef BOOST_RE_PAT_EXCEPT_HPP

#include <boost/regex/pattern_except.hpp>

#endif

}

template<class charT, class traits>

typename parser_buf<charT, traits>::pos_type

parser_buf<charT, traits>::seekoff(off_type off, ::std::ios_base::seekdir way, ::std::ios_base::openmode which)

{

if(which & ::std::ios_base::out)

return pos_type(off_type(-1));

std::ptrdiff_t size = this->egptr() - this->eback();

std::ptrdiff_t pos = this->gptr() - this->eback();

charT* g = this->eback();

{

case ::std::ios_base::beg:

if((off < 0) || (off > size))

return pos_type(off_type(-1));

else

this->setg(g, g + off, g + size);

// A bug in gcc 3.2 (and maybe other versions as well) treats

// p1 as a null terminated string, for efficiency reasons

// we work around this elsewhere, but just assert here that

// we adhere to gcc's (buggy) preconditions...

//

BOOST_ASSERT(*p2 == 0);

string_type result;

//

// swallowing all exceptions here is a bad idea

// however at least one std lib will always throw

// std::bad_alloc for certain arguments...

//

#ifndef BOOST_NO_EXCEPTIONS

BOOST_ASSERT(*p2 == 0);

//

// swallowing all exceptions here is a bad idea

// however at least one std lib will always throw

// std::bad_alloc for certain arguments...

//

#ifndef BOOST_NO_EXCEPTIONS

try{

#endif

result = this->m_pcollate->transform(p1, p2);

//

// Borland's STLPort version returns a NULL-terminated

#else

//

// some implementations (Dinkumware) append unnecessary trailing \0's:

while(result.size() && (charT(0) == *result.rbegin()))

result.erase(result.size() - 1);

#endif

#ifndef BOOST_NO_EXCEPTIONS

}

catch(...)

{

}

#endif

}

template <class charT>

typename cpp_regex_traits_implementation<charT>::string_type

cpp_regex_traits_implementation<charT>::lookup_collatename(const charT* p1, const charT* p2) const

{

iter_type pos = m_custom_collate_names.find(string_type(p1, p2));

if(pos != m_custom_collate_names.end())

return pos->second;

}

#if !defined(BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS)\

&& !BOOST_WORKAROUND(__BORLANDC__, <= 0x0551)

std::string name(p1, p2);

#else

std::string name;

const charT* p0 = p1;

while(p0 != p2)

name.append(1, char(*p0++));

#endif

name = lookup_default_collate_name(name);

#if !defined(BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS)\

&& !BOOST_WORKAROUND(__BORLANDC__, <= 0x0551)

if(name.size())

return string_type(name.begin(), name.end());

#else

if(name.size())

{

|| ((mask & ::boost::re_detail::char_class_horizontal_space) && this->m_pctype->is(std::ctype<charT>::space, c) && !(is_separator(c) || (c == '\v')));

}

#endif

template <class charT>

{

cpp_regex_traits_base<charT> key(l);

return ::boost::object_cache<cpp_regex_traits_base<charT>, cpp_regex_traits_implementation<charT> >::get(key, 5);

}

} // re_detail

# pragma warning(disable : 4660)

# endif

# endif

template class BOOST_REGEX_TEMPLATE_DECL basic_regex< BOOST_REGEX_CHAR_T BOOST_REGEX_TRAITS_T >;

template class BOOST_REGEX_TEMPLATE_DECL match_results< const BOOST_REGEX_CHAR_T* >;

#ifndef BOOST_NO_STD_ALLOCATOR

template class BOOST_REGEX_TEMPLATE_DECL ::boost::re_detail::perl_matcher<BOOST_REGEX_CHAR_T const *, match_results< const BOOST_REGEX_CHAR_T* >::allocator_type BOOST_REGEX_TRAITS_T >;

#endif

#if !(defined(BOOST_DINKUMWARE_STDLIB) && (BOOST_DINKUMWARE_STDLIB <= 1))\

&& !(defined(BOOST_INTEL_CXX_VERSION) && (BOOST_INTEL_CXX_VERSION <= 800))\

&& !(defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION))\

&& !defined(BOOST_REGEX_ICU_INSTANCES)

template class BOOST_REGEX_TEMPLATE_DECL match_results< std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator >;

#ifndef BOOST_NO_STD_ALLOCATOR

template class BOOST_REGEX_TEMPLATE_DECL ::boost::re_detail::perl_matcher< std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator, match_results< std::basic_string<BOOST_REGEX_CHAR_T>::const_iterator >::allocator_type, boost::regex_traits<BOOST_REGEX_CHAR_T > >;

#endif

#endif

# ifdef template

# undef template

# endif

#undef BOOST_REGEX_TEMPLATE_DECL

# ifndef BOOST_REGEX_INSTANTIATE

# ifdef __GNUC__

# define template __extension__ extern template

# else

# define template extern template

#pragma warning(pop)

#endif

namespace boost{

namespace re_detail{

template <class T>

struct regex_iterator_traits

{

typedef typename T::iterator_category iterator_category;

typedef typename T::value_type value_type;

format_first_only = format_no_copy << 1, /* Only replace first occurance. */

format_is_if = format_first_only << 1, /* internal use only. */

format_literal = format_is_if << 1 /* treat string as a literal */

} match_flags;

typedef unsigned long match_flag_type;

#else

typedef match_flags match_flag_type;

#ifdef __cplusplus

// in some cases (tested with Borland C++ 5.1, Rogue Wave lib version

// 0x020101) the test case was:

// {39135,0} < {0xff,0}

// which succeeds when it should not.

//

#ifndef _RWSTD_VER

template <class C, class T, class A>

inline int string_compare(const std::basic_string<C,T,A>& s, const C* p)

{

if(0 == *p)

{

if(s.empty() || ((s.size() == 1) && (s[0] == 0)))

return 0;

}

return s.compare(p);

}

#else

template <class C, class T, class A>

inline int string_compare(const std::basic_string<C,T,A>& s, const C* p)

{

if(0 == *p)

{

if(s.empty() || ((s.size() == 1) && (s[0] == 0)))

return 0;

}

return s.compare(p);

}

inline int string_compare(const std::string& s, const char* p)

{ return std::strcmp(s.c_str(), p); }

# ifndef BOOST_NO_WREGEX

inline int string_compare(const std::wstring& s, const wchar_t* p)

{ return std::wcscmp(s.c_str(), p); }

#endif

if(!(m_match_flags & (match_perl|match_posix)))

{

if((re_f & (regbase::main_option_type|regbase::no_perl_ex)) == 0)

m_match_flags |= match_perl;

else if((re_f & (regbase::main_option_type|regbase::emacs_ex)) == (regbase::basic_syntax_group|regbase::emacs_ex))

m_match_flags |= match_perl;

else

m_match_flags |= match_posix;

}

if(m_match_flags & match_posix)

{

m_temp_match.reset(new match_results<BidiIterator, Allocator>());

// reset our state machine:

position = base;

search_base = base;

state_count = 0;

m_match_flags |= regex_constants::match_all;

m_presult->set_base(base);

m_presult->set_named_subs(this->re.get_named_subs());

if(m_match_flags & match_posix)

m_result = *m_presult;

verify_options(re.flags(), m_match_flags);

if(0 == match_prefix())

state_count = 0;

if((m_match_flags & regex_constants::match_init) == 0)

{

// reset our state machine:

search_base = position = base;

pstate = re.get_first_state();

m_presult->set_base(base);

m_presult->set_named_subs(this->re.get_named_subs());

m_match_flags |= regex_constants::match_init;

}

else

{

if(position == last)

return false;

else

++position;

}

// reset $` start:

//if((base != search_base) && (base == backstop))

// m_match_flags |= match_prev_avail;

}

if(m_match_flags & match_posix)

{

m_result.set_base(base);

}

verify_options(re.flags(), m_match_flags);

// find out what kind of expression we have:

unsigned type = (m_match_flags & match_continuous) ?

match_all_states();

if(!m_has_found_match && m_has_partial_match && (m_match_flags & match_partial))

{

m_has_found_match = true;

m_presult->set_second(last, 0, false);

position = last;

}

#ifdef BOOST_REGEX_MATCH_EXTRA

if(m_has_found_match && (match_extra & m_match_flags))

{

//

// we have a match, reverse the capture information:

bool perl_matcher<BidiIterator, Allocator, traits>::match_word_boundary()

{

bool b; // indcates whether next character is a word character

if(position != last)

{

// prev and this character must be opposites:

b = traits_inst.isctype(*position, m_word_mask);

}

else

{

b = (m_match_flags & match_not_eow) ? true : false;

}

if((position == backstop) && ((m_match_flags & match_prev_avail) == 0))

//

bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);

std::size_t desired = greedy ? rep->max : rep->min;

if(::boost::is_random_access_iterator<BidiIterator>::value)

{

BidiIterator end = position;

BidiIterator origin(position);

while((position != end) && (traits_inst.translate(*position, icase) == what))

{

++position;

}

count = (unsigned)::boost::re_detail::distance(origin, position);

//

bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);

std::size_t desired = greedy ? rep->max : rep->min;

if(::boost::is_random_access_iterator<BidiIterator>::value)

{

BidiIterator end = position;

BidiIterator origin(position);

while((position != end) && map[static_cast<unsigned char>(traits_inst.translate(*position, icase))])

{

++position;

}

count = (unsigned)::boost::re_detail::distance(origin, position);

//

bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);

std::size_t desired = greedy ? rep->max : rep->min;

if(::boost::is_random_access_iterator<BidiIterator>::value)

{

BidiIterator end = position;

BidiIterator origin(position);

while((position != end) && (position != re_is_set_member(position, last, set, re.get_data(), icase)))

{

++position;

}

count = (unsigned)::boost::re_detail::distance(origin, position);

++position;

++count;

++state_count;

}while((count < rep->max) && (position != last) && !can_start(*position, rep->_map, mask_skip));

}

if(position == last)

{

// can't repeat any more, remove the pushed state:

destroy_single_repeat();

if((m_match_flags & match_partial) && (position == last) && (position != search_base))

m_has_partial_match = true;

//

bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);

std::size_t desired = greedy ? rep->max : rep->min;

if(::boost::is_random_access_iterator<BidiIterator>::value)

{

BidiIterator end = position;

BidiIterator origin(position);

while((position != end) && map[static_cast<unsigned char>(traits_inst.translate(*position, icase))])

{

++position;

}

count = (unsigned)::boost::re_detail::distance(origin, position);

//

bool greedy = (rep->greedy) && (!(m_match_flags & regex_constants::match_any) || m_independent);

std::size_t desired = greedy ? rep->max : rep->min;

if(::boost::is_random_access_iterator<BidiIterator>::value)

{

BidiIterator end = position;

BidiIterator origin(position);

while((position != end) && (position != re_is_set_member(position, last, set, re.get_data(), icase)))

{

++position;

}

count = (unsigned)::boost::re_detail::distance(origin, position);

case '$':

if((m_flags & format_sed) == 0)

{

format_perl();

break;

}

default:

put(*m_position);

++m_position;

break;

}

}

}

put((this->m_results)[this->m_results.size() > 1 ? static_cast<int>(this->m_results.size() - 1) : 1]);

break;

case '{':

have_brace = true;

++m_position;

default:

// see if we have a number:

{

std::ptrdiff_t len = ::boost::re_detail::distance(m_position, m_end);

//len = (std::min)(static_cast<std::ptrdiff_t>(2), len);

int v = this->toi(m_position, m_position + len, 10);

{

format_functor_c_string(const charT* ps) : func(ps) {}

template <class OutputIter>

OutputIter operator()(const Match& m, OutputIter i, boost::regex_constants::match_flag_type f, const Traits& t = Traits())

{

const charT* end = func;

while(*end) ++end;

return regex_format_imp(i, m, func, end, f, t);

}

private:

const charT* func;

{

format_functor_container(const Container& c) : func(c) {}

template <class OutputIter>

OutputIter operator()(const Match& m, OutputIter i, boost::regex_constants::match_flag_type f, const Traits& t = Traits())

{

return re_detail::regex_format_imp(i, m, func.begin(), func.end(), f, t);

}

private:

const Container& func;

format_functor_container(const format_functor_container&);

format_functor_container& operator=(const format_functor_container&);

void BOOST_REGEX_CALL resize(size_type n);

void* BOOST_REGEX_CALL extend(size_type n)

{

if(size_type(last - end) < n)

resize(n + (end - start));

end += n;

return result;

}

void* BOOST_REGEX_CALL insert(size_type pos, size_type n);

std::basic_string<charT, Traits1, Alloc1>& s,

const basic_regex<charT, Traits2>& e,

match_flag_type flags,

std::size_t max_split)

{

typedef typename std::basic_string<charT, Traits1, Alloc1>::const_iterator ci_t;

ci_t last = s.begin();

std::size_t init_size = max_split;

re_detail::split_pred<OutputIterator, charT, Traits1, Alloc1> pred(&last, &out, &max_split);

ci_t i, j;

i = s.begin();

j = s.end();

regex_grep(pred, i, j, e, flags);

//

// if there is still input left, do a final push as long as max_split

// is not exhausted, and we're not splitting sub-expressions rather

// than whitespace:

{

*out = std::basic_string<charT, Traits1, Alloc1>((ci_t)last, (ci_t)s.end());

++out;

last = s.end();

--max_split;

}

#ifndef BOOST_REGEX_V4_REGEX_TOKEN_ITERATOR_HPP

#define BOOST_REGEX_V4_REGEX_TOKEN_ITERATOR_HPP

#include <boost/shared_ptr.hpp>

#include <boost/detail/workaround.hpp>

#if (BOOST_WORKAROUND(__BORLANDC__, >= 0x560) && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)))\

|| BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003))

//

// Borland C++ Builder 6, and Visual C++ 6,

// can't cope with the array template constructor

// so we have a template member that will accept any type as

// argument, and then assert that is really is an array:

#endif

#ifdef BOOST_HAS_ABI_HEADERS

# include BOOST_ABI_PREFIX

#endif

#ifdef BOOST_MSVC

#pragma warning(pop)

#endif

template <class BidirectionalIterator,

class charT,

class traits>

class regex_token_iterator_implementation

regex_token_iterator_implementation(const regex_type* p, BidirectionalIterator last, int sub, match_flag_type f)

: end(last), re(*p), flags(f){ subs.push_back(sub); }

regex_token_iterator_implementation(const regex_type* p, BidirectionalIterator last, const std::vector<int>& v, match_flag_type f)

: end(last), re(*p), flags(f), subs(v){}

#if !BOOST_WORKAROUND(__HP_aCC, < 60700)

#if (BOOST_WORKAROUND(__BORLANDC__, >= 0x560) && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)))\

|| BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) \

|| BOOST_WORKAROUND(__HP_aCC, < 60700)

template <class T>

regex_token_iterator_implementation(const regex_type* p, BidirectionalIterator last, const T& submatches, match_flag_type f)

: end(last), re(*p), flags(f)

{

{

if(!pdata->init(a))

pdata.reset();

}

#if !BOOST_WORKAROUND(__HP_aCC, < 60700)

#if (BOOST_WORKAROUND(__BORLANDC__, >= 0x560) && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)))\

|| BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) \

|| BOOST_WORKAROUND(__HP_aCC, < 60700)

template <class T>

regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,

const T& submatches, match_flag_type m = match_default)

: pdata(new impl(&re, b, submatches, m))

}

template <class charT, class traits, class ST, class SA>

inline regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits> make_regex_token_iterator(const std::basic_string<charT, ST, SA>& p, const basic_regex<charT, traits>& e, int submatch = 0, regex_constants::match_flag_type m = regex_constants::match_default)

{

return regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>(p.begin(), p.end(), e, submatch, m);

}

template <class charT, class traits, std::size_t N>

inline regex_token_iterator<const charT*, charT, traits> make_regex_token_iterator(const charT* p, const basic_regex<charT, traits>& e, const int (&submatch)[N], regex_constants::match_flag_type m = regex_constants::match_default)

{

return regex_token_iterator<const charT*, charT, traits>(p, p+traits::length(p), e, submatch, m);

}

template <class charT, class traits, class ST, class SA, std::size_t N>

inline regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits> make_regex_token_iterator(const std::basic_string<charT, ST, SA>& p, const basic_regex<charT, traits>& e, const int (&submatch)[N], regex_constants::match_flag_type m = regex_constants::match_default)

{

return regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>(p.begin(), p.end(), e, submatch, m);

}

template <class charT, class traits>

inline regex_token_iterator<const charT*, charT, traits> make_regex_token_iterator(const charT* p, const basic_regex<charT, traits>& e, const std::vector<int>& submatch, regex_constants::match_flag_type m = regex_constants::match_default)

{

return regex_token_iterator<const charT*, charT, traits>(p, p+traits::length(p), e, submatch, m);

}

template <class charT, class traits, class ST, class SA>

inline regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits> make_regex_token_iterator(const std::basic_string<charT, ST, SA>& p, const basic_regex<charT, traits>& e, const std::vector<int>& submatch, regex_constants::match_flag_type m = regex_constants::match_default)

{

return regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>(p.begin(), p.end(), e, submatch, m);

}

#ifdef BOOST_MSVC

#pragma warning(push)

#pragma warning(disable: 4103)

#endif

#ifdef BOOST_HAS_ABI_HEADERS

# include BOOST_ABI_SUFFIX

#endif

// this is what our implementation will actually store;

// it provides default implementations of the "optional"

// interfaces that we support, in addition to the

// required "standard" ones:

//

namespace re_detail{

BOOST_MPL_HAS_XXX_TRAIT_DEF(boost_extensions_tag)

#else

template<class T>

struct has_boost_extensions_tag

{

BOOST_STATIC_CONSTANT(bool, value = false);

template <class BaseT, bool has_extensions>

struct compute_wrapper_base

{

typedef BaseT type;

};

template <class BaseT>

struct compute_wrapper_base<BaseT, false>

{

typedef default_wrapper<BaseT> type;

};

#else

/*

*

* Copyright (c) 2004

* John Maddock

*

* 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_traits_defaults.hpp

* VERSION see <boost/version.hpp>

* DESCRIPTION: Declares API's for access to regex_traits default properties.

*/

template <>

inline bool is_combining<unsigned char>(unsigned char)

{

return false;

}

#if !defined(__hpux) && !defined(__WINSCW__) // can't use WCHAR_MAX/MIN in pp-directives

template<>

inline bool is_combining<wchar_t>(wchar_t c)

{

return is_combining_implementation(static_cast<unsigned short>(c));

}

#elif !defined(__DECCXX) && !defined(__osf__) && !defined(__OSF__) && defined(WCHAR_MIN) && (WCHAR_MIN == 0) && !defined(BOOST_NO_INTRINSIC_WCHAR_T)

// is a charT c a line separator?

//

template <class charT>

inline bool is_separator(charT c)

{

return BOOST_REGEX_MAKE_BOOL(

|| (static_cast<boost::uint16_t>(c) == 0x85u));

}

template <>

inline bool is_separator<char>(char c)

{

return BOOST_REGEX_MAKE_BOOL((c == '\n') || (c == '\r') || (c == '\f'));

'u', 'p', 'p', 'e', 'r',

'v',

'w', 'o', 'r', 'd',

'x', 'd', 'i', 'g', 'i', 't',

};

{

{data+0, data+5,}, // alnum

{data+5, data+10,}, // alpha

{data+10, data+15,}, // blank

{data+15, data+20,}, // cntrl

{data+20, data+21,}, // d

{data+63, data+64,}, // w

{data+63, data+67,}, // word

{data+67, data+73,}, // xdigit

};

static const character_pointer_range<charT>* ranges_begin = ranges;

static const character_pointer_range<charT>* ranges_end = ranges + (sizeof(ranges)/sizeof(ranges[0]));

character_pointer_range<charT> t = { p1, p2, };

const character_pointer_range<charT>* p = std::lower_bound(ranges_begin, ranges_end, t);

if((p != ranges_end) && (t == *p))

return static_cast<int>(p - ranges);

return -1;

}

inline const charT* get_escape_R_string()

{

#ifdef BOOST_MSVC

# pragma warning(push)

# pragma warning(disable:4309 4245)

#endif

'\\', 'x', '{', '2', '0', '2', '9', '}', ']', ')', '\0' };

charT c = static_cast<charT>(0x2029u);

bool b = (static_cast<unsigned>(c) == 0x2029u);

return (b ? e1 : e2);

#ifdef BOOST_MSVC

# pragma warning(pop)

#endif

}

inline const char* get_escape_R_string<char>()

{

#ifdef BOOST_MSVC

# pragma warning(push)

# pragma warning(disable:4309)

#endif

'|', '[', '\x0A', '\x0B', '\x0C', '\x85', ']', ')', '\0' };

return e2;

#ifdef BOOST_MSVC

# pragma warning(pop)

#endif

}

namespace boost{

template <class BidiIterator>

struct sub_match : public std::pair<BidiIterator, BidiIterator>

{

typedef typename re_detail::regex_iterator_traits<BidiIterator>::value_type value_type;

typedef std::ptrdiff_t difference_type;

#else

typedef typename re_detail::regex_iterator_traits<BidiIterator>::difference_type difference_type;

#endif

typedef BidiIterator iterator_type;

typedef BidiIterator iterator;

bool matched;

sub_match() : std::pair<BidiIterator, BidiIterator>(), matched(false) {}

sub_match(BidiIterator i) : std::pair<BidiIterator, BidiIterator>(i, i), matched(false) {}

#if !defined(BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS)\

&& !BOOST_WORKAROUND(__BORLANDC__, <= 0x0551)\

&& !BOOST_WORKAROUND(__DECCXX_VER, BOOST_TESTED_AT(60590042))

template <class T, class A>

operator std::basic_string<value_type, T, A> ()const

{

return matched ? std::basic_string<value_type, T, A>(this->first, this->second) : std::basic_string<value_type, T, A>();

*/

#ifndef BOOST_REGEX_V4_U32REGEX_TOKEN_ITERATOR_HPP

#define BOOST_REGEX_V4_U32REGEX_TOKEN_ITERATOR_HPP

#if (BOOST_WORKAROUND(__BORLANDC__, >= 0x560) && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570)))\

|| BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003))

//

// Borland C++ Builder 6, and Visual C++ 6,

// can't cope with the array template constructor

// so we have a template member that will accept any type as

// argument, and then assert that is really is an array:

namespace boost{

#ifdef BOOST_HAS_ABI_HEADERS

# include BOOST_ABI_PREFIX

#endif

# pragma warning(push)

# pragma warning(disable:4700)

#endif

template <class BidirectionalIterator>

class u32regex_token_iterator_implementation

public:

u32regex_token_iterator_implementation(const regex_type* p, BidirectionalIterator last, int sub, match_flag_type f)

: end(last), re(*p), flags(f){ subs.push_back(sub); }

u32regex_token_iterator_implementation(const regex_type* p, BidirectionalIterator last, const std::vector<int>& v, match_flag_type f)

: end(last), re(*p), flags(f), subs(v){}

|| BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) \

|| BOOST_WORKAROUND(__HP_aCC, < 60700)

template <class T>

u32regex_token_iterator_implementation(const regex_type* p, BidirectionalIterator last, const T& submatches, match_flag_type f)

: end(last), re(*p), flags(f)

{

const std::vector<int>& submatches, match_flag_type m = match_default)

: pdata(new impl(&re, b, submatches, m))

{

if(!pdata->init(a))

pdata.reset();

}

|| BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) \

|| BOOST_WORKAROUND(__HP_aCC, < 60700)

template <class T>

u32regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,

const T& submatches, match_flag_type m = match_default)

: pdata(new impl(&re, b, submatches, m))

}

inline u32regex_token_iterator<const UChar*> make_u32regex_token_iterator(const U_NAMESPACE_QUALIFIER UnicodeString& s, const u32regex& e, int submatch = 0, regex_constants::match_flag_type m = regex_constants::match_default)

{

return u32regex_token_iterator<const UChar*>(s.getBuffer(), s.getBuffer() + s.length(), e, submatch, m);

}

// construction from a reference to an array:

template <std::size_t N>

inline u32regex_token_iterator<const char*> make_u32regex_token_iterator(const char* p, const u32regex& e, const int (&submatch)[N], regex_constants::match_flag_type m = regex_constants::match_default)

{

return u32regex_token_iterator<const char*>(p, p+std::strlen(p), e, submatch, m);

}

}

template <std::size_t N>

inline u32regex_token_iterator<const UChar*> make_u32regex_token_iterator(const U_NAMESPACE_QUALIFIER UnicodeString& s, const u32regex& e, const int (&submatch)[N], regex_constants::match_flag_type m = regex_constants::match_default)

{

return u32regex_token_iterator<const UChar*>(s.getBuffer(), s.getBuffer() + s.length(), e, submatch, m);

}

// construction from a vector of sub_match state_id's:

inline u32regex_token_iterator<const char*> make_u32regex_token_iterator(const char* p, const u32regex& e, const std::vector<int>& submatch, regex_constants::match_flag_type m = regex_constants::match_default)

{

return u32regex_token_iterator<const char*>(p, p+std::strlen(p), e, submatch, m);

}

}

inline u32regex_token_iterator<const UChar*> make_u32regex_token_iterator(const U_NAMESPACE_QUALIFIER UnicodeString& s, const u32regex& e, const std::vector<int>& submatch, regex_constants::match_flag_type m = regex_constants::match_default)

{

return u32regex_token_iterator<const UChar*>(s.getBuffer(), s.getBuffer() + s.length(), e, submatch, m);

}

# pragma warning(pop)

#endif

#ifdef BOOST_HAS_ABI_HEADERS

# include BOOST_ABI_SUFFIX

#endif

{

iter_type pos = m_custom_collate_names.find(string_type(p1, p2));

if(pos != m_custom_collate_names.end())

return pos->second;

}

#if !defined(BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS)\

&& !BOOST_WORKAROUND(__BORLANDC__, <= 0x0551)

std::string name(p1, p2);

#else

std::string name;

const charT* p0 = p1;

while(p0 != p2)

name.append(1, char(*p0++));

#endif

name = lookup_default_collate_name(name);

#if !defined(BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS)\

&& !BOOST_WORKAROUND(__BORLANDC__, <= 0x0551)

if(name.size())

return string_type(name.begin(), name.end());

#else

if(name.size())

{

return masks[state_id];

return masks[0];

}

template <class charT>

{

// TODO: create a cache for previously constructed objects.

return boost::object_cache< ::boost::re_detail::lcid_type, w32_regex_traits_implementation<charT> >::get(l, 5);

}

} // re_detail