superjs-core 0.3.9 → 0.4.1

package/README.md

@@ -1,179 +1,167 @@
 # superjs-core
 
-> **All-in-one JavaScript toolkit — Standard Library + Dependency Scanner + 🇮🇩 Indonesia Validation + Logger + Typed Errors**
+> **JavaScript toolkit all-in-one buat developer Indonesia — Standard Library + Dependency Scanner + 🇮🇩 Validasi NIK/NPWP/Phone + Logger + Typed Errors**
 
 ```bash
 npm install superjs-core
 ```
 
-One package for all your JavaScript needs: utility functions, async helpers, crypto, path manipulation, typed errors, structured logging, **plus** dependency health scanner and Indonesia-specific data validation (NIK, NPWP, Phone).
+Satu package buat semua kebutuhan JavaScript lo: utility functions, async helpers, crypto, path manipulation, typed errors, structured logging, **plus** dependency health scanner dan validasi data Indonesia (NIK, NPWP, Phone).
+
+**100% buat programmer Indonesia. Zero dependency runtime.**
 
 ---
 
-## Features
+## Fitur Unggulan 🇮🇩
 
-- ✅ **90+ functions** — 16 modules covering everything from `deepClone` to `terbilang`
-- ✅ **Tree-shakeable** — import only what you need via subpath exports
-- ✅ **TypeScript strict** — full type safety, zero `any`
-- ✅ **Zero runtime dependencies** — commander + picocolors are CLI-only
-- ✅ **ESM-first** — target ES2022, optimized for Node 18+ and modern browsers
-- ✅ **Biome linted** — consistent code style enforced
+| Fitur | Fungsi |
+|-------|--------|
+| **Validasi NIK** | `isNIK('3201010203940001')` — validasi 16 digit + tanggal lahir |
+| **Validasi NPWP** | `isNPWP('12.345.678.9-012.344')` — dengan checksum otomatis |
+| **Validasi Nomor HP** | `isPhone('08123456789')` — support semua prefix Indonesia |
+| **Terbilang** | `terbilang(1500000)` → "satu juta lima ratus ribu" |
+| **Format Rupiah** | `formatRupiah(1500000)` → "Rp1.500.000" |
+| **Format Waktu** | `timeAgo(new Date(...))` → "5 detik yang lalu" |
+| **Timezone WIB/WITA/WIT** | `formatInTimezone(date, 'HH', TIMEZONE_WIB)` → "07" |
+| **Dependency Scanner** | `npx dep-exray .` — scan project lo |
 
 ---
 
-## Modules
+## 16 Modules
 
-| Module | Key Functions |
-|--------|---------------|
-| **core** | deepClone, deepMerge, debounce, throttle, memoize, retry, once |
-| **math** | add/sub/mul/div (safe float), median, stddev, percentile, correlation, formatCurrency |
-| **date** | formatDate, parseDate, timeAgo, Duration, timezone helpers (WIB/WITA/WIT) |
-| **collection** | sortBy, groupBy, shuffle, topoSort, slidingWindows, chunk |
-| **string** | camelCase, uuid, nanoid, slugify, levenshtein, fuzzyMatch, maskString |
+| Module | Fungsi Unggulan |
+|--------|----------------|
+| **core** | deepClone, deepMerge, debounce, deepEqual, pipe, throttle, memoize |
+| **math** | add/sub/mul/div (safe float), median, stddev, percentile, formatCurrency |
+| **date** | formatDate, timeAgo, Duration, timezone helpers (WIB/WITA/WIT) |
+| **collection** | sortBy, groupBy, shuffle, topoSort, slidingWindows, deepGet, deepSet |
+| **string** | camelCase, uuid, nanoid, slugify, **terbilang**, **formatRupiah**, maskString, formatBytes |
 | **async** | sleep, parallelMap, Queue, Semaphore, memoizeAsync, retryAsync |
-| **io** | parseCsv, stringifyCsv, safeJsonParse, env, envInt, envBool |
+| **io** | parseCsv, stringifyCsv, safeJsonParse, env |
 | **type** | 20+ type guards (isString, isNil, assertDefined, getType) |
 | **crypto** | hash, base64, generateToken, generateOTP, constantTimeEqual |
 | **path** | join, resolve, basename, dirname, extname, normalize |
-| **validation** | isNIK, isNPWP, isPhone("id"), isEmail, isURL |
+| **color** | hexToRgb, rgbToHex, lighten, darken, contrastRatio, meetsWCAG |
+| **validation** | **isNIK**, **isNPWP**, **isPhone("id")**, isEmail, isURL |
 | **error** | createError (typed + HTTP status), TypedError, MultiError |
 | **logger** | Logger class, child loggers, console/JSON/file transports |
 | **dep-exray** | scanProject, generateReport, analyzeUsage, CLI: `npx dep-exray .` |
 
-### 🇮🇩 Indonesian Locale
-
-| Function | Description |
-|----------|-------------|
-| `terbilang(value)` | Convert numbers to Indonesian words ("satu juta lima ratus ribu") |
-| `formatRupiah(value)` | Format as Rupiah ("Rp1.500.000") |
-| `isNIK(value)` | Validate Indonesian NIK (16-digit ID number) |
-| `isNPWP(value)` | Validate Indonesian NPWP (tax ID with checksum) |
-| `isPhone(value)` | Validate Indonesian phone numbers |
-
 ---
 
-## Quick Examples
+## Contoh Kode
 
 ```typescript
-import { deepClone, debounce } from "superjs-core"
-import { formatDate, timeAgo } from "superjs-core/date"
-import { groupBy, topoSort } from "superjs-core/collection"
+import { deepClone } from "superjs-core"
+import { formatDate, timeAgo, TIMEZONE_WIB } from "superjs-core/date"
 import { Queue } from "superjs-core/async"
-import { uuid, maskString, terbilang, formatRupiah } from "superjs-core/string"
-import { generateToken } from "superjs-core/crypto"
+import { uuid, maskString, terbilang, formatRupiah, formatBytes } from "superjs-core/string"
 import { isNIK, isNPWP, isPhone } from "superjs-core/validation"
 import { createError } from "superjs-core/error"
 import { Logger } from "superjs-core/logger"
-import { median, stddev, formatCurrency } from "superjs-core/math"
-import { scanProject } from "superjs-core/dep-exray"
+import { hexToRgb, contrastRatio } from "superjs-core/color"
 
-// Deep clone with circular reference support
-const cloned = deepClone({ a: 1, b: { c: new Date() } })
-
-// Safe math (0.1 + 0.2 = 0.3 ✅)
-import { add } from "superjs-core/math"
-console.log(add(0.1, 0.2)) // 0.3
+// Validasi data Indonesia
+isNIK("3201010203940001")     // true
+isNPWP("12.345.678.9-012.344") // true
+isPhone("08123456789")        // true
 
-// Date formatting without moment
-console.log(formatDate(new Date(), "DD/MM/YYYY")) // "28/06/2026"
-console.log(timeAgo(new Date(Date.now() - 5000))) // "5 seconds ago"
+// Konversi angka ke kata
+terbilang(1500000)  // "satu juta lima ratus ribu"
+formatRupiah(1500000)  // "Rp1.500.000"
 
-// Priority task queue
-const queue = new Queue({ concurrency: 2 })
-await queue.add(() => fetch("/api/data"))
+// Relative time
+timeAgo(new Date(Date.now() - 5000)) // "5 detik yang lalu"
 
-// Indonesia validation
-isNIK("3201010203940001") // true
-isNPWP("12.345.678.9-012.344") // true
-isPhone("08123456789") // true
+// Mask data sensitif (PDPA compliance)
+maskString("08123456789") // "081*****789"
 
-// Indonesian locale
-terbilang(1500000) // "satu juta lima ratus ribu"
-formatRupiah(1500000) // "Rp1.500.000"
+// Format file size
+formatBytes(1048576) // "1 MB"
 
-// Statistics
-median([1, 2, 3, 4, 5]) // 3
-percentile([1, 2, 3, 4, 5], 90) // 4.6
-formatCurrency(1500000, { locale: "en-US", currency: "USD" }) // "$1,500,000"
+// Color utilities
+hexToRgb("#ff0000") // { r: 255, g: 0, b: 0 }
+contrastRatio("#000000", "#ffffff") // 21
 
 // Typed errors
-throw createError("VALIDATION_ERROR", "Email required", { details: { field: "email" } })
+throw createError("VALIDATION_ERROR", "Email wajib diisi")
 
 // Structured logger
 const log = new Logger({ level: "info", name: "app" })
 log.info("Server started", { port: 3000 })
-
-// Dependency scanning
-const report = await scanProject({ path: "./my-project" })
-console.log(report.totalEstimatedSize) // "2.3 MB"
 ```
 
 ---
 
