在流中捕获特定字节模式的最有效方法是什么?
What is the most efficient way of catching a specific patern of bytes in a stream?
我正在从 TCP 套接字读取数据流。所有这些数据都被发送到一个字节数组中:
DataInputStream in = new DataInputStream(mysource.getInputStream());
FileOutputStream output = new FileOutputStream(path);
int len;
byte buffer[] = new byte [8192];
while(len = in.read(buffer)) !=-1){
output.write(buffer);
}
output.close();
在读取流时,我想检测一个随机重复的特定 4 字节模式。
我尝试使用 for
语句在数据保存后遍历所有数据,但此解决方案效率非常低。
有什么办法可以实时做到这一点吗?
/**
* Knuth-Morris-Pratt Algorithm for Pattern Matching
*/
class KMPMatch {
/**
* Finds the first occurrence of the pattern in the text.
*/
public int indexOf(byte[] data, byte[] pattern) {
int[] failure = computeFailure(pattern);
int j = 0;
if (data.length == 0) return -1;
for (int i = 0; i < data.length; i++) {
while (j > 0 && pattern[j] != data[i]) {
j = failure[j - 1];
}
if (pattern[j] == data[i]) { j++; }
if (j == pattern.length) {
return i - pattern.length + 1;
}
}
return -1;
}
/**
* Computes the failure function using a boot-strapping process,
* where the pattern is matched against itself.
*/
private int[] computeFailure(byte[] pattern) {
int[] failure = new int[pattern.length];
int j = 0;
for (int i = 1; i < pattern.length; i++) {
while (j > 0 && pattern[j] != pattern[i]) {
j = failure[j - 1];
}
if (pattern[j] == pattern[i]) {
j++;
}
failure[i] = j;
}
return failure;
}
}
从这里开始:
Searching for a sequence of Bytes in a Binary File with Java
我正在从 TCP 套接字读取数据流。所有这些数据都被发送到一个字节数组中:
DataInputStream in = new DataInputStream(mysource.getInputStream());
FileOutputStream output = new FileOutputStream(path);
int len;
byte buffer[] = new byte [8192];
while(len = in.read(buffer)) !=-1){
output.write(buffer);
}
output.close();
在读取流时,我想检测一个随机重复的特定 4 字节模式。
我尝试使用 for
语句在数据保存后遍历所有数据,但此解决方案效率非常低。
有什么办法可以实时做到这一点吗?
/**
* Knuth-Morris-Pratt Algorithm for Pattern Matching
*/
class KMPMatch {
/**
* Finds the first occurrence of the pattern in the text.
*/
public int indexOf(byte[] data, byte[] pattern) {
int[] failure = computeFailure(pattern);
int j = 0;
if (data.length == 0) return -1;
for (int i = 0; i < data.length; i++) {
while (j > 0 && pattern[j] != data[i]) {
j = failure[j - 1];
}
if (pattern[j] == data[i]) { j++; }
if (j == pattern.length) {
return i - pattern.length + 1;
}
}
return -1;
}
/**
* Computes the failure function using a boot-strapping process,
* where the pattern is matched against itself.
*/
private int[] computeFailure(byte[] pattern) {
int[] failure = new int[pattern.length];
int j = 0;
for (int i = 1; i < pattern.length; i++) {
while (j > 0 && pattern[j] != pattern[i]) {
j = failure[j - 1];
}
if (pattern[j] == pattern[i]) {
j++;
}
failure[i] = j;
}
return failure;
}
}
从这里开始: Searching for a sequence of Bytes in a Binary File with Java