nv-buf-resizable-ring 1.0.0

package/TEST/check-ring.js

@@ -0,0 +1,153 @@
+const _ring = require("../ring");
+{
+// 创建一个逻辑容量为 8 的 Uint8 Ring
+const ring = _ring.creat_u8ring(8);
+const target = ring["#target"] || ring; // 兼容 Proxy 模式
+
+console.log("--- 1. 基础填充测试 ---");
+ring.apend(new Uint8Array([1, 2, 3, 4]));
+console.log("Size after 4 bytes:", ring.size()); // 4
+console.log("Buffer content:", Array.from({length: ring.size()}, (_, i) => ring.get(i))); // [1, 2, 3, 4]
+
+console.log("\n--- 2. 物理回绕测试 ---");
+ring.dloc(2); // 释放 [1, 2]，此时 si=2, ei=4
+ring.apend(new Uint8Array([5, 6, 7, 8])); 
+// 此时 si=2, ei 应该回绕了。总 size: (4-2) + 4 = 6
+console.log("Size after wrap:", ring.size()); // 6
+console.log("Data at logical index 0:", ring.get(0)); // 3 (原先的索引2)
+console.log("Logical full data:", Array.from({length: ring.size()}, (_, i) => ring.get(i))); // [3, 4, 5, 6, 7, 8]
+
+console.log("\n--- 3. 扩容测试 ---");
+// 当前 size 为 6，再加 5 个字节，总计 11，超过容量 8
+ring.apend(new Uint8Array([9, 10, 11, 12, 13])); 
+console.log("Size after expansion:", ring.size()); // 11
+console.log("Buffer length (physical):", target.buf.length); // 应该是 8*2+1 = 17 或更大
+console.log("All data after expansion:", Array.from({length: ring.size()}, (_, i) => ring.get(i))); 
+// 应完整保留顺序: [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
+
+console.log("\n--- 4. Set/Get 边界与 Proxy 测试 ---");
+const px = _ring.creat_u8px(8);
+px.apend(new Uint8Array([100, 101]));
+console.log("px[0]:", px[0]); // 100
+px[1] = 200; // 修改
+console.log("px[1] after set:", px[1]); // 200
+px[2] = 102; // 触发 set 中的 offset === size() 自动追加
+console.log("px size after auto-append:", px.size()); // 3
+}
+// ANSI Colors
+const C = {
+    R: "\x1b[31m", G: "\x1b[32m", Y: "\x1b[33m", 
+    B: "\x1b[34m", M: "\x1b[35m", C: "\x1b[36m", W: "\x1b[0m"
+};
+
+const ring = _ring.creat_u8ring(8);
+const target = ring["#target"] || ring;
+
+function report(action, expected, actual, extra = "") {
+    const isOk = JSON.stringify(expected) === JSON.stringify(actual);
+    console.log(`${C.W}[${action}]`);
+    console.log(`  Expected: ${C.G}${JSON.stringify(expected)}${C.W}`);
+    console.log(`  Actual:   ${isOk ? C.G : C.R}${JSON.stringify(actual)}${C.W}`);
+    console.log(`  Status:   ${C.C}si:${target.si}, ei:${target.ei}, size:${ring.size()}${C.W} ${extra}`);
+    console.log("-".repeat(40));
+}
+
+console.log(`${C.M}=== ResizableRingBuffer Deep Inspection ===${C.W}\n`);
+
+// 1. 初始填充
+ring.apend(new Uint8Array([10, 20, 30, 40]));
+report("Append 4b", [10, 20, 30, 40], Array.from(ring));
+
+// 2. 制造回绕
+ring.dloc(3); // 剩 [40]
+ring.apend(new Uint8Array([50, 60, 70, 80])); // 此时逻辑 0 位物理在后面，其余在前面
+report("Wrap Move", [40, 50, 60, 70, 80], Array.from(ring), "(Physical Wrap Triggered)");
+
+// 3. 测试 for_each 逻辑与物理索引映射
+const trace = [];
+ring.for_each((v, i, p) => {
+    trace.push({v, i, p});
+    return false; // don't break
+});
+console.log(`${C.Y}[ForEach Mapping Inspection]${C.W}`);
+trace.forEach(t => {
+    console.log(`  Logic[${t.i}] -> ${C.B}Phys[${t.p}]${C.W} : Value(${t.v})`);
+});
+console.log("-".repeat(40));
+
+// 4. 扩容压力测试
+const bigData = [90, 100, 110, 120, 130];
+ring.apend(new Uint8Array(bigData));
+report("Expansion", [40, 50, 60, 70, 80, 90, 100, 110, 120, 130], Array.from(ring));
+
+// 5. Iterator 测试
+const iterResult = [];
+for(let v of ring) iterResult.push(v);
+report("Symbol.iterator", [40, 50, 60, 70, 80, 90, 100, 110, 120, 130], iterResult);
+
+{
+const C = {
+    R: "\x1b[31m", G: "\x1b[32m", Y: "\x1b[33m", 
+    B: "\x1b[34m", M: "\x1b[35m", C: "\x1b[36m", 
+    GR: "\x1b[90m", W: "\x1b[0m", INV: "\x1b[7m"
+};
+
+function dump_physical(ring) {
+    const target = ring["#target"] || ring;
+    const buf = target.buf;
+    const { si, ei } = target;
+    
+    let parts = [];
+    for (let i = 0; i < buf.length; i++) {
+        let val = buf[i].toString().padStart(2, '0');
+        let style = "";
+        
+        // 标记指针位置
+        if (i === si && i === ei) style = C.R + C.INV; // 重合（理论上只有reset或极小容量出现）
+        else if (i === si) style = C.G + C.INV;        // si 起点
+        else if (i === ei) style = C.Y + C.INV;        // ei 终点
+        
+        // 标记数据有效区
+        let is_used = false;
+        if (si <= ei) {
+            is_used = i >= si && i < ei;
+        } else {
+            is_used = i >= si || i < ei;
+        }
+        
+        if (!style && !is_used) style = C.GR; // 无效区变灰
+        parts.push(`${style}${val}${C.W}`);
+    }
+    return `[ ${parts.join(" ")} ]`;
+}
+
+function report(ring, action, expected) {
+    const actual = Array.from(ring);
+    const isOk = JSON.stringify(expected) === JSON.stringify(actual);
+    const target = ring["#target"] || ring;
+
+    console.log(`\n${C.M}>> ACTION: ${action}${C.W}`);
+    console.log(`${C.Y}Logic Exp: ${JSON.stringify(expected)}${C.W}`);
+    console.log(`${C.G}Logic Act: ${isOk ? C.G : C.R}${JSON.stringify(actual)}${C.W}`);
+    console.log(`${C.C}Phys Info: si=${target.si}, ei=${target.ei}, len=${target.buf.length}${C.W}`);
+    console.log(`${C.B}Raw Buf:   ${dump_physical(ring)}${C.W}`);
+    console.log(`${C.GR}${"-".repeat(60)}${C.W}`);
+}
+
+// 开始测试
+const ring = _ring.creat_u8px(8); // 物理长度 9
+
+report(ring, "Initial", []);
+
+ring.apend(new Uint8Array([1, 2, 3]));
+report(ring, "Append 3b", [1, 2, 3]);
+
+ring.dloc(2);
+report(ring, "Dloc 2b (si move)", [3]);
+
+ring.apend(new Uint8Array([4, 5, 6, 7, 8]));
+report(ring, "Append 5b (wrap around)", [3, 4, 5, 6, 7, 8]);
+
+ring.apend(new Uint8Array([9, 10])); // 触发扩容
+report(ring, "Append 2b (expansion)", [3, 4, 5, 6, 7, 8, 9, 10]);
+}