@pisell/pisellos 2.1.4 → 2.1.6

package/dist/modules/Payment/cash.js

@@ -0,0 +1,97 @@
+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); }
+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 _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }
+function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
+function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+import { CURRENCY_DENOMINATIONS, recommendOptimalPayments } from "./cashRecommendationAlgorithm";
+
+/**
+ * 现金支付实现
+ */
+export var CashPaymentImpl = /*#__PURE__*/function () {
+  function CashPaymentImpl(paymentModule) {
+    _classCallCheck(this, CashPaymentImpl);
+    this.paymentModule = paymentModule;
+  }
+  _createClass(CashPaymentImpl, [{
+    key: "processCashPayment",
+    value: function () {
+      var _processCashPayment = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee(amount, orderUuid) {
+        var cashMethod, paymentItem;
+        return _regeneratorRuntime().wrap(function _callee$(_context) {
+          while (1) switch (_context.prev = _context.next) {
+            case 0:
+              _context.next = 2;
+              return this.paymentModule.getCashPaymentMethod();
+            case 2:
+              cashMethod = _context.sent;
+              if (cashMethod) {
+                _context.next = 5;
+                break;
+              }
+              throw new Error('现金支付方式未找到');
+            case 5:
+              paymentItem = {
+                amount: amount.toString(),
+                code: cashMethod.code,
+                id: cashMethod.id,
+                name: cashMethod.name,
+                type: cashMethod.type,
+                voucher_id: ''
+              };
+              _context.next = 8;
+              return this.paymentModule.addPaymentItemAsync(orderUuid, paymentItem);
+            case 8:
+            case "end":
+              return _context.stop();
+          }
+        }, _callee, this);
+      }));
+      function processCashPayment(_x, _x2) {
+        return _processCashPayment.apply(this, arguments);
+      }
+      return processCashPayment;
+    }()
+  }, {
+    key: "getCashBalance",
+    value: function () {
+      var _getCashBalance = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee2() {
+        return _regeneratorRuntime().wrap(function _callee2$(_context2) {
+          while (1) switch (_context2.prev = _context2.next) {
+            case 0:
+              return _context2.abrupt("return", 0);
+            case 1:
+            case "end":
+              return _context2.stop();
+          }
+        }, _callee2);
+      }));
+      function getCashBalance() {
+        return _getCashBalance.apply(this, arguments);
+      }
+      return getCashBalance;
+    }()
+    /**
+     * 获取推荐支付金额
+     * 基于目标金额和货币类型，返回最优支付金额建议
+     * @param money 目标支付金额
+     * @param currency 货币代码 (如: 'CNY', 'USD', 'EUR' 等)
+     * @returns 推荐支付金额数组
+     */
+  }, {
+    key: "getRecommendedAmount",
+    value: function getRecommendedAmount(money, currency) {
+      // 获取对应货币的面额配置
+      var upperCurrency = currency.toUpperCase();
+      var denominations = CURRENCY_DENOMINATIONS[upperCurrency] || CURRENCY_DENOMINATIONS['DEFAULT'];
+
+      // 直接调用算法，所有验证和容错处理都在算法内部
+      return recommendOptimalPayments(money, denominations);
+    }
+  }]);
+  return CashPaymentImpl;
+}();

package/dist/modules/Payment/cashRecommendationAlgorithm.d.ts

@@ -0,0 +1,22 @@
+/**
+ * 现金支付推荐算法
+ *
+ * 核心原理：
+ * 1. 每个推荐金额都应该是独立的最优组合
+ * 2. 不推荐在已有最优解基础上添加额外面额的组合
+ * 3. 优先推荐使用不同数量币种的组合
+ * 4. 根据组合判断去重，避免扩展组合
+ */
+/**
+ * 常见国家货币面额配置
+ */
+export declare const CURRENCY_DENOMINATIONS: Record<string, number[]>;
+/**
+ * 最优支付金额推荐算法
+ * 推荐通过不同数量面额组合刚好足够支付的最小金额
+ *
+ * @param targetAmount 目标金额
+ * @param denominations 币种面值数组
+ * @returns 推荐支付金额数组
+ */
+export declare function recommendOptimalPayments(targetAmount: number, denominations: number[]): number[];

package/dist/modules/Payment/cashRecommendationAlgorithm.js

