@composy/store-core 0.0.1

package/lib/utils/deep-clone.cjs

@@ -0,0 +1,202 @@
+/*!
+* ***********************************
+* @composy/store-core v0.0.1      *
+* Built with rollup               *
+* Build time: 2024-08-17 11:27:33 *
+* Build mode: production          *
+* Minified: No                    *
+* ***********************************
+*/
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+//#region src/utils/deep-clone.ts
+const hasOwnProperty = Object.prototype.hasOwnProperty;
+function hasOwnKey(value, key) {
+	return hasOwnProperty.call(value, key);
+}
+function isObject(value) {
+	return value !== null && typeof value === "object";
+}
+function isPlainObject(value) {
+	if (!isObject(value)) return false;
+	const proto = Object.getPrototypeOf(value);
+	return proto === null || proto === Object.prototype;
+}
+function isStructuredCloneable(value) {
+	if (value === null || value === void 0) return true;
+	if (typeof value === "boolean" || typeof value === "number" || typeof value === "string") return true;
+	if (typeof value === "bigint") return true;
+	if (typeof value === "function" || typeof value === "symbol") return false;
+	if (value instanceof Date || value instanceof RegExp) return true;
+	if (value instanceof ArrayBuffer || value instanceof DataView) return true;
+	if (value instanceof Map || value instanceof Set) return true;
+	if (ArrayBuffer.isView(value)) return true;
+	if (Array.isArray(value)) return value.every((item) => isStructuredCloneable(item));
+	if (isPlainObject(value)) return Object.values(value).every((v) => isStructuredCloneable(v));
+	return false;
+}
+function deepClone(value, options = {}) {
+	const { useStructuredClone: preferStructuredClone = true, cloneFunctions = false, cloneSymbols = false, maxDepth = Infinity, customCloner } = options;
+	if (preferStructuredClone && typeof structuredClone === "function" && isStructuredCloneable(value)) try {
+		return structuredClone(value);
+	} catch {}
+	const cache = /* @__PURE__ */ new WeakMap();
+	function cloneInternal(val, depth) {
+		if (val === null || val === void 0) return val;
+		if (typeof val === "boolean" || typeof val === "number" || typeof val === "string") return val;
+		if (typeof val === "bigint") return val;
+		if (typeof val === "symbol") return cloneSymbols ? Symbol(val.description) : val;
+		if (typeof val === "function") return cloneFunctions ? val.bind({}) : val;
+		if (depth > maxDepth) return val;
+		if (customCloner) {
+			const customResult = customCloner(val, (v) => cloneInternal(v, depth + 1));
+			if (customResult !== void 0) return customResult;
+		}
+		if (typeof val === "object" && val !== null) {
+			if (cache.has(val)) return cache.get(val);
+		}
+		if (val instanceof Date) return new Date(val.getTime());
+		if (val instanceof RegExp) {
+			const result = new RegExp(val.source, val.flags);
+			result.lastIndex = val.lastIndex;
+			return result;
+		}
+		if (val instanceof Error) {
+			const result = new val.constructor(val.message);
+			result.stack = val.stack;
+			result.name = val.name;
+			return result;
+		}
+		if (val instanceof Map) {
+			const result = /* @__PURE__ */ new Map();
+			cache.set(val, result);
+			val.forEach((v, k) => {
+				result.set(cloneInternal(k, depth + 1), cloneInternal(v, depth + 1));
+			});
+			return result;
+		}
+		if (val instanceof Set) {
+			const result = /* @__PURE__ */ new Set();
+			cache.set(val, result);
+			val.forEach((v) => {
+				result.add(cloneInternal(v, depth + 1));
+			});
+			return result;
+		}
+		if (val instanceof ArrayBuffer) return val.slice(0);
+		if (ArrayBuffer.isView(val) && !(val instanceof DataView)) {
+			const TypedArrayConstructor = val.constructor;
+			return new TypedArrayConstructor(val.buffer.slice(0));
+		}
+		if (Array.isArray(val)) {
+			const result = [];
+			cache.set(val, result);
+			for (let i = 0; i < val.length; i++) result[i] = cloneInternal(val[i], depth + 1);
+			return result;
+		}
+		if (isPlainObject(val)) {
+			const result = {};
+			cache.set(val, result);
+			const keys = Object.keys(val);
+			for (const key of keys) result[key] = cloneInternal(val[key], depth + 1);
+			if (cloneSymbols) {
+				const symbolKeys = Object.getOwnPropertySymbols(val);
+				for (const sym of symbolKeys) result[sym] = cloneInternal(val[sym], depth + 1);
+			}
+			return result;
+		}
+		return val;
+	}
+	return cloneInternal(value, 0);
+}
+function shallowClone(value) {
+	if (value === null || value === void 0) return value;
+	if (typeof value !== "object") return value;
+	if (Array.isArray(value)) return [...value];
+	if (value instanceof Map) return new Map(value);
+	if (value instanceof Set) return new Set(value);
+	if (value instanceof Date) return new Date(value.getTime());
+	return { ...value };
+}
+function deepMerge(target, ...sources) {
+	return deepMergeWithOptions(target, {}, ...sources);
+}
+function deepMergeWithOptions(target, options, ...sources) {
+	const { arrayStrategy = "replace", clone = true, maxDepth = Infinity } = options;
+	function mergeInternal(targetObj, sourceObj, depth) {
+		if (depth > maxDepth) return targetObj;
+		for (const key of Object.keys(sourceObj)) {
+			const sourceValue = sourceObj[key];
+			const targetValue = targetObj[key];
+			if (Array.isArray(sourceValue)) if (arrayStrategy === "concat" && Array.isArray(targetValue)) targetObj[key] = [...targetValue, ...sourceValue];
+			else if (arrayStrategy === "merge" && Array.isArray(targetValue)) {
+				const result2 = [...targetValue];
+				sourceValue.forEach((item, index) => {
+					if (isPlainObject(item) && isPlainObject(result2[index])) result2[index] = mergeInternal(result2[index], item, depth + 1);
+					else result2[index] = clone ? deepClone(item) : item;
+				});
+				targetObj[key] = result2;
+			} else targetObj[key] = clone ? deepClone(sourceValue) : sourceValue;
+			else if (isPlainObject(sourceValue)) if (isPlainObject(targetValue)) targetObj[key] = mergeInternal(targetValue, sourceValue, depth + 1);
+			else targetObj[key] = clone ? deepClone(sourceValue) : sourceValue;
+			else targetObj[key] = clone && isObject(sourceValue) ? deepClone(sourceValue) : sourceValue;
+		}
+		return targetObj;
+	}
+	let result = target;
+	for (const source of sources) if (source !== null && source !== void 0) result = mergeInternal(result, source, 0);
+	return result;
+}
+function deepEqual(a, b) {
+	if (a === b) return true;
+	if (a === null || b === null || a === void 0 || b === void 0) return a === b;
+	if (typeof a !== typeof b) return false;
+	if (typeof a !== "object") return a === b;
+	if (a instanceof Date && b instanceof Date) return a.getTime() === b.getTime();
+	if (a instanceof RegExp && b instanceof RegExp) return a.source === b.source && a.flags === b.flags;
+	if (a instanceof Map && b instanceof Map) {
+		if (a.size !== b.size) return false;
+		for (const [key, value] of a) if (!b.has(key) || !deepEqual(value, b.get(key))) return false;
+		return true;
+	}
+	if (a instanceof Set && b instanceof Set) {
+		if (a.size !== b.size) return false;
+		for (const value of a) if (!b.has(value)) return false;
+		return true;
+	}
+	if (Array.isArray(a) && Array.isArray(b)) {
+		if (a.length !== b.length) return false;
+		for (let i = 0; i < a.length; i++) if (!deepEqual(a[i], b[i])) return false;
+		return true;
+	}
+	if (isPlainObject(a) && isPlainObject(b)) {
+		const keysA = Object.keys(a);
+		const keysB = Object.keys(b);
+		if (keysA.length !== keysB.length) return false;
+		for (const key of keysA) {
+			if (!hasOwnKey(b, key)) return false;
+			if (!deepEqual(a[key], b[key])) return false;
+		}
+		return true;
+	}
+	return false;
+}
+function deepFreeze(obj) {
+	const propNames = Object.getOwnPropertyNames(obj);
+	for (const name of propNames) {
+		const value = obj[name];
+		if (value && typeof value === "object") deepFreeze(value);
+	}
+	return Object.freeze(obj);
+}
+//#endregion
+exports.deepClone = deepClone;
+exports.deepEqual = deepEqual;
+exports.deepFreeze = deepFreeze;
+exports.deepMerge = deepMerge;
+exports.deepMergeWithOptions = deepMergeWithOptions;
+exports.isObject = isObject;
+exports.isPlainObject = isPlainObject;
+exports.shallowClone = shallowClone;
+/*! End of @composy/store-core | Powered by @composy/builder */
+//# sourceMappingURL=deep-clone.cjs.map

package/lib/utils/deep-clone.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"deep-clone.cjs","names":["result"],"sources":["../../src/utils/deep-clone.ts"],"sourcesContent":["/**\n * 深拷贝工具\n *\n * 提供高性能的深拷贝、浅拷贝和深度合并功能\n * @module utils/deep-clone\n */\n\nconst hasOwnProperty = Object.prototype.hasOwnProperty\n\nfunction hasOwnKey(value: object, key: PropertyKey): boolean {\n  return hasOwnProperty.call(value, key)\n}\n\n/**\n * 判断是否为对象\n *\n * @param value - 待检查的值\n * @returns 是否为对象\n */\nexport function isObject(value: unknown): value is Record<string, unknown> {\n  return value !== null && typeof value === 'object'\n}\n\n/**\n * 判断是否为普通对象（非数组、非内置对象）\n *\n * @param value - 待检查的值\n * @returns 是否为普通对象\n */\nexport function isPlainObject(value: unknown): value is Record<string, unknown> {\n  if (!isObject(value)) return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === null || proto === Object.prototype\n}\n\n/**\n * 判断值是否可以被 structuredClone 处理\n *\n * @param value - 待检查的值\n * @returns 是否可以使用 structuredClone\n */\nfunction isStructuredCloneable(value: unknown): boolean {\n  // 基础类型\n  if (value === null || value === undefined) return true\n  if (typeof value === 'boolean' || typeof value === 'number' || typeof value === 'string') return true\n  if (typeof value === 'bigint') return true\n\n  // 函数和 Symbol 不可克隆\n  if (typeof value === 'function' || typeof value === 'symbol') return false\n\n  // 内置可克隆对象\n  if (value instanceof Date || value instanceof RegExp) return true\n  if (value instanceof ArrayBuffer || value instanceof DataView) return true\n  if (value instanceof Map || value instanceof Set) return true\n  if (ArrayBuffer.isView(value)) return true\n\n  // 普通对象和数组递归检查\n  if (Array.isArray(value)) {\n    return value.every(item => isStructuredCloneable(item))\n  }\n\n  if (isPlainObject(value)) {\n    return Object.values(value).every(v => isStructuredCloneable(v))\n  }\n\n  return false\n}\n\n/**\n * 深拷贝配置选项\n */\nexport interface DeepCloneOptions {\n  /** 是否优先使用 structuredClone（默认 true） */\n  useStructuredClone?: boolean\n  /** 是否克隆函数（默认 false，函数保持引用） */\n  cloneFunctions?: boolean\n  /** 是否克隆 Symbol 属性（默认 false） */\n  cloneSymbols?: boolean\n  /** 最大深度（默认无限制） */\n  maxDepth?: number\n  /** 自定义克隆器 */\n  customCloner?: <T>(value: T, clone: <U>(v: U) => U) => T | undefined\n}\n\n/**\n * 深拷贝\n *\n * 高性能深拷贝实现，优先使用原生 structuredClone（如果可用）\n *\n * @template T - 值类型\n * @param value - 要拷贝的值\n * @param options - 配置选项\n * @returns 拷贝后的值\n *\n * @example\n * ```typescript\n * const obj = { a: 1, b: { c: 2 } }\n * const cloned = deepClone(obj)\n * cloned.b.c = 3\n * console.log(obj.b.c) // 2\n * ```\n *\n * @example\n * ```typescript\n * // 带配置的深拷贝\n * const cloned = deepClone(obj, {\n *   maxDepth: 5,\n *   cloneSymbols: true\n * })\n * ```\n */\nexport function deepClone<T>(value: T, options: DeepCloneOptions = {}): T {\n  const {\n    useStructuredClone: preferStructuredClone = true,\n    cloneFunctions = false,\n    cloneSymbols = false,\n    maxDepth = Infinity,\n    customCloner,\n  } = options\n\n  // 尝试使用 structuredClone（性能更好）\n  if (preferStructuredClone && typeof structuredClone === 'function' && isStructuredCloneable(value)) {\n    try {\n      return structuredClone(value)\n    }\n    catch {\n      // structuredClone 失败，回退到手动实现\n    }\n  }\n\n  const cache = new WeakMap<object, unknown>()\n\n  function cloneInternal<U>(val: U, depth: number): U {\n    // 基础类型直接返回\n    if (val === null || val === undefined) return val\n    if (typeof val === 'boolean' || typeof val === 'number' || typeof val === 'string') return val\n    if (typeof val === 'bigint') return val\n\n    // Symbol 处理\n    if (typeof val === 'symbol') {\n      return cloneSymbols ? Symbol(val.description) as U : val\n    }\n\n    // 函数处理\n    if (typeof val === 'function') {\n      return cloneFunctions ? (val.bind({}) as U) : val\n    }\n\n    // 深度检查\n    if (depth > maxDepth) {\n      return val\n    }\n\n    // 自定义克隆器\n    if (customCloner) {\n      const customResult = customCloner(val, v => cloneInternal(v, depth + 1))\n      if (customResult !== undefined) {\n        return customResult\n      }\n    }\n\n    // 检查循环引用\n    if (typeof val === 'object' && val !== null) {\n      if (cache.has(val)) {\n        return cache.get(val) as U\n      }\n    }\n\n    // 处理日期\n    if (val instanceof Date) {\n      return new Date(val.getTime()) as U\n    }\n\n    // 处理正则\n    if (val instanceof RegExp) {\n      const result = new RegExp(val.source, val.flags)\n      ;(result as RegExp).lastIndex = val.lastIndex\n      return result as U\n    }\n\n    // 处理 Error\n    if (val instanceof Error) {\n      const result = new (val.constructor as ErrorConstructor)(val.message)\n      result.stack = val.stack\n      result.name = val.name\n      return result as U\n    }\n\n    // 处理 Map\n    if (val instanceof Map) {\n      const result = new Map()\n      cache.set(val, result)\n      val.forEach((v, k) => {\n        result.set(cloneInternal(k, depth + 1), cloneInternal(v, depth + 1))\n      })\n      return result as U\n    }\n\n    // 处理 Set\n    if (val instanceof Set) {\n      const result = new Set()\n      cache.set(val, result)\n      val.forEach((v) => {\n        result.add(cloneInternal(v, depth + 1))\n      })\n      return result as U\n    }\n\n    // 处理 ArrayBuffer\n    if (val instanceof ArrayBuffer) {\n      return val.slice(0) as U\n    }\n\n    // 处理 TypedArray\n    if (ArrayBuffer.isView(val) && !(val instanceof DataView)) {\n      const TypedArrayConstructor = val.constructor as new (buffer: ArrayBuffer) => typeof val\n      return new TypedArrayConstructor((val as unknown as { buffer: ArrayBuffer }).buffer.slice(0)) as U\n    }\n\n    // 处理数组\n    if (Array.isArray(val)) {\n      const result: unknown[] = []\n      cache.set(val, result)\n      for (let i = 0; i < val.length; i++) {\n        result[i] = cloneInternal(val[i], depth + 1)\n      }\n      return result as U\n    }\n\n    // 处理普通对象\n    if (isPlainObject(val)) {\n      const result: Record<string | symbol, unknown> = {}\n      cache.set(val, result)\n\n      // 克隆字符串键\n      const keys = Object.keys(val)\n      for (const key of keys) {\n        result[key] = cloneInternal((val as Record<string, unknown>)[key], depth + 1)\n      }\n\n      // 克隆 Symbol 键\n      if (cloneSymbols) {\n        const symbolKeys = Object.getOwnPropertySymbols(val)\n        for (const sym of symbolKeys) {\n          result[sym] = cloneInternal((val as Record<symbol, unknown>)[sym], depth + 1)\n        }\n      }\n\n      return result as U\n    }\n\n    // 其他对象类型（如自定义类实例）直接返回\n    return val\n  }\n\n  return cloneInternal(value, 0)\n}\n\n/**\n * 浅拷贝\n *\n * @template T - 值类型\n * @param value - 要拷贝的值\n * @returns 拷贝后的值\n *\n * @example\n * ```typescript\n * const arr = [1, 2, { a: 3 }]\n * const cloned = shallowClone(arr)\n * cloned[2].a = 4\n * console.log(arr[2].a) // 4 (浅拷贝，嵌套对象共享引用)\n * ```\n */\nexport function shallowClone<T>(value: T): T {\n  if (value === null || value === undefined) return value\n  if (typeof value !== 'object') return value\n\n  if (Array.isArray(value)) {\n    return [...value] as T\n  }\n\n  if (value instanceof Map) {\n    return new Map(value) as T\n  }\n\n  if (value instanceof Set) {\n    return new Set(value) as T\n  }\n\n  if (value instanceof Date) {\n    return new Date(value.getTime()) as T\n  }\n\n  return { ...value }\n}\n\n/**\n * 深度合并配置选项\n */\nexport interface DeepMergeOptions {\n  /** 数组合并策略：'replace' 替换 | 'concat' 连接 | 'merge' 按索引合并 */\n  arrayStrategy?: 'replace' | 'concat' | 'merge'\n  /** 是否克隆源对象（默认 true） */\n  clone?: boolean\n  /** 最大深度 */\n  maxDepth?: number\n}\n\n/**\n * 深度合并对象\n *\n * 将多个源对象深度合并到目标对象\n *\n * @template T - 目标对象类型\n * @param target - 目标对象\n * @param sources - 源对象列表\n * @returns 合并后的对象\n *\n * @example\n * ```typescript\n * const target = { a: 1, b: { c: 2 } }\n * const source = { b: { d: 3 }, e: 4 }\n * const result = deepMerge(target, source)\n * // { a: 1, b: { c: 2, d: 3 }, e: 4 }\n * ```\n */\nexport function deepMerge<T extends Record<string, unknown>>(\n  target: T,\n  ...sources: Array<Partial<T>>\n): T {\n  return deepMergeWithOptions(target, {}, ...sources)\n}\n\n/**\n * 带配置的深度合并\n *\n * @template T - 目标对象类型\n * @param target - 目标对象\n * @param options - 合并配置\n * @param sources - 源对象列表\n * @returns 合并后的对象\n */\nexport function deepMergeWithOptions<T extends Record<string, unknown>>(\n  target: T,\n  options: DeepMergeOptions,\n  ...sources: Array<Partial<T>>\n): T {\n  const {\n    arrayStrategy = 'replace',\n    clone = true,\n    maxDepth = Infinity,\n  } = options\n\n  function mergeInternal(\n    targetObj: Record<string, unknown>,\n    sourceObj: Record<string, unknown>,\n    depth: number,\n  ): Record<string, unknown> {\n    if (depth > maxDepth) {\n      return targetObj\n    }\n\n    for (const key of Object.keys(sourceObj)) {\n      const sourceValue = sourceObj[key]\n      const targetValue = targetObj[key]\n\n      // 处理数组\n      if (Array.isArray(sourceValue)) {\n        if (arrayStrategy === 'concat' && Array.isArray(targetValue)) {\n          targetObj[key] = [...targetValue, ...sourceValue]\n        }\n        else if (arrayStrategy === 'merge' && Array.isArray(targetValue)) {\n          const result = [...targetValue]\n          sourceValue.forEach((item, index) => {\n            if (isPlainObject(item) && isPlainObject(result[index])) {\n              result[index] = mergeInternal(result[index] as Record<string, unknown>, item, depth + 1)\n            }\n            else {\n              result[index] = clone ? deepClone(item) : item\n            }\n          })\n          targetObj[key] = result\n        }\n        else {\n          targetObj[key] = clone ? deepClone(sourceValue) : sourceValue\n        }\n      }\n      // 处理普通对象\n      else if (isPlainObject(sourceValue)) {\n        if (isPlainObject(targetValue)) {\n          targetObj[key] = mergeInternal(\n            targetValue as Record<string, unknown>,\n            sourceValue,\n            depth + 1,\n          )\n        }\n        else {\n          targetObj[key] = clone ? deepClone(sourceValue) : sourceValue\n        }\n      }\n      // 其他类型直接赋值\n      else {\n        targetObj[key] = clone && isObject(sourceValue) ? deepClone(sourceValue) : sourceValue\n      }\n    }\n\n    return targetObj\n  }\n\n  let result = target\n\n  for (const source of sources) {\n    if (source !== null && source !== undefined) {\n      result = mergeInternal(result, source, 0) as T\n    }\n  }\n\n  return result\n}\n\n/**\n * 比较两个值是否深度相等\n *\n * @param a - 第一个值\n * @param b - 第二个值\n * @returns 是否相等\n *\n * @example\n * ```typescript\n * deepEqual({ a: 1 }, { a: 1 }) // true\n * deepEqual([1, 2], [1, 2]) // true\n * deepEqual({ a: { b: 1 } }, { a: { b: 2 } }) // false\n * ```\n */\nexport function deepEqual(a: unknown, b: unknown): boolean {\n  // 严格相等\n  if (a === b) return true\n\n  // null/undefined 检查\n  if (a === null || b === null || a === undefined || b === undefined) {\n    return a === b\n  }\n\n  // 类型不同\n  if (typeof a !== typeof b) return false\n\n  // 基础类型\n  if (typeof a !== 'object') return a === b\n\n  // 日期比较\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() === b.getTime()\n  }\n\n  // 正则比较\n  if (a instanceof RegExp && b instanceof RegExp) {\n    return a.source === b.source && a.flags === b.flags\n  }\n\n  // Map 比较\n  if (a instanceof Map && b instanceof Map) {\n    if (a.size !== b.size) return false\n    for (const [key, value] of a) {\n      if (!b.has(key) || !deepEqual(value, b.get(key))) {\n        return false\n      }\n    }\n    return true\n  }\n\n  // Set 比较\n  if (a instanceof Set && b instanceof Set) {\n    if (a.size !== b.size) return false\n    for (const value of a) {\n      if (!b.has(value)) return false\n    }\n    return true\n  }\n\n  // 数组比较\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length) return false\n    for (let i = 0; i < a.length; i++) {\n      if (!deepEqual(a[i], b[i])) return false\n    }\n    return true\n  }\n\n  // 对象比较\n  if (isPlainObject(a) && isPlainObject(b)) {\n    const keysA = Object.keys(a)\n    const keysB = Object.keys(b)\n    if (keysA.length !== keysB.length) return false\n    for (const key of keysA) {\n      if (!hasOwnKey(b, key)) return false\n      if (!deepEqual(a[key], b[key])) return false\n    }\n    return true\n  }\n\n  return false\n}\n\n/**\n * 冻结对象（深度）\n *\n * @template T - 对象类型\n * @param obj - 要冻结的对象\n * @returns 冻结后的对象\n */\nexport function deepFreeze<T extends object>(obj: T): Readonly<T> {\n  const propNames = Object.getOwnPropertyNames(obj)\n\n  for (const name of propNames) {\n    const value = (obj as Record<string, unknown>)[name]\n    if (value && typeof value === 'object') {\n      deepFreeze(value)\n    }\n  }\n\n  return Object.freeze(obj)\n}\n\n"],"mappings":";;;;;;;;;;;;AAOA,MAAM,iBAAiB,OAAO,UAAU;AAExC,SAAS,UAAU,OAAe,KAA2B;CAC3D,OAAO,eAAe,KAAK,OAAO,GAAG;AACvC;AAQO,SAAS,SAAS,OAAkD;CACzE,OAAO,UAAU,QAAQ,OAAO,UAAU;AAC5C;AAQO,SAAS,cAAc,OAAkD;CAC9E,IAAI,CAAC,SAAS,KAAK,GAAG,OAAO;CAC7B,MAAM,QAAQ,OAAO,eAAe,KAAK;CACzC,OAAO,UAAU,QAAQ,UAAU,OAAO;AAC5C;AAQA,SAAS,sBAAsB,OAAyB;CAEtD,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;CAClD,IAAI,OAAO,UAAU,aAAa,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU,OAAO;CACjG,IAAI,OAAO,UAAU,UAAU,OAAO;CAGtC,IAAI,OAAO,UAAU,cAAc,OAAO,UAAU,UAAU,OAAO;CAGrE,IAAI,iBAAiB,QAAQ,iBAAiB,QAAQ,OAAO;CAC7D,IAAI,iBAAiB,eAAe,iBAAiB,UAAU,OAAO;CACtE,IAAI,iBAAiB,OAAO,iBAAiB,KAAK,OAAO;CACzD,IAAI,YAAY,OAAO,KAAK,GAAG,OAAO;CAGtC,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,OAAM,SAAQ,sBAAsB,IAAI,CAAC;CAGxD,IAAI,cAAc,KAAK,GACrB,OAAO,OAAO,OAAO,KAAK,CAAA,CAAE,OAAM,MAAK,sBAAsB,CAAC,CAAC;CAGjE,OAAO;AACT;AA6CO,SAAS,UAAa,OAAU,UAA4B,CAAC,GAAM;CACxE,MAAM,EACJ,oBAAoB,wBAAwB,MAC5C,iBAAiB,OACjB,eAAe,OACf,WAAW,UACX,iBACE;CAGJ,IAAI,yBAAyB,OAAO,oBAAoB,cAAc,sBAAsB,KAAK,GAC/F,IAAI;EACF,OAAO,gBAAgB,KAAK;CAC9B,QACM,CAEN;CAGF,MAAM,wBAAQ,IAAI,QAAyB;CAE3C,SAAS,cAAiB,KAAQ,OAAkB;EAElD,IAAI,QAAQ,QAAQ,QAAQ,KAAA,GAAW,OAAO;EAC9C,IAAI,OAAO,QAAQ,aAAa,OAAO,QAAQ,YAAY,OAAO,QAAQ,UAAU,OAAO;EAC3F,IAAI,OAAO,QAAQ,UAAU,OAAO;EAGpC,IAAI,OAAO,QAAQ,UACjB,OAAO,eAAe,OAAO,IAAI,WAAW,IAAS;EAIvD,IAAI,OAAO,QAAQ,YACjB,OAAO,iBAAkB,IAAI,KAAK,CAAC,CAAC,IAAU;EAIhD,IAAI,QAAQ,UACV,OAAO;EAIT,IAAI,cAAc;GAChB,MAAM,eAAe,aAAa,MAAK,MAAK,cAAc,GAAG,QAAQ,CAAC,CAAC;GACvE,IAAI,iBAAiB,KAAA,GACnB,OAAO;EAEX;EAGA,IAAI,OAAO,QAAQ,YAAY,QAAQ;OACjC,MAAM,IAAI,GAAG,GACf,OAAO,MAAM,IAAI,GAAG;EAAA;EAKxB,IAAI,eAAe,MACjB,OAAO,IAAI,KAAK,IAAI,QAAQ,CAAC;EAI/B,IAAI,eAAe,QAAQ;GACzB,MAAM,SAAS,IAAI,OAAO,IAAI,QAAQ,IAAI,KAAK;GAC7C,OAAkB,YAAY,IAAI;GACpC,OAAO;EACT;EAGA,IAAI,eAAe,OAAO;GACxB,MAAM,SAAS,IAAK,IAAI,YAAiC,IAAI,OAAO;GACpE,OAAO,QAAQ,IAAI;GACnB,OAAO,OAAO,IAAI;GAClB,OAAO;EACT;EAGA,IAAI,eAAe,KAAK;GACtB,MAAM,yBAAS,IAAI,IAAI;GACvB,MAAM,IAAI,KAAK,MAAM;GACrB,IAAI,SAAS,GAAG,MAAM;IACpB,OAAO,IAAI,cAAc,GAAG,QAAQ,CAAC,GAAG,cAAc,GAAG,QAAQ,CAAC,CAAC;GACrE,CAAC;GACD,OAAO;EACT;EAGA,IAAI,eAAe,KAAK;GACtB,MAAM,yBAAS,IAAI,IAAI;GACvB,MAAM,IAAI,KAAK,MAAM;GACrB,IAAI,SAAS,MAAM;IACjB,OAAO,IAAI,cAAc,GAAG,QAAQ,CAAC,CAAC;GACxC,CAAC;GACD,OAAO;EACT;EAGA,IAAI,eAAe,aACjB,OAAO,IAAI,MAAM,CAAC;EAIpB,IAAI,YAAY,OAAO,GAAG,KAAK,EAAE,eAAe,WAAW;GACzD,MAAM,wBAAwB,IAAI;GAClC,OAAO,IAAI,sBAAuB,IAA2C,OAAO,MAAM,CAAC,CAAC;EAC9F;EAGA,IAAI,MAAM,QAAQ,GAAG,GAAG;GACtB,MAAM,SAAoB,CAAC;GAC3B,MAAM,IAAI,KAAK,MAAM;GACrB,KAAA,IAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAC9B,OAAO,KAAK,cAAc,IAAI,IAAI,QAAQ,CAAC;GAE7C,OAAO;EACT;EAGA,IAAI,cAAc,GAAG,GAAG;GACtB,MAAM,SAA2C,CAAC;GAClD,MAAM,IAAI,KAAK,MAAM;GAGrB,MAAM,OAAO,OAAO,KAAK,GAAG;GAC5B,KAAA,MAAW,OAAO,MAChB,OAAO,OAAO,cAAe,IAAgC,MAAM,QAAQ,CAAC;GAI9E,IAAI,cAAc;IAChB,MAAM,aAAa,OAAO,sBAAsB,GAAG;IACnD,KAAA,MAAW,OAAO,YAChB,OAAO,OAAO,cAAe,IAAgC,MAAM,QAAQ,CAAC;GAEhF;GAEA,OAAO;EACT;EAGA,OAAO;CACT;CAEA,OAAO,cAAc,OAAO,CAAC;AAC/B;AAiBO,SAAS,aAAgB,OAAa;CAC3C,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;CAClD,IAAI,OAAO,UAAU,UAAU,OAAO;CAEtC,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,CAAC,GAAG,KAAK;CAGlB,IAAI,iBAAiB,KACnB,OAAO,IAAI,IAAI,KAAK;CAGtB,IAAI,iBAAiB,KACnB,OAAO,IAAI,IAAI,KAAK;CAGtB,IAAI,iBAAiB,MACnB,OAAO,IAAI,KAAK,MAAM,QAAQ,CAAC;CAGjC,OAAO,EAAE,GAAG,MAAM;AACpB;AAgCO,SAAS,UACd,QAAA,GACG,SACA;CACH,OAAO,qBAAqB,QAAQ,CAAC,GAAG,GAAG,OAAO;AACpD;AAWO,SAAS,qBACd,QACA,SAAA,GACG,SACA;CACH,MAAM,EACJ,gBAAgB,WAChB,QAAQ,MACR,WAAW,aACT;CAEJ,SAAS,cACP,WACA,WACA,OACyB;EACzB,IAAI,QAAQ,UACV,OAAO;EAGT,KAAA,MAAW,OAAO,OAAO,KAAK,SAAS,GAAG;GACxC,MAAM,cAAc,UAAU;GAC9B,MAAM,cAAc,UAAU;GAG9B,IAAI,MAAM,QAAQ,WAAW,GAC3B,IAAI,kBAAkB,YAAY,MAAM,QAAQ,WAAW,GACzD,UAAU,OAAO,CAAC,GAAG,aAAa,GAAG,WAAW;QAClD,IACS,kBAAkB,WAAW,MAAM,QAAQ,WAAW,GAAG;IAChE,MAAMA,UAAS,CAAC,GAAG,WAAW;IAC9B,YAAY,SAAS,MAAM,UAAU;KACnC,IAAI,cAAc,IAAI,KAAK,cAAcA,QAAO,MAAM,GACpDA,QAAO,SAAS,cAAcA,QAAO,QAAmC,MAAM,QAAQ,CAAC;UAGvFA,QAAO,SAAS,QAAQ,UAAU,IAAI,IAAI;IAE9C,CAAC;IACD,UAAU,OAAOA;GACnB,OAEE,UAAU,OAAO,QAAQ,UAAU,WAAW,IAAI;QAEtD,IAES,cAAc,WAAW,GAChC,IAAI,cAAc,WAAW,GAC3B,UAAU,OAAO,cACf,aACA,aACA,QAAQ,CACV;QAGA,UAAU,OAAO,QAAQ,UAAU,WAAW,IAAI;QAKpD,UAAU,OAAO,SAAS,SAAS,WAAW,IAAI,UAAU,WAAW,IAAI;EAE/E;EAEA,OAAO;CACT;CAEA,IAAI,SAAS;CAEb,KAAA,MAAW,UAAU,SACnB,IAAI,WAAW,QAAQ,WAAW,KAAA,GAChC,SAAS,cAAc,QAAQ,QAAQ,CAAC;CAI5C,OAAO;AACT;AAgBO,SAAS,UAAU,GAAY,GAAqB;CAEzD,IAAI,MAAM,GAAG,OAAO;CAGpB,IAAI,MAAM,QAAQ,MAAM,QAAQ,MAAM,KAAA,KAAa,MAAM,KAAA,GACvD,OAAO,MAAM;CAIf,IAAI,OAAO,MAAM,OAAO,GAAG,OAAO;CAGlC,IAAI,OAAO,MAAM,UAAU,OAAO,MAAM;CAGxC,IAAI,aAAa,QAAQ,aAAa,MACpC,OAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ;CAInC,IAAI,aAAa,UAAU,aAAa,QACtC,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;CAIhD,IAAI,aAAa,OAAO,aAAa,KAAK;EACxC,IAAI,EAAE,SAAS,EAAE,MAAM,OAAO;EAC9B,KAAA,MAAW,CAAC,KAAK,UAAU,GACzB,IAAI,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,UAAU,OAAO,EAAE,IAAI,GAAG,CAAC,GAC7C,OAAO;EAGX,OAAO;CACT;CAGA,IAAI,aAAa,OAAO,aAAa,KAAK;EACxC,IAAI,EAAE,SAAS,EAAE,MAAM,OAAO;EAC9B,KAAA,MAAW,SAAS,GAClB,IAAI,CAAC,EAAE,IAAI,KAAK,GAAG,OAAO;EAE5B,OAAO;CACT;CAGA,IAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;EACxC,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;EAClC,KAAA,IAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;EAErC,OAAO;CACT;CAGA,IAAI,cAAc,CAAC,KAAK,cAAc,CAAC,GAAG;EACxC,MAAM,QAAQ,OAAO,KAAK,CAAC;EAC3B,MAAM,QAAQ,OAAO,KAAK,CAAC;EAC3B,IAAI,MAAM,WAAW,MAAM,QAAQ,OAAO;EAC1C,KAAA,MAAW,OAAO,OAAO;GACvB,IAAI,CAAC,UAAU,GAAG,GAAG,GAAG,OAAO;GAC/B,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,GAAG,OAAO;EACzC;EACA,OAAO;CACT;CAEA,OAAO;AACT;AASO,SAAS,WAA6B,KAAqB;CAChE,MAAM,YAAY,OAAO,oBAAoB,GAAG;CAEhD,KAAA,MAAW,QAAQ,WAAW;EAC5B,MAAM,QAAS,IAAgC;EAC/C,IAAI,SAAS,OAAO,UAAU,UAC5B,WAAW,KAAK;CAEpB;CAEA,OAAO,OAAO,OAAO,GAAG;AAC1B"}

