@lionweb/ts-utils 0.6.13-beta.5 → 0.7.0-alpha.2

package/CHANGELOG.md

@@ -1,4 +1,6 @@
 # Changelog
 
-## 0.6.13
+## 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`.
 

package/README.md

@@ -12,9 +12,8 @@ An NPM package that can be added to a Node.js/NPM codebase as follows:
 ```shell
 $ npm add @lionweb/ts-utils
 ```
-It contains:
 
-* Utilities ...
+It contains general TypeScript utilities, e.g. for working with maps and such.
 
 
 ## Development

package/dist/index.d.ts

@@ -4,6 +4,7 @@ export * from "./graphs.js";
 export * from "./map-helpers.js";
 export * from "./nested-map.js";
 export * from "./recursion.js";
-export * from "./sorting.js";
+export * from "./string-sorting.js";
 export * from "./string-mapping.js";
+export * from "./toposort.js";
 //# sourceMappingURL=index.d.ts.map

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,cAAc,CAAA;AAC5B,cAAc,qBAAqB,CAAA"}
+{"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"}

package/dist/index.js

@@ -4,6 +4,7 @@ export * from "./graphs.js";
 export * from "./map-helpers.js";
 export * from "./nested-map.js";
 export * from "./recursion.js";
-export * from "./sorting.js";
+export * from "./string-sorting.js";
 export * from "./string-mapping.js";
+export * from "./toposort.js";
 //# sourceMappingURL=index.js.map

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,cAAc,CAAA;AAC5B,cAAc,qBAAqB,CAAA"}
+{"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"}

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

