com.github.jlangch.venice.util.algo

Class KnuthMorrisPratt

java.lang.Object

com.github.jlangch.venice.util.algo.KnuthMorrisPratt

public abstract class KnuthMorrisPratt
extends java.lang.Object

Knuth-Morris-Pratt (KMP) pattern matching algorithm. The KMP algorithm is an efficient method for finding the occurrence of a substring (a pattern) within a larger string (or in this case, a sequence of bytes) The computeFailure function pre-processes the pattern to facilitate a faster substring search by tracking the longest prefix that's also a suffix at each point in the pattern. This preprocessing step is crucial for the efficiency of the KMP algorithm.

Constructor Summary

Constructors

Constructor and Description
KnuthMorrisPratt()

Method Summary

Modifier and Type	Method and Description
static int	indexOf(byte[] data, byte[] pattern, int indexFrom) Searches for a byte pattern in a larger data buffer.
static int	indexOf(byte[] data, byte[] pattern, int indexFrom, int indexTo) Searches for a byte pattern in a larger data buffer.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

KnuthMorrisPratt

public KnuthMorrisPratt()

Method Detail

indexOf

public static int indexOf(byte[] data,
                          byte[] pattern,
                          int indexFrom)

Searches for a byte pattern in a larger data buffer.

Parameters:

data - The data buffer

pattern - The pattern to search for

indexFrom - The start index to begin search with

Returns:

The index of the first occurrence of the pattern in the buffer or -1 of the pattern is not found.

indexOf

public static int indexOf(byte[] data,
                          byte[] pattern,
                          int indexFrom,
                          int indexTo)

Searches for a byte pattern in a larger data buffer.

Parameters:

data - The data buffer

pattern - The pattern to search for

indexFrom - The start index to begin search with

indexTo - The end index (exclusive) to end search with, may be -1 to skip the end index limit

Returns:

The index of the first occurrence of the pattern in the buffer or -1 of the pattern is not found.