@brightchain/db 0.20.0

package/src/lib/model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.js","sourceRoot":"","sources":["../../../../brightchain-db/src/lib/model.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAMH,qCAA2C;AAE3C,yDAAsD;AAkBtD,gFAAgF;AAEhF;;;;;GAKG;AACH,MAAa,WAAW;IACtB,YACmB,MAAuB,EACvB,QAAqC;QADrC,WAAM,GAAN,MAAM,CAAiB;QACvB,aAAQ,GAAR,QAAQ,CAA6B;IACrD,CAAC;IAEJ,IAAI,CAAC,IAAuB;QAC1B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,CAAC,CAAS;QACZ,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,CAAS;QACb,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,OAAO;QACX,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,KAAK;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,IAAI;QACR,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACrC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACzC,CAAC;IAED,KAAK,CAAC,OAAO;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,EAAyC;QACrD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QAClC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED,KAAK,CAAC,GAAG,CAAI,EAAsB;QACjC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtB,CAAC;IAED,8DAA8D;IAC9D,IAAI,CACF,WAEQ,EACR,UAA2E;QAE3E,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IACtD,CAAC;CACF;AA5DD,kCA4DC;AAgBD,gFAAgF;AAEhF;;;;;;;;;GASG;AACH,MAAa,KAAK;IAShB,YACE,UAA+B,EAC/B,OAAsC;QAEtC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC;QAC1C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,SAAS,CAAC,SAAS,CAAC;QAC9C,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,CAAC,eAAe;YAClB,OAAO,CAAC,cAAc,IAAI,OAAO,CAAC,MAAM,EAAE,IAAI,IAAI,SAAS,CAAC;QAE9D,6DAA6D;QAC7D,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,2EAA2E;IAE3E;;;OAGG;IACH,QAAQ,CAAC,KAAa;QACpB,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC;YACH,IAAA,mCAAgB,EAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;YAC7D,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,GAAG,YAAY,wBAAe,EAAE,CAAC;gBACnC,OAAO,GAAG,CAAC,gBAAgB,CAAC;YAC9B,CAAC;YACD,MAAM,GAAG,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,MAAe;QACtC,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO;QAC1B,IAAA,mCAAgB,EAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;IAC/D,CAAC;IAED,2EAA2E;IAE3E;;;OAGG;IACH,KAAK,CAAC,OAAO,CACX,MAA6B,EAC7B,OAA8B;QAE9B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC9D,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACH,IAAI,CACF,MAA6B,EAC7B,OAA8B;QAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACrD,OAAO,IAAI,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,EAAc;QAC3B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAClD,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/C,CAAC;IAED,2EAA2E;IAE3E;;;OAGG;IACH,KAAK,CAAC,SAAS,CACb,KAAa,EACb,OAAsB;QAEtB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,UAAU,CACd,IAAc,EACd,OAAsB;QAEtB,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAChC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;YAC9B,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CACb,MAA4B,EAC5B,MAA4B,EAC5B,OAAuB;QAEvB,OAAO,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CACd,MAA4B,EAC5B,MAA4B,EAC5B,OAAuB;QAEvB,OAAO,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CACb,MAA4B,EAC5B,OAAsB;QAEtB,OAAO,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CACd,MAA4B,EAC5B,OAAsB;QAEtB,OAAO,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACrD,CAAC;IAED,2EAA2E;IAE3E;;;OAGG;IACH,KAAK,CAAC,UAAU,CACd,MAA4B,EAC5B,WAAmB,EACnB,OAAuB;QAEvB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAC7D,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,SAAS,CAAC,QAA4B;QAC1C,OAAO,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CACZ,KAAQ,EACR,MAA6B;QAE7B,OAAO,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAAC,MAA6B;QAChD,OAAO,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,sBAAsB;QAC1B,OAAO,IAAI,CAAC,UAAU,CAAC,sBAAsB,EAAE,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,MAA4B;QACvC,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClD,OAAO,GAAG,KAAK,IAAI,CAAC;IACtB,CAAC;IAED,2EAA2E;IAE3E,mDAAmD;IACnD,OAAO,CAAC,MAAe;QACrB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,mDAAmD;IACnD,SAAS,CAAC,KAAa;QACrB,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;CACF;AAtOD,sBAsOC"}

