position.pass.cpp
1.09 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <regex>
// class match_results<BidirectionalIterator, Allocator>
// difference_type position(size_type sub = 0) 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.position() == std::distance(s, m[0].first));
assert(m.position(0) == std::distance(s, m[0].first));
assert(m.position(1) == std::distance(s, m[1].first));
assert(m.position(2) == std::distance(s, m[2].first));
assert(m.position(3) == std::distance(s, m[3].first));
assert(m.position(4) == std::distance(s, m[4].first));
}
int main(int, char**)
{
test();
return 0;
}