@nokecy/qc-ui-components 0.0.0-stage → 2.0.0-beta.1

package/dist/cjs/scanCollect/index.js

@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "ScanFeedbackInput", {
+  enumerable: true,
+  get: function get() {
+    return _ScanFeedbackInput.default;
+  }
+});
+Object.defineProperty(exports, "ScanInput", {
+  enumerable: true,
+  get: function get() {
+    return _ScanInput.default;
+  }
+});
+Object.defineProperty(exports, "blurOn", {
+  enumerable: true,
+  get: function get() {
+    return _focus.blurOn;
+  }
+});
+Object.defineProperty(exports, "canTakeFocus", {
+  enumerable: true,
+  get: function get() {
+    return _focus.canTakeFocus;
+  }
+});
+Object.defineProperty(exports, "createRequestGate", {
+  enumerable: true,
+  get: function get() {
+    return _requestGate.createRequestGate;
+  }
+});
+Object.defineProperty(exports, "focusOn", {
+  enumerable: true,
+  get: function get() {
+    return _focus.focusOn;
+  }
+});
+Object.defineProperty(exports, "playScanSound", {
+  enumerable: true,
+  get: function get() {
+    return _scanSound.playScanSound;
+  }
+});
+Object.defineProperty(exports, "usePromiseQueue", {
+  enumerable: true,
+  get: function get() {
+    return _usePromiseQueue.default;
+  }
+});
+var _ScanInput = _interopRequireDefault(require("./ScanInput"));
+var _ScanFeedbackInput = _interopRequireDefault(require("./ScanFeedbackInput"));
+var _scanSound = require("./scanSound");
+var _usePromiseQueue = _interopRequireDefault(require("./usePromiseQueue"));
+var _requestGate = require("./requestGate");
+var _focus = require("./focus");
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

package/dist/cjs/scanCollect/requestGate.d.ts

@@ -0,0 +1,18 @@
+/**
+ * 请求时序门：每次发请求取一个序号，回执时只认最新序号。
+ *
+ * 扫码采集页上「回车解析工单」与「切换工序取清单」都是异步的，先发的请求可能后到，
+ * 把新结果覆盖成旧结果（例如减配清单被上一张工单的空清单冲掉）。回执前问一句 `isCurrent(id)`，
+ * 不是最新的就丢弃。`invalidate()` 让所有在途请求作废（回车、失焦、卸载、重置时调用）。
+ *
+ * @author nokecy
+ */
+export interface RequestGate {
+    /** 发请求前取号 */
+    next: () => number;
+    /** 回执时判断这个号是否仍是最新 */
+    isCurrent: (id: number) => boolean;
+    /** 作废所有在途请求 */
+    invalidate: () => void;
+}
+export declare const createRequestGate: () => RequestGate;

package/dist/cjs/scanCollect/requestGate.js

@@ -0,0 +1,30 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRequestGate = void 0;
+/**
+ * 请求时序门：每次发请求取一个序号，回执时只认最新序号。
+ *
+ * 扫码采集页上「回车解析工单」与「切换工序取清单」都是异步的，先发的请求可能后到，
+ * 把新结果覆盖成旧结果（例如减配清单被上一张工单的空清单冲掉）。回执前问一句 `isCurrent(id)`，
+ * 不是最新的就丢弃。`invalidate()` 让所有在途请求作废（回车、失焦、卸载、重置时调用）。
+ *
+ * @author nokecy
+ */
+
+var createRequestGate = exports.createRequestGate = function createRequestGate() {
+  var seq = 0;
+  return {
+    next: function next() {
+      return ++seq;
+    },
+    isCurrent: function isCurrent(id) {
+      return id === seq;
+    },
+    invalidate: function invalidate() {
+      seq += 1;
+    }
+  };
+};

package/dist/cjs/scanCollect/scanSound.d.ts

