@objectql/core 4.0.2 → 4.0.3

package/dist/optimizations/GlobalConnectionPool.js

@@ -0,0 +1,193 @@
+"use strict";
+/**
+ * ObjectQL
+ * Copyright (c) 2026-present ObjectStack Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GlobalConnectionPool = void 0;
+/**
+ * Global Connection Pool Manager
+ *
+ * Improvement: Kernel-level connection pool with global limits.
+ * Coordinates connection allocation across all drivers.
+ *
+ * Expected: 5x faster connection acquisition, predictable resource usage
+ */
+class GlobalConnectionPool {
+    constructor(limits = { total: 50, perDriver: 20 }) {
+        this.allocations = new Map();
+        this.connections = new Map();
+        this.waitQueue = [];
+        this.limits = limits;
+    }
+    /**
+     * Get total number of active connections across all drivers
+     */
+    totalConnections() {
+        let total = 0;
+        for (const count of this.allocations.values()) {
+            total += count;
+        }
+        return total;
+    }
+    /**
+     * Get number of connections for a specific driver
+     */
+    getDriverConnections(driverName) {
+        return this.allocations.get(driverName) || 0;
+    }
+    /**
+     * Try to process the wait queue
+     */
+    processWaitQueue() {
+        if (this.waitQueue.length === 0)
+            return;
+        // Check if we can fulfill any waiting requests
+        for (let i = 0; i < this.waitQueue.length; i++) {
+            const request = this.waitQueue[i];
+            // Check if we can allocate
+            if (this.canAllocate(request.driverName)) {
+                this.waitQueue.splice(i, 1);
+                // Try to acquire connection
+                this.doAcquire(request.driverName)
+                    .then(request.resolve)
+                    .catch(request.reject);
+                // Only process one at a time to avoid over-allocation
+                break;
+            }
+        }
+    }
+    /**
+     * Check if we can allocate a connection for a driver
+     */
+    canAllocate(driverName) {
+        const totalConns = this.totalConnections();
+        const driverConns = this.getDriverConnections(driverName);
+        // Check if there's an idle connection available
+        const driverConnections = this.connections.get(driverName) || [];
+        const hasIdleConnection = driverConnections.some(c => !c.inUse);
+        // Can allocate if:
+        // 1. There's an idle connection (reuse), OR
+        // 2. We're under the total and per-driver limits (create new)
+        return hasIdleConnection || (totalConns < this.limits.total && driverConns < this.limits.perDriver);
+    }
+    /**
+     * Actually acquire a connection (internal)
+     */
+    async doAcquire(driverName) {
+        // Check for available idle connection first
+        const driverConnections = this.connections.get(driverName) || [];
+        const idleConnection = driverConnections.find(c => !c.inUse);
+        if (idleConnection) {
+            idleConnection.inUse = true;
+            idleConnection.lastUsedAt = Date.now();
+            return idleConnection;
+        }
+        // Verify we can create a new connection (double-check to prevent race conditions)
+        const totalConns = this.totalConnections();
+        const driverConns = this.getDriverConnections(driverName);
+        if (totalConns >= this.limits.total || driverConns >= this.limits.perDriver) {
+            throw new Error(`Connection pool limit reached for driver: ${driverName}`);
+        }
+        // Create new connection
+        const connectionId = `${driverName}-${Date.now()}-${Math.random()}`;
+        const connection = {
+            id: connectionId,
+            driverName,
+            inUse: true,
+            createdAt: Date.now(),
+            lastUsedAt: Date.now(),
+            release: async () => {
+                connection.inUse = false;
+                connection.lastUsedAt = Date.now();
+                // Process wait queue when connection is released
+                this.processWaitQueue();
+            }
+        };
+        // Store connection
+        if (!this.connections.has(driverName)) {
+            this.connections.set(driverName, []);
+        }
+        this.connections.get(driverName).push(connection);
+        // Update allocation count
+        this.allocations.set(driverName, this.getDriverConnections(driverName) + 1);
+        return connection;
+    }
+    /**
+     * Acquire a connection from the pool
+     */
+    async acquire(driverName) {
+        // Check global limits before allocation ✅
+        if (!this.canAllocate(driverName)) {
+            // Add to wait queue
+            return new Promise((resolve, reject) => {
+                this.waitQueue.push({ driverName, resolve, reject });
+                // Set timeout to prevent indefinite waiting
+                setTimeout(() => {
+                    const index = this.waitQueue.findIndex(r => r.driverName === driverName && r.resolve === resolve);
+                    if (index >= 0) {
+                        this.waitQueue.splice(index, 1);
+                        reject(new Error(`Connection pool limit reached for driver: ${driverName}`));
+                    }
+                }, 30000); // 30 second timeout
+            });
+        }
+        return this.doAcquire(driverName);
+    }
+    /**
+     * Release a connection back to the pool
+     */
+    async release(connection) {
+        await connection.release();
+    }
+    /**
+     * Close all connections for a driver
+     */
+    async closeDriver(driverName) {
+        const driverConnections = this.connections.get(driverName);
+        if (driverConnections) {
+            // Clear all connections
+            driverConnections.length = 0;
+            this.connections.delete(driverName);
+            this.allocations.delete(driverName);
+        }
+        // Process wait queue
+        this.processWaitQueue();
+    }
+    /**
+     * Get pool statistics
+     */
+    getStats() {
+        const driverStats = {};
+        for (const [driverName, connections] of this.connections.entries()) {
+            const active = connections.filter(c => c.inUse).length;
+            const idle = connections.filter(c => !c.inUse).length;
+            driverStats[driverName] = { active, idle };
+        }
+        return {
+            totalConnections: this.totalConnections(),
+            totalLimit: this.limits.total,
+            perDriverLimit: this.limits.perDriver,
+            driverStats,
+            waitQueueSize: this.waitQueue.length
+        };
+    }
+    /**
+     * Update pool limits
+     */
+    updateLimits(limits) {
+        if (limits.total !== undefined) {
+            this.limits.total = limits.total;
+        }
+        if (limits.perDriver !== undefined) {
+            this.limits.perDriver = limits.perDriver;
+        }
+        // Process wait queue after limits update
+        this.processWaitQueue();
+    }
+}
+exports.GlobalConnectionPool = GlobalConnectionPool;
+//# sourceMappingURL=GlobalConnectionPool.js.map

