@alibarbar/common 1.0.0

package/dist/chunk-I3L42475.js

@@ -0,0 +1,145 @@
+'use strict';
+
+// src/core/date.ts
+function formatDate(date, format = "YYYY-MM-DD HH:mm:ss") {
+  const d = typeof date === "number" ? new Date(date) : date;
+  const year = d.getFullYear();
+  const month = String(d.getMonth() + 1).padStart(2, "0");
+  const day = String(d.getDate()).padStart(2, "0");
+  const hours = String(d.getHours()).padStart(2, "0");
+  const minutes = String(d.getMinutes()).padStart(2, "0");
+  const seconds = String(d.getSeconds()).padStart(2, "0");
+  return format.replace("YYYY", String(year)).replace("MM", month).replace("DD", day).replace("HH", hours).replace("mm", minutes).replace("ss", seconds);
+}
+function getRelativeTime(date) {
+  const now = /* @__PURE__ */ new Date();
+  const target = typeof date === "number" ? new Date(date) : date;
+  const diff = now.getTime() - target.getTime();
+  const seconds = Math.floor(diff / 1e3);
+  const minutes = Math.floor(seconds / 60);
+  const hours = Math.floor(minutes / 60);
+  const days = Math.floor(hours / 24);
+  const months = Math.floor(days / 30);
+  const years = Math.floor(days / 365);
+  if (years > 0) return `${years}\u5E74\u524D`;
+  if (months > 0) return `${months}\u4E2A\u6708\u524D`;
+  if (days > 0) return `${days}\u5929\u524D`;
+  if (hours > 0) return `${hours}\u5C0F\u65F6\u524D`;
+  if (minutes > 0) return `${minutes}\u5206\u949F\u524D`;
+  if (seconds > 0) return `${seconds}\u79D2\u524D`;
+  return "\u521A\u521A";
+}
+function isToday(date) {
+  const d = typeof date === "number" ? new Date(date) : date;
+  const today = /* @__PURE__ */ new Date();
+  return d.getDate() === today.getDate() && d.getMonth() === today.getMonth() && d.getFullYear() === today.getFullYear();
+}
+function isYesterday(date) {
+  const d = typeof date === "number" ? new Date(date) : date;
+  const yesterday = /* @__PURE__ */ new Date();
+  yesterday.setDate(yesterday.getDate() - 1);
+  return d.getDate() === yesterday.getDate() && d.getMonth() === yesterday.getMonth() && d.getFullYear() === yesterday.getFullYear();
+}
+function getTimeFromGMT(gmt) {
+  const now = /* @__PURE__ */ new Date();
+  const localOffset = now.getTimezoneOffset();
+  const gmtOffsetMinutes = gmt * 60;
+  const targetTime = new Date(now.getTime() + localOffset * 6e4 + gmtOffsetMinutes * 6e4);
+  const format = getDateFormatByGMT(gmt);
+  return formatDate(targetTime, format);
+}
+function getDateFormatByGMT(gmt) {
+  switch (gmt) {
+    case 0:
+      return "YYYY-MM-DD HH:mm:ss";
+    case 1:
+    case 2:
+    case 3:
+      return "YYYY-MM-DD HH:mm:ss";
+    case 8:
+      return "YYYY-MM-DD HH:mm:ss";
+    case 9:
+      return "YYYY-MM-DD HH:mm:ss";
+    case -5:
+    case -6:
+    case -7:
+    case -8:
+      return "MM/DD/YYYY HH:mm:ss";
+    default:
+      return "YYYY-MM-DD HH:mm:ss";
+  }
+}
+function addDays(date, days) {
+  const d = typeof date === "number" ? new Date(date) : new Date(date);
+  d.setDate(d.getDate() + days);
+  return d;
+}
+function addMonths(date, months) {
+  const d = typeof date === "number" ? new Date(date) : new Date(date);
+  d.setMonth(d.getMonth() + months);
+  return d;
+}
+function addYears(date, years) {
+  const d = typeof date === "number" ? new Date(date) : new Date(date);
+  d.setFullYear(d.getFullYear() + years);
+  return d;
+}
+function diffDays(date1, date2) {
+  const d1 = typeof date1 === "number" ? new Date(date1) : date1;
+  const d2 = typeof date2 === "number" ? new Date(date2) : date2;
+  const diff = d1.getTime() - d2.getTime();
+  return Math.floor(diff / (1e3 * 60 * 60 * 24));
+}
+function startOfDay(date) {
+  const d = typeof date === "number" ? new Date(date) : new Date(date);
+  d.setHours(0, 0, 0, 0);
+  return d;
+}
+function endOfDay(date) {
+  const d = typeof date === "number" ? new Date(date) : new Date(date);
+  d.setHours(23, 59, 59, 999);
+  return d;
+}
+function isWeekend(date) {
+  const d = typeof date === "number" ? new Date(date) : date;
+  const day = d.getDay();
+  return day === 0 || day === 6;
+}
+function isWeekday(date) {
+  return !isWeekend(date);
+}
+function getWeekNumber(date) {
+  const d = typeof date === "number" ? new Date(date) : new Date(date);
+  const target = new Date(d.valueOf());
+  const dayNr = (d.getDay() + 6) % 7;
+  target.setDate(target.getDate() - dayNr + 3);
+  const firstThursday = target.valueOf();
+  target.setMonth(0, 1);
+  if (target.getDay() !== 4) {
+    target.setMonth(0, 1 + (4 - target.getDay() + 7) % 7);
+  }
+  return 1 + Math.ceil((firstThursday - target.valueOf()) / 6048e5);
+}
+function getQuarter(date) {
+  const d = typeof date === "number" ? new Date(date) : date;
+  return Math.floor(d.getMonth() / 3) + 1;
+}
+
+exports.addDays = addDays;
+exports.addMonths = addMonths;
+exports.addYears = addYears;
+exports.diffDays = diffDays;
+exports.endOfDay = endOfDay;
+exports.formatDate = formatDate;
+exports.getDateFormatByGMT = getDateFormatByGMT;
+exports.getQuarter = getQuarter;
+exports.getRelativeTime = getRelativeTime;
+exports.getTimeFromGMT = getTimeFromGMT;
+exports.getWeekNumber = getWeekNumber;
+exports.isToday = isToday;
+exports.isWeekday = isWeekday;
+exports.isWeekend = isWeekend;
+exports.isYesterday = isYesterday;
+exports.startOfDay = startOfDay;
+//# sourceMappingURL=chunk-I3L42475.js.map
+//# sourceMappingURL=chunk-I3L42475.js.map

package/dist/chunk-I3L42475.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/date.ts"],"names":[],"mappings":";;;AAUO,SAAS,UAAA,CAAW,IAAA,EAAqB,MAAA,GAAS,qBAAA,EAA+B;AACtF,EAAA,MAAM,IAAI,OAAO,IAAA,KAAS,WAAW,IAAI,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AAEtD,EAAA,MAAM,IAAA,GAAO,EAAE,WAAA,EAAY;AAC3B,EAAA,MAAM,KAAA,GAAQ,OAAO,CAAA,CAAE,QAAA,KAAa,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAA;AACtD,EAAA,MAAM,GAAA,GAAM,OAAO,CAAA,CAAE,OAAA,EAAS,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAC/C,EAAA,MAAM,KAAA,GAAQ,OAAO,CAAA,CAAE,QAAA,EAAU,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAClD,EAAA,MAAM,OAAA,GAAU,OAAO,CAAA,CAAE,UAAA,EAAY,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AACtD,EAAA,MAAM,OAAA,GAAU,OAAO,CAAA,CAAE,UAAA,EAAY,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAEtD,EAAA,OAAO,MAAA,CACJ,OAAA,CAAQ,MAAA,EAAQ,MAAA,CAAO,IAAI,CAAC,CAAA,CAC5B,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAA,CACnB,OAAA,CAAQ,MAAM,GAAG,CAAA,CACjB,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAA,CACnB,OAAA,CAAQ,IAAA,EAAM,OAAO,CAAA,CACrB,OAAA,CAAQ,IAAA,EAAM,OAAO,CAAA;AAC1B;AAOO,SAAS,gBAAgB,IAAA,EAA6B;AAC3D,EAAA,MAAM,GAAA,uBAAU,IAAA,EAAK;AACrB,EAAA,MAAM,SAAS,OAAO,IAAA,KAAS,WAAW,IAAI,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AAC3D,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,OAAA,EAAQ,GAAI,OAAO,OAAA,EAAQ;AAE5C,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,IAAA,GAAO,GAAI,CAAA;AACtC,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,OAAA,GAAU,EAAE,CAAA;AACvC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,OAAA,GAAU,EAAE,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,KAAA,GAAQ,EAAE,CAAA;AAClC,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,IAAA,GAAO,EAAE,CAAA;AACnC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,IAAA,GAAO,GAAG,CAAA;AAEnC,EAAA,IAAI,KAAA,GAAQ,CAAA,EAAG,OAAO,CAAA,EAAG,KAAK,CAAA,YAAA,CAAA;AAC9B,EAAA,IAAI,MAAA,GAAS,CAAA,EAAG,OAAO,CAAA,EAAG,MAAM,CAAA,kBAAA,CAAA;AAChC,EAAA,IAAI,IAAA,GAAO,CAAA,EAAG,OAAO,CAAA,EAAG,IAAI,CAAA,YAAA,CAAA;AAC5B,EAAA,IAAI,KAAA,GAAQ,CAAA,EAAG,OAAO,CAAA,EAAG,KAAK,CAAA,kBAAA,CAAA;AAC9B,EAAA,IAAI,OAAA,GAAU,CAAA,EAAG,OAAO,CAAA,EAAG,OAAO,CAAA,kBAAA,CAAA;AAClC,EAAA,IAAI,OAAA,GAAU,CAAA,EAAG,OAAO,CAAA,EAAG,OAAO,CAAA,YAAA,CAAA;AAClC,EAAA,OAAO,cAAA;AACT;AAOO,SAAS,QAAQ,IAAA,EAA8B;AACpD,EAAA,MAAM,IAAI,OAAO,IAAA,KAAS,WAAW,IAAI,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AACtD,EAAA,MAAM,KAAA,uBAAY,IAAA,EAAK;AACvB,EAAA,OACE,EAAE,OAAA,EAAQ,KAAM,KAAA,CAAM,OAAA,MACtB,CAAA,CAAE,QAAA,EAAS,KAAM,KAAA,CAAM,UAAS,IAChC,CAAA,CAAE,WAAA,EAAY,KAAM,MAAM,WAAA,EAAY;AAE1C;AAOO,SAAS,YAAY,IAAA,EAA8B;AACxD,EAAA,MAAM,IAAI,OAAO,IAAA,KAAS,WAAW,IAAI,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AACtD,EAAA,MAAM,SAAA,uBAAgB,IAAA,EAAK;AAC3B,EAAA,SAAA,CAAU,OAAA,CAAQ,SAAA,CAAU,OAAA,EAAQ,GAAI,CAAC,CAAA;AACzC,EAAA,OACE,EAAE,OAAA,EAAQ,KAAM,SAAA,CAAU,OAAA,MAC1B,CAAA,CAAE,QAAA,EAAS,KAAM,SAAA,CAAU,UAAS,IACpC,CAAA,CAAE,WAAA,EAAY,KAAM,UAAU,WAAA,EAAY;AAE9C;AAQO,SAAS,eAAe,GAAA,EAAqB;AAClD,EAAA,MAAM,GAAA,uBAAU,IAAA,EAAK;AACrB,EAAA,MAAM,WAAA,GAAc,IAAI,iBAAA,EAAkB;AAE1C,EAAA,MAAM,mBAAmB,GAAA,GAAM,EAAA;AAC/B,EAAA,MAAM,UAAA,GAAa,IAAI,IAAA,CAAK,GAAA,CAAI,SAAQ,GAAI,WAAA,GAAc,GAAA,GAAQ,gBAAA,GAAmB,GAAK,CAAA;AAE1F,EAAA,MAAM,MAAA,GAAS,mBAAmB,GAAG,CAAA;AACrC,EAAA,OAAO,UAAA,CAAW,YAAY,MAAM,CAAA;AACtC;AAQO,SAAS,mBAAmB,GAAA,EAAqB;AACtD,EAAA,QAAQ,GAAA;AAAK,IACX,KAAK,CAAA;AAEH,MAAA,OAAO,qBAAA;AAAA,IACT,KAAK,CAAA;AAAA,IACL,KAAK,CAAA;AAAA,IACL,KAAK,CAAA;AAEH,MAAA,OAAO,qBAAA;AAAA,IACT,KAAK,CAAA;AAEH,MAAA,OAAO,qBAAA;AAAA,IACT,KAAK,CAAA;AAEH,MAAA,OAAO,qBAAA;AAAA,IACT,KAAK,EAAA;AAAA,IACL,KAAK,EAAA;AAAA,IACL,KAAK,EAAA;AAAA,IACL,KAAK,EAAA;AAEH,MAAA,OAAO,qBAAA;AAAA,IACT;AAEE,MAAA,OAAO,qBAAA;AAAA;AAEb;AAQO,SAAS,OAAA,CAAQ,MAAqB,IAAA,EAAoB;AAC/D,EAAA,MAAM,CAAA,GAAI,OAAO,IAAA,KAAS,QAAA,GAAW,IAAI,KAAK,IAAI,CAAA,GAAI,IAAI,IAAA,CAAK,IAAI,CAAA;AACnE,EAAA,CAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,OAAA,EAAQ,GAAI,IAAI,CAAA;AAC5B,EAAA,OAAO,CAAA;AACT;AAQO,SAAS,SAAA,CAAU,MAAqB,MAAA,EAAsB;AACnE,EAAA,MAAM,CAAA,GAAI,OAAO,IAAA,KAAS,QAAA,GAAW,IAAI,KAAK,IAAI,CAAA,GAAI,IAAI,IAAA,CAAK,IAAI,CAAA;AACnE,EAAA,CAAA,CAAE,QAAA,CAAS,CAAA,CAAE,QAAA,EAAS,GAAI,MAAM,CAAA;AAChC,EAAA,OAAO,CAAA;AACT;AAQO,SAAS,QAAA,CAAS,MAAqB,KAAA,EAAqB;AACjE,EAAA,MAAM,CAAA,GAAI,OAAO,IAAA,KAAS,QAAA,GAAW,IAAI,KAAK,IAAI,CAAA,GAAI,IAAI,IAAA,CAAK,IAAI,CAAA;AACnE,EAAA,CAAA,CAAE,WAAA,CAAY,CAAA,CAAE,WAAA,EAAY,GAAI,KAAK,CAAA;AACrC,EAAA,OAAO,CAAA;AACT;AAQO,SAAS,QAAA,CAAS,OAAsB,KAAA,EAA8B;AAC3E,EAAA,MAAM,KAAK,OAAO,KAAA,KAAU,WAAW,IAAI,IAAA,CAAK,KAAK,CAAA,GAAI,KAAA;AACzD,EAAA,MAAM,KAAK,OAAO,KAAA,KAAU,WAAW,IAAI,IAAA,CAAK,KAAK,CAAA,GAAI,KAAA;AACzD,EAAA,MAAM,IAAA,GAAO,EAAA,CAAG,OAAA,EAAQ,GAAI,GAAG,OAAA,EAAQ;AACvC,EAAA,OAAO,KAAK,KAAA,CAAM,IAAA,IAAQ,GAAA,GAAO,EAAA,GAAK,KAAK,EAAA,CAAG,CAAA;AAChD;AAOO,SAAS,WAAW,IAAA,EAA2B;AACpD,EAAA,MAAM,CAAA,GAAI,OAAO,IAAA,KAAS,QAAA,GAAW,IAAI,KAAK,IAAI,CAAA,GAAI,IAAI,IAAA,CAAK,IAAI,CAAA;AACnE,EAAA,CAAA,CAAE,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AACrB,EAAA,OAAO,CAAA;AACT;AAOO,SAAS,SAAS,IAAA,EAA2B;AAClD,EAAA,MAAM,CAAA,GAAI,OAAO,IAAA,KAAS,QAAA,GAAW,IAAI,KAAK,IAAI,CAAA,GAAI,IAAI,IAAA,CAAK,IAAI,CAAA;AACnE,EAAA,CAAA,CAAE,QAAA,CAAS,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,GAAG,CAAA;AAC1B,EAAA,OAAO,CAAA;AACT;AAOO,SAAS,UAAU,IAAA,EAA8B;AACtD,EAAA,MAAM,IAAI,OAAO,IAAA,KAAS,WAAW,IAAI,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AACtD,EAAA,MAAM,GAAA,GAAM,EAAE,MAAA,EAAO;AACrB,EAAA,OAAO,GAAA,KAAQ,KAAK,GAAA,KAAQ,CAAA;AAC9B;AAOO,SAAS,UAAU,IAAA,EAA8B;AACtD,EAAA,OAAO,CAAC,UAAU,IAAI,CAAA;AACxB;AAOO,SAAS,cAAc,IAAA,EAA6B;AACzD,EAAA,MAAM,CAAA,GAAI,OAAO,IAAA,KAAS,QAAA,GAAW,IAAI,KAAK,IAAI,CAAA,GAAI,IAAI,IAAA,CAAK,IAAI,CAAA;AACnE,EAAA,MAAM,MAAA,GAAS,IAAI,IAAA,CAAK,CAAA,CAAE,SAAS,CAAA;AACnC,EAAA,MAAM,KAAA,GAAA,CAAS,CAAA,CAAE,MAAA,EAAO,GAAI,CAAA,IAAK,CAAA;AACjC,EAAA,MAAA,CAAO,OAAA,CAAQ,MAAA,CAAO,OAAA,EAAQ,GAAI,QAAQ,CAAC,CAAA;AAC3C,EAAA,MAAM,aAAA,GAAgB,OAAO,OAAA,EAAQ;AACrC,EAAA,MAAA,CAAO,QAAA,CAAS,GAAG,CAAC,CAAA;AACpB,EAAA,IAAI,MAAA,CAAO,MAAA,EAAO,KAAM,CAAA,EAAG;AACzB,IAAA,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA,GAAA,CAAM,CAAA,GAAI,OAAO,MAAA,EAAO,GAAI,KAAK,CAAE,CAAA;AAAA,EACxD;AACA,EAAA,OAAO,IAAI,IAAA,CAAK,IAAA,CAAA,CAAM,gBAAgB,MAAA,CAAO,OAAA,MAAa,MAAS,CAAA;AACrE;AAOO,SAAS,WAAW,IAAA,EAA6B;AACtD,EAAA,MAAM,IAAI,OAAO,IAAA,KAAS,WAAW,IAAI,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AACtD,EAAA,OAAO,KAAK,KAAA,CAAM,CAAA,CAAE,QAAA,EAAS,GAAI,CAAC,CAAA,GAAI,CAAA;AACxC","file":"chunk-I3L42475.js","sourcesContent":["/**\n * 日期工具函数\n */\n\n/**\n * 格式化日期\n * @param date - 日期对象或时间戳\n * @param format - 格式字符串，默认 'YYYY-MM-DD HH:mm:ss'\n * @returns 格式化后的日期字符串\n */\nexport function formatDate(date: Date | number, format = 'YYYY-MM-DD HH:mm:ss'): string {\n  const d = typeof date === 'number' ? new Date(date) : date;\n\n  const year = d.getFullYear();\n  const month = String(d.getMonth() + 1).padStart(2, '0');\n  const day = String(d.getDate()).padStart(2, '0');\n  const hours = String(d.getHours()).padStart(2, '0');\n  const minutes = String(d.getMinutes()).padStart(2, '0');\n  const seconds = String(d.getSeconds()).padStart(2, '0');\n\n  return format\n    .replace('YYYY', String(year))\n    .replace('MM', month)\n    .replace('DD', day)\n    .replace('HH', hours)\n    .replace('mm', minutes)\n    .replace('ss', seconds);\n}\n\n/**\n * 获取相对时间描述\n * @param date - 日期对象或时间戳\n * @returns 相对时间字符串，如 '2分钟前', '3小时前'\n */\nexport function getRelativeTime(date: Date | number): string {\n  const now = new Date();\n  const target = typeof date === 'number' ? new Date(date) : date;\n  const diff = now.getTime() - target.getTime();\n\n  const seconds = Math.floor(diff / 1000);\n  const minutes = Math.floor(seconds / 60);\n  const hours = Math.floor(minutes / 60);\n  const days = Math.floor(hours / 24);\n  const months = Math.floor(days / 30);\n  const years = Math.floor(days / 365);\n\n  if (years > 0) return `${years}年前`;\n  if (months > 0) return `${months}个月前`;\n  if (days > 0) return `${days}天前`;\n  if (hours > 0) return `${hours}小时前`;\n  if (minutes > 0) return `${minutes}分钟前`;\n  if (seconds > 0) return `${seconds}秒前`;\n  return '刚刚';\n}\n\n/**\n * 判断是否为今天\n * @param date - 日期对象或时间戳\n * @returns 是否为今天\n */\nexport function isToday(date: Date | number): boolean {\n  const d = typeof date === 'number' ? new Date(date) : date;\n  const today = new Date();\n  return (\n    d.getDate() === today.getDate() &&\n    d.getMonth() === today.getMonth() &&\n    d.getFullYear() === today.getFullYear()\n  );\n}\n\n/**\n * 判断是否为昨天\n * @param date - 日期对象或时间戳\n * @returns 是否为昨天\n */\nexport function isYesterday(date: Date | number): boolean {\n  const d = typeof date === 'number' ? new Date(date) : date;\n  const yesterday = new Date();\n  yesterday.setDate(yesterday.getDate() - 1);\n  return (\n    d.getDate() === yesterday.getDate() &&\n    d.getMonth() === yesterday.getMonth() &&\n    d.getFullYear() === yesterday.getFullYear()\n  );\n}\n\n/**\n * 根据格林威治时间与当前时区获取时间 格林威治时间：0表示当前时区，1表示东一区，-1表示西一区\n * 需要返回符合该国家的时间格式\n * @param gmt - 格林威治时间偏移量（小时），0表示GMT+0，1表示GMT+1（东一区），-1表示GMT-1（西一区）\n * @returns 格式化后的时间字符串\n */\nexport function getTimeFromGMT(gmt: number): string {\n  const now = new Date();\n  const localOffset = now.getTimezoneOffset(); // 本地时区偏移（分钟）\n  // GMT偏移量转换为分钟，然后计算目标时区的时间\n  const gmtOffsetMinutes = gmt * 60;\n  const targetTime = new Date(now.getTime() + localOffset * 60000 + gmtOffsetMinutes * 60000);\n  // 获取适合该时区的时间格式\n  const format = getDateFormatByGMT(gmt);\n  return formatDate(targetTime, format);\n}\n\n/**\n * 获取适合指定GMT时区的时间格式\n * 格林威治时间：0表示GMT+0，1表示东一区(GMT+1)，-1表示西一区(GMT-1)\n * @param gmt - GMT时区偏移量（小时）\n * @returns 时间格式字符串\n */\nexport function getDateFormatByGMT(gmt: number): string {\n  switch (gmt) {\n    case 0:\n      // GMT+0 (英国、葡萄牙等)\n      return 'YYYY-MM-DD HH:mm:ss';\n    case 1:\n    case 2:\n    case 3:\n      // GMT+1~+3 (欧洲大部分地区)\n      return 'YYYY-MM-DD HH:mm:ss';\n    case 8:\n      // GMT+8 (中国、新加坡等)\n      return 'YYYY-MM-DD HH:mm:ss';\n    case 9:\n      // GMT+9 (日本、韩国等)\n      return 'YYYY-MM-DD HH:mm:ss';\n    case -5:\n    case -6:\n    case -7:\n    case -8:\n      // GMT-5~-8 (美洲地区)\n      return 'MM/DD/YYYY HH:mm:ss';\n    default:\n      // 默认格式\n      return 'YYYY-MM-DD HH:mm:ss';\n  }\n}\n\n/**\n * 日期加减（天数）\n * @param date - 日期对象或时间戳\n * @param days - 要加减的天数（正数为加，负数为减）\n * @returns 新的日期对象\n */\nexport function addDays(date: Date | number, days: number): Date {\n  const d = typeof date === 'number' ? new Date(date) : new Date(date);\n  d.setDate(d.getDate() + days);\n  return d;\n}\n\n/**\n * 日期加减（月数）\n * @param date - 日期对象或时间戳\n * @param months - 要加减的月数（正数为加，负数为减）\n * @returns 新的日期对象\n */\nexport function addMonths(date: Date | number, months: number): Date {\n  const d = typeof date === 'number' ? new Date(date) : new Date(date);\n  d.setMonth(d.getMonth() + months);\n  return d;\n}\n\n/**\n * 日期加减（年数）\n * @param date - 日期对象或时间戳\n * @param years - 要加减的年数（正数为加，负数为减）\n * @returns 新的日期对象\n */\nexport function addYears(date: Date | number, years: number): Date {\n  const d = typeof date === 'number' ? new Date(date) : new Date(date);\n  d.setFullYear(d.getFullYear() + years);\n  return d;\n}\n\n/**\n * 计算日期差值（天数）\n * @param date1 - 第一个日期\n * @param date2 - 第二个日期\n * @returns 相差的天数（date1 - date2）\n */\nexport function diffDays(date1: Date | number, date2: Date | number): number {\n  const d1 = typeof date1 === 'number' ? new Date(date1) : date1;\n  const d2 = typeof date2 === 'number' ? new Date(date2) : date2;\n  const diff = d1.getTime() - d2.getTime();\n  return Math.floor(diff / (1000 * 60 * 60 * 24));\n}\n\n/**\n * 获取一天的开始时间（00:00:00）\n * @param date - 日期对象或时间戳\n * @returns 一天的开始时间\n */\nexport function startOfDay(date: Date | number): Date {\n  const d = typeof date === 'number' ? new Date(date) : new Date(date);\n  d.setHours(0, 0, 0, 0);\n  return d;\n}\n\n/**\n * 获取一天的结束时间（23:59:59.999）\n * @param date - 日期对象或时间戳\n * @returns 一天的结束时间\n */\nexport function endOfDay(date: Date | number): Date {\n  const d = typeof date === 'number' ? new Date(date) : new Date(date);\n  d.setHours(23, 59, 59, 999);\n  return d;\n}\n\n/**\n * 判断是否为周末\n * @param date - 日期对象或时间戳\n * @returns 是否为周末\n */\nexport function isWeekend(date: Date | number): boolean {\n  const d = typeof date === 'number' ? new Date(date) : date;\n  const day = d.getDay();\n  return day === 0 || day === 6;\n}\n\n/**\n * 判断是否为工作日\n * @param date - 日期对象或时间戳\n * @returns 是否为工作日\n */\nexport function isWeekday(date: Date | number): boolean {\n  return !isWeekend(date);\n}\n\n/**\n * 获取周数（ISO 8601标准）\n * @param date - 日期对象或时间戳\n * @returns 周数（1-53）\n */\nexport function getWeekNumber(date: Date | number): number {\n  const d = typeof date === 'number' ? new Date(date) : new Date(date);\n  const target = new Date(d.valueOf());\n  const dayNr = (d.getDay() + 6) % 7;\n  target.setDate(target.getDate() - dayNr + 3);\n  const firstThursday = target.valueOf();\n  target.setMonth(0, 1);\n  if (target.getDay() !== 4) {\n    target.setMonth(0, 1 + ((4 - target.getDay() + 7) % 7));\n  }\n  return 1 + Math.ceil((firstThursday - target.valueOf()) / 604800000);\n}\n\n/**\n * 获取季度（1-4）\n * @param date - 日期对象或时间戳\n * @returns 季度（1-4）\n */\nexport function getQuarter(date: Date | number): number {\n  const d = typeof date === 'number' ? new Date(date) : date;\n  return Math.floor(d.getMonth() / 3) + 1;\n}\n"]}

package/dist/chunk-JBLX27WD.mjs

@@ -0,0 +1,240 @@
+// src/core/object.ts
+function deepClone(obj) {
+  if (obj === null || typeof obj !== "object") {
+    return obj;
+  }
+  if (obj instanceof Date) {
+    return new Date(obj.getTime());
+  }
+  if (obj instanceof RegExp) {
+    return new RegExp(obj.source, obj.flags);
+  }
+  if (Array.isArray(obj)) {
+    return obj.map((item) => deepClone(item));
+  }
+  if (obj instanceof Map) {
+    const clonedMap = /* @__PURE__ */ new Map();
+    obj.forEach((value, key) => {
+      clonedMap.set(deepClone(key), deepClone(value));
+    });
+    return clonedMap;
+  }
+  if (obj instanceof Set) {
+    const clonedSet = /* @__PURE__ */ new Set();
+    obj.forEach((value) => {
+      clonedSet.add(deepClone(value));
+    });
+    return clonedSet;
+  }
+  if (typeof obj === "object") {
+    const clonedObj = {};
+    for (const key in obj) {
+      if (Object.prototype.hasOwnProperty.call(obj, key)) {
+        clonedObj[key] = deepClone(obj[key]);
+      }
+    }
+    return clonedObj;
+  }
+  return obj;
+}
+function merge(target, ...sources) {
+  return Object.assign({}, target, ...sources);
+}
+function deepMerge(target, ...sources) {
+  if (!sources.length) return target;
+  const source = sources.shift();
+  if (!source) {
+    return deepMerge(target, ...sources);
+  }
+  if (isObject(target) && isObject(source)) {
+    for (const key in source) {
+      if (Object.prototype.hasOwnProperty.call(source, key)) {
+        const sourceValue = source[key];
+        const targetValue = target[key];
+        if (isObject(sourceValue) && isObject(targetValue)) {
+          target[key] = deepMerge(
+            targetValue,
+            sourceValue
+          );
+        } else if (sourceValue !== void 0) {
+          target[key] = sourceValue;
+        }
+      }
+    }
+  }
+  return deepMerge(target, ...sources);
+}
+function isObject(item) {
+  return item !== null && typeof item === "object" && !Array.isArray(item) && !(item instanceof Date) && !(item instanceof RegExp) && !(item instanceof Map) && !(item instanceof Set);
+}
+function get(obj, path, defaultValue) {
+  if (!obj || typeof obj !== "object") {
+    return defaultValue;
+  }
+  const keys2 = Array.isArray(path) ? path : path.split(".");
+  if (keys2.length === 0) {
+    return defaultValue;
+  }
+  let result = obj;
+  for (const key of keys2) {
+    if (result == null || typeof result !== "object" || Array.isArray(result)) {
+      return defaultValue;
+    }
+    const record = result;
+    if (!(key in record)) {
+      return defaultValue;
+    }
+    result = record[key];
+  }
+  return result !== void 0 ? result : defaultValue;
+}
+function set(obj, path, value) {
+  const keys2 = Array.isArray(path) ? path : path.split(".");
+  if (keys2.length === 0) return obj;
+  const result = deepClone(obj);
+  let current = result;
+  for (let i = 0; i < keys2.length - 1; i++) {
+    const key = keys2[i];
+    if (!(key in current) || typeof current[key] !== "object" || current[key] === null) {
+      current[key] = {};
+    }
+    current = current[key];
+  }
+  current[keys2[keys2.length - 1]] = value;
+  return result;
+}
+function pick(obj, keys2) {
+  const result = {};
+  keys2.forEach((key) => {
+    if (key in obj) {
+      result[key] = obj[key];
+    }
+  });
+  return result;
+}
+function omit(obj, keys2) {
+  const result = { ...obj };
+  keys2.forEach((key) => {
+    delete result[key];
+  });
+  return result;
+}
+function keys(obj, deep = false) {
+  if (!deep) return Object.keys(obj);
+  const result = [];
+  const traverse = (current, prefix = "") => {
+    Object.keys(current).forEach((key) => {
+      const fullKey = prefix ? `${prefix}.${key}` : key;
+      result.push(fullKey);
+      const value = current[key];
+      if (value !== null && typeof value === "object" && !Array.isArray(value) && !(value instanceof Date) && !(value instanceof RegExp)) {
+        traverse(value, fullKey);
+      }
+    });
+  };
+  traverse(obj);
+  return result;
+}
+function values(obj, deep = false) {
+  if (!deep) return Object.values(obj);
+  const result = [];
+  const traverse = (current) => {
+    Object.values(current).forEach((value) => {
+      if (value !== null && typeof value === "object" && !Array.isArray(value) && !(value instanceof Date) && !(value instanceof RegExp)) {
+        traverse(value);
+      } else {
+        result.push(value);
+      }
+    });
+  };
+  traverse(obj);
+  return result;
+}
+function mapKeys(obj, fn) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    const newKey = fn(key, obj[key]);
+    result[newKey] = obj[key];
+  });
+  return result;
+}
+function mapValues(obj, fn) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    result[key] = fn(obj[key], key);
+  });
+  return result;
+}
+function invert(obj) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    result[String(obj[key])] = key;
+  });
+  return result;
+}
+function defaults(obj, ...defaults2) {
+  const result = { ...obj };
+  defaults2.reverse().forEach((defaultObj) => {
+    Object.keys(defaultObj).forEach((key) => {
+      const typedKey = key;
+      if (!(typedKey in result) || result[typedKey] === void 0) {
+        result[typedKey] = defaultObj[typedKey];
+      }
+    });
+  });
+  return result;
+}
+function isEmptyObject(obj) {
+  return Object.keys(obj).length === 0;
+}
+function isEqual(obj1, obj2) {
+  if (obj1 === obj2) return true;
+  if (obj1 === null || obj2 === null) return false;
+  if (typeof obj1 !== "object" || typeof obj2 !== "object") return false;
+  if (obj1 instanceof Date && obj2 instanceof Date) {
+    return obj1.getTime() === obj2.getTime();
+  }
+  if (Array.isArray(obj1) && Array.isArray(obj2)) {
+    if (obj1.length !== obj2.length) return false;
+    return obj1.every((item, index) => isEqual(item, obj2[index]));
+  }
+  if (Array.isArray(obj1) || Array.isArray(obj2)) return false;
+  const keys1 = Object.keys(obj1);
+  const keys2 = Object.keys(obj2);
+  if (keys1.length !== keys2.length) return false;
+  return keys1.every((key) => {
+    const val1 = obj1[key];
+    const val2 = obj2[key];
+    return isEqual(val1, val2);
+  });
+}
+function transform(obj, iteratee, accumulator = {}) {
+  Object.keys(obj).forEach((key) => {
+    iteratee(accumulator, obj[key], key);
+  });
+  return accumulator;
+}
+function pickBy(obj, predicate) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    const typedKey = key;
+    if (predicate(obj[typedKey], key)) {
+      result[typedKey] = obj[typedKey];
+    }
+  });
+  return result;
+}
+function omitBy(obj, predicate) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    const typedKey = key;
+    if (!predicate(obj[typedKey], key)) {
+      result[typedKey] = obj[typedKey];
+    }
+  });
+  return result;
+}
+
+export { deepClone, deepMerge, defaults, get, invert, isEmptyObject, isEqual, keys, mapKeys, mapValues, merge, omit, omitBy, pick, pickBy, set, transform, values };
+//# sourceMappingURL=chunk-JBLX27WD.mjs.map
+//# sourceMappingURL=chunk-JBLX27WD.mjs.map

