@baseplate-dev/utils 0.1.1

package/dist/maps/key-by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"key-by.js","sourceRoot":"","sources":["../../src/maps/key-by.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,QAAQ,CACtB,QAAqB,EACrB,KAAqB;IAErB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAQ,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/maps/map-values-of-map.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Maps the values of a Map to a new Map with the same keys.
+ *
+ * @template K - Type of keys in the map.
+ * @template V - Original value type.
+ * @template R - Resulting value type.
+ * @param map - The input Map to transform.
+ * @param fn - A function to transform each value, receiving the value, key, and original map.
+ * @returns A new Map with the same keys and transformed values.
+ */
+export declare function mapValuesOfMap<K, V, R>(map: Map<K, V>, fn: (value: V, key: K, map: Map<K, V>) => R): Map<K, R>;
+//# sourceMappingURL=map-values-of-map.d.ts.map

package/dist/maps/map-values-of-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"map-values-of-map.d.ts","sourceRoot":"","sources":["../../src/maps/map-values-of-map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACpC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAC1C,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAMX"}

package/dist/maps/map-values-of-map.js

@@ -0,0 +1,18 @@
+/**
+ * Maps the values of a Map to a new Map with the same keys.
+ *
+ * @template K - Type of keys in the map.
+ * @template V - Original value type.
+ * @template R - Resulting value type.
+ * @param map - The input Map to transform.
+ * @param fn - A function to transform each value, receiving the value, key, and original map.
+ * @returns A new Map with the same keys and transformed values.
+ */
+export function mapValuesOfMap(map, fn) {
+    const result = new Map();
+    for (const [key, value] of map.entries()) {
+        result.set(key, fn(value, key, map));
+    }
+    return result;
+}
+//# sourceMappingURL=map-values-of-map.js.map

package/dist/maps/map-values-of-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"map-values-of-map.js","sourceRoot":"","sources":["../../src/maps/map-values-of-map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAC5B,GAAc,EACd,EAA2C;IAE3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAQ,CAAC;IAC/B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/maps/safe-merge-map.d.ts

@@ -0,0 +1,33 @@
+interface MergeMapOptions {
+    /**
+     * If true, allows merging values that are deeply equal
+     */
+    allowEqualValues?: boolean;
+}
+/**
+ * Merges an array of maps, throwing an error if any keys overlap (unless the values are deeply equal and allowed).
+ *
+ * @param maps - The array of maps to merge.
+ * @param options - Options to control merge behavior.
+ * @returns The merged map.
+ */
+export declare function safeMergeMapsWithOptions<K, V>(maps: Map<K, V>[], options?: MergeMapOptions): Map<K, V>;
+/**
+ * Merges two maps, throwing an error if any keys overlap.
+ *
+ * @param mapOne - The first map to merge.
+ * @param mapTwo - The second map to merge.
+ * @param options - Options to control merge behavior
+ * @returns The merged map.
+ */
+export declare function safeMergeMap<K, V>(mapOne: Map<K, V>, mapTwo: Map<K, V>, options?: MergeMapOptions): Map<K, V>;
+/**
+ * Merges an array of maps, throwing an error if any keys overlap (unless the values are deeply equal and allowed).
+ * This function delegates to safeMergeMapsWithOptions.
+ *
+ * @param maps - The array of maps to merge.
+ * @returns The merged map.
+ */
+export declare function safeMergeMaps<K, V>(...maps: Map<K, V>[]): Map<K, V>;
+export {};
+//# sourceMappingURL=safe-merge-map.d.ts.map

package/dist/maps/safe-merge-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"safe-merge-map.d.ts","sourceRoot":"","sources":["../../src/maps/safe-merge-map.ts"],"names":[],"mappings":"AAEA,UAAU,eAAe;IACvB;;OAEG;IACH,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC5B;AAED;;;;;;GAMG;AACH,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,CAAC,EAC3C,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EACjB,OAAO,GAAE,eAAoB,GAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAkBX;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAC/B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACjB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACjB,OAAO,GAAE,eAAoB,GAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAEX;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAEnE"}

package/dist/maps/safe-merge-map.js

@@ -0,0 +1,45 @@
+import { isEqual } from 'es-toolkit';
+/**
+ * Merges an array of maps, throwing an error if any keys overlap (unless the values are deeply equal and allowed).
+ *
+ * @param maps - The array of maps to merge.
+ * @param options - Options to control merge behavior.
+ * @returns The merged map.
+ */
+export function safeMergeMapsWithOptions(maps, options = {}) {
+    const result = new Map();
+    for (const map of maps) {
+        for (const [key, value] of map) {
+            if (result.has(key)) {
+                const existing = result.get(key);
+                if (!options.allowEqualValues || !isEqual(existing, value)) {
+                    throw new Error(`Cannot merge key ${String(key)} because it already exists.`);
+                }
+            }
+            result.set(key, value);
+        }
+    }
+    return result;
+}
+/**
+ * Merges two maps, throwing an error if any keys overlap.
+ *
+ * @param mapOne - The first map to merge.
+ * @param mapTwo - The second map to merge.
+ * @param options - Options to control merge behavior
+ * @returns The merged map.
+ */
+export function safeMergeMap(mapOne, mapTwo, options = {}) {
+    return safeMergeMapsWithOptions([mapOne, mapTwo], options);
+}
+/**
+ * Merges an array of maps, throwing an error if any keys overlap (unless the values are deeply equal and allowed).
+ * This function delegates to safeMergeMapsWithOptions.
+ *
+ * @param maps - The array of maps to merge.
+ * @returns The merged map.
+ */
+export function safeMergeMaps(...maps) {
+    return safeMergeMapsWithOptions(maps);
+}
+//# sourceMappingURL=safe-merge-map.js.map

package/dist/maps/safe-merge-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"safe-merge-map.js","sourceRoot":"","sources":["../../src/maps/safe-merge-map.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AASrC;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAAiB,EACjB,UAA2B,EAAE;IAE7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAQ,CAAC;IAE/B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC;YAC/B,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,gBAAgB,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;oBAC3D,MAAM,IAAI,KAAK,CACb,oBAAoB,MAAM,CAAC,GAAG,CAAC,6BAA6B,CAC7D,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAiB,EACjB,MAAiB,EACjB,UAA2B,EAAE;IAE7B,OAAO,wBAAwB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC;AAC7D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAO,GAAG,IAAiB;IACtD,OAAO,wBAAwB,CAAC,IAAI,CAAC,CAAC;AACxC,CAAC"}

package/dist/node.d.ts

@@ -0,0 +1,3 @@
+export * from './fs/index.js';
+export * from './paths/index.js';
+//# sourceMappingURL=node.d.ts.map

package/dist/node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AAEA,cAAc,eAAe,CAAC;AAC9B,cAAc,kBAAkB,CAAC"}

package/dist/node.js

@@ -0,0 +1,4 @@
+// Export node-specific utilities
+export * from './fs/index.js';
+export * from './paths/index.js';
+//# sourceMappingURL=node.js.map

package/dist/node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.js","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AAAA,iCAAiC;AAEjC,cAAc,eAAe,CAAC;AAC9B,cAAc,kBAAkB,CAAC"}

package/dist/objects/index.d.ts

@@ -0,0 +1,3 @@
+export * from './safe-merge.js';
+export * from './sort-object-keys.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/objects/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/objects/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC;AAChC,cAAc,uBAAuB,CAAC"}

package/dist/objects/index.js

@@ -0,0 +1,3 @@
+export * from './safe-merge.js';
+export * from './sort-object-keys.js';
+//# sourceMappingURL=index.js.map

package/dist/objects/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/objects/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC;AAChC,cAAc,uBAAuB,CAAC"}

package/dist/objects/safe-merge.d.ts

@@ -0,0 +1,32 @@
+interface MergeOptions {
+    /**
+     * If true, allows merging values that are deeply equal
+     */
+    allowEqualValues?: boolean;
+}
+/**
+ * Merges two objects, throwing an error if any keys overlap.
+ *
+ * @param itemOne - The first object to merge.
+ * @param itemTwo - The second object to merge.
+ * @param options - Options to control merge behavior
+ * @returns The merged object.
+ */
+export declare function safeMerge<T extends Record<PropertyKey, any>, S extends Record<PropertyKey, any>>(itemOne: T, itemTwo: S, options?: MergeOptions): T & S;
+/**
+ * Merges an array of objects, throwing an error if any keys overlap.
+ *
+ * @param items - The array of objects to merge.
+ * @param options - Options to control merge behavior
+ * @returns The merged object.
+ */
+export declare function safeMergeAllWithOptions<T extends Record<PropertyKey, any>>(items: T[], options?: MergeOptions): T;
+/**
+ * Merges an array of objects, throwing an error if any keys overlap.
+ *
+ * @param items - The array of objects to merge.
+ * @returns The merged object.
+ */
+export declare function safeMergeAll<T extends Record<PropertyKey, any>>(...items: T[]): T;
+export {};
+//# sourceMappingURL=safe-merge.d.ts.map

package/dist/objects/safe-merge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"safe-merge.d.ts","sourceRoot":"","sources":["../../src/objects/safe-merge.ts"],"names":[],"mappings":"AAEA,UAAU,YAAY;IACpB;;OAEG;IACH,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC5B;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAEvB,CAAC,SAAS,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,EAElC,CAAC,SAAS,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,EAClC,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAE,YAAiB,GAAG,CAAC,GAAG,CAAC,CAY3D;AAED;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CAErC,CAAC,SAAS,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,EAClC,KAAK,EAAE,CAAC,EAAE,EAAE,OAAO,GAAE,YAAiB,GAAG,CAAC,CAM3C;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAE1B,CAAC,SAAS,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,EAClC,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAElB"}