-## dep-exray — Dependency Health Scanner (built-in)
+## dep-exray — Dependency Health Scanner
 
-**Scan your project to find bloated, unused, or vulnerable dependencies.**
+**Scan project lo buat nemuin dependency yang gak kepake, bloated, atau punya CVE.**
 
 ```bash
 npx dep-exray .
 npx dep-exray /path/to/project --json --verbose
 ```
 
-### Features
-- Detect replacements: lodash → superjs-core, moment → superjs-core/date, uuid → native crypto.randomUUID()
-- Estimate dependency size in MB/KB
-- CVE detection from known vulnerability database
-- JSON output for CI/CD integration
-- Usage analyzer — detects whether dependencies are actually imported
+### Fitur
+- Deteksi replacement: lodash → superjs-core, moment → superjs-core/date, uuid → native crypto.randomUUID()
+- Estimasi ukuran dependency
+- CVE detection
+- JSON output untuk CI/CD
+- Usage analyzer
+
+---
+
+## Quick Start
+
+```bash
+git clone https://github.com/superdevids/superjs.git
+cd superjs/packages/core
+npm install
+npx tsup              # Build
+npx vitest run        # Test (810 tests)
+npx dep-exray .       # Scan project sendiri
+```
+
+---
+
+## Statistik Test
+
+| File Tes | Jumlah |
+|----------|--------|
+| 18 file | **810** passing ✅ |
 
 ---
 
-## Project Structure
+## Struktur Project
 
 ```
 packages/core/
 ├── src/
-│   ├── core/          # deepClone, debounce, retry, once
+│   ├── core/          # deepClone, debounce, deepEqual, pipe
 │   ├── math/          # add, median, stddev, formatCurrency
-│   ├── date/          # formatDate, timeAgo, Duration, timezone
-│   ├── collection/    # groupBy, topoSort, slidingWindows
+│   ├── date/          # formatDate, timeAgo, Duration, WIB/WITA/WIT
+│   ├── collection/    # groupBy, topoSort, deepGet, deepSet
 │   ├── string/        # camelCase, terbilang, formatRupiah
 │   ├── async/         # sleep, Queue, Semaphore, memoizeAsync
 │   ├── io/            # parseCsv, safeJsonParse, env
 │   ├── type/          # 20+ type guards
 │   ├── crypto/        # hash, generateToken, base64
 │   ├── path/          # join, resolve, basename
+│   ├── color/         # hexToRgb, lighten, darken, contrastRatio
 │   ├── validation/    # isNIK, isNPWP, isPhone, isEmail, isURL
 │   ├── error/         # createError, TypedError, MultiError
 │   ├── logger/        # Logger, transports
 │   └── dep-exray/     # Dependency scanner
-├── tests/             # 757 tests
-├── dist/              # Built output
-├── tsup.config.ts
-├── vitest.config.ts
-├── biome.json
+├── tests/             # 810 tests
+├── dist/              # Hasil build
 └── package.json
 ```
 
 ---
 
-## Test Stats
-
-| Test Files | Tests |
-|-----------|-------|
-| 17 | **757** passing |
-
----
-
 ## Roadmap
 
-See [ROADMAP.md](./ROADMAP.md) for full details.
-
-### Priority
-- **P0 ✅** validation, error, logger modules
-- **P1 ✅** async (Queue, Semaphore), math (stats), string (terbilang), collection (topoSort), date (timeAgo)
-- **P2** core (pipe/compose, Result type), signal module, crypto (AES-GCM)
-- **P3** ml, color modules
+Lihat [ROADMAP.md](./ROADMAP.md) untuk detail lengkap.
 
 ---
 

package/dist/collection/index.d.ts

@@ -77,5 +77,20 @@ declare function topoSort<T extends {
 }>(items: T[]): T[];
 declare function slidingWindows<T>(items: T[], size: number, step?: number): T[][];
 declare function tumblingWindows<T>(items: T[], size: number): T[][];
+/**
+ * Gets a nested value from an object using a dot-separated path.
+ *
+ * @example deepGet({ a: { b: 2 } }, 'a.b') // 2
+ * @example deepGet({ a: { b: 2 } }, 'a.c') // undefined
+ */
+declare function deepGet<T = unknown>(obj: unknown, path: string, default_?: T): T | undefined;
+/**
+ * Sets a nested value in an object using a dot-separated path.
+ * Creates intermediate objects/arrays as needed.
+ *
+ * @example deepSet({ a: { b: 2 } }, 'a.b', 3) // { a: { b: 3 } }
+ * @example deepSet({}, 'a.b.c', 1) // { a: { b: { c: 1 } } }
+ */
+declare function deepSet<T extends Record<string, unknown>>(obj: T, path: string, value: unknown): T;
 
-export { type SortDirection, chunk, first, flatten, groupBy, isEmpty, keyBy, last, omit, orderBy, pick, pluck, sample, sampleSize, shuffle, slidingWindows, sortBy, topoSort, tumblingWindows, uniq, uniqueBy };
+export { type SortDirection, chunk, deepGet, deepSet, first, flatten, groupBy, isEmpty, keyBy, last, omit, orderBy, pick, pluck, sample, sampleSize, shuffle, slidingWindows, sortBy, topoSort, tumblingWindows, uniq, uniqueBy };

package/dist/collection/index.js

@@ -170,8 +170,38 @@ function tumblingWindows(items, size) {
   }
   return result;
 }
