arkanalyzer 1.0.20 → 1.0.22

package/lib/utils/FileUtils.d.ts

@@ -1,19 +1,19 @@
-export declare class FileUtils {
-    static readonly FILE_FILTER: {
-        ignores: string[];
-        include: RegExp;
-    };
-    static getIndexFileName(srcPath: string): string;
-    static isDirectory(srcPath: string): boolean;
-    static isAbsolutePath(path: string): boolean;
-    static generateModuleMap(ohPkgContentMap: Map<string, {
-        [k: string]: unknown;
-    }>): Map<string, ModulePath>;
-}
-export declare class ModulePath {
-    path: string;
-    main: string;
-    constructor(path: string, main: string);
-}
-export declare function getFileRecursively(srcDir: string, fileName: string, visited?: Set<string>): string;
+export declare class FileUtils {
+    static readonly FILE_FILTER: {
+        ignores: string[];
+        include: RegExp;
+    };
+    static getIndexFileName(srcPath: string): string;
+    static isDirectory(srcPath: string): boolean;
+    static isAbsolutePath(path: string): boolean;
+    static generateModuleMap(ohPkgContentMap: Map<string, {
+        [k: string]: unknown;
+    }>): Map<string, ModulePath>;
+}
+export declare class ModulePath {
+    path: string;
+    main: string;
+    constructor(path: string, main: string);
+}
+export declare function getFileRecursively(srcDir: string, fileName: string, visited?: Set<string>): string;
 //# sourceMappingURL=FileUtils.d.ts.map

package/lib/utils/FileUtils.js

