arkanalyzer 1.0.19 → 1.0.20

package/lib/core/dataflow/GenericDataFlow.js

@@ -0,0 +1,109 @@
+"use strict";
+/*
+ * Copyright (c) 2025 Huawei Device Co., Ltd.
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MFPDataFlowSolver = exports.Solution = void 0;
+/**
+ * Represents the result of a data flow analysis.
+ * Contains the in and out sets for each node, as well as the corresponding data flow problem.
+ *
+ * @template Node - The type of nodes in the graph.
+ * @template V - The type of data flow values.
+ */
+class Solution {
+    constructor(i, out, problem) {
+        this.in = i;
+        this.out = out;
+        this.problem = problem;
+    }
+}
+exports.Solution = Solution;
+/**
+ * A solver for data flow analysis problems.
+ * Implements forward and backward data flow analysis using a worklist algorithm.
+ * The solver computes the Maximum Fixed Point (MFP) solution, which is a safe
+ * over-approximation of the ideal Meet-Over-All-Paths (MOP) solution.
+ */
+class MFPDataFlowSolver {
+    /**
+     * Computes the MFP solution for a forward data flow analysis problem.
+     *
+     * @template Node - The type of nodes in the graph.
+     * @template V - The type of data flow values.
+     * @param problem - The data flow problem to solve.
+     * @returns The solution containing the in and out sets for all nodes.
+     */
+    calculateMopSolutionForwards(problem) {
+        let _out = problem.initOut;
+        let _in = problem.initIn;
+        let workList = problem.flowGraph.nodesInPostOrder;
+        let newEntries = new Set();
+        while (workList.length > 0) {
+            newEntries.clear();
+            workList.forEach((n) => {
+                let inSet;
+                const predecessors = problem.flowGraph.pred(n);
+                if (predecessors && predecessors.length > 0) {
+                    const predecessorOuts = predecessors.map((pred) => _out.get(pred));
+                    inSet = predecessorOuts.reduce((acc, cur) => problem.meet(acc, cur), problem.empty);
+                }
+                else {
+                    inSet = problem.empty;
+                }
+                _in.set(n, inSet);
+                let old = _out.get(n);
+                let newSet = problem.transferFunction.apply(n, inSet);
+                if (!old || old.count() === 0 || !old.equals(newSet)) {
+                    _out.set(n, newSet);
+                    problem.flowGraph.succ(n).forEach((succ) => newEntries.add(succ));
+                }
+            });
+            workList = [...newEntries];
+        }
+        return new Solution(_in, _out, problem);
+    }
+    /**
+     * Computes the MFP solution for a backward data flow analysis problem.
+     *
+     * @template Node - The type of nodes in the graph.
+     * @template V - The type of data flow values.
+     * @param problem - The data flow problem to solve.
+     * @returns The solution containing the in and out sets for all nodes.
+     */
+    calculateMopSolutionBackwards(problem) {
+        let _out = problem.initOut;
+        let _in = problem.initIn;
+        let workList = problem.flowGraph.nodesInPostOrder;
+        let newEntries = new Set();
+        while (workList.length > 0) {
+            newEntries.clear();
+            workList.forEach((n) => {
+                let outSet = problem.flowGraph.succ(n).reduce((acc, curr) => {
+                    return problem.meet(acc, _in.get(curr));
+                }, problem.empty);
+                _out.set(n, outSet);
+                let old = _in.get(n);
+                let newSet = problem.transferFunction.apply(n, outSet);
+                if (!old || !old.equals(newSet)) {
+                    _in.set(n, newSet);
+                    problem.flowGraph.pred(n).forEach((pred) => newEntries.add(pred));
+                }
+            });
+            workList = [...newEntries];
+        }
+        return new Solution(_in, _out, problem);
+    }
+}
+exports.MFPDataFlowSolver = MFPDataFlowSolver;

package/lib/core/dataflow/ReachingDef.d.ts

@@ -0,0 +1,63 @@
+/**
+ * Reaching Definitions Data Flow Analysis
+ *
+ * This module implements the Reaching Definitions data flow analysis algorithm.
+ * Reaching Definitions is a forward data flow analysis that determines, for each
+ * program point, the set of variable definitions (assignments) that may reach
+ * that point without being overwritten.
+ *
+ * Key Components:
+ * 1. **Transfer Function**:
+ *    - Computes the out set for each node based on its in set.
+ *    - Uses gen and kill sets to model the effects of assignments:
+ *      - **gen**: The set of definitions generated by the current node.
+ *      - **kill**: The set of definitions killed (overwritten) by the current node.
+ *
+ * 2. **Meet Operation**:
+ *    - Combines data flow values from multiple paths (e.g., union for reaching definitions).
+ *    - Ensures that the analysis is conservative (safe) by over-approximating the result.
+ *
+ *  The analysis is forward, meaning it propagates information from predecessors to successors.
+ *
+ */
+import { Stmt } from '../base/Stmt';
+import { BaseImplicitGraph, NodeID } from '../graph/BaseImplicitGraph';
+import { ArkMethod } from '../model/ArkMethod';
+import { DataFlowProblem, TransferFunction, FlowGraph } from './GenericDataFlow';
+import { SparseBitVector } from '../../utils/SparseBitVector';
+type RDNode = Stmt;
+type DFNodeCollection = SparseBitVector;
+export declare class ReachingDefProblem implements DataFlowProblem<NodeID, DFNodeCollection> {
+    flowGraph: ReachingDefFlowGraph;
+    transferFunction: ReachingDefTransferFunction;
+    meet: (a: DFNodeCollection, b: DFNodeCollection) => DFNodeCollection;
+    initIn: Map<NodeID, DFNodeCollection>;
+    initOut: Map<NodeID, DFNodeCollection>;
+    forward: boolean;
+    empty: DFNodeCollection;
+    constructor(method: ArkMethod, forward?: boolean);
+}
+/**
+ * Represents the control flow graph (CFG) for reaching definitions analysis.
+ * This class implements the FlowGraph interface and provides methods to retrieve
+ * successors and predecessors of nodes, as well as topological orderings of nodes.
+ */
+declare class ReachingDefFlowGraph extends BaseImplicitGraph<RDNode> implements FlowGraph<NodeID> {
+    nodesInPostOrder: NodeID[];
+    constructor(method: ArkMethod);
+    getGraphName(): string;
+    dumpNodes(): void;
+    private initSuccPred;
+}
+/**
+ * Represents the transfer function for reaching definitions analysis.
+ */
+export declare class ReachingDefTransferFunction implements TransferFunction<NodeID, DFNodeCollection> {
+    gen: DFNodeCollection;
+    kill: Map<NodeID, DFNodeCollection>;
+    constructor(flowGraph: ReachingDefFlowGraph);
+    apply(n: NodeID, x: DFNodeCollection): DFNodeCollection;
+    private initGenKill;
+}
+export {};
+//# sourceMappingURL=ReachingDef.d.ts.map

