Howard Hinnant | 27405f9 | 2010-08-14 18:14:02 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Howard Hinnant | b64f8b0 | 2010-11-16 22:09:02 +0000 | [diff] [blame] | 5 | // This file is dual licensed under the MIT and the University of Illinois Open |
| 6 | // Source Licenses. See LICENSE.TXT for details. |
Howard Hinnant | 27405f9 | 2010-08-14 18:14:02 +0000 | [diff] [blame] | 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | // <regex> |
| 11 | |
| 12 | // class match_results<BidirectionalIterator, Allocator> |
| 13 | |
| 14 | // const_reference prefix() const; |
| 15 | |
| 16 | #include <regex> |
| 17 | #include <cassert> |
Howard Hinnant | 27405f9 | 2010-08-14 18:14:02 +0000 | [diff] [blame] | 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.prefix().first == s); |
| 27 | assert(m.prefix().second == s+2); |
| 28 | assert(m.prefix().matched == true); |
| 29 | } |
| 30 | |
| 31 | int main() |
| 32 | { |
| 33 | test(); |
| 34 | } |