-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrabin_karp.h
More file actions
105 lines (90 loc) · 2.69 KB
/
Copy pathrabin_karp.h
File metadata and controls
105 lines (90 loc) · 2.69 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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#ifndef CPP_ALGORITHM_RABIN_KARP_H
#define CPP_ALGORITHM_RABIN_KARP_H
#include <string>
#include <vector>
namespace RabinKarp
{
/**
* \brief Find all occurrences of a pattern in a text.
* \param text input text
* \param pattern patterns to find
* \return starting indexes that match the pattern in the text
*/
std::vector<int> RabinKarpMatcher1(
const std::string& text,
const std::string& pattern);
/**
* \brief Find all occurrences of a pattern in a text.
* \param text input text
* \param pattern patterns to find
* \return starting indexes that match the pattern in the text
*/
std::vector<int> RabinKarpMatcher2(
const std::string& text,
const std::string& pattern);
}
// ----------------------------------------------------------------------------
inline std::vector<int> RabinKarp::RabinKarpMatcher1(
const std::string& text,
const std::string& pattern)
{
std::vector<int> result;
if (text.size() < pattern.size())
{
return result;
}
const size_t pattern_hash = std::hash<std::string>{}(pattern);
for (int i = 0; i <= static_cast<int>(text.size()) - static_cast<int>(pattern.size()); ++i)
{
const size_t next_hash = std::hash<std::string>{}(text.substr(i, pattern.size()));
if (next_hash == pattern_hash && text.substr(i, pattern.size()) == pattern)
{
result.emplace_back(i);
}
}
return result;
}
// ----------------------------------------------------------------------------
inline std::vector<int> RabinKarp::RabinKarpMatcher2(
const std::string& text,
const std::string& pattern)
{
std::vector<int> result;
if (text.size() < pattern.size())
{
return result;
}
constexpr int base = 256;
constexpr int prime = 101;
int pattern_hash = 0;
for (const char ch : pattern)
{
pattern_hash = (base * pattern_hash + ch) % prime;
}
for (int i = 0; i <= static_cast<int>(text.size()) - static_cast<int>(pattern.size()); ++i)
{
int next_hash = 0;
for (int j = 0; j < static_cast<int>(pattern.size()); ++j)
{
next_hash = (base * next_hash + text[i + j]) % prime;
}
if (pattern_hash == next_hash)
{
bool is_match = true;
for (int j = 0; j < static_cast<int>(pattern.size()); ++j)
{
if (text[i + j] != pattern[j])
{
is_match = false;
break;
}
}
if (is_match)
{
result.emplace_back(i);
}
}
}
return result;
}
#endif