Index: test/std/re/re.alg/re.alg.match/exponential.pass.cpp =================================================================== --- test/std/re/re.alg/re.alg.match/exponential.pass.cpp +++ test/std/re/re.alg/re.alg.match/exponential.pass.cpp @@ -21,18 +21,20 @@ #include #include +#include "test_macros.h" int main() { for (std::regex_constants::syntax_option_type op : {std::regex::ECMAScript, std::regex::extended, std::regex::egrep, std::regex::awk}) { try { - std::regex_match( + bool b = std::regex_match( "aaaaaaaaaaaaaaaaaaaa", std::regex( "a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?aaaaaaaaaaaaaaaaaaaa", op)); - assert(false); + LIBCPP_ASSERT(false); + assert(b); } catch (const std::regex_error &e) { assert(e.code() == std::regex_constants::error_complexity); } Index: test/std/re/re.alg/re.alg.replace/exponential.pass.cpp =================================================================== --- /dev/null +++ test/std/re/re.alg/re.alg.replace/exponential.pass.cpp @@ -0,0 +1,37 @@ +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +// + +// template +// OutputIterator +// regex_replace(OutputIterator out, +// BidirectionalIterator first, BidirectionalIterator last, +// const basic_regex& e, +// const basic_string& fmt, +// regex_constants::match_flag_type flags = +// regex_constants::match_default); + +#include +#include + +#include "test_macros.h" + +int main() +{ + try { + std::regex re("a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?aaaaaaaaaaaaaaaaaaaa"); + const char s[] = "aaaaaaaaaaaaaaaaaaaa"; + std::string r = std::regex_replace(s, re, "123-&", std::regex_constants::format_sed); + LIBCPP_ASSERT(false); + assert(r == "123-aaaaaaaaaaaaaaaaaaaa"); + } catch (const std::regex_error &e) { + assert(e.code() == std::regex_constants::error_complexity); + } +} Index: test/std/re/re.alg/re.alg.search/exponential.pass.cpp =================================================================== --- test/std/re/re.alg/re.alg.search/exponential.pass.cpp +++ test/std/re/re.alg/re.alg.search/exponential.pass.cpp @@ -21,18 +21,20 @@ #include #include +#include "test_macros.h" int main() { for (std::regex_constants::syntax_option_type op : {std::regex::ECMAScript, std::regex::extended, std::regex::egrep, std::regex::awk}) { try { - std::regex_search( + bool b = std::regex_search( "aaaaaaaaaaaaaaaaaaaa", std::regex( "a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?aaaaaaaaaaaaaaaaaaaa", op)); - assert(false); + LIBCPP_ASSERT(false); + assert(b); } catch (const std::regex_error &e) { assert(e.code() == std::regex_constants::error_complexity); }