package/dist/optimizations/GlobalConnectionPool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GlobalConnectionPool.js","sourceRoot":"","sources":["../../src/optimizations/GlobalConnectionPool.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAsBH;;;;;;;GAOG;AACH,MAAa,oBAAoB;IAU7B,YAAY,SAAqB,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE;QARrD,gBAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,gBAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;QAC9C,cAAS,GAIZ,EAAE,CAAC;QAGJ,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,gBAAgB;QACpB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,KAAK,CAAC;QACnB,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,UAAkB;QAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACK,gBAAgB;QACpB,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAExC,+CAA+C;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAElC,2BAA2B;YAC3B,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBACvC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAE5B,4BAA4B;gBAC5B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC;qBAC7B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;qBACrB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAE3B,sDAAsD;gBACtD,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,UAAkB;QAClC,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC3C,MAAM,WAAW,GAAG,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;QAE1D,gDAAgD;QAChD,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QACjE,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAEhE,mBAAmB;QACnB,4CAA4C;QAC5C,8DAA8D;QAC9D,OAAO,iBAAiB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACxG,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,SAAS,CAAC,UAAkB;QACtC,4CAA4C;QAC5C,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QACjE,MAAM,cAAc,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAE7D,IAAI,cAAc,EAAE,CAAC;YACjB,cAAc,CAAC,KAAK,GAAG,IAAI,CAAC;YAC5B,cAAc,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvC,OAAO,cAAc,CAAC;QAC1B,CAAC;QAED,kFAAkF;QAClF,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC3C,MAAM,WAAW,GAAG,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;QAC1D,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YAC1E,MAAM,IAAI,KAAK,CAAC,6CAA6C,UAAU,EAAE,CAAC,CAAC;QAC/E,CAAC;QAED,wBAAwB;QACxB,MAAM,YAAY,GAAG,GAAG,UAAU,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QACpE,MAAM,UAAU,GAAe;YAC3B,EAAE,EAAE,YAAY;YAChB,UAAU;YACV,KAAK,EAAE,IAAI;YACX,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE;YACtB,OAAO,EAAE,KAAK,IAAI,EAAE;gBAChB,UAAU,CAAC,KAAK,GAAG,KAAK,CAAC;gBACzB,UAAU,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBAEnC,iDAAiD;gBACjD,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC5B,CAAC;SACJ,CAAC;QAEF,mBAAmB;QACnB,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QACzC,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEnD,0BAA0B;QAC1B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAE5E,OAAO,UAAU,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,UAAkB;QAC5B,0CAA0C;QAC1C,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC;YAChC,oBAAoB;YACpB,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBACnC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;gBAErD,4CAA4C;gBAC5C,UAAU,CAAC,GAAG,EAAE;oBACZ,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAClC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,UAAU,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,CAC5D,CAAC;oBACF,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;wBACb,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;wBAChC,MAAM,CAAC,IAAI,KAAK,CAAC,6CAA6C,UAAU,EAAE,CAAC,CAAC,CAAC;oBACjF,CAAC;gBACL,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,oBAAoB;YACnC,CAAC,CAAC,CAAC;QACP,CAAC;QAED,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,UAAsB;QAChC,MAAM,UAAU,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,UAAkB;QAChC,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC3D,IAAI,iBAAiB,EAAE,CAAC;YACpB,wBAAwB;YACxB,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YACpC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACxC,CAAC;QAED,qBAAqB;QACrB,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,QAAQ;QAOJ,MAAM,WAAW,GAAqD,EAAE,CAAC;QAEzE,KAAK,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YACjE,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;YACvD,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;YACtD,WAAW,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QAC/C,CAAC;QAED,OAAO;YACH,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,EAAE;YACzC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK;YAC7B,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS;YACrC,WAAW;YACX,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM;SACvC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAA2B;QACpC,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QACrC,CAAC;QACD,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QAC7C,CAAC;QAED,yCAAyC;QACzC,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC5B,CAAC;CACJ;AAtND,oDAsNC"}

