Algorithms: String Algorithms

function kmp_match(array $text, array $pattern): int {
    alg_require(array_is_list($text));
    alg_require(array_is_list($pattern));
    $n = count($text);
    $m = count($pattern);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((($m >= 0) && ($m <= 1000000)));
    alg_require((count($pattern) == $m));
    alg_require((count($text) == $n));
    if (($m == 0)) {
        return 0;
    }

    static int naive_match(int[] text, int[] pattern) {
        java.util.Objects.requireNonNull(text, "text");
        java.util.Objects.requireNonNull(pattern, "pattern");
        int n = text.length;
        int m = pattern.length;
        alg_require(((n >= 0) && (n <= 1000000)));
        alg_require(((m >= 0) && (m <= 1000000)));
        alg_require((pattern.length == m));
        alg_require((text.length == n));
        int i = 0;
        int j = 0;
        while ((i <= Math.subtractExact(n, m))) {

function naive_match(text, pattern) {
    alg_require(text instanceof Int32Array);
    alg_require(pattern instanceof Int32Array);
    let n = text.length;
    let m = pattern.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((m >= 0) && (m <= 1000000)));
    alg_require((pattern.length == m));
    alg_require((text.length == n));
    let i = 0;
    let j = 0;
    while ((i <= alg_sub(n, m))) {

def naive_match(text: list[int], pattern: list[int]) -> int:
    alg_require(isinstance(text, (list, tuple)) and len(text) <= 1000000)
    alg_require(isinstance(pattern, (list, tuple)) and len(pattern) <= 1000000)
    n: int = len(text)
    m: int = len(pattern)
    alg_require(n >= 0 and n <= 1000000)
    alg_require(m >= 0 and m <= 1000000)
    alg_require(len(pattern) == m)
    alg_require(len(text) == n)
    i: int = 0
    j: int = 0
    while i <= n - m:

int naive_match(const int *text, size_t text_length, const int *pattern, size_t pattern_length) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    if (text_length > 1000000 || (text_length && !text)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (pattern_length > 1000000 || (pattern_length && !pattern)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    int n = (int)text_length;
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    int m = (int)pattern_length;
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((n >= 0) && (n <= 1000000)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }