Naive Pattern Matching in PHP

<?php
declare(strict_types=1);
// Naive Pattern Matching in PHP
//
// PURPOSE
// Naive pattern matching tries the pattern at every possible starting position. It is simple
// and useful for short patterns or as a correctness reference.
//
// METHOD
// At each alignment compare tokens until a mismatch or the whole pattern matches. Return the
// first complete match, or -1 after every alignment fails.
//
// COMPLEXITY
// O(nm) worst-case time and O(1) auxiliary space.
//
// CONTRACT
// Text and pattern are integer token arrays with lengths n and m. Empty pattern matches at
// zero. Text normalization/tokenization is outside the function.
// Public APIs infer array lengths except in C, which accepts pointer/length pairs. Vertex
// counts and matrix dimensions remain explicit. Arrays must contain signed 32-bit integers.
// Sorted order, correct tree topology, and caller-owned data-structure invariants are
// preconditions; checking them on every query would change query complexity.
// Scalar and shape checks are included. Value-range checks are included where needed to
// prevent invalid indexing or nontermination. Allocation sizes are capped at 4,000,000
// workspace entries. Arithmetic outside Python raises an error on 32-bit overflow; Python
// uses arbitrary precision. Native allocation failures propagate. In-place outputs may be
// partly updated after arithmetic failure. These are single-threaded, in-memory
// implementations.
//
// LANGUAGE DETAILS
// PHP 8.1+ on a 64-bit runtime: packed arrays, strict scalar types, read-only inputs by
// value using copy-on-write, references only for outputs, and checked 32-bit arithmetic.
// Invalid input and overflow throw exceptions. PHP arrays have higher overhead than native
// packed buffers in C/Java.
//
// EXAMPLE
// Expected return: 2.
// Run: php example.php
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

function alg_require(bool $valid): void { if (!$valid) throw new InvalidArgumentException("invalid algorithm input"); }
function alg_checked(int|float $v): int { if ($v < -2147483648 || $v > 2147483647 || floor($v) != $v) throw new OverflowException("32-bit result overflow"); return (int)$v; }
function alg_add(int $a,int $b): int { return alg_checked($a+$b); }
function alg_sub(int $a,int $b): int { return alg_checked($a-$b); }
function alg_mul(int $a,int $b): int { return alg_checked($a*$b); }
function alg_size(int $n): int { alg_require($n>=0 && $n<=4000000); return $n; }

function naive_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));
    $i = 0;
    $j = 0;
    while (($i <= alg_sub($n, $m))) {
        $j = 0;
        while ((($j < $m) && ($text[alg_add($i, $j)] == $pattern[$j]))) {
            $j = alg_add($j, 1);
        }
        if (($j == $m)) {
            return $i;
        }
        $i = alg_add($i, 1);
    }
    return alg_sub(0, 1);
}

$text = [1, 2, 1, 2, 3];
$pattern = [1, 2, 3];
$result = naive_match($text, $pattern);
echo $result, PHP_EOL;