@@ -1,135 +1,135 @@
-"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.
- */
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || function (mod) {
-    if (mod && mod.__esModule) return mod;
-    var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
-    __setModuleDefault(result, mod);
-    return result;
-};
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getFileRecursively = exports.ModulePath = exports.FileUtils = void 0;
-const fs_1 = __importDefault(require("fs"));
-const path_1 = __importDefault(require("path"));
-const logger_1 = __importStar(require("./logger"));
-const pathTransfer_1 = require("./pathTransfer");
-const EtsConst_1 = require("../core/common/EtsConst");
-const logger = logger_1.default.getLogger(logger_1.LOG_MODULE_TYPE.ARKANALYZER, 'FileUtils');
-class FileUtils {
-    static getIndexFileName(srcPath) {
-        for (const fileInDir of fs_1.default.readdirSync(srcPath, { withFileTypes: true })) {
-            if (fileInDir.isFile() && /^index(\.d)?\.e?ts$/i.test(fileInDir.name)) {
-                return fileInDir.name;
-            }
-        }
-        return '';
-    }
-    static isDirectory(srcPath) {
-        try {
-            return fs_1.default.statSync(srcPath).isDirectory();
-        }
-        catch (e) {
-        }
-        return false;
-    }
-    static isAbsolutePath(path) {
-        return /^(\/|\\|[A-Z]:\\)/.test(path);
-    }
-    static generateModuleMap(ohPkgContentMap) {
-        const moduleMap = new Map();
-        ohPkgContentMap.forEach((content, filePath) => {
-            const moduleName = content.name;
-            if (moduleName && moduleName.startsWith('@')) {
-                const modulePath = path_1.default.dirname(filePath);
-                moduleMap.set(moduleName, new ModulePath(modulePath, content.main ?
-                    path_1.default.resolve(modulePath, content.main) : ''));
-            }
-        });
-        ohPkgContentMap.forEach((content, filePath) => {
-            if (content.dependencies) {
-                Object.entries(content.dependencies).forEach(([name, value]) => {
-                    if (!moduleMap.get(name)) {
-                        const modulePath = path_1.default.resolve(path_1.default.dirname(filePath), value.replace('file:', ''));
-                        const key = path_1.default.resolve(modulePath, EtsConst_1.OH_PACKAGE_JSON5);
-                        const target = ohPkgContentMap.get(key);
-                        if (target) {
-                            moduleMap.set(name, new ModulePath(modulePath, target.main ?
-                                path_1.default.resolve(modulePath, target.main) : ''));
-                        }
-                    }
-                });
-            }
-        });
-        return moduleMap;
-    }
-}
-exports.FileUtils = FileUtils;
-FileUtils.FILE_FILTER = {
-    ignores: ['.git', '.preview', '.hvigor', '.idea', 'test', 'ohosTest'],
-    include: /(?<!\.d)\.(ets|ts|json5)$/
-};
-class ModulePath {
-    constructor(path, main) {
-        this.path = (0, pathTransfer_1.transfer2UnixPath)(path);
-        this.main = (0, pathTransfer_1.transfer2UnixPath)(main);
-    }
-}
-exports.ModulePath = ModulePath;
-function getFileRecursively(srcDir, fileName, visited = new Set()) {
-    let res = '';
-    if (!fs_1.default.existsSync(srcDir) || !fs_1.default.statSync(srcDir).isDirectory()) {
-        logger.warn(`Input directory ${srcDir} is not exist`);
-        return res;
-    }
-    const filesUnderThisDir = fs_1.default.readdirSync(srcDir, { withFileTypes: true });
-    const realSrc = fs_1.default.realpathSync(srcDir);
-    if (visited.has(realSrc)) {
-        return res;
-    }
-    visited.add(realSrc);
-    filesUnderThisDir.forEach(file => {
-        if (res !== '') {
-            return res;
-        }
-        if (file.name === fileName) {
-            res = path_1.default.resolve(srcDir, file.name);
-            return res;
-        }
-        const tmpDir = path_1.default.resolve(srcDir, '../');
-        res = getFileRecursively(tmpDir, fileName, visited);
-    });
-    return res;
-}
-exports.getFileRecursively = getFileRecursively;
+"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.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    __setModuleDefault(result, mod);
+    return result;
+};
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getFileRecursively = exports.ModulePath = exports.FileUtils = void 0;
+const fs_1 = __importDefault(require("fs"));
+const path_1 = __importDefault(require("path"));
+const logger_1 = __importStar(require("./logger"));
+const pathTransfer_1 = require("./pathTransfer");
+const EtsConst_1 = require("../core/common/EtsConst");
+const logger = logger_1.default.getLogger(logger_1.LOG_MODULE_TYPE.ARKANALYZER, 'FileUtils');
+class FileUtils {
+    static getIndexFileName(srcPath) {
+        for (const fileInDir of fs_1.default.readdirSync(srcPath, { withFileTypes: true })) {
+            if (fileInDir.isFile() && /^index(\.d)?\.e?ts$/i.test(fileInDir.name)) {
+                return fileInDir.name;
+            }
+        }
+        return '';
+    }
+    static isDirectory(srcPath) {
+        try {
+            return fs_1.default.statSync(srcPath).isDirectory();
+        }
+        catch (e) {
+        }
+        return false;
+    }
+    static isAbsolutePath(path) {
+        return /^(\/|\\|[A-Z]:\\)/.test(path);
+    }
+    static generateModuleMap(ohPkgContentMap) {
+        const moduleMap = new Map();
+        ohPkgContentMap.forEach((content, filePath) => {
+            const moduleName = content.name;
+            if (moduleName && moduleName.startsWith('@')) {
+                const modulePath = path_1.default.dirname(filePath);
+                moduleMap.set(moduleName, new ModulePath(modulePath, content.main ?
+                    path_1.default.resolve(modulePath, content.main) : ''));
+            }
+        });
+        ohPkgContentMap.forEach((content, filePath) => {
+            if (content.dependencies) {
+                Object.entries(content.dependencies).forEach(([name, value]) => {
+                    if (!moduleMap.get(name)) {
+                        const modulePath = path_1.default.resolve(path_1.default.dirname(filePath), value.replace('file:', ''));
+                        const key = path_1.default.resolve(modulePath, EtsConst_1.OH_PACKAGE_JSON5);
+                        const target = ohPkgContentMap.get(key);
+                        if (target) {
+                            moduleMap.set(name, new ModulePath(modulePath, target.main ?
+                                path_1.default.resolve(modulePath, target.main) : ''));
+                        }
+                    }
+                });
+            }
+        });
+        return moduleMap;
+    }
+}
+exports.FileUtils = FileUtils;
+FileUtils.FILE_FILTER = {
+    ignores: ['.git', '.preview', '.hvigor', '.idea', 'test', 'ohosTest'],
+    include: /(?<!\.d)\.(ets|ts|json5)$/
+};
+class ModulePath {
+    constructor(path, main) {
+        this.path = (0, pathTransfer_1.transfer2UnixPath)(path);
+        this.main = (0, pathTransfer_1.transfer2UnixPath)(main);
+    }
+}
+exports.ModulePath = ModulePath;
+function getFileRecursively(srcDir, fileName, visited = new Set()) {
+    let res = '';
+    if (!fs_1.default.existsSync(srcDir) || !fs_1.default.statSync(srcDir).isDirectory()) {
+        logger.warn(`Input directory ${srcDir} is not exist`);
+        return res;
+    }
+    const filesUnderThisDir = fs_1.default.readdirSync(srcDir, { withFileTypes: true });
+    const realSrc = fs_1.default.realpathSync(srcDir);
+    if (visited.has(realSrc)) {
+        return res;
+    }
+    visited.add(realSrc);
+    filesUnderThisDir.forEach(file => {
+        if (res !== '') {
+            return res;
+        }
+        if (file.name === fileName) {
+            res = path_1.default.resolve(srcDir, file.name);
+            return res;
+        }
+        const tmpDir = path_1.default.resolve(srcDir, '../');
+        res = getFileRecursively(tmpDir, fileName, visited);
+    });
+    return res;
+}
+exports.getFileRecursively = getFileRecursively;

