arkanalyzer 1.0.19 → 1.0.21

package/lib/core/dataflow/Util.js

@@ -1,64 +1,64 @@
-"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 });
-exports.RefEqual = exports.LocalEqual = exports.getRecallMethodInParam = exports.INTERNAL_SINK_METHOD = exports.INTERNAL_PARAMETER_SOURCE = void 0;
-const Type_1 = require("../base/Type");
-const Ref_1 = require("../base/Ref");
-exports.INTERNAL_PARAMETER_SOURCE = [
-    '@ohos.app.ability.Want.d.ts: Want'
-];
-exports.INTERNAL_SINK_METHOD = [
-    'console.<@%unk/%unk: .log()>',
-    'console.<@%unk/%unk: .error()>',
-    'console.<@%unk/%unk: .info()>',
-    'console.<@%unk/%unk: .warn()>',
-    'console.<@%unk/%unk: .assert()>'
-];
-function getRecallMethodInParam(stmt) {
-    var _a;
-    for (const param of stmt.getInvokeExpr().getArgs()) {
-        if (param.getType() instanceof Type_1.FunctionType) {
-            const methodSignature = param.getType().getMethodSignature();
-            const method = (_a = stmt.getCfg()) === null || _a === void 0 ? void 0 : _a.getDeclaringMethod().getDeclaringArkClass().getMethod(methodSignature);
-            if (method) {
-                return method;
-            }
-        }
-    }
-    return null;
-}
-exports.getRecallMethodInParam = getRecallMethodInParam;
-function LocalEqual(local1, local2) {
-    var _a, _b, _c, _d;
-    if (local1.getName() === 'this' && local2.getName() === 'this') {
-        return true;
-    }
-    const method1 = (_b = (_a = local1.getDeclaringStmt()) === null || _a === void 0 ? void 0 : _a.getCfg()) === null || _b === void 0 ? void 0 : _b.getDeclaringMethod();
-    const method2 = (_d = (_c = local2.getDeclaringStmt()) === null || _c === void 0 ? void 0 : _c.getCfg()) === null || _d === void 0 ? void 0 : _d.getDeclaringMethod();
-    const nameEqual = local1.getName() === local2.getName();
-    return method1 === method2 && nameEqual;
-}
-exports.LocalEqual = LocalEqual;
-function RefEqual(ref1, ref2) {
-    if (ref1 instanceof Ref_1.ArkStaticFieldRef && ref2 instanceof Ref_1.ArkStaticFieldRef) {
-        return ref1.getFieldSignature().toString() === ref2.getFieldSignature().toString();
-    }
-    else if (ref1 instanceof Ref_1.ArkInstanceFieldRef && ref2 instanceof Ref_1.ArkInstanceFieldRef) {
-        return LocalEqual(ref1.getBase(), ref2.getBase()) && ref1.getFieldSignature().toString() === ref2.getFieldSignature().toString();
-    }
-    return false;
-}
-exports.RefEqual = RefEqual;
+"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 });
+exports.RefEqual = exports.LocalEqual = exports.getRecallMethodInParam = exports.INTERNAL_SINK_METHOD = exports.INTERNAL_PARAMETER_SOURCE = void 0;
+const Type_1 = require("../base/Type");
+const Ref_1 = require("../base/Ref");
+exports.INTERNAL_PARAMETER_SOURCE = [
+    '@ohos.app.ability.Want.d.ts: Want'
+];
+exports.INTERNAL_SINK_METHOD = [
+    'console.<@%unk/%unk: .log()>',
+    'console.<@%unk/%unk: .error()>',
+    'console.<@%unk/%unk: .info()>',
+    'console.<@%unk/%unk: .warn()>',
+    'console.<@%unk/%unk: .assert()>'
+];
+function getRecallMethodInParam(stmt) {
+    var _a;
+    for (const param of stmt.getInvokeExpr().getArgs()) {
+        if (param.getType() instanceof Type_1.FunctionType) {
+            const methodSignature = param.getType().getMethodSignature();
+            const method = (_a = stmt.getCfg()) === null || _a === void 0 ? void 0 : _a.getDeclaringMethod().getDeclaringArkClass().getMethod(methodSignature);
+            if (method) {
+                return method;
+            }
+        }
+    }
+    return null;
+}
+exports.getRecallMethodInParam = getRecallMethodInParam;
+function LocalEqual(local1, local2) {
+    var _a, _b, _c, _d;
+    if (local1.getName() === 'this' && local2.getName() === 'this') {
+        return true;
+    }
+    const method1 = (_b = (_a = local1.getDeclaringStmt()) === null || _a === void 0 ? void 0 : _a.getCfg()) === null || _b === void 0 ? void 0 : _b.getDeclaringMethod();
+    const method2 = (_d = (_c = local2.getDeclaringStmt()) === null || _c === void 0 ? void 0 : _c.getCfg()) === null || _d === void 0 ? void 0 : _d.getDeclaringMethod();
+    const nameEqual = local1.getName() === local2.getName();
+    return method1 === method2 && nameEqual;
+}
+exports.LocalEqual = LocalEqual;
+function RefEqual(ref1, ref2) {
+    if (ref1 instanceof Ref_1.ArkStaticFieldRef && ref2 instanceof Ref_1.ArkStaticFieldRef) {
+        return ref1.getFieldSignature().toString() === ref2.getFieldSignature().toString();
+    }
+    else if (ref1 instanceof Ref_1.ArkInstanceFieldRef && ref2 instanceof Ref_1.ArkInstanceFieldRef) {
+        return LocalEqual(ref1.getBase(), ref2.getBase()) && ref1.getFieldSignature().toString() === ref2.getFieldSignature().toString();
+    }
+    return false;
+}
+exports.RefEqual = RefEqual;

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