package/lib/core/dataflow/ReachingDef.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReachingDef.d.ts","sourceRoot":"","sources":["../../../src/core/dataflow/ReachingDef.ts"],"names":[],"mappings":"AAeA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAiB,IAAI,EAAE,MAAM,cAAc,CAAC;AAEnD,OAAO,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AACvE,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AACjF,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAG9D,KAAK,MAAM,GAAG,IAAI,CAAC;AACnB,KAAK,gBAAgB,GAAG,eAAe,CAAC;AAIxC,qBAAa,kBAAmB,YAAW,eAAe,CAAC,MAAM,EAAE,gBAAgB,CAAC;IAChF,SAAS,EAAE,oBAAoB,CAAC;IAChC,gBAAgB,EAAE,2BAA2B,CAAC;IAC9C,IAAI,EAAE,CAAC,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,gBAAgB,KAAK,gBAAgB,CAAC;IACrE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACtC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACvC,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,gBAAgB,CAAuB;gBAElC,MAAM,EAAE,SAAS,EAAE,OAAO,GAAE,OAAc;CAYzD;AAED;;;;GAIG;AACH,cAAM,oBAAqB,SAAQ,iBAAiB,CAAC,MAAM,CAAE,YAAW,SAAS,CAAC,MAAM,CAAC;IACrF,gBAAgB,EAAE,MAAM,EAAE,CAAC;gBAEf,MAAM,EAAE,SAAS;IAc7B,YAAY,IAAI,MAAM;IAItB,SAAS,IAAI,IAAI;IAIjB,OAAO,CAAC,YAAY;CAyCvB;AAED;;GAEG;AACH,qBAAa,2BAA4B,YAAW,gBAAgB,CAAC,MAAM,EAAE,gBAAgB,CAAC;IAC1F,GAAG,EAAE,gBAAgB,CAAC;IACtB,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;gBAExB,SAAS,EAAE,oBAAoB;IAM3C,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,gBAAgB,GAAG,gBAAgB;IAevD,OAAO,CAAC,WAAW;CAsBtB"}

package/lib/core/dataflow/ReachingDef.js