package/lib/utils/deep-clone.d.ts

@@ -0,0 +1,143 @@
+/**
+ * 深拷贝工具
+ *
+ * 提供高性能的深拷贝、浅拷贝和深度合并功能
+ * @module utils/deep-clone
+ */
+/**
+ * 判断是否为对象
+ *
+ * @param value - 待检查的值
+ * @returns 是否为对象
+ */
+export declare function isObject(value: unknown): value is Record<string, unknown>;
+/**
+ * 判断是否为普通对象（非数组、非内置对象）
+ *
+ * @param value - 待检查的值
+ * @returns 是否为普通对象
+ */
+export declare function isPlainObject(value: unknown): value is Record<string, unknown>;
+/**
+ * 深拷贝配置选项
+ */
+export interface DeepCloneOptions {
+    /** 是否优先使用 structuredClone（默认 true） */
+    useStructuredClone?: boolean;
+    /** 是否克隆函数（默认 false，函数保持引用） */
+    cloneFunctions?: boolean;
+    /** 是否克隆 Symbol 属性（默认 false） */
+    cloneSymbols?: boolean;
+    /** 最大深度（默认无限制） */
+    maxDepth?: number;
+    /** 自定义克隆器 */
+    customCloner?: <T>(value: T, clone: <U>(v: U) => U) => T | undefined;
+}
+/**
+ * 深拷贝
+ *
+ * 高性能深拷贝实现，优先使用原生 structuredClone（如果可用）
+ *
+ * @template T - 值类型
+ * @param value - 要拷贝的值
+ * @param options - 配置选项
+ * @returns 拷贝后的值
+ *
+ * @example
+ * ```typescript
+ * const obj = { a: 1, b: { c: 2 } }
+ * const cloned = deepClone(obj)
+ * cloned.b.c = 3
+ * console.log(obj.b.c) // 2
+ * ```
+ *
+ * @example
+ * ```typescript
+ * // 带配置的深拷贝
+ * const cloned = deepClone(obj, {
+ *   maxDepth: 5,
+ *   cloneSymbols: true
+ * })
+ * ```
+ */
+export declare function deepClone<T>(value: T, options?: DeepCloneOptions): T;
+/**
+ * 浅拷贝
+ *
+ * @template T - 值类型
+ * @param value - 要拷贝的值
+ * @returns 拷贝后的值
+ *
+ * @example
+ * ```typescript
+ * const arr = [1, 2, { a: 3 }]
+ * const cloned = shallowClone(arr)
+ * cloned[2].a = 4
+ * console.log(arr[2].a) // 4 (浅拷贝，嵌套对象共享引用)
+ * ```
+ */
+export declare function shallowClone<T>(value: T): T;
+/**
+ * 深度合并配置选项
+ */
+export interface DeepMergeOptions {
+    /** 数组合并策略：'replace' 替换 | 'concat' 连接 | 'merge' 按索引合并 */
+    arrayStrategy?: 'replace' | 'concat' | 'merge';
+    /** 是否克隆源对象（默认 true） */
+    clone?: boolean;
+    /** 最大深度 */
+    maxDepth?: number;
+}
+/**
+ * 深度合并对象
+ *
+ * 将多个源对象深度合并到目标对象
+ *
+ * @template T - 目标对象类型
+ * @param target - 目标对象
+ * @param sources - 源对象列表
+ * @returns 合并后的对象
+ *
+ * @example
+ * ```typescript
+ * const target = { a: 1, b: { c: 2 } }
+ * const source = { b: { d: 3 }, e: 4 }
+ * const result = deepMerge(target, source)
+ * // { a: 1, b: { c: 2, d: 3 }, e: 4 }
+ * ```
+ */
+export declare function deepMerge<T extends Record<string, unknown>>(target: T, ...sources: Array<Partial<T>>): T;
+/**
+ * 带配置的深度合并
+ *
+ * @template T - 目标对象类型
+ * @param target - 目标对象
+ * @param options - 合并配置
+ * @param sources - 源对象列表
+ * @returns 合并后的对象
+ */
+export declare function deepMergeWithOptions<T extends Record<string, unknown>>(target: T, options: DeepMergeOptions, ...sources: Array<Partial<T>>): T;
+/**
+ * 比较两个值是否深度相等
+ *
+ * @param a - 第一个值
+ * @param b - 第二个值
+ * @returns 是否相等
+ *
+ * @example
+ * ```typescript
+ * deepEqual({ a: 1 }, { a: 1 }) // true
+ * deepEqual([1, 2], [1, 2]) // true
+ * deepEqual({ a: { b: 1 } }, { a: { b: 2 } }) // false
+ * ```
+ */
+export declare function deepEqual(a: unknown, b: unknown): boolean;
+/**
+ * 冻结对象（深度）
+ *
+ * @template T - 对象类型
+ * @param obj - 要冻结的对象
+ * @returns 冻结后的对象
+ */
+export declare function deepFreeze<T extends object>(obj: T): Readonly<T>;
+//# sourceMappingURL=deep-clone.d.ts.map

