arkanalyzer 1.0.80 → 1.0.82

package/lib/core/model/builder/ArkMethodBuilder.js

@@ -1,6 +1,6 @@
 "use strict";
 /*
- * Copyright (c) 2024-2025 Huawei Device Co., Ltd.
+ * Copyright (c) 2024-2026 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
@@ -167,10 +167,10 @@ function buildMethodName(node, declaringClass, sourceFile, declaringMethod) {
         name = Const_1.CALL_SIGNATURE_NAME;
     }
     else if (ohos_typescript_1.default.isGetAccessor(node) && ohos_typescript_1.default.isIdentifier(node.name)) {
-        name = 'Get-' + node.name.text;
+        name = Const_1.GETTER_PREFIX + node.name.text;
     }
     else if (ohos_typescript_1.default.isSetAccessor(node) && ohos_typescript_1.default.isIdentifier(node.name)) {
-        name = 'Set-' + node.name.text;
+        name = Const_1.SETTER_PREFIX + node.name.text;
     }
     else if (ohos_typescript_1.default.isArrowFunction(node)) {
         name = buildAnonymousMethodName(node, declaringClass);

package/lib/index.d.ts

@@ -79,6 +79,9 @@ export * from './utils/pathTransfer';
 export * from './utils/AstTreeUtils';
 export { LOG_LEVEL, LOG_MODULE_TYPE } from './utils/logger';
 export { default as Logger } from './utils/logger';
+export { IntMap } from './utils/IntMap';
+export { IntWorkList } from './utils/IntWorkList';
+export { PackedSparseMap } from './utils/PackedSparseMap';
 import ts from 'ohos-typescript';
 export { ts };
 //# sourceMappingURL=index.d.ts.map

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,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;AAEvE,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAClC,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAGxD,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,yBAAyB,CAAC;AACtD,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;AACrC,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,EAAE,OAAO,IAAI,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAGnD,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,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;AAEvE,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAClC,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAGxD,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,yBAAyB,CAAC;AACtD,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;AACrC,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,EAAE,OAAO,IAAI,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxC,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAG1D,OAAO,EAAE,MAAM,iBAAiB,CAAC;AACjC,OAAO,EAAE,EAAE,EAAE,CAAC"}

package/lib/index.js

@@ -32,7 +32,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ArkNamespace = exports.ArkFile = exports.SCCDetection = exports.BaseExplicitGraph = exports.BaseNode = exports.BaseEdge = exports.DominanceTree = exports.DominanceFinder = exports.Cfg = exports.BasicBlock = exports.UndefinedVariableSolver = exports.UndefinedVariableChecker = exports.Fact = exports.PathEdge = exports.PathEdgePoint = exports.DataflowSolver = exports.DataflowResult = exports.DataflowProblem = exports.Scope = exports.VisibleValue = exports.ValueUtil = exports.TypeInference = exports.StmtUseReplacer = exports.RefUseReplacer = exports.IRUtils = exports.ExprUseReplacer = exports.DummyMainCreater = exports.ModelUtils = exports.FullPosition = exports.LineColPosition = exports.Local = exports.DefUseChain = exports.Decorator = exports.Constant = exports.DVFGBuilder = exports.DVFG = exports.DiffPTData = exports.PtsSet = exports.PointerAnalysisConfig = exports.PointerAnalysis = exports.PagBuilder = exports.CSFuncID = exports.DummyCallCreator = exports.CallGraphBuilder = exports.CGStat = exports.PAGStat = exports.PTAStat = exports.RapidTypeAnalysis = exports.ClassHierarchyAnalysis = exports.AbstractAnalysis = void 0;
-exports.ts = exports.Logger = exports.LOG_MODULE_TYPE = exports.LOG_LEVEL = exports.ViewTreePrinter = exports.GraphPrinter = exports.JsonPrinter = exports.SourceFilePrinter = exports.SourceNamespacePrinter = exports.SourceClassPrinter = exports.SourceMethodPrinter = exports.DotFilePrinter = exports.DotNamespacePrinter = exports.DotClassPrinter = exports.DotMethodPrinter = exports.PrinterBuilder = exports.Printer = exports.Scene = exports.SceneConfig = exports.ArkBody = exports.ImportInfo = exports.ExportInfo = exports.ArkField = exports.ArkMethod = exports.ArkClass = void 0;
+exports.ts = exports.PackedSparseMap = exports.IntWorkList = exports.IntMap = exports.Logger = exports.LOG_MODULE_TYPE = exports.LOG_LEVEL = exports.ViewTreePrinter = exports.GraphPrinter = exports.JsonPrinter = exports.SourceFilePrinter = exports.SourceNamespacePrinter = exports.SourceClassPrinter = exports.SourceMethodPrinter = exports.DotFilePrinter = exports.DotNamespacePrinter = exports.DotClassPrinter = exports.DotMethodPrinter = exports.PrinterBuilder = exports.Printer = exports.Scene = exports.SceneConfig = exports.ArkBody = exports.ImportInfo = exports.ExportInfo = exports.ArkField = exports.ArkMethod = exports.ArkClass = void 0;
 // callgraph/algorithm
 var AbstractAnalysis_1 = require("./callgraph/algorithm/AbstractAnalysis");
 Object.defineProperty(exports, "AbstractAnalysis", { enumerable: true, get: function () { return AbstractAnalysis_1.AbstractAnalysis; } });
@@ -198,6 +198,12 @@ Object.defineProperty(exports, "LOG_LEVEL", { enumerable: true, get: function ()
 Object.defineProperty(exports, "LOG_MODULE_TYPE", { enumerable: true, get: function () { return logger_1.LOG_MODULE_TYPE; } });
 var logger_2 = require("./utils/logger");
 Object.defineProperty(exports, "Logger", { enumerable: true, get: function () { return __importDefault(logger_2).default; } });
+var IntMap_1 = require("./utils/IntMap");
+Object.defineProperty(exports, "IntMap", { enumerable: true, get: function () { return IntMap_1.IntMap; } });
+var IntWorkList_1 = require("./utils/IntWorkList");
+Object.defineProperty(exports, "IntWorkList", { enumerable: true, get: function () { return IntWorkList_1.IntWorkList; } });
+var PackedSparseMap_1 = require("./utils/PackedSparseMap");
+Object.defineProperty(exports, "PackedSparseMap", { enumerable: true, get: function () { return PackedSparseMap_1.PackedSparseMap; } });
 //ohos-typescript
 const ohos_typescript_1 = __importDefault(require("ohos-typescript"));
 exports.ts = ohos_typescript_1.default;

package/lib/save/base/BasePrinter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BasePrinter.d.ts","sourceRoot":"","sources":["../../../src/save/base/BasePrinter.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAEtD,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAGrC,MAAM,WAAW,IAAI;IACjB,OAAO,IAAI,MAAM,CAAC;IAClB,IAAI,IAAI,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,cAAc;IAC3B,MAAM,EAAE,OAAO,CAAC;IAChB,YAAY,EAAE,OAAO,CAAC;CACzB;AAGD,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,cAAc,GAAG,IAAI,CAE/D;AAED,8BAAsB,WAAY,SAAQ,OAAQ,YAAW,IAAI;gBAC1C,MAAM,EAAE,MAAM;IAGjC,QAAQ,CAAC,OAAO,IAAI,MAAM;IAE1B,SAAS,CAAC,cAAc,CAAC,SAAS,EAAE,SAAS,EAAE,GAAG,IAAI;IAMtD,SAAS,CAAC,aAAa,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,IAAI;IAOjE,SAAS,CAAC,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAKtD,SAAS,CAAC,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAajD,SAAS,CAAC,uBAAuB,CAAC,WAAW,EAAE,aAAa,GAAG,MAAM;WAUvD,iBAAiB,IAAI,cAAc;CAGpD"}
+{"version":3,"file":"BasePrinter.d.ts","sourceRoot":"","sources":["../../../src/save/base/BasePrinter.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAEtD,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAIrC,MAAM,WAAW,IAAI;IACjB,OAAO,IAAI,MAAM,CAAC;IAClB,IAAI,IAAI,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,cAAc;IAC3B,MAAM,EAAE,OAAO,CAAC;IAChB,YAAY,EAAE,OAAO,CAAC;CACzB;AAGD,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,cAAc,GAAG,IAAI,CAE/D;AAED,8BAAsB,WAAY,SAAQ,OAAQ,YAAW,IAAI;gBAC1C,MAAM,EAAE,MAAM;IAGjC,QAAQ,CAAC,OAAO,IAAI,MAAM;IAE1B,SAAS,CAAC,cAAc,CAAC,SAAS,EAAE,SAAS,EAAE,GAAG,IAAI;IAMtD,SAAS,CAAC,aAAa,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,IAAI;IAOjE,SAAS,CAAC,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAKtD,SAAS,CAAC,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAajD,SAAS,CAAC,uBAAuB,CAAC,WAAW,EAAE,aAAa,GAAG,MAAM;WAUvD,iBAAiB,IAAI,cAAc;CAGpD"}

package/lib/save/base/BasePrinter.js

@@ -1,6 +1,6 @@
 "use strict";
 /*
- * Copyright (c) 2025 Huawei Device Co., Ltd.
+ * Copyright (c) 2024-2026 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
@@ -19,6 +19,7 @@ const ArkBaseModel_1 = require("../../core/model/ArkBaseModel");
 const ArkClass_1 = require("../../core/model/ArkClass");
 const Printer_1 = require("../Printer");
 const PrinterUtils_1 = require("./PrinterUtils");
+const Const_1 = require("../../core/common/Const");
 let printerOptions = { pureTs: false, noMethodBody: false };
 function setPrinterOptions(options) {
     printerOptions = Object.assign(Object.assign({}, printerOptions), options);
@@ -47,11 +48,11 @@ class BasePrinter extends Printer_1.Printer {
         if (name === '_Constructor') {
             return 'constructor';
         }
-        if (name.startsWith('Get-')) {
-            return name.replace('Get-', 'get ');
+        if (name.startsWith(Const_1.GETTER_PREFIX)) {
+            return name.replace(Const_1.GETTER_PREFIX, 'get ');
         }
-        if (name.startsWith('Set-')) {
-            return name.replace('Set-', 'set ');
+        if (name.startsWith(Const_1.SETTER_PREFIX)) {
+            return name.replace(Const_1.SETTER_PREFIX, 'set ');
         }
         return name;
     }

package/lib/utils/IntMap.d.ts

@@ -0,0 +1,48 @@
+/**
+ * A memory-efficient Map-like structure where keys are integers and values are lists of integers.
+ * Uses a static linked list approach based on TypedArrays (SoA) to avoid JS object overhead.
+ *
+ * Memory per entry: 8 bytes (value + next pointer).
+ * Memory per key: 4 bytes (head pointer).
+ */
+export declare class IntMap {
+    private heads;
+    private values;
+    private nexts;
+    private count;
+    private capacity;
+    private keyRange;
+    /**
+     * @param keyRange - The maximum value of keys (nodeCapacity).
+     * @param initialCapacity - The initial total number of values across all keys.
+     */
+    constructor(keyRange: number, initialCapacity?: number);
+    /**
+     * Add a value to the list associated with the key.
+     */
+    add(key: number, value: number): void;
+    /**
+     * Check if the list for a key contains a value.
+     */
+    contains(key: number, value: number): boolean;
+    /**
+     * Add a value only if it doesn't already exist in the key's list.
+     */
+    addUnique(key: number, value: number): boolean;
+    /**
+     * Get an iterator for the values associated with a key.
+     * Efficient for loops: for (const v of map.getValues(key)) { ... }
+     */
+    getValues(key: number): IterableIterator<number>;
+    /**
+     * Get all values as an array (less efficient due to allocation).
+     */
+    getAsArray(key: number): number[];
+    /**
+     * Check if a key has any values.
+     */
+    has(key: number): boolean;
+    private resizeHeads;
+    private resizeCapacity;
+}
+//# sourceMappingURL=IntMap.d.ts.map

package/lib/utils/IntMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"IntMap.d.ts","sourceRoot":"","sources":["../../src/utils/IntMap.ts"],"names":[],"mappings":"AAeA;;;;;;GAMG;AACH,qBAAa,MAAM;IACf,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,QAAQ,CAAS;IAEzB;;;OAGG;gBACS,QAAQ,EAAE,MAAM,EAAE,eAAe,GAAE,MAAa;IAQ5D;;OAEG;IACI,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAe5C;;OAEG;IACI,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;IAcpD;;OAEG;IACI,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;IAQrD;;;OAGG;IACK,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC;IAWxD;;OAEG;IACI,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE;IAaxC;;OAEG;IACI,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAOhC,OAAO,CAAC,WAAW;IAOnB,OAAO,CAAC,cAAc;CAUzB"}

package/lib/utils/IntMap.js

@@ -0,0 +1,134 @@
+"use strict";
+/*
+ * Copyright (c) 2026 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.IntMap = void 0;
+/**
+ * A memory-efficient Map-like structure where keys are integers and values are lists of integers.
+ * Uses a static linked list approach based on TypedArrays (SoA) to avoid JS object overhead.
+ *
+ * Memory per entry: 8 bytes (value + next pointer).
+ * Memory per key: 4 bytes (head pointer).
+ */
+class IntMap {
+    /**
+     * @param keyRange - The maximum value of keys (nodeCapacity).
+     * @param initialCapacity - The initial total number of values across all keys.
+     */
+    constructor(keyRange, initialCapacity = 1024) {
+        this.count = 0;
+        this.keyRange = keyRange;
+        this.capacity = initialCapacity;
+        this.heads = new Int32Array(keyRange).fill(-1);
+        this.values = new Int32Array(initialCapacity);
+        this.nexts = new Int32Array(initialCapacity);
+    }
+    /**
+     * Add a value to the list associated with the key.
+     */
+    add(key, value) {
+        if (key >= this.keyRange) {
+            this.resizeHeads(key + 1);
+        }
+        if (this.count >= this.capacity) {
+            this.resizeCapacity();
+        }
+        const idx = this.count++;
+        this.values[idx] = value;
+        this.nexts[idx] = this.heads[key];
+        this.heads[key] = idx;
+    }
+    /**
+     * Check if the list for a key contains a value.
+     */
+    contains(key, value) {
+        if (key >= this.keyRange) {
+            return false;
+        }
+        let curr = this.heads[key];
+        while (curr !== -1) {
+            if (this.values[curr] === value) {
+                return true;
+            }
+            curr = this.nexts[curr];
+        }
+        return false;
+    }
+    /**
+     * Add a value only if it doesn't already exist in the key's list.
+     */
+    addUnique(key, value) {
+        if (this.contains(key, value)) {
+            return false;
+        }
+        this.add(key, value);
+        return true;
+    }
+    /**
+     * Get an iterator for the values associated with a key.
+     * Efficient for loops: for (const v of map.getValues(key)) { ... }
+     */
+    *getValues(key) {
+        if (key >= this.keyRange) {
+            return;
+        }
+        let curr = this.heads[key];
+        while (curr !== -1) {
+            yield this.values[curr];
+            curr = this.nexts[curr];
+        }
+    }
+    /**
+     * Get all values as an array (less efficient due to allocation).
+     */
+    getAsArray(key) {
+        const result = [];
+        if (key >= this.keyRange) {
+            return result;
+        }
+        let curr = this.heads[key];
+        while (curr !== -1) {
+            result.push(this.values[curr]);
+            curr = this.nexts[curr];
+        }
+        return result;
+    }
+    /**
+     * Check if a key has any values.
+     */
+    has(key) {
+        if (key >= this.keyRange) {
+            return false;
+        }
+        return this.heads[key] !== -1;
+    }
+    resizeHeads(newRange) {
+        const newHeads = new Int32Array(newRange * 2).fill(-1);
+        newHeads.set(this.heads);
+        this.heads = newHeads;
+        this.keyRange = newHeads.length;
+    }
+    resizeCapacity() {
+        const newCapacity = this.capacity * 2;
+        const newValues = new Int32Array(newCapacity);
+        const newNexts = new Int32Array(newCapacity);
+        newValues.set(this.values);
+        newNexts.set(this.nexts);
+        this.values = newValues;
+        this.nexts = newNexts;
+        this.capacity = newCapacity;
+    }
+}
+exports.IntMap = IntMap;

package/lib/utils/IntWorkList.d.ts

@@ -0,0 +1,35 @@
+/**
+ * High-performance circular buffer worklist for integer IDs.
+ * Uses Int32Array to avoid object allocation and GC overhead.
+ */
+export declare class IntWorkList {
+    private buffer;
+    private head;
+    private tail;
+    private count;
+    private capacity;
+    private mask;
+    constructor(initialCapacity?: number);
+    /**
+     * Add a value to the end of the worklist.
+     */
+    push(value: number): void;
+    /**
+     * Remove and return the value from the front of the worklist.
+     * Returns undefined if empty.
+     */
+    pop(): number | undefined;
+    /**
+     * Check if the worklist is empty.
+     */
+    isEmpty(): boolean;
+    /**
+     * Get the number of elements in the worklist.
+     */
+    size(): number;
+    /**
+     * Double the capacity of the buffer.
+     */
+    private resize;
+}
+//# sourceMappingURL=IntWorkList.d.ts.map

package/lib/utils/IntWorkList.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"IntWorkList.d.ts","sourceRoot":"","sources":["../../src/utils/IntWorkList.ts"],"names":[],"mappings":"AAeA;;;GAGG;AACH,qBAAa,WAAW;IACpB,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,IAAI,CAAa;IACzB,OAAO,CAAC,IAAI,CAAa;IACzB,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,IAAI,CAAS;gBAGT,eAAe,GAAE,MAAa;IAU1C;;OAEG;IACI,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAShC;;;OAGG;IACI,GAAG,IAAI,MAAM,GAAG,SAAS;IAUhC;;OAEG;IACI,OAAO,IAAI,OAAO;IAIzB;;OAEG;IACI,IAAI,IAAI,MAAM;IAIrB;;OAEG;IACH,OAAO,CAAC,MAAM;CAsBjB"}