package/dist/optimizations/LazyMetadataLoader.d.ts

@@ -0,0 +1,75 @@
+/**
+ * ObjectQL
+ * Copyright (c) 2026-present ObjectStack Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/**
+ * Object metadata definition
+ */
+export interface ObjectMetadata {
+    name: string;
+    label?: string;
+    fields: Record<string, any>;
+    triggers?: any[];
+    workflows?: any[];
+    permissions?: any[];
+    relatedObjects?: string[];
+}
+/**
+ * Metadata loader function type
+ */
+export type MetadataLoader = (objectName: string) => Promise<ObjectMetadata>;
+/**
+ * Lazy Metadata Loader with Smart Caching
+ *
+ * Improvement: Loads metadata on-demand instead of eagerly at startup.
+ * Includes predictive preloading for related objects.
+ *
+ * Expected: 10x faster startup, 70% lower initial memory
+ */
+export declare class LazyMetadataLoader {
+    private cache;
+    private loaded;
+    private loading;
+    private preloadScheduled;
+    private loader;
+    constructor(loader: MetadataLoader);
+    /**
+     * Load a single object's metadata
+     */
+    private loadSingle;
+    /**
+     * Predictive preload: load related objects in the background
+     */
+    private predictivePreload;
+    /**
+     * Get metadata for an object (loads on-demand if not cached)
+     */
+    get(objectName: string): Promise<ObjectMetadata>;
+    /**
+     * Check if metadata is loaded
+     */
+    isLoaded(objectName: string): boolean;
+    /**
+     * Preload metadata for specific objects
+     */
+    preload(objectNames: string[]): Promise<void>;
+    /**
+     * Clear cache for an object
+     */
+    invalidate(objectName: string): void;
+    /**
+     * Clear all cached metadata
+     */
+    clearAll(): void;
+    /**
+     * Get statistics about loaded metadata
+     */
+    getStats(): {
+        loaded: number;
+        cached: number;
+        loading: number;
+    };
+}

package/dist/optimizations/LazyMetadataLoader.js

