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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "regex.h"
#include <re2/re2.h>
#include <cassert>
#include <cstdint>
namespace vespalib {
using re2::StringPiece;
// All RE2 instances use a Quiet option to prevent the library from
// complaining to stderr if pattern compilation fails.
Regex::Regex(std::unique_ptr<const Impl> impl)
: _impl(std::move(impl))
{}
Regex::Regex() : _impl() {}
Regex::Regex(Regex&&) noexcept = default;
Regex& Regex::operator=(Regex&&) noexcept = default;
Regex::~Regex() = default;
class Regex::Impl {
RE2 _regex;
public:
Impl(std::string_view pattern, const re2::RE2::Options& opts)
: _regex(StringPiece(pattern.data(), pattern.size()), opts)
{}
bool parsed_ok() const noexcept {
return _regex.ok();
}
bool partial_match(std::string_view input) const noexcept {
assert(input.size() <= INT32_MAX);
if (!_regex.ok()) {
return false;
}
return RE2::PartialMatch(StringPiece(input.data(), input.size()), _regex);
}
bool full_match(std::string_view input) const noexcept {
assert(input.size() <= INT32_MAX);
if (!_regex.ok()) {
return false;
}
return RE2::FullMatch(StringPiece(input.data(), input.size()), _regex);
}
std::pair<std::string, std::string> possible_anchored_match_prefix_range() const {
constexpr int max_len = 128; // TODO determine a "reasonable" value. RE2 docs are not clear on this.
std::string min_prefix, max_prefix;
if (!_regex.PossibleMatchRange(&min_prefix, &max_prefix, max_len)) {
return {};
}
return {std::move(min_prefix), std::move(max_prefix)};
}
};
Regex Regex::from_pattern(std::string_view pattern, uint32_t opt_mask) {
assert(pattern.size() <= INT32_MAX); // StringPiece limitation
RE2::Options opts;
opts.set_log_errors(false);
if ((opt_mask & Options::IgnoreCase) != 0) {
opts.set_case_sensitive(false);
}
if ((opt_mask & Options::DotMatchesNewline) != 0) {
opts.set_dot_nl(true);
}
return Regex(std::make_unique<const Impl>(pattern, opts));
}
bool Regex::parsed_ok() const noexcept {
return _impl->parsed_ok();
}
bool Regex::partial_match(std::string_view input) const noexcept {
return _impl->partial_match(input);
}
bool Regex::full_match(std::string_view input) const noexcept {
return _impl->full_match(input);
}
std::pair<std::string, std::string> Regex::possible_anchored_match_prefix_range() const {
return _impl->possible_anchored_match_prefix_range();
}
bool Regex::partial_match(std::string_view input, std::string_view pattern) noexcept {
assert(pattern.size() <= INT32_MAX);
Impl impl(pattern, RE2::Quiet);
return impl.partial_match(input);
}
bool Regex::full_match(std::string_view input, std::string_view pattern) noexcept {
assert(pattern.size() <= INT32_MAX);
Impl impl(pattern, RE2::Quiet);
return impl.full_match(input);
}
}
|