package/lib/utils/IntWorkList.js

@@ -0,0 +1,97 @@
+"use strict";
+/*
+ * Copyright (c) 2026 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.IntWorkList = void 0;
+/**
+ * High-performance circular buffer worklist for integer IDs.
+ * Uses Int32Array to avoid object allocation and GC overhead.
+ */
+class IntWorkList {
+    // Default start with 1K capacity 
+    constructor(initialCapacity = 1024) {
+        this.head = 0;
+        this.tail = 0;
+        this.count = 0;
+        // Ensure power of 2 capacity for efficient masking
+        this.capacity = 1;
+        while (this.capacity < initialCapacity) {
+            this.capacity <<= 1;
+        }
+        this.mask = this.capacity - 1;
+        this.buffer = new Int32Array(this.capacity);
+    }
+    /**
+     * Add a value to the end of the worklist.
+     */
+    push(value) {
+        if (this.count === this.capacity) {
+            this.resize();
+        }
+        this.buffer[this.tail] = value;
+        this.tail = (this.tail + 1) & this.mask;
+        this.count++;
+    }
+    /**
+     * Remove and return the value from the front of the worklist.
+     * Returns undefined if empty.
+     */
+    pop() {
+        if (this.count === 0) {
+            return undefined;
+        }
+        const value = this.buffer[this.head];
+        this.head = (this.head + 1) & this.mask;
+        this.count--;
+        return value;
+    }
+    /**
+     * Check if the worklist is empty.
+     */
+    isEmpty() {
+        return this.count === 0;
+    }
+    /**
+     * Get the number of elements in the worklist.
+     */
+    size() {
+        return this.count;
+    }
+    /**
+     * Double the capacity of the buffer.
+     */
+    resize() {
+        const oldCapacity = this.capacity;
+        const newCapacity = oldCapacity << 1;
+        const newBuffer = new Int32Array(newCapacity);
+        // Copy data to the beginning of the new buffer to linearize it
+        if (this.count > 0) {
+            if (this.head < this.tail) {
+                newBuffer.set(this.buffer.subarray(this.head, this.tail), 0);
+            }
+            else {
+                const firstPartLen = oldCapacity - this.head;
+                newBuffer.set(this.buffer.subarray(this.head, oldCapacity), 0);
+                newBuffer.set(this.buffer.subarray(0, this.tail), firstPartLen);
+            }
+        }
+        this.buffer = newBuffer;
+        this.capacity = newCapacity;
+        this.mask = newCapacity - 1;
+        this.head = 0;
+        this.tail = this.count;
+    }
+}
+exports.IntWorkList = IntWorkList;