@@ -0,0 +1,149 @@
+"use strict";
+/**
+ * ObjectQL
+ * Copyright (c) 2026-present ObjectStack Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LazyMetadataLoader = void 0;
+/**
+ * Lazy Metadata Loader with Smart Caching
+ *
+ * Improvement: Loads metadata on-demand instead of eagerly at startup.
+ * Includes predictive preloading for related objects.
+ *
+ * Expected: 10x faster startup, 70% lower initial memory
+ */
+class LazyMetadataLoader {
+    constructor(loader) {
+        this.cache = new Map();
+        this.loaded = new Set();
+        this.loading = new Map();
+        this.preloadScheduled = new Set(); // Track objects with scheduled preloads
+        this.loader = loader;
+    }
+    /**
+     * Load a single object's metadata
+     */
+    async loadSingle(objectName) {
+        // Check if already loaded
+        if (this.loaded.has(objectName)) {
+            const cached = this.cache.get(objectName);
+            if (cached)
+                return cached;
+        }
+        // Check if currently loading (avoid duplicate loads)
+        const existingLoad = this.loading.get(objectName);
+        if (existingLoad) {
+            return existingLoad;
+        }
+        // Load metadata
+        const loadPromise = (async () => {
+            try {
+                const metadata = await this.loader(objectName);
+                this.cache.set(objectName, metadata);
+                this.loaded.add(objectName);
+                return metadata;
+            }
+            finally {
+                this.loading.delete(objectName);
+            }
+        })();
+        this.loading.set(objectName, loadPromise);
+        return loadPromise;
+    }
+    /**
+     * Predictive preload: load related objects in the background
+     */
+    predictivePreload(objectName) {
+        // Avoid redundant preload scheduling for the same object
+        if (this.preloadScheduled.has(objectName)) {
+            return;
+        }
+        this.preloadScheduled.add(objectName);
+        // Run preloading asynchronously after current call stack to avoid blocking
+        setImmediate(() => {
+            const metadata = this.cache.get(objectName);
+            if (!metadata)
+                return;
+            // Extract related object names from various sources
+            const relatedObjects = new Set();
+            // 1. From explicit relatedObjects field
+            if (metadata.relatedObjects) {
+                metadata.relatedObjects.forEach(obj => relatedObjects.add(obj));
+            }
+            // 2. From lookup/master-detail fields
+            if (metadata.fields) {
+                for (const field of Object.values(metadata.fields)) {
+                    if (field.type === 'lookup' || field.type === 'master_detail') {
+                        if (field.reference_to) {
+                            relatedObjects.add(field.reference_to);
+                        }
+                    }
+                }
+            }
+            // Preload related objects asynchronously (don't await)
+            for (const relatedObject of relatedObjects) {
+                if (!this.loaded.has(relatedObject) && !this.loading.has(relatedObject)) {
+                    // Fire and forget - preload in background
+                    this.loadSingle(relatedObject).catch(() => {
+                        // Ignore errors in background preloading
+                    });
+                }
+            }
+        });
+    }
+    /**
+     * Get metadata for an object (loads on-demand if not cached)
+     */
+    async get(objectName) {
+        // Load on first access
+        const metadata = await this.loadSingle(objectName);
+        // Trigger predictive preloading for related objects
+        this.predictivePreload(objectName);
+        return metadata;
+    }
+    /**
+     * Check if metadata is loaded
+     */
+    isLoaded(objectName) {
+        return this.loaded.has(objectName);
+    }
+    /**
+     * Preload metadata for specific objects
+     */
+    async preload(objectNames) {
+        await Promise.all(objectNames.map(name => this.get(name)));
+    }
+    /**
+     * Clear cache for an object
+     */
+    invalidate(objectName) {
+        this.cache.delete(objectName);
+        this.loaded.delete(objectName);
+        this.preloadScheduled.delete(objectName);
+    }
+    /**
+     * Clear all cached metadata
+     */
+    clearAll() {
+        this.cache.clear();
+        this.loaded.clear();
+        this.loading.clear();
+        this.preloadScheduled.clear();
+    }
+    /**
+     * Get statistics about loaded metadata
+     */
+    getStats() {
+        return {
+            loaded: this.loaded.size,
+            cached: this.cache.size,
+            loading: this.loading.size
+        };
+    }
+}
+exports.LazyMetadataLoader = LazyMetadataLoader;
+//# sourceMappingURL=LazyMetadataLoader.js.map