package/lib/utils/index.cjs

@@ -0,0 +1,34 @@
+/*!
+* ***********************************
+* @composy/store-core v0.0.1      *
+* Built with rollup               *
+* Build time: 2024-08-17 11:27:33 *
+* Build mode: production          *
+* Minified: No                    *
+* ***********************************
+*/
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_debounce_throttle = require("./debounce-throttle.cjs");
+const require_deep_clone = require("./deep-clone.cjs");
+const require_selector = require("./selector.cjs");
+exports.combineSelectors = require_selector.combineSelectors;
+exports.createCachedSelector = require_selector.createCachedSelector;
+exports.createMemoizedSelector = require_selector.createMemoizedSelector;
+exports.createSelector = require_selector.createSelector;
+exports.createSelectorWithDeps = require_selector.createSelectorWithDeps;
+exports.debounce = require_debounce_throttle.debounce;
+exports.deepClone = require_deep_clone.deepClone;
+exports.deepEqual = require_deep_clone.deepEqual;
+exports.deepFreeze = require_deep_clone.deepFreeze;
+exports.deepMerge = require_deep_clone.deepMerge;
+exports.deepMergeWithOptions = require_deep_clone.deepMergeWithOptions;
+exports.deleteByPath = require_selector.deleteByPath;
+exports.getByPath = require_selector.getByPath;
+exports.hasPath = require_selector.hasPath;
+exports.isObject = require_deep_clone.isObject;
+exports.isPlainObject = require_deep_clone.isPlainObject;
+exports.setByPath = require_selector.setByPath;
+exports.shallowClone = require_deep_clone.shallowClone;
+exports.throttle = require_debounce_throttle.throttle;
+/*! End of @composy/store-core | Powered by @composy/builder */