package/lib/utils/PackedSparseMap.d.ts

@@ -0,0 +1,26 @@
+/**
+ * PackedSparseMap - A memory-efficient sparse index with packed storage.
+ *
+ * Implements a two-level indexing structure:
+ * - First level: Owner-based segmentation (sparse)
+ * - Second level: Sorted key-value pairs within each owner (packed)
+ *
+ */
+export declare class PackedSparseMap {
+    private offsets;
+    private lengths;
+    private capacities;
+    private keys;
+    private values;
+    private poolSize;
+    private poolCapacity;
+    constructor(initialOwnerCapacity: number, initialPoolCapacity: number);
+    getOrInsert(owner: number, key: number, createValue: () => number): number;
+    private binarySearch;
+    private binarySearchInsertPosition;
+    private ensureOwnerCapacity;
+    private ensureOwnerListCapacity;
+    private ensurePoolCapacity;
+    private resizeOwners;
+}
+//# sourceMappingURL=PackedSparseMap.d.ts.map

package/lib/utils/PackedSparseMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PackedSparseMap.d.ts","sourceRoot":"","sources":["../../src/utils/PackedSparseMap.ts"],"names":[],"mappings":"AAeA;;;;;;;GAOG;AACH,qBAAa,eAAe;IACxB,OAAO,CAAC,OAAO,CAAa;IAC5B,OAAO,CAAC,OAAO,CAAa;IAC5B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,IAAI,CAAa;IACzB,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,QAAQ,CAAa;IAC7B,OAAO,CAAC,YAAY,CAAS;gBAEjB,oBAAoB,EAAE,MAAM,EAAE,mBAAmB,EAAE,MAAM;IAU9D,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,MAAM,GAAG,MAAM;IA4BjF,OAAO,CAAC,YAAY;IAoBpB,OAAO,CAAC,0BAA0B;IAIlC,OAAO,CAAC,mBAAmB;IAc3B,OAAO,CAAC,uBAAuB;IAuB/B,OAAO,CAAC,kBAAkB;IAoB1B,OAAO,CAAC,YAAY;CAWvB"}