package/src/lib/pooledStoreAdapter.d.ts

@@ -0,0 +1,44 @@
+/**
+ * PooledStoreAdapter – adapts an IPooledBlockStore to IBlockStore
+ * by fixing all operations to a specific pool.
+ *
+ * This allows Collection to remain unchanged: it continues to call
+ * store.has(), store.get(), store.put() as before, but the adapter
+ * routes those calls through pool-scoped methods on the inner store.
+ */
+import type { BlockStoreOptions, BrightenResult, CBLMagnetComponents, CBLStorageResult, CBLWhiteningOptions, IBlockMetadata, IBlockStore, IPooledBlockStore, PoolId, RecoveryResult } from '@brightchain/brightchain-lib';
+import { BaseBlock, BlockHandle, BlockSize, Checksum, RawDataBlock } from '@brightchain/brightchain-lib';
+/**
+ * Adapts an IPooledBlockStore to IBlockStore by fixing all operations
+ * to a specific pool. This allows Collection to remain unchanged —
+ * all pool routing is handled transparently at the adapter level.
+ */
+export declare class PooledStoreAdapter implements IBlockStore {
+    private readonly inner;
+    private readonly poolId;
+    constructor(inner: IPooledBlockStore, poolId: PoolId);
+    get blockSize(): BlockSize;
+    has(key: Checksum | string): Promise<boolean>;
+    getData(key: Checksum): Promise<RawDataBlock>;
+    setData(block: RawDataBlock, options?: BlockStoreOptions): Promise<void>;
+    deleteData(key: Checksum): Promise<void>;
+    getRandomBlocks(count: number): Promise<Checksum[]>;
+    get<T extends BaseBlock>(key: Checksum | string): BlockHandle<T>;
+    put(key: Checksum | string, data: Uint8Array, options?: BlockStoreOptions): Promise<void>;
+    delete(key: Checksum | string): Promise<void>;
+    getMetadata(key: Checksum | string): Promise<IBlockMetadata | null>;
+    updateMetadata(key: Checksum | string, updates: Partial<IBlockMetadata>): Promise<void>;
+    generateParityBlocks(key: Checksum | string, parityCount: number): Promise<Checksum[]>;
+    getParityBlocks(key: Checksum | string): Promise<Checksum[]>;
+    recoverBlock(key: Checksum | string): Promise<RecoveryResult>;
+    verifyBlockIntegrity(key: Checksum | string): Promise<boolean>;
+    getBlocksPendingReplication(): Promise<Checksum[]>;
+    getUnderReplicatedBlocks(): Promise<Checksum[]>;
+    recordReplication(key: Checksum | string, nodeId: string): Promise<void>;
+    recordReplicaLoss(key: Checksum | string, nodeId: string): Promise<void>;
+    brightenBlock(key: Checksum | string, randomBlockCount: number): Promise<BrightenResult>;
+    storeCBLWithWhitening(cblData: Uint8Array, options?: CBLWhiteningOptions): Promise<CBLStorageResult>;
+    retrieveCBL(blockId1: Checksum | string, blockId2: Checksum | string, block1ParityIds?: string[], block2ParityIds?: string[]): Promise<Uint8Array>;
+    parseCBLMagnetUrl(magnetUrl: string): CBLMagnetComponents;
+    generateCBLMagnetUrl(blockId1: Checksum | string, blockId2: Checksum | string, blockSize: number, block1ParityIds?: string[], block2ParityIds?: string[], isEncrypted?: boolean): string;
+}

package/src/lib/pooledStoreAdapter.js

