forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
38 lines
975 B
C++
38 lines
975 B
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <regex>
|
|
|
|
// class match_results<BidirectionalIterator, Allocator>
|
|
|
|
// string_type str(size_type sub = 0) const;
|
|
|
|
#include <regex>
|
|
#include <cassert>
|
|
#include "test_macros.h"
|
|
|
|
void
|
|
test()
|
|
{
|
|
std::match_results<const char*> m;
|
|
const char s[] = "abcdefghijk";
|
|
assert(std::regex_search(s, m, std::regex("cd((e)fg)hi")));
|
|
assert(m.str() == std::string(m[0]));
|
|
assert(m.str(0) == std::string(m[0]));
|
|
assert(m.str(1) == std::string(m[1]));
|
|
assert(m.str(2) == std::string(m[2]));
|
|
assert(m.str(3) == std::string(m[3]));
|
|
assert(m.str(4) == std::string(m[4]));
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test();
|
|
}
|