package/dist/objects/safe-merge.js

@@ -0,0 +1,46 @@
+import { isEqual, mergeWith } from 'es-toolkit';
+/**
+ * Merges two objects, throwing an error if any keys overlap.
+ *
+ * @param itemOne - The first object to merge.
+ * @param itemTwo - The second object to merge.
+ * @param options - Options to control merge behavior
+ * @returns The merged object.
+ */
+export function safeMerge(itemOne, itemTwo, options = {}) {
+    return mergeWith(itemOne, itemTwo, (targetValue, sourceValue, key) => {
+        if (key in itemOne && key in itemTwo) {
+            if (options.allowEqualValues && isEqual(targetValue, sourceValue)) {
+                // eslint-disable-next-line @typescript-eslint/no-unsafe-return -- we're just using the sourceValue
+                return sourceValue;
+            }
+            throw new Error(`Cannot merge key ${key} because it already exists.`);
+        }
+        // eslint-disable-next-line @typescript-eslint/no-unsafe-return -- we're just using the sourceValue
+        return sourceValue;
+    });
+}
+/**
+ * Merges an array of objects, throwing an error if any keys overlap.
+ *
+ * @param items - The array of objects to merge.
+ * @param options - Options to control merge behavior
+ * @returns The merged object.
+ */
+export function safeMergeAllWithOptions(items, options = {}) {
+    const targetValue = {};
+    for (const item of items.flat()) {
+        safeMerge(targetValue, item, options);
+    }
+    return targetValue;
+}
+/**
+ * Merges an array of objects, throwing an error if any keys overlap.
+ *
+ * @param items - The array of objects to merge.
+ * @returns The merged object.
+ */
+export function safeMergeAll(...items) {
+    return safeMergeAllWithOptions(items);
+}
+//# sourceMappingURL=safe-merge.js.map