@@ -0,0 +1,15 @@
+/**
+ * 扫码提示音：用 WebAudio 合成，不依赖音频资源文件。
+ * AudioContext 是模块级单例——浏览器限制同一页面可创建的上下文数量，且需要在用户手势后才能出声，
+ * 每次扫码都 new 一个既浪费也会被拒绝。
+ *
+ * @author nokecy
+ */
+export type ScanSoundType = 'success' | 'error';
+/**
+ * 播放一次扫码提示音。静默失败：没有 WebAudio、上下文被浏览器挂起且无法恢复时直接忽略，不影响采集流程。
+ * @returns 是否已提交播放
+ */
+export declare function playScanSound(type: ScanSoundType): boolean;
+/** 仅测试用：丢弃共享上下文。 */
+export declare function resetScanSoundForTest(): void;

package/dist/cjs/scanCollect/scanSound.js

@@ -0,0 +1,91 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.playScanSound = playScanSound;
+exports.resetScanSoundForTest = resetScanSoundForTest;
+function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+/**
+ * 扫码提示音：用 WebAudio 合成，不依赖音频资源文件。
+ * AudioContext 是模块级单例——浏览器限制同一页面可创建的上下文数量，且需要在用户手势后才能出声，
+ * 每次扫码都 new 一个既浪费也会被拒绝。
+ *
+ * @author nokecy
+ */
+
+var sharedContext;
+
+/** 取（或创建）共享的 AudioContext；环境不支持 WebAudio 时返回 undefined。 */
+function getAudioContext() {
+  var _window$AudioContext;
+  if (sharedContext) return sharedContext;
+  var Ctor = typeof window === 'undefined' ? undefined : (_window$AudioContext = window.AudioContext) !== null && _window$AudioContext !== void 0 ? _window$AudioContext : window.webkitAudioContext;
+  if (!Ctor) return undefined;
+  try {
+    sharedContext = new Ctor();
+  } catch (_unused) {
+    return undefined;
+  }
+  return sharedContext;
+}
+
+/** 每种结果的音符序列：[频率 Hz, 起点 s, 时长 s]。成功一声高短音；失败两声低音，听感上与成功明显不同。 */
+var TONES = {
+  success: [[880, 0, 0.12]],
+  error: [[220, 0, 0.18], [220, 0.26, 0.18]]
+};
+
+/**
+ * 播放一次扫码提示音。静默失败：没有 WebAudio、上下文被浏览器挂起且无法恢复时直接忽略，不影响采集流程。
+ * @returns 是否已提交播放
+ */
+function playScanSound(type) {
+  var ctx = getAudioContext();
+  if (!ctx) return false;
+  try {
+    var _ctx$resume;
+    if (ctx.state === 'suspended') void ((_ctx$resume = ctx.resume) === null || _ctx$resume === void 0 ? void 0 : _ctx$resume.call(ctx));
+    var now = ctx.currentTime;
+    var _iterator = _createForOfIteratorHelper(TONES[type]),
+      _step;
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var _step$value = _slicedToArray(_step.value, 3),
+          frequency = _step$value[0],
+          offset = _step$value[1],
+          length = _step$value[2];
+        var osc = ctx.createOscillator();
+        var gain = ctx.createGain();
+        osc.type = type === 'error' ? 'square' : 'sine';
+        osc.frequency.value = frequency;
+        // 起止做短包络，避免爆音。
+        gain.gain.setValueAtTime(0.0001, now + offset);
+        gain.gain.exponentialRampToValueAtTime(0.2, now + offset + 0.01);
+        gain.gain.exponentialRampToValueAtTime(0.0001, now + offset + length);
+        osc.connect(gain);
+        gain.connect(ctx.destination);
+        osc.start(now + offset);
+        osc.stop(now + offset + length + 0.02);
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+    return true;
+  } catch (_unused2) {
+    return false;
+  }
+}
+
+/** 仅测试用：丢弃共享上下文。 */
+function resetScanSoundForTest() {
+  sharedContext = undefined;
+}

package/dist/cjs/scanCollect/usePromiseQueue.d.ts

