@lionweb/ts-utils 0.7.0-beta.2 → 0.7.0-beta.21

package/CHANGELOG.md

@@ -2,5 +2,8 @@
 
 ## 0.7.0
 
-Initial creation and publication of this package, as an extraction and de-duplication from `@lionweb/core`, `@lionweb/utilities`, `@lionweb/class-core`, and `@lionweb/validation`.
+* Initial creation and publication of this package, as an extraction and de-duplication from `@lionweb/core`, `@lionweb/utilities`, `@lionweb/class-core`, and `@lionweb/validation`.
+* Add 'mapFrom' function that maps an array to a map, using given key and value functions.
+* Introduce explicit types for `nested{1,2,3}Mapper` functions.
+* Package `src/` again (— i.e., don't ignore for NPM packaging.)
 

package/dist/{array-helpers.d.ts → arrays.d.ts}

@@ -15,4 +15,14 @@ export declare const asArray: <T>(thing: AnyNumberOf<T>) => T[];
  * @return a view of the given array of items with duplicates removed.
  */
 export declare const uniquesAmong: <T>(ts: T[]) => T[];
-//# sourceMappingURL=array-helpers.d.ts.map
+/**
+ * @return the defined values of given type (parameter) `T` from the given array,
+ * leaving out the `null` or `undefined` values.
+ */
+export declare const keepDefineds: <T>(ts: (T | null | undefined)[]) => T[];
+/**
+ * @return the last element of the given `ts` array.
+ * @throws an {@link Error} if the array is empty, so it doesn't have a last element.
+ */
+export declare const lastOfArray: <T>(ts: T[]) => T;
+//# sourceMappingURL=arrays.d.ts.map

package/dist/arrays.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrays.d.ts","sourceRoot":"","sources":["../src/arrays.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;AAEhD;;;;GAIG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,OAAO,WAAW,CAAC,CAAC,CAAC,KAAG,CAAC,EAQnD,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,EAAE,IAAI,CAAC,EAAE,KAAG,CAAC,EACvB,CAAA;AAGpB;;;GAGG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC,EAAE,KAAG,CAAC,EACN,CAAA;AAG1D;;;GAGG;AACH,eAAO,MAAM,WAAW,GAAI,CAAC,EAAE,IAAI,CAAC,EAAE,KAAG,CAKxC,CAAA"}

package/dist/arrays.js

@@ -0,0 +1,34 @@
+/**
+ * Turns a {@link AnyNumberOf feature's value} into an array of objects
+ * (possibly empty), regardless of the feature's cardinality and how its
+ * value happened to be parsed.
+ */
+export const asArray = (thing) => {
+    if (thing === undefined) {
+        return [];
+    }
+    if (Array.isArray(thing)) {
+        return thing;
+    }
+    return [thing];
+};
+/**
+ * @return a view of the given array of items with duplicates removed.
+ */
+export const uniquesAmong = (ts) => [...new Set(ts)];
+/**
+ * @return the defined values of given type (parameter) `T` from the given array,
+ * leaving out the `null` or `undefined` values.
+ */
+export const keepDefineds = (ts) => ts.filter((t) => t !== undefined && t !== null);
+/**
+ * @return the last element of the given `ts` array.
+ * @throws an {@link Error} if the array is empty, so it doesn't have a last element.
+ */
+export const lastOfArray = (ts) => {
+    if (ts.length === 0) {
+        throw new Error(`empty array doesn't have a last element`);
+    }
+    return ts[ts.length - 1];
+};
+//# sourceMappingURL=arrays.js.map

package/dist/arrays.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrays.js","sourceRoot":"","sources":["../src/arrays.ts"],"names":[],"mappings":"AAQA;;;;GAIG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,KAAqB,EAAO,EAAE;IACrD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,EAAE,CAAA;IACb,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,KAAK,CAAA;IAChB,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAA;AAClB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAI,EAAO,EAAO,EAAE,CAC5C,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;AAGpB;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAI,EAA4B,EAAO,EAAE,CACjE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,CAAQ,CAAA;AAG1D;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAI,EAAO,EAAK,EAAE;IACzC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAA;IAC9D,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAC5B,CAAC,CAAA"}

package/dist/cycles.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cycles.d.ts","sourceRoot":"","sources":["../src/cycles.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;AAG5C;;;;GAIG;AACH,eAAO,MAAM,SAAS,uDAMrB,CAAA"}
+{"version":3,"file":"cycles.d.ts","sourceRoot":"","sources":["../src/cycles.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;AAG5C;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,OAAO,CAAC,EAAE,eAAe,aAAa,CAAC,CAAC,CAAC,KAAG,CAAC,EAMzE,CAAA"}

package/dist/graphs.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graphs.d.ts","sourceRoot":"","sources":["../src/graphs.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,MAAM,MAAM,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;AAE9C;;;;;;;GAOG;AACH,eAAO,MAAM,WAAW,uFAenB,CAAA;AAEL;;GAEG;AACH,eAAO,MAAM,UAAU,kBAAmB,CAAA"}
+{"version":3,"file":"graphs.d.ts","sourceRoot":"","sources":["../src/graphs.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,MAAM,MAAM,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;AAE9C;;;;;;;GAOG;AACH,eAAO,MAAM,WAAW,GACnB,CAAC,EAAE,CAAC,EAAE,QAAQ,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,KAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAcjF,CAAA;AAEL;;GAEG;AACH,eAAO,MAAM,UAAU,GAAI,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAA"}

package/dist/index.d.ts

@@ -1,8 +1,9 @@
-export * from "./array-helpers.js";
+export * from "./arrays.js";
 export * from "./cycles.js";
 export * from "./graphs.js";
-export * from "./map-helpers.js";
-export * from "./nested-map.js";
+export * from "./json.js";
+export * from "./maps.js";
+export * from "./nested-maps.js";
 export * from "./recursion.js";
 export * from "./string-sorting.js";
 export * from "./string-mapping.js";

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAA;AAClC,cAAc,aAAa,CAAA;AAC3B,cAAc,aAAa,CAAA;AAC3B,cAAc,kBAAkB,CAAA;AAChC,cAAc,iBAAiB,CAAA;AAC/B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,qBAAqB,CAAA;AACnC,cAAc,qBAAqB,CAAA;AACnC,cAAc,eAAe,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAA;AAC3B,cAAc,aAAa,CAAA;AAC3B,cAAc,aAAa,CAAA;AAC3B,cAAc,WAAW,CAAA;AACzB,cAAc,WAAW,CAAA;AACzB,cAAc,kBAAkB,CAAA;AAChC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,qBAAqB,CAAA;AACnC,cAAc,qBAAqB,CAAA;AACnC,cAAc,eAAe,CAAA"}

package/dist/index.js

@@ -1,8 +1,9 @@
-export * from "./array-helpers.js";
+export * from "./arrays.js";
 export * from "./cycles.js";
 export * from "./graphs.js";
-export * from "./map-helpers.js";
-export * from "./nested-map.js";
+export * from "./json.js";
+export * from "./maps.js";
+export * from "./nested-maps.js";
 export * from "./recursion.js";
 export * from "./string-sorting.js";
 export * from "./string-mapping.js";

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAA;AAClC,cAAc,aAAa,CAAA;AAC3B,cAAc,aAAa,CAAA;AAC3B,cAAc,kBAAkB,CAAA;AAChC,cAAc,iBAAiB,CAAA;AAC/B,cAAc,gBAAgB,CAAA;AAC9B,cAAc,qBAAqB,CAAA;AACnC,cAAc,qBAAqB,CAAA;AACnC,cAAc,eAAe,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAA;AAC3B,cAAc,aAAa,CAAA;AAC3B,cAAc,aAAa,CAAA;AAC3B,cAAc,WAAW,CAAA;AACzB,cAAc,WAAW,CAAA;AACzB,cAAc,kBAAkB,CAAA;AAChC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,qBAAqB,CAAA;AACnC,cAAc,qBAAqB,CAAA;AACnC,cAAc,eAAe,CAAA"}

package/dist/json.d.ts

@@ -0,0 +1,5 @@
+/** Normalized JSON with 4 spaces as indent */
+export declare const asPrettyJsonString: (obj: unknown) => string;
+/** Minimal JSON with no spaces as indent */
+export declare const asMinimalJsonString: (obj: unknown) => string;
+//# sourceMappingURL=json.d.ts.map

package/dist/json.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"json.d.ts","sourceRoot":"","sources":["../src/json.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,eAAO,MAAM,kBAAkB,GAAI,KAAK,OAAO,KAAG,MAEjD,CAAA;AACD,4CAA4C;AAC5C,eAAO,MAAM,mBAAmB,GAAK,KAAK,OAAO,KAAG,MAEnD,CAAA"}

package/dist/json.js

@@ -0,0 +1,9 @@
+/** Normalized JSON with 4 spaces as indent */
+export const asPrettyJsonString = (obj) => {
+    return JSON.stringify(obj, null, 4);
+};
+/** Minimal JSON with no spaces as indent */
+export const asMinimalJsonString = (obj) => {
+    return JSON.stringify(obj, null, 0);
+};
+//# sourceMappingURL=json.js.map

package/dist/json.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json.js","sourceRoot":"","sources":["../src/json.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,GAAY,EAAU,EAAE;IACvD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC,CAAA;AACD,4CAA4C;AAC5C,MAAM,CAAC,MAAM,mBAAmB,GAAI,CAAC,GAAY,EAAU,EAAE;IACzD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC,CAAA"}

package/dist/{map-helpers.d.ts → maps.d.ts}

@@ -22,4 +22,17 @@ export declare const duplicatesAmong: <T>(ts: T[], keyFunc: (t: T) => string) =>
  * Maps the values of a map/record according to the given mapping function.
  */
 export declare const mapValues: <V, W>(map: Record<string, V>, valFunc: (v: V) => W) => Record<string, W>;
-//# sourceMappingURL=map-helpers.d.ts.map
+/**
+ * Gets the value under the given key from the given map,
+ * creating that value when that key wasn't present yet.
+ * This allows for convenient “chaining” of map-lookups,
+ * e.g. to build up nested maps.
+ */
+export declare const lazyMapGet: <T>(map: {
+    [key: string]: T;
+}, key: string, createThunk: () => T) => T;
+/**
+ * @return a map with each key-value pair the result of mapping an item in the given list using the given key and value functions.
+ */
+export declare const mapFrom: <T, V>(ts: T[], keyFunc: (t: T) => string, valueFunc: (t: T) => V) => Record<string, V>;
+//# sourceMappingURL=maps.d.ts.map

package/dist/maps.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"maps.d.ts","sourceRoot":"","sources":["../src/maps.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,SAAS;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,EAAE,IAAI,CAAC,EAAE,KAAG;IAAE,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,CAAA;CAO5E,CAAA;AAGD;;GAEG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,KAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAYjF,CAAA;AAGD;;GAEG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,EAAE,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,KAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAIlG,CAAA;AAGL;;GAEG;AACH,eAAO,MAAM,eAAe,GAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,KAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAC7B,CAAA;AAG7D;;GAEG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAI1F,CAAA;AAGL;;;;;GAKG;AACH,eAAO,MAAM,UAAU,GAAI,CAAC,EAAE,KAAK;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,CAAA;CAAE,EAAE,KAAK,MAAM,EAAE,aAAa,MAAM,CAAC,KAAG,CAO5F,CAAA;AAGD;;GAEG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAGtG,CAAA"}

package/dist/{map-helpers.js → maps.js}

@@ -39,4 +39,22 @@ export const duplicatesAmong = (ts, keyFunc) => filterValues(groupBy(ts, keyFunc
  */
 export const mapValues = (map, valFunc) => Object.fromEntries(Object.entries(map)
     .map(([key, value]) => [key, valFunc(value)]));
-//# sourceMappingURL=map-helpers.js.map
+/**
+ * Gets the value under the given key from the given map,
+ * creating that value when that key wasn't present yet.
+ * This allows for convenient “chaining” of map-lookups,
+ * e.g. to build up nested maps.
+ */
+export const lazyMapGet = (map, key, createThunk) => {
+    if (key in map) {
+        return map[key];
+    }
+    const value = createThunk();
+    map[key] = value;
+    return value;
+};
+/**
+ * @return a map with each key-value pair the result of mapping an item in the given list using the given key and value functions.
+ */
+export const mapFrom = (ts, keyFunc, valueFunc) => Object.fromEntries(ts.map((t) => [keyFunc(t), valueFunc(t)]));
+//# sourceMappingURL=maps.js.map

package/dist/maps.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"maps.js","sourceRoot":"","sources":["../src/maps.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAA2B,EAAO,EAAuB,EAAE;IAC9E,MAAM,GAAG,GAAwB,EAAE,CAAA;IACnC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACb,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;IACjB,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;IACV,6EAA6E;AACjF,CAAC,CAAA;AAGD;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,EAAO,EAAE,OAAyB,EAAuB,EAAE;IAClF,MAAM,GAAG,GAAwB,EAAE,CAAA;IACnC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACb,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACtB,IAAI,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;QACnB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,IAAI,GAAG,EAAE,CAAA;YACT,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAA;QACnB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;AACd,CAAC,CAAA;AAGD;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAI,GAAsB,EAAE,SAA4B,EAAqB,EAAE,CACvG,MAAM,CAAC,WAAW,CACd,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;KACd,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAChD,CAAA;AAGL;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAI,EAAO,EAAE,OAAyB,EAAuB,EAAE,CAC1F,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAG7D;;GAEG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAO,GAAsB,EAAE,OAAoB,EAAqB,EAAE,CAC/F,MAAM,CAAC,WAAW,CACd,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;KACd,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CACpD,CAAA;AAGL;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAI,GAAyB,EAAE,GAAW,EAAE,WAAoB,EAAK,EAAE;IAC7F,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;QACb,OAAO,GAAG,CAAC,GAAG,CAAC,CAAA;IACnB,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,EAAE,CAAA;IAC3B,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;IAChB,OAAO,KAAK,CAAA;AAChB,CAAC,CAAA;AAGD;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAO,EAAO,EAAE,OAAyB,EAAE,SAAsB,EAAqB,EAAE,CAC3G,MAAM,CAAC,WAAW,CACd,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAC5C,CAAA"}

package/dist/{nested-map.d.ts → nested-maps.d.ts}

@@ -1,27 +1,30 @@
 export type Nested1Map<T> = Record<string, T>;
 export type Nested2Map<T> = Record<string, Record<string, T>>;
 export type Nested3Map<T> = Record<string, Record<string, Record<string, T>>>;
-export declare const mapValuesMapper: <T, R>(valueMapFunc: (t: T) => R) => (map: Record<string, T>) => Record<string, R>;
-export declare const nested2Mapper: <T, R>(valueMapFunc: (t: T) => R) => (map: Record<string, Record<string, T>>) => Record<string, Record<string, R>>;
-export declare const nested3Mapper: <T, R>(valueMapFunc: (t: T) => R) => (map: Record<string, Record<string, Record<string, T>>>) => Record<string, Record<string, Record<string, R>>>;
+export type Nested1Mapper<T, R> = (nested1Map: Nested1Map<T>) => Nested1Map<R>;
+export declare const mapValuesMapper: <T, R>(valueMapFunc: (t: T) => R) => Nested1Mapper<T, R>;
+export type Nested2Mapper<T, R> = (nested2Map: Nested2Map<T>) => Nested2Map<R>;
+export declare const nested2Mapper: <T, R>(valueMapFunc: (t: T) => R) => Nested2Mapper<T, R>;
+export type Nested3Mapper<T, R> = (nested3Map: Nested3Map<T>) => Nested3Map<R>;
+export declare const nested3Mapper: <T, R>(valueMapFunc: (t: T) => R) => Nested3Mapper<T, R>;
 /**
  * Return a function that groups an array of things using a group function as a
  *  map : string (group key) &rarr; array of grouped things.
  */
-export declare const grouper: <T>(key1Func: (t: T) => string) => (ts: T[]) => Nested1Map<T[]>;
+export declare const grouper: <T>(key1Func: (t: T) => string) => ((ts: T[]) => Nested1Map<T[]>);
 /**
  * Return a function that groups an array of things using two group functions as a nested map
  *  map : string (group key 1) &rarr;
  *      map : string (group key 2) &rarr; array of grouped things.
  */
-export declare const nested2Grouper: <T>(key1Func: (t: T) => string, key2Func: (t: T) => string) => (ts: T[]) => Nested2Map<T[]>;
+export declare const nested2Grouper: <T>(key1Func: (t: T) => string, key2Func: (t: T) => string) => ((ts: T[]) => Nested2Map<T[]>);
 /**
  * Return a function that groups an array of things using two group functions as a nested map
  *  map : string (group key 1) &rarr;
  *      map : string (group key 2) &rarr;
  *          map : string (group key 3) &rarr; array of grouped things.
  */
-export declare const nested3Grouper: <T>(key1Func: (t: T) => string, key2Func: (t: T) => string, key3Func: (t: T) => string) => (ts: T[]) => Nested3Map<T[]>;
+export declare const nested3Grouper: <T>(key1Func: (t: T) => string, key2Func: (t: T) => string, key3Func: (t: T) => string) => ((ts: T[]) => Nested3Map<T[]>);
 /**
  * Flat-maps over the values of a
  *  map : string (group key) &rarr; values
@@ -43,4 +46,4 @@ export declare const nestedFlatMap2: <T, R>(nested2Map: Nested2Map<T>, map2Func:
  * using the map function, which is also provided with the keys.
  */
 export declare const nestedFlatMap3: <T, R>(nested3Map: Nested3Map<T>, map3Func: (t: T, key1: string, key2: string, key3: string) => R) => R[];
-//# sourceMappingURL=nested-map.d.ts.map
+//# sourceMappingURL=nested-maps.d.ts.map

package/dist/nested-maps.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nested-maps.d.ts","sourceRoot":"","sources":["../src/nested-maps.ts"],"names":[],"mappings":"AAGA,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;AAC7C,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAA;AAC7D,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;AAE7E,MAAM,MAAM,aAAa,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAA;AAC9E,eAAO,MAAM,eAAe,GACvB,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAEwC,CAAA;AAGjG,MAAM,MAAM,aAAa,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAA;AAC9E,eAAO,MAAM,aAAa,GAAI,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAChC,CAAA;AAElD,MAAM,MAAM,aAAa,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAA;AAC9E,eAAO,MAAM,aAAa,GAAI,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAClC,CAAA;AAEhD;;;GAGG;AACH,eAAO,MAAM,OAAO,GACf,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,KAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,CAEjC,CAAA;AAEjC;;;;GAIG;AACH,eAAO,MAAM,cAAc,GACtB,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,KAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,CAEzB,CAAA;AAGrE;;;;;GAKG;AACH,eAAO,MAAM,cAAc,GACtB,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,KAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,CAEpC,CAAA;AAEtF;;;;GAIG;AACH,eAAO,MAAM,aAAa,GAAI,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,KAAK,CAAC,KAAG,CAAC,EAMzF,CAAA;AAET;;;;;GAKG;AACH,eAAO,MAAM,cAAc,GAAI,CAAC,EAAE,CAAC,EAAE,YAAY,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,CAAC,KAAG,CAAC,EAQ5G,CAAA;AAET;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,GAAI,CAAC,EAAE,CAAC,EAAE,YAAY,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,CAAC,KAAG,CAAC,EAQ1H,CAAA"}

package/dist/{nested-map.js → nested-maps.js}

@@ -1,6 +1,5 @@
-import { groupBy } from "./map-helpers.js";
+import { groupBy } from "./maps.js";
 export const mapValuesMapper = (valueMapFunc) => (map) => Object.fromEntries(Object.entries(map).map(([key, value]) => [key, valueMapFunc(value)]));
-// === mapValues(map, valueFunc)
 export const nested2Mapper = (valueMapFunc) => mapValuesMapper(mapValuesMapper(valueMapFunc));
 export const nested3Mapper = (valueMapFunc) => mapValuesMapper(nested2Mapper(valueMapFunc));
 /**
@@ -49,4 +48,4 @@ export const nestedFlatMap2 = (nested2Map, map2Func) => Object
 export const nestedFlatMap3 = (nested3Map, map3Func) => Object
     .entries(nested3Map)
     .flatMap(([key1, nestedMap2]) => nestedFlatMap2(nestedMap2, (t, key2, key3) => map3Func(t, key1, key2, key3)));
-//# sourceMappingURL=nested-map.js.map
+//# sourceMappingURL=nested-maps.js.map

package/dist/nested-maps.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nested-maps.js","sourceRoot":"","sources":["../src/nested-maps.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAQnC,MAAM,CAAC,MAAM,eAAe,GACxB,CAAO,YAAyB,EAAuB,EAAE,CACzD,CAAC,GAAsB,EAAqB,EAAE,CAC1C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AAIjG,MAAM,CAAC,MAAM,aAAa,GAAG,CAAO,YAAyB,EAAuB,EAAE,CAClF,eAAe,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC,CAAA;AAGlD,MAAM,CAAC,MAAM,aAAa,GAAG,CAAO,YAAyB,EAAuB,EAAE,CAClF,eAAe,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAA;AAEhD;;;GAGG;AACH,MAAM,CAAC,MAAM,OAAO,GAChB,CAAI,QAA0B,EAAkC,EAAE,CAC9D,CAAC,EAAO,EAAE,EAAE,CACR,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;AAEjC;;;;GAIG;AACH,MAAM,CAAC,MAAM,cAAc,GACvB,CAAI,QAA0B,EAAE,QAA0B,EAAkC,EAAE,CAC1F,CAAC,EAAO,EAAE,EAAE,CACR,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AACrE,4EAA4E;AAE5E;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GACvB,CAAI,QAA0B,EAAE,QAA0B,EAAE,QAA0B,EAAkC,EAAE,CACtH,CAAC,EAAO,EAAE,EAAE,CACR,eAAe,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAEtF;;;;GAIG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAO,GAAsB,EAAE,OAAkC,EAAO,EAAE,CACnG,MAAM;KACD,OAAO,CAAC,GAAG,CAAC;KACZ,GAAG,CACA,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CACV,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CACvB,CAAA;AAET;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAO,UAAyB,EAAE,QAAiD,EAAO,EAAE,CACtH,MAAM;KACD,OAAO,CAAC,UAAU,CAAC;KACnB,OAAO,CACJ,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,EAAE,CACnB,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAClC,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAC1B,CACR,CAAA;AAET;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAO,UAAyB,EAAE,QAA+D,EAAO,EAAE,CACpI,MAAM;KACD,OAAO,CAAC,UAAU,CAAC;KACnB,OAAO,CACJ,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,EAAE,CACnB,cAAc,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CACzC,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAChC,CACR,CAAA"}

package/dist/recursion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"recursion.d.ts","sourceRoot":"","sources":["../src/recursion.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;AAErC;;;GAGG;AACH,QAAA,MAAM,0BAA0B,mFAiB3B,CAAA;AAGL,QAAA,MAAM,iBAAiB,kBAAmB,CAAA;AAG1C,YAAY,EACR,UAAU,EACb,CAAA;AAED,OAAO,EACH,0BAA0B,EAC1B,iBAAiB,EACpB,CAAA"}
+{"version":3,"file":"recursion.d.ts","sourceRoot":"","sources":["../src/recursion.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;AAErC;;;GAGG;AACH,QAAA,MAAM,0BAA0B,GAAI,CAAC,EAAE,CAAC,EACpC,QAAQ,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EACxB,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,KAC5B,UAAU,CAAC,CAAC,EAAE,CAAC,CAcb,CAAA;AAGL,QAAA,MAAM,iBAAiB,GAAI,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAA;AAG1C,YAAY,EACR,UAAU,EACb,CAAA;AAED,OAAO,EACH,0BAA0B,EAC1B,iBAAiB,EACpB,CAAA"}

package/dist/string-mapping.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"string-mapping.d.ts","sourceRoot":"","sources":["../src/string-mapping.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,KAAK,MAAM,CAAA;AAE5D;;GAEG;AACH,MAAM,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,CAAA;AAGlD;;GAEG;AACH,eAAO,MAAM,YAAY,cAAe,MAAM,KAAG,aACN,CAAA;AAE3C;;;GAGG;AACH,eAAO,MAAM,MAAM,EAAE,aAC0B,CAAA;AAE/C;;;;GAIG;AACH,eAAO,MAAM,KAAK,kBAAmB,aAAa,oBAAoB,YAAY,EAAE,KAAG,aAOlF,CAAA"}
+{"version":3,"file":"string-mapping.d.ts","sourceRoot":"","sources":["../src/string-mapping.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,KAAK,MAAM,CAAA;AAE5D;;GAEG;AACH,MAAM,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,CAAA;AAGlD;;GAEG;AACH,eAAO,MAAM,YAAY,GAAI,WAAW,MAAM,KAAG,aACN,CAAA;AAE3C;;;GAGG;AACH,eAAO,MAAM,MAAM,EAAE,aAC0B,CAAA;AAE/C;;;;GAIG;AACH,eAAO,MAAM,KAAK,GAAI,eAAe,aAAa,EAAE,GAAG,eAAe,YAAY,EAAE,KAAG,aAOlF,CAAA"}

package/dist/string-sorting.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"string-sorting.d.ts","sourceRoot":"","sources":["../src/string-sorting.ts"],"names":[],"mappings":"AAAA;;GAEG;AAWH,eAAO,MAAM,eAAe,kCAAmC,MAAM,QAC5B,CAAA;AAGzC,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,MAAM,EAAE,CAAA;AAQ1D,eAAO,MAAM,aAAa,cAAkC,CAAA;AAE5D,eAAO,MAAM,wBAAwB,cAAgD,CAAA"}
+{"version":3,"file":"string-sorting.d.ts","sourceRoot":"","sources":["../src/string-sorting.ts"],"names":[],"mappings":"AAAA;;GAEG;AAWH,eAAO,MAAM,eAAe,GAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,QAC5B,CAAA;AAGzC,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,MAAM,EAAE,CAAA;AAQ1D,eAAO,MAAM,aAAa,cAAkC,CAAA;AAE5D,eAAO,MAAM,wBAAwB,cAAgD,CAAA"}

package/dist/toposort.d.ts

@@ -2,5 +2,5 @@
  * Computes the topological order of the transitive closure of the graph with the given vertices and edges given by the edge function,
  * or returns {@code false} if there's a cycle.
  */
-export declare const dependencyOrderOf: <T>(vertices: T[], edgesOf: (vertex: T) => T[]) => false | T[];
+export declare const dependencyOrderOf: <T>(vertices: T[], edgesOf: (vertex: T) => T[]) => T[] | false;
 //# sourceMappingURL=toposort.d.ts.map

package/dist/toposort.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"toposort.d.ts","sourceRoot":"","sources":["../src/toposort.ts"],"names":[],"mappings":"AAiBA;;;GAGG;AACH,eAAO,MAAM,iBAAiB,gEA0B7B,CAAA"}
+{"version":3,"file":"toposort.d.ts","sourceRoot":"","sources":["../src/toposort.ts"],"names":[],"mappings":"AAiBA;;;GAGG;AACH,eAAO,MAAM,iBAAiB,GAAI,CAAC,EAAE,UAAU,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,EAAE,KAAG,CAAC,EAAE,GAAG,KAuBvF,CAAA"}

package/dist/toposort.js

@@ -30,9 +30,6 @@ export const dependencyOrderOf = (vertices, edgesOf) => {
         const extendedChain = [...chain, current];
         const hasCycle = edgesOf(current).some((edge) => visit(edge, extendedChain));
         ordered.push(current);
-        if (hasCycle) {
-            console.dir(ordered);
-        }
         return hasCycle;
     };
     const hasCycle = vertices.some((vertex) => visit(vertex, []));

package/dist/toposort.js.map

@@ -1 +1 @@
-{"version":3,"file":"toposort.js","sourceRoot":"","sources":["../src/toposort.ts"],"names":[],"mappings":"AAAA,wDAAwD;AACxD,EAAE;AACF,iEAAiE;AACjE,mEAAmE;AACnE,0CAA0C;AAC1C,EAAE;AACF,iDAAiD;AACjD,EAAE;AACF,sEAAsE;AACtE,oEAAoE;AACpE,2EAA2E;AAC3E,sEAAsE;AACtE,iCAAiC;AACjC,EAAE;AACF,sEAAsE;AACtE,sCAAsC;AAEtC;;;GAGG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAI,QAAa,EAAE,OAA2B,EAAe,EAAE;IAC5F,MAAM,OAAO,GAAQ,EAAE,CAAA;IAEvB,MAAM,KAAK,GAAG,CAAC,OAAU,EAAE,KAAU,EAAE,EAAE;QACrC,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAChC,OAAO,KAAK,CAAA;QAChB,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAA;QACf,CAAC;QACD,MAAM,aAAa,GAAG,CAAE,GAAG,KAAK,EAAE,OAAO,CAAE,CAAA;QAC3C,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,CAClC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC,CACvC,CAAA;QACD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACrB,IAAI,QAAQ,EAAE,CAAC;YACX,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC;QACD,OAAO,QAAQ,CAAA;IACnB,CAAC,CAAA;IAED,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAC1B,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAChC,CAAA;IAED,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAA;AACrC,CAAC,CAAA"}
+{"version":3,"file":"toposort.js","sourceRoot":"","sources":["../src/toposort.ts"],"names":[],"mappings":"AAAA,wDAAwD;AACxD,EAAE;AACF,iEAAiE;AACjE,mEAAmE;AACnE,0CAA0C;AAC1C,EAAE;AACF,iDAAiD;AACjD,EAAE;AACF,sEAAsE;AACtE,oEAAoE;AACpE,2EAA2E;AAC3E,sEAAsE;AACtE,iCAAiC;AACjC,EAAE;AACF,sEAAsE;AACtE,sCAAsC;AAEtC;;;GAGG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAI,QAAa,EAAE,OAA2B,EAAe,EAAE;IAC5F,MAAM,OAAO,GAAQ,EAAE,CAAA;IAEvB,MAAM,KAAK,GAAG,CAAC,OAAU,EAAE,KAAU,EAAE,EAAE;QACrC,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAChC,OAAO,KAAK,CAAA;QAChB,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAA;QACf,CAAC;QACD,MAAM,aAAa,GAAG,CAAE,GAAG,KAAK,EAAE,OAAO,CAAE,CAAA;QAC3C,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,CAClC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC,CACvC,CAAA;QACD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACrB,OAAO,QAAQ,CAAA;IACnB,CAAC,CAAA;IAED,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAC1B,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAChC,CAAA;IAED,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAA;AACrC,CAAC,CAAA"}

package/package.json

@@ -1,29 +1,29 @@
 {
-  "name": "@lionweb/ts-utils",
-  "version": "0.7.0-beta.2",
-  "description": "Utilities for LionWeb JSON",
-  "main": "dist/index.js",
-  "types": "dist/index.d.ts",
-  "typings": "dist/index.d.ts",
-  "type": "module",
-  "license": "Apache-2.0",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/LionWeb-io/lionweb-typescript.git"
-  },
-  "bugs": {
-    "url": "https://github.com/LionWeb-io/lionweb-typescript/issues"
-  },
-  "scripts": {
-    "clean": "rm -rf dist/ node_modules/ lionweb-ts-utils-*.tgz",
-    "build": "tsc",
-    "lint": "eslint src",
-    "prep:pre-release": "npm run clean && npm install && npm run build",
-    "prerelease-alpha": "npm run prep:pre-release",
-    "release-alpha": "npm publish --tag alpha",
-    "prerelease-beta": "npm run prep:pre-release",
-    "release-beta": "npm publish --tag beta",
-    "prerelease": "npm run prep:pre-release",
-    "release": "npm publish"
-  }
+    "name": "@lionweb/ts-utils",
+    "version": "0.7.0-beta.21",
+    "description": "Utilities for LionWeb JSON",
+    "main": "dist/index.js",
+    "types": "dist/index.d.ts",
+    "typings": "dist/index.d.ts",
+    "type": "module",
+    "license": "Apache-2.0",
+    "repository": {
+        "type": "git",
+        "url": "git+https://github.com/LionWeb-io/lionweb-typescript.git"
+    },
+    "bugs": {
+        "url": "https://github.com/LionWeb-io/lionweb-typescript/issues"
+    },
+    "scripts": {
+        "clean": "npx rimraf dist node_modules -g lionweb-ts-utils-*.tgz",
+        "build": "tsc",
+        "lint": "eslint src",
+        "prep:pre-release": "npm run clean && npm install && npm run build",
+        "prerelease-alpha": "npm run prep:pre-release",
+        "release-alpha": "npm publish --tag alpha",
+        "prerelease-beta": "npm run prep:pre-release",
+        "release-beta": "npm publish --tag beta",
+        "prerelease": "npm run prep:pre-release",
+        "release": "npm publish"
+    }
 }

package/src/arrays.ts

@@ -0,0 +1,49 @@
+/**
+ * Feature's values are often persisted as either `undefined`, a single object, or an array of objects,
+ * regardless of the actual cardinality of that feature.
+ * This is e.g. the case when parsing an Ecore XML metamodel file.
+ * This type definition captures that phenomenon.
+ */
+export type AnyNumberOf<T> = undefined | T | T[]
+
+/**
+ * Turns a {@link AnyNumberOf feature's value} into an array of objects
+ * (possibly empty), regardless of the feature's cardinality and how its
+ * value happened to be parsed.
+ */
+export const asArray = <T>(thing: AnyNumberOf<T>): T[] => {
+    if (thing === undefined) {
+        return []
+    }
+    if (Array.isArray(thing)) {
+        return thing
+    }
+    return [thing]
+}
+
+/**
+ * @return a view of the given array of items with duplicates removed.
+ */
+export const uniquesAmong = <T>(ts: T[]): T[] =>
+    [...new Set(ts)]
+
+
+/**
+ * @return the defined values of given type (parameter) `T` from the given array,
+ * leaving out the `null` or `undefined` values.
+ */
+export const keepDefineds = <T>(ts: (T | null | undefined)[]): T[] =>
+    ts.filter((t) => t !== undefined && t !== null) as T[]
+
+
+/**
+ * @return the last element of the given `ts` array.
+ * @throws an {@link Error} if the array is empty, so it doesn't have a last element.
+ */
+export const lastOfArray = <T>(ts: T[]): T => {
+    if (ts.length === 0) {
+        throw new Error(`empty array doesn't have a last element`)
+    }
+    return ts[ts.length - 1]
+}
+

package/src/cycles.ts

@@ -0,0 +1,31 @@
+export type NextsFunction<T> = (t: T) => T[]
+
+
+/**
+ * Compute whether there's a cycle of dependencies, starting with `thing` and computing "nexts" with the given `nextsFunction`.
+ * @return An array with a cycle of "things", starting at the given `thing`.
+ *  An array of length 0 means: the given `thing` is not part of any cycle.
+ */
+export const cycleWith = <T>(thing: T, nextsFunction: NextsFunction<T>): T[] => {
+
+    const result = visit<T>(thing, [], nextsFunction)
+    return result.length > 0 && result[result.length - 1] === thing
+        ? result
+        : []
+}
+
+const visit = <T>(current: T, chain: T[], nextsFunction: NextsFunction<T>): T[] => {
+    if (chain.indexOf(current) > -1) {
+        // Add current to end, so we know what sub-array constitutes the actual cycle:
+        return [ ...chain, current ]
+    }
+    const extendedChain = [ ...chain, current ]
+    for (const dependency of nextsFunction(current)) {
+        const recursion = visit(dependency, extendedChain, nextsFunction)
+        if (recursion.length > 0) {
+            return recursion
+        }
+    }
+    return []
+}
+

package/src/graphs.ts

@@ -0,0 +1,36 @@
+// NB This is an almost identical copy of packages/core/utils/recursion.ts
+//    Copied to avoid package dependencies
+/**
+ * Type def. of a generic "flatMap" function.
+ */
+export type ResultMapper<T, R> = (t: T) => R[]
+
+/**
+ * Returns a function that performs a "flatMap" on a graph that's specified as a start vertex. and a function that computes (outgoing) edges.
+ * The "flatMap" is performed depth-first, and doesn't loop on cycles.
+ * 
+ * @param mapper The function that calculates the result values
+ * @param nextVertices  The function that calculates the next edges to visit.
+ * @returns A function that takes a starting vertex and recursively calculates the result values for each vertex visited.
+ */
+export const visitAndMap =
+    <T, R>(mapper: ResultMapper<T, R>, nextVertices: (t: T) => T[]): ResultMapper<T, R> =>
+    (startVertex: T): R[] => {
+        const visited: T[] = []
+        const results: R[] = []
+        const recurse = (t: T) => {
+            if (visited.indexOf(t) > -1) {
+                return
+            }
+            visited.push(t)
+            results.push(...mapper(t))
+            nextVertices(t).forEach(recurse)
+        }
+        recurse(startVertex)
+        return results
+    }
+
+/** 
+ * A mapper function that returns the node itself as result
+ */
+export const selfMapper = <T>(t: T) => [t]

package/src/index.ts

@@ -0,0 +1,10 @@
+export * from "./arrays.js"
+export * from "./cycles.js"
+export * from "./graphs.js"
+export * from "./json.js"
+export * from "./maps.js"
+export * from "./nested-maps.js"
+export * from "./recursion.js"
+export * from "./string-sorting.js"
+export * from "./string-mapping.js"
+export * from "./toposort.js"

package/src/json.ts

@@ -0,0 +1,8 @@
+/** Normalized JSON with 4 spaces as indent */
+export const asPrettyJsonString = (obj: unknown): string => {
+    return JSON.stringify(obj, null, 4);
+}
+/** Minimal JSON with no spaces as indent */
+export const asMinimalJsonString  = (obj: unknown): string => {
+    return JSON.stringify(obj, null, 0);
+}

package/src/maps.ts

@@ -0,0 +1,82 @@
+/**
+ * Computes a map id -> thing with id.
+ */
+export const byIdMap = <T extends { id: string }>(ts: T[]): { [id: string]: T } => {
+    const map: { [id: string]: T } = {}
+    ts.forEach((t) => {
+        map[t.id] = t
+    })
+    return map
+    // TODO  -> Object.fromEntries(...) but what happens then with duplicate IDs?
+}
+
+
+/**
+ * Groups a list of items according to a computed key.
+ */
+export const groupBy = <T>(ts: T[], keyFunc: (t: T) => string): Record<string, T[]> => {
+    const map: Record<string, T[]> = {}
+    ts.forEach((t) => {
+        const key = keyFunc(t)
+        let list = map[key]
+        if (list === undefined) {
+            list = []
+            map[key] = list
+        }
+        list.push(t)
+    })
+    return map
+}
+
+
+/**
+ * Filters the values of a map/record according the given predicate.
+ */
+export const filterValues = <V>(map: Record<string, V>, predicate: (v: V) => boolean): Record<string, V> =>
+    Object.fromEntries(
+        Object.entries(map)
+            .filter(([_, value]) => predicate(value))
+    )
+
+
+/**
+ * Computes the given items whose computed keys are duplicates, as a map key &rarr; items.
+ */
+export const duplicatesAmong = <T>(ts: T[], keyFunc: (t: T) => string): Record<string, T[]> =>
+    filterValues(groupBy(ts, keyFunc), (ts) => ts.length > 1)
+
+
+/**
+ * Maps the values of a map/record according to the given mapping function.
+ */
+export const mapValues = <V, W>(map: Record<string, V>, valFunc: (v: V) => W): Record<string, W> =>
+    Object.fromEntries(
+        Object.entries(map)
+            .map(([key, value]) => [key, valFunc(value)])
+    )
+
+
+/**
+ * Gets the value under the given key from the given map,
+ * creating that value when that key wasn't present yet.
+ * This allows for convenient “chaining” of map-lookups,
+ * e.g. to build up nested maps.
+ */
+export const lazyMapGet = <T>(map: { [key: string]: T }, key: string, createThunk: () => T): T => {
+    if (key in map) {
+        return map[key]
+    }
+    const value = createThunk()
+    map[key] = value
+    return value
+}
+
+
+/**
+ * @return a map with each key-value pair the result of mapping an item in the given list using the given key and value functions.
+ */
+export const mapFrom = <T, V>(ts: T[], keyFunc: (t: T) => string, valueFunc: (t: T) => V): Record<string, V> =>
+    Object.fromEntries(
+        ts.map((t) => [keyFunc(t), valueFunc(t)])
+    )
+

package/src/nested-maps.ts

@@ -0,0 +1,99 @@
+import { groupBy } from "./maps.js"
+
+
+export type Nested1Map<T> = Record<string, T> // (for conceptual continuity)
+export type Nested2Map<T> = Record<string, Record<string, T>>
+export type Nested3Map<T> = Record<string, Record<string, Record<string, T>>>
+
+export type Nested1Mapper<T, R> = (nested1Map: Nested1Map<T>) => Nested1Map<R>
+export const mapValuesMapper =
+    <T, R>(valueMapFunc: (t: T) => R): Nested1Mapper<T, R> =>
+    (map: Record<string, T>): Record<string, R> =>
+        Object.fromEntries(Object.entries(map).map(([key, value]) => [key, valueMapFunc(value)]))
+// === mapValues(map, valueFunc)
+
+export type Nested2Mapper<T, R> = (nested2Map: Nested2Map<T>) => Nested2Map<R>
+export const nested2Mapper = <T, R>(valueMapFunc: (t: T) => R): Nested2Mapper<T, R> =>
+    mapValuesMapper(mapValuesMapper(valueMapFunc))
+
+export type Nested3Mapper<T, R> = (nested3Map: Nested3Map<T>) => Nested3Map<R>
+export const nested3Mapper = <T, R>(valueMapFunc: (t: T) => R): Nested3Mapper<T, R> =>
+    mapValuesMapper(nested2Mapper(valueMapFunc))
+
+/**
+ * Return a function that groups an array of things using a group function as a
+ *  map : string (group key) &rarr; array of grouped things.
+ */
+export const grouper =
+    <T>(key1Func: (t: T) => string): ((ts: T[]) => Nested1Map<T[]>) =>
+        (ts: T[]) =>
+            groupBy(ts, key1Func)
+
+/**
+ * Return a function that groups an array of things using two group functions as a nested map
+ *  map : string (group key 1) &rarr;
+ *      map : string (group key 2) &rarr; array of grouped things.
+ */
+export const nested2Grouper =
+    <T>(key1Func: (t: T) => string, key2Func: (t: T) => string): ((ts: T[]) => Nested2Map<T[]>) =>
+        (ts: T[]) =>
+            mapValuesMapper(grouper(key2Func))(grouper(key1Func)(ts))
+// === mapValuesMapper((vs) => groupBy(vs, key2Func))(groupBy(ts, key1Func))
+
+/**
+ * Return a function that groups an array of things using two group functions as a nested map
+ *  map : string (group key 1) &rarr;
+ *      map : string (group key 2) &rarr;
+ *          map : string (group key 3) &rarr; array of grouped things.
+ */
+export const nested3Grouper =
+    <T>(key1Func: (t: T) => string, key2Func: (t: T) => string, key3Func: (t: T) => string): ((ts: T[]) => Nested3Map<T[]>) =>
+        (ts: T[]) =>
+            mapValuesMapper(nested2Grouper(key2Func, key3Func))(grouper(key1Func)(ts))
+
+/**
+ * Flat-maps over the values of a
+ *  map : string (group key) &rarr; values
+ * using the map function, which is also provided with the keys.
+ */
+export const flatMapValues = <T, R>(map: Record<string, T>, mapFunc: (t: T, key1: string) => R): R[] =>
+    Object
+        .entries(map)
+        .map(
+            ([key1, t]) =>
+                mapFunc(t, key1)
+        )
+
+/**
+ * Flat-maps over the values of a nested map
+ *  map : string (group key 1) &rarr;
+ *      map: string (group key 2) &rarr; values
+ * using the map function, which is also provided with the keys.
+ */
+export const nestedFlatMap2 = <T, R>(nested2Map: Nested2Map<T>, map2Func: (t: T, key1: string, key2: string) => R): R[] =>
+    Object
+        .entries(nested2Map)
+        .flatMap(
+            ([key1, nestedMap1]) =>
+                flatMapValues(nestedMap1, (t, key2) =>
+                    map2Func(t, key1, key2)
+                )
+        )
+
+/**
+ * Flat-maps over the values of a nested map
+ *  map : string (group key 1) &rarr;
+ *      map: string (group key 2) &rarr;
+ *           map: string (group key 3) &rarr; values
+ * using the map function, which is also provided with the keys.
+ */
+export const nestedFlatMap3 = <T, R>(nested3Map: Nested3Map<T>, map3Func: (t: T, key1: string, key2: string, key3: string) => R): R[] =>
+    Object
+        .entries(nested3Map)
+        .flatMap(
+            ([key1, nestedMap2]) =>
+                nestedFlatMap2(nestedMap2, (t, key2, key3) =>
+                    map3Func(t, key1, key2, key3)
+                )
+        )
+

package/src/recursion.ts

@@ -0,0 +1,41 @@
+/**
+ * Type def. of a generic "flatMap" function.
+ */
+type FlatMapper<T, R> = (t: T) => R[]
+
+/**
+ * Performs a "flatMap" on a graph that's specified as a start vertex and a function that computes (outgoing) edges.
+ * The "flatMap" is performed depth-first, and doesn't loop on cycles.
+ */
+const flatMapNonCyclingFollowing = <T, R>(
+    mapper: FlatMapper<T, R>,
+    nextVertices: (t: T) => T[]
+): FlatMapper<T, R> =>
+    (startVertex: T): R[] => {
+        const visited: T[] = []
+        const rs: R[] = []
+        const recurse = (t: T) => {
+            if (visited.indexOf(t) > -1) {
+                return
+            }
+            visited.push(t)
+            rs.push(...mapper(t))
+            nextVertices(t).forEach(recurse)
+        }
+        recurse(startVertex)
+        return rs
+    }
+
+
+const trivialFlatMapper = <T>(t: T) => [t]
+
+
+export type {
+    FlatMapper
+}
+
+export {
+    flatMapNonCyclingFollowing,
+    trivialFlatMapper
+}
+

package/src/string-mapping.ts

@@ -0,0 +1,38 @@
+/**
+ * A type for functions that map any number of strings (as a variadic argument) to a single string.
+ */
+export type StringsMapper = (...strings: string[]) => string
+
+/**
+ * A type for functions that map strings to strings.
+ */
+export type StringMapper = (str: string) => string
+
+
+/**
+ * @return a {@link StringsMapper function} that concatenates the strings passed into it, using the given separator string.
+ */
+export const concatenator = (separator: string): StringsMapper =>
+    (...strings) => strings.join(separator)
+
+/**
+ * @return a {@link StringsMapper function} that picks the last string of the strings passed into it.
+ * (This means that there must always be at least one string passed in.)
+ */
+export const lastOf: StringsMapper =
+    (...strings) => strings[strings.length - 1]
+
+/**
+ * @return a {@link StringsMapper function} that chains the given {@link StringsMapper functions} (at least 1),
+ * in thar order.
+ * (This is straightforward functional composition.)
+ */
+export const chain = (stringsMapper: StringsMapper, ...stringMappers: StringMapper[]): StringsMapper =>
+    (...strings: string[]) => {
+        let result = stringsMapper(...strings)
+        stringMappers.forEach((mapper) => {
+            result = mapper(result)
+        })
+        return result
+    }
+

package/src/string-sorting.ts

@@ -0,0 +1,29 @@
+/**
+ * Various functional utilities for sorting things.
+ */
+
+
+type Comparer<T> = (l: T, r: T) => number
+
+const stringCompare: Comparer<string> = (l, r): number =>
+    l === r ? 0 : (l > r ? 1 : -1)
+
+const stringyCompare = <T>(keyFunc: (t: T) => string): Comparer<T> =>
+    (l: T, r: T) => stringCompare(keyFunc(l), keyFunc(r))
+
+export const sortByStringKey = <T>(ts: T[], keyFunc: (t: T) => string) =>
+    [...ts].sort(stringyCompare(keyFunc))
+
+
+export type StringSorter = (strings: string[]) => string[]
+
+const sortedStringsWith = (strMap: (str: string) => string): StringSorter =>
+    (strings) => {
+        strings.sort((l, r) => strMap(l).localeCompare(strMap(r)))
+        return strings
+    }
+
+export const sortedStrings = sortedStringsWith((str) => str)
+
+export const sortedStringsByUppercase = sortedStringsWith((str) => str.toUpperCase())
+

package/src/toposort.ts

@@ -0,0 +1,46 @@
+// Copyright 2025 TRUMPF Laser SE and other contributors
+//
+// Licensed under the Apache License, Version 2.0 (the "License")
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//
+// SPDX-FileCopyrightText: 2025 TRUMPF Laser SE and other contributors
+// SPDX-License-Identifier: Apache-2.0
+
+/**
+ * Computes the topological order of the transitive closure of the graph with the given vertices and edges given by the edge function,
+ * or returns {@code false} if there's a cycle.
+ */
+export const dependencyOrderOf = <T>(vertices: T[], edgesOf: (vertex: T) => T[]): T[] | false => {
+    const ordered: T[] = []
+
+    const visit = (current: T, chain: T[]) => {
+        if (ordered.indexOf(current) > -1) {
+            return false
+        }
+        if (chain.indexOf(current) > -1) {
+            return true
+        }
+        const extendedChain = [ ...chain, current ]
+        const hasCycle = edgesOf(current).some(
+            (edge) => visit(edge, extendedChain)
+        )
+        ordered.push(current)
+        return hasCycle
+    }
+
+    const hasCycle = vertices.some(
+        (vertex) => visit(vertex, [])
+    )
+
+    return hasCycle ? false : ordered
+}
+

package/dist/array-helpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"array-helpers.d.ts","sourceRoot":"","sources":["../src/array-helpers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;AAEhD;;;;GAIG;AACH,eAAO,MAAM,OAAO,mCAQnB,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,YAAY,qBACL,CAAA"}

package/dist/array-helpers.js

@@ -1,19 +0,0 @@
-/**
- * Turns a {@link AnyNumberOf feature's value} into an array of objects
- * (possibly empty), regardless of the feature's cardinality and how its
- * value happened to be parsed.
- */
-export const asArray = (thing) => {
-    if (thing === undefined) {
-        return [];
-    }
-    if (Array.isArray(thing)) {
-        return thing;
-    }
-    return [thing];
-};
-/**
- * @return a view of the given array of items with duplicates removed.
- */
-export const uniquesAmong = (ts) => [...new Set(ts)];
-//# sourceMappingURL=array-helpers.js.map

package/dist/array-helpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"array-helpers.js","sourceRoot":"","sources":["../src/array-helpers.ts"],"names":[],"mappings":"AAQA;;;;GAIG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,KAAqB,EAAO,EAAE;IACrD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,EAAE,CAAA;IACb,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,KAAK,CAAA;IAChB,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAA;AAClB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAI,EAAO,EAAO,EAAE,CAC5C,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA"}

package/dist/map-helpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"map-helpers.d.ts","sourceRoot":"","sources":["../src/map-helpers.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,eAAO,MAAM,OAAO;QAAoB,MAAM;;;CAO7C,CAAA;AAGD;;GAEG;AACH,eAAO,MAAM,OAAO,kCAAmC,MAAM,wBAY5D,CAAA;AAGD;;GAEG;AACH,eAAO,MAAM,YAAY,mDAAoD,OAAO,sBAI/E,CAAA;AAGL;;GAEG;AACH,eAAO,MAAM,eAAe,kCAAmC,MAAM,wBACR,CAAA;AAG7D;;GAEG;AACH,eAAO,MAAM,SAAS,2EAIjB,CAAA"}

package/dist/map-helpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"map-helpers.js","sourceRoot":"","sources":["../src/map-helpers.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAA2B,EAAO,EAAuB,EAAE;IAC9E,MAAM,GAAG,GAAwB,EAAE,CAAA;IACnC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACb,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;IACjB,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;IACV,6EAA6E;AACjF,CAAC,CAAA;AAGD;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,EAAO,EAAE,OAAyB,EAAuB,EAAE;IAClF,MAAM,GAAG,GAAwB,EAAE,CAAA;IACnC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACb,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACtB,IAAI,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;QACnB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,IAAI,GAAG,EAAE,CAAA;YACT,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAA;QACnB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;AACd,CAAC,CAAA;AAGD;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAI,GAAsB,EAAE,SAA4B,EAAqB,EAAE,CACvG,MAAM,CAAC,WAAW,CACd,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;KACd,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAChD,CAAA;AAGL;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAI,EAAO,EAAE,OAAyB,EAAuB,EAAE,CAC1F,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAG7D;;GAEG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAO,GAAsB,EAAE,OAAoB,EAAqB,EAAE,CAC/F,MAAM,CAAC,WAAW,CACd,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;KACd,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CACpD,CAAA"}

package/dist/nested-map.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"nested-map.d.ts","sourceRoot":"","sources":["../src/nested-map.ts"],"names":[],"mappings":"AAGA,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;AAC7C,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAA;AAC7D,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;AAE7E,eAAO,MAAM,eAAe,oFAGqE,CAAA;AAGjG,eAAO,MAAM,aAAa,oHAAsF,CAAA;AAEhH,eAAO,MAAM,aAAa,oJAAoF,CAAA;AAE9G;;;GAGG;AACH,eAAO,MAAM,OAAO,0BACQ,MAAM,iCAED,CAAA;AAEjC;;;;GAIG;AACH,eAAO,MAAM,cAAc,0BACC,MAAM,sBAAsB,MAAM,iCAEO,CAAA;AAGrE;;;;;GAKG;AACH,eAAO,MAAM,cAAc,0BACC,MAAM,sBAAsB,MAAM,sBAAsB,MAAM,iCAEJ,CAAA;AAEtF;;;;GAIG;AACH,eAAO,MAAM,aAAa,uDAAwD,MAAM,cAM/E,CAAA;AAET;;;;;GAKG;AACH,eAAO,MAAM,cAAc,2DAA4D,MAAM,QAAQ,MAAM,cAQlG,CAAA;AAET;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,2DAA4D,MAAM,QAAQ,MAAM,QAAQ,MAAM,cAQhH,CAAA"}

package/dist/nested-map.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"nested-map.js","sourceRoot":"","sources":["../src/nested-map.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAA;AAO1C,MAAM,CAAC,MAAM,eAAe,GACxB,CAAO,YAAyB,EAAE,EAAE,CACpC,CAAC,GAAsB,EAAqB,EAAE,CAC1C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AACjG,gCAAgC;AAEhC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAO,YAAyB,EAAE,EAAE,CAAC,eAAe,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC,CAAA;AAEhH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAO,YAAyB,EAAE,EAAE,CAAC,eAAe,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAA;AAE9G;;;GAGG;AACH,MAAM,CAAC,MAAM,OAAO,GAChB,CAAI,QAA0B,EAAkC,EAAE,CAC9D,CAAC,EAAO,EAAE,EAAE,CACR,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;AAEjC;;;;GAIG;AACH,MAAM,CAAC,MAAM,cAAc,GACvB,CAAI,QAA0B,EAAE,QAA0B,EAAkC,EAAE,CAC1F,CAAC,EAAO,EAAE,EAAE,CACR,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AACrE,4EAA4E;AAE5E;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GACvB,CAAI,QAA0B,EAAE,QAA0B,EAAE,QAA0B,EAAkC,EAAE,CACtH,CAAC,EAAO,EAAE,EAAE,CACR,eAAe,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAEtF;;;;GAIG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAO,GAAsB,EAAE,OAAkC,EAAO,EAAE,CACnG,MAAM;KACD,OAAO,CAAC,GAAG,CAAC;KACZ,GAAG,CACA,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CACV,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CACvB,CAAA;AAET;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAO,UAAyB,EAAE,QAAiD,EAAO,EAAE,CACtH,MAAM;KACD,OAAO,CAAC,UAAU,CAAC;KACnB,OAAO,CACJ,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,EAAE,CACnB,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAClC,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAC1B,CACR,CAAA;AAET;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAO,UAAyB,EAAE,QAA+D,EAAO,EAAE,CACpI,MAAM;KACD,OAAO,CAAC,UAAU,CAAC;KACnB,OAAO,CACJ,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,EAAE,CACnB,cAAc,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CACzC,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAChC,CACR,CAAA"}