forked from apache/doris
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstring_search.hpp
More file actions
81 lines (67 loc) · 2.48 KB
/
Copy pathstring_search.hpp
File metadata and controls
81 lines (67 loc) · 2.48 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
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
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
#pragma once
#include <cstring>
#include <functional>
#include <vector>
#include "common/logging.h"
#include "vec/common/string_ref.h"
#include "vec/common/string_searcher.h"
namespace doris {
class StringSearch {
public:
virtual ~StringSearch() = default;
StringSearch() : _pattern(nullptr) {}
StringSearch(const StringRef* pattern) { set_pattern(pattern); }
void set_pattern(const StringRef* pattern) {
_pattern = pattern;
_str_searcher.reset(new ASCIICaseSensitiveStringSearcher(pattern->data, pattern->size));
}
// search for this pattern in str.
// Returns the offset into str if the pattern exists
// Returns -1 if the pattern is not found
int search(const StringRef* str) const {
auto it = search(str->data, str->size);
if (it == str->data + str->size) {
return -1;
} else {
return it - str->data;
}
}
int search(const StringRef& str) const {
auto it = search(str.data, str.size);
if (it == str.data + str.size) {
return -1;
} else {
return it - str.data;
}
}
// search for this pattern in str.
// Returns the offset into str if the pattern exists
// Returns str+len if the pattern is not found
const char* search(const char* str, size_t len) const {
if (!str || !_pattern || _pattern->size == 0) {
return str + len;
}
return _str_searcher->search(str, len);
}
inline size_t get_pattern_length() { return _pattern ? _pattern->size : 0; }
private:
const StringRef* _pattern;
std::unique_ptr<ASCIICaseSensitiveStringSearcher> _str_searcher;
};
} // namespace doris