+function deepGet(obj, path, default_) {
+  const keys = path.split(".");
+  let current = obj;
+  for (const key of keys) {
+    if (current === null || current === void 0) return default_;
+    if (typeof current !== "object") return default_;
+    const curObj = current;
+    if (!(key in curObj)) return default_;
+    current = curObj[key];
+  }
+  return current ?? default_;
+}
+function deepSet(obj, path, value) {
+  const keys = path.split(".");
+  const result = { ...obj };
+  let current = result;
+  for (let i = 0; i < keys.length - 1; i++) {
+    const key = keys[i];
+    const next = current[key];
+    if (next === null || next === void 0 || typeof next !== "object") {
+      const isArray = /^\d+$/.test(keys[i + 1]);
+      current[key] = isArray ? [] : {};
+    }
+    current = current[key];
+  }
+  current[keys[keys.length - 1]] = value;
+  return result;
+}
 export {
   chunk,
+  deepGet,
+  deepSet,
   first,
   flatten,
   groupBy,

package/dist/collection/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/collection/index.ts"],"sourcesContent":["/**\r\n * Groups an array of items by a key extracted from each item.\r\n *\r\n * @example groupBy([{ type: 'a' }, { type: 'b' }, { type: 'a' }], x => x.type)\r\n *          // => { a: [{ type: 'a' }, { type: 'a' }], b: [{ type: 'b' }] }\r\n */\r\nexport function groupBy<T, K extends string | number | symbol>(items: T[], keyFn: (item: T) => K): Record<K, T[]> {\r\n  const result = {} as Record<K, T[]>\r\n  for (const item of items) {\r\n    const key = keyFn(item)\r\n    if (!result[key]) result[key] = []\r\n    result[key]!.push(item)\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Creates an object keyed by the result of keyFn for each item.\r\n *\r\n * @example keyBy([{ id: 1, name: 'a' }, { id: 2, name: 'b' }], x => x.id)\r\n *          // => { 1: { id: 1, name: 'a' }, 2: { id: 2, name: 'b' } }\r\n */\r\nexport function keyBy<T, K extends string | number | symbol>(items: T[], keyFn: (item: T) => K): Record<K, T> {\r\n  const result = {} as Record<K, T>\r\n  for (const item of items) {\r\n    const key = keyFn(item)\r\n    result[key] = item\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns a copy of the object with the specified keys omitted.\r\n */\r\nexport function omit<T extends Record<string, unknown>, K extends keyof T>(obj: T, keys: K[]): Omit<T, K> {\r\n  const result = { ...obj } as T\r\n  for (const key of keys) {\r\n    delete result[key]\r\n  }\r\n  return result as Omit<T, K>\r\n}\r\n\r\n/**\r\n * Returns a copy of the object with only the specified keys.\r\n */\r\nexport function pick<T extends Record<string, unknown>, K extends keyof T>(obj: T, keys: K[]): Pick<T, K> {\r\n  const result = {} as Pick<T, K>\r\n  for (const key of keys) {\r\n    if (key in obj) {\r\n      result[key] = obj[key]\r\n    }\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Extracts a property value from each item in an array.\r\n */\r\nexport function pluck<T, K extends keyof T>(items: T[], key: K): T[K][] {\r\n  return items.map(item => item[key])\r\n}\r\n\r\n/**\r\n * Randomizes array order in-place using the Fisher-Yates algorithm.\r\n */\r\nexport function shuffle<T>(items: T[]): T[] {\r\n  const result = [...items]\r\n  for (let i = result.length - 1; i > 0; i--) {\r\n    const j = Math.floor(Math.random() * (i + 1))\r\n    const temp = result[i]!\r\n    result[i] = result[j]!\r\n    result[j] = temp\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns a random element from the array, or undefined if empty.\r\n */\r\nexport function sample<T>(items: T[]): T | undefined {\r\n  return items.length > 0 ? items[Math.floor(Math.random() * items.length)] : undefined\r\n}\r\n\r\n/**\r\n * Returns an array of `size` random elements (without duplicates).\r\n */\r\nexport function sampleSize<T>(items: T[], size: number): T[] {\r\n  if (size <= 0 || items.length === 0) return []\r\n  const pool = shuffle(items)\r\n  return pool.slice(0, Math.min(size, items.length))\r\n}\r\n\r\n/**\r\n * Splits an array into chunks of the specified size.\r\n */\r\nexport function chunk<T>(items: T[], size: number): T[][] {\r\n  if (size <= 0 || items.length === 0) return []\r\n  const result: T[][] = []\r\n  for (let i = 0; i < items.length; i += size) {\r\n    result.push(items.slice(i, i + size))\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns a sorted copy of the array using the provided criteria functions.\r\n * Earlier criteria take precedence.\r\n */\r\nfunction compareValues(a: unknown, b: unknown): number {\r\n  if (a === b) return 0\r\n  if (a == null) return -1\r\n  if (b == null) return 1\r\n  if (typeof a === 'string' && typeof b === 'string') return a < b ? -1 : 1\r\n  if (typeof a === 'number' && typeof b === 'number') return a < b ? -1 : 1\r\n  return String(a) < String(b) ? -1 : 1\r\n}\r\n\r\nexport function sortBy<T>(items: T[], ...criteria: Array<(item: T) => unknown>): T[] {\r\n  return [...items].sort((a, b) => {\r\n    for (const criterion of criteria) {\r\n      const cmp = compareValues(criterion(a), criterion(b))\r\n      if (cmp !== 0) return cmp\r\n    }\r\n    return 0\r\n  })\r\n}\r\n\r\n/**\r\n * Returns a sorted copy of the array by a single key and direction.\r\n */\r\nexport function orderBy<T>(items: T[], key: (item: T) => unknown, direction: SortDirection = 'asc'): T[] {\r\n  return [...items].sort((a, b) => {\r\n    const cmp = compareValues(key(a), key(b))\r\n    return direction === 'asc' ? cmp : -cmp\r\n  })\r\n}\r\n\r\n/**\r\n * Returns unique elements based on the result of keyFn.\r\n */\r\nexport function uniqueBy<T>(items: T[], keyFn: (item: T) => unknown): T[] {\r\n  const seen = new Set<unknown>()\r\n  return items.filter(item => {\r\n    const key = keyFn(item)\r\n    if (seen.has(key)) return false\r\n    seen.add(key)\r\n    return true\r\n  })\r\n}\r\n\r\n/**\r\n * Flattens an array of arrays one level.\r\n */\r\nexport function flatten<T>(items: T[][]): T[] {\r\n  const result: T[] = []\r\n  for (const sub of items) {\r\n    for (const item of sub) {\r\n      result.push(item)\r\n    }\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns an array with unique primitive values.\r\n */\r\nexport function uniq<T>(items: T[]): T[] {\r\n  return [...new Set(items)]\r\n}\r\n\r\n/**\r\n * Returns the first element, or undefined if empty.\r\n */\r\nexport function first<T>(items: T[]): T | undefined {\r\n  return items[0]\r\n}\r\n\r\n/**\r\n * Returns the last element, or undefined if empty.\r\n */\r\nexport function last<T>(items: T[]): T | undefined {\r\n  return items[items.length - 1]\r\n}\r\n\r\n/**\r\n * Checks if a value is empty.\r\n * Works for arrays, objects, strings, Map, and Set.\r\n */\r\nexport function isEmpty(value: unknown): boolean {\r\n  if (Array.isArray(value)) return value.length === 0\r\n  if (typeof value === 'string') return value.length === 0\r\n  if (value instanceof Map || value instanceof Set) return value.size === 0\r\n  if (value !== null && typeof value === 'object') return Object.keys(value as Record<string, unknown>).length === 0\r\n  return false\r\n}\r\n\r\nexport type SortDirection = 'asc' | 'desc'\r\n\r\nexport function topoSort<T extends { id: string; dependencies?: string[] }>(items: T[]): T[] {\r\n  const adj = new Map<string, string[]>()\r\n  const inDegree = new Map<string, number>()\r\n  const itemMap = new Map<string, T>()\r\n\r\n  for (const item of items) {\r\n    itemMap.set(item.id, item)\r\n    if (!adj.has(item.id)) adj.set(item.id, [])\r\n    if (!inDegree.has(item.id)) inDegree.set(item.id, 0)\r\n  }\r\n\r\n  for (const item of items) {\r\n    if (item.dependencies) {\r\n      for (const depId of item.dependencies) {\r\n        adj.get(depId)?.push(item.id)\r\n        inDegree.set(item.id, (inDegree.get(item.id) ?? 0) + 1)\r\n      }\r\n    }\r\n  }\r\n\r\n  const queue: string[] = []\r\n  for (const [id, degree] of inDegree) {\r\n    if (degree === 0) queue.push(id)\r\n  }\r\n\r\n  const sorted: string[] = []\r\n  while (queue.length > 0) {\r\n    const id = queue.shift()!\r\n    sorted.push(id)\r\n    for (const neighbor of adj.get(id) ?? []) {\r\n      const newDegree = (inDegree.get(neighbor) ?? 1) - 1\r\n      inDegree.set(neighbor, newDegree)\r\n      if (newDegree === 0) queue.push(neighbor)\r\n    }\r\n  }\r\n\r\n  if (sorted.length !== items.length) {\r\n    throw new Error('Circular dependency detected')\r\n  }\r\n\r\n  return sorted.map(id => itemMap.get(id)!)\r\n}\r\n\r\nexport function slidingWindows<T>(items: T[], size: number, step: number = 1): T[][] {\r\n  if (size <= 0 || items.length === 0 || step <= 0) return []\r\n  const result: T[][] = []\r\n  for (let i = 0; i + size <= items.length; i += step) {\r\n    result.push(items.slice(i, i + size))\r\n  }\r\n  return result\r\n}\r\n\r\nexport function tumblingWindows<T>(items: T[], size: number): T[][] {\r\n  if (size <= 0 || items.length === 0) return []\r\n  const result: T[][] = []\r\n  for (let i = 0; i < items.length; i += size) {\r\n    result.push(items.slice(i, i + size))\r\n  }\r\n  return result\r\n}\r\n"],"mappings":";AAMO,SAAS,QAA+C,OAAY,OAAuC;AAChH,QAAM,SAAS,CAAC;AAChB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,CAAC,OAAO,GAAG,EAAG,QAAO,GAAG,IAAI,CAAC;AACjC,WAAO,GAAG,EAAG,KAAK,IAAI;AAAA,EACxB;AACA,SAAO;AACT;AAQO,SAAS,MAA6C,OAAY,OAAqC;AAC5G,QAAM,SAAS,CAAC;AAChB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,MAAM,IAAI;AACtB,WAAO,GAAG,IAAI;AAAA,EAChB;AACA,SAAO;AACT;AAKO,SAAS,KAA2D,KAAQ,MAAuB;AACxG,QAAM,SAAS,EAAE,GAAG,IAAI;AACxB,aAAW,OAAO,MAAM;AACtB,WAAO,OAAO,GAAG;AAAA,EACnB;AACA,SAAO;AACT;AAKO,SAAS,KAA2D,KAAQ,MAAuB;AACxG,QAAM,SAAS,CAAC;AAChB,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAK;AACd,aAAO,GAAG,IAAI,IAAI,GAAG;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,MAA4B,OAAY,KAAgB;AACtE,SAAO,MAAM,IAAI,UAAQ,KAAK,GAAG,CAAC;AACpC;AAKO,SAAS,QAAW,OAAiB;AAC1C,QAAM,SAAS,CAAC,GAAG,KAAK;AACxB,WAAS,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK;AAC1C,UAAM,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,EAAE;AAC5C,UAAM,OAAO,OAAO,CAAC;AACrB,WAAO,CAAC,IAAI,OAAO,CAAC;AACpB,WAAO,CAAC,IAAI;AAAA,EACd;AACA,SAAO;AACT;AAKO,SAAS,OAAU,OAA2B;AACnD,SAAO,MAAM,SAAS,IAAI,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,MAAM,MAAM,CAAC,IAAI;AAC9E;AAKO,SAAS,WAAc,OAAY,MAAmB;AAC3D,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,OAAO,QAAQ,KAAK;AAC1B,SAAO,KAAK,MAAM,GAAG,KAAK,IAAI,MAAM,MAAM,MAAM,CAAC;AACnD;AAKO,SAAS,MAAS,OAAY,MAAqB;AACxD,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,MAAM;AAC3C,WAAO,KAAK,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAMA,SAAS,cAAc,GAAY,GAAoB;AACrD,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,KAAK;AACxE,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,KAAK;AACxE,SAAO,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK;AACtC;AAEO,SAAS,OAAU,UAAe,UAA4C;AACnF,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AAC/B,eAAW,aAAa,UAAU;AAChC,YAAM,MAAM,cAAc,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AACpD,UAAI,QAAQ,EAAG,QAAO;AAAA,IACxB;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAKO,SAAS,QAAW,OAAY,KAA2B,YAA2B,OAAY;AACvG,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AAC/B,UAAM,MAAM,cAAc,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACxC,WAAO,cAAc,QAAQ,MAAM,CAAC;AAAA,EACtC,CAAC;AACH;AAKO,SAAS,SAAY,OAAY,OAAkC;AACxE,QAAM,OAAO,oBAAI,IAAa;AAC9B,SAAO,MAAM,OAAO,UAAQ;AAC1B,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,SAAK,IAAI,GAAG;AACZ,WAAO;AAAA,EACT,CAAC;AACH;AAKO,SAAS,QAAW,OAAmB;AAC5C,QAAM,SAAc,CAAC;AACrB,aAAW,OAAO,OAAO;AACvB,eAAW,QAAQ,KAAK;AACtB,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,KAAQ,OAAiB;AACvC,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;AAKO,SAAS,MAAS,OAA2B;AAClD,SAAO,MAAM,CAAC;AAChB;AAKO,SAAS,KAAQ,OAA2B;AACjD,SAAO,MAAM,MAAM,SAAS,CAAC;AAC/B;AAMO,SAAS,QAAQ,OAAyB;AAC/C,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,WAAW;AACvD,MAAI,iBAAiB,OAAO,iBAAiB,IAAK,QAAO,MAAM,SAAS;AACxE,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAgC,EAAE,WAAW;AACjH,SAAO;AACT;AAIO,SAAS,SAA4D,OAAiB;AAC3F,QAAM,MAAM,oBAAI,IAAsB;AACtC,QAAM,WAAW,oBAAI,IAAoB;AACzC,QAAM,UAAU,oBAAI,IAAe;AAEnC,aAAW,QAAQ,OAAO;AACxB,YAAQ,IAAI,KAAK,IAAI,IAAI;AACzB,QAAI,CAAC,IAAI,IAAI,KAAK,EAAE,EAAG,KAAI,IAAI,KAAK,IAAI,CAAC,CAAC;AAC1C,QAAI,CAAC,SAAS,IAAI,KAAK,EAAE,EAAG,UAAS,IAAI,KAAK,IAAI,CAAC;AAAA,EACrD;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,cAAc;AACrB,iBAAW,SAAS,KAAK,cAAc;AACrC,YAAI,IAAI,KAAK,GAAG,KAAK,KAAK,EAAE;AAC5B,iBAAS,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,EAAE,KAAK,KAAK,CAAC;AAAA,MACxD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAkB,CAAC;AACzB,aAAW,CAAC,IAAI,MAAM,KAAK,UAAU;AACnC,QAAI,WAAW,EAAG,OAAM,KAAK,EAAE;AAAA,EACjC;AAEA,QAAM,SAAmB,CAAC;AAC1B,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,KAAK,MAAM,MAAM;AACvB,WAAO,KAAK,EAAE;AACd,eAAW,YAAY,IAAI,IAAI,EAAE,KAAK,CAAC,GAAG;AACxC,YAAM,aAAa,SAAS,IAAI,QAAQ,KAAK,KAAK;AAClD,eAAS,IAAI,UAAU,SAAS;AAChC,UAAI,cAAc,EAAG,OAAM,KAAK,QAAQ;AAAA,IAC1C;AAAA,EACF;AAEA,MAAI,OAAO,WAAW,MAAM,QAAQ;AAClC,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAChD;AAEA,SAAO,OAAO,IAAI,QAAM,QAAQ,IAAI,EAAE,CAAE;AAC1C;AAEO,SAAS,eAAkB,OAAY,MAAc,OAAe,GAAU;AACnF,MAAI,QAAQ,KAAK,MAAM,WAAW,KAAK,QAAQ,EAAG,QAAO,CAAC;AAC1D,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,QAAQ,MAAM,QAAQ,KAAK,MAAM;AACnD,WAAO,KAAK,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAEO,SAAS,gBAAmB,OAAY,MAAqB;AAClE,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,MAAM;AAC3C,WAAO,KAAK,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACtC;AACA,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../../src/collection/index.ts"],"sourcesContent":["/**\r\n * Groups an array of items by a key extracted from each item.\r\n *\r\n * @example groupBy([{ type: 'a' }, { type: 'b' }, { type: 'a' }], x => x.type)\r\n *          // => { a: [{ type: 'a' }, { type: 'a' }], b: [{ type: 'b' }] }\r\n */\r\nexport function groupBy<T, K extends string | number | symbol>(items: T[], keyFn: (item: T) => K): Record<K, T[]> {\r\n  const result = {} as Record<K, T[]>\r\n  for (const item of items) {\r\n    const key = keyFn(item)\r\n    if (!result[key]) result[key] = []\r\n    result[key]!.push(item)\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Creates an object keyed by the result of keyFn for each item.\r\n *\r\n * @example keyBy([{ id: 1, name: 'a' }, { id: 2, name: 'b' }], x => x.id)\r\n *          // => { 1: { id: 1, name: 'a' }, 2: { id: 2, name: 'b' } }\r\n */\r\nexport function keyBy<T, K extends string | number | symbol>(items: T[], keyFn: (item: T) => K): Record<K, T> {\r\n  const result = {} as Record<K, T>\r\n  for (const item of items) {\r\n    const key = keyFn(item)\r\n    result[key] = item\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns a copy of the object with the specified keys omitted.\r\n */\r\nexport function omit<T extends Record<string, unknown>, K extends keyof T>(obj: T, keys: K[]): Omit<T, K> {\r\n  const result = { ...obj } as T\r\n  for (const key of keys) {\r\n    delete result[key]\r\n  }\r\n  return result as Omit<T, K>\r\n}\r\n\r\n/**\r\n * Returns a copy of the object with only the specified keys.\r\n */\r\nexport function pick<T extends Record<string, unknown>, K extends keyof T>(obj: T, keys: K[]): Pick<T, K> {\r\n  const result = {} as Pick<T, K>\r\n  for (const key of keys) {\r\n    if (key in obj) {\r\n      result[key] = obj[key]\r\n    }\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Extracts a property value from each item in an array.\r\n */\r\nexport function pluck<T, K extends keyof T>(items: T[], key: K): T[K][] {\r\n  return items.map(item => item[key])\r\n}\r\n\r\n/**\r\n * Randomizes array order in-place using the Fisher-Yates algorithm.\r\n */\r\nexport function shuffle<T>(items: T[]): T[] {\r\n  const result = [...items]\r\n  for (let i = result.length - 1; i > 0; i--) {\r\n    const j = Math.floor(Math.random() * (i + 1))\r\n    const temp = result[i]!\r\n    result[i] = result[j]!\r\n    result[j] = temp\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns a random element from the array, or undefined if empty.\r\n */\r\nexport function sample<T>(items: T[]): T | undefined {\r\n  return items.length > 0 ? items[Math.floor(Math.random() * items.length)] : undefined\r\n}\r\n\r\n/**\r\n * Returns an array of `size` random elements (without duplicates).\r\n */\r\nexport function sampleSize<T>(items: T[], size: number): T[] {\r\n  if (size <= 0 || items.length === 0) return []\r\n  const pool = shuffle(items)\r\n  return pool.slice(0, Math.min(size, items.length))\r\n}\r\n\r\n/**\r\n * Splits an array into chunks of the specified size.\r\n */\r\nexport function chunk<T>(items: T[], size: number): T[][] {\r\n  if (size <= 0 || items.length === 0) return []\r\n  const result: T[][] = []\r\n  for (let i = 0; i < items.length; i += size) {\r\n    result.push(items.slice(i, i + size))\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns a sorted copy of the array using the provided criteria functions.\r\n * Earlier criteria take precedence.\r\n */\r\nfunction compareValues(a: unknown, b: unknown): number {\r\n  if (a === b) return 0\r\n  if (a == null) return -1\r\n  if (b == null) return 1\r\n  if (typeof a === 'string' && typeof b === 'string') return a < b ? -1 : 1\r\n  if (typeof a === 'number' && typeof b === 'number') return a < b ? -1 : 1\r\n  return String(a) < String(b) ? -1 : 1\r\n}\r\n\r\nexport function sortBy<T>(items: T[], ...criteria: Array<(item: T) => unknown>): T[] {\r\n  return [...items].sort((a, b) => {\r\n    for (const criterion of criteria) {\r\n      const cmp = compareValues(criterion(a), criterion(b))\r\n      if (cmp !== 0) return cmp\r\n    }\r\n    return 0\r\n  })\r\n}\r\n\r\n/**\r\n * Returns a sorted copy of the array by a single key and direction.\r\n */\r\nexport function orderBy<T>(items: T[], key: (item: T) => unknown, direction: SortDirection = 'asc'): T[] {\r\n  return [...items].sort((a, b) => {\r\n    const cmp = compareValues(key(a), key(b))\r\n    return direction === 'asc' ? cmp : -cmp\r\n  })\r\n}\r\n\r\n/**\r\n * Returns unique elements based on the result of keyFn.\r\n */\r\nexport function uniqueBy<T>(items: T[], keyFn: (item: T) => unknown): T[] {\r\n  const seen = new Set<unknown>()\r\n  return items.filter(item => {\r\n    const key = keyFn(item)\r\n    if (seen.has(key)) return false\r\n    seen.add(key)\r\n    return true\r\n  })\r\n}\r\n\r\n/**\r\n * Flattens an array of arrays one level.\r\n */\r\nexport function flatten<T>(items: T[][]): T[] {\r\n  const result: T[] = []\r\n  for (const sub of items) {\r\n    for (const item of sub) {\r\n      result.push(item)\r\n    }\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns an array with unique primitive values.\r\n */\r\nexport function uniq<T>(items: T[]): T[] {\r\n  return [...new Set(items)]\r\n}\r\n\r\n/**\r\n * Returns the first element, or undefined if empty.\r\n */\r\nexport function first<T>(items: T[]): T | undefined {\r\n  return items[0]\r\n}\r\n\r\n/**\r\n * Returns the last element, or undefined if empty.\r\n */\r\nexport function last<T>(items: T[]): T | undefined {\r\n  return items[items.length - 1]\r\n}\r\n\r\n/**\r\n * Checks if a value is empty.\r\n * Works for arrays, objects, strings, Map, and Set.\r\n */\r\nexport function isEmpty(value: unknown): boolean {\r\n  if (Array.isArray(value)) return value.length === 0\r\n  if (typeof value === 'string') return value.length === 0\r\n  if (value instanceof Map || value instanceof Set) return value.size === 0\r\n  if (value !== null && typeof value === 'object') return Object.keys(value as Record<string, unknown>).length === 0\r\n  return false\r\n}\r\n\r\nexport type SortDirection = 'asc' | 'desc'\r\n\r\nexport function topoSort<T extends { id: string; dependencies?: string[] }>(items: T[]): T[] {\r\n  const adj = new Map<string, string[]>()\r\n  const inDegree = new Map<string, number>()\r\n  const itemMap = new Map<string, T>()\r\n\r\n  for (const item of items) {\r\n    itemMap.set(item.id, item)\r\n    if (!adj.has(item.id)) adj.set(item.id, [])\r\n    if (!inDegree.has(item.id)) inDegree.set(item.id, 0)\r\n  }\r\n\r\n  for (const item of items) {\r\n    if (item.dependencies) {\r\n      for (const depId of item.dependencies) {\r\n        adj.get(depId)?.push(item.id)\r\n        inDegree.set(item.id, (inDegree.get(item.id) ?? 0) + 1)\r\n      }\r\n    }\r\n  }\r\n\r\n  const queue: string[] = []\r\n  for (const [id, degree] of inDegree) {\r\n    if (degree === 0) queue.push(id)\r\n  }\r\n\r\n  const sorted: string[] = []\r\n  while (queue.length > 0) {\r\n    const id = queue.shift()!\r\n    sorted.push(id)\r\n    for (const neighbor of adj.get(id) ?? []) {\r\n      const newDegree = (inDegree.get(neighbor) ?? 1) - 1\r\n      inDegree.set(neighbor, newDegree)\r\n      if (newDegree === 0) queue.push(neighbor)\r\n    }\r\n  }\r\n\r\n  if (sorted.length !== items.length) {\r\n    throw new Error('Circular dependency detected')\r\n  }\r\n\r\n  return sorted.map(id => itemMap.get(id)!)\r\n}\r\n\r\nexport function slidingWindows<T>(items: T[], size: number, step: number = 1): T[][] {\r\n  if (size <= 0 || items.length === 0 || step <= 0) return []\r\n  const result: T[][] = []\r\n  for (let i = 0; i + size <= items.length; i += step) {\r\n    result.push(items.slice(i, i + size))\r\n  }\r\n  return result\r\n}\r\n\r\nexport function tumblingWindows<T>(items: T[], size: number): T[][] {\r\n  if (size <= 0 || items.length === 0) return []\r\n  const result: T[][] = []\r\n  for (let i = 0; i < items.length; i += size) {\r\n    result.push(items.slice(i, i + size))\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Gets a nested value from an object using a dot-separated path.\r\n *\r\n * @example deepGet({ a: { b: 2 } }, 'a.b') // 2\r\n * @example deepGet({ a: { b: 2 } }, 'a.c') // undefined\r\n */\r\nexport function deepGet<T = unknown>(obj: unknown, path: string, default_?: T): T | undefined {\r\n  const keys = path.split('.')\r\n  let current: unknown = obj\r\n  for (const key of keys) {\r\n    if (current === null || current === undefined) return default_\r\n    if (typeof current !== 'object') return default_\r\n    const curObj = current as Record<string, unknown>\r\n    if (!(key in curObj)) return default_\r\n    current = curObj[key]\r\n  }\r\n  return (current as T) ?? default_\r\n}\r\n\r\n/**\r\n * Sets a nested value in an object using a dot-separated path.\r\n * Creates intermediate objects/arrays as needed.\r\n *\r\n * @example deepSet({ a: { b: 2 } }, 'a.b', 3) // { a: { b: 3 } }\r\n * @example deepSet({}, 'a.b.c', 1) // { a: { b: { c: 1 } } }\r\n */\r\nexport function deepSet<T extends Record<string, unknown>>(obj: T, path: string, value: unknown): T {\r\n  const keys = path.split('.')\r\n  const result = { ...obj } as Record<string, unknown>\r\n  let current = result\r\n  for (let i = 0; i < keys.length - 1; i++) {\r\n    const key = keys[i]!\r\n    const next = current[key]\r\n    if (next === null || next === undefined || typeof next !== 'object') {\r\n      const isArray = /^\\d+$/.test(keys[i + 1]!)\r\n      current[key] = isArray ? [] : {}\r\n    }\r\n    current = current[key] as Record<string, unknown>\r\n  }\r\n  current[keys[keys.length - 1]!] = value\r\n  return result as T\r\n}\r\n"],"mappings":";AAMO,SAAS,QAA+C,OAAY,OAAuC;AAChH,QAAM,SAAS,CAAC;AAChB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,CAAC,OAAO,GAAG,EAAG,QAAO,GAAG,IAAI,CAAC;AACjC,WAAO,GAAG,EAAG,KAAK,IAAI;AAAA,EACxB;AACA,SAAO;AACT;AAQO,SAAS,MAA6C,OAAY,OAAqC;AAC5G,QAAM,SAAS,CAAC;AAChB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,MAAM,IAAI;AACtB,WAAO,GAAG,IAAI;AAAA,EAChB;AACA,SAAO;AACT;AAKO,SAAS,KAA2D,KAAQ,MAAuB;AACxG,QAAM,SAAS,EAAE,GAAG,IAAI;AACxB,aAAW,OAAO,MAAM;AACtB,WAAO,OAAO,GAAG;AAAA,EACnB;AACA,SAAO;AACT;AAKO,SAAS,KAA2D,KAAQ,MAAuB;AACxG,QAAM,SAAS,CAAC;AAChB,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAK;AACd,aAAO,GAAG,IAAI,IAAI,GAAG;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,MAA4B,OAAY,KAAgB;AACtE,SAAO,MAAM,IAAI,UAAQ,KAAK,GAAG,CAAC;AACpC;AAKO,SAAS,QAAW,OAAiB;AAC1C,QAAM,SAAS,CAAC,GAAG,KAAK;AACxB,WAAS,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK;AAC1C,UAAM,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,EAAE;AAC5C,UAAM,OAAO,OAAO,CAAC;AACrB,WAAO,CAAC,IAAI,OAAO,CAAC;AACpB,WAAO,CAAC,IAAI;AAAA,EACd;AACA,SAAO;AACT;AAKO,SAAS,OAAU,OAA2B;AACnD,SAAO,MAAM,SAAS,IAAI,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,MAAM,MAAM,CAAC,IAAI;AAC9E;AAKO,SAAS,WAAc,OAAY,MAAmB;AAC3D,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,OAAO,QAAQ,KAAK;AAC1B,SAAO,KAAK,MAAM,GAAG,KAAK,IAAI,MAAM,MAAM,MAAM,CAAC;AACnD;AAKO,SAAS,MAAS,OAAY,MAAqB;AACxD,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,MAAM;AAC3C,WAAO,KAAK,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAMA,SAAS,cAAc,GAAY,GAAoB;AACrD,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,KAAK;AACxE,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,KAAK;AACxE,SAAO,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK;AACtC;AAEO,SAAS,OAAU,UAAe,UAA4C;AACnF,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AAC/B,eAAW,aAAa,UAAU;AAChC,YAAM,MAAM,cAAc,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AACpD,UAAI,QAAQ,EAAG,QAAO;AAAA,IACxB;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAKO,SAAS,QAAW,OAAY,KAA2B,YAA2B,OAAY;AACvG,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AAC/B,UAAM,MAAM,cAAc,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACxC,WAAO,cAAc,QAAQ,MAAM,CAAC;AAAA,EACtC,CAAC;AACH;AAKO,SAAS,SAAY,OAAY,OAAkC;AACxE,QAAM,OAAO,oBAAI,IAAa;AAC9B,SAAO,MAAM,OAAO,UAAQ;AAC1B,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,SAAK,IAAI,GAAG;AACZ,WAAO;AAAA,EACT,CAAC;AACH;AAKO,SAAS,QAAW,OAAmB;AAC5C,QAAM,SAAc,CAAC;AACrB,aAAW,OAAO,OAAO;AACvB,eAAW,QAAQ,KAAK;AACtB,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,KAAQ,OAAiB;AACvC,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;AAKO,SAAS,MAAS,OAA2B;AAClD,SAAO,MAAM,CAAC;AAChB;AAKO,SAAS,KAAQ,OAA2B;AACjD,SAAO,MAAM,MAAM,SAAS,CAAC;AAC/B;AAMO,SAAS,QAAQ,OAAyB;AAC/C,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,WAAW;AACvD,MAAI,iBAAiB,OAAO,iBAAiB,IAAK,QAAO,MAAM,SAAS;AACxE,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAgC,EAAE,WAAW;AACjH,SAAO;AACT;AAIO,SAAS,SAA4D,OAAiB;AAC3F,QAAM,MAAM,oBAAI,IAAsB;AACtC,QAAM,WAAW,oBAAI,IAAoB;AACzC,QAAM,UAAU,oBAAI,IAAe;AAEnC,aAAW,QAAQ,OAAO;AACxB,YAAQ,IAAI,KAAK,IAAI,IAAI;AACzB,QAAI,CAAC,IAAI,IAAI,KAAK,EAAE,EAAG,KAAI,IAAI,KAAK,IAAI,CAAC,CAAC;AAC1C,QAAI,CAAC,SAAS,IAAI,KAAK,EAAE,EAAG,UAAS,IAAI,KAAK,IAAI,CAAC;AAAA,EACrD;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,cAAc;AACrB,iBAAW,SAAS,KAAK,cAAc;AACrC,YAAI,IAAI,KAAK,GAAG,KAAK,KAAK,EAAE;AAC5B,iBAAS,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,EAAE,KAAK,KAAK,CAAC;AAAA,MACxD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAkB,CAAC;AACzB,aAAW,CAAC,IAAI,MAAM,KAAK,UAAU;AACnC,QAAI,WAAW,EAAG,OAAM,KAAK,EAAE;AAAA,EACjC;AAEA,QAAM,SAAmB,CAAC;AAC1B,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,KAAK,MAAM,MAAM;AACvB,WAAO,KAAK,EAAE;AACd,eAAW,YAAY,IAAI,IAAI,EAAE,KAAK,CAAC,GAAG;AACxC,YAAM,aAAa,SAAS,IAAI,QAAQ,KAAK,KAAK;AAClD,eAAS,IAAI,UAAU,SAAS;AAChC,UAAI,cAAc,EAAG,OAAM,KAAK,QAAQ;AAAA,IAC1C;AAAA,EACF;AAEA,MAAI,OAAO,WAAW,MAAM,QAAQ;AAClC,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAChD;AAEA,SAAO,OAAO,IAAI,QAAM,QAAQ,IAAI,EAAE,CAAE;AAC1C;AAEO,SAAS,eAAkB,OAAY,MAAc,OAAe,GAAU;AACnF,MAAI,QAAQ,KAAK,MAAM,WAAW,KAAK,QAAQ,EAAG,QAAO,CAAC;AAC1D,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,QAAQ,MAAM,QAAQ,KAAK,MAAM;AACnD,WAAO,KAAK,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAEO,SAAS,gBAAmB,OAAY,MAAqB;AAClE,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,MAAM;AAC3C,WAAO,KAAK,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAQO,SAAS,QAAqB,KAAc,MAAc,UAA6B;AAC5F,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,MAAI,UAAmB;AACvB,aAAW,OAAO,MAAM;AACtB,QAAI,YAAY,QAAQ,YAAY,OAAW,QAAO;AACtD,QAAI,OAAO,YAAY,SAAU,QAAO;AACxC,UAAM,SAAS;AACf,QAAI,EAAE,OAAO,QAAS,QAAO;AAC7B,cAAU,OAAO,GAAG;AAAA,EACtB;AACA,SAAQ,WAAiB;AAC3B;AASO,SAAS,QAA2C,KAAQ,MAAc,OAAmB;AAClG,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,QAAM,SAAS,EAAE,GAAG,IAAI;AACxB,MAAI,UAAU;AACd,WAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;AACxC,UAAM,MAAM,KAAK,CAAC;AAClB,UAAM,OAAO,QAAQ,GAAG;AACxB,QAAI,SAAS,QAAQ,SAAS,UAAa,OAAO,SAAS,UAAU;AACnE,YAAM,UAAU,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAE;AACzC,cAAQ,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC;AAAA,IACjC;AACA,cAAU,QAAQ,GAAG;AAAA,EACvB;AACA,UAAQ,KAAK,KAAK,SAAS,CAAC,CAAE,IAAI;AAClC,SAAO;AACT;","names":[]}

package/dist/color/index.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Converts a hex color string to RGB values.
+ *
+ * @example hexToRgb('#ff0000') // { r: 255, g: 0, b: 0 }
+ * @example hexToRgb('#f00')   // { r: 255, g: 0, b: 0 }
+ * @example hexToRgb('#FF8800') // { r: 255, g: 136, b: 0 }
+ */
+declare function hexToRgb(hex: string): {
+    r: number;
+    g: number;
+    b: number;
+} | null;
+/**
+ * Converts RGB values to a hex color string.
+ *
+ * @example rgbToHex(255, 0, 0) // "#ff0000"
+ * @example rgbToHex(255, 136, 0) // "#ff8800"
+ */
+declare function rgbToHex(r: number, g: number, b: number): string;
+/**
+ * Lightens a hex color by a given percentage (0-100).
+ *
+ * @example lighten('#ff0000', 20) // "#ff3333"
+ * @example lighten('#0000ff', 50) // "#7f7fff"
+ */
+declare function lighten(hex: string, percent: number): string;
+/**
+ * Darkens a hex color by a given percentage (0-100).
+ *
+ * @example darken('#ff0000', 20) // "#cc0000"
+ * @example darken('#00ff00', 50) // "#008000"
+ */
+declare function darken(hex: string, percent: number): string;
+/**
+ * Checks the WCAG contrast ratio between two hex colors.
+ * Returns the ratio as a number (1-21). WCAG AA requires 4.5:1 for normal text.
+ *
+ * @example contrastRatio('#000000', '#ffffff') // 21
+ * @example contrastRatio('#ff0000', '#ffffff') // 3.99
+ */
+declare function contrastRatio(hex1: string, hex2: string): number;
+/**
+ * Checks if a hex color meets WCAG AA contrast ratio (4.5:1) against another color.
+ *
+ * @example meetsWCAG('#000000', '#ffffff') // true (black on white)
+ * @example meetsWCAG('#999999', '#ffffff') // false (gray on white)
+ */
+declare function meetsWCAG(hex1: string, hex2: string, level?: 'AA' | 'AAA'): boolean;
+
+export { contrastRatio, darken, hexToRgb, lighten, meetsWCAG, rgbToHex };

package/dist/color/index.js

@@ -0,0 +1,66 @@
+// src/color/index.ts
+function hexToRgb(hex) {
+  let h = hex.replace("#", "");
+  if (h.length === 3) h = h[0] + h[0] + h[1] + h[1] + h[2] + h[2];
+  if (h.length !== 6) return null;
+  const num = Number.parseInt(h, 16);
+  if (isNaN(num)) return null;
+  return {
+    r: num >> 16 & 255,
+    g: num >> 8 & 255,
+    b: num & 255
+  };
+}
+function rgbToHex(r, g, b) {
+  const toHex = (n) => Math.max(0, Math.min(255, Math.round(n))).toString(16).padStart(2, "0");
+  return "#" + toHex(r) + toHex(g) + toHex(b);
+}
+function lighten(hex, percent) {
+  const rgb = hexToRgb(hex);
+  if (!rgb) return hex;
+  const factor = percent / 100;
+  return rgbToHex(
+    rgb.r + (255 - rgb.r) * factor,
+    rgb.g + (255 - rgb.g) * factor,
+    rgb.b + (255 - rgb.b) * factor
+  );
+}
+function darken(hex, percent) {
+  const rgb = hexToRgb(hex);
+  if (!rgb) return hex;
+  const factor = percent / 100;
+  return rgbToHex(
+    rgb.r * (1 - factor),
+    rgb.g * (1 - factor),
+    rgb.b * (1 - factor)
+  );
+}
+function contrastRatio(hex1, hex2) {
+  const lum1 = relativeLuminance(hex1);
+  const lum2 = relativeLuminance(hex2);
+  const lighter = Math.max(lum1, lum2);
+  const darker = Math.min(lum1, lum2);
+  return Number(((lighter + 0.05) / (darker + 0.05)).toFixed(2));
+}
+function relativeLuminance(hex) {
+  const rgb = hexToRgb(hex);
+  if (!rgb) return 0;
+  const vals = [rgb.r / 255, rgb.g / 255, rgb.b / 255].map((c) => {
+    return c <= 0.03928 ? c / 12.92 : Math.pow((c + 0.055) / 1.055, 2.4);
+  });
+  return 0.2126 * vals[0] + 0.7152 * vals[1] + 0.0722 * vals[2];
+}
+function meetsWCAG(hex1, hex2, level) {
+  const ratio = contrastRatio(hex1, hex2);
+  const threshold = level === "AAA" ? 7 : 4.5;
+  return ratio >= threshold;
+}
+export {
+  contrastRatio,
+  darken,
+  hexToRgb,
+  lighten,
+  meetsWCAG,
+  rgbToHex
+};
+//# sourceMappingURL=index.js.map

package/dist/color/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/color/index.ts"],"sourcesContent":["/**\n * Converts a hex color string to RGB values.\n *\n * @example hexToRgb('#ff0000') // { r: 255, g: 0, b: 0 }\n * @example hexToRgb('#f00')   // { r: 255, g: 0, b: 0 }\n * @example hexToRgb('#FF8800') // { r: 255, g: 136, b: 0 }\n */\nexport function hexToRgb(hex: string): { r: number; g: number; b: number } | null {\n  let h = hex.replace('#', '')\n  if (h.length === 3) h = h[0]! + h[0] + h[1]! + h[1] + h[2]! + h[2]\n  if (h.length !== 6) return null\n  const num = Number.parseInt(h, 16)\n  if (isNaN(num)) return null\n  return {\n    r: (num >> 16) & 255,\n    g: (num >> 8) & 255,\n    b: num & 255,\n  }\n}\n\n/**\n * Converts RGB values to a hex color string.\n *\n * @example rgbToHex(255, 0, 0) // \"#ff0000\"\n * @example rgbToHex(255, 136, 0) // \"#ff8800\"\n */\nexport function rgbToHex(r: number, g: number, b: number): string {\n  const toHex = (n: number) => Math.max(0, Math.min(255, Math.round(n))).toString(16).padStart(2, '0')\n  return '#' + toHex(r) + toHex(g) + toHex(b)\n}\n\n/**\n * Lightens a hex color by a given percentage (0-100).\n *\n * @example lighten('#ff0000', 20) // \"#ff3333\"\n * @example lighten('#0000ff', 50) // \"#7f7fff\"\n */\nexport function lighten(hex: string, percent: number): string {\n  const rgb = hexToRgb(hex)\n  if (!rgb) return hex\n  const factor = percent / 100\n  return rgbToHex(\n    rgb.r + (255 - rgb.r) * factor,\n    rgb.g + (255 - rgb.g) * factor,\n    rgb.b + (255 - rgb.b) * factor,\n  )\n}\n\n/**\n * Darkens a hex color by a given percentage (0-100).\n *\n * @example darken('#ff0000', 20) // \"#cc0000\"\n * @example darken('#00ff00', 50) // \"#008000\"\n */\nexport function darken(hex: string, percent: number): string {\n  const rgb = hexToRgb(hex)\n  if (!rgb) return hex\n  const factor = percent / 100\n  return rgbToHex(\n    rgb.r * (1 - factor),\n    rgb.g * (1 - factor),\n    rgb.b * (1 - factor),\n  )\n}\n\n/**\n * Checks the WCAG contrast ratio between two hex colors.\n * Returns the ratio as a number (1-21). WCAG AA requires 4.5:1 for normal text.\n *\n * @example contrastRatio('#000000', '#ffffff') // 21\n * @example contrastRatio('#ff0000', '#ffffff') // 3.99\n */\nexport function contrastRatio(hex1: string, hex2: string): number {\n  const lum1 = relativeLuminance(hex1)\n  const lum2 = relativeLuminance(hex2)\n  const lighter = Math.max(lum1, lum2)\n  const darker = Math.min(lum1, lum2)\n  return Number(((lighter + 0.05) / (darker + 0.05)).toFixed(2))\n}\n\nfunction relativeLuminance(hex: string): number {\n  const rgb = hexToRgb(hex)\n  if (!rgb) return 0\n  const vals = [rgb.r / 255, rgb.g / 255, rgb.b / 255].map((c) => {\n    return c <= 0.03928 ? c / 12.92 : Math.pow((c + 0.055) / 1.055, 2.4)\n  })\n  return 0.2126 * vals[0]! + 0.7152 * vals[1]! + 0.0722 * vals[2]!\n}\n\n/**\n * Checks if a hex color meets WCAG AA contrast ratio (4.5:1) against another color.\n *\n * @example meetsWCAG('#000000', '#ffffff') // true (black on white)\n * @example meetsWCAG('#999999', '#ffffff') // false (gray on white)\n */\nexport function meetsWCAG(hex1: string, hex2: string, level?: 'AA' | 'AAA'): boolean {\n  const ratio = contrastRatio(hex1, hex2)\n  const threshold = level === 'AAA' ? 7 : 4.5\n  return ratio >= threshold\n}\n"],"mappings":";AAOO,SAAS,SAAS,KAAyD;AAChF,MAAI,IAAI,IAAI,QAAQ,KAAK,EAAE;AAC3B,MAAI,EAAE,WAAW,EAAG,KAAI,EAAE,CAAC,IAAK,EAAE,CAAC,IAAI,EAAE,CAAC,IAAK,EAAE,CAAC,IAAI,EAAE,CAAC,IAAK,EAAE,CAAC;AACjE,MAAI,EAAE,WAAW,EAAG,QAAO;AAC3B,QAAM,MAAM,OAAO,SAAS,GAAG,EAAE;AACjC,MAAI,MAAM,GAAG,EAAG,QAAO;AACvB,SAAO;AAAA,IACL,GAAI,OAAO,KAAM;AAAA,IACjB,GAAI,OAAO,IAAK;AAAA,IAChB,GAAG,MAAM;AAAA,EACX;AACF;AAQO,SAAS,SAAS,GAAW,GAAW,GAAmB;AAChE,QAAM,QAAQ,CAAC,MAAc,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AACnG,SAAO,MAAM,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAC5C;AAQO,SAAS,QAAQ,KAAa,SAAyB;AAC5D,QAAM,MAAM,SAAS,GAAG;AACxB,MAAI,CAAC,IAAK,QAAO;AACjB,QAAM,SAAS,UAAU;AACzB,SAAO;AAAA,IACL,IAAI,KAAK,MAAM,IAAI,KAAK;AAAA,IACxB,IAAI,KAAK,MAAM,IAAI,KAAK;AAAA,IACxB,IAAI,KAAK,MAAM,IAAI,KAAK;AAAA,EAC1B;AACF;AAQO,SAAS,OAAO,KAAa,SAAyB;AAC3D,QAAM,MAAM,SAAS,GAAG;AACxB,MAAI,CAAC,IAAK,QAAO;AACjB,QAAM,SAAS,UAAU;AACzB,SAAO;AAAA,IACL,IAAI,KAAK,IAAI;AAAA,IACb,IAAI,KAAK,IAAI;AAAA,IACb,IAAI,KAAK,IAAI;AAAA,EACf;AACF;AASO,SAAS,cAAc,MAAc,MAAsB;AAChE,QAAM,OAAO,kBAAkB,IAAI;AACnC,QAAM,OAAO,kBAAkB,IAAI;AACnC,QAAM,UAAU,KAAK,IAAI,MAAM,IAAI;AACnC,QAAM,SAAS,KAAK,IAAI,MAAM,IAAI;AAClC,SAAO,SAAS,UAAU,SAAS,SAAS,OAAO,QAAQ,CAAC,CAAC;AAC/D;AAEA,SAAS,kBAAkB,KAAqB;AAC9C,QAAM,MAAM,SAAS,GAAG;AACxB,MAAI,CAAC,IAAK,QAAO;AACjB,QAAM,OAAO,CAAC,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,EAAE,IAAI,CAAC,MAAM;AAC9D,WAAO,KAAK,UAAU,IAAI,QAAQ,KAAK,KAAK,IAAI,SAAS,OAAO,GAAG;AAAA,EACrE,CAAC;AACD,SAAO,SAAS,KAAK,CAAC,IAAK,SAAS,KAAK,CAAC,IAAK,SAAS,KAAK,CAAC;AAChE;AAQO,SAAS,UAAU,MAAc,MAAc,OAA+B;AACnF,QAAM,QAAQ,cAAc,MAAM,IAAI;AACtC,QAAM,YAAY,UAAU,QAAQ,IAAI;AACxC,SAAO,SAAS;AAClB;","names":[]}

package/dist/core/index.d.ts

@@ -91,5 +91,29 @@ declare function identity<T>(value: T): T;
  * @returns A function that runs only once.
  */
 declare function once<T extends (...args: unknown[]) => unknown>(fn: T): (...args: Parameters<T>) => ReturnType<T>;
+/**
+ * Deep equality check between two values. Supports primitives, objects,
+ * arrays, Date, RegExp, Map, Set, and nested structures. Circular
+ * references are handled.
+ *
+ * @example deepEqual({ a: 1, b: { c: 2 } }, { a: 1, b: { c: 2 } }) // true
+ * @example deepEqual({ a: 1 }, { a: 2 }) // false
+ */
+declare function deepEqual(a: unknown, b: unknown): boolean;
+/**
+ * Performs left-to-right function composition.
+ *
+ * @example const fn = pipe((x: number) => x + 1, (x: number) => x * 2)
+ * fn(3) // 8
+ */
+declare function pipe<T>(initial: T, ...fns: Array<(arg: T) => T>): T;
+declare function pipe<T, R>(initial: T, ...fns: Array<(arg: unknown) => unknown>): R;
+/**
+ * Performs right-to-left function composition.
+ *
+ * @example const fn = compose((x: number) => x * 2, (x: number) => x + 1)
+ * fn(3) // 8 — same as (3+1)*2
+ */
+declare function compose<T>(...fns: Array<(arg: T) => T>): (initial: T) => T;
 
-export { type DebounceOptions, type DebouncedFunction, type MemoizedFunction, type RetryOptions, debounce, deepClone, deepMerge, identity, memoize, noop, once, retry, throttle };
+export { type DebounceOptions, type DebouncedFunction, type MemoizedFunction, type RetryOptions, compose, debounce, deepClone, deepEqual, deepMerge, identity, memoize, noop, once, pipe, retry, throttle };

package/dist/core/index.js

@@ -258,14 +258,65 @@ function once(fn) {
     return result;
   };
 }
+function deepEqual(a, b) {
+  if (Object.is(a, b)) return true;
+  if (a === null || b === null || typeof a !== typeof b) return false;
+  if (typeof a !== "object") return false;
+  const aObj = a;
+  const bObj = b;
+  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 (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 [k, v] of a) {
+      if (!b.has(k) || !deepEqual(v, b.get(k))) return false;
+    }
+    return true;
+  }
+  if (a instanceof Set && b instanceof Set) {
+    if (a.size !== b.size) return false;
+    for (const v of a) {
+      if (!b.has(v)) return false;
+    }
+    return true;
+  }
+  const keysA = Object.keys(aObj);
+  const keysB = Object.keys(bObj);
+  if (keysA.length !== keysB.length) return false;
+  for (const key of keysA) {
+    if (!Object.prototype.hasOwnProperty.call(bObj, key)) return false;
+    if (!deepEqual(aObj[key], bObj[key])) return false;
+  }
+  return true;
+}
+function pipe(initial, ...fns) {
+  return fns.reduce((acc, fn) => fn(acc), initial);
+}
+function compose(...fns) {
+  return (initial) => fns.reduceRight((acc, fn) => fn(acc), initial);
+}
 export {
+  compose,
   debounce,
   deepClone,
+  deepEqual,
   deepMerge,
   identity,
   memoize,
   noop,
   once,
+  pipe,
   retry,
   throttle
 };