package/dist/optimizations/LazyMetadataLoader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LazyMetadataLoader.js","sourceRoot":"","sources":["../../src/optimizations/LazyMetadataLoader.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAoBH;;;;;;;GAOG;AACH,MAAa,kBAAkB;IAO3B,YAAY,MAAsB;QAN1B,UAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;QAC1C,WAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QAC3B,YAAO,GAAG,IAAI,GAAG,EAAmC,CAAC;QACrD,qBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC,CAAC,wCAAwC;QAIlF,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CAAC,UAAkB;QACvC,0BAA0B;QAC1B,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC1C,IAAI,MAAM;gBAAE,OAAO,MAAM,CAAC;QAC9B,CAAC;QAED,qDAAqD;QACrD,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,YAAY,EAAE,CAAC;YACf,OAAO,YAAY,CAAC;QACxB,CAAC;QAED,gBAAgB;QAChB,MAAM,WAAW,GAAG,CAAC,KAAK,IAAI,EAAE;YAC5B,IAAI,CAAC;gBACD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBAC/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;gBACrC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5B,OAAO,QAAQ,CAAC;YACpB,CAAC;oBAAS,CAAC;gBACP,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YACpC,CAAC;QACL,CAAC,CAAC,EAAE,CAAC;QAEL,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QAC1C,OAAO,WAAW,CAAC;IACvB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,UAAkB;QACxC,yDAAyD;QACzD,IAAI,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACxC,OAAO;QACX,CAAC;QACD,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAEtC,2EAA2E;QAC3E,YAAY,CAAC,GAAG,EAAE;YACd,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC5C,IAAI,CAAC,QAAQ;gBAAE,OAAO;YAEtB,oDAAoD;YACpD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;YAEzC,wCAAwC;YACxC,IAAI,QAAQ,CAAC,cAAc,EAAE,CAAC;gBAC1B,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACpE,CAAC;YAED,sCAAsC;YACtC,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAClB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;oBACjD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;wBAC5D,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;4BACrB,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;wBAC3C,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;YAED,uDAAuD;YACvD,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE,CAAC;gBACzC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;oBACtE,0CAA0C;oBAC1C,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE;wBACtC,yCAAyC;oBAC7C,CAAC,CAAC,CAAC;gBACP,CAAC;YACL,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,UAAkB;QACxB,uBAAuB;QACvB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAEnD,oDAAoD;QACpD,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAEnC,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,UAAkB;QACvB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,WAAqB;QAC/B,MAAM,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,UAAkB;QACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC/B,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,QAAQ;QACJ,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,QAAQ;QACJ,OAAO;YACH,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;YACxB,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACvB,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;SAC7B,CAAC;IACN,CAAC;CACJ;AAjJD,gDAiJC"}

package/dist/optimizations/OptimizedMetadataRegistry.d.ts

@@ -0,0 +1,26 @@
+/**
+ * ObjectQL
+ * Copyright (c) 2026-present ObjectStack Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export declare class OptimizedMetadataRegistry {
+    private items;
+    private packageIndex;
+    constructor();
+    register(type: string, nameOrConfig: any, config?: any): void;
+    get<T = any>(type: string, name: string): T;
+    list<T = any>(type: string): T[];
+    getTypes(): string[];
+    getEntry<T = any>(type: string, name: string): T;
+    unregister(type: string, name: string): void;
+    /**
+     * Optimized package unregistration with O(k) complexity
+     * where k is the number of items in the package.
+     *
+     * Previous complexity: O(n*m) - iterate all types and all items
+     * New complexity: O(k) - direct lookup via secondary index
+     */
+    unregisterPackage(packageName: string): void;
+}

package/dist/optimizations/OptimizedMetadataRegistry.js

