| 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 suffix() const; |
|---|
| 14 | |
|---|
| 15 | #include <regex> |
|---|
| 16 | #include <cassert> |
|---|
| 17 | #include "test_macros.h" |
|---|
| 18 | |
|---|
| 19 | void |
|---|
| 20 | test() |
|---|
| 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" ))); |
|---|
| 25 | |
|---|
| 26 | assert(m.suffix().first == s+9); |
|---|
| 27 | assert(m.suffix().second == s+11); |
|---|
| 28 | assert(m.suffix().matched == true); |
|---|
| 29 | } |
|---|
| 30 | |
|---|
| 31 | int main(int, char**) |
|---|
| 32 | { |
|---|
| 33 | test(); |
|---|
| 34 | |
|---|
| 35 | return 0; |
|---|
| 36 | } |
|---|
| 37 | |
|---|