@@ -1 +1 @@
-{"version":3,"file":"map-helpers.d.ts","sourceRoot":"","sources":["../src/map-helpers.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,eAAO,MAAM,OAAO;QAAoB,MAAM;;;CAM7C,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"}
+{"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

@@ -7,6 +7,7 @@ export const byIdMap = (ts) => {
         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.

package/dist/map-helpers.js.map

@@ -1 +1 @@
-{"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;AACd,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"}
+{"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/string-mapping.d.ts

@@ -1,6 +1,24 @@
+/**
+ * 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 declare const concatenator: (separator: string) => StringsMapper;
+/**
+ * @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 declare const lastOf: StringsMapper;
+/**
+ * @return a {@link StringsMapper function} that chains the given {@link StringsMapper functions} (at least 1),
+ * in thar order.
+ * (This is straightforward functional composition.)
+ */
 export declare const chain: (stringsMapper: StringsMapper, ...stringMappers: StringMapper[]) => StringsMapper;
 //# sourceMappingURL=string-mapping.d.ts.map

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,MAAM,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,KAAK,MAAM,CAAA;AAE5D,MAAM,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,CAAA;AAGlD,eAAO,MAAM,YAAY,cAAe,MAAM,KAAG,aACN,CAAA;AAE3C,eAAO,MAAM,MAAM,EAAE,aAC0B,CAAA;AAE/C,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,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"}

package/dist/string-mapping.js

@@ -1,5 +1,17 @@
+/**
+ * @return a {@link StringsMapper function} that concatenates the strings passed into it, using the given separator string.
+ */
 export const concatenator = (separator) => (...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 = (...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, ...stringMappers) => (...strings) => {
     let result = stringsMapper(...strings);
     stringMappers.forEach((mapper) => {

package/dist/string-mapping.js.map

@@ -1 +1 @@
-{"version":3,"file":"string-mapping.js","sourceRoot":"","sources":["../src/string-mapping.ts"],"names":[],"mappings":"AAKA,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,SAAiB,EAAiB,EAAE,CAC7D,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;AAE3C,MAAM,CAAC,MAAM,MAAM,GACf,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAE/C,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,aAA4B,EAAE,GAAG,aAA6B,EAAiB,EAAE,CACnG,CAAC,GAAG,OAAiB,EAAE,EAAE;IACrB,IAAI,MAAM,GAAG,aAAa,CAAC,GAAG,OAAO,CAAC,CAAA;IACtC,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;QAC7B,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAC3B,CAAC,CAAC,CAAA;IACF,OAAO,MAAM,CAAA;AACjB,CAAC,CAAA"}
+{"version":3,"file":"string-mapping.js","sourceRoot":"","sources":["../src/string-mapping.ts"],"names":[],"mappings":"AAWA;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,SAAiB,EAAiB,EAAE,CAC7D,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;AAE3C;;;GAGG;AACH,MAAM,CAAC,MAAM,MAAM,GACf,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAE/C;;;;GAIG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,aAA4B,EAAE,GAAG,aAA6B,EAAiB,EAAE,CACnG,CAAC,GAAG,OAAiB,EAAE,EAAE;IACrB,IAAI,MAAM,GAAG,aAAa,CAAC,GAAG,OAAO,CAAC,CAAA;IACtC,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;QAC7B,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAC3B,CAAC,CAAC,CAAA;IACF,OAAO,MAAM,CAAA;AACjB,CAAC,CAAA"}

package/dist/string-sorting.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Various functional utilities for sorting things.
+ */
+export declare const sortByStringKey: <T>(ts: T[], keyFunc: (t: T) => string) => T[];
+export type StringSorter = (strings: string[]) => string[];
+export declare const sortedStrings: StringSorter;
+export declare const sortedStringsByUppercase: StringSorter;
+//# sourceMappingURL=string-sorting.d.ts.map

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

@@ -0,0 +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"}

package/dist/string-sorting.js

@@ -0,0 +1,13 @@
+/**
+ * Various functional utilities for sorting things.
+ */
+const stringCompare = (l, r) => l === r ? 0 : (l > r ? 1 : -1);
+const stringyCompare = (keyFunc) => (l, r) => stringCompare(keyFunc(l), keyFunc(r));
+export const sortByStringKey = (ts, keyFunc) => [...ts].sort(stringyCompare(keyFunc));
+const sortedStringsWith = (strMap) => (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());
+//# sourceMappingURL=string-sorting.js.map

package/dist/string-sorting.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"string-sorting.js","sourceRoot":"","sources":["../src/string-sorting.ts"],"names":[],"mappings":"AAAA;;GAEG;AAKH,MAAM,aAAa,GAAqB,CAAC,CAAC,EAAE,CAAC,EAAU,EAAE,CACrD,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAElC,MAAM,cAAc,GAAG,CAAI,OAAyB,EAAe,EAAE,CACjE,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;AAEzD,MAAM,CAAC,MAAM,eAAe,GAAG,CAAI,EAAO,EAAE,OAAyB,EAAE,EAAE,CACrE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAA;AAKzC,MAAM,iBAAiB,GAAG,CAAC,MAA+B,EAAgB,EAAE,CACxE,CAAC,OAAO,EAAE,EAAE;IACR,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1D,OAAO,OAAO,CAAA;AAClB,CAAC,CAAA;AAEL,MAAM,CAAC,MAAM,aAAa,GAAG,iBAAiB,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;AAE5D,MAAM,CAAC,MAAM,wBAAwB,GAAG,iBAAiB,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAA"}

package/dist/toposort.d.ts

@@ -0,0 +1,6 @@
+/**
+ * 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[];
+//# sourceMappingURL=toposort.d.ts.map

package/dist/toposort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"toposort.d.ts","sourceRoot":"","sources":["../src/toposort.ts"],"names":[],"mappings":"AAiBA;;;GAGG;AACH,eAAO,MAAM,iBAAiB,gEA0B7B,CAAA"}

package/dist/toposort.js

@@ -0,0 +1,41 @@
+// 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 = (vertices, edgesOf) => {
+    const ordered = [];
+    const visit = (current, chain) => {
+        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);
+        if (hasCycle) {
+            console.dir(ordered);
+        }
+        return hasCycle;
+    };
+    const hasCycle = vertices.some((vertex) => visit(vertex, []));
+    return hasCycle ? false : ordered;
+};
+//# sourceMappingURL=toposort.js.map

package/dist/toposort.js.map

@@ -0,0 +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"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lionweb/ts-utils",
-  "version": "0.6.13-beta.5",
+  "version": "0.7.0-alpha.2",
   "description": "Utilities for LionWeb JSON",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",
@@ -15,13 +15,15 @@
     "url": "https://github.com/LionWeb-io/lionweb-typescript/issues"
   },
   "scripts": {
-    "clean": "rm -rf dist/ lionweb-ts-utils-*.tgz",
+    "clean": "rm -rf dist/ node_modules/ lionweb-ts-utils-*.tgz",
     "build": "tsc",
     "lint": "eslint src",
-    "pre-release-either": "npm run clean && npm install && npm run build",
-    "prerelease": "npm run pre-release-either",
-    "release": "npm publish",
-    "prerelease-beta": "npm run pre-release-either",
-    "release-beta": "npm publish --tag beta"
+    "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/dist/sorting.d.ts

@@ -1,7 +0,0 @@
-/**
- * Various functional utilities for sorting things.
- */
-export type Comparer<T> = (l: T, r: T) => number;
-export declare const stringyCompare: <T>(keyFunc: (t: T) => string) => Comparer<T>;
-export declare const sortByStringKey: <T>(ts: T[], keyFunc: (t: T) => string) => T[];
-//# sourceMappingURL=sorting.d.ts.map

package/dist/sorting.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorting.d.ts","sourceRoot":"","sources":["../src/sorting.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAA;AAKhD,eAAO,MAAM,cAAc,yBAA0B,MAAM,gBACF,CAAA;AAEzD,eAAO,MAAM,eAAe,kCAAmC,MAAM,QAC5B,CAAA"}

package/dist/sorting.js

@@ -1,7 +0,0 @@
-/**
- * Various functional utilities for sorting things.
- */
-const stringCompare = (l, r) => l === r ? 0 : (l > r ? 1 : -1);
-export const stringyCompare = (keyFunc) => (l, r) => stringCompare(keyFunc(l), keyFunc(r));
-export const sortByStringKey = (ts, keyFunc) => [...ts].sort(stringyCompare(keyFunc));
-//# sourceMappingURL=sorting.js.map

package/dist/sorting.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorting.js","sourceRoot":"","sources":["../src/sorting.ts"],"names":[],"mappings":"AAAA;;GAEG;AAKH,MAAM,aAAa,GAAqB,CAAC,CAAC,EAAE,CAAC,EAAU,EAAE,CACrD,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAElC,MAAM,CAAC,MAAM,cAAc,GAAG,CAAI,OAAyB,EAAe,EAAE,CACxE,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;AAEzD,MAAM,CAAC,MAAM,eAAe,GAAG,CAAI,EAAO,EAAE,OAAyB,EAAE,EAAE,CACrE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAA"}