Lines Matching +full:l +full:- +full:max
11 * Copyright © 2007-2017, Hoa community. All rights reserved.
44 * @copyright Copyright © 2007-2017 Hoa community
65 $L = [-1 => array_fill(-1, $n - $m + $k + 3, -2)];
67 for ($q = 0, $max = $k - 1; $q <= $max; ++$q) {
68 $L[$q][-$q - 1] = $L[$q][-$q - 2] = $q - 1;
72 for ($d = -$q, $max = $n - $m + $k - $q; $d <= $max; ++$d) {
73 $l = min(
74 max(
75 $L[$q - 1][$d - 1],
76 $L[$q - 1][$d ] + 1,
77 $L[$q - 1][$d + 1] + 1
79 $m - 1
81 $a = substr($x, $l + 1, $m - $l);
82 $b = substr($y, $l + 1 + $d, $n - $l - $d);
83 $L[$q][$d] = $l + static::lcp($a, $b);
85 if ($L[$q][$d] == $m - 1 ||
86 $d + $L[$q][$d] == $n - 1) {
88 $i = max(0, $j - $m);
89 $offset[$q][] = ['i' => $i, 'j' => $j, 'l' => $j - $i];
106 $max = min(strlen($x), strlen($y));
109 while ($i < $max && $x[$i] == $y[$i]) {