blob: 4b74f65d7826103f911c4ac83756b79b6f241167 (
plain)
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
48
49
50
51
52
53
54
|
//===----------------------------------------------------------------------===//
//
// 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;
// int compare(const sub_match& s) const;
#include <regex>
#include <cassert>
#include "test_macros.h"
int main()
{
{
typedef char CharT;
typedef std::sub_match<const CharT*> SM;
SM sm = SM();
SM sm2 = SM();
assert(sm.compare(sm2) == 0);
const CharT s[] = {'1', '2', '3', 0};
sm.first = s;
sm.second = s + 3;
sm.matched = true;
assert(sm.compare(sm2) > 0);
sm2.first = s;
sm2.second = s + 3;
sm2.matched = true;
assert(sm.compare(sm2) == 0);
}
{
typedef wchar_t CharT;
typedef std::sub_match<const CharT*> SM;
SM sm = SM();
SM sm2 = SM();
assert(sm.compare(sm2) == 0);
const CharT s[] = {'1', '2', '3', 0};
sm.first = s;
sm.second = s + 3;
sm.matched = true;
assert(sm.compare(sm2) > 0);
sm2.first = s;
sm2.second = s + 3;
sm2.matched = true;
assert(sm.compare(sm2) == 0);
}
}
|