package/dist/objects/safe-merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"safe-merge.js","sourceRoot":"","sources":["../../src/objects/safe-merge.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAShD;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAKvB,OAAU,EAAE,OAAU,EAAE,UAAwB,EAAE;IAClD,OAAO,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,WAAW,EAAE,WAAW,EAAE,GAAG,EAAE,EAAE;QACnE,IAAI,GAAG,IAAI,OAAO,IAAI,GAAG,IAAI,OAAO,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,gBAAgB,IAAI,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC;gBAClE,mGAAmG;gBACnG,OAAO,WAAW,CAAC;YACrB,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,oBAAoB,GAAG,6BAA6B,CAAC,CAAC;QACxE,CAAC;QACD,mGAAmG;QACnG,OAAO,WAAW,CAAC;IACrB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CAGrC,KAAU,EAAE,UAAwB,EAAE;IACtC,MAAM,WAAW,GAAG,EAAO,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAG1B,GAAG,KAAU;IACb,OAAO,uBAAuB,CAAC,KAAK,CAAC,CAAC;AACxC,CAAC"}

package/dist/objects/sort-object-keys.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Sorts the keys of an object.
+ *
+ * @param obj - The object to sort.
+ * @returns The sorted object.
+ */
+export declare function sortObjectKeys<T extends Record<string, unknown>>(obj: T): T;
+//# sourceMappingURL=sort-object-keys.d.ts.map