package/lib/utils/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * 工具函数模块
+ *
+ * 提供深拷贝、选择器、路径操作等工具函数
+ * @module utils
+ */
+export { debounce, throttle, } from './debounce-throttle';
+export type { DebouncedFunction, ThrottledFunction, } from './debounce-throttle';
+export { deepClone, deepEqual, deepFreeze, deepMerge, deepMergeWithOptions, isObject, isPlainObject, shallowClone, } from './deep-clone';
+export type { DeepCloneOptions, DeepMergeOptions, } from './deep-clone';
+export { combineSelectors, createCachedSelector, createMemoizedSelector, createSelector, createSelectorWithDeps, deleteByPath, getByPath, hasPath, setByPath, } from './selector';
+export type { MemoizedSelectorOptions, SelectorEqualityFn, } from './selector';
+//# sourceMappingURL=index.d.ts.map

package/lib/utils/selector.cjs

@@ -0,0 +1,161 @@
+/*!
+* ***********************************
+* @composy/store-core v0.0.1      *
+* Built with rollup               *
+* Build time: 2024-08-17 11:27:33 *
+* Build mode: production          *
+* Minified: No                    *
+* ***********************************
+*/
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+//#region src/utils/selector.ts
+const ARRAY_INDEX_RE = /^\d+$/;
+function createSelector(selector, equalityFn = Object.is) {
+	let lastState;
+	let lastResult;
+	let initialized = false;
+	return (state) => {
+		if (initialized && lastState === state) return lastResult;
+		const result = selector(state);
+		if (!initialized || !equalityFn(result, lastResult)) lastResult = result;
+		lastState = state;
+		initialized = true;
+		return lastResult;
+	};
+}
+function createSelectorWithDeps(dependencies, combiner, options = {}) {
+	const { equalityFn = Object.is, trackHitRate = false } = options;
+	let lastDeps;
+	let lastResult;
+	let initialized = false;
+	let hits = 0;
+	let calls = 0;
+	const selector = (state) => {
+		if (trackHitRate) calls++;
+		const deps = dependencies.map((dep) => dep(state));
+		if (initialized && lastDeps) {
+			let changed = false;
+			for (let i = 0; i < deps.length; i++) if (!Object.is(deps[i], lastDeps[i])) {
+				changed = true;
+				break;
+			}
+			if (!changed) {
+				if (trackHitRate) hits++;
+				return lastResult;
+			}
+		}
+		const result = combiner(...deps);
+		if (!initialized || !equalityFn(result, lastResult)) lastResult = result;
+		lastDeps = deps;
+		initialized = true;
+		return lastResult;
+	};
+	if (trackHitRate) selector.getHitRate = () => {
+		return calls > 0 ? hits / calls : 0;
+	};
+	return selector;
+}
+function combineSelectors(selectors, combiner) {
+	return (state) => {
+		return combiner(...selectors.map((selector) => selector(state)));
+	};
+}
+function createCachedSelector(selector, options = {}) {
+	const { maxSize = 10 } = options;
+	const cache = /* @__PURE__ */ new Map();
+	const memoizedSelector = (state) => {
+		if (cache.has(state)) {
+			const cached = cache.get(state);
+			cache.delete(state);
+			cache.set(state, cached);
+			return cached;
+		}
+		const result = selector(state);
+		if (cache.size >= maxSize) {
+			const firstKey = cache.keys().next().value;
+			if (firstKey !== void 0) cache.delete(firstKey);
+		}
+		cache.set(state, result);
+		return result;
+	};
+	memoizedSelector.clearCache = () => cache.clear();
+	memoizedSelector.getCacheSize = () => cache.size;
+	return memoizedSelector;
+}
+function createMemoizedSelector(selector, options = {}) {
+	return createSelector(selector, options.equalityFn);
+}
+function getByPath(obj, path, defaultValue) {
+	if (!path || path.length === 0) return obj;
+	const keys = path.replace(/\[([^\]]+)\]/g, ".$1").split(".").filter(Boolean);
+	let result = obj;
+	for (const key of keys) {
+		if (result === null || result === void 0) return defaultValue;
+		if (typeof result !== "object") return defaultValue;
+		result = result[key];
+	}
+	return result === void 0 ? defaultValue : result;
+}
+function setByPath(obj, path, value) {
+	if (!path || path.length === 0) return false;
+	const keys = path.replace(/\[([^\]]+)\]/g, ".$1").split(".").filter(Boolean);
+	let current = obj;
+	for (let i = 0; i < keys.length - 1; i++) {
+		const key = keys[i];
+		const nextKey = keys[i + 1] ?? "";
+		const nextValue = current[key] ?? (ARRAY_INDEX_RE.test(nextKey) ? [] : {});
+		current[key] = nextValue;
+		current = current[key];
+	}
+	const lastKey = keys[keys.length - 1];
+	current[lastKey] = value;
+	return true;
+}
+function deleteByPath(obj, path) {
+	if (!path || path.length === 0) return false;
+	const keys = path.replace(/\[([^\]]+)\]/g, ".$1").split(".").filter(Boolean);
+	let current = obj;
+	for (let i = 0; i < keys.length - 1; i++) {
+		const key = keys[i];
+		if (current[key] === void 0 || current[key] === null) return false;
+		current = current[key];
+	}
+	const lastKey = keys[keys.length - 1];
+	if (lastKey in current) {
+		if (Array.isArray(current)) {
+			const index = Number.parseInt(lastKey, 10);
+			if (!Number.isNaN(index)) {
+				current.splice(index, 1);
+				return true;
+			}
+		}
+		delete current[lastKey];
+		return true;
+	}
+	return false;
+}
+function hasPath(obj, path) {
+	if (!path || path.length === 0) return true;
+	const keys = path.replace(/\[([^\]]+)\]/g, ".$1").split(".").filter(Boolean);
+	let current = obj;
+	for (const key of keys) {
+		if (current === null || current === void 0) return false;
+		if (typeof current !== "object") return false;
+		if (!(key in current)) return false;
+		current = current[key];
+	}
+	return true;
+}
+//#endregion
+exports.combineSelectors = combineSelectors;
+exports.createCachedSelector = createCachedSelector;
+exports.createMemoizedSelector = createMemoizedSelector;
+exports.createSelector = createSelector;
+exports.createSelectorWithDeps = createSelectorWithDeps;
+exports.deleteByPath = deleteByPath;
+exports.getByPath = getByPath;
+exports.hasPath = hasPath;
+exports.setByPath = setByPath;
+/*! End of @composy/store-core | Powered by @composy/builder */
+//# sourceMappingURL=selector.cjs.map