@@ -0,0 +1,109 @@
+"use strict";
+/**
+ * PooledStoreAdapter – adapts an IPooledBlockStore to IBlockStore
+ * by fixing all operations to a specific pool.
+ *
+ * This allows Collection to remain unchanged: it continues to call
+ * store.has(), store.get(), store.put() as before, but the adapter
+ * routes those calls through pool-scoped methods on the inner store.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PooledStoreAdapter = void 0;
+const brightchain_lib_1 = require("@brightchain/brightchain-lib");
+/**
+ * Adapts an IPooledBlockStore to IBlockStore by fixing all operations
+ * to a specific pool. This allows Collection to remain unchanged —
+ * all pool routing is handled transparently at the adapter level.
+ */
+class PooledStoreAdapter {
+    constructor(inner, poolId) {
+        this.inner = inner;
+        this.poolId = poolId;
+    }
+    // === Delegated property ===
+    get blockSize() {
+        return this.inner.blockSize;
+    }
+    // === Pool-scoped core block operations ===
+    async has(key) {
+        const hash = typeof key === 'string' ? key : key.toHex();
+        return this.inner.hasInPool(this.poolId, hash);
+    }
+    async getData(key) {
+        const data = await this.inner.getFromPool(this.poolId, key.toHex());
+        return new brightchain_lib_1.RawDataBlock(this.blockSize, data);
+    }
+    async setData(block, options) {
+        await this.inner.putInPool(this.poolId, block.data, options);
+    }
+    async deleteData(key) {
+        await this.inner.deleteFromPool(this.poolId, key.toHex());
+    }
+    async getRandomBlocks(count) {
+        return this.inner.getRandomBlocksFromPool(this.poolId, count);
+    }
+    get(key) {
+        const hash = typeof key === 'string' ? key : key.toHex();
+        const storageKey = (0, brightchain_lib_1.makeStorageKey)(this.poolId, hash);
+        return this.inner.get(storageKey);
+    }
+    async put(key, data, options) {
+        await this.inner.putInPool(this.poolId, data, options);
+    }
+    async delete(key) {
+        const hash = typeof key === 'string' ? key : key.toHex();
+        await this.inner.deleteFromPool(this.poolId, hash);
+    }
+    // === Metadata operations (delegated directly to inner store) ===
+    async getMetadata(key) {
+        return this.inner.getMetadata(key);
+    }
+    async updateMetadata(key, updates) {
+        return this.inner.updateMetadata(key, updates);
+    }
+    // === FEC/Durability operations (delegated directly to inner store) ===
+    async generateParityBlocks(key, parityCount) {
+        return this.inner.generateParityBlocks(key, parityCount);
+    }
+    async getParityBlocks(key) {
+        return this.inner.getParityBlocks(key);
+    }
+    async recoverBlock(key) {
+        return this.inner.recoverBlock(key);
+    }
+    async verifyBlockIntegrity(key) {
+        return this.inner.verifyBlockIntegrity(key);
+    }
+    // === Replication operations (delegated directly to inner store) ===
+    async getBlocksPendingReplication() {
+        return this.inner.getBlocksPendingReplication();
+    }
+    async getUnderReplicatedBlocks() {
+        return this.inner.getUnderReplicatedBlocks();
+    }
+    async recordReplication(key, nodeId) {
+        return this.inner.recordReplication(key, nodeId);
+    }
+    async recordReplicaLoss(key, nodeId) {
+        return this.inner.recordReplicaLoss(key, nodeId);
+    }
+    // === XOR Brightening operations (delegated directly to inner store) ===
+    async brightenBlock(key, randomBlockCount) {
+        return this.inner.brightenBlock(key, randomBlockCount);
+    }
+    // === CBL Whitening operations (delegated through pool) ===
+    async storeCBLWithWhitening(cblData, options) {
+        return this.inner.storeCBLWithWhiteningInPool(this.poolId, cblData, options);
+    }
+    async retrieveCBL(blockId1, blockId2, block1ParityIds, block2ParityIds) {
+        return this.inner.retrieveCBLFromPool(this.poolId, blockId1, blockId2, block1ParityIds, block2ParityIds);
+    }
+    parseCBLMagnetUrl(magnetUrl) {
+        return this.inner.parseCBLMagnetUrl(magnetUrl);
+    }
+    generateCBLMagnetUrl(blockId1, blockId2, blockSize, block1ParityIds, block2ParityIds, isEncrypted) {
+        return this.inner.generateCBLMagnetUrl(blockId1, blockId2, blockSize, block1ParityIds, block2ParityIds, isEncrypted);
+    }
+}
+exports.PooledStoreAdapter = PooledStoreAdapter;
+//# sourceMappingURL=pooledStoreAdapter.js.map