@@ -1,64 +1,59 @@
-export type NodeID = number;
-export type Kind = number;
-export interface GraphTraits {
-    nodesItor(): IterableIterator<BaseNode>;
-    getGraphName(): string;
-    getNode(id: NodeID): BaseNode | undefined;
-}
-export declare abstract class BaseEdge {
-    private src;
-    private dst;
-    protected kind: Kind;
-    constructor(s: BaseNode, d: BaseNode, k: Kind);
-    getSrcID(): NodeID;
-    getDstID(): NodeID;
-    getSrcNode(): BaseNode;
-    getDstNode(): BaseNode;
-    getKind(): Kind;
-    setKind(kind: Kind): void;
-    getEndPoints(): {
-        src: NodeID;
-        dst: NodeID;
-    };
-    getDotAttr(): string;
-}
-export declare abstract class BaseNode {
-    private id;
-    protected kind: Kind;
-    private inEdges;
-    private outEdges;
-    constructor(id: NodeID, k: Kind);
-    getID(): NodeID;
-    getKind(): Kind;
-    setKind(kind: Kind): void;
-    hasIncomingEdges(): boolean;
-    hasOutgoingEdges(): boolean;
-    hasIncomingEdge(e: BaseEdge): boolean;
-    hasOutgoingEdge(e: BaseEdge): boolean;
-    addIncomingEdge(e: BaseEdge): void;
-    addOutgoingEdge(e: BaseEdge): void;
-    removeIncomingEdge(e: BaseEdge): boolean;
-    removeOutgoingEdge(e: BaseEdge): boolean;
-    getIncomingEdge(): Set<BaseEdge>;
-    getOutgoingEdges(): Set<BaseEdge>;
-    getDotAttr(): string;
-    abstract getDotLabel(): string;
-}
-export declare abstract class BaseExplicitGraph implements GraphTraits {
-    protected edgeNum: number;
-    protected nodeNum: number;
-    protected idToNodeMap: Map<NodeID, BaseNode>;
-    protected edgeMarkSet: Set<string>;
-    constructor();
-    getNodeNum(): number;
-    nodesItor(): IterableIterator<BaseNode>;
-    addNode(n: BaseNode): void;
-    getNode(id: NodeID): BaseNode | undefined;
-    hasNode(id: NodeID): boolean;
-    removeNode(id: NodeID): boolean;
-    hasEdge(src: BaseNode, dst: BaseNode): boolean;
-    ifEdgeExisting(edge: BaseEdge): boolean;
-    getNodesIter(): IterableIterator<BaseNode>;
-    abstract getGraphName(): string;
-}
+import { Kind, NodeID, GraphTraits } from './GraphTraits';
+export { Kind, NodeID };
+export declare abstract class BaseEdge {
+    private src;
+    private dst;
+    protected kind: Kind;
+    constructor(s: BaseNode, d: BaseNode, k: Kind);
+    getSrcID(): NodeID;
+    getDstID(): NodeID;
+    getSrcNode(): BaseNode;
+    getDstNode(): BaseNode;
+    getKind(): Kind;
+    setKind(kind: Kind): void;
+    getEndPoints(): {
+        src: NodeID;
+        dst: NodeID;
+    };
+    getDotAttr(): string;
+}
+export declare abstract class BaseNode {
+    private id;
+    protected kind: Kind;
+    private inEdges;
+    private outEdges;
+    constructor(id: NodeID, k: Kind);
+    getID(): NodeID;
+    getKind(): Kind;
+    setKind(kind: Kind): void;
+    hasIncomingEdges(): boolean;
+    hasOutgoingEdges(): boolean;
+    hasIncomingEdge(e: BaseEdge): boolean;
+    hasOutgoingEdge(e: BaseEdge): boolean;
+    addIncomingEdge(e: BaseEdge): void;
+    addOutgoingEdge(e: BaseEdge): void;
+    removeIncomingEdge(e: BaseEdge): boolean;
+    removeOutgoingEdge(e: BaseEdge): boolean;
+    getIncomingEdge(): Set<BaseEdge>;
+    getOutgoingEdges(): Set<BaseEdge>;
+    getDotAttr(): string;
+    abstract getDotLabel(): string;
+}
+export declare abstract class BaseExplicitGraph implements GraphTraits<BaseNode> {
+    protected edgeNum: number;
+    protected nodeNum: number;
+    protected idToNodeMap: Map<NodeID, BaseNode>;
+    protected edgeMarkSet: Set<string>;
+    constructor();
+    getNodeNum(): number;
+    nodesItor(): IterableIterator<BaseNode>;
+    addNode(n: BaseNode): void;
+    getNode(id: NodeID): BaseNode | undefined;
+    hasNode(id: NodeID): boolean;
+    removeNode(id: NodeID): boolean;
+    hasEdge(src: BaseNode, dst: BaseNode): boolean;
+    ifEdgeExisting(edge: BaseEdge): boolean;
+    getNodesIter(): IterableIterator<BaseNode>;
+    abstract getGraphName(): string;
+}
 //# sourceMappingURL=BaseExplicitGraph.d.ts.map

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/BaseExplicitGraph.js