@@ -0,0 +1,423 @@
+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 _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 _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 _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; }
+/**
+ * 现金支付推荐算法
+ * 
+ * 核心原理：
+ * 1. 每个推荐金额都应该是独立的最优组合
+ * 2. 不推荐在已有最优解基础上添加额外面额的组合
+ * 3. 优先推荐使用不同数量币种的组合
+ * 4. 根据组合判断去重，避免扩展组合
+ */
+
+/**
+ * 常见国家货币面额配置
+ */
+export var CURRENCY_DENOMINATIONS = {
+  // 美元
+  'USD': [100, 50, 20, 10, 5, 2, 1, 0.5, 0.25, 0.1, 0.05, 0.01],
+  // 人民币
+  'CNY': [100, 50, 20, 10, 5, 1, 0.5, 0.1, 0.05, 0.01],
+  'RMB': [100, 50, 20, 10, 5, 1, 0.5, 0.1, 0.05, 0.01],
+  // 欧元
+  'EUR': [500, 200, 100, 50, 20, 10, 5, 2, 1, 0.5, 0.2, 0.1, 0.05, 0.02, 0.01],
+  // 日元
+  'JPY': [10000, 5000, 2000, 1000, 500, 100, 50, 10, 5, 1],
+  // 英镑
+  'GBP': [50, 20, 10, 5, 2, 1, 0.5, 0.2, 0.1, 0.05, 0.02, 0.01],
+  // 澳元
+  'AUD': [100, 50, 20, 10, 5, 2, 1, 0.5, 0.2, 0.1],
+  // 加元
+  'CAD': [100, 50, 20, 10, 5, 2, 1, 0.25, 0.1, 0.05],
+  // 港元
+  'HKD': [1000, 500, 100, 50, 20, 10, 5, 2, 1, 0.5, 0.2, 0.1],
+  // 新台币
+  'TWD': [2000, 1000, 500, 200, 100, 50, 10, 5, 1],
+  // 韩元
+  'KRW': [50000, 10000, 5000, 1000, 500, 100, 50, 10, 5, 1],
+  // 新加坡元
+  'SGD': [10000, 1000, 100, 50, 10, 5, 2, 1, 0.5, 0.2, 0.1, 0.05, 0.01],
+  // 瑞士法郎
+  'CHF': [1000, 200, 100, 50, 20, 10, 5, 2, 1, 0.5, 0.2, 0.1, 0.05],
+  // 默认通用面额（如果币种不在列表中）
+  'DEFAULT': [100, 50, 20, 10, 5, 1, 0.5, 0.25, 0.1, 0.05, 0.01]
+};
+
+/**
+ * 支付组合类型定义
+ */
+
+/**
+ * 最优支付金额推荐算法
+ * 推荐通过不同数量面额组合刚好足够支付的最小金额
+ * 
+ * @param targetAmount 目标金额
+ * @param denominations 币种面值数组
+ * @returns 推荐支付金额数组
+ */
+export function recommendOptimalPayments(targetAmount, denominations) {
+  // 参数验证
+  if (targetAmount <= 0 || !isFinite(targetAmount) || isNaN(targetAmount)) {
+    return [];
+  }
+  if (!denominations || !Array.isArray(denominations) || denominations.length === 0) {
+    return [Math.ceil(targetAmount)];
+  }
+
+  // 过滤有效面额并限制搜索空间以提高性能
+  var maxReasonableDenom = targetAmount * 5; // 适度限制搜索空间
+  var validDenoms = denominations.filter(function (denom) {
+    return denom > 0 && isFinite(denom) && !isNaN(denom) && denom <= maxReasonableDenom;
+  }).slice(0, 8); // 限制面额数量以提高性能
+
+  if (validDenoms.length === 0) {
+    // 如果没有合适的面额，返回最接近的整数金额
+    return [Math.ceil(targetAmount)];
+  }
+  try {
+    // 处理精度问题，将金额转换为整数计算
+    var precision = 100; // 假设最小单位是0.01
+    var target = Math.round(targetAmount * precision);
+    var denoms = validDenoms.map(function (d) {
+      return Math.round(d * precision);
+    }).sort(function (a, b) {
+      return b - a;
+    });
+
+    // 存储不同的支付组合方案
+    var paymentOptions = [];
+
+    // 首先尝试找到精确匹配的组合
+    var exactCombination = findExactCombination(target, denoms, precision);
+    if (exactCombination) {
+      paymentOptions.push(exactCombination);
+    }
+
+    // 为了提高效率，我们将按币种数量来生成组合
+    // 1币种组合：只用一种面额
+    for (var i = 0; i < Math.min(denoms.length, 6); i++) {
+      var denom = denoms[i];
+      var count = Math.ceil(target / denom);
+      var sum = count * denom;
+      if (sum >= target && count <= 12) {
+        // 限制硬币数量以提高性能
+        paymentOptions.push({
+          combination: Array(count).fill(denom / precision),
+          sum: sum / precision,
+          coinCount: count,
+          denomTypes: 1
+        });
+      }
+    }
+
+    // 2币种组合：使用两种面额（大幅限制搜索范围以提高性能）
+    for (var _i = 0; _i < Math.min(denoms.length - 1, 5); _i++) {
+      for (var j = _i + 1; j < Math.min(denoms.length, 6); j++) {
+        var denom1 = denoms[_i];
+        var denom2 = denoms[j];
+
+        // 大幅限制搜索范围，基于目标金额动态调整
+        var maxCount1 = Math.min(Math.ceil(target / denom1) + 1, 8);
+        var maxCount2 = Math.min(Math.ceil(target / denom2) + 1, 10);
+        for (var count1 = 1; count1 <= maxCount1; count1++) {
+          for (var count2 = 1; count2 <= maxCount2; count2++) {
+            var _sum = count1 * denom1 + count2 * denom2;
+            if (_sum >= target) {
+              var combination = [].concat(_toConsumableArray(Array(count1).fill(denom1 / precision)), _toConsumableArray(Array(count2).fill(denom2 / precision)));
+              paymentOptions.push({
+                combination: combination,
+                sum: _sum / precision,
+                coinCount: count1 + count2,
+                denomTypes: 2
+              });
+            }
+          }
+        }
+      }
+    }
+
+    // 3币种组合：使用三种面额（大幅限制搜索以提高效率）
+    for (var _i2 = 0; _i2 < Math.min(denoms.length - 2, 3); _i2++) {
+      for (var _j = _i2 + 1; _j < Math.min(denoms.length - 1, 4); _j++) {
+        for (var k = _j + 1; k < Math.min(denoms.length, 5); k++) {
+          var _denom = denoms[_i2];
+          var _denom2 = denoms[_j];
+          var denom3 = denoms[k];
+
+          // 大幅限制搜索范围
+          var _maxCount = Math.min(Math.ceil(target / _denom) + 1, 5);
+          var _maxCount2 = Math.min(Math.ceil(target / _denom2) + 1, 6);
+          var maxCount3 = Math.min(Math.ceil(target / denom3) + 1, 8);
+          for (var _count = 1; _count <= _maxCount; _count++) {
+            for (var _count2 = 1; _count2 <= _maxCount2; _count2++) {
+              for (var count3 = 1; count3 <= maxCount3; count3++) {
+                var _sum2 = _count * _denom + _count2 * _denom2 + count3 * denom3;
+                if (_sum2 >= target) {
+                  var _combination = [].concat(_toConsumableArray(Array(_count).fill(_denom / precision)), _toConsumableArray(Array(_count2).fill(_denom2 / precision)), _toConsumableArray(Array(count3).fill(denom3 / precision)));
+                  paymentOptions.push({
+                    combination: _combination,
+                    sum: _sum2 / precision,
+                    coinCount: _count + _count2 + count3,
+                    denomTypes: 3
+                  });
+                }
+              }
+            }
+          }
+        }
+      }
+    }
+
+    // 4币种组合：使用四种面额（极度限制搜索以提高性能）
+    for (var _i3 = 0; _i3 < Math.min(denoms.length - 3, 2); _i3++) {
+      for (var _j2 = _i3 + 1; _j2 < Math.min(denoms.length - 2, 3); _j2++) {
+        for (var _k = _j2 + 1; _k < Math.min(denoms.length - 1, 4); _k++) {
+          for (var l = _k + 1; l < Math.min(denoms.length, 5); l++) {
+            var _denom3 = denoms[_i3];
+            var _denom4 = denoms[_j2];
+            var _denom5 = denoms[_k];
+            var denom4 = denoms[l];
+
+            // 极度限制搜索范围
+            var _maxCount3 = Math.min(Math.ceil(target / _denom3) + 1, 3);
+            var _maxCount4 = Math.min(Math.ceil(target / _denom4) + 1, 4);
+            var _maxCount5 = Math.min(Math.ceil(target / _denom5) + 1, 5);
+            var maxCount4 = Math.min(Math.ceil(target / denom4) + 1, 6);
+            for (var _count3 = 1; _count3 <= _maxCount3; _count3++) {
+              for (var _count4 = 1; _count4 <= _maxCount4; _count4++) {
+                for (var _count5 = 1; _count5 <= _maxCount5; _count5++) {
+                  for (var count4 = 1; count4 <= maxCount4; count4++) {
+                    var _sum3 = _count3 * _denom3 + _count4 * _denom4 + _count5 * _denom5 + count4 * denom4;
+                    if (_sum3 >= target) {
+                      var _combination2 = [].concat(_toConsumableArray(Array(_count3).fill(_denom3 / precision)), _toConsumableArray(Array(_count4).fill(_denom4 / precision)), _toConsumableArray(Array(_count5).fill(_denom5 / precision)), _toConsumableArray(Array(count4).fill(denom4 / precision)));
+                      paymentOptions.push({
+                        combination: _combination2,
+                        sum: _sum3 / precision,
+                        coinCount: _count3 + _count4 + _count5 + count4,
+                        denomTypes: 4
+                      });
+                    }
+                  }
+                }
+              }
+            }
+          }
+        }
+      }
+    }
+
+    // 如果没有找到任何组合，提供默认建议
+    if (paymentOptions.length === 0) {
+      // 找到大于等于目标金额的最小面额
+      var minValidDenom = validDenoms.find(function (denom) {
+        return denom >= targetAmount;
+      });
+      if (minValidDenom) {
+        return [minValidDenom];
+      } else {
+        // 使用最大面额的组合
+        var maxDenom = Math.max.apply(Math, _toConsumableArray(validDenoms));
+        var _count6 = Math.ceil(targetAmount / maxDenom);
+        return [_count6 * maxDenom];
+      }
+    }
+
+    // 移除重复和扩展组合
+    var uniqueCombinations = removeDuplicateAndExtendedCombinations(paymentOptions, targetAmount);
+
+    // 按币种类型数量排序，然后按总硬币数量排序，最后按金额排序
+    uniqueCombinations.sort(function (a, b) {
+      if (a.denomTypes !== b.denomTypes) {
+        return a.denomTypes - b.denomTypes;
+      }
+      if (a.coinCount !== b.coinCount) {
+        return a.coinCount - b.coinCount;
+      }
+      return a.sum - b.sum;
+    });
+
+    // 按金额去重并返回推荐的支付金额
+    var uniqueAmounts = new Set();
+    var finalResults = [];
+    for (var _i4 = 0, _uniqueCombinations = uniqueCombinations; _i4 < _uniqueCombinations.length; _i4++) {
+      var item = _uniqueCombinations[_i4];
+      var roundedAmount = Math.round(item.sum * 100) / 100; // 处理浮点数精度
+      if (!uniqueAmounts.has(roundedAmount) && finalResults.length < 10) {
+        uniqueAmounts.add(roundedAmount);
+        finalResults.push(roundedAmount);
+      }
+    }
+    return finalResults.sort(function (a, b) {
+      return a - b;
+    });
+  } catch (error) {
+    // 发生错误时返回安全的默认值
+    console.warn('推荐支付金额计算出错:', error);
+    // 返回最接近的整数金额作为兜底
+    var safeAmount = Math.ceil(targetAmount);
+    return [targetAmount, safeAmount];
+  }
+}
+
+/**
+ * 尝试找到精确匹配目标金额的组合
+ */
+function findExactCombination(target, denoms, precision) {
+  // 简单的深度优先搜索，限制搜索深度
+  function dfs(remaining, denomIndex, currentCombination) {
+    if (remaining === 0) {
+      return currentCombination;
+    }
+    if (remaining < 0 || denomIndex >= denoms.length || currentCombination.length > 10) {
+      return null;
+    }
+    var denom = denoms[denomIndex];
+
+    // 尝试使用当前面额 0 到 maxCount 次
+    var maxCount = Math.min(Math.floor(remaining / denom), 8);
+    for (var count = maxCount; count >= 0; count--) {
+      var newCombination = [].concat(_toConsumableArray(currentCombination), _toConsumableArray(Array(count).fill(denom)));
+      var result = dfs(remaining - count * denom, denomIndex + 1, newCombination);
+      if (result) {
+        return result;
+      }
+    }
+    return null;
+  }
+  var exactMatch = dfs(target, 0, []);
+  if (exactMatch && exactMatch.length > 0) {
+    var denomTypes = new Set(exactMatch).size;
+    return {
+      combination: exactMatch.map(function (d) {
+        return d / precision;
+      }),
+      sum: target / precision,
+      coinCount: exactMatch.length,
+      denomTypes: denomTypes
+    };
+  }
+  return null;
+}
+
+/**
+ * 移除重复和扩展组合
+ * 核心原理：如果组合A包含组合B的所有硬币，并且还有额外硬币，则A是B的扩展，应该被移除
+ */
+function removeDuplicateAndExtendedCombinations(combinations, targetAmount) {
+  var result = [];
+
+  // 按币种类型数量、硬币数量、金额排序，确保较简单的组合在前面
+  combinations.sort(function (a, b) {
+    if (a.denomTypes !== b.denomTypes) {
+      return a.denomTypes - b.denomTypes;
+    }
+    if (a.coinCount !== b.coinCount) {
+      return a.coinCount - b.coinCount;
+    }
+    return a.sum - b.sum;
+  });
+  for (var i = 0; i < combinations.length; i++) {
+    var current = combinations[i];
+    var shouldSkip = false;
+
+    // 检查当前组合是否与已添加的组合重复或者是扩展
+    for (var j = 0; j < result.length; j++) {
+      var existing = result[j];
+
+      // 如果完全相同，跳过
+      if (isSameCombination(current.combination, existing.combination)) {
+        shouldSkip = true;
+        break;
+      }
+
+      // 如果当前组合是已存在组合的扩展，跳过
+      if (isExtensionOf(current.combination, existing.combination)) {
+        shouldSkip = true;
+        break;
+      }
+    }
+
+    // 检查是否有其他组合是当前组合的扩展，如果有，移除那些扩展
+    if (!shouldSkip) {
+      // 移除所有当前组合的扩展
+      for (var _j3 = result.length - 1; _j3 >= 0; _j3--) {
+        if (isExtensionOf(result[_j3].combination, current.combination)) {
+          result.splice(_j3, 1);
+        }
+      }
+      result.push(current);
+    }
+  }
+  return result;
+}
+
+/**
+ * 检查组合A是否是组合B的扩展（即A包含B的所有硬币，并且还有额外的硬币）
+ */
+function isExtensionOf(combinationA, combinationB) {
+  // 如果A的硬币数量少于等于B，A不可能是B的扩展
+  if (combinationA.length <= combinationB.length) {
+    return false;
+  }
+
+  // 统计每个面额的数量
+  var countA = {};
+  var countB = {};
+  combinationA.forEach(function (coin) {
+    countA[coin] = (countA[coin] || 0) + 1;
+  });
+  combinationB.forEach(function (coin) {
+    countB[coin] = (countB[coin] || 0) + 1;
+  });
+
+  // 检查B的所有面额在A中是否都有足够的数量
+  for (var coin in countB) {
+    if (!countA[coin] || countA[coin] < countB[coin]) {
+      return false;
+    }
+  }
+
+  // 检查A是否有B没有的额外硬币
+  var hasExtra = false;
+  for (var _coin in countA) {
+    if (countA[_coin] > (countB[_coin] || 0)) {
+      hasExtra = true;
+      break;
+    }
+  }
+  return hasExtra;
+}
+
+/**
+ * 检查两个组合是否本质相同（相同的面额组合）
+ */
+function isSameCombination(combinationA, combinationB) {
+  if (combinationA.length !== combinationB.length) {
+    return false;
+  }
+  var countA = {};
+  var countB = {};
+  combinationA.forEach(function (coin) {
+    countA[coin] = (countA[coin] || 0) + 1;
+  });
+  combinationB.forEach(function (coin) {
+    countB[coin] = (countB[coin] || 0) + 1;
+  });
+
+  // 检查两个组合是否有相同的面额和数量
+  for (var coin in countA) {
+    if (countA[coin] !== (countB[coin] || 0)) {
+      return false;
+    }
+  }
+  for (var _coin2 in countB) {
+    if (countB[_coin2] !== (countA[_coin2] || 0)) {
+      return false;
+    }
+  }
+  return true;
+}

package/dist/modules/Payment/eftpos.d.ts

@@ -0,0 +1,11 @@
+import { EftposPayment } from './types';
+import type { PaymentModule } from './index';
+/**
+ * Eftpos支付实现
+ */
+export declare class EftposPaymentImpl implements EftposPayment {
+    private paymentModule;
+    constructor(paymentModule: PaymentModule);
+    processEftposPayment(amount: number, orderUuid: string): Promise<void>;
+    checkDeviceStatus(): Promise<boolean>;
+}