@lionweb/class-core-generator 0.6.13-beta.7 → 0.7.0-alpha.2

package/dist/utils/toposort.js

@@ -1,41 +0,0 @@
-// 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/utils/toposort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"toposort.js","sourceRoot":"","sources":["../../src/utils/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/src/api/helpers/mps-annotations.ts

@@ -1,69 +0,0 @@
-// 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
-
-import {Id, SerializationChunk} from "@lionweb/core"
-
-
-export abstract class MpsAnnotation {
-    constructor(public readonly annotatedNodeId: Id) {
-    }
-}
-
-export class ConceptDescription extends MpsAnnotation {
-    constructor(annotatedNodeId: Id, public readonly shortDescription: string | null, public readonly alias: string | null) {
-        super(annotatedNodeId)
-    }
-    toString() {
-        return `<ConceptDescription> annotatedNodeId=${this.annotatedNodeId}, shortDescription="${this.shortDescription}"`
-    }
-}
-
-export class Deprecated extends MpsAnnotation {
-    constructor(annotatedNodeId: Id, public readonly comment: string | null, public readonly build: string | null) {
-        super(annotatedNodeId)
-    }
-    toString() {
-        return `<Deprecated> annotatedNodeId=${this.annotatedNodeId}, comment="${this.comment}", build="${this.build}"`
-    }
-}
-
-
-export const extractedMpsAnnotations = ({nodes}: SerializationChunk): MpsAnnotation[] =>
-    nodes.flatMap<MpsAnnotation>(({classifier, properties, parent}) => {
-        const propertyValue = (key: string): string | null => {
-            const property = properties.find(({property}) => property.key === key)
-            return property === undefined
-                ? null
-                : property.value
-        }
-        if (classifier.language !== "io-lionweb-mps-specific" || classifier.version !== "0") {
-            return []
-        }
-        switch (classifier.key) {
-            case "ConceptDescription": {
-                return [new ConceptDescription(parent!, propertyValue("ConceptDescription-conceptShortDescription"), propertyValue("ConceptDescription-conceptAlias"))]
-            }
-            case "Deprecated": {
-                return [new Deprecated(parent!, propertyValue("Deprecated-comment"), propertyValue("Deprecated-build"))]
-            }
-            default: {
-                console.log(`couldn't handle MPS annotation with key ${classifier.key}`)
-                return []
-            }
-        }
-    })
-

package/src/utils/string-sorting.ts

@@ -1,29 +0,0 @@
-// 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
-
-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/utils/toposort.ts

@@ -1,49 +0,0 @@
-// 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)
-        if (hasCycle) {
-            console.dir(ordered)
-        }
-        return hasCycle
-    }
-
-    const hasCycle = vertices.some(
-        (vertex) => visit(vertex, [])
-    )
-
-    return hasCycle ? false : ordered
-}
-