chromonym 2.0.0 → 3.0.0

package/dist/indexing.d.ts

@@ -47,4 +47,22 @@ export declare function nearestByRgb(target: Rgba, space: AnyPalette): string;
  * hide the distance-metric choice from the hot path.
  */
 export declare function nearest(target: Rgba, space: AnyPalette, metric: DistanceMetric): string;
+/**
+ * Rank every palette entry by distance to `target`. Returns an array of
+ * `{ name, distance }` sorted ascending (nearest first). Optional `k`
+ * truncates to the top-k matches.
+ *
+ * Distances are **real** metric values (not squared) — ΔE76 / ΔE94 /
+ * ΔE2000 / ΔE-OK are in standard ΔE units (≈1 = just-noticeable for
+ * most of the gamut on ΔE76/2000); `euclidean-srgb` / `euclidean-linear`
+ * are in their respective channel-unit Euclidean distances.
+ *
+ * Cost: O(n log n) for the sort vs O(n) for `nearest` — acceptable for
+ * top-K queries. For strict "what's the single nearest?" stay on
+ * `nearest` / `identify`.
+ */
+export declare function nearestAll(target: Rgba, space: AnyPalette, metric: DistanceMetric, k?: number): Array<{
+    name: string;
+    distance: number;
+}>;
 //# sourceMappingURL=indexing.d.ts.map

