blob: 3ef2f11e06c1b35b28045ad7d9285f22fe7c5946 (
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
55
56
|
// { dg-do run { target c++11 } }
// { dg-timeout-factor 2 }
//
// 2010-02-17 Stephen M. Webb <stephen.webb@bregmasoft.ca>
//
// Copyright (C) 2010-2023 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
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// 28.3 Requirements [re.req]
// 28.2 (4) Table 127 - Regular expression traits class requirements
// 28.7 Class template regex_traits [re.traits]
#include <regex>
#include <string>
#include <testsuite_hooks.h>
void
test01()
{
typedef char CharT;
typedef std::regex_traits<CharT> traits;
traits t;
traits::string_type G = "abc";
traits::string_type H = "def";
traits::string_type J = "ABC";
VERIFY( G < H );
VERIFY( t.transform_primary(G.begin(), G.end())
< t.transform_primary(H.begin(), H.end()) );
VERIFY( G > J );
VERIFY( t.transform_primary(G.begin(), G.end())
== t.transform_primary(J.begin(), J.end()) );
}
int main()
{
test01();
return 0;
}
|
