@@ -197,7 +197,7 @@ public function setSeq2(array $b): self
197197 * @param int $blo the lower constraint for the second sequence
198198 * @param int $bhi the upper constraint for the second sequence
199199 *
200- * @return array an array containing the longest match that includes the starting position in $a, start in $b and the length/size
200+ * @return int[] an array containing the longest match that includes the starting position in $a, start in $b and the length/size
201201 */
202202 public function findLongestMatch (int $ alo , int $ ahi , int $ blo , int $ bhi ): array
203203 {
@@ -287,7 +287,7 @@ public function findLongestMatch(int $alo, int $ahi, int $blo, int $bhi): array
287287 * constraint of the block in $b and finally the number of lines that the
288288 * block continues for.
289289 *
290- * @return array a nested array of the matching blocks, as described by the function
290+ * @return int[][] a nested array of the matching blocks, as described by the function
291291 */
292292 public function getMatchingBlocks (): array
293293 {
@@ -384,7 +384,7 @@ public function getMatchingBlocks(): array
384384 * $i1 in $a.
385385 * equal - The two strings with the specified ranges are equal.
386386 *
387- * @return array array of the opcodes describing the differences between the strings
387+ * @return int[][] array of the opcodes describing the differences between the strings
388388 */
389389 public function getOpcodes (): array
390390 {
@@ -434,7 +434,7 @@ public function getOpcodes(): array
434434 *
435435 * @param int $context the number of lines of context to provide around the groups
436436 *
437- * @return array nested array of all of the grouped opcodes
437+ * @return int[][][] nested array of all of the grouped opcodes
438438 */
439439 public function getGroupedOpcodes (int $ context = 3 ): array
440440 {
0 commit comments