From 167298881b4dae8334f1c21cb0af798930fcc36b Mon Sep 17 00:00:00 2001
From: wangli <274027703@qq.com>
Date: Tue, 25 Nov 2025 10:10:01 +0800
Subject: [PATCH] =?UTF-8?q?feat(REQ-5865)=20-=20=E8=B0=83=E6=95=B4=20MQ=20?=
 =?UTF-8?q?=E4=BA=8B=E4=BB=B6=E5=AE=9E=E7=8E=B0=E7=AE=97=20boolean=20?=
 =?UTF-8?q?=E7=9A=84=E9=80=BB=E8=BE=91?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../mq/check/ImplementationReadyChecker.java  | 23 ++++++++++++++-----
 1 file changed, 17 insertions(+), 6 deletions(-)

diff --git a/workflow-engine-spring-boot-starter/src/main/java/cn/axzo/workflow/starter/mq/check/ImplementationReadyChecker.java b/workflow-engine-spring-boot-starter/src/main/java/cn/axzo/workflow/starter/mq/check/ImplementationReadyChecker.java
index b8a9b3522..a32f44233 100644
--- a/workflow-engine-spring-boot-starter/src/main/java/cn/axzo/workflow/starter/mq/check/ImplementationReadyChecker.java
+++ b/workflow-engine-spring-boot-starter/src/main/java/cn/axzo/workflow/starter/mq/check/ImplementationReadyChecker.java
@@ -81,19 +81,30 @@ public class ImplementationReadyChecker implements ApplicationListener<Applicati
 
     }
 
+    /**
+     * 自适应转换：value ≤15 时返回 4 位数组，否则返回最小所需位数数组
+     */
     public static boolean[] toBooleansAdaptive(int value) {
-        if (value < 0) throw new IllegalArgumentException("adaptive mode only for non-negative");
-        if (value == 0) return new boolean[]{false};
-        int bits = 32 - Integer.numberOfLeadingZeros(value);
+        if (value < 0) {
+            throw new IllegalArgumentException("adaptive mode only for non-negative");
+        }
+
+        // 核心修改：value ≤15 强制用 4 位，否则计算最小所需位数
+        int bits = (value <= 15) ? 4 : (32 - Integer.numberOfLeadingZeros(value));
         return toBooleans(value, bits);
     }
 
-    // 高位在前：index=0 是最高位
+    /**
+     * 将 value 转换为指定位数的 boolean 数组（高位在前）
+     */
     public static boolean[] toBooleans(int value, int bits) {
-        if (bits <= 0 || bits > 32) throw new IllegalArgumentException("bits must be 1~32");
+        if (bits <= 0 || bits > 32) {
+            throw new IllegalArgumentException("bits must be 1~32");
+        }
+
         boolean[] arr = new boolean[bits];
         for (int i = 0; i < bits; i++) {
-            int shift = bits - 1 - i;
+            int shift = bits - 1 - i; // 从高位到低位遍历
             arr[i] = ((value >>> shift) & 1) == 1;
         }
         return arr;