@xivdyetools/core 1.3.7

package/dist/utils/kd-tree.js

@@ -0,0 +1,195 @@
+/**
+ * k-d Tree implementation for 3D color space (RGB)
+ * Per P-7: Spatial indexing for fast nearest neighbor search
+ *
+ * k-d tree provides O(log n) average case for nearest neighbor queries
+ * vs O(n) for linear search, significant improvement for color matching
+ */
+/**
+ * k-d Tree node
+ */
+class KDNode {
+    constructor(point, dimension) {
+        this.left = null;
+        this.right = null;
+        this.point = point;
+        this.dimension = dimension;
+    }
+}
+/**
+ * k-d Tree for 3D color space (RGB)
+ * Optimized for nearest neighbor search in color matching
+ */
+export class KDTree {
+    /**
+     * Build k-d tree from array of points
+     * @param points - Array of 3D points (RGB colors)
+     */
+    constructor(points) {
+        this.root = null;
+        this.size = 0;
+        if (points.length > 0) {
+            // CORE-PERF-002: Use index-based construction to reduce memory allocations
+            // Instead of slicing point arrays (O(n) copy each time), we pass index arrays
+            // which are much smaller and reduce GC pressure
+            const indices = points.map((_, i) => i);
+            this.root = this.buildTreeOptimized(points, indices, 0);
+            this.size = points.length;
+        }
+    }
+    /**
+     * Recursively build k-d tree using index arrays
+     * CORE-PERF-002: Optimized to reduce temporary array allocations
+     * @param points - Full points array (never copied)
+     * @param indices - Indices into points array for current subtree
+     * @param depth - Current depth (determines splitting dimension)
+     */
+    buildTreeOptimized(points, indices, depth) {
+        if (indices.length === 0) {
+            return null;
+        }
+        if (indices.length === 1) {
+            return new KDNode(points[indices[0]], depth % 3);
+        }
+        // Select dimension to split on (alternate R, G, B)
+        const dimension = depth % 3;
+        // Sort indices by the value at that dimension (smaller allocations than sorting full points)
+        indices.sort((a, b) => {
+            const aPoint = points[a];
+            const bPoint = points[b];
+            const aVal = dimension === 0 ? aPoint.x : dimension === 1 ? aPoint.y : aPoint.z;
+            const bVal = dimension === 0 ? bPoint.x : dimension === 1 ? bPoint.y : bPoint.z;
+            return aVal - bVal;
+        });
+        // Find median
+        const median = Math.floor(indices.length / 2);
+        const medianPoint = points[indices[median]];
+        // Create node
+        const node = new KDNode(medianPoint, dimension);
+        // Recursively build left and right subtrees using index slices
+        // Index arrays are much smaller than point arrays (just numbers vs objects)
+        node.left = this.buildTreeOptimized(points, indices.slice(0, median), depth + 1);
+        node.right = this.buildTreeOptimized(points, indices.slice(median + 1), depth + 1);
+        return node;
+    }
+    /**
+     * Calculate Euclidean distance between two points
+     */
+    distance(p1, p2) {
+        const dx = p1.x - p2.x;
+        const dy = p1.y - p2.y;
+        const dz = p1.z - p2.z;
+        return Math.sqrt(dx * dx + dy * dy + dz * dz);
+    }
+    /**
+     * Find nearest neighbor to target point
+     * @param target - Target point to search for
+     * @param excludeData - Optional function to exclude certain data points
+     * @returns Nearest point or null if tree is empty
+     */
+    nearestNeighbor(target, excludeData) {
+        if (!this.root) {
+            return null;
+        }
+        const best = this.searchNearest(this.root, target, 0, null, excludeData);
+        return best?.point ?? null;
+    }
+    /**
+     * Recursive nearest neighbor search
+     */
+    searchNearest(node, target, depth, best, excludeData) {
+        if (!node) {
+            return best;
+        }
+        const dimension = node.dimension;
+        const nodeValue = dimension === 0 ? node.point.x : dimension === 1 ? node.point.y : node.point.z;
+        const targetValue = dimension === 0 ? target.x : dimension === 1 ? target.y : target.z;
+        // Check if current node is better
+        if (!excludeData || !excludeData(node.point.data)) {
+            const dist = this.distance(target, node.point);
+            if (!best || dist < best.distance) {
+                best = { point: node.point, distance: dist };
+            }
+        }
+        // Determine which side to search first
+        const isLeft = targetValue < nodeValue;
+        const nearChild = isLeft ? node.left : node.right;
+        const farChild = isLeft ? node.right : node.left;
+        // Search near side
+        if (nearChild) {
+            best = this.searchNearest(nearChild, target, depth + 1, best, excludeData);
+        }
+        // Check if we need to search far side
+        // Use <= to handle edge case where target is exactly on splitting plane
+        if (farChild && best) {
+            const axisDistance = Math.abs(targetValue - nodeValue);
+            if (axisDistance <= best.distance) {
+                best = this.searchNearest(farChild, target, depth + 1, best, excludeData);
+            }
+        }
+        return best;
+    }
+    /**
+     * Find all points within a distance threshold
+     * @param target - Target point
+     * @param maxDistance - Maximum distance
+     * @param excludeData - Optional function to exclude certain data points
+     * @returns Array of points within distance, sorted by distance
+     */
+    pointsWithinDistance(target, maxDistance, excludeData) {
+        if (!this.root) {
+            return [];
+        }
+        const results = [];
+        this.searchWithinDistance(this.root, target, 0, maxDistance, results, excludeData);
+        // Sort by distance
+        results.sort((a, b) => a.distance - b.distance);
+        return results;
+    }
+    /**
+     * Recursive search for points within distance
+     */
+    searchWithinDistance(node, target, depth, maxDistance, results, excludeData) {
+        if (!node) {
+            return;
+        }
+        const dimension = node.dimension;
+        const nodeValue = dimension === 0 ? node.point.x : dimension === 1 ? node.point.y : node.point.z;
+        const targetValue = dimension === 0 ? target.x : dimension === 1 ? target.y : target.z;
+        // Check if current node is within distance
+        if (!excludeData || !excludeData(node.point.data)) {
+            const dist = this.distance(target, node.point);
+            if (dist <= maxDistance) {
+                results.push({ point: node.point, distance: dist });
+            }
+        }
+        // Determine which side to search
+        const isLeft = targetValue < nodeValue;
+        const nearChild = isLeft ? node.left : node.right;
+        const farChild = isLeft ? node.right : node.left;
+        // Search near side
+        if (nearChild) {
+            this.searchWithinDistance(nearChild, target, depth + 1, maxDistance, results, excludeData);
+        }
+        // Check if we need to search far side
+        if (farChild) {
+            const axisDistance = Math.abs(targetValue - nodeValue);
+            if (axisDistance <= maxDistance) {
+                this.searchWithinDistance(farChild, target, depth + 1, maxDistance, results, excludeData);
+            }
+        }
+    }
+    /**
+     * Get tree size
+     */
+    getSize() {
+        return this.size;
+    }
+    /**
+     * Check if tree is empty
+     */
+    isEmpty() {
+        return this.size === 0;
+    }
+}
+//# sourceMappingURL=kd-tree.js.map

