xshell 1.2.9 → 1.2.11

package/index.d.ts

@@ -4,3 +4,4 @@ export * from './utils.ts';
 export * from './file.ts';
 export * from './process.ts';
 export * from './net.ts';
+export { path } from './path.ts';

package/index.js

@@ -4,4 +4,5 @@ export * from "./utils.js";
 export * from "./file.js";
 export * from "./process.js";
 export * from "./net.js";
+export { path } from "./path.js";
 //# sourceMappingURL=index.js.map

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "xshell",
-    "version": "1.2.9",
+    "version": "1.2.11",
     "type": "module",
     "main": "./index.js",
     "bin": {
@@ -56,7 +56,7 @@
         "@stylistic/eslint-plugin": "^2.13.0",
         "@svgr/webpack": "^8.1.0",
         "@types/sass-loader": "^8.0.9",
-        "@types/ws": "^8.5.13",
+        "@types/ws": "^8.5.14",
         "@typescript-eslint/eslint-plugin": "^8.21.0",
         "@typescript-eslint/parser": "^8.21.0",
         "@typescript-eslint/utils": "^8.21.0",
@@ -96,7 +96,7 @@
         "tslib": "^2.8.1",
         "typescript": "^5.7.3",
         "ua-parser-js": "^2.0.0",
-        "undici": "^7.2.3",
+        "undici": "^7.3.0",
         "vinyl": "^3.0.0",
         "vinyl-fs": "^4.0.0",
         "webpack": "^5.97.1",
@@ -114,8 +114,8 @@
         "@types/koa-compress": "^4.0.6",
         "@types/lodash": "^4.17.14",
         "@types/mime-types": "^2.1.4",
-        "@types/node": "^22.10.7",
-        "@types/react": "^19.0.7",
+        "@types/node": "^22.10.10",
+        "@types/react": "^19.0.8",
         "@types/through2": "^2.0.41",
         "@types/tough-cookie": "^4.0.5",
         "@types/ua-parser-js": "^0.7.39",

package/storage.d.ts

@@ -10,3 +10,13 @@ export declare let storage: {
     list(): string[];
     delete(key: string): void;
 };
+export declare let db: {
+    store_name: "kv-store";
+    db: IDBDatabase;
+    wait_request<TResult>(request: IDBOpenDBRequest | IDBRequest): Promise<TResult>;
+    open(): Promise<void>;
+    transaction(mode: IDBTransactionMode): IDBObjectStore;
+    get<TReturn = any>(key: IDBValidKey): Promise<TReturn>;
+    set(key: IDBValidKey, value: any): Promise<void>;
+    delete(key: string): Promise<void>;
+};

package/storage.js

@@ -26,4 +26,42 @@ export let storage = {
         localStorage.removeItem(key);
     }
 };
+export let db = {
+    store_name: 'kv-store',
+    db: null,
+    async wait_request(request) {
+        return new Promise((resolve, reject) => {
+            request.onerror = event => {
+                reject(request.error);
+            };
+            request.onsuccess = event => {
+                resolve(request.result);
+            };
+        });
+    },
+    async open() {
+        let request = indexedDB.open('storage');
+        request.onupgradeneeded = event => {
+            request.result.createObjectStore(this.store_name);
+        };
+        this.db = await this.wait_request(request);
+    },
+    transaction(mode) {
+        return this.db.transaction(this.store_name, mode)
+            .objectStore(this.store_name);
+    },
+    async get(key) {
+        return this.wait_request(this.transaction('readonly').get(key));
+    },
+    async set(key, value) {
+        // 当 uint8array 长度与底层的 arraybuffer 长度不同时，可能是其中的一个 view，为了存储效率直接创建一个独立的 arraybuffer
+        if (value && value instanceof Uint8Array && value.byteLength !== value.buffer.byteLength)
+            value = value.slice();
+        await this.wait_request(this.transaction('readwrite').put(value, key));
+    },
+    async delete(key) {
+        return this.wait_request(this.transaction('readwrite')
+            .delete(key));
+    }
+};
 //# sourceMappingURL=storage.js.map

package/utils.browser.js

@@ -414,7 +414,8 @@ export function lowercase_first_letter(str) {
 /** 大于 n 的最小的 2 的幂次 */
 export function ceil2(n) {
     let power = 1;
-    for (; power <= n; power <<= 1)
+    // 不能用 power <<= 1, 结果可能会超过 32 bit 整数导致位运算溢出为 0，死循环
+    for (; power <= n; power += power)
         ;
     return power;
 }

package/utils.js

@@ -690,7 +690,8 @@ export function* range_to_numbers(range, reverse = false) {
 /** 大于 n 的最小的 2 的幂次 */
 export function ceil2(n) {
     let power = 1;
-    for (; power <= n; power <<= 1)
+    // 不能用 power <<= 1, 结果可能会超过 32 bit 整数导致位运算溢出为 0，死循环
+    for (; power <= n; power += power)
         ;
     return power;
 }