package/dist/objects/sort-object-keys.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort-object-keys.d.ts","sourceRoot":"","sources":["../../src/objects/sort-object-keys.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAI3E"}

package/dist/objects/sort-object-keys.js

@@ -0,0 +1,10 @@
+/**
+ * Sorts the keys of an object.
+ *
+ * @param obj - The object to sort.
+ * @returns The sorted object.
+ */
+export function sortObjectKeys(obj) {
+    return Object.fromEntries(Object.entries(obj).sort(([a], [b]) => a.localeCompare(b)));
+}
+//# sourceMappingURL=sort-object-keys.js.map

package/dist/objects/sort-object-keys.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort-object-keys.js","sourceRoot":"","sources":["../../src/objects/sort-object-keys.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAoC,GAAM;IACtE,OAAO,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CACtD,CAAC;AACT,CAAC"}

package/dist/paths/get-common-path-prefix.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Returns the highest common ancestor path from a list of absolute paths.
+ *
+ * Only works for POSIX-style paths.
+ *
+ * @param paths - Array of absolute paths
+ * @returns Common ancestor path
+ */
+export declare function getCommonPathPrefix(paths: string[]): string;
+//# sourceMappingURL=get-common-path-prefix.d.ts.map

package/dist/paths/get-common-path-prefix.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-common-path-prefix.d.ts","sourceRoot":"","sources":["../../src/paths/get-common-path-prefix.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAyB3D"}

package/dist/paths/get-common-path-prefix.js

@@ -0,0 +1,34 @@
+import path from 'node:path/posix';
+/**
+ * Returns the highest common ancestor path from a list of absolute paths.
+ *
+ * Only works for POSIX-style paths.
+ *
+ * @param paths - Array of absolute paths
+ * @returns Common ancestor path
+ */
+export function getCommonPathPrefix(paths) {
+    if (paths.length === 0)
+        return '';
+    if (paths.length === 1)
+        return path.dirname(paths[0]);
+    const [first, ...rest] = paths;
+    const firstParts = path.dirname(first).split(path.sep);
+    let commonParts = [...firstParts];
+    for (const current of rest) {
+        const currentParts = current.split(path.sep);
+        const pathLength = Math.min(firstParts.length, currentParts.length);
+        let i = 0;
+        while (i < pathLength && commonParts[i] === currentParts[i]) {
+            i++;
+        }
+        commonParts = commonParts.slice(0, i);
+        if (commonParts.length === 0)
+            break;
+    }
+    return commonParts.length > 0 &&
+        !(commonParts.length === 1 && commonParts[0] === '')
+        ? commonParts.join(path.sep)
+        : path.parse(first).root;
+}
+//# sourceMappingURL=get-common-path-prefix.js.map

package/dist/paths/get-common-path-prefix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-common-path-prefix.js","sourceRoot":"","sources":["../../src/paths/get-common-path-prefix.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,iBAAiB,CAAC;AAEnC;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAe;IACjD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,MAAM,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC;IAE/B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvD,IAAI,WAAW,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;IAElC,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;QACpE,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,UAAU,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,CAAC,EAAE,CAAC;QACN,CAAC;QACD,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;IACtC,CAAC;IAED,OAAO,WAAW,CAAC,MAAM,GAAG,CAAC;QAC3B,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;QACpD,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QAC5B,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;AAC7B,CAAC"}

package/dist/paths/index.d.ts

@@ -0,0 +1,3 @@
+export * from './get-common-path-prefix.js';
+export * from './posix-join.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/paths/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/paths/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,iBAAiB,CAAC"}

package/dist/paths/index.js

@@ -0,0 +1,3 @@
+export * from './get-common-path-prefix.js';
+export * from './posix-join.js';
+//# sourceMappingURL=index.js.map

package/dist/paths/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/paths/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,iBAAiB,CAAC"}

package/dist/paths/posix-join.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Join paths using POSIX path separators. Use this function to join paths
+ * inside generators where we always want to use POSIX path separators.
+ *
+ * @param paths - The paths to join
+ * @returns The joined path
+ */
+export declare function posixJoin(...paths: string[]): string;
+//# sourceMappingURL=posix-join.d.ts.map

package/dist/paths/posix-join.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"posix-join.d.ts","sourceRoot":"","sources":["../../src/paths/posix-join.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,GAAG,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAEpD"}

package/dist/paths/posix-join.js

@@ -0,0 +1,12 @@
+import path from 'node:path';
+/**
+ * Join paths using POSIX path separators. Use this function to join paths
+ * inside generators where we always want to use POSIX path separators.
+ *
+ * @param paths - The paths to join
+ * @returns The joined path
+ */
+export function posixJoin(...paths) {
+    return path.posix.join(...paths);
+}
+//# sourceMappingURL=posix-join.js.map

package/dist/paths/posix-join.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"posix-join.js","sourceRoot":"","sources":["../../src/paths/posix-join.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AAE7B;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,GAAG,KAAe;IAC1C,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;AACnC,CAAC"}

package/dist/sets/difference.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Returns a new Set containing values in `setA` that are not in `setB`.
+ *
+ * @param setA - The original set
+ * @param setB - The set of values to exclude
+ * @returns A new Set with the difference
+ */
+export declare function differenceSet<T>(setA: Set<T>, setB: Set<T>): Set<T>;
+//# sourceMappingURL=difference.d.ts.map

package/dist/sets/difference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"difference.d.ts","sourceRoot":"","sources":["../../src/sets/difference.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAQnE"}

package/dist/sets/difference.js

