Update copyright years.

[thirdparty/gcc.git] / libstdc++-v3 / testsuite / 28_regex / algorithms / regex_match / extended / string_range_01_03.cc

diff --git a/libstdc++-v3/testsuite/28_regex/algorithms/regex_match/extended/string_range_01_03.cc b/libstdc++-v3/testsuite/28_regex/algorithms/regex_match/extended/string_range_01_03.cc
index c724ff6ac914615db96d385e47d9c4c79d9f318a..445e87bc227ba7b41d5923d43df4d3a057332c7b 100644 (file)
--- a/libstdc++-v3/testsuite/28_regex/algorithms/regex_match/extended/string_range_01_03.cc
+++ b/libstdc++-v3/testsuite/28_regex/algorithms/regex_match/extended/string_range_01_03.cc
@@ -1,9 +1,10 @@
-// { dg-options "-std=c++0x" }
+// { dg-do run { target c++11 } }
+// { dg-timeout-factor 2 }
 
 //
 // 2010-06-16  Stephen M. Webb <stephen.webb@bregmasoft.ca>
 //
-// Copyright (C) 2010-2014 Free Software Foundation, Inc.
+// Copyright (C) 2010-2021 Free Software Foundation, Inc.
 //
 // This file is part of the GNU ISO C++ Library.  This library is free
 // software; you can redistribute it and/or modify it under the
@@ -33,25 +34,23 @@ using namespace std;
 void
 test01()
 {
-  bool test __attribute__((unused)) = true;
-
-       std::regex  re("a{1,3}", std::regex::extended);
-       std::string target("aa");
-       std::smatch m;
-
-       VERIFY( regex_match_debug(target, m, re) );
-
-       VERIFY( m.size()  == re.mark_count()+1 );
-       VERIFY( m.empty() == false );
-       VERIFY( m.prefix().first == target.begin() );
-       VERIFY( m.prefix().second == target.begin() );
-       VERIFY( m.prefix().matched == false );
-       VERIFY( m.suffix().first == target.end() );
-       VERIFY( m.suffix().second == target.end() );
-       VERIFY( m.suffix().matched == false );
-       VERIFY( m[0].first == target.begin() );
-       VERIFY( m[0].second == target.end() );
-       VERIFY( m[0].matched == true );
+  std::regex  re("a{1,3}", std::regex::extended);
+  std::string target("aa");
+  std::smatch m;
+
+  VERIFY( regex_match_debug(target, m, re) );
+
+  VERIFY( m.size()  == re.mark_count()+1 );
+  VERIFY( m.empty() == false );
+  VERIFY( m.prefix().first == target.begin() );
+  VERIFY( m.prefix().second == target.begin() );
+  VERIFY( m.prefix().matched == false );
+  VERIFY( m.suffix().first == target.end() );
+  VERIFY( m.suffix().second == target.end() );
+  VERIFY( m.suffix().matched == false );
+  VERIFY( m[0].first == target.begin() );
+  VERIFY( m[0].second == target.end() );
+  VERIFY( m[0].matched == true );
 }