@@ -0,0 +1,168 @@
+"use strict";
+/*
+ * Copyright (c) 2025 Huawei Device Co., Ltd.
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ReachingDefTransferFunction = exports.ReachingDefProblem = void 0;
+/**
+ * Reaching Definitions Data Flow Analysis
+ *
+ * This module implements the Reaching Definitions data flow analysis algorithm.
+ * Reaching Definitions is a forward data flow analysis that determines, for each
+ * program point, the set of variable definitions (assignments) that may reach
+ * that point without being overwritten.
+ *
+ * Key Components:
+ * 1. **Transfer Function**:
+ *    - Computes the out set for each node based on its in set.
+ *    - Uses gen and kill sets to model the effects of assignments:
+ *      - **gen**: The set of definitions generated by the current node.
+ *      - **kill**: The set of definitions killed (overwritten) by the current node.
+ *
+ * 2. **Meet Operation**:
+ *    - Combines data flow values from multiple paths (e.g., union for reaching definitions).
+ *    - Ensures that the analysis is conservative (safe) by over-approximating the result.
+ *
+ *  The analysis is forward, meaning it propagates information from predecessors to successors.
+ *
+ */
+const Stmt_1 = require("../base/Stmt");
+const BaseImplicitGraph_1 = require("../graph/BaseImplicitGraph");
+const SparseBitVector_1 = require("../../utils/SparseBitVector");
+let coCtor = SparseBitVector_1.SparseBitVector;
+const BV_SIZE = 32;
+class ReachingDefProblem {
+    constructor(method, forward = true) {
+        this.empty = new coCtor(BV_SIZE);
+        this.flowGraph = new ReachingDefFlowGraph(method);
+        this.transferFunction = new ReachingDefTransferFunction(this.flowGraph);
+        this.meet = (x, y) => {
+            let r = x.clone();
+            r.unionWith(y);
+            return r;
+        };
+        this.initIn = new Map(this.flowGraph.nodesInPostOrder.map((i) => [i, new coCtor(BV_SIZE)]));
+        this.initOut = new Map(this.flowGraph.nodesInPostOrder.map((i) => [i, new coCtor(BV_SIZE)]));
+        this.forward = forward;
+    }
+}
+exports.ReachingDefProblem = ReachingDefProblem;
+/**
+ * Represents the control flow graph (CFG) for reaching definitions analysis.
+ * This class implements the FlowGraph interface and provides methods to retrieve
+ * successors and predecessors of nodes, as well as topological orderings of nodes.
+ */
+class ReachingDefFlowGraph extends BaseImplicitGraph_1.BaseImplicitGraph {
+    constructor(method) {
+        super();
+        const cfg = method.getCfg();
+        if (!cfg) {
+            throw new Error('CFG not found');
+        }
+        const nodes = cfg.getStmts();
+        this.nodeToIdMap = new Map(nodes.map((x, i) => [x, i]));
+        this.nodesInPostOrder = nodes.map((_, i) => i);
+        this.initSuccPred(nodes, cfg);
+    }
+    getGraphName() {
+        return 'Reaching Definition Flow Graph';
+    }
+    dumpNodes() {
+        var _a;
+        (_a = this.nodeToIdMap) === null || _a === void 0 ? void 0 : _a.forEach((id, node) => console.log(id + ': ' + node.toString()));
+    }
+    initSuccPred(nodes, cfg) {
+        this.succMap = new Map();
+        this.predMap = new Map();
+        cfg.getBlocks().forEach((bb) => {
+            let stmts = bb.getStmts();
+            if (stmts.length === 0) {
+                return;
+            }
+            for (let i = 0; i < stmts.length - 1; i++) {
+                let c = this.nodeToIdMap.get(stmts[i]);
+                let n = this.nodeToIdMap.get(stmts[i + 1]);
+                this.succMap.set(c, [n]);
+                this.predMap.set(n, [c]);
+            }
+            let terminate = bb.getTail();
+            if (!terminate) {
+                throw new Error('cfg has no terminal');
+            }
+            bb.getSuccessors().forEach((succBB) => {
+                var _a, _b, _c, _d;
+                let head = succBB.getHead();
+                if (!head) {
+                    return;
+                }
+                let t = (_a = this.nodeToIdMap) === null || _a === void 0 ? void 0 : _a.get(terminate);
+                let h = (_b = this.nodeToIdMap) === null || _b === void 0 ? void 0 : _b.get(head);
+                // Terminate's succ
+                let succ = (_c = this.succMap.get(t)) !== null && _c !== void 0 ? _c : [];
+                succ.push(h);
+                this.succMap.set(t, succ);
+                // Head's pred
+                let pred = (_d = this.predMap.get(h)) !== null && _d !== void 0 ? _d : [];
+                pred.push(t);
+                this.predMap.set(h, pred);
+            });
+        });
+    }
+}
+/**
+ * Represents the transfer function for reaching definitions analysis.
+ */
+class ReachingDefTransferFunction {
+    constructor(flowGraph) {
+        this.gen = new coCtor(BV_SIZE);
+        this.kill = new Map();
+        this.initGenKill(flowGraph);
+    }
+    apply(n, x) {
+        const result = x.clone();
+        if (this.gen.test(n)) {
+            result.set(n);
+        }
+        const killSet = this.kill.get(n);
+        if (killSet) {
+            for (const item of killSet) {
+                result.reset(item);
+            }
+        }
+        return result;
+    }
+    initGenKill(g) {
+        let genValue2Nodes = new Map();
+        // Init Gen
+        g.getNodeToIdMap().forEach((id, node) => {
+            var _a;
+            if (node instanceof Stmt_1.ArkAssignStmt) {
+                let lop = node.getLeftOp();
+                let genNodes = (_a = genValue2Nodes.get(lop)) !== null && _a !== void 0 ? _a : new coCtor(BV_SIZE);
+                genNodes.set(id);
+                genValue2Nodes.set(lop, genNodes);
+                this.gen.set(id);
+            }
+        });
+        // Init Kill
+        genValue2Nodes.forEach((defNodes, v) => {
+            for (const i of defNodes) {
+                const killSet = defNodes.clone();
+                killSet.reset(i);
+                this.kill.set(i, killSet);
+            }
+        });
+    }
+}
+exports.ReachingDefTransferFunction = ReachingDefTransferFunction;

package/lib/core/graph/BaseExplicitGraph.d.ts

