| 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 | // class match_results<BidirectionalIterator, Allocator> |
| 12 | |
| 13 | // const_reference operator[](size_type n) const; |
| 14 | |
| 15 | #include <regex> |
| 16 | #include <cassert> |
| 17 | #include "test_macros.h" |
| 18 | |
| 19 | void |
| 20 | test(std::regex_constants::syntax_option_type syntax) |
| 21 | { |
| 22 | std::match_results<const char*> m; |
| 23 | const char s[] = "abcdefghijk" ; |
| 24 | assert(std::regex_search(s, m, std::regex("cd((e)fg)hi|(z)" , syntax))); |
| 25 | |
| 26 | assert(m.size() == 4); |
| 27 | |
| 28 | assert(m[0].first == s+2); |
| 29 | assert(m[0].second == s+9); |
| 30 | assert(m[0].matched == true); |
| 31 | |
| 32 | assert(m[1].first == s+4); |
| 33 | assert(m[1].second == s+7); |
| 34 | assert(m[1].matched == true); |
| 35 | |
| 36 | assert(m[2].first == s+4); |
| 37 | assert(m[2].second == s+5); |
| 38 | assert(m[2].matched == true); |
| 39 | |
| 40 | assert(m[3].first == s+11); |
| 41 | assert(m[3].second == s+11); |
| 42 | assert(m[3].matched == false); |
| 43 | |
| 44 | assert(m[4].first == s+11); |
| 45 | assert(m[4].second == s+11); |
| 46 | assert(m[4].matched == false); |
| 47 | } |
| 48 | |
| 49 | int main(int, char**) |
| 50 | { |
| 51 | test(syntax: std::regex_constants::ECMAScript); |
| 52 | test(syntax: std::regex_constants::extended); |
| 53 | |
| 54 | return 0; |
| 55 | } |
| 56 | |