Chris@16: /*
Chris@16:  *
Chris@16:  * Copyright (c) 1998-2009
Chris@16:  * John Maddock
Chris@16:  *
Chris@16:  * Use, modification and distribution are subject to the 
Chris@16:  * Boost Software License, Version 1.0. (See accompanying file 
Chris@16:  * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Chris@16:  *
Chris@16:  */
Chris@16: 
Chris@16:  /*
Chris@16:   *   LOCATION:    see http://www.boost.org for most recent version.
Chris@16:   *   FILE         match_results.cpp
Chris@16:   *   VERSION      see <boost/version.hpp>
Chris@16:   *   DESCRIPTION: Declares template class match_results.
Chris@16:   */
Chris@16: 
Chris@16: #ifndef BOOST_REGEX_V4_MATCH_RESULTS_HPP
Chris@16: #define BOOST_REGEX_V4_MATCH_RESULTS_HPP
Chris@16: 
Chris@16: #ifdef BOOST_MSVC
Chris@16: #pragma warning(push)
Chris@16: #pragma warning(disable: 4103)
Chris@16: #endif
Chris@16: #ifdef BOOST_HAS_ABI_HEADERS
Chris@16: #  include BOOST_ABI_PREFIX
Chris@16: #endif
Chris@16: #ifdef BOOST_MSVC
Chris@16: #pragma warning(pop)
Chris@16: #endif
Chris@16: 
Chris@16: namespace boost{
Chris@16: #ifdef BOOST_MSVC
Chris@16: #pragma warning(push)
Chris@16: #pragma warning(disable : 4251 4231)
Chris@16: #  if BOOST_MSVC < 1600
Chris@16: #     pragma warning(disable : 4660)
Chris@16: #  endif
Chris@16: #endif
Chris@16: 
Chris@16: namespace re_detail{
Chris@16: 
Chris@16: class named_subexpressions;
Chris@16: 
Chris@16: }
Chris@16: 
Chris@16: template <class BidiIterator, class Allocator>
Chris@16: class match_results
Chris@16: { 
Chris@16: private:
Chris@16: #ifndef BOOST_NO_STD_ALLOCATOR
Chris@16:    typedef          std::vector<sub_match<BidiIterator>, Allocator> vector_type;
Chris@16: #else
Chris@16:    typedef          std::vector<sub_match<BidiIterator> >           vector_type;
Chris@16: #endif
Chris@16: public: 
Chris@16:    typedef          sub_match<BidiIterator>                         value_type;
Chris@16: #if  !defined(BOOST_NO_STD_ALLOCATOR) && !(defined(BOOST_MSVC) && defined(_STLPORT_VERSION))
Chris@16:    typedef typename Allocator::const_reference                              const_reference;
Chris@16: #else
Chris@16:    typedef          const value_type&                                       const_reference;
Chris@16: #endif
Chris@16:    typedef          const_reference                                         reference;
Chris@16:    typedef typename vector_type::const_iterator                             const_iterator;
Chris@16:    typedef          const_iterator                                          iterator;
Chris@16:    typedef typename re_detail::regex_iterator_traits<
Chris@16:                                     BidiIterator>::difference_type          difference_type;
Chris@16:    typedef typename Allocator::size_type                                    size_type;
Chris@16:    typedef          Allocator                                               allocator_type;
Chris@16:    typedef typename re_detail::regex_iterator_traits<
Chris@16:                                     BidiIterator>::value_type               char_type;
Chris@16:    typedef          std::basic_string<char_type>                            string_type;
Chris@16:    typedef          re_detail::named_subexpressions                         named_sub_type;
Chris@16: 
Chris@16:    // construct/copy/destroy:
Chris@16:    explicit match_results(const Allocator& a = Allocator())
Chris@16: #ifndef BOOST_NO_STD_ALLOCATOR
Chris@101:       : m_subs(a), m_base(), m_null(), m_last_closed_paren(0), m_is_singular(true) {}
Chris@16: #else
Chris@101:       : m_subs(), m_base(), m_null(), m_last_closed_paren(0), m_is_singular(true) { (void)a; }
Chris@16: #endif
Chris@101:    //
Chris@101:    // IMPORTANT: in the code below, the crazy looking checks around m_is_singular are
Chris@101:    // all required because it is illegal to copy a singular iterator.
Chris@101:    // See https://svn.boost.org/trac/boost/ticket/3632.
Chris@101:    //
Chris@16:    match_results(const match_results& m)
Chris@16:       : m_subs(m.m_subs), m_named_subs(m.m_named_subs), m_last_closed_paren(m.m_last_closed_paren), m_is_singular(m.m_is_singular) 
Chris@16:    {
Chris@16:       if(!m_is_singular)
Chris@16:       {
Chris@16:          m_base = m.m_base;
Chris@16:          m_null = m.m_null;
Chris@16:       }
Chris@16:    }
Chris@16:    match_results& operator=(const match_results& m)
Chris@16:    {
Chris@16:       m_subs = m.m_subs;
Chris@16:       m_named_subs = m.m_named_subs;
Chris@16:       m_last_closed_paren = m.m_last_closed_paren;
Chris@16:       m_is_singular = m.m_is_singular;
Chris@16:       if(!m_is_singular)
Chris@16:       {
Chris@16:          m_base = m.m_base;
Chris@16:          m_null = m.m_null;
Chris@16:       }
Chris@16:       return *this;
Chris@16:    }
Chris@16:    ~match_results(){}
Chris@16: 
Chris@16:    // size:
Chris@16:    size_type size() const
Chris@16:    { return empty() ? 0 : m_subs.size() - 2; }
Chris@16:    size_type max_size() const
Chris@16:    { return m_subs.max_size(); }
Chris@16:    bool empty() const
Chris@16:    { return m_subs.size() < 2; }
Chris@16:    // element access:
Chris@16:    difference_type length(int sub = 0) const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       sub += 2;
Chris@16:       if((sub < (int)m_subs.size()) && (sub > 0))
Chris@16:          return m_subs[sub].length();
Chris@16:       return 0;
Chris@16:    }
Chris@16:    difference_type length(const char_type* sub) const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       const char_type* sub_end = sub;
Chris@16:       while(*sub_end) ++sub_end;
Chris@16:       return length(named_subexpression_index(sub, sub_end));
Chris@16:    }
Chris@16:    template <class charT>
Chris@16:    difference_type length(const charT* sub) const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       const charT* sub_end = sub;
Chris@16:       while(*sub_end) ++sub_end;
Chris@16:       return length(named_subexpression_index(sub, sub_end));
Chris@16:    }
Chris@16:    template <class charT, class Traits, class A>
Chris@16:    difference_type length(const std::basic_string<charT, Traits, A>& sub) const
Chris@16:    {
Chris@16:       return length(sub.c_str());
Chris@16:    }
Chris@16:    difference_type position(size_type sub = 0) const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       sub += 2;
Chris@16:       if(sub < m_subs.size())
Chris@16:       {
Chris@16:          const sub_match<BidiIterator>& s = m_subs[sub];
Chris@16:          if(s.matched || (sub == 2))
Chris@16:          {
Chris@16:             return ::boost::re_detail::distance((BidiIterator)(m_base), (BidiIterator)(s.first));
Chris@16:          }
Chris@16:       }
Chris@16:       return ~static_cast<difference_type>(0);
Chris@16:    }
Chris@16:    difference_type position(const char_type* sub) const
Chris@16:    {
Chris@16:       const char_type* sub_end = sub;
Chris@16:       while(*sub_end) ++sub_end;
Chris@16:       return position(named_subexpression_index(sub, sub_end));
Chris@16:    }
Chris@16:    template <class charT>
Chris@16:    difference_type position(const charT* sub) const
Chris@16:    {
Chris@16:       const charT* sub_end = sub;
Chris@16:       while(*sub_end) ++sub_end;
Chris@16:       return position(named_subexpression_index(sub, sub_end));
Chris@16:    }
Chris@16:    template <class charT, class Traits, class A>
Chris@16:    difference_type position(const std::basic_string<charT, Traits, A>& sub) const
Chris@16:    {
Chris@16:       return position(sub.c_str());
Chris@16:    }
Chris@16:    string_type str(int sub = 0) const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       sub += 2;
Chris@16:       string_type result;
Chris@16:       if(sub < (int)m_subs.size() && (sub > 0))
Chris@16:       {
Chris@16:          const sub_match<BidiIterator>& s = m_subs[sub];
Chris@16:          if(s.matched)
Chris@16:          {
Chris@16:             result = s.str();
Chris@16:          }
Chris@16:       }
Chris@16:       return result;
Chris@16:    }
Chris@16:    string_type str(const char_type* sub) const
Chris@16:    {
Chris@16:       return (*this)[sub].str();
Chris@16:    }
Chris@16:    template <class Traits, class A>
Chris@16:    string_type str(const std::basic_string<char_type, Traits, A>& sub) const
Chris@16:    {
Chris@16:       return (*this)[sub].str();
Chris@16:    }
Chris@16:    template <class charT>
Chris@16:    string_type str(const charT* sub) const
Chris@16:    {
Chris@16:       return (*this)[sub].str();
Chris@16:    }
Chris@16:    template <class charT, class Traits, class A>
Chris@16:    string_type str(const std::basic_string<charT, Traits, A>& sub) const
Chris@16:    {
Chris@16:       return (*this)[sub].str();
Chris@16:    }
Chris@16:    const_reference operator[](int sub) const
Chris@16:    {
Chris@16:       if(m_is_singular && m_subs.empty())
Chris@16:          raise_logic_error();
Chris@16:       sub += 2;
Chris@16:       if(sub < (int)m_subs.size() && (sub >= 0))
Chris@16:       {
Chris@16:          return m_subs[sub];
Chris@16:       }
Chris@16:       return m_null;
Chris@16:    }
Chris@16:    //
Chris@16:    // Named sub-expressions:
Chris@16:    //
Chris@16:    const_reference named_subexpression(const char_type* i, const char_type* j) const
Chris@16:    {
Chris@16:       //
Chris@16:       // Scan for the leftmost *matched* subexpression with the specified named:
Chris@16:       //
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       re_detail::named_subexpressions::range_type r = m_named_subs->equal_range(i, j);
Chris@16:       while((r.first != r.second) && ((*this)[r.first->index].matched == false))
Chris@16:          ++r.first;
Chris@16:       return r.first != r.second ? (*this)[r.first->index] : m_null;
Chris@16:    }
Chris@16:    template <class charT>
Chris@16:    const_reference named_subexpression(const charT* i, const charT* j) const
Chris@16:    {
Chris@16:       BOOST_STATIC_ASSERT(sizeof(charT) <= sizeof(char_type));
Chris@16:       if(i == j)
Chris@16:          return m_null;
Chris@16:       std::vector<char_type> s;
Chris@16:       while(i != j)
Chris@16:          s.insert(s.end(), *i++);
Chris@16:       return named_subexpression(&*s.begin(), &*s.begin() + s.size());
Chris@16:    }
Chris@16:    int named_subexpression_index(const char_type* i, const char_type* j) const
Chris@16:    {
Chris@16:       //
Chris@16:       // Scan for the leftmost *matched* subexpression with the specified named.
Chris@16:       // If none found then return the leftmost expression with that name,
Chris@16:       // otherwise an invalid index:
Chris@16:       //
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       re_detail::named_subexpressions::range_type s, r;
Chris@16:       s = r = m_named_subs->equal_range(i, j);
Chris@16:       while((r.first != r.second) && ((*this)[r.first->index].matched == false))
Chris@16:          ++r.first;
Chris@16:       if(r.first == r.second)
Chris@16:          r = s;
Chris@16:       return r.first != r.second ? r.first->index : -20;
Chris@16:    }
Chris@16:    template <class charT>
Chris@16:    int named_subexpression_index(const charT* i, const charT* j) const
Chris@16:    {
Chris@16:       BOOST_STATIC_ASSERT(sizeof(charT) <= sizeof(char_type));
Chris@16:       if(i == j)
Chris@16:          return -20;
Chris@16:       std::vector<char_type> s;
Chris@16:       while(i != j)
Chris@16:          s.insert(s.end(), *i++);
Chris@16:       return named_subexpression_index(&*s.begin(), &*s.begin() + s.size());
Chris@16:    }
Chris@16:    template <class Traits, class A>
Chris@16:    const_reference operator[](const std::basic_string<char_type, Traits, A>& s) const
Chris@16:    {
Chris@16:       return named_subexpression(s.c_str(), s.c_str() + s.size());
Chris@16:    }
Chris@16:    const_reference operator[](const char_type* p) const
Chris@16:    {
Chris@16:       const char_type* e = p;
Chris@16:       while(*e) ++e;
Chris@16:       return named_subexpression(p, e);
Chris@16:    }
Chris@16: 
Chris@16:    template <class charT>
Chris@16:    const_reference operator[](const charT* p) const
Chris@16:    {
Chris@16:       BOOST_STATIC_ASSERT(sizeof(charT) <= sizeof(char_type));
Chris@16:       if(*p == 0)
Chris@16:          return m_null;
Chris@16:       std::vector<char_type> s;
Chris@16:       while(*p)
Chris@16:          s.insert(s.end(), *p++);
Chris@16:       return named_subexpression(&*s.begin(), &*s.begin() + s.size());
Chris@16:    }
Chris@16:    template <class charT, class Traits, class A>
Chris@16:    const_reference operator[](const std::basic_string<charT, Traits, A>& ns) const
Chris@16:    {
Chris@16:       BOOST_STATIC_ASSERT(sizeof(charT) <= sizeof(char_type));
Chris@16:       if(ns.empty())
Chris@16:          return m_null;
Chris@16:       std::vector<char_type> s;
Chris@16:       for(unsigned i = 0; i < ns.size(); ++i)
Chris@16:          s.insert(s.end(), ns[i]);
Chris@16:       return named_subexpression(&*s.begin(), &*s.begin() + s.size());
Chris@16:    }
Chris@16: 
Chris@16:    const_reference prefix() const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       return (*this)[-1];
Chris@16:    }
Chris@16: 
Chris@16:    const_reference suffix() const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       return (*this)[-2];
Chris@16:    }
Chris@16:    const_iterator begin() const
Chris@16:    {
Chris@16:       return (m_subs.size() > 2) ? (m_subs.begin() + 2) : m_subs.end();
Chris@16:    }
Chris@16:    const_iterator end() const
Chris@16:    {
Chris@16:       return m_subs.end();
Chris@16:    }
Chris@16:    // format:
Chris@16:    template <class OutputIterator, class Functor>
Chris@16:    OutputIterator format(OutputIterator out,
Chris@16:                          Functor fmt,
Chris@16:                          match_flag_type flags = format_default) const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       typedef typename re_detail::compute_functor_type<Functor, match_results<BidiIterator, Allocator>, OutputIterator>::type F;
Chris@16:       F func(fmt);
Chris@16:       return func(*this, out, flags);
Chris@16:    }
Chris@16:    template <class Functor>
Chris@16:    string_type format(Functor fmt, match_flag_type flags = format_default) const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       std::basic_string<char_type> result;
Chris@16:       re_detail::string_out_iterator<std::basic_string<char_type> > i(result);
Chris@16: 
Chris@16:       typedef typename re_detail::compute_functor_type<Functor, match_results<BidiIterator, Allocator>, re_detail::string_out_iterator<std::basic_string<char_type> > >::type F;
Chris@16:       F func(fmt);
Chris@16: 
Chris@16:       func(*this, i, flags);
Chris@16:       return result;
Chris@16:    }
Chris@16:    // format with locale:
Chris@16:    template <class OutputIterator, class Functor, class RegexT>
Chris@16:    OutputIterator format(OutputIterator out,
Chris@16:                          Functor fmt,
Chris@16:                          match_flag_type flags,
Chris@16:                          const RegexT& re) const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       typedef ::boost::regex_traits_wrapper<typename RegexT::traits_type> traits_type;
Chris@16:       typedef typename re_detail::compute_functor_type<Functor, match_results<BidiIterator, Allocator>, OutputIterator, traits_type>::type F;
Chris@16:       F func(fmt);
Chris@16:       return func(*this, out, flags, re.get_traits());
Chris@16:    }
Chris@16:    template <class RegexT, class Functor>
Chris@16:    string_type format(Functor fmt,
Chris@16:                       match_flag_type flags,
Chris@16:                       const RegexT& re) const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       typedef ::boost::regex_traits_wrapper<typename RegexT::traits_type> traits_type;
Chris@16:       std::basic_string<char_type> result;
Chris@16:       re_detail::string_out_iterator<std::basic_string<char_type> > i(result);
Chris@16: 
Chris@16:       typedef typename re_detail::compute_functor_type<Functor, match_results<BidiIterator, Allocator>, re_detail::string_out_iterator<std::basic_string<char_type> >, traits_type >::type F;
Chris@16:       F func(fmt);
Chris@16: 
Chris@16:       func(*this, i, flags, re.get_traits());
Chris@16:       return result;
Chris@16:    }
Chris@16: 
Chris@16:    const_reference get_last_closed_paren()const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       return m_last_closed_paren == 0 ? m_null : (*this)[m_last_closed_paren];
Chris@16:    }
Chris@16: 
Chris@16:    allocator_type get_allocator() const
Chris@16:    {
Chris@16: #ifndef BOOST_NO_STD_ALLOCATOR
Chris@16:       return m_subs.get_allocator();
Chris@16: #else
Chris@16:      return allocator_type();
Chris@16: #endif
Chris@16:    }
Chris@16:    void swap(match_results& that)
Chris@16:    {
Chris@16:       std::swap(m_subs, that.m_subs);
Chris@16:       std::swap(m_named_subs, that.m_named_subs);
Chris@16:       std::swap(m_last_closed_paren, that.m_last_closed_paren);
Chris@16:       if(m_is_singular)
Chris@16:       {
Chris@16:          if(!that.m_is_singular)
Chris@16:          {
Chris@16:             m_base = that.m_base;
Chris@16:             m_null = that.m_null;
Chris@16:          }
Chris@16:       }
Chris@16:       else if(that.m_is_singular)
Chris@16:       {
Chris@16:          that.m_base = m_base;
Chris@16:          that.m_null = m_null;
Chris@16:       }
Chris@16:       else
Chris@16:       {
Chris@16:          std::swap(m_base, that.m_base);
Chris@16:          std::swap(m_null, that.m_null);
Chris@16:       }
Chris@16:       std::swap(m_is_singular, that.m_is_singular);
Chris@16:    }
Chris@16:    bool operator==(const match_results& that)const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:       {
Chris@16:          return that.m_is_singular;
Chris@16:       }
Chris@16:       else if(that.m_is_singular)
Chris@16:       {
Chris@16:          return false;
Chris@16:       }
Chris@16:       return (m_subs == that.m_subs) && (m_base == that.m_base) && (m_last_closed_paren == that.m_last_closed_paren);
Chris@16:    }
Chris@16:    bool operator!=(const match_results& that)const
Chris@16:    { return !(*this == that); }
Chris@16: 
Chris@16: #ifdef BOOST_REGEX_MATCH_EXTRA
Chris@16:    typedef typename sub_match<BidiIterator>::capture_sequence_type capture_sequence_type;
Chris@16: 
Chris@16:    const capture_sequence_type& captures(int i)const
Chris@16:    {
Chris@16:       if(m_is_singular)
Chris@16:          raise_logic_error();
Chris@16:       return (*this)[i].captures();
Chris@16:    }
Chris@16: #endif
Chris@16: 
Chris@16:    //
Chris@16:    // private access functions:
Chris@16:    void BOOST_REGEX_CALL set_second(BidiIterator i)
Chris@16:    {
Chris@16:       BOOST_ASSERT(m_subs.size() > 2);
Chris@16:       m_subs[2].second = i;
Chris@16:       m_subs[2].matched = true;
Chris@16:       m_subs[0].first = i;
Chris@16:       m_subs[0].matched = (m_subs[0].first != m_subs[0].second);
Chris@16:       m_null.first = i;
Chris@16:       m_null.second = i;
Chris@16:       m_null.matched = false;
Chris@16:       m_is_singular = false;
Chris@16:    }
Chris@16: 
Chris@16:    void BOOST_REGEX_CALL set_second(BidiIterator i, size_type pos, bool m = true, bool escape_k = false)
Chris@16:    {
Chris@16:       if(pos)
Chris@16:          m_last_closed_paren = static_cast<int>(pos);
Chris@16:       pos += 2;
Chris@16:       BOOST_ASSERT(m_subs.size() > pos);
Chris@16:       m_subs[pos].second = i;
Chris@16:       m_subs[pos].matched = m;
Chris@16:       if((pos == 2) && !escape_k)
Chris@16:       {
Chris@16:          m_subs[0].first = i;
Chris@16:          m_subs[0].matched = (m_subs[0].first != m_subs[0].second);
Chris@16:          m_null.first = i;
Chris@16:          m_null.second = i;
Chris@16:          m_null.matched = false;
Chris@16:          m_is_singular = false;
Chris@16:       }
Chris@16:    }
Chris@16:    void BOOST_REGEX_CALL set_size(size_type n, BidiIterator i, BidiIterator j)
Chris@16:    {
Chris@16:       value_type v(j);
Chris@16:       size_type len = m_subs.size();
Chris@16:       if(len > n + 2)
Chris@16:       {
Chris@16:          m_subs.erase(m_subs.begin()+n+2, m_subs.end());
Chris@16:          std::fill(m_subs.begin(), m_subs.end(), v);
Chris@16:       }
Chris@16:       else
Chris@16:       {
Chris@16:          std::fill(m_subs.begin(), m_subs.end(), v);
Chris@16:          if(n+2 != len)
Chris@16:             m_subs.insert(m_subs.end(), n+2-len, v);
Chris@16:       }
Chris@16:       m_subs[1].first = i;
Chris@16:       m_last_closed_paren = 0;
Chris@16:    }
Chris@16:    void BOOST_REGEX_CALL set_base(BidiIterator pos)
Chris@16:    {
Chris@16:       m_base = pos;
Chris@16:    }
Chris@16:    BidiIterator base()const
Chris@16:    {
Chris@16:       return m_base;
Chris@16:    }
Chris@16:    void BOOST_REGEX_CALL set_first(BidiIterator i)
Chris@16:    {
Chris@16:       BOOST_ASSERT(m_subs.size() > 2);
Chris@16:       // set up prefix:
Chris@16:       m_subs[1].second = i;
Chris@16:       m_subs[1].matched = (m_subs[1].first != i);
Chris@16:       // set up $0:
Chris@16:       m_subs[2].first = i;
Chris@16:       // zero out everything else:
Chris@16:       for(size_type n = 3; n < m_subs.size(); ++n)
Chris@16:       {
Chris@16:          m_subs[n].first = m_subs[n].second = m_subs[0].second;
Chris@16:          m_subs[n].matched = false;
Chris@16:       }
Chris@16:    }
Chris@16:    void BOOST_REGEX_CALL set_first(BidiIterator i, size_type pos, bool escape_k = false)
Chris@16:    {
Chris@16:       BOOST_ASSERT(pos+2 < m_subs.size());
Chris@16:       if(pos || escape_k)
Chris@16:       {
Chris@16:          m_subs[pos+2].first = i;
Chris@16:          if(escape_k)
Chris@16:          {
Chris@16:             m_subs[1].second = i;
Chris@16:             m_subs[1].matched = (m_subs[1].first != m_subs[1].second);
Chris@16:          }
Chris@16:       }
Chris@16:       else
Chris@16:          set_first(i);
Chris@16:    }
Chris@16:    void BOOST_REGEX_CALL maybe_assign(const match_results<BidiIterator, Allocator>& m);
Chris@16: 
Chris@16:    void BOOST_REGEX_CALL set_named_subs(boost::shared_ptr<named_sub_type> subs)
Chris@16:    {
Chris@16:       m_named_subs = subs;
Chris@16:    }
Chris@16: 
Chris@16: private:
Chris@16:    //
Chris@16:    // Error handler called when an uninitialized match_results is accessed:
Chris@16:    //
Chris@16:    static void raise_logic_error()
Chris@16:    {
Chris@16:       std::logic_error e("Attempt to access an uninitialzed boost::match_results<> class.");
Chris@16:       boost::throw_exception(e);
Chris@16:    }
Chris@16: 
Chris@16: 
Chris@16:    vector_type            m_subs;                      // subexpressions
Chris@16:    BidiIterator   m_base;                              // where the search started from
Chris@16:    sub_match<BidiIterator> m_null;                     // a null match
Chris@16:    boost::shared_ptr<named_sub_type> m_named_subs;     // Shared copy of named subs in the regex object
Chris@16:    int m_last_closed_paren;                            // Last ) to be seen - used for formatting
Chris@16:    bool m_is_singular;                                 // True if our stored iterators are singular
Chris@16: };
Chris@16: 
Chris@16: template <class BidiIterator, class Allocator>
Chris@16: void BOOST_REGEX_CALL match_results<BidiIterator, Allocator>::maybe_assign(const match_results<BidiIterator, Allocator>& m)
Chris@16: {
Chris@16:    if(m_is_singular)
Chris@16:    {
Chris@16:       *this = m;
Chris@16:       return;
Chris@16:    }
Chris@16:    const_iterator p1, p2;
Chris@16:    p1 = begin();
Chris@16:    p2 = m.begin();
Chris@16:    //
Chris@16:    // Distances are measured from the start of *this* match, unless this isn't
Chris@16:    // a valid match in which case we use the start of the whole sequence.  Note that
Chris@16:    // no subsequent match-candidate can ever be to the left of the first match found.
Chris@16:    // This ensures that when we are using bidirectional iterators, that distances 
Chris@16:    // measured are as short as possible, and therefore as efficient as possible
Chris@16:    // to compute.  Finally note that we don't use the "matched" data member to test
Chris@16:    // whether a sub-expression is a valid match, because partial matches set this
Chris@16:    // to false for sub-expression 0.
Chris@16:    //
Chris@16:    BidiIterator l_end = this->suffix().second;
Chris@16:    BidiIterator l_base = (p1->first == l_end) ? this->prefix().first : (*this)[0].first;
Chris@16:    difference_type len1 = 0;
Chris@16:    difference_type len2 = 0;
Chris@16:    difference_type base1 = 0;
Chris@16:    difference_type base2 = 0;
Chris@16:    std::size_t i;
Chris@16:    for(i = 0; i < size(); ++i, ++p1, ++p2)
Chris@16:    {
Chris@16:       //
Chris@16:       // Leftmost takes priority over longest; handle special cases
Chris@16:       // where distances need not be computed first (an optimisation
Chris@16:       // for bidirectional iterators: ensure that we don't accidently
Chris@16:       // compute the length of the whole sequence, as this can be really
Chris@16:       // expensive).
Chris@16:       //
Chris@16:       if(p1->first == l_end)
Chris@16:       {
Chris@16:          if(p2->first != l_end)
Chris@16:          {
Chris@16:             // p2 must be better than p1, and no need to calculate
Chris@16:             // actual distances:
Chris@16:             base1 = 1;
Chris@16:             base2 = 0;
Chris@16:             break;
Chris@16:          }
Chris@16:          else
Chris@16:          {
Chris@16:             // *p1 and *p2 are either unmatched or match end-of sequence,
Chris@16:             // either way no need to calculate distances:
Chris@16:             if((p1->matched == false) && (p2->matched == true))
Chris@16:                break;
Chris@16:             if((p1->matched == true) && (p2->matched == false))
Chris@16:                return;
Chris@16:             continue;
Chris@16:          }
Chris@16:       }
Chris@16:       else if(p2->first == l_end)
Chris@16:       {
Chris@16:          // p1 better than p2, and no need to calculate distances:
Chris@16:          return;
Chris@16:       }
Chris@16:       base1 = ::boost::re_detail::distance(l_base, p1->first);
Chris@16:       base2 = ::boost::re_detail::distance(l_base, p2->first);
Chris@16:       BOOST_ASSERT(base1 >= 0);
Chris@16:       BOOST_ASSERT(base2 >= 0);
Chris@16:       if(base1 < base2) return;
Chris@16:       if(base2 < base1) break;
Chris@16: 
Chris@16:       len1 = ::boost::re_detail::distance((BidiIterator)p1->first, (BidiIterator)p1->second);
Chris@16:       len2 = ::boost::re_detail::distance((BidiIterator)p2->first, (BidiIterator)p2->second);
Chris@16:       BOOST_ASSERT(len1 >= 0);
Chris@16:       BOOST_ASSERT(len2 >= 0);
Chris@16:       if((len1 != len2) || ((p1->matched == false) && (p2->matched == true)))
Chris@16:          break;
Chris@16:       if((p1->matched == true) && (p2->matched == false))
Chris@16:          return;
Chris@16:    }
Chris@16:    if(i == size())
Chris@16:       return;
Chris@16:    if(base2 < base1)
Chris@16:       *this = m;
Chris@16:    else if((len2 > len1) || ((p1->matched == false) && (p2->matched == true)) )
Chris@16:       *this = m;
Chris@16: }
Chris@16: 
Chris@16: template <class BidiIterator, class Allocator>
Chris@16: void swap(match_results<BidiIterator, Allocator>& a, match_results<BidiIterator, Allocator>& b)
Chris@16: {
Chris@16:    a.swap(b);
Chris@16: }
Chris@16: 
Chris@16: #ifndef BOOST_NO_STD_LOCALE
Chris@16: template <class charT, class traits, class BidiIterator, class Allocator>
Chris@16: std::basic_ostream<charT, traits>&
Chris@16:    operator << (std::basic_ostream<charT, traits>& os,
Chris@16:                 const match_results<BidiIterator, Allocator>& s)
Chris@16: {
Chris@16:    return (os << s.str());
Chris@16: }
Chris@16: #else
Chris@16: template <class BidiIterator, class Allocator>
Chris@16: std::ostream& operator << (std::ostream& os,
Chris@16:                            const match_results<BidiIterator, Allocator>& s)
Chris@16: {
Chris@16:    return (os << s.str());
Chris@16: }
Chris@16: #endif
Chris@16: 
Chris@16: #ifdef BOOST_MSVC
Chris@16: #pragma warning(pop)
Chris@16: #endif
Chris@16: } // namespace boost
Chris@16: 
Chris@16: #ifdef BOOST_MSVC
Chris@16: #pragma warning(push)
Chris@16: #pragma warning(disable: 4103)
Chris@16: #endif
Chris@16: #ifdef BOOST_HAS_ABI_HEADERS
Chris@16: #  include BOOST_ABI_SUFFIX
Chris@16: #endif
Chris@16: #ifdef BOOST_MSVC
Chris@16: #pragma warning(pop)
Chris@16: #endif
Chris@16: 
Chris@16: #endif
Chris@16: 
Chris@16: