-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRabinCarp.java
More file actions
73 lines (61 loc) · 2 KB
/
RabinCarp.java
File metadata and controls
73 lines (61 loc) · 2 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
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author madhavadabare
*/
public class RabinCarp {
static String RabinCarp(String text, String pattern, int d, int q) {
String result = "";
char P[] = pattern.toCharArray();
char T[] = text.toCharArray();
int M = P.length;
int N = T.length;
int i, j;
int p = 0; // hash value for pattern
int t = 0; // hash value for txt
int h = 1;
// The value of h would be "pow(d, M-1)%q"
for (i = 0; i < M - 1; i++) {
h = (h * d) % q;
}
// Calculate the hash value of pattern and first
// window of text
for (i = 0; i < M; i++) {
p = (d * p + P[i]) % q;
t = (d * t + T[i]) % q;
}
// Slide the pattern over text one by one
for (i = 0; i <= N - M; i++) {
// Check the hash values of current window of text
// and pattern. If the hash values match then only
// check for characters on by one
if (p == t) {
/* Check for characters one by one */
for (j = 0; j < M; j++) {
if (T[i + j] != P[j]) {
break;
}
}
// if p == t and pat[0...M-1] = txt[i, i+1, ...i+M-1]
if (j == M) {
result += i + " ";
}
}
// Calculate hash value for next window of text: Remove
// leading digit, add trailing digit
if (i < N - M) {
t = (d * (t - T[i] * h) + T[i + M]) % q;
// We might get negative value of t, converting it
// to positive
if (t < 0) {
t = (t + q);
}
}
}
return result;
}
}