From 22aedd996ccd279c3378b9661c510c618706270d Mon Sep 17 00:00:00 2001
From: John Maddock <john@johnmaddock.co.uk>
Date: Wed, 1 Mar 2017 11:33:28 +0000
Subject: [PATCH] Fix iterator comparisons so legacy compilers (sun and VC6)
 can handle them

---
 include/boost/regex/v4/perl_matcher_non_recursive.hpp | 2 +-
 include/boost/regex/v4/perl_matcher_recursive.hpp     | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/include/boost/regex/v4/perl_matcher_non_recursive.hpp b/include/boost/regex/v4/perl_matcher_non_recursive.hpp
index 46f48943..c12dea8e 100644
--- a/include/boost/regex/v4/perl_matcher_non_recursive.hpp
+++ b/include/boost/regex/v4/perl_matcher_non_recursive.hpp
@@ -1001,7 +1001,7 @@ bool perl_matcher<BidiIterator, Allocator, traits>::match_recursion()
    // See if we've seen this recursion before at this location, if we have then
    // we need to prevent infinite recursion:
    //
-   for(typename std::vector<recursion_info<results_type> >::const_reverse_iterator i = recursion_stack.rbegin(); i != recursion_stack.rend(); ++i)
+   for(typename std::vector<recursion_info<results_type> >::reverse_iterator i = recursion_stack.rbegin(); i != recursion_stack.rend(); ++i)
    {
       if(i->idx == static_cast<const re_brace*>(static_cast<const re_jump*>(pstate)->alt.p)->index)
       {
diff --git a/include/boost/regex/v4/perl_matcher_recursive.hpp b/include/boost/regex/v4/perl_matcher_recursive.hpp
index 7cc54ca2..8eb23abf 100644
--- a/include/boost/regex/v4/perl_matcher_recursive.hpp
+++ b/include/boost/regex/v4/perl_matcher_recursive.hpp
@@ -904,7 +904,7 @@ bool perl_matcher<BidiIterator, Allocator, traits>::match_recursion()
    // See if we've seen this recursion before at this location, if we have then
    // we need to prevent infinite recursion:
    //
-   for(typename std::vector<recursion_info<results_type> >::const_reverse_iterator i = recursion_stack.rbegin(); i != recursion_stack.rend(); ++i)
+   for(typename std::vector<recursion_info<results_type> >::reverse_iterator i = recursion_stack.rbegin(); i != recursion_stack.rend(); ++i)
    {
       if(i->idx == static_cast<const re_brace*>(static_cast<const re_jump*>(pstate)->alt.p)->index)
       {