package/lib/utils/SparseBitVector.d.ts

@@ -1,101 +1,101 @@
-/**
- * SparseBitVector is a LLVM-interfaces-like data structure designed to efficiently
- * represent and manipulate large sets of integers where the majority of the elements
- * are unset (i.e., sparse). It is particularly useful in scenarios where memory efficiency
- * is critical, and the set of integers contains large gaps between set bits.
- *
- * The SparseBitVector is implemented as a collection of SparseBitVectorElement objects,
- * where each element represents a fixed-size chunk of the bit vector. This allows the
- * structure to only allocate memory for the portions of the bit vector that contain
- * set bits, significantly reducing memory usage for sparse data.
- *
- * Key Features:
- * - **Unordered**: We implement it as unordered rather than LLVM's for performance reason.
- * - **Sparse Storage**: Only stores the indices of set bits, making it memory-efficient
- *   for sparse datasets.
- * - **Efficient Operations**: Supports fast bitwise operations such as union and intersection
- * - **Iterable**: Provides an iterator to traverse all set bits in stored order.
- * - **Dynamic Resizing**: Automatically adjusts its internal structure as bits are set
- *   or reset.
- *
- * Perforceman VS Array
- * - **Random Store**         2.5:1
- * - **Continuous Store**       1:1
- * - **Random Test**            1:6
- * - **Continuous Test**        1:1
- * - **Random Iterator**        4:1
- * - **Continuous Iterator**    2:1
- *
- * The SparseBitVector is parameterized by `ElementSize`, which defines the size of each
- * chunk (element) in the bit vector and MUST be times of 32. This allows for customization
- * based on the expected sparsity and performance requirements.
- *
- */
-export type Word = Uint16Array;
-declare class SparseBitVectorElement {
-    private ELEMENT_SIZE;
-    private BITWORDS_NUM;
-    private bits;
-    constructor(elementSize?: number);
-    word(idx: number): number;
-    clone(): Word;
-    get elementSize(): number;
-    get bitWordNum(): number;
-    isEmpty(): boolean;
-    set(bitIdx: number): void;
-    setWord(word: Word): void;
-    reset(bitIdx: number): void;
-    test(bitIdx: number): boolean;
-    test_and_set(bitIdx: number): boolean;
-    count(): number;
-    findFirst(): number;
-    findNext(bitIdx: number): number;
-    equals(rhs: SparseBitVectorElement): boolean;
-    unionWith(other: SparseBitVectorElement): boolean;
-    intersectWith(other: SparseBitVectorElement): boolean;
-    subtractWith(rhs: SparseBitVectorElement): boolean;
-    countBitsV2(word: number): number;
-    countBits(word: number): number;
-    isZero(): boolean;
-    private countTrailingZeros;
-}
-export declare class SparseBitVector {
-    private ELEMENT_SIZE;
-    private elements;
-    constructor(elementsSize?: number);
-    get elementSize(): number;
-    get elems(): Map<number, SparseBitVectorElement>;
-    set(bitIdx: number): void;
-    test(bitIdx: number): boolean;
-    testAndSet(bitIdx: number): boolean;
-    reset(bitIdx: number): void;
-    clear(): void;
-    clone(): SparseBitVector;
-    findFirst(): number;
-    count(): number;
-    isEmpty(): boolean;
-    [Symbol.iterator](): IterableIterator<number>;
-    /**
-     * Check if this SparseBitVector is equal to another SparseBitVector.
-     */
-    equals(rhs: SparseBitVector): boolean;
-    /**
-     * Perform a union operation with another SparseBitVector.
-     * Returns True if this vector was changed, false otherwise.
-     */
-    unionWith(rhs: SparseBitVector): boolean;
-    /**
-     * Perform an intersection operation with another SparseBitVector.
-     * Returns True if this vector was changed, false otherwise.
-     */
-    intersectWith(rhs: SparseBitVector): boolean;
-    /**
-     * Subtract another SparseBitVector from this one.
-     * This operation modifies the current SparseBitVector in place.
-     * Return True if the current SparseBitVector was modified, false otherwise.
-     */
-    subtractWith(rhs: SparseBitVector): boolean;
-    toString(): string;
-}
-export {};
+/**
+ * SparseBitVector is a LLVM-interfaces-like data structure designed to efficiently
+ * represent and manipulate large sets of integers where the majority of the elements
+ * are unset (i.e., sparse). It is particularly useful in scenarios where memory efficiency
+ * is critical, and the set of integers contains large gaps between set bits.
+ *
+ * The SparseBitVector is implemented as a collection of SparseBitVectorElement objects,
+ * where each element represents a fixed-size chunk of the bit vector. This allows the
+ * structure to only allocate memory for the portions of the bit vector that contain
+ * set bits, significantly reducing memory usage for sparse data.
+ *
+ * Key Features:
+ * - **Unordered**: We implement it as unordered rather than LLVM's for performance reason.
+ * - **Sparse Storage**: Only stores the indices of set bits, making it memory-efficient
+ *   for sparse datasets.
+ * - **Efficient Operations**: Supports fast bitwise operations such as union and intersection
+ * - **Iterable**: Provides an iterator to traverse all set bits in stored order.
+ * - **Dynamic Resizing**: Automatically adjusts its internal structure as bits are set
+ *   or reset.
+ *
+ * Perforceman VS Array
+ * - **Random Store**         2.5:1
+ * - **Continuous Store**       1:1
+ * - **Random Test**            1:6
+ * - **Continuous Test**        1:1
+ * - **Random Iterator**        4:1
+ * - **Continuous Iterator**    2:1
+ *
+ * The SparseBitVector is parameterized by `ElementSize`, which defines the size of each
+ * chunk (element) in the bit vector and MUST be times of 32. This allows for customization
+ * based on the expected sparsity and performance requirements.
+ *
+ */
+export type Word = Uint16Array;
+declare class SparseBitVectorElement {
+    private ELEMENT_SIZE;
+    private BITWORDS_NUM;
+    private bits;
+    constructor(elementSize?: number);
+    word(idx: number): number;
+    clone(): Word;
+    get elementSize(): number;
+    get bitWordNum(): number;
+    isEmpty(): boolean;
+    set(bitIdx: number): void;
+    setWord(word: Word): void;
+    reset(bitIdx: number): void;
+    test(bitIdx: number): boolean;
+    test_and_set(bitIdx: number): boolean;
+    count(): number;
+    findFirst(): number;
+    findNext(bitIdx: number): number;
+    equals(rhs: SparseBitVectorElement): boolean;
+    unionWith(other: SparseBitVectorElement): boolean;
+    intersectWith(other: SparseBitVectorElement): boolean;
+    subtractWith(rhs: SparseBitVectorElement): boolean;
+    countBitsV2(word: number): number;
+    countBits(word: number): number;
+    isZero(): boolean;
+    private countTrailingZeros;
+}
+export declare class SparseBitVector {
+    private ELEMENT_SIZE;
+    private elements;
+    constructor(elementsSize?: number);
+    get elementSize(): number;
+    get elems(): Map<number, SparseBitVectorElement>;
+    set(bitIdx: number): void;
+    test(bitIdx: number): boolean;
+    testAndSet(bitIdx: number): boolean;
+    reset(bitIdx: number): void;
+    clear(): void;
+    clone(): SparseBitVector;
+    findFirst(): number;
+    count(): number;
+    isEmpty(): boolean;
+    [Symbol.iterator](): IterableIterator<number>;
+    /**
+     * Check if this SparseBitVector is equal to another SparseBitVector.
+     */
+    equals(rhs: SparseBitVector): boolean;
+    /**
+     * Perform a union operation with another SparseBitVector.
+     * Returns True if this vector was changed, false otherwise.
+     */
+    unionWith(rhs: SparseBitVector): boolean;
+    /**
+     * Perform an intersection operation with another SparseBitVector.
+     * Returns True if this vector was changed, false otherwise.
+     */
+    intersectWith(rhs: SparseBitVector): boolean;
+    /**
+     * Subtract another SparseBitVector from this one.
+     * This operation modifies the current SparseBitVector in place.
+     * Return True if the current SparseBitVector was modified, false otherwise.
+     */
+    subtractWith(rhs: SparseBitVector): boolean;
+    toString(): string;
+}
+export {};
 //# sourceMappingURL=SparseBitVector.d.ts.map