1 //===----------------------------------------------------------------------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9
10 // <regex>
11
12 // template <class BidirectionalIterator, class Allocator, class charT, class traits>
13 // bool
14 // regex_search(BidirectionalIterator first, BidirectionalIterator last,
15 // match_results<BidirectionalIterator, Allocator>& m,
16 // const basic_regex<charT, traits>& e,
17 // regex_constants::match_flag_type flags = regex_constants::match_default);
18
19 #include <regex>
20 #include <cassert>
21
22 #include "test_iterators.h"
23
main()24 int main()
25 {
26 {
27 std::cmatch m;
28 const char s[] = "tournament";
29 assert(std::regex_search(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_search(s, m, std::regex("tour\n\ntournament",
46 std::regex_constants::egrep)));
47 assert(m.size() == 1);
48 assert(!m.prefix().matched);
49 assert(m.prefix().first == s);
50 assert(m.prefix().second == m[0].first);
51 assert(m.suffix().matched);
52 assert(m.suffix().first == m[0].second);
53 assert(m.suffix().second == s + std::char_traits<char>::length(s));
54 assert(m.length(0) == 0);
55 assert(m.position(0) == 0);
56 assert(m.str(0) == "");
57 }
58 {
59 std::cmatch m;
60 const char s[] = "tournament";
61 assert(std::regex_search(s, m, std::regex("(tour|to|tournament)+\ntourna",
62 std::regex_constants::egrep)));
63 assert(m.size() == 2);
64 assert(!m.prefix().matched);
65 assert(m.prefix().first == s);
66 assert(m.prefix().second == m[0].first);
67 assert(!m.suffix().matched);
68 assert(m.suffix().first == m[0].second);
69 assert(m.suffix().second == s + std::char_traits<char>::length(s));
70 assert(m.length(0) == 10);
71 assert(m.position(0) == 0);
72 assert(m.str(0) == "tournament");
73 }
74 {
75 std::cmatch m;
76 const char s[] = "tourna";
77 assert(std::regex_search(s, m, std::regex("(tour|to|tournament)+\ntourna",
78 std::regex_constants::egrep)));
79 assert(m.size() == 2);
80 assert(!m.prefix().matched);
81 assert(m.prefix().first == s);
82 assert(m.prefix().second == m[0].first);
83 assert(!m.suffix().matched);
84 assert(m.suffix().first == m[0].second);
85 assert(m.suffix().second == s + std::char_traits<char>::length(s));
86 assert(m.length(0) == 6);
87 assert(m.position(0) == 0);
88 assert(m.str(0) == "tourna");
89 }
90 }
91