@@ -0,0 +1,34 @@
+/** 队列里的一个任务：返回 Promise 或普通值都可以，同步抛错按失败处理。 */
+export type QueueTask<T = any> = () => T | Promise<T>;
+export interface PromiseQueueOptions {
+    /**
+     * 任务失败后丢弃后面还没开始的任务，丢弃条数计入 `skipped`。
+     * 连续扫码时第一枪报错，后面排着的几枪多半是同一个问题，接着跑只会刷出一串报错。
+     */
+    abortOnError?: boolean;
+}
+export interface PromiseQueue<T = any, E = any> {
+    /** 已成功任务的返回值，按完成顺序 */
+    result: T[];
+    /** 已失败任务的错误，按完成顺序 */
+    errors: E[];
+    /** 还没完成的任务（含正在执行的那个）；`queue.length > 0` 即「还有活没干完」 */
+    queue: QueueTask<T>[];
+    /** 等同 `queue.length`，用于遮罩上的「还有 N 条待完成」 */
+    pending: number;
+    /** `abortOnError` 时因前面失败而丢弃的任务数，累计到 `reset()` */
+    skipped: number;
+    /** 追加任务；同一时刻连续追加也会按顺序全部执行 */
+    addQueue: (task: QueueTask<T>) => void;
+    /** 丢弃还没开始的任务，并清空 result、errors、skipped（正在执行的任务照常跑完） */
+    reset: () => void;
+}
+/**
+ * 串行任务队列：扫码采集「扫一枪排一条，一条一条提交」。
+ *
+ * 扫码枪比服务端快，连续扫的条码必须排队按顺序提交，否则后端会并发处理同一张工单。
+ * 任务返回非 Promise（如扫码枪空回车时回调直接 return）或同步抛错都不会卡住队列。
+ *
+ * @author nokecy
+ */
+export default function usePromiseQueue<T = any, E = any>(options?: PromiseQueueOptions): PromiseQueue<T, E>;

package/dist/cjs/scanCollect/usePromiseQueue.js

