You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
36 lines
822 B
36 lines
822 B
4 months ago
|
//===----------------------------------------------------------------------===//
|
||
|
|
//
|
||
|
|
// The LLVM Compiler Infrastructure
|
||
|
|
//
|
||
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
||
|
|
// Source Licenses. See LICENSE.TXT for details.
|
||
|
|
//
|
||
|
|
//===----------------------------------------------------------------------===//
|
||
|
|
|
||
|
|
// <regex>
|
||
|
|
|
||
|
|
// class match_results<BidirectionalIterator, Allocator>
|
||
|
|
|
||
|
|
// const_reference prefix() const;
|
||
|
|
|
||
|
|
#include <regex>
|
||
|
|
#include <cassert>
|
||
|
|
#include "test_macros.h"
|
||
|
|
|
||
|
|
void
|
||
|
|
test()
|
||
|
|
{
|
||
|
|
std::match_results<const char*> m;
|
||
|
|
const char s[] = "abcdefghijk";
|
||
|
|
assert(std::regex_search(s, m, std::regex("cd((e)fg)hi")));
|
||
|
|
|
||
|
|
assert(m.prefix().first == s);
|
||
|
|
assert(m.prefix().second == s+2);
|
||
|
|
assert(m.prefix().matched == true);
|
||
|
|
}
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
test();
|
||
|
|
}
|