Algorithms: String Algorithms

int naive_match(const std::vector<int>& text, const std::vector<int>& pattern) {
    alg_require(text.size() <= 1000000);
    alg_require(pattern.size() <= 1000000);
    int n = (int)text.size();
    int m = (int)pattern.size();
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((m >= 0) && (m <= 1000000)));
    alg_require(((int)pattern.size() == m));
    alg_require(((int)text.size() == n));
    int i = 0;
    int j = 0;
    while ((i <= alg_sub(n, m))) {

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))) {

    static int naive_match(ReadOnlySpan<int> text, ReadOnlySpan<int> pattern) {
        checked {
            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 <= (n - m))) {
                j = 0;

    static int kmp_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));
        if ((m == 0)) {
            return 0;
        }

function kmp_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));
    if ((m == 0)) {
        return 0;
    }