From bbddd40297e986a910319997e814111cc02309ef Mon Sep 17 00:00:00 2001
From: tianfenghan <rango@swoole.com>
Date: Thu, 11 Jun 2026 20:12:16 +0800
Subject: [PATCH] =?UTF-8?q?refactor(examples):=20=E4=B8=BA=E5=9F=BA?=
 =?UTF-8?q?=E5=87=86=E6=B5=8B=E8=AF=95=E5=87=BD=E6=95=B0=E6=B7=BB=E5=8A=A0?=
 =?UTF-8?q?=E5=8F=82=E6=95=B0=E7=B1=BB=E5=9E=8B=E5=A3=B0=E6=98=8E?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

- 为 Ack 函数添加 int 类型参数声明
- 为 ackermann 函数添加 int 类型参数声明
- 为 ary3 函数添加 int 类型参数声明
- 为 hash1 函数添加 int 类型参数声明
- 为 hash2 函数添加 int 类型参数声明
- 为 gen_random 函数添加 int 类型参数声明
- 为 heapsort_r 函数添加 int 类型参数声明
- 为 heapsort 函数添加 int 类型参数声明
---
 examples/bench.php | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/examples/bench.php b/examples/bench.php
index 762b9490..2a1b60f1 100644
--- a/examples/bench.php
+++ b/examples/bench.php
@@ -104,14 +104,14 @@ function mandel2() {
 
 /****/
 
-function Ack($m, $n){
+function Ack(int $m, int $n){
   if($m == 0) return $n+1;
   if($n == 0) return Ack($m-1, 1);
   return Ack($m - 1, Ack($m, ($n - 1)));
 }
 
-function ackermann($n) {
-  $r = Ack(3,$n);
+function ackermann(int $n) {
+  $r = Ack(3, $n);
   print "Ack(3,$n): $r\n";
 }
 
@@ -163,7 +163,7 @@ function ary2($n) {
 
 /****/
 
-function ary3($n) {
+function ary3(int $n) {
   for ($i=0; $i<$n; $i++) {
     $X[$i] = $i + 1;
     $Y[$i] = 0;
@@ -190,7 +190,7 @@ function fibo(int $n) {
 
 /****/
 
-function hash1($n) {
+function hash1(int $n) {
   for ($i = 1; $i <= $n; $i++) {
     $X[dechex($i)] = $i;
   }
@@ -203,7 +203,7 @@ function hash1($n) {
 
 /****/
 
-function hash2($n) {
+function hash2(int $n) {
   for ($i = 0; $i < $n; $i++) {
     $hash1["foo_$i"] = $i;
     $hash2["foo_$i"] = 0;
@@ -218,12 +218,12 @@ function hash2($n) {
 
 /****/
 
-function gen_random ($n) {
+function gen_random (int $n) {
     global $LAST;
     return( ($n * ($LAST = ($LAST * IA + IC) % IM)) / IM );
 }
 
-function heapsort_r($n, &$ra) {
+function heapsort_r(int $n, &$ra) {
     $l = ($n >> 1) + 1;
     $ir = $n;
 
@@ -255,7 +255,7 @@ function heapsort_r($n, &$ra) {
     }
 }
 
-function heapsort($N) {
+function heapsort(int $N) {
   global $LAST;
 
   define("IM", 139968);