@@ -0,0 +1,17 @@
+/**
+ * Returns a new Set containing values in `setA` that are not in `setB`.
+ *
+ * @param setA - The original set
+ * @param setB - The set of values to exclude
+ * @returns A new Set with the difference
+ */
+export function differenceSet(setA, setB) {
+    const result = new Set();
+    for (const value of setA) {
+        if (!setB.has(value)) {
+            result.add(value);
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=difference.js.map

package/dist/sets/difference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"difference.js","sourceRoot":"","sources":["../../src/sets/difference.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAI,IAAY,EAAE,IAAY;IACzD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/sets/index.d.ts

@@ -0,0 +1,2 @@
+export * from './difference.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/sets/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/sets/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC"}

package/dist/sets/index.js

@@ -0,0 +1,2 @@
+export * from './difference.js';
+//# sourceMappingURL=index.js.map

package/dist/sets/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/sets/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC"}

package/dist/string/index.d.ts

@@ -0,0 +1,3 @@
+export * from './quot.js';
+export * from './random-uid.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/string/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/string/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC"}

package/dist/string/index.js

@@ -0,0 +1,3 @@
+export * from './quot.js';
+export * from './random-uid.js';
+//# sourceMappingURL=index.js.map

package/dist/string/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/string/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC"}

package/dist/string/quot.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Quotes a string with single quotes and escapes single quotes.
+ * @param value - The string to quote.
+ * @returns The quoted string.
+ */
+export declare function quot(value: string): string;
+/**
+ * Quotes a string with double quotes and escapes double quotes.
+ * @param value - The string to quote.
+ * @returns The quoted string.
+ */
+export declare function doubleQuot(value: string): string;
+//# sourceMappingURL=quot.d.ts.map

package/dist/string/quot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quot.d.ts","sourceRoot":"","sources":["../../src/string/quot.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE1C;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEhD"}

package/dist/string/quot.js

@@ -0,0 +1,17 @@
+/**
+ * Quotes a string with single quotes and escapes single quotes.
+ * @param value - The string to quote.
+ * @returns The quoted string.
+ */
+export function quot(value) {
+    return `'${value.replaceAll("'", String.raw `\'`)}'`;
+}
+/**
+ * Quotes a string with double quotes and escapes double quotes.
+ * @param value - The string to quote.
+ * @returns The quoted string.
+ */
+export function doubleQuot(value) {
+    return `"${value.replaceAll('"', String.raw `\"`)}"`;
+}
+//# sourceMappingURL=quot.js.map

package/dist/string/quot.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quot.js","sourceRoot":"","sources":["../../src/string/quot.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,UAAU,IAAI,CAAC,KAAa;IAChC,OAAO,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAA,IAAI,CAAC,GAAG,CAAC;AACtD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa;IACtC,OAAO,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAA,IAAI,CAAC,GAAG,CAAC;AACtD,CAAC"}

package/dist/string/random-uid.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Generate a random ID string made up of numbers, lowercase, and uppercase letters
+ * @returns A random ID string
+ */
+export declare function randomUid(length?: number): string;
+//# sourceMappingURL=random-uid.d.ts.map

package/dist/string/random-uid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-uid.d.ts","sourceRoot":"","sources":["../../src/string/random-uid.ts"],"names":[],"mappings":"AAWA;;;GAGG;AACH,wBAAgB,SAAS,CAAC,MAAM,SAAK,GAAG,MAAM,CAE7C"}

package/dist/string/random-uid.js

@@ -0,0 +1,16 @@
+import { customAlphabet } from 'nanoid';
+const NUMBERS = '0123456789';
+const LOWERCASE = 'abcdefghijklmnopqrstuvwxyz';
+const UPPERCASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';
+/**
+ * Use custom ID generator for characters that be easily selected
+ */
+const customNanoid = customAlphabet(`${NUMBERS}${LOWERCASE}${UPPERCASE}_`, 12);
+/**
+ * Generate a random ID string made up of numbers, lowercase, and uppercase letters
+ * @returns A random ID string
+ */
+export function randomUid(length = 12) {
+    return customNanoid(length);
+}
+//# sourceMappingURL=random-uid.js.map

package/dist/string/random-uid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-uid.js","sourceRoot":"","sources":["../../src/string/random-uid.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,QAAQ,CAAC;AAExC,MAAM,OAAO,GAAG,YAAY,CAAC;AAC7B,MAAM,SAAS,GAAG,4BAA4B,CAAC;AAC/C,MAAM,SAAS,GAAG,4BAA4B,CAAC;AAE/C;;GAEG;AACH,MAAM,YAAY,GAAG,cAAc,CAAC,GAAG,OAAO,GAAG,SAAS,GAAG,SAAS,GAAG,EAAE,EAAE,CAAC,CAAC;AAE/E;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,MAAM,GAAG,EAAE;IACnC,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC"}

package/dist/toposort/errors.d.ts

@@ -0,0 +1,9 @@
+export declare class ToposortCyclicalDependencyError extends Error {
+    cyclePath: unknown[];
+    constructor(nodes: unknown[]);
+}
+export declare class ToposortUnknownNodeError extends Error {
+    unknownNode: unknown;
+    constructor(node: unknown);
+}
+//# sourceMappingURL=errors.d.ts.map

package/dist/toposort/errors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../../src/toposort/errors.ts"],"names":[],"mappings":"AAAA,qBAAa,+BAAgC,SAAQ,KAAK;IACjD,SAAS,EAAE,OAAO,EAAE,CAAC;gBAChB,KAAK,EAAE,OAAO,EAAE;CAO7B;AAED,qBAAa,wBAAyB,SAAQ,KAAK;IAC1C,WAAW,EAAE,OAAO,CAAC;gBAChB,IAAI,EAAE,OAAO;CAK1B"}

package/dist/toposort/errors.js

@@ -0,0 +1,17 @@
+export class ToposortCyclicalDependencyError extends Error {
+    cyclePath;
+    constructor(nodes) {
+        super(`Cyclical dependency detected: ${nodes.map((n) => JSON.stringify(n)).join(' -> ')}`);
+        this.name = 'ToposortCyclicalDependencyError';
+        this.cyclePath = nodes; // Store the path for potential inspection
+    }
+}
+export class ToposortUnknownNodeError extends Error {
+    unknownNode;
+    constructor(node) {
+        super(`Unknown node referenced in edges: ${JSON.stringify(node)}`);
+        this.name = 'ToposortUnknownNodeError';
+        this.unknownNode = node; // Store the node for potential inspection
+    }
+}
+//# sourceMappingURL=errors.js.map

package/dist/toposort/errors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.js","sourceRoot":"","sources":["../../src/toposort/errors.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,+BAAgC,SAAQ,KAAK;IACjD,SAAS,CAAY;IAC5B,YAAY,KAAgB;QAC1B,KAAK,CACH,iCAAiC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CACpF,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,iCAAiC,CAAC;QAC9C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,0CAA0C;IACpE,CAAC;CACF;AAED,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IAC1C,WAAW,CAAU;IAC5B,YAAY,IAAa;QACvB,KAAK,CAAC,qCAAqC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnE,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAC;QACvC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC,0CAA0C;IACrE,CAAC;CACF"}

package/dist/toposort/index.d.ts

@@ -0,0 +1,4 @@
+export * from './errors.js';
+export * from './toposort-local.js';
+export * from './toposort.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/toposort/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/toposort/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,qBAAqB,CAAC;AACpC,cAAc,eAAe,CAAC"}

package/dist/toposort/index.js

@@ -0,0 +1,4 @@
+export * from './errors.js';
+export * from './toposort-local.js';
+export * from './toposort.js';
+//# sourceMappingURL=index.js.map

package/dist/toposort/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/toposort/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,qBAAqB,CAAC;AACpC,cAAc,eAAe,CAAC"}

package/dist/toposort/toposort-local.d.ts

@@ -0,0 +1,25 @@
+interface ToposortOptions<T> {
+    /**
+     * Optional custom comparison function to break ties between nodes with the same topological level
+     *
+     * This allows for a stable topological sort that is consistent with the input order of nodes with the same topological level.
+     */
+    compareFunc?: (a: T, b: T) => number;
+}
+/**
+ * Performs a locality-based topological sort on a directed acyclic graph.
+ *
+ * This is a variant of Kahn's algorithm that starts from nodes with no outbound edges first,
+ * and then works its way back.
+ *
+ * This is useful for tasks where we want to process nodes in a way that is consistent with their locality in the graph
+ * such as sorting fragments of a generated code file that depend on each other.
+ *
+ * @param nodes - The nodes to sort
+ * @param edges - The edges of the graph
+ * @param options - Optional options for the topological sort
+ * @returns The sorted nodes
+ */
+export declare function toposortLocal<T>(nodes: T[], edges: [T, T][], options?: ToposortOptions<T>): T[];
+export {};
+//# sourceMappingURL=toposort-local.d.ts.map