Skip to content

rabinKarp ​

Returns every zero-based byte offset where pattern occurs in text. Hash matches are verified against the original bytes, so collisions do not create false results.

tyrus
import { rabinKarp } from "tyrus:algorithm";

const matches: usize[] = rabinKarp("ababa", "ba");
print(matches[0], matches[1]); // 1 3

Study result ​

tyrus
interface RabinKarpInfo {
    text: string;
    pattern: string;
    matches: usize[];
    comparisonCount: usize;
    shiftCount: usize;
    windowCount: usize;
    hashCollisionCount: usize;
    textVerificationCount: usize;
}
tyrus
import { RabinKarpInfo, StringSearchInfo, rabinKarpInfo } from "tyrus:algorithm";
const info: RabinKarpInfo = rabinKarpInfo("ababa", "ba");
print(info.matches); // [1, 3]
print(info.windowCount); // 4
print(info.hashCollisionCount); // 0
print(info.textVerificationCount); // 2

The expected complexity is O(n + m), with O(1) auxiliary space besides the result.