package/src/lib/pooledStoreAdapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pooledStoreAdapter.js","sourceRoot":"","sources":["../../../../brightchain-db/src/lib/pooledStoreAdapter.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAcH,kEAOsC;AAEtC;;;;GAIG;AACH,MAAa,kBAAkB;IAC7B,YACmB,KAAwB,EACxB,MAAc;QADd,UAAK,GAAL,KAAK,CAAmB;QACxB,WAAM,GAAN,MAAM,CAAQ;IAC9B,CAAC;IAEJ,6BAA6B;IAE7B,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;IAC9B,CAAC;IAED,4CAA4C;IAErC,KAAK,CAAC,GAAG,CAAC,GAAsB;QACrC,MAAM,IAAI,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;QACzD,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,GAAa;QAChC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;QACpE,OAAO,IAAI,8BAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAChD,CAAC;IAEM,KAAK,CAAC,OAAO,CAClB,KAAmB,EACnB,OAA2B;QAE3B,MAAM,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAC/D,CAAC;IAEM,KAAK,CAAC,UAAU,CAAC,GAAa;QACnC,MAAM,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;IAC5D,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,KAAa;QACxC,OAAO,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAChE,CAAC;IAEM,GAAG,CAAsB,GAAsB;QACpD,MAAM,IAAI,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;QACzD,MAAM,UAAU,GAAG,IAAA,gCAAc,EAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACrD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAI,UAAU,CAAC,CAAC;IACvC,CAAC;IAEM,KAAK,CAAC,GAAG,CACd,GAAsB,EACtB,IAAgB,EAChB,OAA2B;QAE3B,MAAM,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC;IAEM,KAAK,CAAC,MAAM,CAAC,GAAsB;QACxC,MAAM,IAAI,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;QACzD,MAAM,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACrD,CAAC;IAED,kEAAkE;IAE3D,KAAK,CAAC,WAAW,CACtB,GAAsB;QAEtB,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IAEM,KAAK,CAAC,cAAc,CACzB,GAAsB,EACtB,OAAgC;QAEhC,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACjD,CAAC;IAED,wEAAwE;IAEjE,KAAK,CAAC,oBAAoB,CAC/B,GAAsB,EACtB,WAAmB;QAEnB,OAAO,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAC3D,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,GAAsB;QACjD,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC;IAEM,KAAK,CAAC,YAAY,CAAC,GAAsB;QAC9C,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC;IAEM,KAAK,CAAC,oBAAoB,CAAC,GAAsB;QACtD,OAAO,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC;IAED,qEAAqE;IAE9D,KAAK,CAAC,2BAA2B;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,2BAA2B,EAAE,CAAC;IAClD,CAAC;IAEM,KAAK,CAAC,wBAAwB;QACnC,OAAO,IAAI,CAAC,KAAK,CAAC,wBAAwB,EAAE,CAAC;IAC/C,CAAC;IAEM,KAAK,CAAC,iBAAiB,CAC5B,GAAsB,EACtB,MAAc;QAEd,OAAO,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACnD,CAAC;IAEM,KAAK,CAAC,iBAAiB,CAC5B,GAAsB,EACtB,MAAc;QAEd,OAAO,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACnD,CAAC;IAED,yEAAyE;IAElE,KAAK,CAAC,aAAa,CACxB,GAAsB,EACtB,gBAAwB;QAExB,OAAO,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,EAAE,gBAAgB,CAAC,CAAC;IACzD,CAAC;IAED,4DAA4D;IAErD,KAAK,CAAC,qBAAqB,CAChC,OAAmB,EACnB,OAA6B;QAE7B,OAAO,IAAI,CAAC,KAAK,CAAC,2BAA2B,CAC3C,IAAI,CAAC,MAAM,EACX,OAAO,EACP,OAAO,CACR,CAAC;IACJ,CAAC;IAEM,KAAK,CAAC,WAAW,CACtB,QAA2B,EAC3B,QAA2B,EAC3B,eAA0B,EAC1B,eAA0B;QAE1B,OAAO,IAAI,CAAC,KAAK,CAAC,mBAAmB,CACnC,IAAI,CAAC,MAAM,EACX,QAAQ,EACR,QAAQ,EACR,eAAe,EACf,eAAe,CAChB,CAAC;IACJ,CAAC;IAEM,iBAAiB,CAAC,SAAiB;QACxC,OAAO,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;IACjD,CAAC;IAEM,oBAAoB,CACzB,QAA2B,EAC3B,QAA2B,EAC3B,SAAiB,EACjB,eAA0B,EAC1B,eAA0B,EAC1B,WAAqB;QAErB,OAAO,IAAI,CAAC,KAAK,CAAC,oBAAoB,CACpC,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,eAAe,EACf,eAAe,EACf,WAAW,CACZ,CAAC;IACJ,CAAC;CACF;AAhLD,gDAgLC"}

