-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgenskip.cxx
143 lines (124 loc) · 2.62 KB
/
genskip.cxx
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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
/*!
* \file
* \brief Realization of skipper of Boyer-Moore algo.
*/
#ifndef CASE_SENSITIVE
#include <ctype.h>
#endif
#include <sys/types.h>
static size_t const ALPHA_SKIP_SIZE = 256;
size_t alpha_skip_lookup[ALPHA_SKIP_SIZE];
size_t *find_skip_lookup;
/*!
* Generate skip sequence for Boyer-Moore strstr.
*
* \param[in] find Search string.
* \param[in] f_len c-string size.
* \param[out] skip_lookup Skip sequence.
*/
void generate_alpha_skip(
char const *find
, size_t f_len
, size_t skip_lookup[]
) noexcept {
size_t i;
for (i = 0; i < ALPHA_SKIP_SIZE; i++)
{
skip_lookup[i] = f_len;
}
f_len--;
for (i = 0; i < f_len; i++)
{
#ifndef CASE_SENSITIVE
skip_lookup[static_cast<unsigned char>(tolower(find[i]))] = f_len - i;
skip_lookup[static_cast<unsigned char>(toupper(find[i]))] = f_len - i;
#else
skip_lookup[static_cast<unsigned char>(find[i])] = f_len - i;
#endif
}
}
/*!
* Prefix check.
*
* \param[in] s Search string.
* \param[in] s_len c-string size.
* \param[in] pos index.
*/
int is_prefix(
const char *s
, const size_t s_len
, const size_t pos
) noexcept {
size_t i;
for (i = 0; pos + i < s_len; i++)
{
#ifndef CASE_SENSITIVE
if (tolower(s[i]) != tolower(s[i + pos]))
#else
if (s[i] != s[i + pos])
#endif
{
return 0;
}
}
return 1;
}
/*!
* Suffix check.
*
* \param[in] s Search string.
* \param[in] s_len c-string size.
* \param[in] pos index.
*/
size_t suffix_len(
const char *s
, const size_t s_len
, const size_t pos
) noexcept {
size_t i;
for (i = 0; i < pos; i++)
{
#ifndef CASE_SENSITIVE
if (tolower(s[pos - i]) != tolower(s[s_len - i - 1]))
#else
if (s[pos - i] != s[s_len - i - 1])
#endif
{
break;
}
}
return i;
}
/*!
* Generate skip sequence for Boyer-Moore strstr base on search string.
*
* \param[in] find Search string.
* \param[in] f_len c-string size.
* \param[out] skip_lookup Skip sequence.
*/
void generate_find_skip(
const char *find
, const size_t f_len
, size_t *skip_lookup
) noexcept {
size_t i;
size_t s_len;
size_t *sl = skip_lookup;
size_t last_prefix = f_len;
for (i = last_prefix; i > 0; i--)
{
if (is_prefix(find, f_len, i))
{
last_prefix = i;
}
sl[i - 1] = last_prefix + (f_len - i);
}
for (i = 0; i < f_len; i++)
{
s_len = suffix_len(find, f_len, i);
if (find[i - s_len] != find[f_len - 1 - s_len])
{
sl[f_len - 1 - s_len] = f_len - 1 - i + s_len;
}
}
}