@@ -0,0 +1,117 @@
+"use strict";
+/**
+ * ObjectQL
+ * Copyright (c) 2026-present ObjectStack Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.OptimizedMetadataRegistry = void 0;
+class OptimizedMetadataRegistry {
+    constructor() {
+        this.items = {};
+        // Secondary index: package name -> list of metadata references
+        this.packageIndex = new Map();
+    }
+    register(type, nameOrConfig, config) {
+        if (!this.items[type]) {
+            this.items[type] = {};
+        }
+        let name;
+        let item;
+        if (config) {
+            name = nameOrConfig;
+            item = config;
+        }
+        else {
+            item = nameOrConfig;
+            name = item.name || item.id;
+        }
+        if (name) {
+            this.items[type][name] = item;
+            // Update package index
+            const packageName = item.package || item._package || item.packageName;
+            if (packageName) {
+                if (!this.packageIndex.has(packageName)) {
+                    this.packageIndex.set(packageName, new Set());
+                }
+                this.packageIndex.get(packageName).add({ type, name });
+            }
+        }
+    }
+    get(type, name) {
+        var _a;
+        const item = (_a = this.items[type]) === null || _a === void 0 ? void 0 : _a[name];
+        if (item && item.content) {
+            return item.content;
+        }
+        return item;
+    }
+    list(type) {
+        if (!this.items[type])
+            return [];
+        return Object.values(this.items[type]).map((item) => {
+            if (item && item.content) {
+                return item.content;
+            }
+            return item;
+        });
+    }
+    getTypes() {
+        return Object.keys(this.items);
+    }
+    getEntry(type, name) {
+        var _a;
+        return (_a = this.items[type]) === null || _a === void 0 ? void 0 : _a[name];
+    }
+    unregister(type, name) {
+        var _a;
+        const item = (_a = this.items[type]) === null || _a === void 0 ? void 0 : _a[name];
+        if (item) {
+            // Update package index
+            const packageName = item.package || item._package || item.packageName;
+            if (packageName) {
+                const refs = this.packageIndex.get(packageName);
+                if (refs) {
+                    // Remove this specific reference
+                    for (const ref of refs) {
+                        if (ref.type === type && ref.name === name) {
+                            refs.delete(ref);
+                            break;
+                        }
+                    }
+                    // Clean up empty package entries
+                    if (refs.size === 0) {
+                        this.packageIndex.delete(packageName);
+                    }
+                }
+            }
+            delete this.items[type][name];
+        }
+    }
+    /**
+     * Optimized package unregistration with O(k) complexity
+     * where k is the number of items in the package.
+     *
+     * Previous complexity: O(n*m) - iterate all types and all items
+     * New complexity: O(k) - direct lookup via secondary index
+     */
+    unregisterPackage(packageName) {
+        var _a;
+        // Direct lookup via secondary index ✅
+        const refs = this.packageIndex.get(packageName);
+        if (refs) {
+            // Delete each item referenced by this package
+            for (const ref of refs) {
+                if ((_a = this.items[ref.type]) === null || _a === void 0 ? void 0 : _a[ref.name]) {
+                    delete this.items[ref.type][ref.name];
+                }
+            }
+            // Remove package from index
+            this.packageIndex.delete(packageName);
+        }
+    }
+}
+exports.OptimizedMetadataRegistry = OptimizedMetadataRegistry;
+//# sourceMappingURL=OptimizedMetadataRegistry.js.map