package/src/lib/queryEngine.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Query engine – evaluates MongoDB-style filter queries against documents.
+ *
+ * Supports:
+ *   - Comparison: $eq, $ne, $gt, $gte, $lt, $lte
+ *   - Set membership: $in, $nin
+ *   - Pattern: $regex
+ *   - Existence: $exists
+ *   - Array: $elemMatch, $size, $all
+ *   - Logical: $and, $or, $nor, $not
+ *   - Type: $type
+ *   - Text: $text / $search (full-text search across indexed fields)
+ */
+import { BsonDocument, FilterQuery } from './types';
+/**
+ * Configure which fields are included in $text search.
+ * Call this before running a filter that contains $text.
+ */
+export declare function setTextSearchFields(fields: string[]): void;
+/**
+ * Get the currently configured text search fields.
+ */
+export declare function getTextSearchFields(): string[];
+/**
+ * Compare two values for ordering (like MongoDB's BSON comparison).
+ * Returns negative if a < b, 0 if equal, positive if a > b.
+ */
+export declare function compareValues(a: unknown, b: unknown): number;
+/**
+ * Deep equality check (handles primitives, arrays, plain objects, Dates).
+ */
+export declare function deepEquals(a: unknown, b: unknown): boolean;
+/**
+ * Check if a document matches a filter query.
+ */
+export declare function matchesFilter<T extends BsonDocument>(doc: T, filter: FilterQuery<T>): boolean;
+/**
+ * Apply projection to a document.
+ */
+export declare function applyProjection<T extends BsonDocument>(doc: T, projection: Record<string, 0 | 1>): Partial<T>;
+/**
+ * Sort an array of documents by a sort specification.
+ */
+export declare function sortDocuments<T extends BsonDocument>(docs: T[], sort: Record<string, 1 | -1>): T[];
+/**
+ * Tokenize a string into lowercase words (basic whitespace + punctuation split).
+ */
+export declare function tokenize(text: string): string[];

package/src/lib/queryEngine.js

