superjs-core 0.3.9 → 0.4.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +85 -97
- package/dist/collection/index.d.ts +16 -1
- package/dist/collection/index.js +30 -0
- package/dist/collection/index.js.map +1 -1
- package/dist/color/index.d.ts +50 -0
- package/dist/color/index.js +66 -0
- package/dist/color/index.js.map +1 -0
- package/dist/core/index.d.ts +25 -1
- package/dist/core/index.js +51 -0
- package/dist/core/index.js.map +1 -1
- package/dist/index.d.ts +1 -0
- package/dist/index.js +64 -0
- package/dist/index.js.map +1 -1
- package/dist/string/index.d.ts +34 -1
- package/dist/string/index.js +37 -0
- package/dist/string/index.js.map +1 -1
- package/package.json +6 -2
package/dist/core/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../src/core/index.ts"],"sourcesContent":["export interface DebounceOptions {\r\n leading?: boolean\r\n trailing?: boolean\r\n maxWait?: number\r\n}\r\n\r\nexport interface DebouncedFunction<T extends (...args: unknown[]) => unknown> {\r\n (...args: Parameters<T>): void\r\n cancel(): void\r\n flush(): void\r\n}\r\n\r\nexport interface MemoizedFunction<T extends (...args: unknown[]) => unknown> {\r\n (...args: Parameters<T>): ReturnType<T>\r\n cache: Map<string, ReturnType<T>>\r\n}\r\n\r\nexport interface RetryOptions {\r\n attempts?: number\r\n baseDelay?: number\r\n maxDelay?: number\r\n shouldRetry?: (error: unknown) => boolean\r\n}\r\n\r\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\r\n if (value === null || typeof value !== 'object') return false\r\n const proto = Object.getPrototypeOf(value)\r\n return proto === Object.prototype || proto === null\r\n}\r\n\r\nfunction getType(value: unknown): string {\r\n return Object.prototype.toString.call(value)\r\n}\r\n\r\nfunction clone<T>(value: T, seen: WeakMap<object, unknown>): T {\r\n if (value === null || typeof value !== 'object') return value\r\n\r\n if (seen.has(value as object)) return seen.get(value as object) as T\r\n\r\n const tag = getType(value)\r\n\r\n if (tag === '[object Date]') {\r\n const cloned = new Date((value as unknown as Date).getTime())\r\n seen.set(value as object, cloned)\r\n return cloned as unknown as T\r\n }\r\n\r\n if (tag === '[object RegExp]') {\r\n const regExp = value as unknown as RegExp\r\n const cloned = new RegExp(regExp.source, regExp.flags)\r\n cloned.lastIndex = regExp.lastIndex\r\n seen.set(value as object, cloned)\r\n return cloned as unknown as T\r\n }\r\n\r\n if (tag === '[object Map]') {\r\n const cloned = new Map<unknown, unknown>()\r\n seen.set(value as object, cloned)\r\n ;(value as unknown as Map<unknown, unknown>).forEach((v, k) => {\r\n cloned.set(clone(k, seen), clone(v, seen))\r\n })\r\n return cloned as unknown as T\r\n }\r\n\r\n if (tag === '[object Set]') {\r\n const cloned = new Set<unknown>()\r\n seen.set(value as object, cloned)\r\n ;(value as unknown as Set<unknown>).forEach(v => {\r\n cloned.add(clone(v, seen))\r\n })\r\n return cloned as unknown as T\r\n }\r\n\r\n if (Array.isArray(value)) {\r\n const cloned: unknown[] = []\r\n seen.set(value as object, cloned)\r\n for (let i = 0; i < value.length; i++) {\r\n cloned[i] = clone(value[i], seen)\r\n }\r\n return cloned as unknown as T\r\n }\r\n\r\n if (tag === '[object Object]') {\r\n const cloned: Record<string, unknown> = {}\r\n seen.set(value as object, cloned)\r\n const keys = Object.keys(value as Record<string, unknown>)\r\n for (let i = 0; i < keys.length; i++) {\r\n const key = keys[i]!\r\n cloned[key] = clone((value as Record<string, unknown>)[key], seen)\r\n }\r\n return cloned as unknown as T\r\n }\r\n\r\n return value\r\n}\r\n\r\n/**\r\n * Deep clone a value, supporting objects, arrays, Date, RegExp, Map, Set,\r\n * and cyclic references.\r\n *\r\n * @param value - The value to clone.\r\n * @returns A deep copy of the input value.\r\n */\r\nexport function deepClone<T>(value: T): T {\r\n const seen = new WeakMap<object, unknown>()\r\n return clone(value, seen)\r\n}\r\n\r\n/**\r\n * Deep merge multiple objects. Arrays are overwritten, not concatenated.\r\n * `null` and `undefined` source objects are skipped.\r\n *\r\n * @param objects - The objects to merge.\r\n * @returns A new object with merged properties.\r\n */\r\nexport function deepMerge<T extends Record<string, unknown>>(...objects: Partial<T>[]): T {\r\n const result = {} as T\r\n\r\n for (let i = 0; i < objects.length; i++) {\r\n const obj = objects[i]\r\n if (obj === null || obj === undefined) continue\r\n\r\n const keys = Object.keys(obj) as (keyof T)[]\r\n for (let j = 0; j < keys.length; j++) {\r\n const key = keys[j]!\r\n const val = obj[key]\r\n const existing = result[key]\r\n\r\n if (val !== undefined && isPlainObject(val) && isPlainObject(existing)) {\r\n result[key] = deepMerge(\r\n existing as Record<string, unknown>,\r\n val as Record<string, unknown>\r\n ) as T[keyof T]\r\n } else if (val !== undefined) {\r\n result[key] = val as T[keyof T]\r\n }\r\n }\r\n }\r\n\r\n return result\r\n}\r\n\r\n/**\r\n * Creates a debounced function that delays invoking `fn` until after `wait`\r\n * milliseconds have elapsed since the last invocation. Supports leading,\r\n * trailing, and maxWait options. The returned function also has `.cancel()`\r\n * and `.flush()` methods.\r\n *\r\n * @param fn - The function to debounce.\r\n * @param wait - The number of milliseconds to delay.\r\n * @param options - Optional configuration.\r\n * @returns A debounced function with `.cancel()` and `.flush()`.\r\n */\r\nexport function debounce<T extends (...args: unknown[]) => unknown>(\r\n fn: T,\r\n wait: number,\r\n options?: DebounceOptions\r\n): DebouncedFunction<T> {\r\n const { leading = false, trailing = true, maxWait } = options ?? {}\r\n\r\n let timer: ReturnType<typeof setTimeout> | null = null\r\n let maxTimer: ReturnType<typeof setTimeout> | null = null\r\n let lastArgs: Parameters<T> | null = null\r\n let lastCallTime: number | null = null\r\n let lastInvokeTime = 0\r\n\r\n function invoke(time: number): void {\r\n lastInvokeTime = time\r\n if (lastArgs) {\r\n fn(...lastArgs)\r\n lastArgs = null\r\n }\r\n }\r\n\r\n function startTimer(waitTime: number): void {\r\n if (timer) clearTimeout(timer)\r\n timer = setTimeout(() => {\r\n const now = Date.now()\r\n if (lastArgs && trailing) {\r\n invoke(now)\r\n }\r\n timer = null\r\n lastCallTime = null\r\n }, waitTime)\r\n }\r\n\r\n function startMaxTimer(): void {\r\n if (maxWait === undefined || maxTimer) return\r\n maxTimer = setTimeout(() => {\r\n if (lastArgs) {\r\n invoke(Date.now())\r\n if (timer) {\r\n clearTimeout(timer)\r\n timer = null\r\n }\r\n lastCallTime = null\r\n }\r\n }, maxWait)\r\n }\r\n\r\n function clearAllTimers(): void {\r\n if (timer) {\r\n clearTimeout(timer)\r\n timer = null\r\n }\r\n if (maxTimer) {\r\n clearTimeout(maxTimer)\r\n maxTimer = null\r\n }\r\n }\r\n\r\n function shouldInvoke(time: number): boolean {\r\n if (lastCallTime === null) return true\r\n const timeSinceLastCall = time - lastCallTime\r\n const timeSinceLastInvoke = time - lastInvokeTime\r\n return (\r\n timeSinceLastCall >= wait ||\r\n (maxWait !== undefined && timeSinceLastInvoke >= maxWait)\r\n )\r\n }\r\n\r\n const debounced = function (this: unknown, ...args: Parameters<T>): void {\r\n const time = Date.now()\r\n const isInvoking = shouldInvoke(time)\r\n\r\n lastArgs = args\r\n lastCallTime = time\r\n\r\n if (isInvoking && !timer && leading) {\r\n invoke(time)\r\n }\r\n\r\n if (!timer) {\r\n startTimer(wait)\r\n if (maxWait !== undefined) {\r\n startMaxTimer()\r\n }\r\n }\r\n } as DebouncedFunction<T>\r\n\r\n debounced.cancel = (): void => {\r\n clearAllTimers()\r\n lastArgs = null\r\n lastCallTime = null\r\n lastInvokeTime = 0\r\n }\r\n\r\n debounced.flush = (): void => {\r\n if (timer && lastArgs) {\r\n invoke(Date.now())\r\n clearAllTimers()\r\n lastCallTime = null\r\n }\r\n }\r\n\r\n return debounced\r\n}\r\n\r\n/**\r\n * Creates a throttled function that only invokes `fn` at most once per\r\n * `wait` milliseconds.\r\n *\r\n * @param fn - The function to throttle.\r\n * @param wait - The number of milliseconds to throttle invocations to.\r\n * @returns A throttled function.\r\n */\r\nexport function throttle<T extends (...args: unknown[]) => unknown>(\r\n fn: T,\r\n wait: number\r\n): (...args: Parameters<T>) => void {\r\n let lastTime = 0\r\n let timer: ReturnType<typeof setTimeout> | null = null\r\n let lastArgs: Parameters<T> | null = null\r\n\r\n const throttled = function (this: unknown, ...args: Parameters<T>): void {\r\n const now = Date.now()\r\n const remaining = wait - (now - lastTime)\r\n\r\n if (remaining <= 0) {\r\n if (timer) {\r\n clearTimeout(timer)\r\n timer = null\r\n }\r\n lastTime = now\r\n lastArgs = null\r\n fn.apply(this, args)\r\n } else {\r\n lastArgs = args\r\n if (!timer) {\r\n timer = setTimeout(() => {\r\n lastTime = Date.now()\r\n timer = null\r\n if (lastArgs) {\r\n fn.apply(this, lastArgs)\r\n lastArgs = null\r\n }\r\n }, remaining)\r\n }\r\n }\r\n }\r\n\r\n return throttled\r\n}\r\n\r\n/**\r\n * Creates a memoized version of `fn`. Uses a `Map` cache keyed by the\r\n * first argument by default, or by a custom `resolver` function.\r\n *\r\n * @param fn - The function to memoize.\r\n * @param resolver - Optional function to determine the cache key.\r\n * @returns The memoized function with a `.cache` property.\r\n */\r\nexport function memoize<T extends (...args: unknown[]) => unknown>(\r\n fn: T,\r\n resolver?: (...args: Parameters<T>) => string\r\n): MemoizedFunction<T> {\r\n const cache = new Map<string, ReturnType<T>>()\r\n\r\n const memoized = function (this: unknown, ...args: Parameters<T>): ReturnType<T> {\r\n const key = resolver ? resolver(...args) : String(args[0])\r\n if (cache.has(key)) {\r\n return cache.get(key) as ReturnType<T>\r\n }\r\n const result = fn.apply(this, args) as ReturnType<T>\r\n cache.set(key, result)\r\n return result\r\n }\r\n\r\n memoized.cache = cache\r\n\r\n return memoized as MemoizedFunction<T>\r\n}\r\n\r\n/**\r\n * Retries an async function with exponential backoff and jitter.\r\n *\r\n * @param fn - The async function to retry.\r\n * @param options - Retry configuration.\r\n * @returns A promise that resolves with the function result.\r\n */\r\nexport function retry<T>(\r\n fn: () => Promise<T>,\r\n options?: RetryOptions\r\n): Promise<T> {\r\n const {\r\n attempts = 3,\r\n baseDelay = 1000,\r\n maxDelay = 30000,\r\n shouldRetry = () => true,\r\n } = options ?? {}\r\n\r\n let attempt = 0\r\n\r\n const execute = (): Promise<T> => {\r\n attempt++\r\n return fn().catch((error: unknown) => {\r\n if (attempt >= attempts || !shouldRetry(error)) {\r\n throw error\r\n }\r\n\r\n const delay = Math.min(\r\n baseDelay * Math.pow(2, attempt - 1) + Math.random() * baseDelay,\r\n maxDelay\r\n )\r\n\r\n return new Promise<T>(resolve => {\r\n setTimeout(() => {\r\n resolve(execute())\r\n }, delay)\r\n })\r\n })\r\n }\r\n\r\n return execute()\r\n}\r\n\r\n/**\r\n * A no-operation function that returns `undefined`.\r\n */\r\nexport function noop(): void {\r\n return undefined\r\n}\r\n\r\n/**\r\n * Returns the given value unchanged.\r\n *\r\n * @param value - The value to return.\r\n * @returns The same value.\r\n */\r\nexport function identity<T>(value: T): T {\r\n return value\r\n}\r\n\r\n/**\r\n * Creates a function that invokes `fn` only once. Subsequent calls return\r\n * the result of the first invocation.\r\n *\r\n * @param fn - The function to wrap.\r\n * @returns A function that runs only once.\r\n */\r\nexport function once<T extends (...args: unknown[]) => unknown>(\r\n fn: T\r\n): (...args: Parameters<T>) => ReturnType<T> {\r\n let called = false\r\n let result: ReturnType<T>\r\n\r\n return function (this: unknown, ...args: Parameters<T>): ReturnType<T> {\r\n if (!called) {\r\n called = true\r\n result = fn.apply(this, args) as ReturnType<T>\r\n }\r\n return result\r\n }\r\n}\r\n"],"mappings":";AAwBA,SAAS,cAAc,OAAkD;AACvE,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,QAAM,QAAQ,OAAO,eAAe,KAAK;AACzC,SAAO,UAAU,OAAO,aAAa,UAAU;AACjD;AAEA,SAAS,QAAQ,OAAwB;AACvC,SAAO,OAAO,UAAU,SAAS,KAAK,KAAK;AAC7C;AAEA,SAAS,MAAS,OAAU,MAAmC;AAC7D,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AAExD,MAAI,KAAK,IAAI,KAAe,EAAG,QAAO,KAAK,IAAI,KAAe;AAE9D,QAAM,MAAM,QAAQ,KAAK;AAEzB,MAAI,QAAQ,iBAAiB;AAC3B,UAAM,SAAS,IAAI,KAAM,MAA0B,QAAQ,CAAC;AAC5D,SAAK,IAAI,OAAiB,MAAM;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,UAAM,SAAS;AACf,UAAM,SAAS,IAAI,OAAO,OAAO,QAAQ,OAAO,KAAK;AACrD,WAAO,YAAY,OAAO;AAC1B,SAAK,IAAI,OAAiB,MAAM;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,UAAM,SAAS,oBAAI,IAAsB;AACzC,SAAK,IAAI,OAAiB,MAAM;AAC/B,IAAC,MAA2C,QAAQ,CAAC,GAAG,MAAM;AAC7D,aAAO,IAAI,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;AAAA,IAC3C,CAAC;AACD,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,UAAM,SAAS,oBAAI,IAAa;AAChC,SAAK,IAAI,OAAiB,MAAM;AAC/B,IAAC,MAAkC,QAAQ,OAAK;AAC/C,aAAO,IAAI,MAAM,GAAG,IAAI,CAAC;AAAA,IAC3B,CAAC;AACD,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,SAAoB,CAAC;AAC3B,SAAK,IAAI,OAAiB,MAAM;AAChC,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,aAAO,CAAC,IAAI,MAAM,MAAM,CAAC,GAAG,IAAI;AAAA,IAClC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,UAAM,SAAkC,CAAC;AACzC,SAAK,IAAI,OAAiB,MAAM;AAChC,UAAM,OAAO,OAAO,KAAK,KAAgC;AACzD,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,aAAO,GAAG,IAAI,MAAO,MAAkC,GAAG,GAAG,IAAI;AAAA,IACnE;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AASO,SAAS,UAAa,OAAa;AACxC,QAAM,OAAO,oBAAI,QAAyB;AAC1C,SAAO,MAAM,OAAO,IAAI;AAC1B;AASO,SAAS,aAAgD,SAA0B;AACxF,QAAM,SAAS,CAAC;AAEhB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,MAAM,QAAQ,CAAC;AACrB,QAAI,QAAQ,QAAQ,QAAQ,OAAW;AAEvC,UAAM,OAAO,OAAO,KAAK,GAAG;AAC5B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,MAAM,IAAI,GAAG;AACnB,YAAM,WAAW,OAAO,GAAG;AAE3B,UAAI,QAAQ,UAAa,cAAc,GAAG,KAAK,cAAc,QAAQ,GAAG;AACtE,eAAO,GAAG,IAAI;AAAA,UACZ;AAAA,UACA;AAAA,QACF;AAAA,MACF,WAAW,QAAQ,QAAW;AAC5B,eAAO,GAAG,IAAI;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAaO,SAAS,SACd,IACA,MACA,SACsB;AACtB,QAAM,EAAE,UAAU,OAAO,WAAW,MAAM,QAAQ,IAAI,WAAW,CAAC;AAElE,MAAI,QAA8C;AAClD,MAAI,WAAiD;AACrD,MAAI,WAAiC;AACrC,MAAI,eAA8B;AAClC,MAAI,iBAAiB;AAErB,WAAS,OAAO,MAAoB;AAClC,qBAAiB;AACjB,QAAI,UAAU;AACZ,SAAG,GAAG,QAAQ;AACd,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,WAAS,WAAW,UAAwB;AAC1C,QAAI,MAAO,cAAa,KAAK;AAC7B,YAAQ,WAAW,MAAM;AACvB,YAAM,MAAM,KAAK,IAAI;AACrB,UAAI,YAAY,UAAU;AACxB,eAAO,GAAG;AAAA,MACZ;AACA,cAAQ;AACR,qBAAe;AAAA,IACjB,GAAG,QAAQ;AAAA,EACb;AAEA,WAAS,gBAAsB;AAC7B,QAAI,YAAY,UAAa,SAAU;AACvC,eAAW,WAAW,MAAM;AAC1B,UAAI,UAAU;AACZ,eAAO,KAAK,IAAI,CAAC;AACjB,YAAI,OAAO;AACT,uBAAa,KAAK;AAClB,kBAAQ;AAAA,QACV;AACA,uBAAe;AAAA,MACjB;AAAA,IACF,GAAG,OAAO;AAAA,EACZ;AAEA,WAAS,iBAAuB;AAC9B,QAAI,OAAO;AACT,mBAAa,KAAK;AAClB,cAAQ;AAAA,IACV;AACA,QAAI,UAAU;AACZ,mBAAa,QAAQ;AACrB,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,WAAS,aAAa,MAAuB;AAC3C,QAAI,iBAAiB,KAAM,QAAO;AAClC,UAAM,oBAAoB,OAAO;AACjC,UAAM,sBAAsB,OAAO;AACnC,WACE,qBAAqB,QACpB,YAAY,UAAa,uBAAuB;AAAA,EAErD;AAEA,QAAM,YAAY,YAA4B,MAA2B;AACvE,UAAM,OAAO,KAAK,IAAI;AACtB,UAAM,aAAa,aAAa,IAAI;AAEpC,eAAW;AACX,mBAAe;AAEf,QAAI,cAAc,CAAC,SAAS,SAAS;AACnC,aAAO,IAAI;AAAA,IACb;AAEA,QAAI,CAAC,OAAO;AACV,iBAAW,IAAI;AACf,UAAI,YAAY,QAAW;AACzB,sBAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,YAAU,SAAS,MAAY;AAC7B,mBAAe;AACf,eAAW;AACX,mBAAe;AACf,qBAAiB;AAAA,EACnB;AAEA,YAAU,QAAQ,MAAY;AAC5B,QAAI,SAAS,UAAU;AACrB,aAAO,KAAK,IAAI,CAAC;AACjB,qBAAe;AACf,qBAAe;AAAA,IACjB;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,SACd,IACA,MACkC;AAClC,MAAI,WAAW;AACf,MAAI,QAA8C;AAClD,MAAI,WAAiC;AAErC,QAAM,YAAY,YAA4B,MAA2B;AACvE,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,YAAY,QAAQ,MAAM;AAEhC,QAAI,aAAa,GAAG;AAClB,UAAI,OAAO;AACT,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACV;AACA,iBAAW;AACX,iBAAW;AACX,SAAG,MAAM,MAAM,IAAI;AAAA,IACrB,OAAO;AACL,iBAAW;AACX,UAAI,CAAC,OAAO;AACV,gBAAQ,WAAW,MAAM;AACvB,qBAAW,KAAK,IAAI;AACpB,kBAAQ;AACR,cAAI,UAAU;AACZ,eAAG,MAAM,MAAM,QAAQ;AACvB,uBAAW;AAAA,UACb;AAAA,QACF,GAAG,SAAS;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,QACd,IACA,UACqB;AACrB,QAAM,QAAQ,oBAAI,IAA2B;AAE7C,QAAM,WAAW,YAA4B,MAAoC;AAC/E,UAAM,MAAM,WAAW,SAAS,GAAG,IAAI,IAAI,OAAO,KAAK,CAAC,CAAC;AACzD,QAAI,MAAM,IAAI,GAAG,GAAG;AAClB,aAAO,MAAM,IAAI,GAAG;AAAA,IACtB;AACA,UAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAClC,UAAM,IAAI,KAAK,MAAM;AACrB,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ;AAEjB,SAAO;AACT;AASO,SAAS,MACd,IACA,SACY;AACZ,QAAM;AAAA,IACJ,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,cAAc,MAAM;AAAA,EACtB,IAAI,WAAW,CAAC;AAEhB,MAAI,UAAU;AAEd,QAAM,UAAU,MAAkB;AAChC;AACA,WAAO,GAAG,EAAE,MAAM,CAAC,UAAmB;AACpC,UAAI,WAAW,YAAY,CAAC,YAAY,KAAK,GAAG;AAC9C,cAAM;AAAA,MACR;AAEA,YAAM,QAAQ,KAAK;AAAA,QACjB,YAAY,KAAK,IAAI,GAAG,UAAU,CAAC,IAAI,KAAK,OAAO,IAAI;AAAA,QACvD;AAAA,MACF;AAEA,aAAO,IAAI,QAAW,aAAW;AAC/B,mBAAW,MAAM;AACf,kBAAQ,QAAQ,CAAC;AAAA,QACnB,GAAG,KAAK;AAAA,MACV,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,SAAO,QAAQ;AACjB;AAKO,SAAS,OAAa;AAC3B,SAAO;AACT;AAQO,SAAS,SAAY,OAAa;AACvC,SAAO;AACT;AASO,SAAS,KACd,IAC2C;AAC3C,MAAI,SAAS;AACb,MAAI;AAEJ,SAAO,YAA4B,MAAoC;AACrE,QAAI,CAAC,QAAQ;AACX,eAAS;AACT,eAAS,GAAG,MAAM,MAAM,IAAI;AAAA,IAC9B;AACA,WAAO;AAAA,EACT;AACF;","names":[]}
|
|
1
|
+
{"version":3,"sources":["../../src/core/index.ts"],"sourcesContent":["export interface DebounceOptions {\r\n leading?: boolean\r\n trailing?: boolean\r\n maxWait?: number\r\n}\r\n\r\nexport interface DebouncedFunction<T extends (...args: unknown[]) => unknown> {\r\n (...args: Parameters<T>): void\r\n cancel(): void\r\n flush(): void\r\n}\r\n\r\nexport interface MemoizedFunction<T extends (...args: unknown[]) => unknown> {\r\n (...args: Parameters<T>): ReturnType<T>\r\n cache: Map<string, ReturnType<T>>\r\n}\r\n\r\nexport interface RetryOptions {\r\n attempts?: number\r\n baseDelay?: number\r\n maxDelay?: number\r\n shouldRetry?: (error: unknown) => boolean\r\n}\r\n\r\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\r\n if (value === null || typeof value !== 'object') return false\r\n const proto = Object.getPrototypeOf(value)\r\n return proto === Object.prototype || proto === null\r\n}\r\n\r\nfunction getType(value: unknown): string {\r\n return Object.prototype.toString.call(value)\r\n}\r\n\r\nfunction clone<T>(value: T, seen: WeakMap<object, unknown>): T {\r\n if (value === null || typeof value !== 'object') return value\r\n\r\n if (seen.has(value as object)) return seen.get(value as object) as T\r\n\r\n const tag = getType(value)\r\n\r\n if (tag === '[object Date]') {\r\n const cloned = new Date((value as unknown as Date).getTime())\r\n seen.set(value as object, cloned)\r\n return cloned as unknown as T\r\n }\r\n\r\n if (tag === '[object RegExp]') {\r\n const regExp = value as unknown as RegExp\r\n const cloned = new RegExp(regExp.source, regExp.flags)\r\n cloned.lastIndex = regExp.lastIndex\r\n seen.set(value as object, cloned)\r\n return cloned as unknown as T\r\n }\r\n\r\n if (tag === '[object Map]') {\r\n const cloned = new Map<unknown, unknown>()\r\n seen.set(value as object, cloned)\r\n ;(value as unknown as Map<unknown, unknown>).forEach((v, k) => {\r\n cloned.set(clone(k, seen), clone(v, seen))\r\n })\r\n return cloned as unknown as T\r\n }\r\n\r\n if (tag === '[object Set]') {\r\n const cloned = new Set<unknown>()\r\n seen.set(value as object, cloned)\r\n ;(value as unknown as Set<unknown>).forEach(v => {\r\n cloned.add(clone(v, seen))\r\n })\r\n return cloned as unknown as T\r\n }\r\n\r\n if (Array.isArray(value)) {\r\n const cloned: unknown[] = []\r\n seen.set(value as object, cloned)\r\n for (let i = 0; i < value.length; i++) {\r\n cloned[i] = clone(value[i], seen)\r\n }\r\n return cloned as unknown as T\r\n }\r\n\r\n if (tag === '[object Object]') {\r\n const cloned: Record<string, unknown> = {}\r\n seen.set(value as object, cloned)\r\n const keys = Object.keys(value as Record<string, unknown>)\r\n for (let i = 0; i < keys.length; i++) {\r\n const key = keys[i]!\r\n cloned[key] = clone((value as Record<string, unknown>)[key], seen)\r\n }\r\n return cloned as unknown as T\r\n }\r\n\r\n return value\r\n}\r\n\r\n/**\r\n * Deep clone a value, supporting objects, arrays, Date, RegExp, Map, Set,\r\n * and cyclic references.\r\n *\r\n * @param value - The value to clone.\r\n * @returns A deep copy of the input value.\r\n */\r\nexport function deepClone<T>(value: T): T {\r\n const seen = new WeakMap<object, unknown>()\r\n return clone(value, seen)\r\n}\r\n\r\n/**\r\n * Deep merge multiple objects. Arrays are overwritten, not concatenated.\r\n * `null` and `undefined` source objects are skipped.\r\n *\r\n * @param objects - The objects to merge.\r\n * @returns A new object with merged properties.\r\n */\r\nexport function deepMerge<T extends Record<string, unknown>>(...objects: Partial<T>[]): T {\r\n const result = {} as T\r\n\r\n for (let i = 0; i < objects.length; i++) {\r\n const obj = objects[i]\r\n if (obj === null || obj === undefined) continue\r\n\r\n const keys = Object.keys(obj) as (keyof T)[]\r\n for (let j = 0; j < keys.length; j++) {\r\n const key = keys[j]!\r\n const val = obj[key]\r\n const existing = result[key]\r\n\r\n if (val !== undefined && isPlainObject(val) && isPlainObject(existing)) {\r\n result[key] = deepMerge(\r\n existing as Record<string, unknown>,\r\n val as Record<string, unknown>\r\n ) as T[keyof T]\r\n } else if (val !== undefined) {\r\n result[key] = val as T[keyof T]\r\n }\r\n }\r\n }\r\n\r\n return result\r\n}\r\n\r\n/**\r\n * Creates a debounced function that delays invoking `fn` until after `wait`\r\n * milliseconds have elapsed since the last invocation. Supports leading,\r\n * trailing, and maxWait options. The returned function also has `.cancel()`\r\n * and `.flush()` methods.\r\n *\r\n * @param fn - The function to debounce.\r\n * @param wait - The number of milliseconds to delay.\r\n * @param options - Optional configuration.\r\n * @returns A debounced function with `.cancel()` and `.flush()`.\r\n */\r\nexport function debounce<T extends (...args: unknown[]) => unknown>(\r\n fn: T,\r\n wait: number,\r\n options?: DebounceOptions\r\n): DebouncedFunction<T> {\r\n const { leading = false, trailing = true, maxWait } = options ?? {}\r\n\r\n let timer: ReturnType<typeof setTimeout> | null = null\r\n let maxTimer: ReturnType<typeof setTimeout> | null = null\r\n let lastArgs: Parameters<T> | null = null\r\n let lastCallTime: number | null = null\r\n let lastInvokeTime = 0\r\n\r\n function invoke(time: number): void {\r\n lastInvokeTime = time\r\n if (lastArgs) {\r\n fn(...lastArgs)\r\n lastArgs = null\r\n }\r\n }\r\n\r\n function startTimer(waitTime: number): void {\r\n if (timer) clearTimeout(timer)\r\n timer = setTimeout(() => {\r\n const now = Date.now()\r\n if (lastArgs && trailing) {\r\n invoke(now)\r\n }\r\n timer = null\r\n lastCallTime = null\r\n }, waitTime)\r\n }\r\n\r\n function startMaxTimer(): void {\r\n if (maxWait === undefined || maxTimer) return\r\n maxTimer = setTimeout(() => {\r\n if (lastArgs) {\r\n invoke(Date.now())\r\n if (timer) {\r\n clearTimeout(timer)\r\n timer = null\r\n }\r\n lastCallTime = null\r\n }\r\n }, maxWait)\r\n }\r\n\r\n function clearAllTimers(): void {\r\n if (timer) {\r\n clearTimeout(timer)\r\n timer = null\r\n }\r\n if (maxTimer) {\r\n clearTimeout(maxTimer)\r\n maxTimer = null\r\n }\r\n }\r\n\r\n function shouldInvoke(time: number): boolean {\r\n if (lastCallTime === null) return true\r\n const timeSinceLastCall = time - lastCallTime\r\n const timeSinceLastInvoke = time - lastInvokeTime\r\n return (\r\n timeSinceLastCall >= wait ||\r\n (maxWait !== undefined && timeSinceLastInvoke >= maxWait)\r\n )\r\n }\r\n\r\n const debounced = function (this: unknown, ...args: Parameters<T>): void {\r\n const time = Date.now()\r\n const isInvoking = shouldInvoke(time)\r\n\r\n lastArgs = args\r\n lastCallTime = time\r\n\r\n if (isInvoking && !timer && leading) {\r\n invoke(time)\r\n }\r\n\r\n if (!timer) {\r\n startTimer(wait)\r\n if (maxWait !== undefined) {\r\n startMaxTimer()\r\n }\r\n }\r\n } as DebouncedFunction<T>\r\n\r\n debounced.cancel = (): void => {\r\n clearAllTimers()\r\n lastArgs = null\r\n lastCallTime = null\r\n lastInvokeTime = 0\r\n }\r\n\r\n debounced.flush = (): void => {\r\n if (timer && lastArgs) {\r\n invoke(Date.now())\r\n clearAllTimers()\r\n lastCallTime = null\r\n }\r\n }\r\n\r\n return debounced\r\n}\r\n\r\n/**\r\n * Creates a throttled function that only invokes `fn` at most once per\r\n * `wait` milliseconds.\r\n *\r\n * @param fn - The function to throttle.\r\n * @param wait - The number of milliseconds to throttle invocations to.\r\n * @returns A throttled function.\r\n */\r\nexport function throttle<T extends (...args: unknown[]) => unknown>(\r\n fn: T,\r\n wait: number\r\n): (...args: Parameters<T>) => void {\r\n let lastTime = 0\r\n let timer: ReturnType<typeof setTimeout> | null = null\r\n let lastArgs: Parameters<T> | null = null\r\n\r\n const throttled = function (this: unknown, ...args: Parameters<T>): void {\r\n const now = Date.now()\r\n const remaining = wait - (now - lastTime)\r\n\r\n if (remaining <= 0) {\r\n if (timer) {\r\n clearTimeout(timer)\r\n timer = null\r\n }\r\n lastTime = now\r\n lastArgs = null\r\n fn.apply(this, args)\r\n } else {\r\n lastArgs = args\r\n if (!timer) {\r\n timer = setTimeout(() => {\r\n lastTime = Date.now()\r\n timer = null\r\n if (lastArgs) {\r\n fn.apply(this, lastArgs)\r\n lastArgs = null\r\n }\r\n }, remaining)\r\n }\r\n }\r\n }\r\n\r\n return throttled\r\n}\r\n\r\n/**\r\n * Creates a memoized version of `fn`. Uses a `Map` cache keyed by the\r\n * first argument by default, or by a custom `resolver` function.\r\n *\r\n * @param fn - The function to memoize.\r\n * @param resolver - Optional function to determine the cache key.\r\n * @returns The memoized function with a `.cache` property.\r\n */\r\nexport function memoize<T extends (...args: unknown[]) => unknown>(\r\n fn: T,\r\n resolver?: (...args: Parameters<T>) => string\r\n): MemoizedFunction<T> {\r\n const cache = new Map<string, ReturnType<T>>()\r\n\r\n const memoized = function (this: unknown, ...args: Parameters<T>): ReturnType<T> {\r\n const key = resolver ? resolver(...args) : String(args[0])\r\n if (cache.has(key)) {\r\n return cache.get(key) as ReturnType<T>\r\n }\r\n const result = fn.apply(this, args) as ReturnType<T>\r\n cache.set(key, result)\r\n return result\r\n }\r\n\r\n memoized.cache = cache\r\n\r\n return memoized as MemoizedFunction<T>\r\n}\r\n\r\n/**\r\n * Retries an async function with exponential backoff and jitter.\r\n *\r\n * @param fn - The async function to retry.\r\n * @param options - Retry configuration.\r\n * @returns A promise that resolves with the function result.\r\n */\r\nexport function retry<T>(\r\n fn: () => Promise<T>,\r\n options?: RetryOptions\r\n): Promise<T> {\r\n const {\r\n attempts = 3,\r\n baseDelay = 1000,\r\n maxDelay = 30000,\r\n shouldRetry = () => true,\r\n } = options ?? {}\r\n\r\n let attempt = 0\r\n\r\n const execute = (): Promise<T> => {\r\n attempt++\r\n return fn().catch((error: unknown) => {\r\n if (attempt >= attempts || !shouldRetry(error)) {\r\n throw error\r\n }\r\n\r\n const delay = Math.min(\r\n baseDelay * Math.pow(2, attempt - 1) + Math.random() * baseDelay,\r\n maxDelay\r\n )\r\n\r\n return new Promise<T>(resolve => {\r\n setTimeout(() => {\r\n resolve(execute())\r\n }, delay)\r\n })\r\n })\r\n }\r\n\r\n return execute()\r\n}\r\n\r\n/**\r\n * A no-operation function that returns `undefined`.\r\n */\r\nexport function noop(): void {\r\n return undefined\r\n}\r\n\r\n/**\r\n * Returns the given value unchanged.\r\n *\r\n * @param value - The value to return.\r\n * @returns The same value.\r\n */\r\nexport function identity<T>(value: T): T {\r\n return value\r\n}\r\n\r\n/**\r\n * Creates a function that invokes `fn` only once. Subsequent calls return\r\n * the result of the first invocation.\r\n *\r\n * @param fn - The function to wrap.\r\n * @returns A function that runs only once.\r\n */\r\nexport function once<T extends (...args: unknown[]) => unknown>(\r\n fn: T\r\n): (...args: Parameters<T>) => ReturnType<T> {\r\n let called = false\r\n let result: ReturnType<T>\r\n\r\n return function (this: unknown, ...args: Parameters<T>): ReturnType<T> {\r\n if (!called) {\r\n called = true\r\n result = fn.apply(this, args) as ReturnType<T>\r\n }\r\n return result\r\n }\r\n}\r\n\r\n/**\r\n * Deep equality check between two values. Supports primitives, objects,\r\n * arrays, Date, RegExp, Map, Set, and nested structures. Circular\r\n * references are handled.\r\n *\r\n * @example deepEqual({ a: 1, b: { c: 2 } }, { a: 1, b: { c: 2 } }) // true\r\n * @example deepEqual({ a: 1 }, { a: 2 }) // false\r\n */\r\nexport function deepEqual(a: unknown, b: unknown): boolean {\r\n if (Object.is(a, b)) return true\r\n if (a === null || b === null || typeof a !== typeof b) return false\r\n if (typeof a !== 'object') return false\r\n\r\n const aObj = a as Record<string, unknown>\r\n const bObj = b as Record<string, unknown>\r\n\r\n if (Array.isArray(a) && Array.isArray(b)) {\r\n if (a.length !== b.length) return false\r\n for (let i = 0; i < a.length; i++) {\r\n if (!deepEqual(a[i], b[i])) return false\r\n }\r\n return true\r\n }\r\n\r\n if (a instanceof Date && b instanceof Date) {\r\n return a.getTime() === b.getTime()\r\n }\r\n\r\n if (a instanceof RegExp && b instanceof RegExp) {\r\n return a.source === b.source && a.flags === b.flags\r\n }\r\n\r\n if (a instanceof Map && b instanceof Map) {\r\n if (a.size !== b.size) return false\r\n for (const [k, v] of a) {\r\n if (!b.has(k) || !deepEqual(v, b.get(k))) return false\r\n }\r\n return true\r\n }\r\n\r\n if (a instanceof Set && b instanceof Set) {\r\n if (a.size !== b.size) return false\r\n for (const v of a) {\r\n if (!b.has(v)) return false\r\n }\r\n return true\r\n }\r\n\r\n const keysA = Object.keys(aObj)\r\n const keysB = Object.keys(bObj)\r\n if (keysA.length !== keysB.length) return false\r\n\r\n for (const key of keysA) {\r\n if (!Object.prototype.hasOwnProperty.call(bObj, key)) return false\r\n if (!deepEqual(aObj[key], bObj[key])) return false\r\n }\r\n return true\r\n}\r\n\r\n/**\r\n * Performs left-to-right function composition.\r\n *\r\n * @example const fn = pipe((x: number) => x + 1, (x: number) => x * 2)\r\n * fn(3) // 8\r\n */\r\nexport function pipe<T>(initial: T, ...fns: Array<(arg: T) => T>): T\r\nexport function pipe<T, R>(initial: T, ...fns: Array<(arg: unknown) => unknown>): R\r\nexport function pipe(initial: unknown, ...fns: Array<(arg: unknown) => unknown>): unknown {\r\n return fns.reduce((acc, fn) => fn(acc), initial)\r\n}\r\n\r\n/**\r\n * Performs right-to-left function composition.\r\n *\r\n * @example const fn = compose((x: number) => x * 2, (x: number) => x + 1)\r\n * fn(3) // 8 — same as (3+1)*2\r\n */\r\nexport function compose<T>(...fns: Array<(arg: T) => T>): (initial: T) => T\r\nexport function compose(...fns: Array<(arg: unknown) => unknown>): (initial: unknown) => unknown {\r\n return (initial: unknown) => fns.reduceRight((acc, fn) => fn(acc), initial)\r\n}\r\n"],"mappings":";AAwBA,SAAS,cAAc,OAAkD;AACvE,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,QAAM,QAAQ,OAAO,eAAe,KAAK;AACzC,SAAO,UAAU,OAAO,aAAa,UAAU;AACjD;AAEA,SAAS,QAAQ,OAAwB;AACvC,SAAO,OAAO,UAAU,SAAS,KAAK,KAAK;AAC7C;AAEA,SAAS,MAAS,OAAU,MAAmC;AAC7D,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AAExD,MAAI,KAAK,IAAI,KAAe,EAAG,QAAO,KAAK,IAAI,KAAe;AAE9D,QAAM,MAAM,QAAQ,KAAK;AAEzB,MAAI,QAAQ,iBAAiB;AAC3B,UAAM,SAAS,IAAI,KAAM,MAA0B,QAAQ,CAAC;AAC5D,SAAK,IAAI,OAAiB,MAAM;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,UAAM,SAAS;AACf,UAAM,SAAS,IAAI,OAAO,OAAO,QAAQ,OAAO,KAAK;AACrD,WAAO,YAAY,OAAO;AAC1B,SAAK,IAAI,OAAiB,MAAM;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,UAAM,SAAS,oBAAI,IAAsB;AACzC,SAAK,IAAI,OAAiB,MAAM;AAC/B,IAAC,MAA2C,QAAQ,CAAC,GAAG,MAAM;AAC7D,aAAO,IAAI,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;AAAA,IAC3C,CAAC;AACD,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,UAAM,SAAS,oBAAI,IAAa;AAChC,SAAK,IAAI,OAAiB,MAAM;AAC/B,IAAC,MAAkC,QAAQ,OAAK;AAC/C,aAAO,IAAI,MAAM,GAAG,IAAI,CAAC;AAAA,IAC3B,CAAC;AACD,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,SAAoB,CAAC;AAC3B,SAAK,IAAI,OAAiB,MAAM;AAChC,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,aAAO,CAAC,IAAI,MAAM,MAAM,CAAC,GAAG,IAAI;AAAA,IAClC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,UAAM,SAAkC,CAAC;AACzC,SAAK,IAAI,OAAiB,MAAM;AAChC,UAAM,OAAO,OAAO,KAAK,KAAgC;AACzD,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,aAAO,GAAG,IAAI,MAAO,MAAkC,GAAG,GAAG,IAAI;AAAA,IACnE;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AASO,SAAS,UAAa,OAAa;AACxC,QAAM,OAAO,oBAAI,QAAyB;AAC1C,SAAO,MAAM,OAAO,IAAI;AAC1B;AASO,SAAS,aAAgD,SAA0B;AACxF,QAAM,SAAS,CAAC;AAEhB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,MAAM,QAAQ,CAAC;AACrB,QAAI,QAAQ,QAAQ,QAAQ,OAAW;AAEvC,UAAM,OAAO,OAAO,KAAK,GAAG;AAC5B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,MAAM,IAAI,GAAG;AACnB,YAAM,WAAW,OAAO,GAAG;AAE3B,UAAI,QAAQ,UAAa,cAAc,GAAG,KAAK,cAAc,QAAQ,GAAG;AACtE,eAAO,GAAG,IAAI;AAAA,UACZ;AAAA,UACA;AAAA,QACF;AAAA,MACF,WAAW,QAAQ,QAAW;AAC5B,eAAO,GAAG,IAAI;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAaO,SAAS,SACd,IACA,MACA,SACsB;AACtB,QAAM,EAAE,UAAU,OAAO,WAAW,MAAM,QAAQ,IAAI,WAAW,CAAC;AAElE,MAAI,QAA8C;AAClD,MAAI,WAAiD;AACrD,MAAI,WAAiC;AACrC,MAAI,eAA8B;AAClC,MAAI,iBAAiB;AAErB,WAAS,OAAO,MAAoB;AAClC,qBAAiB;AACjB,QAAI,UAAU;AACZ,SAAG,GAAG,QAAQ;AACd,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,WAAS,WAAW,UAAwB;AAC1C,QAAI,MAAO,cAAa,KAAK;AAC7B,YAAQ,WAAW,MAAM;AACvB,YAAM,MAAM,KAAK,IAAI;AACrB,UAAI,YAAY,UAAU;AACxB,eAAO,GAAG;AAAA,MACZ;AACA,cAAQ;AACR,qBAAe;AAAA,IACjB,GAAG,QAAQ;AAAA,EACb;AAEA,WAAS,gBAAsB;AAC7B,QAAI,YAAY,UAAa,SAAU;AACvC,eAAW,WAAW,MAAM;AAC1B,UAAI,UAAU;AACZ,eAAO,KAAK,IAAI,CAAC;AACjB,YAAI,OAAO;AACT,uBAAa,KAAK;AAClB,kBAAQ;AAAA,QACV;AACA,uBAAe;AAAA,MACjB;AAAA,IACF,GAAG,OAAO;AAAA,EACZ;AAEA,WAAS,iBAAuB;AAC9B,QAAI,OAAO;AACT,mBAAa,KAAK;AAClB,cAAQ;AAAA,IACV;AACA,QAAI,UAAU;AACZ,mBAAa,QAAQ;AACrB,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,WAAS,aAAa,MAAuB;AAC3C,QAAI,iBAAiB,KAAM,QAAO;AAClC,UAAM,oBAAoB,OAAO;AACjC,UAAM,sBAAsB,OAAO;AACnC,WACE,qBAAqB,QACpB,YAAY,UAAa,uBAAuB;AAAA,EAErD;AAEA,QAAM,YAAY,YAA4B,MAA2B;AACvE,UAAM,OAAO,KAAK,IAAI;AACtB,UAAM,aAAa,aAAa,IAAI;AAEpC,eAAW;AACX,mBAAe;AAEf,QAAI,cAAc,CAAC,SAAS,SAAS;AACnC,aAAO,IAAI;AAAA,IACb;AAEA,QAAI,CAAC,OAAO;AACV,iBAAW,IAAI;AACf,UAAI,YAAY,QAAW;AACzB,sBAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,YAAU,SAAS,MAAY;AAC7B,mBAAe;AACf,eAAW;AACX,mBAAe;AACf,qBAAiB;AAAA,EACnB;AAEA,YAAU,QAAQ,MAAY;AAC5B,QAAI,SAAS,UAAU;AACrB,aAAO,KAAK,IAAI,CAAC;AACjB,qBAAe;AACf,qBAAe;AAAA,IACjB;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,SACd,IACA,MACkC;AAClC,MAAI,WAAW;AACf,MAAI,QAA8C;AAClD,MAAI,WAAiC;AAErC,QAAM,YAAY,YAA4B,MAA2B;AACvE,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,YAAY,QAAQ,MAAM;AAEhC,QAAI,aAAa,GAAG;AAClB,UAAI,OAAO;AACT,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACV;AACA,iBAAW;AACX,iBAAW;AACX,SAAG,MAAM,MAAM,IAAI;AAAA,IACrB,OAAO;AACL,iBAAW;AACX,UAAI,CAAC,OAAO;AACV,gBAAQ,WAAW,MAAM;AACvB,qBAAW,KAAK,IAAI;AACpB,kBAAQ;AACR,cAAI,UAAU;AACZ,eAAG,MAAM,MAAM,QAAQ;AACvB,uBAAW;AAAA,UACb;AAAA,QACF,GAAG,SAAS;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,QACd,IACA,UACqB;AACrB,QAAM,QAAQ,oBAAI,IAA2B;AAE7C,QAAM,WAAW,YAA4B,MAAoC;AAC/E,UAAM,MAAM,WAAW,SAAS,GAAG,IAAI,IAAI,OAAO,KAAK,CAAC,CAAC;AACzD,QAAI,MAAM,IAAI,GAAG,GAAG;AAClB,aAAO,MAAM,IAAI,GAAG;AAAA,IACtB;AACA,UAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAClC,UAAM,IAAI,KAAK,MAAM;AACrB,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ;AAEjB,SAAO;AACT;AASO,SAAS,MACd,IACA,SACY;AACZ,QAAM;AAAA,IACJ,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,cAAc,MAAM;AAAA,EACtB,IAAI,WAAW,CAAC;AAEhB,MAAI,UAAU;AAEd,QAAM,UAAU,MAAkB;AAChC;AACA,WAAO,GAAG,EAAE,MAAM,CAAC,UAAmB;AACpC,UAAI,WAAW,YAAY,CAAC,YAAY,KAAK,GAAG;AAC9C,cAAM;AAAA,MACR;AAEA,YAAM,QAAQ,KAAK;AAAA,QACjB,YAAY,KAAK,IAAI,GAAG,UAAU,CAAC,IAAI,KAAK,OAAO,IAAI;AAAA,QACvD;AAAA,MACF;AAEA,aAAO,IAAI,QAAW,aAAW;AAC/B,mBAAW,MAAM;AACf,kBAAQ,QAAQ,CAAC;AAAA,QACnB,GAAG,KAAK;AAAA,MACV,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,SAAO,QAAQ;AACjB;AAKO,SAAS,OAAa;AAC3B,SAAO;AACT;AAQO,SAAS,SAAY,OAAa;AACvC,SAAO;AACT;AASO,SAAS,KACd,IAC2C;AAC3C,MAAI,SAAS;AACb,MAAI;AAEJ,SAAO,YAA4B,MAAoC;AACrE,QAAI,CAAC,QAAQ;AACX,eAAS;AACT,eAAS,GAAG,MAAM,MAAM,IAAI;AAAA,IAC9B;AACA,WAAO;AAAA,EACT;AACF;AAUO,SAAS,UAAU,GAAY,GAAqB;AACzD,MAAI,OAAO,GAAG,GAAG,CAAC,EAAG,QAAO;AAC5B,MAAI,MAAM,QAAQ,MAAM,QAAQ,OAAO,MAAM,OAAO,EAAG,QAAO;AAC9D,MAAI,OAAO,MAAM,SAAU,QAAO;AAElC,QAAM,OAAO;AACb,QAAM,OAAO;AAEb,MAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;AACxC,QAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAI,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AAAA,IACrC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,WAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ;AAAA,EACnC;AAEA,MAAI,aAAa,UAAU,aAAa,QAAQ;AAC9C,WAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;AAAA,EAChD;AAEA,MAAI,aAAa,OAAO,aAAa,KAAK;AACxC,QAAI,EAAE,SAAS,EAAE,KAAM,QAAO;AAC9B,eAAW,CAAC,GAAG,CAAC,KAAK,GAAG;AACtB,UAAI,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,EAAE,IAAI,CAAC,CAAC,EAAG,QAAO;AAAA,IACnD;AACA,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,OAAO,aAAa,KAAK;AACxC,QAAI,EAAE,SAAS,EAAE,KAAM,QAAO;AAC9B,eAAW,KAAK,GAAG;AACjB,UAAI,CAAC,EAAE,IAAI,CAAC,EAAG,QAAO;AAAA,IACxB;AACA,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,OAAO,KAAK,IAAI;AAC9B,QAAM,QAAQ,OAAO,KAAK,IAAI;AAC9B,MAAI,MAAM,WAAW,MAAM,OAAQ,QAAO;AAE1C,aAAW,OAAO,OAAO;AACvB,QAAI,CAAC,OAAO,UAAU,eAAe,KAAK,MAAM,GAAG,EAAG,QAAO;AAC7D,QAAI,CAAC,UAAU,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC,EAAG,QAAO;AAAA,EAC/C;AACA,SAAO;AACT;AAUO,SAAS,KAAK,YAAqB,KAAgD;AACxF,SAAO,IAAI,OAAO,CAAC,KAAK,OAAO,GAAG,GAAG,GAAG,OAAO;AACjD;AASO,SAAS,WAAW,KAAsE;AAC/F,SAAO,CAAC,YAAqB,IAAI,YAAY,CAAC,KAAK,OAAO,GAAG,GAAG,GAAG,OAAO;AAC5E;","names":[]}
|
package/dist/index.d.ts
CHANGED
|
@@ -16,3 +16,4 @@ export { KNOWN_CVES, KNOWN_MAPPINGS } from './dep-exray/known-mappings.js';
|
|
|
16
16
|
export { isEmail, isNIK, isNPWP, isPhone, isURL } from './validation/index.js';
|
|
17
17
|
export { ErrorCode, MultiError, TypedError, collectErrors, createError, isTypedError } from './error/index.js';
|
|
18
18
|
export { L as LogLevel, a as Logger, T as Transport, c as consoleTransport, b as createBufferedTransport, d as createConsoleTransport, e as createFileTransport, f as createJsonTransport, l as logger } from './index-BgG21uJC.js';
|
|
19
|
+
export { contrastRatio, darken, hexToRgb, lighten, meetsWCAG, rgbToHex } from './color/index.js';
|
package/dist/index.js
CHANGED
|
@@ -2285,6 +2285,64 @@ function createBufferedTransport(transport, options) {
|
|
|
2285
2285
|
}
|
|
2286
2286
|
};
|
|
2287
2287
|
}
|
|
2288
|
+
|
|
2289
|
+
// src/color/index.ts
|
|
2290
|
+
function hexToRgb(hex) {
|
|
2291
|
+
let h = hex.replace("#", "");
|
|
2292
|
+
if (h.length === 3) h = h[0] + h[0] + h[1] + h[1] + h[2] + h[2];
|
|
2293
|
+
if (h.length !== 6) return null;
|
|
2294
|
+
const num = Number.parseInt(h, 16);
|
|
2295
|
+
if (isNaN(num)) return null;
|
|
2296
|
+
return {
|
|
2297
|
+
r: num >> 16 & 255,
|
|
2298
|
+
g: num >> 8 & 255,
|
|
2299
|
+
b: num & 255
|
|
2300
|
+
};
|
|
2301
|
+
}
|
|
2302
|
+
function rgbToHex(r, g, b) {
|
|
2303
|
+
const toHex = (n) => Math.max(0, Math.min(255, Math.round(n))).toString(16).padStart(2, "0");
|
|
2304
|
+
return "#" + toHex(r) + toHex(g) + toHex(b);
|
|
2305
|
+
}
|
|
2306
|
+
function lighten(hex, percent) {
|
|
2307
|
+
const rgb = hexToRgb(hex);
|
|
2308
|
+
if (!rgb) return hex;
|
|
2309
|
+
const factor = percent / 100;
|
|
2310
|
+
return rgbToHex(
|
|
2311
|
+
rgb.r + (255 - rgb.r) * factor,
|
|
2312
|
+
rgb.g + (255 - rgb.g) * factor,
|
|
2313
|
+
rgb.b + (255 - rgb.b) * factor
|
|
2314
|
+
);
|
|
2315
|
+
}
|
|
2316
|
+
function darken(hex, percent) {
|
|
2317
|
+
const rgb = hexToRgb(hex);
|
|
2318
|
+
if (!rgb) return hex;
|
|
2319
|
+
const factor = percent / 100;
|
|
2320
|
+
return rgbToHex(
|
|
2321
|
+
rgb.r * (1 - factor),
|
|
2322
|
+
rgb.g * (1 - factor),
|
|
2323
|
+
rgb.b * (1 - factor)
|
|
2324
|
+
);
|
|
2325
|
+
}
|
|
2326
|
+
function contrastRatio(hex1, hex2) {
|
|
2327
|
+
const lum1 = relativeLuminance(hex1);
|
|
2328
|
+
const lum2 = relativeLuminance(hex2);
|
|
2329
|
+
const lighter = Math.max(lum1, lum2);
|
|
2330
|
+
const darker = Math.min(lum1, lum2);
|
|
2331
|
+
return Number(((lighter + 0.05) / (darker + 0.05)).toFixed(2));
|
|
2332
|
+
}
|
|
2333
|
+
function relativeLuminance(hex) {
|
|
2334
|
+
const rgb = hexToRgb(hex);
|
|
2335
|
+
if (!rgb) return 0;
|
|
2336
|
+
const vals = [rgb.r / 255, rgb.g / 255, rgb.b / 255].map((c) => {
|
|
2337
|
+
return c <= 0.03928 ? c / 12.92 : Math.pow((c + 0.055) / 1.055, 2.4);
|
|
2338
|
+
});
|
|
2339
|
+
return 0.2126 * vals[0] + 0.7152 * vals[1] + 0.0722 * vals[2];
|
|
2340
|
+
}
|
|
2341
|
+
function meetsWCAG(hex1, hex2, level) {
|
|
2342
|
+
const ratio = contrastRatio(hex1, hex2);
|
|
2343
|
+
const threshold = level === "AAA" ? 7 : 4.5;
|
|
2344
|
+
return ratio >= threshold;
|
|
2345
|
+
}
|
|
2288
2346
|
export {
|
|
2289
2347
|
DivisionByZeroError,
|
|
2290
2348
|
InvalidDateError,
|
|
@@ -2318,12 +2376,14 @@ export {
|
|
|
2318
2376
|
collectErrors,
|
|
2319
2377
|
consoleTransport,
|
|
2320
2378
|
constantTimeEqual,
|
|
2379
|
+
contrastRatio,
|
|
2321
2380
|
countOccurrences,
|
|
2322
2381
|
createBufferedTransport,
|
|
2323
2382
|
createConsoleTransport,
|
|
2324
2383
|
createError,
|
|
2325
2384
|
createFileTransport,
|
|
2326
2385
|
createJsonTransport,
|
|
2386
|
+
darken,
|
|
2327
2387
|
dateDiff,
|
|
2328
2388
|
debounce,
|
|
2329
2389
|
deepClone,
|
|
@@ -2351,6 +2411,7 @@ export {
|
|
|
2351
2411
|
getType2 as getType,
|
|
2352
2412
|
groupBy,
|
|
2353
2413
|
hash,
|
|
2414
|
+
hexToRgb,
|
|
2354
2415
|
identity,
|
|
2355
2416
|
inRange,
|
|
2356
2417
|
isAbsolute,
|
|
@@ -2385,7 +2446,9 @@ export {
|
|
|
2385
2446
|
kebabCase,
|
|
2386
2447
|
keyBy,
|
|
2387
2448
|
last,
|
|
2449
|
+
lighten,
|
|
2388
2450
|
logger,
|
|
2451
|
+
meetsWCAG,
|
|
2389
2452
|
memoize,
|
|
2390
2453
|
mul,
|
|
2391
2454
|
nanoid,
|
|
@@ -2413,6 +2476,7 @@ export {
|
|
|
2413
2476
|
retry,
|
|
2414
2477
|
retryAsync,
|
|
2415
2478
|
reverse,
|
|
2479
|
+
rgbToHex,
|
|
2416
2480
|
round,
|
|
2417
2481
|
safeJsonParse,
|
|
2418
2482
|
sample,
|