package/dist/indexing.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"indexing.d.ts","sourceRoot":"","sources":["../src/indexing.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,cAAc,EAAY,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAEvF;;;;;;GAMG;AAKH,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC9E,YAAY,EAAE,WAAW,EAAE,CAAC;AAE5B,KAAK,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;AAKlC;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,UAAU,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAWnE;AAID;;;;;;;;;GASG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAU1E;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAS9E;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,GAAG,MAAM,CAYpE;AAsED;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,cAAc,GAAG,MAAM,CAavF","sourcesContent":["import { hexToRgba } from './conversions/hex.js';\nimport { rgbaToLab, rgbaToLinearRgb, rgbaToOklab } from './math/colorSpace.js';\nimport { deltaE76Squared, deltaE94, deltaE2000, deltaEokSquared } from './math/deltaE.js';\nimport { squaredDistanceRgb } from './math/euclideanDistance.js';\nimport type { DistanceMetric, HexColor, NormalizeFn, Palette, Rgba } from './types.js';\n\n/**\n * Per-palette lookup indexes for name resolution and nearest-match.\n *\n * Caches are keyed by the Palette wrapper (WeakMap), so each palette's\n * indexes are built once per process and reused by every caller —\n * including BYO palettes the user supplies.\n */\n\n// Re-export normalizers from their own module for backward compat with any\n// caller that expected them here. The functions live in ./palettes/normalize\n// so palette modules can import them without pulling this file's math graph.\nexport { pantoneNormalize, standardNormalize } from './palettes/normalize.js';\nexport type { NormalizeFn };\n\ntype AnyPalette = Palette<string>;\n\nconst nameIndexCache = new WeakMap<AnyPalette, Map<string, string>>();\nconst rgbaIndexCache = new WeakMap<AnyPalette, Array<readonly [string, Rgba]>>();\n\n/**\n * Normalized-name → canonical-key map for a given palette. Built once\n * per palette using its own `normalize` function.\n */\nexport function getNameIndex(space: AnyPalette): Map<string, string> {\n  let idx = nameIndexCache.get(space);\n  if (idx === undefined) {\n    idx = new Map();\n    const { normalize } = space;\n    for (const key of Object.keys(space.colors)) {\n      idx.set(normalize(key), key);\n    }\n    nameIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\nconst reverseIndexCache = new WeakMap<AnyPalette, Map<string, string>>();\n\n/**\n * Hex → canonical-key map (reverse of `palette.colors`). Built once per\n * palette. Used by `convert(color, { palette, format: 'NAME' })` for\n * O(1) exact reverse lookup. Returns `undefined` on miss — the caller\n * decides whether that's an error (convert throws; use `identify` for\n * nearest-match semantics).\n *\n * Hex values are lowercased for the key so callers can normalize their\n * input with `rgbaToHex(...).toLowerCase()` before lookup.\n */\nexport function getReverseNameIndex(space: AnyPalette): Map<string, string> {\n  let idx = reverseIndexCache.get(space);\n  if (idx === undefined) {\n    idx = new Map();\n    for (const [name, hex] of Object.entries(space.colors)) {\n      idx.set((hex as string).toLowerCase(), name);\n    }\n    reverseIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Canonical-key → Rgba entries for a given palette, built by parsing\n * each hex value once. Used by nearest-match lookups (identify, rgbaToPantone).\n */\nexport function getRgbaIndex(space: AnyPalette): Array<readonly [string, Rgba]> {\n  let idx = rgbaIndexCache.get(space);\n  if (idx === undefined) {\n    idx = Object.entries(space.colors).map(\n      ([name, hex]) => [name, hexToRgba(hex as HexColor)] as const,\n    );\n    rgbaIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Find the nearest-named entry in a palette to the given Rgba, using\n * squared Euclidean distance in sRGB (alpha ignored). Used by `identify`\n * and `rgbaToPantone` when metric === 'euclidean-srgb'.\n */\nexport function nearestByRgb(target: Rgba, space: AnyPalette): string {\n  const entries = getRgbaIndex(space);\n  let bestName = entries[0]?.[0] ?? '';\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const [name, candidate] of entries) {\n    const d = squaredDistanceRgb(target, candidate);\n    if (d < bestDistance) {\n      bestDistance = d;\n      bestName = name;\n    }\n  }\n  return bestName;\n}\n\n// Precomputed Lab entries for delta-E metrics. Same shape as rgba index.\ntype LabTriple = readonly [number, number, number];\nconst labIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getLabIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = labIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToLab(rgba)] as const);\n    labIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n// Precomputed linear-RGB entries for euclidean-linear metric.\nconst linearIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getLinearIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = linearIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToLinearRgb(rgba)] as const);\n    linearIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n// Precomputed OKLAB entries for deltaEok metric.\nconst oklabIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getOklabIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = oklabIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToOklab(rgba)] as const);\n    oklabIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Generic argmin over an `[name, value]` entries array with a custom\n * distance function. Factored so the three metric branches in `nearest`\n * share one loop body instead of duplicating it three times.\n */\nfunction argminBy<T>(\n  entries: Array<readonly [string, T]>,\n  target: T,\n  dist: (a: T, b: T) => number,\n): string {\n  let bestName = entries[0]?.[0] ?? '';\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const [name, candidate] of entries) {\n    const d = dist(target, candidate);\n    if (d < bestDistance) {\n      bestDistance = d;\n      bestName = name;\n    }\n  }\n  return bestName;\n}\n\n// Squared Euclidean on a [number, number, number] triple. Used for the\n// linear-RGB metric (sharing shape with Lab but different meaning).\nfunction squaredDistanceTriple(a: LabTriple, b: LabTriple): number {\n  const d0 = a[0] - b[0];\n  const d1 = a[1] - b[1];\n  const d2 = a[2] - b[2];\n  return d0 * d0 + d1 * d1 + d2 * d2;\n}\n\n/**\n * Find the nearest-named entry in a palette under the specified distance\n * metric. Dispatches to the right index (rgba / linear-rgb / Lab) and\n * the right distance function. See `DistanceMetric` in types.ts for how\n * to pick a metric.\n *\n * `metric` is required — callers should pass `space.defaultMetric` if\n * they want the palette's declared preference. A silent default would\n * hide the distance-metric choice from the hot path.\n */\nexport function nearest(target: Rgba, space: AnyPalette, metric: DistanceMetric): string {\n  if (metric === 'euclidean-srgb') return nearestByRgb(target, space);\n  if (metric === 'euclidean-linear') {\n    return argminBy(getLinearIndex(space), rgbaToLinearRgb(target), squaredDistanceTriple);\n  }\n  if (metric === 'deltaEok') {\n    return argminBy(getOklabIndex(space), rgbaToOklab(target), deltaEokSquared);\n  }\n  const labTarget = rgbaToLab(target);\n  const labIndex = getLabIndex(space);\n  if (metric === 'deltaE76') return argminBy(labIndex, labTarget, deltaE76Squared);\n  if (metric === 'deltaE94') return argminBy(labIndex, labTarget, deltaE94);\n  return argminBy(labIndex, labTarget, deltaE2000);\n}\n"]}
+{"version":3,"file":"indexing.d.ts","sourceRoot":"","sources":["../src/indexing.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,cAAc,EAAY,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAEvF;;;;;;GAMG;AAKH,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC9E,YAAY,EAAE,WAAW,EAAE,CAAC;AAE5B,KAAK,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;AAKlC;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,UAAU,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAWnE;AAID;;;;;;;;;GASG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAU1E;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAS9E;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,GAAG,MAAM,CAYpE;AAsED;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,cAAc,GAAG,MAAM,CAavF;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,IAAI,EACZ,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,cAAc,EACtB,CAAC,CAAC,EAAE,MAAM,GACT,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,CA2C3C","sourcesContent":["import { hexToRgba } from './conversions/hex.js';\nimport { rgbaToLab, rgbaToLinearRgb, rgbaToOklab } from './math/colorSpace.js';\nimport { deltaE76Squared, deltaE94, deltaE2000, deltaEokSquared } from './math/deltaE.js';\nimport { squaredDistanceRgb } from './math/euclideanDistance.js';\nimport type { DistanceMetric, HexColor, NormalizeFn, Palette, Rgba } from './types.js';\n\n/**\n * Per-palette lookup indexes for name resolution and nearest-match.\n *\n * Caches are keyed by the Palette wrapper (WeakMap), so each palette's\n * indexes are built once per process and reused by every caller —\n * including BYO palettes the user supplies.\n */\n\n// Re-export normalizers from their own module for backward compat with any\n// caller that expected them here. The functions live in ./palettes/normalize\n// so palette modules can import them without pulling this file's math graph.\nexport { pantoneNormalize, standardNormalize } from './palettes/normalize.js';\nexport type { NormalizeFn };\n\ntype AnyPalette = Palette<string>;\n\nconst nameIndexCache = new WeakMap<AnyPalette, Map<string, string>>();\nconst rgbaIndexCache = new WeakMap<AnyPalette, Array<readonly [string, Rgba]>>();\n\n/**\n * Normalized-name → canonical-key map for a given palette. Built once\n * per palette using its own `normalize` function.\n */\nexport function getNameIndex(space: AnyPalette): Map<string, string> {\n  let idx = nameIndexCache.get(space);\n  if (idx === undefined) {\n    idx = new Map();\n    const { normalize } = space;\n    for (const key of Object.keys(space.colors)) {\n      idx.set(normalize(key), key);\n    }\n    nameIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\nconst reverseIndexCache = new WeakMap<AnyPalette, Map<string, string>>();\n\n/**\n * Hex → canonical-key map (reverse of `palette.colors`). Built once per\n * palette. Used by `convert(color, { palette, format: 'NAME' })` for\n * O(1) exact reverse lookup. Returns `undefined` on miss — the caller\n * decides whether that's an error (convert throws; use `identify` for\n * nearest-match semantics).\n *\n * Hex values are lowercased for the key so callers can normalize their\n * input with `rgbaToHex(...).toLowerCase()` before lookup.\n */\nexport function getReverseNameIndex(space: AnyPalette): Map<string, string> {\n  let idx = reverseIndexCache.get(space);\n  if (idx === undefined) {\n    idx = new Map();\n    for (const [name, hex] of Object.entries(space.colors)) {\n      idx.set((hex as string).toLowerCase(), name);\n    }\n    reverseIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Canonical-key → Rgba entries for a given palette, built by parsing\n * each hex value once. Used by nearest-match lookups (identify, rgbaToPantone).\n */\nexport function getRgbaIndex(space: AnyPalette): Array<readonly [string, Rgba]> {\n  let idx = rgbaIndexCache.get(space);\n  if (idx === undefined) {\n    idx = Object.entries(space.colors).map(\n      ([name, hex]) => [name, hexToRgba(hex as HexColor)] as const,\n    );\n    rgbaIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Find the nearest-named entry in a palette to the given Rgba, using\n * squared Euclidean distance in sRGB (alpha ignored). Used by `identify`\n * and `rgbaToPantone` when metric === 'euclidean-srgb'.\n */\nexport function nearestByRgb(target: Rgba, space: AnyPalette): string {\n  const entries = getRgbaIndex(space);\n  let bestName = entries[0]?.[0] ?? '';\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const [name, candidate] of entries) {\n    const d = squaredDistanceRgb(target, candidate);\n    if (d < bestDistance) {\n      bestDistance = d;\n      bestName = name;\n    }\n  }\n  return bestName;\n}\n\n// Precomputed Lab entries for delta-E metrics. Same shape as rgba index.\ntype LabTriple = readonly [number, number, number];\nconst labIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getLabIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = labIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToLab(rgba)] as const);\n    labIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n// Precomputed linear-RGB entries for euclidean-linear metric.\nconst linearIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getLinearIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = linearIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToLinearRgb(rgba)] as const);\n    linearIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n// Precomputed OKLAB entries for deltaEok metric.\nconst oklabIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getOklabIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = oklabIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToOklab(rgba)] as const);\n    oklabIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Generic argmin over an `[name, value]` entries array with a custom\n * distance function. Factored so the three metric branches in `nearest`\n * share one loop body instead of duplicating it three times.\n */\nfunction argminBy<T>(\n  entries: Array<readonly [string, T]>,\n  target: T,\n  dist: (a: T, b: T) => number,\n): string {\n  let bestName = entries[0]?.[0] ?? '';\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const [name, candidate] of entries) {\n    const d = dist(target, candidate);\n    if (d < bestDistance) {\n      bestDistance = d;\n      bestName = name;\n    }\n  }\n  return bestName;\n}\n\n// Squared Euclidean on a [number, number, number] triple. Used for the\n// linear-RGB metric (sharing shape with Lab but different meaning).\nfunction squaredDistanceTriple(a: LabTriple, b: LabTriple): number {\n  const d0 = a[0] - b[0];\n  const d1 = a[1] - b[1];\n  const d2 = a[2] - b[2];\n  return d0 * d0 + d1 * d1 + d2 * d2;\n}\n\n/**\n * Find the nearest-named entry in a palette under the specified distance\n * metric. Dispatches to the right index (rgba / linear-rgb / Lab) and\n * the right distance function. See `DistanceMetric` in types.ts for how\n * to pick a metric.\n *\n * `metric` is required — callers should pass `space.defaultMetric` if\n * they want the palette's declared preference. A silent default would\n * hide the distance-metric choice from the hot path.\n */\nexport function nearest(target: Rgba, space: AnyPalette, metric: DistanceMetric): string {\n  if (metric === 'euclidean-srgb') return nearestByRgb(target, space);\n  if (metric === 'euclidean-linear') {\n    return argminBy(getLinearIndex(space), rgbaToLinearRgb(target), squaredDistanceTriple);\n  }\n  if (metric === 'deltaEok') {\n    return argminBy(getOklabIndex(space), rgbaToOklab(target), deltaEokSquared);\n  }\n  const labTarget = rgbaToLab(target);\n  const labIndex = getLabIndex(space);\n  if (metric === 'deltaE76') return argminBy(labIndex, labTarget, deltaE76Squared);\n  if (metric === 'deltaE94') return argminBy(labIndex, labTarget, deltaE94);\n  return argminBy(labIndex, labTarget, deltaE2000);\n}\n\n/**\n * Rank every palette entry by distance to `target`. Returns an array of\n * `{ name, distance }` sorted ascending (nearest first). Optional `k`\n * truncates to the top-k matches.\n *\n * Distances are **real** metric values (not squared) — ΔE76 / ΔE94 /\n * ΔE2000 / ΔE-OK are in standard ΔE units (≈1 = just-noticeable for\n * most of the gamut on ΔE76/2000); `euclidean-srgb` / `euclidean-linear`\n * are in their respective channel-unit Euclidean distances.\n *\n * Cost: O(n log n) for the sort vs O(n) for `nearest` — acceptable for\n * top-K queries. For strict \"what's the single nearest?\" stay on\n * `nearest` / `identify`.\n */\nexport function nearestAll(\n  target: Rgba,\n  space: AnyPalette,\n  metric: DistanceMetric,\n  k?: number,\n): Array<{ name: string; distance: number }> {\n  const ranked: Array<[string, number]> = [];\n\n  if (metric === 'euclidean-srgb') {\n    for (const [name, candidate] of getRgbaIndex(space)) {\n      ranked.push([name, Math.sqrt(squaredDistanceRgb(target, candidate))]);\n    }\n  } else if (metric === 'euclidean-linear') {\n    const tgt = rgbaToLinearRgb(target);\n    for (const [name, candidate] of getLinearIndex(space)) {\n      ranked.push([name, Math.sqrt(squaredDistanceTriple(tgt, candidate))]);\n    }\n  } else if (metric === 'deltaEok') {\n    const tgt = rgbaToOklab(target);\n    for (const [name, candidate] of getOklabIndex(space)) {\n      ranked.push([name, Math.sqrt(deltaEokSquared(tgt, candidate))]);\n    }\n  } else {\n    const tgt = rgbaToLab(target);\n    const labIndex = getLabIndex(space);\n    if (metric === 'deltaE76') {\n      for (const [name, candidate] of labIndex) {\n        ranked.push([name, Math.sqrt(deltaE76Squared(tgt, candidate))]);\n      }\n    } else if (metric === 'deltaE94') {\n      for (const [name, candidate] of labIndex) {\n        ranked.push([name, deltaE94(tgt, candidate)]);\n      }\n    } else {\n      for (const [name, candidate] of labIndex) {\n        ranked.push([name, deltaE2000(tgt, candidate)]);\n      }\n    }\n  }\n\n  ranked.sort((a, b) => a[1] - b[1]);\n  const limit = k === undefined ? ranked.length : Math.min(Math.max(k, 0), ranked.length);\n  const result: Array<{ name: string; distance: number }> = new Array(limit);\n  for (let i = 0; i < limit; i++) {\n    const entry = ranked[i];\n    if (entry !== undefined) result[i] = { name: entry[0], distance: entry[1] };\n  }\n  return result;\n}\n"]}

package/dist/indexing.js

@@ -164,4 +164,66 @@ export function nearest(target, space, metric) {
         return argminBy(labIndex, labTarget, deltaE94);
     return argminBy(labIndex, labTarget, deltaE2000);
 }
+/**
+ * Rank every palette entry by distance to `target`. Returns an array of
+ * `{ name, distance }` sorted ascending (nearest first). Optional `k`
+ * truncates to the top-k matches.
+ *
+ * Distances are **real** metric values (not squared) — ΔE76 / ΔE94 /
+ * ΔE2000 / ΔE-OK are in standard ΔE units (≈1 = just-noticeable for
+ * most of the gamut on ΔE76/2000); `euclidean-srgb` / `euclidean-linear`
+ * are in their respective channel-unit Euclidean distances.
+ *
+ * Cost: O(n log n) for the sort vs O(n) for `nearest` — acceptable for
+ * top-K queries. For strict "what's the single nearest?" stay on
+ * `nearest` / `identify`.
+ */
+export function nearestAll(target, space, metric, k) {
+    const ranked = [];
+    if (metric === 'euclidean-srgb') {
+        for (const [name, candidate] of getRgbaIndex(space)) {
+            ranked.push([name, Math.sqrt(squaredDistanceRgb(target, candidate))]);
+        }
+    }
+    else if (metric === 'euclidean-linear') {
+        const tgt = rgbaToLinearRgb(target);
+        for (const [name, candidate] of getLinearIndex(space)) {
+            ranked.push([name, Math.sqrt(squaredDistanceTriple(tgt, candidate))]);
+        }
+    }
+    else if (metric === 'deltaEok') {
+        const tgt = rgbaToOklab(target);
+        for (const [name, candidate] of getOklabIndex(space)) {
+            ranked.push([name, Math.sqrt(deltaEokSquared(tgt, candidate))]);
+        }
+    }
+    else {
+        const tgt = rgbaToLab(target);
+        const labIndex = getLabIndex(space);
+        if (metric === 'deltaE76') {
+            for (const [name, candidate] of labIndex) {
+                ranked.push([name, Math.sqrt(deltaE76Squared(tgt, candidate))]);
+            }
+        }
+        else if (metric === 'deltaE94') {
+            for (const [name, candidate] of labIndex) {
+                ranked.push([name, deltaE94(tgt, candidate)]);
+            }
+        }
+        else {
+            for (const [name, candidate] of labIndex) {
+                ranked.push([name, deltaE2000(tgt, candidate)]);
+            }
+        }
+    }
+    ranked.sort((a, b) => a[1] - b[1]);
+    const limit = k === undefined ? ranked.length : Math.min(Math.max(k, 0), ranked.length);
+    const result = new Array(limit);
+    for (let i = 0; i < limit; i++) {
+        const entry = ranked[i];
+        if (entry !== undefined)
+            result[i] = { name: entry[0], distance: entry[1] };
+    }
+    return result;
+}
 //# sourceMappingURL=indexing.js.map

package/dist/indexing.js.map

@@ -1 +1 @@
-{"version":3,"file":"indexing.js","sourceRoot":"","sources":["../src/indexing.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAC1F,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAGjE;;;;;;GAMG;AAEH,2EAA2E;AAC3E,6EAA6E;AAC7E,6EAA6E;AAC7E,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAK9E,MAAM,cAAc,GAAG,IAAI,OAAO,EAAmC,CAAC;AACtE,MAAM,cAAc,GAAG,IAAI,OAAO,EAA8C,CAAC;AAEjF;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAiB;IAC5C,IAAI,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,MAAM,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5C,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/B,CAAC;QACD,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,iBAAiB,GAAG,IAAI,OAAO,EAAmC,CAAC;AAEzE;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAiB;IACnD,IAAI,GAAG,GAAG,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,GAAG,CAAC,GAAG,CAAE,GAAc,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/C,CAAC;QACD,iBAAiB,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAiB;IAC5C,IAAI,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CACpC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,GAAe,CAAC,CAAU,CAC7D,CAAC;QACF,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,MAAY,EAAE,KAAiB;IAC1D,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC;YACrB,YAAY,GAAG,CAAC,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAID,MAAM,aAAa,GAAG,IAAI,OAAO,EAAmD,CAAC;AAErF,SAAS,WAAW,CAAC,KAAiB;IACpC,IAAI,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,CAAU,CAAC,CAAC;QAClF,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8DAA8D;AAC9D,MAAM,gBAAgB,GAAG,IAAI,OAAO,EAAmD,CAAC;AAExF,SAAS,cAAc,CAAC,KAAiB;IACvC,IAAI,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,eAAe,CAAC,IAAI,CAAC,CAAU,CAAC,CAAC;QACxF,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iDAAiD;AACjD,MAAM,eAAe,GAAG,IAAI,OAAO,EAAmD,CAAC;AAEvF,SAAS,aAAa,CAAC,KAAiB;IACtC,IAAI,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACrC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,CAAU,CAAC,CAAC;QACpF,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CACf,OAAoC,EACpC,MAAS,EACT,IAA4B;IAE5B,IAAI,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC;YACrB,YAAY,GAAG,CAAC,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,uEAAuE;AACvE,oEAAoE;AACpE,SAAS,qBAAqB,CAAC,CAAY,EAAE,CAAY;IACvD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACrC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,OAAO,CAAC,MAAY,EAAE,KAAiB,EAAE,MAAsB;IAC7E,IAAI,MAAM,KAAK,gBAAgB;QAAE,OAAO,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACpE,IAAI,MAAM,KAAK,kBAAkB,EAAE,CAAC;QAClC,OAAO,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,eAAe,CAAC,MAAM,CAAC,EAAE,qBAAqB,CAAC,CAAC;IACzF,CAAC;IACD,IAAI,MAAM,KAAK,UAAU,EAAE,CAAC;QAC1B,OAAO,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,CAAC;IAC9E,CAAC;IACD,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,MAAM,KAAK,UAAU;QAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;IACjF,IAAI,MAAM,KAAK,UAAU;QAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC1E,OAAO,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;AACnD,CAAC","sourcesContent":["import { hexToRgba } from './conversions/hex.js';\nimport { rgbaToLab, rgbaToLinearRgb, rgbaToOklab } from './math/colorSpace.js';\nimport { deltaE76Squared, deltaE94, deltaE2000, deltaEokSquared } from './math/deltaE.js';\nimport { squaredDistanceRgb } from './math/euclideanDistance.js';\nimport type { DistanceMetric, HexColor, NormalizeFn, Palette, Rgba } from './types.js';\n\n/**\n * Per-palette lookup indexes for name resolution and nearest-match.\n *\n * Caches are keyed by the Palette wrapper (WeakMap), so each palette's\n * indexes are built once per process and reused by every caller —\n * including BYO palettes the user supplies.\n */\n\n// Re-export normalizers from their own module for backward compat with any\n// caller that expected them here. The functions live in ./palettes/normalize\n// so palette modules can import them without pulling this file's math graph.\nexport { pantoneNormalize, standardNormalize } from './palettes/normalize.js';\nexport type { NormalizeFn };\n\ntype AnyPalette = Palette<string>;\n\nconst nameIndexCache = new WeakMap<AnyPalette, Map<string, string>>();\nconst rgbaIndexCache = new WeakMap<AnyPalette, Array<readonly [string, Rgba]>>();\n\n/**\n * Normalized-name → canonical-key map for a given palette. Built once\n * per palette using its own `normalize` function.\n */\nexport function getNameIndex(space: AnyPalette): Map<string, string> {\n  let idx = nameIndexCache.get(space);\n  if (idx === undefined) {\n    idx = new Map();\n    const { normalize } = space;\n    for (const key of Object.keys(space.colors)) {\n      idx.set(normalize(key), key);\n    }\n    nameIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\nconst reverseIndexCache = new WeakMap<AnyPalette, Map<string, string>>();\n\n/**\n * Hex → canonical-key map (reverse of `palette.colors`). Built once per\n * palette. Used by `convert(color, { palette, format: 'NAME' })` for\n * O(1) exact reverse lookup. Returns `undefined` on miss — the caller\n * decides whether that's an error (convert throws; use `identify` for\n * nearest-match semantics).\n *\n * Hex values are lowercased for the key so callers can normalize their\n * input with `rgbaToHex(...).toLowerCase()` before lookup.\n */\nexport function getReverseNameIndex(space: AnyPalette): Map<string, string> {\n  let idx = reverseIndexCache.get(space);\n  if (idx === undefined) {\n    idx = new Map();\n    for (const [name, hex] of Object.entries(space.colors)) {\n      idx.set((hex as string).toLowerCase(), name);\n    }\n    reverseIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Canonical-key → Rgba entries for a given palette, built by parsing\n * each hex value once. Used by nearest-match lookups (identify, rgbaToPantone).\n */\nexport function getRgbaIndex(space: AnyPalette): Array<readonly [string, Rgba]> {\n  let idx = rgbaIndexCache.get(space);\n  if (idx === undefined) {\n    idx = Object.entries(space.colors).map(\n      ([name, hex]) => [name, hexToRgba(hex as HexColor)] as const,\n    );\n    rgbaIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Find the nearest-named entry in a palette to the given Rgba, using\n * squared Euclidean distance in sRGB (alpha ignored). Used by `identify`\n * and `rgbaToPantone` when metric === 'euclidean-srgb'.\n */\nexport function nearestByRgb(target: Rgba, space: AnyPalette): string {\n  const entries = getRgbaIndex(space);\n  let bestName = entries[0]?.[0] ?? '';\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const [name, candidate] of entries) {\n    const d = squaredDistanceRgb(target, candidate);\n    if (d < bestDistance) {\n      bestDistance = d;\n      bestName = name;\n    }\n  }\n  return bestName;\n}\n\n// Precomputed Lab entries for delta-E metrics. Same shape as rgba index.\ntype LabTriple = readonly [number, number, number];\nconst labIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getLabIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = labIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToLab(rgba)] as const);\n    labIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n// Precomputed linear-RGB entries for euclidean-linear metric.\nconst linearIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getLinearIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = linearIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToLinearRgb(rgba)] as const);\n    linearIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n// Precomputed OKLAB entries for deltaEok metric.\nconst oklabIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getOklabIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = oklabIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToOklab(rgba)] as const);\n    oklabIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Generic argmin over an `[name, value]` entries array with a custom\n * distance function. Factored so the three metric branches in `nearest`\n * share one loop body instead of duplicating it three times.\n */\nfunction argminBy<T>(\n  entries: Array<readonly [string, T]>,\n  target: T,\n  dist: (a: T, b: T) => number,\n): string {\n  let bestName = entries[0]?.[0] ?? '';\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const [name, candidate] of entries) {\n    const d = dist(target, candidate);\n    if (d < bestDistance) {\n      bestDistance = d;\n      bestName = name;\n    }\n  }\n  return bestName;\n}\n\n// Squared Euclidean on a [number, number, number] triple. Used for the\n// linear-RGB metric (sharing shape with Lab but different meaning).\nfunction squaredDistanceTriple(a: LabTriple, b: LabTriple): number {\n  const d0 = a[0] - b[0];\n  const d1 = a[1] - b[1];\n  const d2 = a[2] - b[2];\n  return d0 * d0 + d1 * d1 + d2 * d2;\n}\n\n/**\n * Find the nearest-named entry in a palette under the specified distance\n * metric. Dispatches to the right index (rgba / linear-rgb / Lab) and\n * the right distance function. See `DistanceMetric` in types.ts for how\n * to pick a metric.\n *\n * `metric` is required — callers should pass `space.defaultMetric` if\n * they want the palette's declared preference. A silent default would\n * hide the distance-metric choice from the hot path.\n */\nexport function nearest(target: Rgba, space: AnyPalette, metric: DistanceMetric): string {\n  if (metric === 'euclidean-srgb') return nearestByRgb(target, space);\n  if (metric === 'euclidean-linear') {\n    return argminBy(getLinearIndex(space), rgbaToLinearRgb(target), squaredDistanceTriple);\n  }\n  if (metric === 'deltaEok') {\n    return argminBy(getOklabIndex(space), rgbaToOklab(target), deltaEokSquared);\n  }\n  const labTarget = rgbaToLab(target);\n  const labIndex = getLabIndex(space);\n  if (metric === 'deltaE76') return argminBy(labIndex, labTarget, deltaE76Squared);\n  if (metric === 'deltaE94') return argminBy(labIndex, labTarget, deltaE94);\n  return argminBy(labIndex, labTarget, deltaE2000);\n}\n"]}
+{"version":3,"file":"indexing.js","sourceRoot":"","sources":["../src/indexing.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAC1F,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAGjE;;;;;;GAMG;AAEH,2EAA2E;AAC3E,6EAA6E;AAC7E,6EAA6E;AAC7E,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAK9E,MAAM,cAAc,GAAG,IAAI,OAAO,EAAmC,CAAC;AACtE,MAAM,cAAc,GAAG,IAAI,OAAO,EAA8C,CAAC;AAEjF;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAiB;IAC5C,IAAI,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,MAAM,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5C,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/B,CAAC;QACD,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,iBAAiB,GAAG,IAAI,OAAO,EAAmC,CAAC;AAEzE;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAiB;IACnD,IAAI,GAAG,GAAG,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,GAAG,CAAC,GAAG,CAAE,GAAc,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/C,CAAC;QACD,iBAAiB,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAiB;IAC5C,IAAI,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CACpC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,GAAe,CAAC,CAAU,CAC7D,CAAC;QACF,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,MAAY,EAAE,KAAiB;IAC1D,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC;YACrB,YAAY,GAAG,CAAC,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAID,MAAM,aAAa,GAAG,IAAI,OAAO,EAAmD,CAAC;AAErF,SAAS,WAAW,CAAC,KAAiB;IACpC,IAAI,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,CAAU,CAAC,CAAC;QAClF,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8DAA8D;AAC9D,MAAM,gBAAgB,GAAG,IAAI,OAAO,EAAmD,CAAC;AAExF,SAAS,cAAc,CAAC,KAAiB;IACvC,IAAI,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,eAAe,CAAC,IAAI,CAAC,CAAU,CAAC,CAAC;QACxF,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iDAAiD;AACjD,MAAM,eAAe,GAAG,IAAI,OAAO,EAAmD,CAAC;AAEvF,SAAS,aAAa,CAAC,KAAiB;IACtC,IAAI,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACrC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,CAAU,CAAC,CAAC;QACpF,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CACf,OAAoC,EACpC,MAAS,EACT,IAA4B;IAE5B,IAAI,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC;YACrB,YAAY,GAAG,CAAC,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,uEAAuE;AACvE,oEAAoE;AACpE,SAAS,qBAAqB,CAAC,CAAY,EAAE,CAAY;IACvD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACrC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,OAAO,CAAC,MAAY,EAAE,KAAiB,EAAE,MAAsB;IAC7E,IAAI,MAAM,KAAK,gBAAgB;QAAE,OAAO,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACpE,IAAI,MAAM,KAAK,kBAAkB,EAAE,CAAC;QAClC,OAAO,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,eAAe,CAAC,MAAM,CAAC,EAAE,qBAAqB,CAAC,CAAC;IACzF,CAAC;IACD,IAAI,MAAM,KAAK,UAAU,EAAE,CAAC;QAC1B,OAAO,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,CAAC;IAC9E,CAAC;IACD,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,MAAM,KAAK,UAAU;QAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;IACjF,IAAI,MAAM,KAAK,UAAU;QAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC1E,OAAO,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,UAAU,CACxB,MAAY,EACZ,KAAiB,EACjB,MAAsB,EACtB,CAAU;IAEV,MAAM,MAAM,GAA4B,EAAE,CAAC;IAE3C,IAAI,MAAM,KAAK,gBAAgB,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;YACpD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;SAAM,IAAI,MAAM,KAAK,kBAAkB,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC;YACtD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;SAAM,IAAI,MAAM,KAAK,UAAU,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,MAAM,KAAK,UAAU,EAAE,CAAC;YAC1B,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,KAAK,UAAU,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IACxF,MAAM,MAAM,GAA8C,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,KAAK,KAAK,SAAS;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9E,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["import { hexToRgba } from './conversions/hex.js';\nimport { rgbaToLab, rgbaToLinearRgb, rgbaToOklab } from './math/colorSpace.js';\nimport { deltaE76Squared, deltaE94, deltaE2000, deltaEokSquared } from './math/deltaE.js';\nimport { squaredDistanceRgb } from './math/euclideanDistance.js';\nimport type { DistanceMetric, HexColor, NormalizeFn, Palette, Rgba } from './types.js';\n\n/**\n * Per-palette lookup indexes for name resolution and nearest-match.\n *\n * Caches are keyed by the Palette wrapper (WeakMap), so each palette's\n * indexes are built once per process and reused by every caller —\n * including BYO palettes the user supplies.\n */\n\n// Re-export normalizers from their own module for backward compat with any\n// caller that expected them here. The functions live in ./palettes/normalize\n// so palette modules can import them without pulling this file's math graph.\nexport { pantoneNormalize, standardNormalize } from './palettes/normalize.js';\nexport type { NormalizeFn };\n\ntype AnyPalette = Palette<string>;\n\nconst nameIndexCache = new WeakMap<AnyPalette, Map<string, string>>();\nconst rgbaIndexCache = new WeakMap<AnyPalette, Array<readonly [string, Rgba]>>();\n\n/**\n * Normalized-name → canonical-key map for a given palette. Built once\n * per palette using its own `normalize` function.\n */\nexport function getNameIndex(space: AnyPalette): Map<string, string> {\n  let idx = nameIndexCache.get(space);\n  if (idx === undefined) {\n    idx = new Map();\n    const { normalize } = space;\n    for (const key of Object.keys(space.colors)) {\n      idx.set(normalize(key), key);\n    }\n    nameIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\nconst reverseIndexCache = new WeakMap<AnyPalette, Map<string, string>>();\n\n/**\n * Hex → canonical-key map (reverse of `palette.colors`). Built once per\n * palette. Used by `convert(color, { palette, format: 'NAME' })` for\n * O(1) exact reverse lookup. Returns `undefined` on miss — the caller\n * decides whether that's an error (convert throws; use `identify` for\n * nearest-match semantics).\n *\n * Hex values are lowercased for the key so callers can normalize their\n * input with `rgbaToHex(...).toLowerCase()` before lookup.\n */\nexport function getReverseNameIndex(space: AnyPalette): Map<string, string> {\n  let idx = reverseIndexCache.get(space);\n  if (idx === undefined) {\n    idx = new Map();\n    for (const [name, hex] of Object.entries(space.colors)) {\n      idx.set((hex as string).toLowerCase(), name);\n    }\n    reverseIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Canonical-key → Rgba entries for a given palette, built by parsing\n * each hex value once. Used by nearest-match lookups (identify, rgbaToPantone).\n */\nexport function getRgbaIndex(space: AnyPalette): Array<readonly [string, Rgba]> {\n  let idx = rgbaIndexCache.get(space);\n  if (idx === undefined) {\n    idx = Object.entries(space.colors).map(\n      ([name, hex]) => [name, hexToRgba(hex as HexColor)] as const,\n    );\n    rgbaIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Find the nearest-named entry in a palette to the given Rgba, using\n * squared Euclidean distance in sRGB (alpha ignored). Used by `identify`\n * and `rgbaToPantone` when metric === 'euclidean-srgb'.\n */\nexport function nearestByRgb(target: Rgba, space: AnyPalette): string {\n  const entries = getRgbaIndex(space);\n  let bestName = entries[0]?.[0] ?? '';\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const [name, candidate] of entries) {\n    const d = squaredDistanceRgb(target, candidate);\n    if (d < bestDistance) {\n      bestDistance = d;\n      bestName = name;\n    }\n  }\n  return bestName;\n}\n\n// Precomputed Lab entries for delta-E metrics. Same shape as rgba index.\ntype LabTriple = readonly [number, number, number];\nconst labIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getLabIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = labIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToLab(rgba)] as const);\n    labIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n// Precomputed linear-RGB entries for euclidean-linear metric.\nconst linearIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getLinearIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = linearIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToLinearRgb(rgba)] as const);\n    linearIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n// Precomputed OKLAB entries for deltaEok metric.\nconst oklabIndexCache = new WeakMap<AnyPalette, Array<readonly [string, LabTriple]>>();\n\nfunction getOklabIndex(space: AnyPalette): Array<readonly [string, LabTriple]> {\n  let idx = oklabIndexCache.get(space);\n  if (idx === undefined) {\n    idx = getRgbaIndex(space).map(([name, rgba]) => [name, rgbaToOklab(rgba)] as const);\n    oklabIndexCache.set(space, idx);\n  }\n  return idx;\n}\n\n/**\n * Generic argmin over an `[name, value]` entries array with a custom\n * distance function. Factored so the three metric branches in `nearest`\n * share one loop body instead of duplicating it three times.\n */\nfunction argminBy<T>(\n  entries: Array<readonly [string, T]>,\n  target: T,\n  dist: (a: T, b: T) => number,\n): string {\n  let bestName = entries[0]?.[0] ?? '';\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const [name, candidate] of entries) {\n    const d = dist(target, candidate);\n    if (d < bestDistance) {\n      bestDistance = d;\n      bestName = name;\n    }\n  }\n  return bestName;\n}\n\n// Squared Euclidean on a [number, number, number] triple. Used for the\n// linear-RGB metric (sharing shape with Lab but different meaning).\nfunction squaredDistanceTriple(a: LabTriple, b: LabTriple): number {\n  const d0 = a[0] - b[0];\n  const d1 = a[1] - b[1];\n  const d2 = a[2] - b[2];\n  return d0 * d0 + d1 * d1 + d2 * d2;\n}\n\n/**\n * Find the nearest-named entry in a palette under the specified distance\n * metric. Dispatches to the right index (rgba / linear-rgb / Lab) and\n * the right distance function. See `DistanceMetric` in types.ts for how\n * to pick a metric.\n *\n * `metric` is required — callers should pass `space.defaultMetric` if\n * they want the palette's declared preference. A silent default would\n * hide the distance-metric choice from the hot path.\n */\nexport function nearest(target: Rgba, space: AnyPalette, metric: DistanceMetric): string {\n  if (metric === 'euclidean-srgb') return nearestByRgb(target, space);\n  if (metric === 'euclidean-linear') {\n    return argminBy(getLinearIndex(space), rgbaToLinearRgb(target), squaredDistanceTriple);\n  }\n  if (metric === 'deltaEok') {\n    return argminBy(getOklabIndex(space), rgbaToOklab(target), deltaEokSquared);\n  }\n  const labTarget = rgbaToLab(target);\n  const labIndex = getLabIndex(space);\n  if (metric === 'deltaE76') return argminBy(labIndex, labTarget, deltaE76Squared);\n  if (metric === 'deltaE94') return argminBy(labIndex, labTarget, deltaE94);\n  return argminBy(labIndex, labTarget, deltaE2000);\n}\n\n/**\n * Rank every palette entry by distance to `target`. Returns an array of\n * `{ name, distance }` sorted ascending (nearest first). Optional `k`\n * truncates to the top-k matches.\n *\n * Distances are **real** metric values (not squared) — ΔE76 / ΔE94 /\n * ΔE2000 / ΔE-OK are in standard ΔE units (≈1 = just-noticeable for\n * most of the gamut on ΔE76/2000); `euclidean-srgb` / `euclidean-linear`\n * are in their respective channel-unit Euclidean distances.\n *\n * Cost: O(n log n) for the sort vs O(n) for `nearest` — acceptable for\n * top-K queries. For strict \"what's the single nearest?\" stay on\n * `nearest` / `identify`.\n */\nexport function nearestAll(\n  target: Rgba,\n  space: AnyPalette,\n  metric: DistanceMetric,\n  k?: number,\n): Array<{ name: string; distance: number }> {\n  const ranked: Array<[string, number]> = [];\n\n  if (metric === 'euclidean-srgb') {\n    for (const [name, candidate] of getRgbaIndex(space)) {\n      ranked.push([name, Math.sqrt(squaredDistanceRgb(target, candidate))]);\n    }\n  } else if (metric === 'euclidean-linear') {\n    const tgt = rgbaToLinearRgb(target);\n    for (const [name, candidate] of getLinearIndex(space)) {\n      ranked.push([name, Math.sqrt(squaredDistanceTriple(tgt, candidate))]);\n    }\n  } else if (metric === 'deltaEok') {\n    const tgt = rgbaToOklab(target);\n    for (const [name, candidate] of getOklabIndex(space)) {\n      ranked.push([name, Math.sqrt(deltaEokSquared(tgt, candidate))]);\n    }\n  } else {\n    const tgt = rgbaToLab(target);\n    const labIndex = getLabIndex(space);\n    if (metric === 'deltaE76') {\n      for (const [name, candidate] of labIndex) {\n        ranked.push([name, Math.sqrt(deltaE76Squared(tgt, candidate))]);\n      }\n    } else if (metric === 'deltaE94') {\n      for (const [name, candidate] of labIndex) {\n        ranked.push([name, deltaE94(tgt, candidate)]);\n      }\n    } else {\n      for (const [name, candidate] of labIndex) {\n        ranked.push([name, deltaE2000(tgt, candidate)]);\n      }\n    }\n  }\n\n  ranked.sort((a, b) => a[1] - b[1]);\n  const limit = k === undefined ? ranked.length : Math.min(Math.max(k, 0), ranked.length);\n  const result: Array<{ name: string; distance: number }> = new Array(limit);\n  for (let i = 0; i < limit; i++) {\n    const entry = ranked[i];\n    if (entry !== undefined) result[i] = { name: entry[0], distance: entry[1] };\n  }\n  return result;\n}\n"]}

package/dist/math/editDistance.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Levenshtein edit distance between two strings. Classic dynamic-programming
+ * implementation; returns the minimum number of single-character insertions,
+ * deletions, or substitutions required to transform `a` into `b`.
+ *
+ * Used by `resolve(_, { k })` for fuzzy-name matching — operating on the
+ * palette's already-normalized keys (lowercase, alphanumeric) so typos,
+ * casing, and punctuation all reduce to the same canonical forms before
+ * the edit distance is measured.
+ *
+ * Space-optimized: uses two rolling rows instead of a full n×m matrix
+ * (O(min(n,m)) space, O(n·m) time). For palette keys (< 20 chars each)
+ * this runs sub-microsecond per pair, so a full scan over 907 Pantone
+ * entries fits well inside a millisecond.
+ */
+export declare function levenshtein(a: string, b: string): number;
+//# sourceMappingURL=editDistance.d.ts.map

package/dist/math/editDistance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"editDistance.d.ts","sourceRoot":"","sources":["../../src/math/editDistance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CA8BxD","sourcesContent":["/**\n * Levenshtein edit distance between two strings. Classic dynamic-programming\n * implementation; returns the minimum number of single-character insertions,\n * deletions, or substitutions required to transform `a` into `b`.\n *\n * Used by `resolve(_, { k })` for fuzzy-name matching — operating on the\n * palette's already-normalized keys (lowercase, alphanumeric) so typos,\n * casing, and punctuation all reduce to the same canonical forms before\n * the edit distance is measured.\n *\n * Space-optimized: uses two rolling rows instead of a full n×m matrix\n * (O(min(n,m)) space, O(n·m) time). For palette keys (< 20 chars each)\n * this runs sub-microsecond per pair, so a full scan over 907 Pantone\n * entries fits well inside a millisecond.\n */\nexport function levenshtein(a: string, b: string): number {\n  if (a === b) return 0;\n  if (a.length === 0) return b.length;\n  if (b.length === 0) return a.length;\n\n  // Ensure `a` is the shorter string so the rolling row is minimal.\n  if (a.length > b.length) [a, b] = [b, a];\n\n  const aLen = a.length;\n  const bLen = b.length;\n\n  // `prev[i]` = edit distance between a[0..i] and b[0..j-1] (previous row).\n  // `curr[i]` = edit distance between a[0..i] and b[0..j]   (current row).\n  let prev = new Array<number>(aLen + 1);\n  let curr = new Array<number>(aLen + 1);\n  for (let i = 0; i <= aLen; i++) prev[i] = i;\n\n  for (let j = 1; j <= bLen; j++) {\n    curr[0] = j;\n    const bj = b.charCodeAt(j - 1);\n    for (let i = 1; i <= aLen; i++) {\n      const cost = a.charCodeAt(i - 1) === bj ? 0 : 1;\n      const deletion = (prev[i] ?? 0) + 1;\n      const insertion = (curr[i - 1] ?? 0) + 1;\n      const substitution = (prev[i - 1] ?? 0) + cost;\n      curr[i] = Math.min(deletion, insertion, substitution);\n    }\n    [prev, curr] = [curr, prev];\n  }\n  return prev[aLen] ?? 0;\n}\n"]}

package/dist/math/editDistance.js

@@ -0,0 +1,48 @@
+/**
+ * Levenshtein edit distance between two strings. Classic dynamic-programming
+ * implementation; returns the minimum number of single-character insertions,
+ * deletions, or substitutions required to transform `a` into `b`.
+ *
+ * Used by `resolve(_, { k })` for fuzzy-name matching — operating on the
+ * palette's already-normalized keys (lowercase, alphanumeric) so typos,
+ * casing, and punctuation all reduce to the same canonical forms before
+ * the edit distance is measured.
+ *
+ * Space-optimized: uses two rolling rows instead of a full n×m matrix
+ * (O(min(n,m)) space, O(n·m) time). For palette keys (< 20 chars each)
+ * this runs sub-microsecond per pair, so a full scan over 907 Pantone
+ * entries fits well inside a millisecond.
+ */
+export function levenshtein(a, b) {
+    if (a === b)
+        return 0;
+    if (a.length === 0)
+        return b.length;
+    if (b.length === 0)
+        return a.length;
+    // Ensure `a` is the shorter string so the rolling row is minimal.
+    if (a.length > b.length)
+        [a, b] = [b, a];
+    const aLen = a.length;
+    const bLen = b.length;
+    // `prev[i]` = edit distance between a[0..i] and b[0..j-1] (previous row).
+    // `curr[i]` = edit distance between a[0..i] and b[0..j]   (current row).
+    let prev = new Array(aLen + 1);
+    let curr = new Array(aLen + 1);
+    for (let i = 0; i <= aLen; i++)
+        prev[i] = i;
+    for (let j = 1; j <= bLen; j++) {
+        curr[0] = j;
+        const bj = b.charCodeAt(j - 1);
+        for (let i = 1; i <= aLen; i++) {
+            const cost = a.charCodeAt(i - 1) === bj ? 0 : 1;
+            const deletion = (prev[i] ?? 0) + 1;
+            const insertion = (curr[i - 1] ?? 0) + 1;
+            const substitution = (prev[i - 1] ?? 0) + cost;
+            curr[i] = Math.min(deletion, insertion, substitution);
+        }
+        [prev, curr] = [curr, prev];
+    }
+    return prev[aLen] ?? 0;
+}
+//# sourceMappingURL=editDistance.js.map

package/dist/math/editDistance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"editDistance.js","sourceRoot":"","sources":["../../src/math/editDistance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IACpC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IAEpC,kEAAkE;IAClE,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;QAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEzC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;IAEtB,0EAA0E;IAC1E,yEAAyE;IACzE,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,IAAI,GAAG,CAAC,CAAC,CAAC;IACvC,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,IAAI,GAAG,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,MAAM,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACpC,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACzC,MAAM,YAAY,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;YAC/C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QACxD,CAAC;QACD,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACzB,CAAC","sourcesContent":["/**\n * Levenshtein edit distance between two strings. Classic dynamic-programming\n * implementation; returns the minimum number of single-character insertions,\n * deletions, or substitutions required to transform `a` into `b`.\n *\n * Used by `resolve(_, { k })` for fuzzy-name matching — operating on the\n * palette's already-normalized keys (lowercase, alphanumeric) so typos,\n * casing, and punctuation all reduce to the same canonical forms before\n * the edit distance is measured.\n *\n * Space-optimized: uses two rolling rows instead of a full n×m matrix\n * (O(min(n,m)) space, O(n·m) time). For palette keys (< 20 chars each)\n * this runs sub-microsecond per pair, so a full scan over 907 Pantone\n * entries fits well inside a millisecond.\n */\nexport function levenshtein(a: string, b: string): number {\n  if (a === b) return 0;\n  if (a.length === 0) return b.length;\n  if (b.length === 0) return a.length;\n\n  // Ensure `a` is the shorter string so the rolling row is minimal.\n  if (a.length > b.length) [a, b] = [b, a];\n\n  const aLen = a.length;\n  const bLen = b.length;\n\n  // `prev[i]` = edit distance between a[0..i] and b[0..j-1] (previous row).\n  // `curr[i]` = edit distance between a[0..i] and b[0..j]   (current row).\n  let prev = new Array<number>(aLen + 1);\n  let curr = new Array<number>(aLen + 1);\n  for (let i = 0; i <= aLen; i++) prev[i] = i;\n\n  for (let j = 1; j <= bLen; j++) {\n    curr[0] = j;\n    const bj = b.charCodeAt(j - 1);\n    for (let i = 1; i <= aLen; i++) {\n      const cost = a.charCodeAt(i - 1) === bj ? 0 : 1;\n      const deletion = (prev[i] ?? 0) + 1;\n      const insertion = (curr[i - 1] ?? 0) + 1;\n      const substitution = (prev[i - 1] ?? 0) + cost;\n      curr[i] = Math.min(deletion, insertion, substitution);\n    }\n    [prev, curr] = [curr, prev];\n  }\n  return prev[aLen] ?? 0;\n}\n"]}

package/dist/palettes/crayola.d.ts

@@ -0,0 +1,200 @@
+/**
+ * Crayola crayon colors — canonical subset. ~85 entries covering the
+ * current 64-standard box, iconic fluorescents, and widely-recognized
+ * modern additions.
+ *
+ * Keys are Title Case with spaces (`'Granny Smith Apple'`,
+ * `'Razzmatazz'`) — how the names are printed on the crayon wrapper.
+ * `standardNormalize` strips spaces + case + punctuation on input, so
+ * `resolve('granny-smith-apple')` and `resolve('Granny Smith Apple')`
+ * both hit the same entry.
+ *
+ * sRGB values are community-sourced approximations (Wikipedia's
+ * well-cited list of Crayola crayon colors). They do not represent
+ * a licensed Crayola reference. See NOTICE.md for trademark note.
+ *
+ * Default metric: `deltaEok`. The Crayola set spans a wide gamut with
+ * many saturated brights (fluorescents especially) where CIELAB-based
+ * metrics are less perceptually uniform than OKLAB. Same cost profile
+ * as deltaE76, better neighbor selection in saturated regions.
+ */
+declare const crayolaColors: {
+    readonly Red: '#ee204d';
+    readonly 'Red Orange': '#ff5349';
+    readonly Orange: '#ff7538';
+    readonly 'Yellow Orange': '#ffae42';
+    readonly Yellow: '#fce883';
+    readonly 'Yellow Green': '#c5e384';
+    readonly Green: '#1cac78';
+    readonly 'Blue Green': '#0d98ba';
+    readonly Blue: '#1f75fe';
+    readonly 'Blue Violet': '#7366bd';
+    readonly Violet: '#926eae';
+    readonly 'Red Violet': '#c0448f';
+    readonly Black: '#232323';
+    readonly Brown: '#b4674d';
+    readonly White: '#ededed';
+    readonly Gray: '#95918c';
+    readonly 'Carnation Pink': '#ffaacc';
+    readonly 'Sky Blue': '#80daeb';
+    readonly Tan: '#faa76c';
+    readonly Apricot: '#fdd9b5';
+    readonly Peach: '#ffcfab';
+    readonly 'Cadet Blue': '#b0b7c6';
+    readonly Salmon: '#ff9baa';
+    readonly 'Forest Green': '#6dae81';
+    readonly 'Lemon Yellow': '#fff44f';
+    readonly Mahogany: '#cd4a4c';
+    readonly Maroon: '#c8385a';
+    readonly Bittersweet: '#fd7c6e';
+    readonly Sepia: '#a5694f';
+    readonly 'Burnt Sienna': '#ea7e5d';
+    readonly 'Burnt Orange': '#ff7f49';
+    readonly 'Raw Sienna': '#d68a59';
+    readonly Silver: '#cdc5c2';
+    readonly Gold: '#e7c697';
+    readonly Copper: '#dd9475';
+    readonly 'Green Yellow': '#f0e891';
+    readonly 'Pine Green': '#158078';
+    readonly 'Olive Green': '#bab86c';
+    readonly Indigo: '#5d76cb';
+    readonly Periwinkle: '#c5d0e6';
+    readonly Cerulean: '#1dacd6';
+    readonly 'Sea Green': '#9fe2bf';
+    readonly 'Turquoise Blue': '#77dde7';
+    readonly 'Atomic Tangerine': '#ff9966';
+    readonly 'Blizzard Blue': '#ace5ee';
+    readonly 'Hot Magenta': '#ff1dce';
+    readonly 'Laser Lemon': '#fdfc74';
+    readonly 'Neon Carrot': '#ffa343';
+    readonly 'Purple Pizzazz': '#fe4eda';
+    readonly 'Razzle Dazzle Rose': '#ff48d0';
+    readonly Razzmatazz: '#e3256b';
+    readonly "Screamin' Green": '#76ff7a';
+    readonly 'Shocking Pink': '#fb7efd';
+    readonly 'Tickle Me Pink': '#fc89ac';
+    readonly 'Unmellow Yellow': '#ffff66';
+    readonly 'Wild Watermelon': '#fc6c85';
+    readonly 'Outrageous Orange': '#ff6e4a';
+    readonly 'Electric Lime': '#ceff1d';
+    readonly 'Granny Smith Apple': '#a8e4a0';
+    readonly 'Macaroni and Cheese': '#ffbd88';
+    readonly 'Banana Mania': '#fae7b5';
+    readonly 'Caribbean Green': '#1cd3a2';
+    readonly Cerise: '#dd4492';
+    readonly 'Cotton Candy': '#ffbcd9';
+    readonly 'Fuzzy Wuzzy': '#cc6666';
+    readonly Inchworm: '#b2ec5d';
+    readonly 'Jazzberry Jam': '#ca3767';
+    readonly Manatee: '#979aaa';
+    readonly 'Mango Tango': '#ff8243';
+    readonly Mauvelous: '#ef98aa';
+    readonly 'Midnight Blue': '#1a4876';
+    readonly 'Navy Blue': '#1974d2';
+    readonly 'Pacific Blue': '#1ca9c9';
+    readonly 'Piggy Pink': '#fddde6';
+    readonly Plum: '#8e4585';
+    readonly 'Purple Heart': '#7442c8';
+    readonly "Robin's Egg Blue": '#1fcecb';
+    readonly 'Royal Purple': '#7851a9';
+    readonly Scarlet: '#fc2847';
+    readonly Timberwolf: '#dbd7d2';
+    readonly Tumbleweed: '#deaa88';
+    readonly 'Violet Red': '#f75394';
+    readonly 'Vivid Violet': '#8f509d';
+    readonly Wisteria: '#cda4de';
+};
+export type CrayolaColorName = keyof typeof crayolaColors;
+export declare const crayola: {
+    readonly name: 'crayola';
+    readonly colors: {
+        readonly Red: '#ee204d';
+        readonly 'Red Orange': '#ff5349';
+        readonly Orange: '#ff7538';
+        readonly 'Yellow Orange': '#ffae42';
+        readonly Yellow: '#fce883';
+        readonly 'Yellow Green': '#c5e384';
+        readonly Green: '#1cac78';
+        readonly 'Blue Green': '#0d98ba';
+        readonly Blue: '#1f75fe';
+        readonly 'Blue Violet': '#7366bd';
+        readonly Violet: '#926eae';
+        readonly 'Red Violet': '#c0448f';
+        readonly Black: '#232323';
+        readonly Brown: '#b4674d';
+        readonly White: '#ededed';
+        readonly Gray: '#95918c';
+        readonly 'Carnation Pink': '#ffaacc';
+        readonly 'Sky Blue': '#80daeb';
+        readonly Tan: '#faa76c';
+        readonly Apricot: '#fdd9b5';
+        readonly Peach: '#ffcfab';
+        readonly 'Cadet Blue': '#b0b7c6';
+        readonly Salmon: '#ff9baa';
+        readonly 'Forest Green': '#6dae81';
+        readonly 'Lemon Yellow': '#fff44f';
+        readonly Mahogany: '#cd4a4c';
+        readonly Maroon: '#c8385a';
+        readonly Bittersweet: '#fd7c6e';
+        readonly Sepia: '#a5694f';
+        readonly 'Burnt Sienna': '#ea7e5d';
+        readonly 'Burnt Orange': '#ff7f49';
+        readonly 'Raw Sienna': '#d68a59';
+        readonly Silver: '#cdc5c2';
+        readonly Gold: '#e7c697';
+        readonly Copper: '#dd9475';
+        readonly 'Green Yellow': '#f0e891';
+        readonly 'Pine Green': '#158078';
+        readonly 'Olive Green': '#bab86c';
+        readonly Indigo: '#5d76cb';
+        readonly Periwinkle: '#c5d0e6';
+        readonly Cerulean: '#1dacd6';
+        readonly 'Sea Green': '#9fe2bf';
+        readonly 'Turquoise Blue': '#77dde7';
+        readonly 'Atomic Tangerine': '#ff9966';
+        readonly 'Blizzard Blue': '#ace5ee';
+        readonly 'Hot Magenta': '#ff1dce';
+        readonly 'Laser Lemon': '#fdfc74';
+        readonly 'Neon Carrot': '#ffa343';
+        readonly 'Purple Pizzazz': '#fe4eda';
+        readonly 'Razzle Dazzle Rose': '#ff48d0';
+        readonly Razzmatazz: '#e3256b';
+        readonly "Screamin' Green": '#76ff7a';
+        readonly 'Shocking Pink': '#fb7efd';
+        readonly 'Tickle Me Pink': '#fc89ac';
+        readonly 'Unmellow Yellow': '#ffff66';
+        readonly 'Wild Watermelon': '#fc6c85';
+        readonly 'Outrageous Orange': '#ff6e4a';
+        readonly 'Electric Lime': '#ceff1d';
+        readonly 'Granny Smith Apple': '#a8e4a0';
+        readonly 'Macaroni and Cheese': '#ffbd88';
+        readonly 'Banana Mania': '#fae7b5';
+        readonly 'Caribbean Green': '#1cd3a2';
+        readonly Cerise: '#dd4492';
+        readonly 'Cotton Candy': '#ffbcd9';
+        readonly 'Fuzzy Wuzzy': '#cc6666';
+        readonly Inchworm: '#b2ec5d';
+        readonly 'Jazzberry Jam': '#ca3767';
+        readonly Manatee: '#979aaa';
+        readonly 'Mango Tango': '#ff8243';
+        readonly Mauvelous: '#ef98aa';
+        readonly 'Midnight Blue': '#1a4876';
+        readonly 'Navy Blue': '#1974d2';
+        readonly 'Pacific Blue': '#1ca9c9';
+        readonly 'Piggy Pink': '#fddde6';
+        readonly Plum: '#8e4585';
+        readonly 'Purple Heart': '#7442c8';
+        readonly "Robin's Egg Blue": '#1fcecb';
+        readonly 'Royal Purple': '#7851a9';
+        readonly Scarlet: '#fc2847';
+        readonly Timberwolf: '#dbd7d2';
+        readonly Tumbleweed: '#deaa88';
+        readonly 'Violet Red': '#f75394';
+        readonly 'Vivid Violet': '#8f509d';
+        readonly Wisteria: '#cda4de';
+    };
+    readonly normalize: import("../types.js").NormalizeFn;
+    readonly defaultMetric: 'deltaEok';
+};
+export {};
+//# sourceMappingURL=crayola.d.ts.map

package/dist/palettes/crayola.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"crayola.d.ts","sourceRoot":"","sources":["../../src/palettes/crayola.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,QAAA,MAAM,aAAa;aAEjB,GAAG,EAAE,SAAS;aACd,YAAY,EAAE,SAAS;aACvB,MAAM,EAAE,SAAS;aACjB,eAAe,EAAE,SAAS;aAC1B,MAAM,EAAE,SAAS;aACjB,cAAc,EAAE,SAAS;aACzB,KAAK,EAAE,SAAS;aAChB,YAAY,EAAE,SAAS;aACvB,IAAI,EAAE,SAAS;aACf,aAAa,EAAE,SAAS;aACxB,MAAM,EAAE,SAAS;aACjB,YAAY,EAAE,SAAS;aAGvB,KAAK,EAAE,SAAS;aAChB,KAAK,EAAE,SAAS;aAChB,KAAK,EAAE,SAAS;aAChB,IAAI,EAAE,SAAS;aAGf,gBAAgB,EAAE,SAAS;aAC3B,UAAU,EAAE,SAAS;aACrB,GAAG,EAAE,SAAS;aACd,OAAO,EAAE,SAAS;aAClB,KAAK,EAAE,SAAS;aAChB,YAAY,EAAE,SAAS;aACvB,MAAM,EAAE,SAAS;aACjB,cAAc,EAAE,SAAS;aACzB,cAAc,EAAE,SAAS;aACzB,QAAQ,EAAE,SAAS;aACnB,MAAM,EAAE,SAAS;aACjB,WAAW,EAAE,SAAS;aACtB,KAAK,EAAE,SAAS;aAChB,cAAc,EAAE,SAAS;aACzB,cAAc,EAAE,SAAS;aACzB,YAAY,EAAE,SAAS;aAGvB,MAAM,EAAE,SAAS;aACjB,IAAI,EAAE,SAAS;aACf,MAAM,EAAE,SAAS;aAGjB,cAAc,EAAE,SAAS;aACzB,YAAY,EAAE,SAAS;aACvB,aAAa,EAAE,SAAS;aACxB,MAAM,EAAE,SAAS;aACjB,UAAU,EAAE,SAAS;aACrB,QAAQ,EAAE,SAAS;aACnB,WAAW,EAAE,SAAS;aACtB,gBAAgB,EAAE,SAAS;aAG3B,kBAAkB,EAAE,SAAS;aAC7B,eAAe,EAAE,SAAS;aAC1B,aAAa,EAAE,SAAS;aACxB,aAAa,EAAE,SAAS;aACxB,aAAa,EAAE,SAAS;aACxB,gBAAgB,EAAE,SAAS;aAC3B,oBAAoB,EAAE,SAAS;aAC/B,UAAU,EAAE,SAAS;aACrB,iBAAiB,EAAE,SAAS;aAC5B,eAAe,EAAE,SAAS;aAC1B,gBAAgB,EAAE,SAAS;aAC3B,iBAAiB,EAAE,SAAS;aAC5B,iBAAiB,EAAE,SAAS;aAC5B,mBAAmB,EAAE,SAAS;aAC9B,eAAe,EAAE,SAAS;aAG1B,oBAAoB,EAAE,SAAS;aAC/B,qBAAqB,EAAE,SAAS;aAChC,cAAc,EAAE,SAAS;aACzB,iBAAiB,EAAE,SAAS;aAC5B,MAAM,EAAE,SAAS;aACjB,cAAc,EAAE,SAAS;aACzB,aAAa,EAAE,SAAS;aACxB,QAAQ,EAAE,SAAS;aACnB,eAAe,EAAE,SAAS;aAC1B,OAAO,EAAE,SAAS;aAClB,aAAa,EAAE,SAAS;aACxB,SAAS,EAAE,SAAS;aACpB,eAAe,EAAE,SAAS;aAC1B,WAAW,EAAE,SAAS;aACtB,cAAc,EAAE,SAAS;aACzB,YAAY,EAAE,SAAS;aACvB,IAAI,EAAE,SAAS;aACf,cAAc,EAAE,SAAS;aACzB,kBAAkB,EAAE,SAAS;aAC7B,cAAc,EAAE,SAAS;aACzB,OAAO,EAAE,SAAS;aAClB,UAAU,EAAE,SAAS;aACrB,UAAU,EAAE,SAAS;aACrB,YAAY,EAAE,SAAS;aACvB,cAAc,EAAE,SAAS;aACzB,QAAQ,EAAE,SAAS;CACX,CAAC;AAEX,MAAM,MAAM,gBAAgB,GAAG,MAAM,OAAO,aAAa,CAAC;AAE1D,eAAO,MAAM,OAAO;mBACZ,SAAS;;sBArGV,SAAS;+BACA,SAAS;yBACf,SAAS;kCACA,SAAS;yBAClB,SAAS;iCACD,SAAS;wBAClB,SAAS;+BACF,SAAS;uBACjB,SAAS;gCACA,SAAS;yBAChB,SAAS;+BACH,SAAS;wBAGhB,SAAS;wBACT,SAAS;wBACT,SAAS;uBACV,SAAS;mCAGG,SAAS;6BACf,SAAS;sBAChB,SAAS;0BACL,SAAS;wBACX,SAAS;+BACF,SAAS;yBACf,SAAS;iCACD,SAAS;iCACT,SAAS;2BACf,SAAS;yBACX,SAAS;8BACJ,SAAS;wBACf,SAAS;iCACA,SAAS;iCACT,SAAS;+BACX,SAAS;yBAGf,SAAS;uBACX,SAAS;yBACP,SAAS;iCAGD,SAAS;+BACX,SAAS;gCACR,SAAS;yBAChB,SAAS;6BACL,SAAS;2BACX,SAAS;8BACN,SAAS;mCACJ,SAAS;qCAGP,SAAS;kCACZ,SAAS;gCACX,SAAS;gCACT,SAAS;gCACT,SAAS;mCACN,SAAS;uCACL,SAAS;6BACnB,SAAS;oCACF,SAAS;kCACX,SAAS;mCACR,SAAS;oCACR,SAAS;oCACT,SAAS;sCACP,SAAS;kCACb,SAAS;uCAGJ,SAAS;wCACR,SAAS;iCAChB,SAAS;oCACN,SAAS;yBACpB,SAAS;iCACD,SAAS;gCACV,SAAS;2BACd,SAAS;kCACF,SAAS;0BACjB,SAAS;gCACH,SAAS;4BACb,SAAS;kCACH,SAAS;8BACb,SAAS;iCACN,SAAS;+BACX,SAAS;uBACjB,SAAS;iCACC,SAAS;qCACL,SAAS;iCACb,SAAS;0BAChB,SAAS;6BACN,SAAS;6BACT,SAAS;+BACP,SAAS;iCACP,SAAS;2BACf,SAAS;;;4BASJ,UAAU;CACmB,CAAC","sourcesContent":["import type { Palette } from '../types.js';\nimport { standardNormalize } from './normalize.js';\n\n/**\n * Crayola crayon colors — canonical subset. ~85 entries covering the\n * current 64-standard box, iconic fluorescents, and widely-recognized\n * modern additions.\n *\n * Keys are Title Case with spaces (`'Granny Smith Apple'`,\n * `'Razzmatazz'`) — how the names are printed on the crayon wrapper.\n * `standardNormalize` strips spaces + case + punctuation on input, so\n * `resolve('granny-smith-apple')` and `resolve('Granny Smith Apple')`\n * both hit the same entry.\n *\n * sRGB values are community-sourced approximations (Wikipedia's\n * well-cited list of Crayola crayon colors). They do not represent\n * a licensed Crayola reference. See NOTICE.md for trademark note.\n *\n * Default metric: `deltaEok`. The Crayola set spans a wide gamut with\n * many saturated brights (fluorescents especially) where CIELAB-based\n * metrics are less perceptually uniform than OKLAB. Same cost profile\n * as deltaE76, better neighbor selection in saturated regions.\n */\nconst crayolaColors = {\n  // --- Current standard box: the 12 primary/secondary hue wheel ---\n  Red: '#ee204d',\n  'Red Orange': '#ff5349',\n  Orange: '#ff7538',\n  'Yellow Orange': '#ffae42',\n  Yellow: '#fce883',\n  'Yellow Green': '#c5e384',\n  Green: '#1cac78',\n  'Blue Green': '#0d98ba',\n  Blue: '#1f75fe',\n  'Blue Violet': '#7366bd',\n  Violet: '#926eae',\n  'Red Violet': '#c0448f',\n\n  // --- Achromatics ---\n  Black: '#232323',\n  Brown: '#b4674d',\n  White: '#ededed',\n  Gray: '#95918c',\n\n  // --- 64-box additions (pre-1990 core set) ---\n  'Carnation Pink': '#ffaacc',\n  'Sky Blue': '#80daeb',\n  Tan: '#faa76c',\n  Apricot: '#fdd9b5',\n  Peach: '#ffcfab',\n  'Cadet Blue': '#b0b7c6',\n  Salmon: '#ff9baa',\n  'Forest Green': '#6dae81',\n  'Lemon Yellow': '#fff44f',\n  Mahogany: '#cd4a4c',\n  Maroon: '#c8385a',\n  Bittersweet: '#fd7c6e',\n  Sepia: '#a5694f',\n  'Burnt Sienna': '#ea7e5d',\n  'Burnt Orange': '#ff7f49',\n  'Raw Sienna': '#d68a59',\n\n  // --- Metallics ---\n  Silver: '#cdc5c2',\n  Gold: '#e7c697',\n  Copper: '#dd9475',\n\n  // --- Earth / nature tones ---\n  'Green Yellow': '#f0e891',\n  'Pine Green': '#158078',\n  'Olive Green': '#bab86c',\n  Indigo: '#5d76cb',\n  Periwinkle: '#c5d0e6',\n  Cerulean: '#1dacd6',\n  'Sea Green': '#9fe2bf',\n  'Turquoise Blue': '#77dde7',\n\n  // --- Fluorescents (the iconic \"Neon 24\" era) ---\n  'Atomic Tangerine': '#ff9966',\n  'Blizzard Blue': '#ace5ee',\n  'Hot Magenta': '#ff1dce',\n  'Laser Lemon': '#fdfc74',\n  'Neon Carrot': '#ffa343',\n  'Purple Pizzazz': '#fe4eda',\n  'Razzle Dazzle Rose': '#ff48d0',\n  Razzmatazz: '#e3256b',\n  \"Screamin' Green\": '#76ff7a',\n  'Shocking Pink': '#fb7efd',\n  'Tickle Me Pink': '#fc89ac',\n  'Unmellow Yellow': '#ffff66',\n  'Wild Watermelon': '#fc6c85',\n  'Outrageous Orange': '#ff6e4a',\n  'Electric Lime': '#ceff1d',\n\n  // --- Modern / whimsical additions ---\n  'Granny Smith Apple': '#a8e4a0',\n  'Macaroni and Cheese': '#ffbd88',\n  'Banana Mania': '#fae7b5',\n  'Caribbean Green': '#1cd3a2',\n  Cerise: '#dd4492',\n  'Cotton Candy': '#ffbcd9',\n  'Fuzzy Wuzzy': '#cc6666',\n  Inchworm: '#b2ec5d',\n  'Jazzberry Jam': '#ca3767',\n  Manatee: '#979aaa',\n  'Mango Tango': '#ff8243',\n  Mauvelous: '#ef98aa',\n  'Midnight Blue': '#1a4876',\n  'Navy Blue': '#1974d2',\n  'Pacific Blue': '#1ca9c9',\n  'Piggy Pink': '#fddde6',\n  Plum: '#8e4585',\n  'Purple Heart': '#7442c8',\n  \"Robin's Egg Blue\": '#1fcecb',\n  'Royal Purple': '#7851a9',\n  Scarlet: '#fc2847',\n  Timberwolf: '#dbd7d2',\n  Tumbleweed: '#deaa88',\n  'Violet Red': '#f75394',\n  'Vivid Violet': '#8f509d',\n  Wisteria: '#cda4de',\n} as const;\n\nexport type CrayolaColorName = keyof typeof crayolaColors;\n\nexport const crayola = {\n  name: 'crayola',\n  colors: crayolaColors,\n  normalize: standardNormalize,\n  defaultMetric: 'deltaEok',\n} as const satisfies Palette<CrayolaColorName>;\n"]}

package/dist/palettes/crayola.js

@@ -0,0 +1,121 @@
+import { standardNormalize } from './normalize.js';
+/**
+ * Crayola crayon colors — canonical subset. ~85 entries covering the
+ * current 64-standard box, iconic fluorescents, and widely-recognized
+ * modern additions.
+ *
+ * Keys are Title Case with spaces (`'Granny Smith Apple'`,
+ * `'Razzmatazz'`) — how the names are printed on the crayon wrapper.
+ * `standardNormalize` strips spaces + case + punctuation on input, so
+ * `resolve('granny-smith-apple')` and `resolve('Granny Smith Apple')`
+ * both hit the same entry.
+ *
+ * sRGB values are community-sourced approximations (Wikipedia's
+ * well-cited list of Crayola crayon colors). They do not represent
+ * a licensed Crayola reference. See NOTICE.md for trademark note.
+ *
+ * Default metric: `deltaEok`. The Crayola set spans a wide gamut with
+ * many saturated brights (fluorescents especially) where CIELAB-based
+ * metrics are less perceptually uniform than OKLAB. Same cost profile
+ * as deltaE76, better neighbor selection in saturated regions.
+ */
+const crayolaColors = {
+    // --- Current standard box: the 12 primary/secondary hue wheel ---
+    Red: '#ee204d',
+    'Red Orange': '#ff5349',
+    Orange: '#ff7538',
+    'Yellow Orange': '#ffae42',
+    Yellow: '#fce883',
+    'Yellow Green': '#c5e384',
+    Green: '#1cac78',
+    'Blue Green': '#0d98ba',
+    Blue: '#1f75fe',
+    'Blue Violet': '#7366bd',
+    Violet: '#926eae',
+    'Red Violet': '#c0448f',
+    // --- Achromatics ---
+    Black: '#232323',
+    Brown: '#b4674d',
+    White: '#ededed',
+    Gray: '#95918c',
+    // --- 64-box additions (pre-1990 core set) ---
+    'Carnation Pink': '#ffaacc',
+    'Sky Blue': '#80daeb',
+    Tan: '#faa76c',
+    Apricot: '#fdd9b5',
+    Peach: '#ffcfab',
+    'Cadet Blue': '#b0b7c6',
+    Salmon: '#ff9baa',
+    'Forest Green': '#6dae81',
+    'Lemon Yellow': '#fff44f',
+    Mahogany: '#cd4a4c',
+    Maroon: '#c8385a',
+    Bittersweet: '#fd7c6e',
+    Sepia: '#a5694f',
+    'Burnt Sienna': '#ea7e5d',
+    'Burnt Orange': '#ff7f49',
+    'Raw Sienna': '#d68a59',
+    // --- Metallics ---
+    Silver: '#cdc5c2',
+    Gold: '#e7c697',
+    Copper: '#dd9475',
+    // --- Earth / nature tones ---
+    'Green Yellow': '#f0e891',
+    'Pine Green': '#158078',
+    'Olive Green': '#bab86c',
+    Indigo: '#5d76cb',
+    Periwinkle: '#c5d0e6',
+    Cerulean: '#1dacd6',
+    'Sea Green': '#9fe2bf',
+    'Turquoise Blue': '#77dde7',
+    // --- Fluorescents (the iconic "Neon 24" era) ---
+    'Atomic Tangerine': '#ff9966',
+    'Blizzard Blue': '#ace5ee',
+    'Hot Magenta': '#ff1dce',
+    'Laser Lemon': '#fdfc74',
+    'Neon Carrot': '#ffa343',
+    'Purple Pizzazz': '#fe4eda',
+    'Razzle Dazzle Rose': '#ff48d0',
+    Razzmatazz: '#e3256b',
+    "Screamin' Green": '#76ff7a',
+    'Shocking Pink': '#fb7efd',
+    'Tickle Me Pink': '#fc89ac',
+    'Unmellow Yellow': '#ffff66',
+    'Wild Watermelon': '#fc6c85',
+    'Outrageous Orange': '#ff6e4a',
+    'Electric Lime': '#ceff1d',
+    // --- Modern / whimsical additions ---
+    'Granny Smith Apple': '#a8e4a0',
+    'Macaroni and Cheese': '#ffbd88',
+    'Banana Mania': '#fae7b5',
+    'Caribbean Green': '#1cd3a2',
+    Cerise: '#dd4492',
+    'Cotton Candy': '#ffbcd9',
+    'Fuzzy Wuzzy': '#cc6666',
+    Inchworm: '#b2ec5d',
+    'Jazzberry Jam': '#ca3767',
+    Manatee: '#979aaa',
+    'Mango Tango': '#ff8243',
+    Mauvelous: '#ef98aa',
+    'Midnight Blue': '#1a4876',
+    'Navy Blue': '#1974d2',
+    'Pacific Blue': '#1ca9c9',
+    'Piggy Pink': '#fddde6',
+    Plum: '#8e4585',
+    'Purple Heart': '#7442c8',
+    "Robin's Egg Blue": '#1fcecb',
+    'Royal Purple': '#7851a9',
+    Scarlet: '#fc2847',
+    Timberwolf: '#dbd7d2',
+    Tumbleweed: '#deaa88',
+    'Violet Red': '#f75394',
+    'Vivid Violet': '#8f509d',
+    Wisteria: '#cda4de',
+};
+export const crayola = {
+    name: 'crayola',
+    colors: crayolaColors,
+    normalize: standardNormalize,
+    defaultMetric: 'deltaEok',
+};
+//# sourceMappingURL=crayola.js.map