| 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
| 3 | // 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 |
| 6 | // |
| 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 | |
| 21 | #include "test_macros.h" |
| 22 | #include "test_iterators.h" |
| 23 | |
| 24 | int main(int, char**) |
| 25 | { |
| 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::grep))); |
| 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::grep))); |
| 47 | assert(m.size() == 0); |
| 48 | } |
| 49 | |
| 50 | return 0; |
| 51 | } |
| 52 | |