package/lib/utils/PackedSparseMap.js

@@ -0,0 +1,140 @@
+"use strict";
+/*
+ * Copyright (c) 2026 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.PackedSparseMap = void 0;
+/**
+ * PackedSparseMap - A memory-efficient sparse index with packed storage.
+ *
+ * Implements a two-level indexing structure:
+ * - First level: Owner-based segmentation (sparse)
+ * - Second level: Sorted key-value pairs within each owner (packed)
+ *
+ */
+class PackedSparseMap {
+    constructor(initialOwnerCapacity, initialPoolCapacity) {
+        this.poolSize = 0;
+        const ownerSize = Math.max(1, initialOwnerCapacity);
+        this.offsets = new Int32Array(ownerSize).fill(0);
+        this.lengths = new Int32Array(ownerSize).fill(0);
+        this.capacities = new Int32Array(ownerSize).fill(0);
+        this.poolCapacity = Math.max(1024, initialPoolCapacity);
+        this.keys = new Int32Array(this.poolCapacity);
+        this.values = new Int32Array(this.poolCapacity);
+    }
+    getOrInsert(owner, key, createValue) {
+        this.ensureOwnerCapacity(owner);
+        const offset = this.offsets[owner];
+        const length = this.lengths[owner];
+        const searchResult = this.binarySearch(offset, length, key);
+        if (searchResult.found) {
+            return this.values[offset + searchResult.index];
+        }
+        this.ensureOwnerListCapacity(owner, length + 1);
+        const updatedOffset = this.offsets[owner];
+        const updatedLength = this.lengths[owner];
+        const insertPos = this.binarySearchInsertPosition(updatedOffset, updatedLength, key);
+        for (let i = updatedLength; i > insertPos; i--) {
+            this.keys[updatedOffset + i] = this.keys[updatedOffset + i - 1];
+            this.values[updatedOffset + i] = this.values[updatedOffset + i - 1];
+        }
+        const value = createValue();
+        this.keys[updatedOffset + insertPos] = key;
+        this.values[updatedOffset + insertPos] = value;
+        this.lengths[owner] = updatedLength + 1;
+        return value;
+    }
+    binarySearch(offset, length, key) {
+        let low = 0;
+        let high = length - 1;
+        while (low <= high) {
+            const mid = (low + high) >>> 1;
+            const current = this.keys[offset + mid];
+            if (current === key) {
+                return { found: true, index: mid };
+            }
+            if (current < key) {
+                low = mid + 1;
+            }
+            else {
+                high = mid - 1;
+            }
+        }
+        return { found: false, index: low };
+    }
+    binarySearchInsertPosition(offset, length, key) {
+        return this.binarySearch(offset, length, key).index;
+    }
+    ensureOwnerCapacity(owner) {
+        if (owner < this.offsets.length) {
+            return;
+        }
+        let newSize = this.offsets.length;
+        if (newSize === 0) {
+            newSize = 1;
+        }
+        while (newSize <= owner) {
+            newSize <<= 1;
+        }
+        this.resizeOwners(newSize);
+    }
+    ensureOwnerListCapacity(owner, required) {
+        const cap = this.capacities[owner];
+        if (cap >= required) {
+            return;
+        }
+        const newCap = cap === 0 ? Math.max(4, required) : Math.max(cap << 1, required);
+        this.ensurePoolCapacity(newCap);
+        const oldOffset = this.offsets[owner];
+        const len = this.lengths[owner];
+        const newOffset = this.poolSize;
+        for (let i = 0; i < len; i++) {
+            this.keys[newOffset + i] = this.keys[oldOffset + i];
+            this.values[newOffset + i] = this.values[oldOffset + i];
+        }
+        this.offsets[owner] = newOffset;
+        this.capacities[owner] = newCap;
+        this.poolSize += newCap;
+    }
+    ensurePoolCapacity(additional) {
+        const required = this.poolSize + additional;
+        if (required <= this.poolCapacity) {
+            return;
+        }
+        let newCapacity = Math.max(this.poolCapacity << 1, 1024);
+        while (newCapacity < required) {
+            newCapacity <<= 1;
+        }
+        const newKeys = new Int32Array(newCapacity);
+        const newValues = new Int32Array(newCapacity);
+        newKeys.set(this.keys);
+        newValues.set(this.values);
+        this.keys = newKeys;
+        this.values = newValues;
+        this.poolCapacity = newCapacity;
+    }
+    resizeOwners(newSize) {
+        const newOffsets = new Int32Array(newSize);
+        const newLengths = new Int32Array(newSize);
+        const newCaps = new Int32Array(newSize);
+        newOffsets.set(this.offsets);
+        newLengths.set(this.lengths);
+        newCaps.set(this.capacities);
+        this.offsets = newOffsets;
+        this.lengths = newLengths;
+        this.capacities = newCaps;
+    }
+}
+exports.PackedSparseMap = PackedSparseMap;

