Constructs a KMP matcher to find exact occurances of pattern in text using the Knuth-Morris-Pratt algorithm.

Determines whether the specified Object is equal to the current Object.

Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.

This will return an int[] giving the offsets of the matches in text (ie the location of the first symbol of each match in the text).

Serves as a hash function for a particular type.

Gets the Type of the current instance.

Creates a shallow copy of the current Object.

Returns a String that represents the current Object.

The table of border lengths

the pattern being searched for