package/lib/utils/selector.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"selector.cjs","names":[],"sources":["../../src/utils/selector.ts"],"sourcesContent":["/**\n * 状态选择器工具\n *\n * 提供高性能的状态选择器和路径操作工具\n * @module utils/selector\n */\n\nimport type { Selector, StateTree } from '../types'\n\nconst ARRAY_INDEX_RE = /^\\d+$/\n\n/**\n * 选择器相等性比较函数类型\n */\nexport type SelectorEqualityFn<R> = (a: R, b: R) => boolean\n\n/**\n * 记忆化选择器配置选项\n */\nexport interface MemoizedSelectorOptions<R> {\n  /** 相等性比较函数 */\n  equalityFn?: SelectorEqualityFn<R>\n  /** 最大缓存大小（默认 1） */\n  maxSize?: number\n  /** 是否在开发模式下记录缓存命中率 */\n  trackHitRate?: boolean\n}\n\n/**\n * 创建记忆化选择器\n *\n * 基本的记忆化选择器，只缓存最后一次结果\n *\n * @template S - 状态类型\n * @template R - 返回值类型\n * @param selector - 选择器函数\n * @param equalityFn - 相等性比较函数（默认使用 Object.is）\n * @returns 记忆化的选择器\n *\n * @example\n * ```typescript\n * const selectTodos = createSelector(\n *   (state: AppState) => state.todos,\n * )\n *\n * const selectCompletedTodos = createSelector(\n *   (state: AppState) => state.todos.filter(t => t.completed),\n *   (a, b) => a.length === b.length && a.every((v, i) => v === b[i])\n * )\n * ```\n */\nexport function createSelector<S extends StateTree, R>(\n  selector: Selector<S, R>,\n  equalityFn: SelectorEqualityFn<R> = Object.is\n): Selector<S, R> {\n  let lastState: S | undefined\n  let lastResult: R | undefined\n  let initialized = false\n\n  return (state: S): R => {\n    // 如果状态引用未变，直接返回缓存结果\n    if (initialized && lastState === state) {\n      return lastResult as R\n    }\n\n    const result = selector(state)\n\n    // 检查结果是否改变\n    if (!initialized || !equalityFn(result, lastResult as R)) {\n      lastResult = result\n    }\n\n    lastState = state\n    initialized = true\n\n    return lastResult as R\n  }\n}\n\n/**\n * 创建带依赖的选择器\n *\n * 类似 reselect 的实现，支持多个输入选择器\n *\n * @template S - 状态类型\n * @template Deps - 依赖结果类型\n * @template R - 返回值类型\n * @param dependencies - 依赖选择器数组\n * @param combiner - 组合函数\n * @param options - 配置选项\n * @returns 记忆化的选择器\n *\n * @example\n * ```typescript\n * const selectVisibleTodos = createSelectorWithDeps(\n *   [\n *     (state) => state.todos,\n *     (state) => state.visibilityFilter,\n *   ],\n *   (todos, filter) => {\n *     switch (filter) {\n *       case 'SHOW_COMPLETED': return todos.filter(t => t.completed)\n *       case 'SHOW_ACTIVE': return todos.filter(t => !t.completed)\n *       default: return todos\n *     }\n *   }\n * )\n * ```\n */\nexport function createSelectorWithDeps<\n  S extends StateTree,\n  Deps extends unknown[],\n  R,\n>(\n  dependencies: { [K in keyof Deps]: Selector<S, Deps[K]> },\n  combiner: (...args: Deps) => R,\n  options: MemoizedSelectorOptions<R> = {}\n): Selector<S, R> {\n  const { equalityFn = Object.is, trackHitRate = false } = options\n\n  let lastDeps: Deps | undefined\n  let lastResult: R | undefined\n  let initialized = false\n\n  // 缓存统计（仅开发模式）\n  let hits = 0\n  let calls = 0\n\n  const selector = (state: S): R => {\n    if (trackHitRate) calls++\n\n    // 计算所有依赖的结果\n    const deps = dependencies.map(dep => dep(state)) as Deps\n\n    // 检查依赖是否改变\n    if (initialized && lastDeps) {\n      let changed = false\n      for (let i = 0; i < deps.length; i++) {\n        if (!Object.is(deps[i], lastDeps[i])) {\n          changed = true\n          break\n        }\n      }\n\n      if (!changed) {\n        if (trackHitRate) hits++\n        return lastResult as R\n      }\n    }\n\n    // 计算新结果\n    const result = combiner(...deps)\n\n    // 检查结果是否改变\n    if (!initialized || !equalityFn(result, lastResult as R)) {\n      lastResult = result\n    }\n\n    lastDeps = deps\n    initialized = true\n\n    return lastResult as R\n  }\n\n  // 添加缓存统计方法\n  if (trackHitRate) {\n    ;(selector as Selector<S, R> & { getHitRate: () => number }).getHitRate =\n      () => {\n        return calls > 0 ? hits / calls : 0\n      }\n  }\n\n  return selector\n}\n\n/**\n * 组合多个选择器\n *\n * 简单的选择器组合，不带记忆化\n *\n * @template S - 状态类型\n * @template R - 结果类型数组\n * @template C - 组合结果类型\n * @param selectors - 选择器数组\n * @param combiner - 组合函数\n * @returns 组合后的选择器\n *\n * @example\n * ```typescript\n * const selectUserAndTodos = combineSelectors(\n *   [\n *     (state) => state.user,\n *     (state) => state.todos,\n *   ],\n *   (user, todos) => ({ user, todos })\n * )\n * ```\n */\nexport function combineSelectors<S extends StateTree, R extends unknown[], C>(\n  selectors: { [K in keyof R]: Selector<S, R[K]> },\n  combiner: (...results: R) => C\n): Selector<S, C> {\n  return (state: S): C => {\n    const results = selectors.map(selector => selector(state)) as R\n    return combiner(...results)\n  }\n}\n\n/**\n * 创建带高级缓存的选择器\n *\n * 支持多个缓存条目，使用 LRU 策略\n *\n * @template S - 状态类型\n * @template R - 返回值类型\n * @param selector - 选择器函数\n * @param options - 配置选项\n * @returns 带缓存的选择器\n *\n * @example\n * ```typescript\n * const selectFilteredItems = createCachedSelector(\n *   (state, filter) => state.items.filter(item => item.type === filter),\n *   { maxSize: 5 }\n * )\n * ```\n */\nexport function createCachedSelector<S extends StateTree, R>(\n  selector: Selector<S, R>,\n  options: MemoizedSelectorOptions<R> = {}\n): Selector<S, R> & { clearCache: () => void; getCacheSize: () => number } {\n  const { maxSize = 10 } = options\n\n  // 使用 Map 保持插入顺序（LRU 策略）\n  const cache = new Map<S, R>()\n\n  const memoizedSelector = (state: S): R => {\n    // 检查缓存\n    if (cache.has(state)) {\n      const cached = cache.get(state) as R\n      // 移到末尾（最近使用）\n      cache.delete(state)\n      cache.set(state, cached)\n      return cached\n    }\n\n    // 计算结果\n    const result = selector(state)\n\n    // 管理缓存大小（LRU 淘汰）\n    if (cache.size >= maxSize) {\n      const firstKey = cache.keys().next().value\n      if (firstKey !== undefined) {\n        cache.delete(firstKey)\n      }\n    }\n\n    cache.set(state, result)\n    return result\n  }\n\n  // 添加缓存管理方法\n  memoizedSelector.clearCache = () => cache.clear()\n  memoizedSelector.getCacheSize = () => cache.size\n\n  return memoizedSelector\n}\n\n/**\n * 创建记忆化选择器（别名，同 createSelector）\n *\n * @template S - 状态类型\n * @template R - 返回值类型\n * @param selector - 选择器函数\n * @param options - 配置选项\n * @returns 记忆化的选择器\n */\nexport function createMemoizedSelector<S extends StateTree, R>(\n  selector: Selector<S, R>,\n  options: MemoizedSelectorOptions<R> = {}\n): Selector<S, R> {\n  return createSelector(selector, options.equalityFn)\n}\n\n/**\n * 获取嵌套对象的值\n *\n * 支持点表示法和数组索引\n *\n * @template T - 返回值类型\n * @param obj - 对象\n * @param path - 路径（支持 'a.b.c' 或 'a[0].b'）\n * @param defaultValue - 默认值（当路径不存在时返回）\n * @returns 值\n *\n * @example\n * ```typescript\n * const value = getByPath({ a: { b: { c: 1 } } }, 'a.b.c')\n * // value: 1\n *\n * const arr = getByPath({ items: [{ name: 'test' }] }, 'items[0].name')\n * // arr: 'test'\n *\n * const missing = getByPath({ a: 1 }, 'b.c', 'default')\n * // missing: 'default'\n * ```\n */\nexport function getByPath<T = unknown>(\n  obj: unknown,\n  path: string,\n  defaultValue?: T\n): T | undefined {\n  if (!path || path.length === 0) {\n    return obj as T\n  }\n\n  // 解析路径（支持 'a.b.c' 和 'a[0].b'）\n  const keys = path\n    .replace(/\\[([^\\]]+)\\]/g, '.$1') // 将 [0] 转换为 .0\n    .split('.')\n    .filter(Boolean)\n\n  let result: unknown = obj\n\n  for (const key of keys) {\n    if (result === null || result === undefined) {\n      return defaultValue\n    }\n\n    if (typeof result !== 'object') {\n      return defaultValue\n    }\n\n    result = (result as Record<string, unknown>)[key]\n  }\n\n  return result === undefined ? defaultValue : (result as T)\n}\n\n/**\n * 设置嵌套对象的值\n *\n * 支持自动创建中间路径\n *\n * @param obj - 对象\n * @param path - 路径\n * @param value - 值\n * @returns 是否成功\n *\n * @example\n * ```typescript\n * const obj = {}\n * setByPath(obj, 'a.b.c', 1)\n * // obj: { a: { b: { c: 1 } } }\n *\n * setByPath(obj, 'items[0].name', 'test')\n * // obj: { a: { b: { c: 1 } }, items: [{ name: 'test' }] }\n * ```\n */\nexport function setByPath(\n  obj: Record<string, unknown>,\n  path: string,\n  value: unknown\n): boolean {\n  if (!path || path.length === 0) {\n    return false\n  }\n\n  // 解析路径\n  const keys = path\n    .replace(/\\[([^\\]]+)\\]/g, '.$1')\n    .split('.')\n    .filter(Boolean)\n\n  let current: Record<string, unknown> = obj\n\n  for (let i = 0; i < keys.length - 1; i++) {\n    const key = keys[i]\n    const nextKey = keys[i + 1] ?? ''\n\n    const nextValue = current[key] ?? (ARRAY_INDEX_RE.test(nextKey) ? [] : {})\n    // 根据下一个键决定创建对象还是数组\n    current[key] = nextValue\n    current = current[key] as Record<string, unknown>\n  }\n\n  const lastKey = keys[keys.length - 1]\n  current[lastKey] = value\n  return true\n}\n\n/**\n * 删除嵌套对象的值\n *\n * @param obj - 对象\n * @param path - 路径\n * @returns 是否成功删除\n *\n * @example\n * ```typescript\n * const obj = { a: { b: { c: 1 } } }\n * deleteByPath(obj, 'a.b.c')\n * // obj: { a: { b: {} } }\n * ```\n */\nexport function deleteByPath(\n  obj: Record<string, unknown>,\n  path: string\n): boolean {\n  if (!path || path.length === 0) {\n    return false\n  }\n\n  const keys = path\n    .replace(/\\[([^\\]]+)\\]/g, '.$1')\n    .split('.')\n    .filter(Boolean)\n\n  let current: Record<string, unknown> = obj\n\n  for (let i = 0; i < keys.length - 1; i++) {\n    const key = keys[i]\n    if (current[key] === undefined || current[key] === null) {\n      return false\n    }\n    current = current[key] as Record<string, unknown>\n  }\n\n  const lastKey = keys[keys.length - 1]\n  if (lastKey in current) {\n    if (Array.isArray(current)) {\n      const index = Number.parseInt(lastKey, 10)\n      if (!Number.isNaN(index)) {\n        current.splice(index, 1)\n        return true\n      }\n    }\n    delete current[lastKey]\n    return true\n  }\n\n  return false\n}\n\n/**\n * 检查嵌套对象中是否存在指定路径\n *\n * @param obj - 对象\n * @param path - 路径\n * @returns 是否存在\n *\n * @example\n * ```typescript\n * hasPath({ a: { b: 1 } }, 'a.b') // true\n * hasPath({ a: { b: 1 } }, 'a.c') // false\n * ```\n */\nexport function hasPath(obj: unknown, path: string): boolean {\n  if (!path || path.length === 0) {\n    return true\n  }\n\n  const keys = path\n    .replace(/\\[([^\\]]+)\\]/g, '.$1')\n    .split('.')\n    .filter(Boolean)\n\n  let current: unknown = obj\n\n  for (const key of keys) {\n    if (current === null || current === undefined) {\n      return false\n    }\n\n    if (typeof current !== 'object') {\n      return false\n    }\n\n    if (!(key in (current as Record<string, unknown>))) {\n      return false\n    }\n\n    current = (current as Record<string, unknown>)[key]\n  }\n\n  return true\n}\n"],"mappings":";;;;;;;;;;;;AASA,MAAM,iBAAiB;AA0ChB,SAAS,eACd,UACA,aAAoC,OAAO,IAC3B;CAChB,IAAI;CACJ,IAAI;CACJ,IAAI,cAAc;CAElB,QAAQ,UAAgB;EAEtB,IAAI,eAAe,cAAc,OAC/B,OAAO;EAGT,MAAM,SAAS,SAAS,KAAK;EAG7B,IAAI,CAAC,eAAe,CAAC,WAAW,QAAQ,UAAe,GACrD,aAAa;EAGf,YAAY;EACZ,cAAc;EAEd,OAAO;CACT;AACF;AAgCO,SAAS,uBAKd,cACA,UACA,UAAsC,CAAC,GACvB;CAChB,MAAM,EAAE,aAAa,OAAO,IAAI,eAAe,UAAU;CAEzD,IAAI;CACJ,IAAI;CACJ,IAAI,cAAc;CAGlB,IAAI,OAAO;CACX,IAAI,QAAQ;CAEZ,MAAM,YAAY,UAAgB;EAChC,IAAI,cAAc;EAGlB,MAAM,OAAO,aAAa,KAAI,QAAO,IAAI,KAAK,CAAC;EAG/C,IAAI,eAAe,UAAU;GAC3B,IAAI,UAAU;GACd,KAAA,IAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,IAAI,CAAC,OAAO,GAAG,KAAK,IAAI,SAAS,EAAE,GAAG;IACpC,UAAU;IACV;GACF;GAGF,IAAI,CAAC,SAAS;IACZ,IAAI,cAAc;IAClB,OAAO;GACT;EACF;EAGA,MAAM,SAAS,SAAS,GAAG,IAAI;EAG/B,IAAI,CAAC,eAAe,CAAC,WAAW,QAAQ,UAAe,GACrD,aAAa;EAGf,WAAW;EACX,cAAc;EAEd,OAAO;CACT;CAGA,IAAI,cACA,SAA2D,mBACrD;EACJ,OAAO,QAAQ,IAAI,OAAO,QAAQ;CACpC;CAGJ,OAAO;AACT;AAyBO,SAAS,iBACd,WACA,UACgB;CAChB,QAAQ,UAAgB;EAEtB,OAAO,SAAS,GADA,UAAU,KAAI,aAAY,SAAS,KAAK,CACrC,CAAO;CAC5B;AACF;AAqBO,SAAS,qBACd,UACA,UAAsC,CAAC,GACkC;CACzE,MAAM,EAAE,UAAU,OAAO;CAGzB,MAAM,wBAAQ,IAAI,IAAU;CAE5B,MAAM,oBAAoB,UAAgB;EAExC,IAAI,MAAM,IAAI,KAAK,GAAG;GACpB,MAAM,SAAS,MAAM,IAAI,KAAK;GAE9B,MAAM,OAAO,KAAK;GAClB,MAAM,IAAI,OAAO,MAAM;GACvB,OAAO;EACT;EAGA,MAAM,SAAS,SAAS,KAAK;EAG7B,IAAI,MAAM,QAAQ,SAAS;GACzB,MAAM,WAAW,MAAM,KAAK,CAAA,CAAE,KAAK,CAAA,CAAE;GACrC,IAAI,aAAa,KAAA,GACf,MAAM,OAAO,QAAQ;EAEzB;EAEA,MAAM,IAAI,OAAO,MAAM;EACvB,OAAO;CACT;CAGA,iBAAiB,mBAAmB,MAAM,MAAM;CAChD,iBAAiB,qBAAqB,MAAM;CAE5C,OAAO;AACT;AAWO,SAAS,uBACd,UACA,UAAsC,CAAC,GACvB;CAChB,OAAO,eAAe,UAAU,QAAQ,UAAU;AACpD;AAyBO,SAAS,UACd,KACA,MACA,cACe;CACf,IAAI,CAAC,QAAQ,KAAK,WAAW,GAC3B,OAAO;CAIT,MAAM,OAAO,KACV,QAAQ,iBAAiB,KAAK,CAAA,CAC9B,MAAM,GAAG,CAAA,CACT,OAAO,OAAO;CAEjB,IAAI,SAAkB;CAEtB,KAAA,MAAW,OAAO,MAAM;EACtB,IAAI,WAAW,QAAQ,WAAW,KAAA,GAChC,OAAO;EAGT,IAAI,OAAO,WAAW,UACpB,OAAO;EAGT,SAAU,OAAmC;CAC/C;CAEA,OAAO,WAAW,KAAA,IAAY,eAAgB;AAChD;AAsBO,SAAS,UACd,KACA,MACA,OACS;CACT,IAAI,CAAC,QAAQ,KAAK,WAAW,GAC3B,OAAO;CAIT,MAAM,OAAO,KACV,QAAQ,iBAAiB,KAAK,CAAA,CAC9B,MAAM,GAAG,CAAA,CACT,OAAO,OAAO;CAEjB,IAAI,UAAmC;CAEvC,KAAA,IAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;EACxC,MAAM,MAAM,KAAK;EACjB,MAAM,UAAU,KAAK,IAAI,MAAM;EAE/B,MAAM,YAAY,QAAQ,SAAS,eAAe,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC;EAExE,QAAQ,OAAO;EACf,UAAU,QAAQ;CACpB;CAEA,MAAM,UAAU,KAAK,KAAK,SAAS;CACnC,QAAQ,WAAW;CACnB,OAAO;AACT;AAgBO,SAAS,aACd,KACA,MACS;CACT,IAAI,CAAC,QAAQ,KAAK,WAAW,GAC3B,OAAO;CAGT,MAAM,OAAO,KACV,QAAQ,iBAAiB,KAAK,CAAA,CAC9B,MAAM,GAAG,CAAA,CACT,OAAO,OAAO;CAEjB,IAAI,UAAmC;CAEvC,KAAA,IAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;EACxC,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,SAAS,KAAA,KAAa,QAAQ,SAAS,MACjD,OAAO;EAET,UAAU,QAAQ;CACpB;CAEA,MAAM,UAAU,KAAK,KAAK,SAAS;CACnC,IAAI,WAAW,SAAS;EACtB,IAAI,MAAM,QAAQ,OAAO,GAAG;GAC1B,MAAM,QAAQ,OAAO,SAAS,SAAS,EAAE;GACzC,IAAI,CAAC,OAAO,MAAM,KAAK,GAAG;IACxB,QAAQ,OAAO,OAAO,CAAC;IACvB,OAAO;GACT;EACF;EACA,OAAO,QAAQ;EACf,OAAO;CACT;CAEA,OAAO;AACT;AAeO,SAAS,QAAQ,KAAc,MAAuB;CAC3D,IAAI,CAAC,QAAQ,KAAK,WAAW,GAC3B,OAAO;CAGT,MAAM,OAAO,KACV,QAAQ,iBAAiB,KAAK,CAAA,CAC9B,MAAM,GAAG,CAAA,CACT,OAAO,OAAO;CAEjB,IAAI,UAAmB;CAEvB,KAAA,MAAW,OAAO,MAAM;EACtB,IAAI,YAAY,QAAQ,YAAY,KAAA,GAClC,OAAO;EAGT,IAAI,OAAO,YAAY,UACrB,OAAO;EAGT,IAAI,EAAE,OAAQ,UACZ,OAAO;EAGT,UAAW,QAAoC;CACjD;CAEA,OAAO;AACT"}