package/dist/utils/kd-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kd-tree.js","sourceRoot":"","sources":["../../src/utils/kd-tree.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAYH;;GAEG;AACH,MAAM,MAAM;IAMV,YAAY,KAAc,EAAE,SAAiB;QAJ7C,SAAI,GAAkB,IAAI,CAAC;QAC3B,UAAK,GAAkB,IAAI,CAAC;QAI1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,MAAM;IAIjB;;;OAGG;IACH,YAAY,MAAiB;QAPrB,SAAI,GAAkB,IAAI,CAAC;QAC3B,SAAI,GAAW,CAAC,CAAC;QAOvB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,2EAA2E;YAC3E,8EAA8E;YAC9E,gDAAgD;YAChD,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YACxD,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,kBAAkB,CAAC,MAAiB,EAAE,OAAiB,EAAE,KAAa;QAC5E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACnD,CAAC;QAED,mDAAmD;QACnD,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC;QAE5B,6FAA6F;QAC7F,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACpB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,IAAI,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAChF,MAAM,IAAI,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAChF,OAAO,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,cAAc;QACd,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9C,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAE5C,cAAc;QACd,MAAM,IAAI,GAAG,IAAI,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;QAEhD,+DAA+D;QAC/D,4EAA4E;QAC5E,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACjF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAEnF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,EAAW,EAAE,EAAW;QACvC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAChD,CAAC;IAED;;;;;OAKG;IACH,eAAe,CAAC,MAAe,EAAE,WAAwC;QACvE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;QACzE,OAAO,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC;IAC7B,CAAC;IAED;;OAEG;IACK,aAAa,CACnB,IAAmB,EACnB,MAAe,EACf,KAAa,EACb,IAAiD,EACjD,WAAwC;QAExC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,MAAM,SAAS,GACb,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACjF,MAAM,WAAW,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAEvF,kCAAkC;QAClC,IAAI,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/C,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,MAAM,MAAM,GAAG,WAAW,GAAG,SAAS,CAAC;QACvC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QAClD,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QAEjD,mBAAmB;QACnB,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;QAC7E,CAAC;QAED,sCAAsC;QACtC,wEAAwE;QACxE,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC;YACvD,IAAI,YAAY,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,oBAAoB,CAClB,MAAe,EACf,WAAmB,EACnB,WAAwC;QAExC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,OAAO,GAAgD,EAAE,CAAC;QAChE,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QAEnF,mBAAmB;QACnB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAChD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,oBAAoB,CAC1B,IAAmB,EACnB,MAAe,EACf,KAAa,EACb,WAAmB,EACnB,OAAoD,EACpD,WAAwC;QAExC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,MAAM,SAAS,GACb,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACjF,MAAM,WAAW,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAEvF,2CAA2C;QAC3C,IAAI,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/C,IAAI,IAAI,IAAI,WAAW,EAAE,CAAC;gBACxB,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,MAAM,MAAM,GAAG,WAAW,GAAG,SAAS,CAAC;QACvC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QAClD,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QAEjD,mBAAmB;QACnB,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QAC7F,CAAC;QAED,sCAAsC;QACtC,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC;YACvD,IAAI,YAAY,IAAI,WAAW,EAAE,CAAC;gBAChC,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IACzB,CAAC;CACF"}