@@ -0,0 +1,156 @@
+"use strict";
+
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = usePromiseQueue;
+var _react = require("react");
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
+function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
+function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
+function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
+function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+/** 队列里的一个任务：返回 Promise 或普通值都可以，同步抛错按失败处理。 */
+
+/**
+ * 串行任务队列：扫码采集「扫一枪排一条，一条一条提交」。
+ *
+ * 扫码枪比服务端快，连续扫的条码必须排队按顺序提交，否则后端会并发处理同一张工单。
+ * 任务返回非 Promise（如扫码枪空回车时回调直接 return）或同步抛错都不会卡住队列。
+ *
+ * @author nokecy
+ */
+function usePromiseQueue() {
+  var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};
+  var tasksRef = (0, _react.useRef)([]);
+  var runningRef = (0, _react.useRef)(false);
+  var mountedRef = (0, _react.useRef)(true);
+  var optionsRef = (0, _react.useRef)(options);
+  optionsRef.current = options;
+  var _useState = (0, _react.useState)([]),
+    _useState2 = _slicedToArray(_useState, 2),
+    queue = _useState2[0],
+    setQueue = _useState2[1];
+  var _useState3 = (0, _react.useState)([]),
+    _useState4 = _slicedToArray(_useState3, 2),
+    result = _useState4[0],
+    setResult = _useState4[1];
+  var _useState5 = (0, _react.useState)([]),
+    _useState6 = _slicedToArray(_useState5, 2),
+    errors = _useState6[0],
+    setErrors = _useState6[1];
+  var _useState7 = (0, _react.useState)(0),
+    _useState8 = _slicedToArray(_useState7, 2),
+    skipped = _useState8[0],
+    setSkipped = _useState8[1];
+  (0, _react.useEffect)(function () {
+    mountedRef.current = true;
+    return function () {
+      mountedRef.current = false;
+      tasksRef.current = [];
+    };
+  }, []);
+  var publish = function publish() {
+    if (mountedRef.current) setQueue(_toConsumableArray(tasksRef.current));
+  };
+  var run = (0, _react.useCallback)( /*#__PURE__*/_asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
+    var _loop;
+    return _regeneratorRuntime().wrap(function _callee$(_context2) {
+      while (1) switch (_context2.prev = _context2.next) {
+        case 0:
+          if (!runningRef.current) {
+            _context2.next = 2;
+            break;
+          }
+          return _context2.abrupt("return");
+        case 2:
+          runningRef.current = true;
+          _context2.prev = 3;
+          _loop = /*#__PURE__*/_regeneratorRuntime().mark(function _loop() {
+            var task, value, dropped;
+            return _regeneratorRuntime().wrap(function _loop$(_context) {
+              while (1) switch (_context.prev = _context.next) {
+                case 0:
+                  task = tasksRef.current[0];
+                  _context.prev = 1;
+                  _context.next = 4;
+                  return task();
+                case 4:
+                  value = _context.sent;
+                  if (mountedRef.current) setResult(function (prev) {
+                    return [].concat(_toConsumableArray(prev), [value]);
+                  });
+                  _context.next = 12;
+                  break;
+                case 8:
+                  _context.prev = 8;
+                  _context.t0 = _context["catch"](1);
+                  if (mountedRef.current) setErrors(function (prev) {
+                    return [].concat(_toConsumableArray(prev), [_context.t0]);
+                  });
+                  if (optionsRef.current.abortOnError) {
+                    dropped = tasksRef.current.length - 1;
+                    tasksRef.current = tasksRef.current.slice(0, 1);
+                    if (dropped > 0 && mountedRef.current) setSkipped(function (prev) {
+                      return prev + dropped;
+                    });
+                  }
+                case 12:
+                  tasksRef.current = tasksRef.current.slice(1);
+                  publish();
+                case 14:
+                case "end":
+                  return _context.stop();
+              }
+            }, _loop, null, [[1, 8]]);
+          });
+        case 5:
+          if (!(tasksRef.current.length && mountedRef.current)) {
+            _context2.next = 9;
+            break;
+          }
+          return _context2.delegateYield(_loop(), "t0", 7);
+        case 7:
+          _context2.next = 5;
+          break;
+        case 9:
+          _context2.prev = 9;
+          runningRef.current = false;
+          return _context2.finish(9);
+        case 12:
+        case "end":
+          return _context2.stop();
+      }
+    }, _callee, null, [[3,, 9, 12]]);
+  })), []);
+  var addQueue = (0, _react.useCallback)(function (task) {
+    tasksRef.current = [].concat(_toConsumableArray(tasksRef.current), [task]);
+    publish();
+    void run();
+  }, [run]);
+  var reset = (0, _react.useCallback)(function () {
+    tasksRef.current = runningRef.current ? tasksRef.current.slice(0, 1) : [];
+    publish();
+    setResult([]);
+    setErrors([]);
+    setSkipped(0);
+  }, []);
+  return {
+    result: result,
+    errors: errors,
+    queue: queue,
+    pending: queue.length,
+    skipped: skipped,
+    addQueue: addQueue,
+    reset: reset
+  };
+}

package/dist/cjs/shared/businessDecimal.d.ts

@@ -0,0 +1,11 @@
+import Decimal from 'decimal.js';
+/** 业务值保留十进制文本，运算使用十进制库；整型标识和时间不经过此入口。@author nokecy */
+export declare const BusinessDecimal: typeof Decimal;
+export type DecimalValue = string | number | Decimal | null | undefined;
+export declare const decimal: (value: DecimalValue) => Decimal;
+export declare const decimalText: (value: DecimalValue) => string;
+export declare const nonNegativeDecimal: (value: DecimalValue) => string;
+export declare const roundDecimal: (value: DecimalValue, places: number) => string;
+export declare const sumDecimals: (values: DecimalValue[]) => string;
+/** 指定取位规则显示，千分位直接处理文本，不转换为 JavaScript number。@author nokecy */
+export declare const formatDecimal: (value: DecimalValue, places?: number, minimumPlaces?: number) => string;

package/dist/cjs/shared/businessDecimal.js