@@ -1,10 +1,5 @@
-export type NodeID = number;
-export type Kind = number;
-export interface GraphTraits {
-    nodesItor(): IterableIterator<BaseNode>;
-    getGraphName(): string;
-    getNode(id: NodeID): BaseNode | undefined;
-}
+import { Kind, NodeID, GraphTraits } from './GraphTraits';
+export { Kind, NodeID };
 export declare abstract class BaseEdge {
     private src;
     private dst;
@@ -44,7 +39,7 @@ export declare abstract class BaseNode {
     getDotAttr(): string;
     abstract getDotLabel(): string;
 }
-export declare abstract class BaseExplicitGraph implements GraphTraits {
+export declare abstract class BaseExplicitGraph implements GraphTraits<BaseNode> {
     protected edgeNum: number;
     protected nodeNum: number;
     protected idToNodeMap: Map<NodeID, BaseNode>;

package/lib/core/graph/BaseExplicitGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BaseExplicitGraph.d.ts","sourceRoot":"","sources":["../../../src/core/graph/BaseExplicitGraph.ts"],"names":[],"mappings":"AAeA,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC;AAC5B,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAE1B,MAAM,WAAW,WAAW;IACxB,SAAS,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACxC,YAAY,IAAI,MAAM,CAAC;IACvB,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS,CAAC;CAC7C;AACD,8BAAsB,QAAQ;IAC1B,OAAO,CAAC,GAAG,CAAW;IACtB,OAAO,CAAC,GAAG,CAAW;IACtB,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC;gBAET,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI;IAMtC,QAAQ,IAAI,MAAM;IAIlB,QAAQ,IAAI,MAAM;IAIlB,UAAU,IAAI,QAAQ;IAItB,UAAU,IAAI,QAAQ;IAItB,OAAO,IAAI,IAAI;IAIf,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAIzB,YAAY,IAAI;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE;IAO5C,UAAU,IAAI,MAAM;CAG9B;AAED,8BAAsB,QAAQ;IAC1B,OAAO,CAAC,EAAE,CAAS;IACnB,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC;IACrB,OAAO,CAAC,OAAO,CAA4B;IAC3C,OAAO,CAAC,QAAQ,CAA4B;gBAEhC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI;IAKxB,KAAK,IAAI,MAAM;IAIf,OAAO,IAAI,IAAI;IAIf,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAIzB,gBAAgB,IAAI,OAAO;IAI3B,gBAAgB,IAAI,OAAO;IAI3B,eAAe,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAIrC,eAAe,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAIrC,eAAe,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI;IAIlC,eAAe,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI;IAIlC,kBAAkB,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAIxC,kBAAkB,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAIxC,eAAe,IAAI,GAAG,CAAC,QAAQ,CAAC;IAIhC,gBAAgB,IAAI,GAAG,CAAC,QAAQ,CAAC;IAIjC,UAAU,IAAI,MAAM;aAIX,WAAW,IAAI,MAAM;CACxC;AAED,8BAAsB,iBAAkB,YAAW,WAAW;IAC1D,SAAS,CAAC,OAAO,EAAE,MAAM,CAAK;IAC9B,SAAS,CAAC,OAAO,EAAE,MAAM,CAAK;IAC9B,SAAS,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC7C,SAAS,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;;IAO5B,UAAU,IAAI,MAAM;IAIpB,SAAS,IAAI,gBAAgB,CAAC,QAAQ,CAAC;IAIvC,OAAO,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI;IAK1B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAQzC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQ/B,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,GAAG,OAAO;IAU9C,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAUvC,YAAY,IAAI,gBAAgB,CAAC,QAAQ,CAAC;aAIjC,YAAY,IAAI,MAAM;CACzC"}
+{"version":3,"file":"BaseExplicitGraph.d.ts","sourceRoot":"","sources":["../../../src/core/graph/BaseExplicitGraph.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE1D,OAAO,EAAC,IAAI,EAAE,MAAM,EAAC,CAAC;AACtB,8BAAsB,QAAQ;IAC1B,OAAO,CAAC,GAAG,CAAW;IACtB,OAAO,CAAC,GAAG,CAAW;IACtB,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC;gBAET,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI;IAMtC,QAAQ,IAAI,MAAM;IAIlB,QAAQ,IAAI,MAAM;IAIlB,UAAU,IAAI,QAAQ;IAItB,UAAU,IAAI,QAAQ;IAItB,OAAO,IAAI,IAAI;IAIf,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAIzB,YAAY,IAAI;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE;IAO5C,UAAU,IAAI,MAAM;CAG9B;AAED,8BAAsB,QAAQ;IAC1B,OAAO,CAAC,EAAE,CAAS;IACnB,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC;IACrB,OAAO,CAAC,OAAO,CAA4B;IAC3C,OAAO,CAAC,QAAQ,CAA4B;gBAEhC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI;IAKxB,KAAK,IAAI,MAAM;IAIf,OAAO,IAAI,IAAI;IAIf,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAIzB,gBAAgB,IAAI,OAAO;IAI3B,gBAAgB,IAAI,OAAO;IAI3B,eAAe,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAIrC,eAAe,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAIrC,eAAe,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI;IAIlC,eAAe,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI;IAIlC,kBAAkB,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAIxC,kBAAkB,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAIxC,eAAe,IAAI,GAAG,CAAC,QAAQ,CAAC;IAIhC,gBAAgB,IAAI,GAAG,CAAC,QAAQ,CAAC;IAIjC,UAAU,IAAI,MAAM;aAIX,WAAW,IAAI,MAAM;CACxC;AAED,8BAAsB,iBAAkB,YAAW,WAAW,CAAC,QAAQ,CAAC;IACpE,SAAS,CAAC,OAAO,EAAE,MAAM,CAAK;IAC9B,SAAS,CAAC,OAAO,EAAE,MAAM,CAAK;IAC9B,SAAS,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC7C,SAAS,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;;IAO5B,UAAU,IAAI,MAAM;IAIpB,SAAS,IAAI,gBAAgB,CAAC,QAAQ,CAAC;IAIvC,OAAO,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI;IAK1B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAQzC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQ/B,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,GAAG,OAAO;IAU9C,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAUvC,YAAY,IAAI,gBAAgB,CAAC,QAAQ,CAAC;aAIjC,YAAY,IAAI,MAAM;CACzC"}

package/lib/core/graph/BaseImplicitGraph.d.ts

@@ -0,0 +1,78 @@
+import { NodeID, GraphTraits } from './GraphTraits';
+export { NodeID };
+/**
+ * BaseImplicitGraph is an abstract class that represents an implicit graph.
+ * An implicit graph is a graph representation where node and edge information is implicitly stored using maps.
+ * This class implements the GraphTraits<Node> interface and provides basic graph operations.
+ */
+export declare abstract class BaseImplicitGraph<Node> implements GraphTraits<Node> {
+    /**
+     * idToNodeMap is an optional map that maps node IDs (NodeID) to node objects (Node).
+     * If not initialized, calling related methods will throw an error.
+     */
+    protected idToNodeMap?: Map<NodeID, Node>;
+    /**
+     * nodeToIdMap is a map that maps node objects (Node) to node IDs (NodeID).
+     * This map must be initialized in the subclass.
+     */
+    protected nodeToIdMap: Map<Node, NodeID>;
+    /**
+     * succMap is a map that stores the successors of each node.
+     * The key is a node ID (NodeID), and the value is an array of successor node IDs.
+     */
+    succMap: Map<NodeID, NodeID[]>;
+    /**
+     * predMap is a map that stores the predecessors of each node.
+     * The key is a node ID (NodeID), and the value is an array of predecessor node IDs.
+     */
+    predMap: Map<NodeID, NodeID[]>;
+    constructor();
+    /**
+     * Gets the number of nodes in the graph.
+     * @returns The number of nodes in the graph.
+     */
+    getNodeNum(): number;
+    /**
+     * Returns an iterator for all nodes in the graph.
+     * @returns An iterator for traversing all nodes in the graph.
+     */
+    nodesItor(): IterableIterator<Node>;
+    /**
+     * Gets the node object corresponding to a given node ID.
+     * @param id The node ID.
+     * @returns The corresponding node object.
+     * @throws Throws an error if idToNodeMap is not initialized or if the node is not found.
+     */
+    getNode(id: NodeID): Node;
+    /**
+     * Checks whether the graph contains a specific node ID.
+     * @param id The node ID.
+     * @returns Returns true if the node ID exists in the graph; otherwise, returns false.
+     * @throws Throws an error if idToNodeMap is not initialized.
+     */
+    hasNode(id: NodeID): boolean;
+    /**
+     * Gets the list of successor node IDs for a given node.
+     * @param id The node ID.
+     * @returns An array of successor node IDs. Returns an empty array if no successors are found.
+     */
+    succ(id: NodeID): NodeID[];
+    /**
+     * Gets the list of predecessor node IDs for a given node.
+     * @param id The node ID.
+     * @returns An array of predecessor node IDs. Returns an empty array if no predecessors are found.
+     */
+    pred(id: NodeID): NodeID[];
+    /**
+     * Gets the nodeToIdMap, which maps node objects to node IDs.
+     * @returns The nodeToIdMap.
+     */
+    getNodeToIdMap(): Map<Node, NodeID>;
+    /**
+     * Abstract method to get the name of the graph.
+     * Subclasses must implement this method.
+     * @returns The name of the graph.
+     */
+    abstract getGraphName(): string;
+}
+//# sourceMappingURL=BaseImplicitGraph.d.ts.map

package/lib/core/graph/BaseImplicitGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BaseImplicitGraph.d.ts","sourceRoot":"","sources":["../../../src/core/graph/BaseImplicitGraph.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAEpD,OAAO,EAAE,MAAM,EAAE,CAAC;AAElB;;;;GAIG;AACH,8BAAsB,iBAAiB,CAAC,IAAI,CAAE,YAAW,WAAW,CAAC,IAAI,CAAC;IACtE;;;OAGG;IACH,SAAS,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAE1C;;;OAGG;IACH,SAAS,CAAC,WAAW,EAAG,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAE1C;;;OAGG;IACH,OAAO,EAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAEhC;;;OAGG;IACH,OAAO,EAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;;IAIhC;;;OAGG;IACI,UAAU,IAAI,MAAM;IAI3B;;;OAGG;IACI,SAAS,IAAI,gBAAgB,CAAC,IAAI,CAAC;IAI1C;;;;;OAKG;IACI,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAYhC;;;;;OAKG;IACI,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQnC;;;;OAIG;IACI,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAIjC;;;;OAIG;IACI,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAIjC;;;OAGG;IACI,cAAc,IAAI,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC;IAI1C;;;;OAIG;aACa,YAAY,IAAI,MAAM;CACzC"}

package/lib/core/graph/BaseImplicitGraph.js

@@ -0,0 +1,78 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BaseImplicitGraph = void 0;
+/**
+ * BaseImplicitGraph is an abstract class that represents an implicit graph.
+ * An implicit graph is a graph representation where node and edge information is implicitly stored using maps.
+ * This class implements the GraphTraits<Node> interface and provides basic graph operations.
+ */
+class BaseImplicitGraph {
+    constructor() { }
+    /**
+     * Gets the number of nodes in the graph.
+     * @returns The number of nodes in the graph.
+     */
+    getNodeNum() {
+        return this.nodeToIdMap.size;
+    }
+    /**
+     * Returns an iterator for all nodes in the graph.
+     * @returns An iterator for traversing all nodes in the graph.
+     */
+    nodesItor() {
+        return this.nodeToIdMap.keys();
+    }
+    /**
+     * Gets the node object corresponding to a given node ID.
+     * @param id The node ID.
+     * @returns The corresponding node object.
+     * @throws Throws an error if idToNodeMap is not initialized or if the node is not found.
+     */
+    getNode(id) {
+        if (!this.idToNodeMap) {
+            throw new Error(`initialize this.idToNodeMap first`);
+        }
+        if (!this.idToNodeMap.has(id)) {
+            throw new Error(`Can find Node # ${id}`);
+        }
+        return this.idToNodeMap.get(id);
+    }
+    /**
+     * Checks whether the graph contains a specific node ID.
+     * @param id The node ID.
+     * @returns Returns true if the node ID exists in the graph; otherwise, returns false.
+     * @throws Throws an error if idToNodeMap is not initialized.
+     */
+    hasNode(id) {
+        if (!this.idToNodeMap) {
+            throw new Error(`initialize this.idToNodeMap first`);
+        }
+        return this.idToNodeMap.has(id);
+    }
+    /**
+     * Gets the list of successor node IDs for a given node.
+     * @param id The node ID.
+     * @returns An array of successor node IDs. Returns an empty array if no successors are found.
+     */
+    succ(id) {
+        var _a;
+        return (_a = this.succMap.get(id)) !== null && _a !== void 0 ? _a : [];
+    }
+    /**
+     * Gets the list of predecessor node IDs for a given node.
+     * @param id The node ID.
+     * @returns An array of predecessor node IDs. Returns an empty array if no predecessors are found.
+     */
+    pred(id) {
+        var _a;
+        return (_a = this.predMap.get(id)) !== null && _a !== void 0 ? _a : [];
+    }
+    /**
+     * Gets the nodeToIdMap, which maps node objects to node IDs.
+     * @returns The nodeToIdMap.
+     */
+    getNodeToIdMap() {
+        return this.nodeToIdMap;
+    }
+}
+exports.BaseImplicitGraph = BaseImplicitGraph;

package/lib/core/graph/GraphTraits.d.ts

@@ -0,0 +1,8 @@
+export type NodeID = number;
+export type Kind = number;
+export interface GraphTraits<Node> {
+    nodesItor(): IterableIterator<Node>;
+    getGraphName(): string;
+    getNode(id: NodeID): Node | undefined;
+}
+//# sourceMappingURL=GraphTraits.d.ts.map

package/lib/core/graph/GraphTraits.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphTraits.d.ts","sourceRoot":"","sources":["../../../src/core/graph/GraphTraits.ts"],"names":[],"mappings":"AAeA,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC;AAC5B,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAE1B,MAAM,WAAW,WAAW,CAAC,IAAI;IAC7B,SAAS,IAAI,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACpC,YAAY,IAAI,MAAM,CAAC;IACvB,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC;CACzC"}

package/lib/core/graph/GraphTraits.js

@@ -0,0 +1,16 @@
+"use strict";
+/*
+ * Copyright (c) 2024 Huawei Device Co., Ltd.
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });

package/lib/core/graph/Scc.d.ts

@@ -1,4 +1,5 @@
-import { NodeID, GraphTraits } from './BaseExplicitGraph';
+import { BaseNode } from './BaseExplicitGraph';
+import { NodeID, GraphTraits } from './GraphTraits';
 type NodeSet = Set<NodeID>;
 type NodeStack = NodeID[];
 type Node2RepSCCInfoMap = Map<NodeID, NodeSCCInfo>;
@@ -21,7 +22,7 @@ declare class NodeSCCInfo {
  *   Wave Propagation and Deep Propagation for pointer Analysis
  *   CGO 2009
  */
-export declare class SCCDetection<Graph extends GraphTraits> {
+export declare class SCCDetection<Graph extends GraphTraits<BaseNode>> {
     private _G;
     private _I;
     private _D;

package/lib/core/graph/Scc.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Scc.d.ts","sourceRoot":"","sources":["../../../src/core/graph/Scc.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,MAAM,EAAY,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAEpE,KAAK,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;AAC3B,KAAK,SAAS,GAAG,MAAM,EAAE,CAAC;AAC1B,KAAK,kBAAkB,GAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAGnD;;GAEG;AACH,cAAM,WAAW;IACb,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,SAAS,CAAU;;IAO3B,IAAI,GAAG,IAAI,MAAM,CAEhB;IAED,IAAI,GAAG,CAAC,CAAC,EAAE,MAAM,EAEhB;IAED,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAI5B,IAAI,QAAQ,IAAI,OAAO,CAEtB;CACJ;AAED;;;;;;GAMG;AACH,qBAAa,YAAY,CAAC,KAAK,SAAS,WAAW;IAE/C,OAAO,CAAC,EAAE,CAAQ;IAElB,OAAO,CAAC,EAAE,CAAS;IAInB,OAAO,CAAC,EAAE,CAAe;IAGzB,OAAO,CAAC,EAAE,CAAqB;IAG/B,OAAO,CAAC,EAAE,CAAY;IAKtB,OAAO,CAAC,EAAE,CAAY;IACtB,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,YAAY,CAAc;IAClC,OAAO,CAAC,UAAU,CAAc;gBAEpB,EAAE,EAAE,KAAK;IAYrB,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,KAAK;IAIb,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,QAAQ;IAIhB,OAAO,CAAC,MAAM;IAoBd,OAAO,CAAC,MAAM;IASd,OAAO,CAAC,OAAO;IAQf,OAAO,CAAC,KAAK;IA0Cb,OAAO,CAAC,KAAK;IAWb;;;OAGG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IASpC;;OAEG;IACI,IAAI,IAAI,IAAI;IAWZ,4BAA4B,IAAI,SAAS;IAIzC,kBAAkB,IAAI,kBAAkB;IAKxC,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAiBjC,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAMjC,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAc/B,WAAW,IAAI,OAAO;CAGhC"}
+{"version":3,"file":"Scc.d.ts","sourceRoot":"","sources":["../../../src/core/graph/Scc.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAEpD,KAAK,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;AAC3B,KAAK,SAAS,GAAG,MAAM,EAAE,CAAC;AAC1B,KAAK,kBAAkB,GAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAGnD;;GAEG;AACH,cAAM,WAAW;IACb,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,SAAS,CAAU;;IAO3B,IAAI,GAAG,IAAI,MAAM,CAEhB;IAED,IAAI,GAAG,CAAC,CAAC,EAAE,MAAM,EAEhB;IAED,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAI5B,IAAI,QAAQ,IAAI,OAAO,CAEtB;CACJ;AAED;;;;;;GAMG;AACH,qBAAa,YAAY,CAAC,KAAK,SAAS,WAAW,CAAC,QAAQ,CAAC;IAEzD,OAAO,CAAC,EAAE,CAAQ;IAElB,OAAO,CAAC,EAAE,CAAS;IAInB,OAAO,CAAC,EAAE,CAAe;IAGzB,OAAO,CAAC,EAAE,CAAqB;IAG/B,OAAO,CAAC,EAAE,CAAY;IAKtB,OAAO,CAAC,EAAE,CAAY;IACtB,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,YAAY,CAAc;IAClC,OAAO,CAAC,UAAU,CAAc;gBAEpB,EAAE,EAAE,KAAK;IAYrB,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,KAAK;IAIb,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,QAAQ;IAIhB,OAAO,CAAC,MAAM;IAoBd,OAAO,CAAC,MAAM;IASd,OAAO,CAAC,OAAO;IAQf,OAAO,CAAC,KAAK;IA0Cb,OAAO,CAAC,KAAK;IAWb;;;OAGG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IASpC;;OAEG;IACI,IAAI,IAAI,IAAI;IAWZ,4BAA4B,IAAI,SAAS;IAIzC,kBAAkB,IAAI,kBAAkB;IAKxC,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAiBjC,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAMjC,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAc/B,WAAW,IAAI,OAAO;CAGhC"}

package/lib/core/graph/Scc.js

@@ -106,7 +106,7 @@ class SCCDetection {
         this.setRep(v, v);
         this.setVisited(v);
         let node = this.getNode(v);
-        node.getOutgoingEdges().forEach(e => {
+        node.getOutgoingEdges().forEach((e) => {
             let w = e.getDstID();
             if (!this.isVisited(w)) {
                 this.visit(w);

package/lib/index.d.ts

@@ -44,7 +44,7 @@ export { Cfg } from './core/graph/Cfg';
 export { ViewTree, ViewTreeNode } from './core/graph/ViewTree';
 export { DominanceFinder } from './core/graph/DominanceFinder';
 export { DominanceTree } from './core/graph/DominanceTree';
-export { NodeID, Kind, GraphTraits, BaseEdge, BaseNode, BaseExplicitGraph } from './core/graph/BaseExplicitGraph';
+export { NodeID, Kind, BaseEdge, BaseNode, BaseExplicitGraph } from './core/graph/BaseExplicitGraph';
 export { SCCDetection } from './core/graph/Scc';
 export { ArkFile } from './core/model/ArkFile';
 export { ArkNamespace } from './core/model/ArkNamespace';

package/lib/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,gBAAgB,EAAE,MAAM,wCAAwC,CAAC;AAC1E,OAAO,EAAE,sBAAsB,EAAE,MAAM,8CAA8C,CAAC;AACtF,OAAO,EAAE,iBAAiB,EAAE,MAAM,yCAAyC,CAAC;AAG5E,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,+BAA+B,CAAC;AAGzE,cAAc,6BAA6B,CAAC;AAC5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,4CAA4C,CAAC;AAG9E,OAAO,EAAE,wBAAwB,EAAE,MAAM,qCAAqC,CAAC;AAC/E,OAAO,EAAE,gBAAgB,EAAE,MAAM,8CAA8C,CAAC;AAChF,cAAc,iCAAiC,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,wCAAwC,CAAC;AAC9E,OAAO,EAAE,eAAe,EAAE,MAAM,6CAA6C,CAAC;AAC9E,OAAO,EAAE,qBAAqB,EAAE,MAAM,mDAAmD,CAAC;AAC1F,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,mCAAmC,CAAC;AAGvE,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACrE,cAAc,iBAAiB,CAAC;AAChC,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAG1C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,cAAc,qBAAqB,CAAC;AACpC,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,cAAc,wBAAwB,CAAC;AACvC,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,cAAc,uBAAuB,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,4BAA4B,CAAC;AAGjE,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAChF,OAAO,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAC;AAC5C,OAAO,EAAE,wBAAwB,EAAE,uBAAuB,EAAE,MAAM,mCAAmC,CAAC;AAGtG,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,EAAE,GAAG,EAAE,MAAM,kBAAkB,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAC/D,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC3D,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,gCAAgC,CAAC;AAClH,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAGhD,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,0CAA0C,CAAC;AAEzD,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAGhC,OAAO,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,mBAAmB,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAC3G,OAAO,EAAE,YAAY,IAAI,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AACjF,OAAO,EAAE,WAAW,IAAI,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC9E,OAAO,EAAE,eAAe,IAAI,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAC1F,OAAO,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAGzD,cAAc,4CAA4C,CAAC;AAG3D,cAAc,wBAAwB,CAAC;AACvC,cAAc,0BAA0B,CAAC;AACzC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC;AACrC,cAAc,sBAAsB,CAAC;AAGrC,OAAO,EAAE,MAAM,iBAAiB,CAAC;AACjC,OAAO,EAAE,EAAE,EAAE,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,gBAAgB,EAAE,MAAM,wCAAwC,CAAC;AAC1E,OAAO,EAAE,sBAAsB,EAAE,MAAM,8CAA8C,CAAC;AACtF,OAAO,EAAE,iBAAiB,EAAE,MAAM,yCAAyC,CAAC;AAG5E,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,+BAA+B,CAAC;AAGzE,cAAc,6BAA6B,CAAC;AAC5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,4CAA4C,CAAC;AAG9E,OAAO,EAAE,wBAAwB,EAAE,MAAM,qCAAqC,CAAC;AAC/E,OAAO,EAAE,gBAAgB,EAAE,MAAM,8CAA8C,CAAC;AAChF,cAAc,iCAAiC,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,wCAAwC,CAAC;AAC9E,OAAO,EAAE,eAAe,EAAE,MAAM,6CAA6C,CAAC;AAC9E,OAAO,EAAE,qBAAqB,EAAE,MAAM,mDAAmD,CAAC;AAC1F,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,mCAAmC,CAAC;AAGvE,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACrE,cAAc,iBAAiB,CAAC;AAChC,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAG1C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,cAAc,qBAAqB,CAAC;AACpC,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,cAAc,wBAAwB,CAAC;AACvC,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,cAAc,uBAAuB,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,4BAA4B,CAAC;AAGjE,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAChF,OAAO,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAC;AAC5C,OAAO,EAAE,wBAAwB,EAAE,uBAAuB,EAAE,MAAM,mCAAmC,CAAC;AAGtG,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,EAAE,GAAG,EAAE,MAAM,kBAAkB,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAC/D,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC3D,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,gCAAgC,CAAC;AACrG,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAGhD,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,0CAA0C,CAAC;AAEzD,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAGhC,OAAO,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,mBAAmB,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAC3G,OAAO,EAAE,YAAY,IAAI,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AACjF,OAAO,EAAE,WAAW,IAAI,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC9E,OAAO,EAAE,eAAe,IAAI,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAC1F,OAAO,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAGzD,cAAc,4CAA4C,CAAC;AAG3D,cAAc,wBAAwB,CAAC;AACvC,cAAc,0BAA0B,CAAC;AACzC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC;AACrC,cAAc,sBAAsB,CAAC;AAGrC,OAAO,EAAE,MAAM,iBAAiB,CAAC;AACjC,OAAO,EAAE,EAAE,EAAE,CAAC"}

package/lib/save/GraphPrinter.d.ts

@@ -1,6 +1,7 @@
-import { BaseEdge, GraphTraits, NodeID } from "../core/graph/BaseExplicitGraph";
-import { Printer } from "./Printer";
-export declare class GraphPrinter<GraphType extends GraphTraits> extends Printer {
+import { BaseEdge, BaseNode, NodeID } from '../core/graph/BaseExplicitGraph';
+import { GraphTraits } from '../core/graph/GraphTraits';
+import { Printer } from './Printer';
+export declare class GraphPrinter<GraphType extends GraphTraits<BaseNode>> extends Printer {
     graph: GraphType;
     title: string;
     startID: NodeID | undefined;

package/lib/save/GraphPrinter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GraphPrinter.d.ts","sourceRoot":"","sources":["../../src/save/GraphPrinter.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,QAAQ,EAAY,WAAW,EAAE,MAAM,EAAE,MAAM,iCAAiC,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AA+CpC,qBAAa,YAAY,CAAC,SAAS,SAAS,WAAW,CAAE,SAAQ,OAAO;IACpE,KAAK,EAAE,SAAS,CAAC;IACjB,KAAK,EAAG,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,GAAG,SAAS,CAAa;gBAE5B,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM;IAQ7B,UAAU,CAAC,CAAC,EAAE,MAAM;IAIpB,IAAI,IAAI,MAAM;IAMd,UAAU,IAAI,IAAI;IAMlB,UAAU,IAAI,IAAI;IAmClB,SAAS,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI;IAQ/B,WAAW,IAAI,IAAI;IAanB,WAAW,IAAI,IAAI;CAG7B"}
+{"version":3,"file":"GraphPrinter.d.ts","sourceRoot":"","sources":["../../src/save/GraphPrinter.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,iCAAiC,CAAC;AAC7E,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AA+CpC,qBAAa,YAAY,CAAC,SAAS,SAAS,WAAW,CAAC,QAAQ,CAAC,CAAE,SAAQ,OAAO;IAC9E,KAAK,EAAE,SAAS,CAAC;IACjB,KAAK,EAAG,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,GAAG,SAAS,CAAa;gBAE5B,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM;IAQ7B,UAAU,CAAC,CAAC,EAAE,MAAM;IAIpB,IAAI,IAAI,MAAM;IAMd,UAAU,IAAI,IAAI;IAMlB,UAAU,IAAI,IAAI;IAmClB,SAAS,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI;IAQ/B,WAAW,IAAI,IAAI;IAanB,WAAW,IAAI,IAAI;CAG7B"}