package/dist/version.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Auto-generated version file
+ * DO NOT EDIT MANUALLY - Generated from package.json during build
+ * @see scripts/generate-version.ts
+ */
+/**
+ * Current library version
+ * Automatically synced with package.json version
+ */
+export declare const VERSION = "1.3.7";
+//# sourceMappingURL=version.d.ts.map

package/dist/version.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"version.d.ts","sourceRoot":"","sources":["../src/version.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;GAGG;AACH,eAAO,MAAM,OAAO,UAAU,CAAC"}

package/dist/version.js

@@ -0,0 +1,11 @@
+/**
+ * Auto-generated version file
+ * DO NOT EDIT MANUALLY - Generated from package.json during build
+ * @see scripts/generate-version.ts
+ */
+/**
+ * Current library version
+ * Automatically synced with package.json version
+ */
+export const VERSION = '1.3.7';
+//# sourceMappingURL=version.js.map

package/dist/version.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"version.js","sourceRoot":"","sources":["../src/version.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;GAGG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,OAAO,CAAC"}

package/package.json

@@ -0,0 +1,84 @@
+{
+    "name": "@xivdyetools/core",
+    "version": "1.3.7",
+    "description": "Core color algorithms and dye database for XIV Dye Tools",
+    "main": "dist/index.js",
+    "types": "dist/index.d.ts",
+    "type": "module",
+    "files": [
+        "dist",
+        "README.md"
+    ],
+    "scripts": {
+        "build": "npm run build:version && npm run build:locales && tsc && npm run copy:locales",
+        "build:version": "tsx scripts/generate-version.ts",
+        "build:locales": "tsx scripts/build-locales.ts",
+        "copy:locales": "tsx scripts/copy-locales.ts",
+        "prebuild": "npm run build:locales",
+        "test": "vitest run",
+        "test:watch": "vitest",
+        "test:integration": "vitest run src/__tests__/integration",
+        "test:coverage": "vitest run --coverage",
+        "test:coverage:watch": "vitest --coverage",
+        "test:coverage:ui": "vitest --coverage --ui",
+        "test:threshold": "vitest run --coverage --reporter=verbose",
+        "lint": "eslint src --ext .ts",
+        "lint:fix": "eslint src --ext .ts --fix",
+        "format": "prettier --write \"src/**/*.ts\"",
+        "format:check": "prettier --check \"src/**/*.ts\"",
+        "type-check": "tsc --noEmit",
+        "docs": "typedoc",
+        "docs:watch": "typedoc --watch",
+        "prepublishOnly": "npm run build",
+        "prepare": "husky install || true"
+    },
+    "keywords": [
+        "ffxiv",
+        "final-fantasy-xiv",
+        "color",
+        "dye",
+        "harmony",
+        "accessibility",
+        "colorblind",
+        "color-theory",
+        "rgb",
+        "hsv",
+        "universalis"
+    ],
+    "author": "Flash Galatine",
+    "license": "MIT",
+    "homepage": "https://github.com/FlashGalatine/xivdyetools-core#readme",
+    "bugs": {
+        "url": "https://github.com/FlashGalatine/xivdyetools-core/issues"
+    },
+    "repository": {
+        "type": "git",
+        "url": "git+https://github.com/FlashGalatine/xivdyetools-core.git"
+    },
+    "devDependencies": {
+        "@types/node": "^20.10.0",
+        "@typescript-eslint/eslint-plugin": "^6.15.0",
+        "@typescript-eslint/parser": "^6.15.0",
+        "@vitest/coverage-v8": "^4.0.14",
+        "csv-parse": "^5.5.0",
+        "eslint": "^8.55.0",
+        "husky": "^8.0.3",
+        "lint-staged": "^15.2.0",
+        "prettier": "^3.1.1",
+        "tsx": "^4.7.0",
+        "typedoc": "^0.28.14",
+        "typedoc-plugin-markdown": "^4.9.0",
+        "typescript": "^5.3.2",
+        "vitest": "^4.0.13",
+        "yaml": "^2.3.4"
+    },
+    "engines": {
+        "node": ">=18.0.0"
+    },
+    "lint-staged": {
+        "*.ts": [
+            "eslint --fix",
+            "prettier --write"
+        ]
+    }
+}