package/dist/chunk-JBLX27WD.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/object.ts"],"names":["keys","defaults"],"mappings":";AAUO,SAAS,UAAa,GAAA,EAAW;AAEtC,EAAA,IAAI,GAAA,KAAQ,IAAA,IAAQ,OAAO,GAAA,KAAQ,QAAA,EAAU;AAC3C,IAAA,OAAO,GAAA;AAAA,EACT;AAGA,EAAA,IAAI,eAAe,IAAA,EAAM;AACvB,IAAA,OAAO,IAAI,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,CAAA;AAAA,EAC/B;AAGA,EAAA,IAAI,eAAe,MAAA,EAAQ;AACzB,IAAA,OAAO,IAAI,MAAA,CAAO,GAAA,CAAI,MAAA,EAAQ,IAAI,KAAK,CAAA;AAAA,EACzC;AAGA,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,EAAG;AACtB,IAAA,OAAO,GAAA,CAAI,GAAA,CAAI,CAAA,IAAA,KAAQ,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA,EACxC;AAGA,EAAA,IAAI,eAAe,GAAA,EAAK;AACtB,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,IAAA,GAAA,CAAI,OAAA,CAAQ,CAAC,KAAA,EAAO,GAAA,KAAQ;AAC1B,MAAA,SAAA,CAAU,IAAI,SAAA,CAAU,GAAG,CAAA,EAAG,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,IAChD,CAAC,CAAA;AACD,IAAA,OAAO,SAAA;AAAA,EACT;AAGA,EAAA,IAAI,eAAe,GAAA,EAAK;AACtB,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,IAAA,GAAA,CAAI,QAAQ,CAAA,KAAA,KAAS;AACnB,MAAA,SAAA,CAAU,GAAA,CAAI,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,IAChC,CAAC,CAAA;AACD,IAAA,OAAO,SAAA;AAAA,EACT;AAGA,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,MAAM,YAAY,EAAC;AACnB,IAAA,KAAA,MAAW,OAAO,GAAA,EAAK;AACrB,MAAA,IAAI,OAAO,SAAA,CAAU,cAAA,CAAe,IAAA,CAAK,GAAA,EAAK,GAAG,CAAA,EAAG;AAClD,QAAA,SAAA,CAAU,GAAG,CAAA,GAAI,SAAA,CAAU,GAAA,CAAI,GAAG,CAAC,CAAA;AAAA,MACrC;AAAA,IACF;AACA,IAAA,OAAO,SAAA;AAAA,EACT;AAEA,EAAA,OAAO,GAAA;AACT;AAQO,SAAS,KAAA,CAAyC,WAAc,OAAA,EAA0B;AAC/F,EAAA,OAAO,OAAO,MAAA,CAAO,EAAC,EAAG,MAAA,EAAQ,GAAG,OAAO,CAAA;AAC7C;AAQO,SAAS,SAAA,CACd,WACG,OAAA,EACA;AACH,EAAA,IAAI,CAAC,OAAA,CAAQ,MAAA,EAAQ,OAAO,MAAA;AAC5B,EAAA,MAAM,MAAA,GAAS,QAAQ,KAAA,EAAM;AAE7B,EAAA,IAAI,CAAC,MAAA,EAAQ;AACX,IAAA,OAAO,SAAA,CAAU,MAAA,EAAQ,GAAG,OAAO,CAAA;AAAA,EACrC;AAEA,EAAA,IAAI,QAAA,CAAS,MAAM,CAAA,IAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACxC,IAAA,KAAA,MAAW,OAAO,MAAA,EAAQ;AACxB,MAAA,IAAI,OAAO,SAAA,CAAU,cAAA,CAAe,IAAA,CAAK,MAAA,EAAQ,GAAG,CAAA,EAAG;AACrD,QAAA,MAAM,WAAA,GAAc,OAAO,GAAG,CAAA;AAC9B,QAAA,MAAM,WAAA,GAAc,OAAO,GAAG,CAAA;AAE9B,QAAA,IAAI,QAAA,CAAS,WAAW,CAAA,IAAK,QAAA,CAAS,WAAW,CAAA,EAAG;AAElD,UAAA,MAAA,CAAO,GAAG,CAAA,GAAI,SAAA;AAAA,YACZ,WAAA;AAAA,YACA;AAAA,WACF;AAAA,QACF,CAAA,MAAA,IAAW,gBAAgB,MAAA,EAAW;AAEpC,UAAA,MAAA,CAAO,GAAG,CAAA,GAAI,WAAA;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,SAAA,CAAU,MAAA,EAAQ,GAAG,OAAO,CAAA;AACrC;AAKA,SAAS,SAAS,IAAA,EAAgD;AAChE,EAAA,OACE,IAAA,KAAS,QACT,OAAO,IAAA,KAAS,YAChB,CAAC,KAAA,CAAM,QAAQ,IAAI,CAAA,IACnB,EAAE,IAAA,YAAgB,IAAA,CAAA,IAClB,EAAE,IAAA,YAAgB,MAAA,CAAA,IAClB,EAAE,IAAA,YAAgB,GAAA,CAAA,IAClB,EAAE,IAAA,YAAgB,GAAA,CAAA;AAEtB;AASO,SAAS,GAAA,CACd,GAAA,EACA,IAAA,EACA,YAAA,EACe;AACf,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA,EAAU;AACnC,IAAA,OAAO,YAAA;AAAA,EACT;AAEA,EAAA,MAAMA,KAAAA,GAAO,MAAM,OAAA,CAAQ,IAAI,IAAI,IAAA,GAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AACxD,EAAA,IAAIA,KAAAA,CAAK,WAAW,CAAA,EAAG;AACrB,IAAA,OAAO,YAAA;AAAA,EACT;AAEA,EAAA,IAAI,MAAA,GAAkB,GAAA;AAEtB,EAAA,KAAA,MAAW,OAAOA,KAAAA,EAAM;AACtB,IAAA,IAAI,MAAA,IAAU,QAAQ,OAAO,MAAA,KAAW,YAAY,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzE,MAAA,OAAO,YAAA;AAAA,IACT;AAGA,IAAA,MAAM,MAAA,GAAS,MAAA;AACf,IAAA,IAAI,EAAE,OAAO,MAAA,CAAA,EAAS;AACpB,MAAA,OAAO,YAAA;AAAA,IACT;AAEA,IAAA,MAAA,GAAS,OAAO,GAAG,CAAA;AAAA,EACrB;AAEA,EAAA,OAAO,MAAA,KAAW,SAAa,MAAA,GAAe,YAAA;AAChD;AASO,SAAS,GAAA,CACd,GAAA,EACA,IAAA,EACA,KAAA,EACG;AACH,EAAA,MAAMA,KAAAA,GAAO,MAAM,OAAA,CAAQ,IAAI,IAAI,IAAA,GAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AACxD,EAAA,IAAIA,KAAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,GAAA;AAE9B,EAAA,MAAM,MAAA,GAAS,UAAU,GAAG,CAAA;AAC5B,EAAA,IAAI,OAAA,GAAmC,MAAA;AAEvC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAIA,KAAAA,CAAK,MAAA,GAAS,GAAG,CAAA,EAAA,EAAK;AACxC,IAAA,MAAM,GAAA,GAAMA,MAAK,CAAC,CAAA;AAClB,IAAA,IAAI,EAAE,GAAA,IAAO,OAAA,CAAA,IAAY,OAAO,OAAA,CAAQ,GAAG,CAAA,KAAM,QAAA,IAAY,OAAA,CAAQ,GAAG,CAAA,KAAM,IAAA,EAAM;AAClF,MAAA,OAAA,CAAQ,GAAG,IAAI,EAAC;AAAA,IAClB;AACA,IAAA,OAAA,GAAU,QAAQ,GAAG,CAAA;AAAA,EACvB;AAEA,EAAA,OAAA,CAAQA,KAAAA,CAAKA,KAAAA,CAAK,MAAA,GAAS,CAAC,CAAC,CAAA,GAAI,KAAA;AACjC,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,IAAA,CACd,KACAA,KAAAA,EACY;AACZ,EAAA,MAAM,SAAS,EAAC;AAChB,EAAAA,KAAAA,CAAK,QAAQ,CAAA,GAAA,KAAO;AAClB,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,MAAA,CAAO,GAAG,CAAA,GAAI,GAAA,CAAI,GAAG,CAAA;AAAA,IACvB;AAAA,EACF,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,IAAA,CACd,KACAA,KAAAA,EACY;AACZ,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,GAAA,EAAI;AACxB,EAAAA,KAAAA,CAAK,QAAQ,CAAA,GAAA,KAAO;AAClB,IAAA,OAAO,OAAO,GAAG,CAAA;AAAA,EACnB,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,IAAA,CAAwC,GAAA,EAAQ,IAAA,GAAO,KAAA,EAAiB;AACtF,EAAA,IAAI,CAAC,IAAA,EAAM,OAAO,MAAA,CAAO,KAAK,GAAG,CAAA;AACjC,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,QAAA,GAAW,CAAC,OAAA,EAAkC,MAAA,GAAS,EAAA,KAAa;AACxE,IAAA,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAClC,MAAA,MAAM,UAAU,MAAA,GAAS,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,GAAK,GAAA;AAC9C,MAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AACnB,MAAA,MAAM,KAAA,GAAQ,QAAQ,GAAG,CAAA;AACzB,MAAA,IACE,KAAA,KAAU,IAAA,IACV,OAAO,KAAA,KAAU,YACjB,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,KACpB,EAAE,KAAA,YAAiB,IAAA,CAAA,IACnB,EAAE,iBAAiB,MAAA,CAAA,EACnB;AACA,QAAA,QAAA,CAAS,OAAkC,OAAO,CAAA;AAAA,MACpD;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAA;AACA,EAAA,QAAA,CAAS,GAAG,CAAA;AACZ,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,MAAA,CAA0C,GAAA,EAAQ,IAAA,GAAO,KAAA,EAAkB;AACzF,EAAA,IAAI,CAAC,IAAA,EAAM,OAAO,MAAA,CAAO,OAAO,GAAG,CAAA;AACnC,EAAA,MAAM,SAAoB,EAAC;AAC3B,EAAA,MAAM,QAAA,GAAW,CAAC,OAAA,KAA2C;AAC3D,IAAA,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CAAE,OAAA,CAAQ,CAAA,KAAA,KAAS;AACtC,MAAA,IACE,KAAA,KAAU,IAAA,IACV,OAAO,KAAA,KAAU,YACjB,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,KACpB,EAAE,KAAA,YAAiB,IAAA,CAAA,IACnB,EAAE,iBAAiB,MAAA,CAAA,EACnB;AACA,QAAA,QAAA,CAAS,KAAgC,CAAA;AAAA,MAC3C,CAAA,MAAO;AACL,QAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,MACnB;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAA;AACA,EAAA,QAAA,CAAS,GAAG,CAAA;AACZ,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,OAAA,CACd,KACA,EAAA,EACyB;AACzB,EAAA,MAAM,SAAkC,EAAC;AACzC,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAM,MAAA,GAAS,EAAA,CAAG,GAAA,EAAK,GAAA,CAAI,GAAG,CAAC,CAAA;AAC/B,IAAA,MAAA,CAAO,MAAM,CAAA,GAAI,GAAA,CAAI,GAAG,CAAA;AAAA,EAC1B,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,SAAA,CACd,KACA,EAAA,EACmB;AACnB,EAAA,MAAM,SAA4B,EAAC;AACnC,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAA,CAAO,GAAG,CAAA,GAAI,EAAA,CAAG,GAAA,CAAI,GAAG,GAAG,GAAG,CAAA;AAAA,EAChC,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAOO,SAAS,OAAkD,GAAA,EAAgC;AAChG,EAAA,MAAM,SAAiC,EAAC;AACxC,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAA,CAAO,MAAA,CAAO,GAAA,CAAI,GAAG,CAAC,CAAC,CAAA,GAAI,GAAA;AAAA,EAC7B,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,QAAA,CACd,QACGC,SAAAA,EACA;AACH,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,GAAA,EAAI;AACxB,EAAAA,SAAAA,CAAS,OAAA,EAAQ,CAAE,OAAA,CAAQ,CAAA,UAAA,KAAc;AACvC,IAAA,MAAA,CAAO,IAAA,CAAK,UAAU,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AACrC,MAAA,MAAM,QAAA,GAAW,GAAA;AACjB,MAAA,IAAI,EAAE,QAAA,IAAY,MAAA,CAAA,IAAW,MAAA,CAAO,QAAQ,MAAM,MAAA,EAAW;AAC3D,QAAA,MAAA,CAAO,QAAQ,CAAA,GAAI,UAAA,CAAW,QAAQ,CAAA;AAAA,MACxC;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAOO,SAAS,cAAc,GAAA,EAAuC;AACnE,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,MAAA,KAAW,CAAA;AACrC;AAQO,SAAS,OAAA,CAAW,MAAS,IAAA,EAAkB;AACpD,EAAA,IAAI,IAAA,KAAS,MAAM,OAAO,IAAA;AAC1B,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,IAAA,KAAS,IAAA,EAAM,OAAO,KAAA;AAC3C,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,OAAO,IAAA,KAAS,UAAU,OAAO,KAAA;AAEjE,EAAA,IAAI,IAAA,YAAgB,IAAA,IAAQ,IAAA,YAAgB,IAAA,EAAM;AAChD,IAAA,OAAO,IAAA,CAAK,OAAA,EAAQ,KAAM,IAAA,CAAK,OAAA,EAAQ;AAAA,EACzC;AAEA,EAAA,IAAI,MAAM,OAAA,CAAQ,IAAI,KAAK,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,EAAG;AAC9C,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,IAAA,CAAK,MAAA,EAAQ,OAAO,KAAA;AACxC,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAC,IAAA,EAAM,KAAA,KAAU,QAAQ,IAAA,EAAM,IAAA,CAAK,KAAK,CAAC,CAAC,CAAA;AAAA,EAC/D;AAEA,EAAA,IAAI,KAAA,CAAM,QAAQ,IAAI,CAAA,IAAK,MAAM,OAAA,CAAQ,IAAI,GAAG,OAAO,KAAA;AAEvD,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,IAAA,CAAK,IAA+B,CAAA;AACzD,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,IAAA,CAAK,IAA+B,CAAA;AAEzD,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,KAAA,CAAM,MAAA,EAAQ,OAAO,KAAA;AAE1C,EAAA,OAAO,KAAA,CAAM,MAAM,CAAA,GAAA,KAAO;AACxB,IAAA,MAAM,IAAA,GAAQ,KAAiC,GAAG,CAAA;AAClD,IAAA,MAAM,IAAA,GAAQ,KAAiC,GAAG,CAAA;AAClD,IAAA,OAAO,OAAA,CAAQ,MAAM,IAAI,CAAA;AAAA,EAC3B,CAAC,CAAA;AACH;AASO,SAAS,SAAA,CACd,GAAA,EACA,QAAA,EACA,WAAA,GAAiB,EAAC,EACf;AACH,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,QAAA,CAAS,WAAA,EAAa,GAAA,CAAI,GAAG,CAAA,EAAG,GAAG,CAAA;AAAA,EACrC,CAAC,CAAA;AACD,EAAA,OAAO,WAAA;AACT;AAQO,SAAS,MAAA,CACd,KACA,SAAA,EACY;AACZ,EAAA,MAAM,SAAqB,EAAC;AAC5B,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAM,QAAA,GAAW,GAAA;AACjB,IAAA,IAAI,SAAA,CAAU,GAAA,CAAI,QAAQ,CAAA,EAAG,GAAG,CAAA,EAAG;AACjC,MAAA,MAAA,CAAO,QAAQ,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA;AAAA,IACjC;AAAA,EACF,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,MAAA,CACd,KACA,SAAA,EACY;AACZ,EAAA,MAAM,SAAqB,EAAC;AAC5B,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAM,QAAA,GAAW,GAAA;AACjB,IAAA,IAAI,CAAC,SAAA,CAAU,GAAA,CAAI,QAAQ,CAAA,EAAG,GAAG,CAAA,EAAG;AAClC,MAAA,MAAA,CAAO,QAAQ,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA;AAAA,IACjC;AAAA,EACF,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT","file":"chunk-JBLX27WD.mjs","sourcesContent":["/**\n * 对象工具函数\n */\n\n/**\n * 深拷贝对象\n * 支持 Date、Array、RegExp、Map、Set 等特殊类型\n * @param obj - 输入对象\n * @returns 深拷贝后的对象\n */\nexport function deepClone<T>(obj: T): T {\n  // 处理 null 和基本类型\n  if (obj === null || typeof obj !== 'object') {\n    return obj;\n  }\n\n  // 处理 Date\n  if (obj instanceof Date) {\n    return new Date(obj.getTime()) as unknown as T;\n  }\n\n  // 处理 RegExp\n  if (obj instanceof RegExp) {\n    return new RegExp(obj.source, obj.flags) as unknown as T;\n  }\n\n  // 处理 Array\n  if (Array.isArray(obj)) {\n    return obj.map(item => deepClone(item)) as unknown as T;\n  }\n\n  // 处理 Map\n  if (obj instanceof Map) {\n    const clonedMap = new Map();\n    obj.forEach((value, key) => {\n      clonedMap.set(deepClone(key), deepClone(value));\n    });\n    return clonedMap as unknown as T;\n  }\n\n  // 处理 Set\n  if (obj instanceof Set) {\n    const clonedSet = new Set();\n    obj.forEach(value => {\n      clonedSet.add(deepClone(value));\n    });\n    return clonedSet as unknown as T;\n  }\n\n  // 处理普通对象\n  if (typeof obj === 'object') {\n    const clonedObj = {} as T;\n    for (const key in obj) {\n      if (Object.prototype.hasOwnProperty.call(obj, key)) {\n        clonedObj[key] = deepClone(obj[key]);\n      }\n    }\n    return clonedObj;\n  }\n\n  return obj;\n}\n\n/**\n * 对象合并\n * @param target - 目标对象\n * @param sources - 源对象数组\n * @returns 合并后的对象\n */\nexport function merge<T extends Record<string, unknown>>(target: T, ...sources: Partial<T>[]): T {\n  return Object.assign({}, target, ...sources);\n}\n\n/**\n * 深合并对象\n * @param target - 目标对象\n * @param sources - 源对象数组\n * @returns 深合并后的对象\n */\nexport function deepMerge<T extends Record<string, unknown>>(\n  target: T,\n  ...sources: Partial<T>[]\n): T {\n  if (!sources.length) return target;\n  const source = sources.shift();\n\n  if (!source) {\n    return deepMerge(target, ...sources);\n  }\n\n  if (isObject(target) && isObject(source)) {\n    for (const key in source) {\n      if (Object.prototype.hasOwnProperty.call(source, key)) {\n        const sourceValue = source[key];\n        const targetValue = target[key];\n\n        if (isObject(sourceValue) && isObject(targetValue)) {\n          // 递归合并嵌套对象\n          target[key] = deepMerge(\n            targetValue as Record<string, unknown>,\n            sourceValue as Record<string, unknown>\n          ) as T[Extract<keyof T, string>];\n        } else if (sourceValue !== undefined) {\n          // 直接赋值（包括 null）\n          target[key] = sourceValue as T[Extract<keyof T, string>];\n        }\n      }\n    }\n  }\n\n  return deepMerge(target, ...sources);\n}\n\n/**\n * 判断是否为普通对象（非 null、非数组、非 Date 等）\n */\nfunction isObject(item: unknown): item is Record<string, unknown> {\n  return (\n    item !== null &&\n    typeof item === 'object' &&\n    !Array.isArray(item) &&\n    !(item instanceof Date) &&\n    !(item instanceof RegExp) &&\n    !(item instanceof Map) &&\n    !(item instanceof Set)\n  );\n}\n\n/**\n * 获取对象嵌套属性值\n * @param obj - 对象\n * @param path - 属性路径，如 'a.b.c' 或 ['a', 'b', 'c']\n * @param defaultValue - 默认值\n * @returns 属性值\n */\nexport function get<T = unknown>(\n  obj: Record<string, unknown>,\n  path: string | string[],\n  defaultValue?: T\n): T | undefined {\n  if (!obj || typeof obj !== 'object') {\n    return defaultValue;\n  }\n\n  const keys = Array.isArray(path) ? path : path.split('.');\n  if (keys.length === 0) {\n    return defaultValue;\n  }\n\n  let result: unknown = obj;\n\n  for (const key of keys) {\n    if (result == null || typeof result !== 'object' || Array.isArray(result)) {\n      return defaultValue;\n    }\n\n    // 使用类型断言访问属性\n    const record = result as Record<string, unknown>;\n    if (!(key in record)) {\n      return defaultValue;\n    }\n\n    result = record[key];\n  }\n\n  return result !== undefined ? (result as T) : defaultValue;\n}\n\n/**\n * 设置嵌套属性值\n * @param obj - 对象\n * @param path - 属性路径，如 'a.b.c' 或 ['a', 'b', 'c']\n * @param value - 要设置的值\n * @returns 设置后的新对象（不修改原对象）\n */\nexport function set<T extends Record<string, unknown>>(\n  obj: T,\n  path: string | string[],\n  value: unknown\n): T {\n  const keys = Array.isArray(path) ? path : path.split('.');\n  if (keys.length === 0) return obj;\n\n  const result = deepClone(obj);\n  let current: Record<string, unknown> = result;\n\n  for (let i = 0; i < keys.length - 1; i++) {\n    const key = keys[i];\n    if (!(key in current) || typeof current[key] !== 'object' || current[key] === null) {\n      current[key] = {};\n    }\n    current = current[key] as Record<string, unknown>;\n  }\n\n  current[keys[keys.length - 1]] = value;\n  return result;\n}\n\n/**\n * 选择指定属性\n * @param obj - 对象\n * @param keys - 要选择的属性键数组\n * @returns 包含指定属性的新对象\n */\nexport function pick<T extends Record<string, unknown>, K extends keyof T>(\n  obj: T,\n  keys: K[]\n): Pick<T, K> {\n  const result = {} as Pick<T, K>;\n  keys.forEach(key => {\n    if (key in obj) {\n      result[key] = obj[key];\n    }\n  });\n  return result;\n}\n\n/**\n * 排除指定属性\n * @param obj - 对象\n * @param keys - 要排除的属性键数组\n * @returns 排除指定属性后的新对象\n */\nexport function omit<T extends Record<string, unknown>, K extends keyof T>(\n  obj: T,\n  keys: K[]\n): Omit<T, K> {\n  const result = { ...obj };\n  keys.forEach(key => {\n    delete result[key];\n  });\n  return result;\n}\n\n/**\n * 获取所有键（支持深度）\n * @param obj - 对象\n * @param deep - 是否深度获取，默认为 false\n * @returns 键数组\n */\nexport function keys<T extends Record<string, unknown>>(obj: T, deep = false): string[] {\n  if (!deep) return Object.keys(obj);\n  const result: string[] = [];\n  const traverse = (current: Record<string, unknown>, prefix = ''): void => {\n    Object.keys(current).forEach(key => {\n      const fullKey = prefix ? `${prefix}.${key}` : key;\n      result.push(fullKey);\n      const value = current[key];\n      if (\n        value !== null &&\n        typeof value === 'object' &&\n        !Array.isArray(value) &&\n        !(value instanceof Date) &&\n        !(value instanceof RegExp)\n      ) {\n        traverse(value as Record<string, unknown>, fullKey);\n      }\n    });\n  };\n  traverse(obj);\n  return result;\n}\n\n/**\n * 获取所有值（支持深度）\n * @param obj - 对象\n * @param deep - 是否深度获取，默认为 false\n * @returns 值数组\n */\nexport function values<T extends Record<string, unknown>>(obj: T, deep = false): unknown[] {\n  if (!deep) return Object.values(obj);\n  const result: unknown[] = [];\n  const traverse = (current: Record<string, unknown>): void => {\n    Object.values(current).forEach(value => {\n      if (\n        value !== null &&\n        typeof value === 'object' &&\n        !Array.isArray(value) &&\n        !(value instanceof Date) &&\n        !(value instanceof RegExp)\n      ) {\n        traverse(value as Record<string, unknown>);\n      } else {\n        result.push(value);\n      }\n    });\n  };\n  traverse(obj);\n  return result;\n}\n\n/**\n * 键映射\n * @param obj - 对象\n * @param fn - 键转换函数\n * @returns 键映射后的新对象\n */\nexport function mapKeys<T extends Record<string, unknown>>(\n  obj: T,\n  fn: (key: string, value: unknown) => string\n): Record<string, unknown> {\n  const result: Record<string, unknown> = {};\n  Object.keys(obj).forEach(key => {\n    const newKey = fn(key, obj[key]);\n    result[newKey] = obj[key];\n  });\n  return result;\n}\n\n/**\n * 值映射\n * @param obj - 对象\n * @param fn - 值转换函数\n * @returns 值映射后的新对象\n */\nexport function mapValues<T extends Record<string, unknown>, R>(\n  obj: T,\n  fn: (value: unknown, key: string) => R\n): Record<string, R> {\n  const result: Record<string, R> = {};\n  Object.keys(obj).forEach(key => {\n    result[key] = fn(obj[key], key);\n  });\n  return result;\n}\n\n/**\n * 键值反转\n * @param obj - 对象\n * @returns 键值反转后的新对象\n */\nexport function invert<T extends Record<string, string | number>>(obj: T): Record<string, string> {\n  const result: Record<string, string> = {};\n  Object.keys(obj).forEach(key => {\n    result[String(obj[key])] = key;\n  });\n  return result;\n}\n\n/**\n * 设置默认值\n * @param obj - 对象\n * @param defaults - 默认值对象\n * @returns 合并默认值后的新对象\n */\nexport function defaults<T extends Record<string, unknown>>(\n  obj: Partial<T>,\n  ...defaults: Partial<T>[]\n): T {\n  const result = { ...obj } as T;\n  defaults.reverse().forEach(defaultObj => {\n    Object.keys(defaultObj).forEach(key => {\n      const typedKey = key as Extract<keyof T, string>;\n      if (!(typedKey in result) || result[typedKey] === undefined) {\n        result[typedKey] = defaultObj[typedKey] as T[Extract<keyof T, string>];\n      }\n    });\n  });\n  return result;\n}\n\n/**\n * 判断对象是否为空\n * @param obj - 对象\n * @returns 是否为空\n */\nexport function isEmptyObject(obj: Record<string, unknown>): boolean {\n  return Object.keys(obj).length === 0;\n}\n\n/**\n * 深度比较两个对象\n * @param obj1 - 第一个对象\n * @param obj2 - 第二个对象\n * @returns 是否相等\n */\nexport function isEqual<T>(obj1: T, obj2: T): boolean {\n  if (obj1 === obj2) return true;\n  if (obj1 === null || obj2 === null) return false;\n  if (typeof obj1 !== 'object' || typeof obj2 !== 'object') return false;\n\n  if (obj1 instanceof Date && obj2 instanceof Date) {\n    return obj1.getTime() === obj2.getTime();\n  }\n\n  if (Array.isArray(obj1) && Array.isArray(obj2)) {\n    if (obj1.length !== obj2.length) return false;\n    return obj1.every((item, index) => isEqual(item, obj2[index]));\n  }\n\n  if (Array.isArray(obj1) || Array.isArray(obj2)) return false;\n\n  const keys1 = Object.keys(obj1 as Record<string, unknown>);\n  const keys2 = Object.keys(obj2 as Record<string, unknown>);\n\n  if (keys1.length !== keys2.length) return false;\n\n  return keys1.every(key => {\n    const val1 = (obj1 as Record<string, unknown>)[key];\n    const val2 = (obj2 as Record<string, unknown>)[key];\n    return isEqual(val1, val2);\n  });\n}\n\n/**\n * 对象转换\n * @param obj - 对象\n * @param iteratee - 转换函数\n * @param accumulator - 累加器，默认为空对象\n * @returns 转换后的对象\n */\nexport function transform<T extends Record<string, unknown>, R extends Record<string, unknown>>(\n  obj: T,\n  iteratee: (result: R, value: unknown, key: string) => void,\n  accumulator: R = {} as R\n): R {\n  Object.keys(obj).forEach(key => {\n    iteratee(accumulator, obj[key], key);\n  });\n  return accumulator;\n}\n\n/**\n * 条件选择属性\n * @param obj - 对象\n * @param predicate - 条件函数\n * @returns 满足条件的属性组成的新对象\n */\nexport function pickBy<T extends Record<string, unknown>>(\n  obj: T,\n  predicate: (value: unknown, key: string) => boolean\n): Partial<T> {\n  const result: Partial<T> = {};\n  Object.keys(obj).forEach(key => {\n    const typedKey = key as keyof T;\n    if (predicate(obj[typedKey], key)) {\n      result[typedKey] = obj[typedKey];\n    }\n  });\n  return result;\n}\n\n/**\n * 条件排除属性\n * @param obj - 对象\n * @param predicate - 条件函数\n * @returns 不满足条件的属性组成的新对象\n */\nexport function omitBy<T extends Record<string, unknown>>(\n  obj: T,\n  predicate: (value: unknown, key: string) => boolean\n): Partial<T> {\n  const result: Partial<T> = {};\n  Object.keys(obj).forEach(key => {\n    const typedKey = key as keyof T;\n    if (!predicate(obj[typedKey], key)) {\n      result[typedKey] = obj[typedKey];\n    }\n  });\n  return result;\n}\n"]}

package/dist/chunk-JHZ7M2MR.mjs

@@ -0,0 +1,133 @@
+// src/data/algorithm.ts
+function binarySearch(array, target, compareFn) {
+  let left = 0;
+  let right = array.length - 1;
+  const compare = compareFn || ((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  while (left <= right) {
+    const mid = Math.floor((left + right) / 2);
+    const comparison = compare(array[mid], target);
+    if (comparison === 0) {
+      return mid;
+    } else if (comparison < 0) {
+      left = mid + 1;
+    } else {
+      right = mid - 1;
+    }
+  }
+  return -1;
+}
+function quickSort(array, compareFn) {
+  if (array.length <= 1) {
+    return [...array];
+  }
+  const compare = compareFn || ((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  const pivot = array[Math.floor(array.length / 2)];
+  const left = [];
+  const right = [];
+  const equal = [];
+  for (const item of array) {
+    const comparison = compare(item, pivot);
+    if (comparison < 0) {
+      left.push(item);
+    } else if (comparison > 0) {
+      right.push(item);
+    } else {
+      equal.push(item);
+    }
+  }
+  return [...quickSort(left, compareFn), ...equal, ...quickSort(right, compareFn)];
+}
+function mergeSort(array, compareFn) {
+  if (array.length <= 1) {
+    return [...array];
+  }
+  const compare = compareFn || ((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  const mid = Math.floor(array.length / 2);
+  const left = mergeSort(array.slice(0, mid), compareFn);
+  const right = mergeSort(array.slice(mid), compareFn);
+  return merge(left, right, compare);
+}
+function merge(left, right, compareFn) {
+  const result = [];
+  let i = 0;
+  let j = 0;
+  while (i < left.length && j < right.length) {
+    if (compareFn(left[i], right[j]) <= 0) {
+      result.push(left[i]);
+      i++;
+    } else {
+      result.push(right[j]);
+      j++;
+    }
+  }
+  return result.concat(left.slice(i)).concat(right.slice(j));
+}
+function bubbleSort(array, compareFn) {
+  const result = [...array];
+  const compare = compareFn || ((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  const n = result.length;
+  for (let i = 0; i < n - 1; i++) {
+    let swapped = false;
+    for (let j = 0; j < n - i - 1; j++) {
+      if (compare(result[j], result[j + 1]) > 0) {
+        [result[j], result[j + 1]] = [result[j + 1], result[j]];
+        swapped = true;
+      }
+    }
+    if (!swapped) {
+      break;
+    }
+  }
+  return result;
+}
+function fibonacci(n) {
+  if (n < 0) {
+    throw new Error("n must be non-negative");
+  }
+  if (n === 0) return 0;
+  if (n === 1) return 1;
+  let a = 0;
+  let b = 1;
+  for (let i = 2; i <= n; i++) {
+    [a, b] = [b, a + b];
+  }
+  return b;
+}
+function fibonacciSequence(n) {
+  if (n <= 0) return [];
+  if (n === 1) return [0];
+  if (n === 2) return [0, 1];
+  const sequence = [0, 1];
+  for (let i = 2; i < n; i++) {
+    sequence.push(sequence[i - 1] + sequence[i - 2]);
+  }
+  return sequence;
+}
+function factorial(n) {
+  if (n < 0) {
+    throw new Error("n must be non-negative");
+  }
+  if (n === 0 || n === 1) {
+    return 1;
+  }
+  let result = 1;
+  for (let i = 2; i <= n; i++) {
+    result *= i;
+  }
+  return result;
+}
+function gcd(a, b) {
+  a = Math.abs(a);
+  b = Math.abs(b);
+  while (b !== 0) {
+    [a, b] = [b, a % b];
+  }
+  return a;
+}
+function lcm(a, b) {
+  return Math.abs(a * b) / gcd(a, b);
+}
+
+export { binarySearch, bubbleSort, factorial, fibonacci, fibonacciSequence, gcd, lcm, mergeSort, quickSort };
+//# sourceMappingURL=chunk-JHZ7M2MR.mjs.map
+//# sourceMappingURL=chunk-JHZ7M2MR.mjs.map

package/dist/chunk-JHZ7M2MR.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/data/algorithm.ts"],"names":[],"mappings":";AAWO,SAAS,YAAA,CAAgB,KAAA,EAAY,MAAA,EAAW,SAAA,EAA4C;AACjG,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,KAAA,GAAQ,MAAM,MAAA,GAAS,CAAA;AAE3B,EAAA,MAAM,OAAA,GAAU,SAAA,KAAc,CAAC,CAAA,EAAM,CAAA,KAAU,IAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAA;AAExE,EAAA,OAAO,QAAQ,KAAA,EAAO;AACpB,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAA,CAAO,IAAA,GAAO,SAAS,CAAC,CAAA;AACzC,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,KAAA,CAAM,GAAG,GAAG,MAAM,CAAA;AAE7C,IAAA,IAAI,eAAe,CAAA,EAAG;AACpB,MAAA,OAAO,GAAA;AAAA,IACT,CAAA,MAAA,IAAW,aAAa,CAAA,EAAG;AACzB,MAAA,IAAA,GAAO,GAAA,GAAM,CAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,KAAA,GAAQ,GAAA,GAAM,CAAA;AAAA,IAChB;AAAA,EACF;AAEA,EAAA,OAAO,EAAA;AACT;AAQO,SAAS,SAAA,CAAa,OAAY,SAAA,EAAyC;AAChF,EAAA,IAAI,KAAA,CAAM,UAAU,CAAA,EAAG;AACrB,IAAA,OAAO,CAAC,GAAG,KAAK,CAAA;AAAA,EAClB;AAEA,EAAA,MAAM,OAAA,GAAU,SAAA,KAAc,CAAC,CAAA,EAAM,CAAA,KAAU,IAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAA;AACxE,EAAA,MAAM,QAAQ,KAAA,CAAM,IAAA,CAAK,MAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAC,CAAA;AAChD,EAAA,MAAM,OAAY,EAAC;AACnB,EAAA,MAAM,QAAa,EAAC;AACpB,EAAA,MAAM,QAAa,EAAC;AAEpB,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAA;AACtC,IAAA,IAAI,aAAa,CAAA,EAAG;AAClB,MAAA,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,IAChB,CAAA,MAAA,IAAW,aAAa,CAAA,EAAG;AACzB,MAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,IACjB,CAAA,MAAO;AACL,MAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,IACjB;AAAA,EACF;AAEA,EAAA,OAAO,CAAC,GAAG,SAAA,CAAU,IAAA,EAAM,SAAS,CAAA,EAAG,GAAG,KAAA,EAAO,GAAG,SAAA,CAAU,KAAA,EAAO,SAAS,CAAC,CAAA;AACjF;AAQO,SAAS,SAAA,CAAa,OAAY,SAAA,EAAyC;AAChF,EAAA,IAAI,KAAA,CAAM,UAAU,CAAA,EAAG;AACrB,IAAA,OAAO,CAAC,GAAG,KAAK,CAAA;AAAA,EAClB;AAEA,EAAA,MAAM,OAAA,GAAU,SAAA,KAAc,CAAC,CAAA,EAAM,CAAA,KAAU,IAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAA;AACxE,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,SAAS,CAAC,CAAA;AACvC,EAAA,MAAM,OAAO,SAAA,CAAU,KAAA,CAAM,MAAM,CAAA,EAAG,GAAG,GAAG,SAAS,CAAA;AACrD,EAAA,MAAM,QAAQ,SAAA,CAAU,KAAA,CAAM,KAAA,CAAM,GAAG,GAAG,SAAS,CAAA;AAEnD,EAAA,OAAO,KAAA,CAAM,IAAA,EAAM,KAAA,EAAO,OAAO,CAAA;AACnC;AAKA,SAAS,KAAA,CAAS,IAAA,EAAW,KAAA,EAAY,SAAA,EAAwC;AAC/E,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,IAAI,CAAA,GAAI,CAAA;AAER,EAAA,OAAO,CAAA,GAAI,IAAA,CAAK,MAAA,IAAU,CAAA,GAAI,MAAM,MAAA,EAAQ;AAC1C,IAAA,IAAI,SAAA,CAAU,KAAK,CAAC,CAAA,EAAG,MAAM,CAAC,CAAC,KAAK,CAAA,EAAG;AACrC,MAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AACnB,MAAA,CAAA,EAAA;AAAA,IACF,CAAA,MAAO;AACL,MAAA,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AACpB,MAAA,CAAA,EAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA,CAAE,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,CAAC,CAAC,CAAA;AAC3D;AAQO,SAAS,UAAA,CAAc,OAAY,SAAA,EAAyC;AACjF,EAAA,MAAM,MAAA,GAAS,CAAC,GAAG,KAAK,CAAA;AACxB,EAAA,MAAM,OAAA,GAAU,SAAA,KAAc,CAAC,CAAA,EAAM,CAAA,KAAU,IAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAA;AACxE,EAAA,MAAM,IAAI,MAAA,CAAO,MAAA;AAEjB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,GAAG,CAAA,EAAA,EAAK;AAC9B,IAAA,IAAI,OAAA,GAAU,KAAA;AAEd,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,GAAG,CAAA,EAAA,EAAK;AAClC,MAAA,IAAI,OAAA,CAAQ,OAAO,CAAC,CAAA,EAAG,OAAO,CAAA,GAAI,CAAC,CAAC,CAAA,GAAI,CAAA,EAAG;AACzC,QAAA,CAAC,MAAA,CAAO,CAAC,CAAA,EAAG,MAAA,CAAO,IAAI,CAAC,CAAC,CAAA,GAAI,CAAC,OAAO,CAAA,GAAI,CAAC,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA;AACtD,QAAA,OAAA,GAAU,IAAA;AAAA,MACZ;AAAA,IACF;AAGA,IAAA,IAAI,CAAC,OAAA,EAAS;AACZ,MAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAOO,SAAS,UAAU,CAAA,EAAmB;AAC3C,EAAA,IAAI,IAAI,CAAA,EAAG;AACT,IAAA,MAAM,IAAI,MAAM,wBAAwB,CAAA;AAAA,EAC1C;AAEA,EAAA,IAAI,CAAA,KAAM,GAAG,OAAO,CAAA;AACpB,EAAA,IAAI,CAAA,KAAM,GAAG,OAAO,CAAA;AAGpB,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,IAAI,CAAA,GAAI,CAAA;AAER,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AAC3B,IAAA,CAAC,GAAG,CAAC,CAAA,GAAI,CAAC,CAAA,EAAG,IAAI,CAAC,CAAA;AAAA,EACpB;AAEA,EAAA,OAAO,CAAA;AACT;AAOO,SAAS,kBAAkB,CAAA,EAAqB;AACrD,EAAA,IAAI,CAAA,IAAK,CAAA,EAAG,OAAO,EAAC;AACpB,EAAA,IAAI,CAAA,KAAM,CAAA,EAAG,OAAO,CAAC,CAAC,CAAA;AACtB,EAAA,IAAI,CAAA,KAAM,CAAA,EAAG,OAAO,CAAC,GAAG,CAAC,CAAA;AAEzB,EAAA,MAAM,QAAA,GAAW,CAAC,CAAA,EAAG,CAAC,CAAA;AACtB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,IAAA,QAAA,CAAS,IAAA,CAAK,SAAS,CAAA,GAAI,CAAC,IAAI,QAAA,CAAS,CAAA,GAAI,CAAC,CAAC,CAAA;AAAA,EACjD;AAEA,EAAA,OAAO,QAAA;AACT;AAOO,SAAS,UAAU,CAAA,EAAmB;AAC3C,EAAA,IAAI,IAAI,CAAA,EAAG;AACT,IAAA,MAAM,IAAI,MAAM,wBAAwB,CAAA;AAAA,EAC1C;AAEA,EAAA,IAAI,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,CAAA,EAAG;AACtB,IAAA,OAAO,CAAA;AAAA,EACT;AAEA,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AAC3B,IAAA,MAAA,IAAU,CAAA;AAAA,EACZ;AAEA,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,GAAA,CAAI,GAAW,CAAA,EAAmB;AAChD,EAAA,CAAA,GAAI,IAAA,CAAK,IAAI,CAAC,CAAA;AACd,EAAA,CAAA,GAAI,IAAA,CAAK,IAAI,CAAC,CAAA;AAEd,EAAA,OAAO,MAAM,CAAA,EAAG;AACd,IAAA,CAAC,GAAG,CAAC,CAAA,GAAI,CAAC,CAAA,EAAG,IAAI,CAAC,CAAA;AAAA,EACpB;AAEA,EAAA,OAAO,CAAA;AACT;AAQO,SAAS,GAAA,CAAI,GAAW,CAAA,EAAmB;AAChD,EAAA,OAAO,KAAK,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,GAAI,GAAA,CAAI,GAAG,CAAC,CAAA;AACnC","file":"chunk-JHZ7M2MR.mjs","sourcesContent":["/**\n * 算法工具函数\n */\n\n/**\n * 二分查找\n * @param array - 已排序的数组\n * @param target - 目标值\n * @param compareFn - 比较函数（可选）\n * @returns 目标值的索引，如果未找到返回 -1\n */\nexport function binarySearch<T>(array: T[], target: T, compareFn?: (a: T, b: T) => number): number {\n  let left = 0;\n  let right = array.length - 1;\n\n  const compare = compareFn || ((a: T, b: T) => (a < b ? -1 : a > b ? 1 : 0));\n\n  while (left <= right) {\n    const mid = Math.floor((left + right) / 2);\n    const comparison = compare(array[mid], target);\n\n    if (comparison === 0) {\n      return mid;\n    } else if (comparison < 0) {\n      left = mid + 1;\n    } else {\n      right = mid - 1;\n    }\n  }\n\n  return -1;\n}\n\n/**\n * 快速排序\n * @param array - 要排序的数组\n * @param compareFn - 比较函数（可选）\n * @returns 排序后的新数组\n */\nexport function quickSort<T>(array: T[], compareFn?: (a: T, b: T) => number): T[] {\n  if (array.length <= 1) {\n    return [...array];\n  }\n\n  const compare = compareFn || ((a: T, b: T) => (a < b ? -1 : a > b ? 1 : 0));\n  const pivot = array[Math.floor(array.length / 2)];\n  const left: T[] = [];\n  const right: T[] = [];\n  const equal: T[] = [];\n\n  for (const item of array) {\n    const comparison = compare(item, pivot);\n    if (comparison < 0) {\n      left.push(item);\n    } else if (comparison > 0) {\n      right.push(item);\n    } else {\n      equal.push(item);\n    }\n  }\n\n  return [...quickSort(left, compareFn), ...equal, ...quickSort(right, compareFn)];\n}\n\n/**\n * 归并排序\n * @param array - 要排序的数组\n * @param compareFn - 比较函数（可选）\n * @returns 排序后的新数组\n */\nexport function mergeSort<T>(array: T[], compareFn?: (a: T, b: T) => number): T[] {\n  if (array.length <= 1) {\n    return [...array];\n  }\n\n  const compare = compareFn || ((a: T, b: T) => (a < b ? -1 : a > b ? 1 : 0));\n  const mid = Math.floor(array.length / 2);\n  const left = mergeSort(array.slice(0, mid), compareFn);\n  const right = mergeSort(array.slice(mid), compareFn);\n\n  return merge(left, right, compare);\n}\n\n/**\n * 合并两个已排序的数组\n */\nfunction merge<T>(left: T[], right: T[], compareFn: (a: T, b: T) => number): T[] {\n  const result: T[] = [];\n  let i = 0;\n  let j = 0;\n\n  while (i < left.length && j < right.length) {\n    if (compareFn(left[i], right[j]) <= 0) {\n      result.push(left[i]);\n      i++;\n    } else {\n      result.push(right[j]);\n      j++;\n    }\n  }\n\n  return result.concat(left.slice(i)).concat(right.slice(j));\n}\n\n/**\n * 冒泡排序\n * @param array - 要排序的数组\n * @param compareFn - 比较函数（可选）\n * @returns 排序后的新数组\n */\nexport function bubbleSort<T>(array: T[], compareFn?: (a: T, b: T) => number): T[] {\n  const result = [...array];\n  const compare = compareFn || ((a: T, b: T) => (a < b ? -1 : a > b ? 1 : 0));\n  const n = result.length;\n\n  for (let i = 0; i < n - 1; i++) {\n    let swapped = false;\n\n    for (let j = 0; j < n - i - 1; j++) {\n      if (compare(result[j], result[j + 1]) > 0) {\n        [result[j], result[j + 1]] = [result[j + 1], result[j]];\n        swapped = true;\n      }\n    }\n\n    // 如果没有交换，说明已经排序完成\n    if (!swapped) {\n      break;\n    }\n  }\n\n  return result;\n}\n\n/**\n * 计算斐波那契数列的第n项\n * @param n - 位置（从0开始）\n * @returns 斐波那契数\n */\nexport function fibonacci(n: number): number {\n  if (n < 0) {\n    throw new Error('n must be non-negative');\n  }\n\n  if (n === 0) return 0;\n  if (n === 1) return 1;\n\n  // 使用动态规划优化\n  let a = 0;\n  let b = 1;\n\n  for (let i = 2; i <= n; i++) {\n    [a, b] = [b, a + b];\n  }\n\n  return b;\n}\n\n/**\n * 计算斐波那契数列（返回前n项）\n * @param n - 项数\n * @returns 斐波那契数列数组\n */\nexport function fibonacciSequence(n: number): number[] {\n  if (n <= 0) return [];\n  if (n === 1) return [0];\n  if (n === 2) return [0, 1];\n\n  const sequence = [0, 1];\n  for (let i = 2; i < n; i++) {\n    sequence.push(sequence[i - 1] + sequence[i - 2]);\n  }\n\n  return sequence;\n}\n\n/**\n * 计算阶乘\n * @param n - 非负整数\n * @returns 阶乘结果\n */\nexport function factorial(n: number): number {\n  if (n < 0) {\n    throw new Error('n must be non-negative');\n  }\n\n  if (n === 0 || n === 1) {\n    return 1;\n  }\n\n  let result = 1;\n  for (let i = 2; i <= n; i++) {\n    result *= i;\n  }\n\n  return result;\n}\n\n/**\n * 计算最大公约数（GCD）\n * @param a - 第一个数\n * @param b - 第二个数\n * @returns 最大公约数\n */\nexport function gcd(a: number, b: number): number {\n  a = Math.abs(a);\n  b = Math.abs(b);\n\n  while (b !== 0) {\n    [a, b] = [b, a % b];\n  }\n\n  return a;\n}\n\n/**\n * 计算最小公倍数（LCM）\n * @param a - 第一个数\n * @param b - 第二个数\n * @returns 最小公倍数\n */\nexport function lcm(a: number, b: number): number {\n  return Math.abs(a * b) / gcd(a, b);\n}\n"]}