package/lib/utils/logger.d.ts

@@ -10,6 +10,7 @@ export declare enum LOG_MODULE_TYPE {
     DEFAULT = "default",
     ARKANALYZER = "ArkAnalyzer",
     HOMECHECK = "HomeCheck",
+    HOMEFLOW = "HomeFlow",
     TOOL = "Tool"
 }
 export default class ConsoleLogger {

package/lib/utils/logger.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"logger.d.ts","sourceRoot":"","sources":["../../src/utils/logger.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAGrC,oBAAY,SAAS;IACjB,KAAK,UAAU;IACf,IAAI,SAAS;IACb,IAAI,SAAS;IACb,KAAK,UAAU;IACf,KAAK,UAAU;CAClB;AAED,oBAAY,eAAe;IACvB,OAAO,YAAY;IACnB,WAAW,gBAAgB;IAC3B,SAAS,cAAc;IACvB,IAAI,SAAS;CAChB;AAED,MAAM,CAAC,OAAO,OAAO,aAAa;WAChB,SAAS,CACnB,WAAW,EAAE,MAAM,EACnB,iBAAiB,GAAE,SAA2B,EAC9C,UAAU,GAAE,SAA0B,EACtC,WAAW,GAAE,OAAe,GAC7B,IAAI;WAkDO,SAAS,CAAC,QAAQ,EAAE,eAAe,EAAE,GAAG,GAAE,MAAY,GAAG,MAAM;CAWhF"}
+{"version":3,"file":"logger.d.ts","sourceRoot":"","sources":["../../src/utils/logger.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAGrC,oBAAY,SAAS;IACjB,KAAK,UAAU;IACf,IAAI,SAAS;IACb,IAAI,SAAS;IACb,KAAK,UAAU;IACf,KAAK,UAAU;CAClB;AAED,oBAAY,eAAe;IACvB,OAAO,YAAY;IACnB,WAAW,gBAAgB;IAC3B,SAAS,cAAc;IACvB,QAAQ,aAAa;IACrB,IAAI,SAAS;CAChB;AAED,MAAM,CAAC,OAAO,OAAO,aAAa;WAChB,SAAS,CACnB,WAAW,EAAE,MAAM,EACnB,iBAAiB,GAAE,SAA2B,EAC9C,UAAU,GAAE,SAA0B,EACtC,WAAW,GAAE,OAAe,GAC7B,IAAI;WAkDO,SAAS,CAAC,QAAQ,EAAE,eAAe,EAAE,GAAG,GAAE,MAAY,GAAG,MAAM;CAWhF"}

package/lib/utils/logger.js

@@ -29,6 +29,7 @@ var LOG_MODULE_TYPE;
     LOG_MODULE_TYPE["DEFAULT"] = "default";
     LOG_MODULE_TYPE["ARKANALYZER"] = "ArkAnalyzer";
     LOG_MODULE_TYPE["HOMECHECK"] = "HomeCheck";
+    LOG_MODULE_TYPE["HOMEFLOW"] = "HomeFlow";
     LOG_MODULE_TYPE["TOOL"] = "Tool";
 })(LOG_MODULE_TYPE = exports.LOG_MODULE_TYPE || (exports.LOG_MODULE_TYPE = {}));
 class ConsoleLogger {

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "arkanalyzer",
-  "version": "1.0.80",
-"commit_id": "0f01eb89",
+  "version": "1.0.82",
+"commit_id": "7e0c11d4",
   "files": [
     "docs",
     "lib",