jsql-neo 2.1.4 → 2.2.0

package/lib/table.js

@@ -29,6 +29,7 @@ class Table {
         this._btreesDirty = false;
 
         this._primaryKey = null;
+        this._pkIndex = null;
         this._autoIncrementField = null;
         this._foreignKeys = [];
         this._checkConstraints = [];
@@ -69,6 +70,7 @@ class Table {
             this._softDelete = true;
         }
 
+        this._pkIndex = this._primaryKey ? new Map() : null;
         this._cachedSchemaFields = Object.keys(schema).filter(f => f !== '_softDelete');
         this._cachedDateFields = Object.keys(this._dateFields);
         this._cachedUniqueFields = this._cachedSchemaFields.filter(f => schema[f].unique);
@@ -179,7 +181,12 @@ class Table {
             } else if (autoIncField && data[autoIncField] > this._autoIncrement) {
                 this._autoIncrement = data[autoIncField];
             }
+            const rowIdx = this._rows.length;
             this._rows.push(Object.assign({}, data));
+            if (this._pkIndex && this._primaryKey) {
+                const pkVal = data[this._primaryKey];
+                if (pkVal !== undefined && pkVal !== null) this._pkIndex.set(pkVal, rowIdx);
+            }
             items[i] = data;
         }
         this._btreesDirty = true;
@@ -222,6 +229,15 @@ class Table {
 
     findById(id) {
         if (!this._primaryKey) throw createError('ER_PARSE_ERROR', 'Table has no primary key');
+        // Hash 索引 O(1)
+        if (this._pkIndex) {
+            const rowIndex = this._pkIndex.get(id);
+            if (rowIndex !== undefined) {
+                const row = this._rows[rowIndex];
+                if (row && !row._deleted) return { ...row };
+            }
+            return null;
+        }
         this._ensureBTrees();
         if (this._btrees[this._primaryKey]) {
             const indices = this._btrees[this._primaryKey].search(id);
@@ -345,6 +361,17 @@ class Table {
         return this.remove(query);
     }
 
+    _findRowIndex(id) {
+        if (this._pkIndex && this._primaryKey) {
+            const idx = this._pkIndex.get(id);
+            if (idx !== undefined) return idx;
+        }
+        for (let i = 0; i < this._rows.length; i++) {
+            if (this._rows[i][this._primaryKey] === id) return i;
+        }
+        return -1;
+    }
+
     restore(query = {}) {
         if (!this._softDelete) throw createError('ER_NOT_SUPPORTED', 'Soft delete is not enabled');
         const matched = this._applyFilter(this._rows, { ...query, _deleted: true });
@@ -365,6 +392,7 @@ class Table {
     _truncate() {
         const count = this._rows.length;
         this._rows = [];
+        if (this._pkIndex) this._pkIndex.clear();
         for (const key of Object.keys(this._btrees)) {
             this._btrees[key].clear();
         }
@@ -902,6 +930,10 @@ class Table {
 
     _addToIndexes(rowIndex, data) {
         this._ensureBTrees();
+        if (this._pkIndex && this._primaryKey) {
+            const pkVal = data[this._primaryKey];
+            if (pkVal !== undefined && pkVal !== null) this._pkIndex.set(pkVal, rowIndex);
+        }
         for (const field of Object.keys(this._indexes)) {
             const value = data[field];
             if (value !== undefined) {
@@ -921,6 +953,9 @@ class Table {
 
     _removeFromIndexes(rowIndex, data) {
         this._ensureBTrees();
+        if (this._pkIndex && this._primaryKey) {
+            this._pkIndex.delete(data[this._primaryKey]);
+        }
         for (const field of Object.keys(this._indexes)) {
             const value = data[field];
             if (value !== undefined && this._indexes[field].has(value)) {
@@ -940,8 +975,17 @@ class Table {
         }
     }
 
+    _rebuildPKIndex() {
+        if (!this._pkIndex || !this._primaryKey) return;
+        this._pkIndex.clear();
+        for (let i = 0; i < this._rows.length; i++) {
+            const pkVal = this._rows[i][this._primaryKey];
+            if (pkVal !== undefined && pkVal !== null) this._pkIndex.set(pkVal, i);
+        }
+    }
+
     _adjustBTreeAfterRemove(removedIndex) {
-        // 重建受影响的 B-Tree
+        this._rebuildPKIndex();
         for (const field of Object.keys(this._btrees)) {
             this._rebuildBTree(field);
         }
@@ -957,6 +1001,7 @@ class Table {
                 }
             }
         }
+        this._rebuildPKIndex();
         this._rebuildAllBTrees();
         for (const field of Object.keys(this._indexes)) {
             this.createIndex(field);

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "jsql-neo",
-    "version": "2.1.4",
+    "version": "2.2.0",
     "description": "JSQL-NEO — Pure JavaScript embedded database with B-Tree indexes, WAL, hash JOIN, Redis-compatible Cache, and MySQL-style error codes",
     "main": "index.js",
     "files": [