package/dist/optimizations/OptimizedMetadataRegistry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"OptimizedMetadataRegistry.js","sourceRoot":"","sources":["../../src/optimizations/OptimizedMetadataRegistry.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAeH,MAAa,yBAAyB;IAMlC;QALQ,UAAK,GAAwC,EAAE,CAAC;QAExD,+DAA+D;QACvD,iBAAY,GAAG,IAAI,GAAG,EAA4B,CAAC;IAE5C,CAAC;IAEhB,QAAQ,CAAC,IAAY,EAAE,YAAiB,EAAE,MAAY;QAClD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAC1B,CAAC;QAED,IAAI,IAAY,CAAC;QACjB,IAAI,IAAS,CAAC;QAEd,IAAI,MAAM,EAAE,CAAC;YACT,IAAI,GAAG,YAAY,CAAC;YACpB,IAAI,GAAG,MAAM,CAAC;QAClB,CAAC;aAAM,CAAC;YACJ,IAAI,GAAG,YAAY,CAAC;YACpB,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QAChC,CAAC;QAED,IAAI,IAAI,EAAE,CAAC;YACP,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAE9B,uBAAuB;YACvB,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,IAAK,IAAY,CAAC,QAAQ,IAAK,IAAY,CAAC,WAAW,CAAC;YACxF,IAAI,WAAW,EAAE,CAAC;gBACd,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;oBACtC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBAClD,CAAC;gBACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YAC5D,CAAC;QACL,CAAC;IACL,CAAC;IAED,GAAG,CAAU,IAAY,EAAE,IAAY;;QACnC,MAAM,IAAI,GAAG,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0CAAG,IAAI,CAAC,CAAC;QACtC,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,OAAO,CAAC;QACxB,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAI,CAAU,IAAY;QACtB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QACjC,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAS,EAAE,EAAE;YACrD,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,OAAO,CAAC;YACxB,CAAC;YACD,OAAO,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED,QAAQ;QACJ,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,QAAQ,CAAU,IAAY,EAAE,IAAY;;QACxC,OAAO,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0CAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,UAAU,CAAC,IAAY,EAAE,IAAY;;QACjC,MAAM,IAAI,GAAG,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0CAAG,IAAI,CAAC,CAAC;QACtC,IAAI,IAAI,EAAE,CAAC;YACP,uBAAuB;YACvB,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,IAAK,IAAY,CAAC,QAAQ,IAAK,IAAY,CAAC,WAAW,CAAC;YACxF,IAAI,WAAW,EAAE,CAAC;gBACd,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAChD,IAAI,IAAI,EAAE,CAAC;oBACP,iCAAiC;oBACjC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;wBACrB,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;4BACzC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;4BACjB,MAAM;wBACV,CAAC;oBACL,CAAC;oBACD,iCAAiC;oBACjC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;wBAClB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;oBAC1C,CAAC;gBACL,CAAC;YACL,CAAC;YACD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,iBAAiB,CAAC,WAAmB;;QACjC,sCAAsC;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAChD,IAAI,IAAI,EAAE,CAAC;YACP,8CAA8C;YAC9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACrB,IAAI,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,0CAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACnC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC1C,CAAC;YACL,CAAC;YACD,4BAA4B;YAC5B,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC1C,CAAC;IACL,CAAC;CACJ;AA9GD,8DA8GC"}

package/dist/optimizations/OptimizedValidationEngine.d.ts

@@ -0,0 +1,73 @@
+/**
+ * ObjectQL
+ * Copyright (c) 2026-present ObjectStack Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/**
+ * Compiled validator function type
+ */
+export type ValidatorFunction = (data: any) => boolean | {
+    valid: boolean;
+    errors?: string[];
+};
+/**
+ * Validation schema interface
+ */
+export interface ValidationSchema {
+    type: string;
+    required?: boolean;
+    properties?: Record<string, ValidationSchema>;
+    items?: ValidationSchema;
+    enum?: any[];
+    minimum?: number;
+    maximum?: number;
+    minLength?: number;
+    maxLength?: number;
+    pattern?: string;
+}
+/**
+ * Optimized Validation Engine
+ *
+ * Improvement: Compiles validation rules to optimized validators.
+ * Validators are compiled once and cached for reuse.
+ *
+ * Expected: 3x faster validation, lower memory churn
+ */
+export declare class OptimizedValidationEngine {
+    private validators;
+    /**
+     * Compile a validation schema to an optimized validator function
+     */
+    private compileSchema;
+    /**
+     * Compile and cache a validator for an object
+     */
+    compile(objectName: string, schema: ValidationSchema): void;
+    /**
+     * Validate data against a compiled validator
+     */
+    validate(objectName: string, data: any): {
+        valid: boolean;
+        errors?: string[];
+    };
+    /**
+     * Check if a validator exists for an object
+     */
+    hasValidator(objectName: string): boolean;
+    /**
+     * Remove a compiled validator
+     */
+    removeValidator(objectName: string): void;
+    /**
+     * Clear all compiled validators
+     */
+    clearAll(): void;
+    /**
+     * Get statistics about compiled validators
+     */
+    getStats(): {
+        totalValidators: number;
+    };
+}