Boyer Moore Majority Vote in PHP

<?php
declare(strict_types=1);
// Boyer Moore Majority Vote in PHP
//
// PURPOSE
// Majority vote cancels pairs of different values. If a value occurs more than half the
// time, it survives as the final candidate.
//
// METHOD
// Choose a new candidate whenever the balance is zero. Increment for matching values and
// decrement for different ones. Make a second pass to verify the candidate, since a majority
// need not exist.
//
// COMPLEXITY
// O(n) time and O(1) auxiliary space.
//
// CONTRACT
// Returns the INDEX of a verified majority value, or -1 if none exists. Returning an index
// avoids colliding with any valid integer value.
// 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: 0.
// 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 majority_index(array $a): int {
    alg_require(array_is_list($a));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    $candidate = 0;
    $balance = 0;
    $i = 0;
    $count = 0;
    while (($i < $n)) {
        if (($balance == 0)) {
            $candidate = $i;
        }
        if (($a[$i] == $a[$candidate])) {
            $balance = alg_add($balance, 1);
        } else {
            $balance = alg_sub($balance, 1);
        }
        $i = alg_add($i, 1);
    }
    $i = 0;
    while (($i < $n)) {
        if (($a[$i] == $a[$candidate])) {
            $count = alg_add($count, 1);
        }
        $i = alg_add($i, 1);
    }
    if (($count > intdiv($n, 2))) {
        return $candidate;
    }
    return alg_sub(0, 1);
}

$a = [2, 2, 1, 2];
$result = majority_index($a);
echo $result, PHP_EOL;