#ifdef BOOST_MSVC
# pragma warning(push)
+#pragma warning(disable : 4251)
+#if BOOST_MSVC < 1700
+# pragma warning(disable : 4231)
+#endif
+# if BOOST_MSVC < 1600
+# pragma warning(disable : 4660)
+# endif
#if BOOST_MSVC < 1910
#pragma warning(disable:4800)
#endif
saved_state_count = 14
};
+#ifdef BOOST_MSVC
+# pragma warning(push)
+#if BOOST_MSVC >= 1800
+#pragma warning(disable:26495)
+#endif
+#endif
template <class Results>
struct recursion_info
{
repeater_count<iterator>* repeater_stack;
iterator location_of_start;
};
-
#ifdef BOOST_MSVC
-#pragma warning(push)
-#pragma warning(disable : 4251)
-#if BOOST_MSVC < 1700
-# pragma warning(disable : 4231)
-#endif
-# if BOOST_MSVC < 1600
-# pragma warning(disable : 4660)
-# endif
+# pragma warning(pop)
#endif
template <class BidiIterator, class Allocator, class traits>
unsigned m_recursions;
#endif
+#ifdef BOOST_MSVC
+# pragma warning(push)
+#if BOOST_MSVC >= 1800
+#pragma warning(disable:26495)
+#endif
+#endif
// these operations aren't allowed, so are declared private,
// bodies are provided to keep explicit-instantiation requests happy:
perl_matcher& operator=(const perl_matcher&)
}
perl_matcher(const perl_matcher& that)
: m_result(that.m_result), re(that.re), traits_inst(that.traits_inst), rep_obj(0) {}
-};
-
#ifdef BOOST_MSVC
-#pragma warning(pop)
+# pragma warning(pop)
#endif
+};
} // namespace BOOST_REGEX_DETAIL_NS
+#ifdef BOOST_MSVC
+# pragma warning(pop)
+#endif
+
#ifdef BOOST_MSVC
#pragma warning(push)
#pragma warning(disable: 4103)
} // namespace boost
-#ifdef BOOST_MSVC
-# pragma warning(pop)
-#endif
-
//
// include the implementation of perl_matcher:
//