@@ -0,0 +1,461 @@
+"use strict";
+/**
+ * Query engine – evaluates MongoDB-style filter queries against documents.
+ *
+ * Supports:
+ *   - Comparison: $eq, $ne, $gt, $gte, $lt, $lte
+ *   - Set membership: $in, $nin
+ *   - Pattern: $regex
+ *   - Existence: $exists
+ *   - Array: $elemMatch, $size, $all
+ *   - Logical: $and, $or, $nor, $not
+ *   - Type: $type
+ *   - Text: $text / $search (full-text search across indexed fields)
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.setTextSearchFields = setTextSearchFields;
+exports.getTextSearchFields = getTextSearchFields;
+exports.compareValues = compareValues;
+exports.deepEquals = deepEquals;
+exports.matchesFilter = matchesFilter;
+exports.applyProjection = applyProjection;
+exports.sortDocuments = sortDocuments;
+exports.tokenize = tokenize;
+/** Reserved operator keys */
+const LOGICAL_OPS = new Set(['$and', '$or', '$nor', '$not']);
+/** Fields to search for $text queries – set by the collection before querying */
+let textSearchFields = [];
+/**
+ * Configure which fields are included in $text search.
+ * Call this before running a filter that contains $text.
+ */
+function setTextSearchFields(fields) {
+    textSearchFields = fields;
+}
+/**
+ * Get the currently configured text search fields.
+ */
+function getTextSearchFields() {
+    return textSearchFields;
+}
+/**
+ * Resolve a potentially nested field path like "address.city" on a document.
+ */
+function getNestedValue(doc, path) {
+    const parts = path.split('.');
+    let current = doc;
+    for (const part of parts) {
+        if (current === null || current === undefined)
+            return undefined;
+        if (Array.isArray(current)) {
+            const idx = Number(part);
+            if (!Number.isNaN(idx)) {
+                current = current[idx];
+            }
+            else {
+                // Array implicit iteration – match any element
+                const results = current
+                    .map((item) => typeof item === 'object' && item !== null
+                    ? item[part]
+                    : undefined)
+                    .filter((v) => v !== undefined);
+                return results.length === 1
+                    ? results[0]
+                    : results.length > 0
+                        ? results
+                        : undefined;
+            }
+        }
+        else if (typeof current === 'object') {
+            current = current[part];
+        }
+        else {
+            return undefined;
+        }
+    }
+    return current;
+}
+/**
+ * Compare two values for ordering (like MongoDB's BSON comparison).
+ * Returns negative if a < b, 0 if equal, positive if a > b.
+ */
+function compareValues(a, b) {
+    if (a === b)
+        return 0;
+    if (a === null || a === undefined)
+        return -1;
+    if (b === null || b === undefined)
+        return 1;
+    if (typeof a === 'number' && typeof b === 'number')
+        return a - b;
+    if (typeof a === 'string' && typeof b === 'string')
+        return a.localeCompare(b);
+    if (typeof a === 'boolean' && typeof b === 'boolean')
+        return a === b ? 0 : a ? 1 : -1;
+    if (a instanceof Date && b instanceof Date)
+        return a.getTime() - b.getTime();
+    // Fallback: stringify comparison
+    return String(a).localeCompare(String(b));
+}
+/**
+ * Check if a value matches a filter operator object.
+ */
+function matchOperator(value, op) {
+    for (const [key, operand] of Object.entries(op)) {
+        switch (key) {
+            case '$eq':
+                if (!deepEquals(value, operand))
+                    return false;
+                break;
+            case '$ne':
+                if (deepEquals(value, operand))
+                    return false;
+                break;
+            case '$gt':
+                if (compareValues(value, operand) <= 0)
+                    return false;
+                break;
+            case '$gte':
+                if (compareValues(value, operand) < 0)
+                    return false;
+                break;
+            case '$lt':
+                if (compareValues(value, operand) >= 0)
+                    return false;
+                break;
+            case '$lte':
+                if (compareValues(value, operand) > 0)
+                    return false;
+                break;
+            case '$in': {
+                const arr = operand;
+                if (!arr.some((item) => deepEquals(value, item)))
+                    return false;
+                break;
+            }
+            case '$nin': {
+                const arr = operand;
+                if (arr.some((item) => deepEquals(value, item)))
+                    return false;
+                break;
+            }
+            case '$regex': {
+                if (typeof value !== 'string')
+                    return false;
+                const re = operand instanceof RegExp ? operand : new RegExp(operand);
+                if (!re.test(value))
+                    return false;
+                break;
+            }
+            case '$exists':
+                if (operand && value === undefined)
+                    return false;
+                if (!operand && value !== undefined)
+                    return false;
+                break;
+            case '$not':
+                if (matchOperator(value, operand))
+                    return false;
+                break;
+            case '$elemMatch': {
+                if (!Array.isArray(value))
+                    return false;
+                const subFilter = operand;
+                if (!value.some((elem) => matchesFilter(elem, subFilter))) {
+                    return false;
+                }
+                break;
+            }
+            case '$size':
+                if (!Array.isArray(value) || value.length !== operand)
+                    return false;
+                break;
+            case '$all': {
+                if (!Array.isArray(value))
+                    return false;
+                const allItems = operand;
+                if (!allItems.every((item) => value.some((v) => deepEquals(v, item))))
+                    return false;
+                break;
+            }
+            case '$type': {
+                const expectedType = operand;
+                if (!matchesType(value, expectedType))
+                    return false;
+                break;
+            }
+            default:
+                // Unknown operator – ignore
+                break;
+        }
+    }
+    return true;
+}
+function matchesType(value, expectedType) {
+    switch (expectedType) {
+        case 'string':
+            return typeof value === 'string';
+        case 'number':
+        case 'int':
+        case 'long':
+        case 'double':
+        case 'decimal':
+            return typeof value === 'number';
+        case 'bool':
+            return typeof value === 'boolean';
+        case 'object':
+            return (typeof value === 'object' && value !== null && !Array.isArray(value));
+        case 'array':
+            return Array.isArray(value);
+        case 'null':
+            return value === null;
+        case 'date':
+            return value instanceof Date;
+        case 'undefined':
+            return value === undefined;
+        default:
+            return typeof value === expectedType;
+    }
+}
+/**
+ * Deep equality check (handles primitives, arrays, plain objects, Dates).
+ */
+function deepEquals(a, b) {
+    if (a === b)
+        return true;
+    if (a === null || b === null || a === undefined || b === undefined)
+        return a === b;
+    if (typeof a !== typeof b)
+        return false;
+    if (a instanceof Date && b instanceof Date)
+        return a.getTime() === b.getTime();
+    if (Array.isArray(a) && Array.isArray(b)) {
+        if (a.length !== b.length)
+            return false;
+        return a.every((item, i) => deepEquals(item, b[i]));
+    }
+    if (typeof a === 'object' && typeof b === 'object') {
+        const keysA = Object.keys(a);
+        const keysB = Object.keys(b);
+        if (keysA.length !== keysB.length)
+            return false;
+        return keysA.every((k) => deepEquals(a[k], b[k]));
+    }
+    return false;
+}
+/**
+ * Check if a document matches a filter query.
+ */
+function matchesFilter(doc, filter) {
+    for (const [key, condition] of Object.entries(filter)) {
+        // Handle logical operators at the top level
+        if (key === '$and') {
+            const clauses = condition;
+            if (!clauses.every((clause) => matchesFilter(doc, clause)))
+                return false;
+            continue;
+        }
+        if (key === '$or') {
+            const clauses = condition;
+            if (!clauses.some((clause) => matchesFilter(doc, clause)))
+                return false;
+            continue;
+        }
+        if (key === '$nor') {
+            const clauses = condition;
+            if (clauses.some((clause) => matchesFilter(doc, clause)))
+                return false;
+            continue;
+        }
+        if (key === '$not') {
+            if (matchesFilter(doc, condition))
+                return false;
+            continue;
+        }
+        if (key === '$text') {
+            const textSpec = condition;
+            const searchStr = textSpec['$search'] ?? '';
+            if (!matchesTextSearch(doc, searchStr))
+                return false;
+            continue;
+        }
+        if (LOGICAL_OPS.has(key))
+            continue;
+        const value = getNestedValue(doc, key);
+        if (condition !== null &&
+            typeof condition === 'object' &&
+            !Array.isArray(condition) &&
+            !(condition instanceof RegExp) &&
+            !(condition instanceof Date)) {
+            // Check if any keys look like operators
+            const condObj = condition;
+            const hasOps = Object.keys(condObj).some((k) => k.startsWith('$'));
+            if (hasOps) {
+                if (!matchOperator(value, condObj))
+                    return false;
+                continue;
+            }
+        }
+        // Exact match – if the value is in an array, match against array elements (MongoDB behavior)
+        if (Array.isArray(value)) {
+            if (!value.some((v) => deepEquals(v, condition)) &&
+                !deepEquals(value, condition)) {
+                return false;
+            }
+        }
+        else {
+            if (!deepEquals(value, condition))
+                return false;
+        }
+    }
+    return true;
+}
+/**
+ * Apply projection to a document.
+ */
+function applyProjection(doc, projection) {
+    const keys = Object.keys(projection);
+    if (keys.length === 0)
+        return { ...doc };
+    const isInclusion = Object.values(projection).some((v) => v === 1);
+    const result = {};
+    if (isInclusion) {
+        // Always include _id unless explicitly excluded
+        if (projection['_id'] !== 0) {
+            result['_id'] = doc._id;
+        }
+        for (const key of keys) {
+            if (key === '_id')
+                continue;
+            if (projection[key] === 1) {
+                result[key] = getNestedValue(doc, key);
+            }
+        }
+    }
+    else {
+        // Exclusion mode – include everything except excluded fields
+        for (const [k, v] of Object.entries(doc)) {
+            if (projection[k] === 0)
+                continue;
+            result[k] = v;
+        }
+    }
+    return result;
+}
+/**
+ * Sort an array of documents by a sort specification.
+ */
+function sortDocuments(docs, sort) {
+    const sortEntries = Object.entries(sort);
+    if (sortEntries.length === 0)
+        return docs;
+    return [...docs].sort((a, b) => {
+        for (const [field, direction] of sortEntries) {
+            const va = getNestedValue(a, field);
+            const vb = getNestedValue(b, field);
+            const cmp = compareValues(va, vb);
+            if (cmp !== 0)
+                return cmp * direction;
+        }
+        return 0;
+    });
+}
+// ── Text search ──
+/**
+ * Tokenize a string into lowercase words (basic whitespace + punctuation split).
+ */
+function tokenize(text) {
+    return text
+        .toLowerCase()
+        .replace(/[^\w\s]/g, ' ')
+        .split(/\s+/)
+        .filter(Boolean);
+}
+/**
+ * Check whether a document matches a `$text: { $search: ... }` query.
+ *
+ * When `textSearchFields` is configured, only those fields are searched.
+ * Otherwise falls back to searching all string fields in the document.
+ *
+ * Supports:
+ *   - Multiple search terms (OR semantics – any token match)
+ *   - Quoted phrases for exact substring matching: `"hello world"`
+ *   - Negation with minus prefix: `-unwanted`
+ */
+function matchesTextSearch(doc, search) {
+    if (!search)
+        return true;
+    // Collect text from document
+    const fieldsToSearch = textSearchFields.length > 0 ? textSearchFields : null;
+    const docText = extractText(doc, fieldsToSearch).toLowerCase();
+    // Parse search string: quoted phrases, negated terms, and regular terms
+    const phrases = [];
+    const negated = [];
+    const tokens = [];
+    // Extract quoted phrases
+    const quoteRegex = /"([^"]+)"/g;
+    let cleaned = search;
+    let match;
+    while ((match = quoteRegex.exec(search)) !== null) {
+        phrases.push(match[1].toLowerCase());
+    }
+    cleaned = cleaned.replace(quoteRegex, '').trim();
+    // Split remaining into tokens
+    for (const word of cleaned.split(/\s+/).filter(Boolean)) {
+        if (word.startsWith('-') && word.length > 1) {
+            negated.push(word.slice(1).toLowerCase());
+        }
+        else {
+            tokens.push(word.toLowerCase());
+        }
+    }
+    // Check negated terms (must NOT appear)
+    for (const neg of negated) {
+        if (docText.includes(neg))
+            return false;
+    }
+    // Check quoted phrases (must appear as substring)
+    for (const phrase of phrases) {
+        if (!docText.includes(phrase))
+            return false;
+    }
+    // Check tokens (at least one must match, or if no tokens – phrases already matched)
+    if (tokens.length > 0) {
+        const docTokens = new Set(tokenize(docText));
+        if (!tokens.some((t) => docTokens.has(t)))
+            return false;
+    }
+    return true;
+}
+/**
+ * Extract all text content from a document for full-text search.
+ */
+function extractText(obj, fields, prefix = '') {
+    const parts = [];
+    for (const [key, value] of Object.entries(obj)) {
+        const path = prefix ? `${prefix}.${key}` : key;
+        if (fields &&
+            !fields.some((f) => path.startsWith(f) || f.startsWith(path))) {
+            continue;
+        }
+        if (typeof value === 'string') {
+            parts.push(value);
+        }
+        else if (Array.isArray(value)) {
+            for (const item of value) {
+                if (typeof item === 'string')
+                    parts.push(item);
+                else if (typeof item === 'object' && item !== null) {
+                    parts.push(extractText(item, fields, path));
+                }
+            }
+        }
+        else if (typeof value === 'object' &&
+            value !== null &&
+            !(value instanceof Date)) {
+            parts.push(extractText(value, fields, path));
+        }
+    }
+    return parts.join(' ');
+}
+//# sourceMappingURL=queryEngine.js.map