blob: 4e1b6940c09e172be070c422383818ce3cb9da87 [file] [log] [blame]
Howard Hinnant51e39672010-08-14 19:58:44 +00001//===----------------------------------------------------------------------===//
2//
Chandler Carruth57b08b02019-01-19 10:56:40 +00003// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
Howard Hinnant51e39672010-08-14 19:58:44 +00006//
7//===----------------------------------------------------------------------===//
8
9// <regex>
10
11// template <class BidirectionalIterator, class Allocator, class charT, class traits>
12// bool
13// regex_match(BidirectionalIterator first, BidirectionalIterator last,
14// match_results<BidirectionalIterator, Allocator>& m,
15// const basic_regex<charT, traits>& e,
16// regex_constants::match_flag_type flags = regex_constants::match_default);
17
18#include <regex>
19#include <cassert>
20
Marshall Clowfd5ceb22016-04-26 16:24:44 +000021#include "test_macros.h"
Marshall Clow32227082013-01-05 03:21:01 +000022#include "test_iterators.h"
Howard Hinnant51e39672010-08-14 19:58:44 +000023
JF Bastien2df59c52019-02-04 20:31:13 +000024int main(int, char**)
Howard Hinnant51e39672010-08-14 19:58:44 +000025{
26 {
27 std::cmatch m;
28 const char s[] = "tournament";
29 assert(std::regex_match(s, m, std::regex("tour\nto\ntournament",
30 std::regex_constants::egrep)));
31 assert(m.size() == 1);
32 assert(!m.prefix().matched);
33 assert(m.prefix().first == s);
34 assert(m.prefix().second == m[0].first);
35 assert(!m.suffix().matched);
36 assert(m.suffix().first == m[0].second);
37 assert(m.suffix().second == s + std::char_traits<char>::length(s));
38 assert(m.length(0) == 10);
39 assert(m.position(0) == 0);
40 assert(m.str(0) == "tournament");
41 }
42 {
43 std::cmatch m;
44 const char s[] = "ment";
45 assert(!std::regex_match(s, m, std::regex("tour\n\ntournament",
46 std::regex_constants::egrep)));
47 assert(m.size() == 0);
48 }
49 {
50 std::cmatch m;
51 const char s[] = "tournament";
52 assert(std::regex_match(s, m, std::regex("(tour|to|tournament)+\ntourna",
53 std::regex_constants::egrep)));
54 assert(m.size() == 2);
55 assert(!m.prefix().matched);
56 assert(m.prefix().first == s);
57 assert(m.prefix().second == m[0].first);
58 assert(!m.suffix().matched);
59 assert(m.suffix().first == m[0].second);
60 assert(m.suffix().second == s + std::char_traits<char>::length(s));
61 assert(m.length(0) == 10);
62 assert(m.position(0) == 0);
63 assert(m.str(0) == "tournament");
64 }
65 {
66 std::cmatch m;
67 const char s[] = "tourna";
68 assert(std::regex_match(s, m, std::regex("(tour|to|tournament)+\ntourna",
69 std::regex_constants::egrep)));
70 assert(m.size() == 2);
71 assert(!m.prefix().matched);
72 assert(m.prefix().first == s);
73 assert(m.prefix().second == m[0].first);
74 assert(!m.suffix().matched);
75 assert(m.suffix().first == m[0].second);
76 assert(m.suffix().second == s + std::char_traits<char>::length(s));
77 assert(m.length(0) == 6);
78 assert(m.position(0) == 0);
79 assert(m.str(0) == "tourna");
80 }
JF Bastien2df59c52019-02-04 20:31:13 +000081
82 return 0;
Howard Hinnant51e39672010-08-14 19:58:44 +000083}