61 lines
1.8 KiB
C++
61 lines
1.8 KiB
C++
/*
|
|
*
|
|
* Copyright (c) 1998-2002
|
|
* John Maddock
|
|
*
|
|
* Use, modification and distribution are subject to the
|
|
* Boost Software License, Version 1.0. (See accompanying file
|
|
* 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: recursion_test.cpp
|
|
* VERSION: see <boost/version.hpp>
|
|
* DESCRIPTION: Test for indefinite recursion and/or stack overrun.
|
|
*/
|
|
|
|
#include <boost/regex.hpp>
|
|
#include <boost/detail/lightweight_main.hpp>
|
|
#include "../test_macros.hpp"
|
|
#include <string>
|
|
|
|
#ifdef BOOST_INTEL
|
|
#pragma warning(disable:1418 981 983 383)
|
|
#endif
|
|
|
|
int cpp_main( int , char* [] )
|
|
{
|
|
std::string bad_text(1024, ' ');
|
|
std::string good_text(200, ' ');
|
|
good_text.append("xyz");
|
|
|
|
boost::smatch what;
|
|
|
|
boost::regex e1("(.+)+xyz");
|
|
|
|
BOOST_CHECK(boost::regex_search(good_text, what, e1));
|
|
BOOST_CHECK_THROW(boost::regex_search(bad_text, what, e1), std::runtime_error);
|
|
BOOST_CHECK(boost::regex_search(good_text, what, e1));
|
|
|
|
BOOST_CHECK(boost::regex_match(good_text, what, e1));
|
|
BOOST_CHECK_THROW(boost::regex_match(bad_text, what, e1), std::runtime_error);
|
|
BOOST_CHECK(boost::regex_match(good_text, what, e1));
|
|
|
|
boost::regex e2("abc|[[:space:]]+(xyz)?[[:space:]]+xyz");
|
|
|
|
BOOST_CHECK(boost::regex_search(good_text, what, e2));
|
|
BOOST_CHECK_THROW(boost::regex_search(bad_text, what, e2), std::runtime_error);
|
|
BOOST_CHECK(boost::regex_search(good_text, what, e2));
|
|
|
|
bad_text.assign((std::string::size_type)500000, 'a');
|
|
e2.assign("aaa*@");
|
|
BOOST_CHECK_THROW(boost::regex_search(bad_text, what, e2), std::runtime_error);
|
|
good_text.assign((std::string::size_type)5000, 'a');
|
|
BOOST_CHECK(0 == boost::regex_search(good_text, what, e2));
|
|
|
|
return 0;
|
|
}
|
|
|