@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumDecimals = exports.roundDecimal = exports.nonNegativeDecimal = exports.formatDecimal = exports.decimalText = exports.decimal = exports.BusinessDecimal = void 0;
+var _decimal = _interopRequireDefault(require("decimal.js"));
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+/** 业务值保留十进制文本，运算使用十进制库；整型标识和时间不经过此入口。@author nokecy */
+var BusinessDecimal = exports.BusinessDecimal = _decimal.default.clone({
+  precision: 64,
+  rounding: _decimal.default.ROUND_HALF_UP,
+  toExpNeg: -64,
+  toExpPos: 64
+});
+var decimal = exports.decimal = function decimal(value) {
+  return new BusinessDecimal(value == null || value === '' ? '0' : value);
+};
+var decimalText = exports.decimalText = function decimalText(value) {
+  return decimal(value).toFixed();
+};
+var nonNegativeDecimal = exports.nonNegativeDecimal = function nonNegativeDecimal(value) {
+  return BusinessDecimal.max(0, decimal(value)).toFixed();
+};
+var roundDecimal = exports.roundDecimal = function roundDecimal(value, places) {
+  return decimal(value).toDecimalPlaces(places).toFixed();
+};
+var sumDecimals = exports.sumDecimals = function sumDecimals(values) {
+  return values.reduce(function (sum, value) {
+    return sum.plus(decimal(value));
+  }, decimal('0')).toFixed();
+};
+
+/** 指定取位规则显示，千分位直接处理文本，不转换为 JavaScript number。@author nokecy */
+var formatDecimal = exports.formatDecimal = function formatDecimal(value) {
+  var places = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 6;
+  var minimumPlaces = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+  if (value == null || value === '') return '';
+  var _decimal$toFixed$spli = decimal(value).toFixed(places).split('.'),
+    _decimal$toFixed$spli2 = _slicedToArray(_decimal$toFixed$spli, 2),
+    integer = _decimal$toFixed$spli2[0],
+    _decimal$toFixed$spli3 = _decimal$toFixed$spli2[1],
+    fraction = _decimal$toFixed$spli3 === void 0 ? '' : _decimal$toFixed$spli3;
+  while (fraction.length > minimumPlaces && fraction.endsWith('0')) fraction = fraction.slice(0, -1);
+  integer = integer.replace(/\B(?=(\d{3})+(?!\d))/g, ',');
+  return fraction ? "".concat(integer, ".").concat(fraction) : integer;
+};

package/dist/cjs/shared/contrast.d.ts

@@ -0,0 +1,40 @@
+/**
+ * 对比度计算与「够读的主色」派生。
+ *
+ * 背景：品牌绿 #00b96b 落在白底上只有 2.58:1，而正文文字要 4.5:1、非文本要 3:1（WCAG 2.1）。
+ * antd 从它派生的最深一档 colorPrimaryActive 也只有 3.90:1——够非文本，够不到文字。
+ * 所以菜单选中态、行内操作按钮这些「用主色写字」的地方，靠 antd 自带档位解决不了。
+ *
+ * 这里按色相不变、只压明度的方式派生出刚好达标的一档：绿还是那个绿，但读得清。
+ * 写成纯函数而不是写死一个色值，是因为四个客户各有各的主色，写死就只对信诚成立。
+ *
+ * 验收方法沿用登录页复核那套：实测计算，不看源码想当然。
+ *
+ * @author nokecy
+ */
+/** hex -> [r, g, b]，每项 0~255。 */
+export declare function toRgb(hex: string): [number, number, number];
+/** WCAG 相对亮度。 */
+export declare function relativeLuminance(hex: string): number;
+/** WCAG 对比度，1 ~ 21。 */
+export declare function contrastRatio(a: string, b: string): number;
+/** hex -> [h(0~360), s(0~1), l(0~1)]。 */
+export declare function toHsl(hex: string): [number, number, number];
+/** [h, s, l] -> hex。 */
+export declare function fromHsl(h: number, s: number, l: number): string;
+/**
+ * 压暗到刚好满足对比度要求的一档，色相与饱和度保持不变。
+ *
+ * @param hex     起始色（通常是品牌主色）
+ * @param against 要压在什么底色上，默认白底
+ * @param min     目标对比度，正文 4.5、非文本 3
+ */
+export declare function darkenUntilContrast(hex: string, { against, min }?: {
+    against?: string | undefined;
+    min?: number | undefined;
+}): string;
+/** 深色表面上的文字保持色相，提亮至正文对比度。@author nokecy */
+export declare function lightenUntilContrast(hex: string, { against, min }?: {
+    against?: string | undefined;
+    min?: number | undefined;
+}): string;