@@ -1,157 +1,157 @@
-"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 });
-exports.BaseExplicitGraph = exports.BaseNode = exports.BaseEdge = void 0;
-class BaseEdge {
-    constructor(s, d, k) {
-        this.src = s;
-        this.dst = d;
-        this.kind = k;
-    }
-    getSrcID() {
-        return this.src.getID();
-    }
-    getDstID() {
-        return this.dst.getID();
-    }
-    getSrcNode() {
-        return this.src;
-    }
-    getDstNode() {
-        return this.dst;
-    }
-    getKind() {
-        return this.kind;
-    }
-    setKind(kind) {
-        this.kind = kind;
-    }
-    getEndPoints() {
-        return {
-            src: this.src.getID(),
-            dst: this.dst.getID(),
-        };
-    }
-    getDotAttr() {
-        return 'color=black';
-    }
-}
-exports.BaseEdge = BaseEdge;
-class BaseNode {
-    constructor(id, k) {
-        this.inEdges = new Set();
-        this.outEdges = new Set();
-        this.id = id;
-        this.kind = k;
-    }
-    getID() {
-        return this.id;
-    }
-    getKind() {
-        return this.kind;
-    }
-    setKind(kind) {
-        this.kind = kind;
-    }
-    hasIncomingEdges() {
-        return this.inEdges.size !== 0;
-    }
-    hasOutgoingEdges() {
-        return this.outEdges.size === 0;
-    }
-    hasIncomingEdge(e) {
-        return this.inEdges.has(e);
-    }
-    hasOutgoingEdge(e) {
-        return this.outEdges.has(e);
-    }
-    addIncomingEdge(e) {
-        this.inEdges.add(e);
-    }
-    addOutgoingEdge(e) {
-        this.outEdges.add(e);
-    }
-    removeIncomingEdge(e) {
-        return this.inEdges.delete(e);
-    }
-    removeOutgoingEdge(e) {
-        return this.outEdges.delete(e);
-    }
-    getIncomingEdge() {
-        return this.inEdges;
-    }
-    getOutgoingEdges() {
-        return this.outEdges;
-    }
-    getDotAttr() {
-        return 'shape=box';
-    }
-}
-exports.BaseNode = BaseNode;
-class BaseExplicitGraph {
-    constructor() {
-        this.edgeNum = 0;
-        this.nodeNum = 0;
-        this.idToNodeMap = new Map();
-        this.edgeMarkSet = new Set();
-    }
-    getNodeNum() {
-        return this.nodeNum;
-    }
-    nodesItor() {
-        return this.idToNodeMap.values();
-    }
-    addNode(n) {
-        this.idToNodeMap.set(n.getID(), n);
-        this.nodeNum++;
-    }
-    getNode(id) {
-        if (!this.idToNodeMap.has(id)) {
-            throw new Error(`Can find Node # ${id}`);
-        }
-        return this.idToNodeMap.get(id);
-    }
-    hasNode(id) {
-        return this.idToNodeMap.has(id);
-    }
-    removeNode(id) {
-        if (this.idToNodeMap.delete(id)) {
-            this.nodeNum--;
-            return true;
-        }
-        return false;
-    }
-    hasEdge(src, dst) {
-        for (let e of src.getOutgoingEdges()) {
-            if (e.getDstNode() === dst) {
-                return true;
-            }
-        }
-        return false;
-    }
-    ifEdgeExisting(edge) {
-        let edgeMark = `${edge.getSrcID()}-${edge.getDstID()}:${edge.getKind()}`;
-        if (this.edgeMarkSet.has(edgeMark)) {
-            return true;
-        }
-        this.edgeMarkSet.add(edgeMark);
-        return false;
-    }
-    getNodesIter() {
-        return this.idToNodeMap.values();
-    }
-}
-exports.BaseExplicitGraph = BaseExplicitGraph;
+"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 });
+exports.BaseExplicitGraph = exports.BaseNode = exports.BaseEdge = void 0;
+class BaseEdge {
+    constructor(s, d, k) {
+        this.src = s;
+        this.dst = d;
+        this.kind = k;
+    }
+    getSrcID() {
+        return this.src.getID();
+    }
+    getDstID() {
+        return this.dst.getID();
+    }
+    getSrcNode() {
+        return this.src;
+    }
+    getDstNode() {
+        return this.dst;
+    }
+    getKind() {
+        return this.kind;
+    }
+    setKind(kind) {
+        this.kind = kind;
+    }
+    getEndPoints() {
+        return {
+            src: this.src.getID(),
+            dst: this.dst.getID(),
+        };
+    }
+    getDotAttr() {
+        return 'color=black';
+    }
+}
+exports.BaseEdge = BaseEdge;
+class BaseNode {
+    constructor(id, k) {
+        this.inEdges = new Set();
+        this.outEdges = new Set();
+        this.id = id;
+        this.kind = k;
+    }
+    getID() {
+        return this.id;
+    }
+    getKind() {
+        return this.kind;
+    }
+    setKind(kind) {
+        this.kind = kind;
+    }
+    hasIncomingEdges() {
+        return this.inEdges.size !== 0;
+    }
+    hasOutgoingEdges() {
+        return this.outEdges.size === 0;
+    }
+    hasIncomingEdge(e) {
+        return this.inEdges.has(e);
+    }
+    hasOutgoingEdge(e) {
+        return this.outEdges.has(e);
+    }
+    addIncomingEdge(e) {
+        this.inEdges.add(e);
+    }
+    addOutgoingEdge(e) {
+        this.outEdges.add(e);
+    }
+    removeIncomingEdge(e) {
+        return this.inEdges.delete(e);
+    }
+    removeOutgoingEdge(e) {
+        return this.outEdges.delete(e);
+    }
+    getIncomingEdge() {
+        return this.inEdges;
+    }
+    getOutgoingEdges() {
+        return this.outEdges;
+    }
+    getDotAttr() {
+        return 'shape=box';
+    }
+}
+exports.BaseNode = BaseNode;
+class BaseExplicitGraph {
+    constructor() {
+        this.edgeNum = 0;
+        this.nodeNum = 0;
+        this.idToNodeMap = new Map();
+        this.edgeMarkSet = new Set();
+    }
+    getNodeNum() {
+        return this.nodeNum;
+    }
+    nodesItor() {
+        return this.idToNodeMap.values();
+    }
+    addNode(n) {
+        this.idToNodeMap.set(n.getID(), n);
+        this.nodeNum++;
+    }
+    getNode(id) {
+        if (!this.idToNodeMap.has(id)) {
+            throw new Error(`Can find Node # ${id}`);
+        }
+        return this.idToNodeMap.get(id);
+    }
+    hasNode(id) {
+        return this.idToNodeMap.has(id);
+    }
+    removeNode(id) {
+        if (this.idToNodeMap.delete(id)) {
+            this.nodeNum--;
+            return true;
+        }
+        return false;
+    }
+    hasEdge(src, dst) {
+        for (let e of src.getOutgoingEdges()) {
+            if (e.getDstNode() === dst) {
+                return true;
+            }
+        }
+        return false;
+    }
+    ifEdgeExisting(edge) {
+        let edgeMark = `${edge.getSrcID()}-${edge.getDstID()}:${edge.getKind()}`;
+        if (this.edgeMarkSet.has(edgeMark)) {
+            return true;
+        }
+        this.edgeMarkSet.add(edgeMark);
+        return false;
+    }
+    getNodesIter() {
+        return this.idToNodeMap.values();
+    }
+}
+exports.BaseExplicitGraph = BaseExplicitGraph;

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"}