1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
//===----------------------------------------------------------------------===//
//
// 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>
// template <class BidirectionalIterator> class sub_match;
// string_type str() const;
#include <regex>
#include <cassert>
int main()
{
{
typedef char CharT;
typedef std::sub_match<const CharT*> SM;
SM sm = SM();
SM::string_type str = sm.str();
assert(str.empty());
const CharT s[] = {'1', '2', '3', 0};
sm.first = s;
sm.second = s + 3;
sm.matched = true;
str = sm.str();
assert(str == std::string("123"));
}
{
typedef wchar_t CharT;
typedef std::sub_match<const CharT*> SM;
SM sm = SM();
SM::string_type str = sm.str();
assert(str.empty());
const CharT s[] = {'1', '2', '3', 0};
sm.first = s;
sm.second = s + 3;
sm.matched = true;
str = sm.str();
assert(str == std::wstring(L"123"));
}
}
|
