@objectql/core 4.1.0 → 4.2.1

package/dist/gateway.d.ts

@@ -1,36 +0,0 @@
-/**
- * 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.
- */
-import { ApiRequest, ApiResponse, GatewayProtocol } from '@objectql/types';
-export type RequestTransformer = (request: ApiRequest) => Promise<ApiRequest>;
-export type ResponseTransformer = (response: ApiResponse) => Promise<ApiResponse>;
-/**
- * Unified API Gateway
- * Routtes generic API requests to specific protocol implementations
- */
-export declare class ObjectGateway {
-    private protocols;
-    private requestTransforms;
-    private responseTransforms;
-    constructor(protocols?: GatewayProtocol[]);
-    /**
-     * Register a new protocol handler
-     */
-    registerProtocol(protocol: GatewayProtocol): void;
-    /**
-     * Add a request transformer (middleware)
-     */
-    addRequestTransform(transformer: RequestTransformer): void;
-    /**
-     * Add a response transformer (middleware)
-     */
-    addResponseTransform(transformer: ResponseTransformer): void;
-    /**
-     * Handle an incoming API request
-     */
-    handle(request: ApiRequest): Promise<ApiResponse>;
-}

package/dist/gateway.js

@@ -1,89 +0,0 @@
-"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.ObjectGateway = void 0;
-/**
- * Unified API Gateway
- * Routtes generic API requests to specific protocol implementations
- */
-class ObjectGateway {
-    constructor(protocols = []) {
-        this.protocols = [];
-        this.requestTransforms = [];
-        this.responseTransforms = [];
-        this.protocols = protocols;
-    }
-    /**
-     * Register a new protocol handler
-     */
-    registerProtocol(protocol) {
-        this.protocols.push(protocol);
-    }
-    /**
-     * Add a request transformer (middleware)
-     */
-    addRequestTransform(transformer) {
-        this.requestTransforms.push(transformer);
-    }
-    /**
-     * Add a response transformer (middleware)
-     */
-    addResponseTransform(transformer) {
-        this.responseTransforms.push(transformer);
-    }
-    /**
-     * Handle an incoming API request
-     */
-    async handle(request) {
-        let req = request;
-        // 1. Apply Request Transforms
-        for (const transform of this.requestTransforms) {
-            req = await transform(req);
-        }
-        // 2. Find matching protocol
-        const protocol = this.protocols.find(p => p.route(req));
-        if (!protocol) {
-            return {
-                status: 404,
-                headers: { 'Content-Type': 'application/json' },
-                body: {
-                    error: {
-                        code: 'PROTOCOL_NOT_FOUND',
-                        message: `No protocol found to handle path: ${req.path}`
-                    }
-                }
-            };
-        }
-        let response;
-        // 3. Delegate to protocol
-        try {
-            response = await protocol.handle(req);
-        }
-        catch (error) {
-            console.error(`[ObjectGateway] Error in ${protocol.name}:`, error);
-            response = {
-                status: 500,
-                headers: { 'Content-Type': 'application/json' },
-                body: {
-                    error: {
-                        code: 'INTERNAL_ERROR',
-                        message: error.message || 'Internal Gateway Error'
-                    }
-                }
-            };
-        }
-        // 4. Apply Response Transforms
-        for (const transform of this.responseTransforms) {
-            response = await transform(response);
-        }
-        return response;
-    }
-}
-exports.ObjectGateway = ObjectGateway;
-//# sourceMappingURL=gateway.js.map

package/dist/gateway.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"gateway.js","sourceRoot":"","sources":["../src/gateway.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAOH;;;GAGG;AACH,MAAa,aAAa;IAKtB,YAAY,YAA+B,EAAE;QAJrC,cAAS,GAAsB,EAAE,CAAC;QAClC,sBAAiB,GAAyB,EAAE,CAAC;QAC7C,uBAAkB,GAA0B,EAAE,CAAC;QAGnD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,QAAyB;QACtC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,WAA+B;QAC/C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,WAAgC;QACjD,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,OAAmB;QAC5B,IAAI,GAAG,GAAG,OAAO,CAAC;QAElB,8BAA8B;QAC9B,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC7C,GAAG,GAAG,MAAM,SAAS,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;QAED,4BAA4B;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAExD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACZ,OAAO;gBACH,MAAM,EAAE,GAAG;gBACX,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;gBAC/C,IAAI,EAAE;oBACF,KAAK,EAAE;wBACH,IAAI,EAAE,oBAAoB;wBAC1B,OAAO,EAAE,qCAAqC,GAAG,CAAC,IAAI,EAAE;qBAC3D;iBACJ;aACJ,CAAC;QACN,CAAC;QAED,IAAI,QAAqB,CAAC;QAE1B,0BAA0B;QAC1B,IAAI,CAAC;YACD,QAAQ,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;QAAC,OAAO,KAAU,EAAE,CAAC;YAClB,OAAO,CAAC,KAAK,CAAC,4BAA4B,QAAQ,CAAC,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;YACnE,QAAQ,GAAG;gBACP,MAAM,EAAE,GAAG;gBACX,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;gBAC/C,IAAI,EAAE;oBACF,KAAK,EAAE;wBACH,IAAI,EAAE,gBAAgB;wBACtB,OAAO,EAAE,KAAK,CAAC,OAAO,IAAI,wBAAwB;qBACrD;iBACJ;aACJ,CAAC;QACN,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC9C,QAAQ,GAAG,MAAM,SAAS,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,QAAQ,CAAC;IACpB,CAAC;CACJ;AAnFD,sCAmFC"}

package/dist/optimizations/CompiledHookManager.d.ts

@@ -1,55 +0,0 @@
-/**
- * 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.
- */
-/**
- * Hook definition
- */
-export interface Hook {
-    pattern: string;
-    handler: (context: any) => Promise<void> | void;
-    packageName?: string;
-    priority?: number;
-}
-/**
- * Compiled Hook Manager
- *
- * Improvement: Pre-compiles hook pipelines by event pattern at registration time.
- * No runtime pattern matching required.
- *
- * Expected: 5x faster hook execution, parallel async support
- */
-export declare class CompiledHookManager {
-    private pipelines;
-    private allHooks;
-    /**
-     * Expand a pattern like "before*" to all matching events
-     */
-    private expandPattern;
-    /**
-     * Register a hook - pre-groups by event pattern
-     */
-    registerHook(event: string, objectName: string, handler: any, packageName?: string): void;
-    /**
-     * Run hooks for an event - direct lookup, no pattern matching
-     */
-    runHooks(event: string, objectName: string, context: any): Promise<void>;
-    /**
-     * Remove all hooks from a package
-     */
-    removePackage(packageName: string): void;
-    /**
-     * Clear all hooks
-     */
-    clear(): void;
-    /**
-     * Get statistics about registered hooks
-     */
-    getStats(): {
-        totalHooks: number;
-        totalPipelines: number;
-    };
-}

package/dist/optimizations/CompiledHookManager.js

@@ -1,164 +0,0 @@
-"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.CompiledHookManager = void 0;
-/**
- * Compiled Hook Manager
- *
- * Improvement: Pre-compiles hook pipelines by event pattern at registration time.
- * No runtime pattern matching required.
- *
- * Expected: 5x faster hook execution, parallel async support
- */
-class CompiledHookManager {
-    constructor() {
-        // Direct event -> hooks mapping (no pattern matching at runtime)
-        this.pipelines = new Map();
-        // Keep track of all registered hooks for management
-        this.allHooks = new Map();
-    }
-    /**
-     * Expand a pattern like "before*" to all matching events
-     */
-    expandPattern(pattern) {
-        // Common event patterns
-        const eventTypes = [
-            'beforeCreate', 'afterCreate',
-            'beforeUpdate', 'afterUpdate',
-            'beforeDelete', 'afterDelete',
-            'beforeFind', 'afterFind',
-            'beforeCount', 'afterCount'
-        ];
-        // Handle wildcards
-        if (pattern === '*') {
-            return eventTypes;
-        }
-        if (pattern.includes('*')) {
-            // Use global replace to handle all occurrences of *
-            const regex = new RegExp('^' + pattern.replace(/\*/g, '.*') + '$');
-            return eventTypes.filter(event => regex.test(event));
-        }
-        // Exact match
-        return [pattern];
-    }
-    /**
-     * Register a hook - pre-groups by event pattern
-     */
-    registerHook(event, objectName, handler, packageName) {
-        const hook = {
-            pattern: `${event}:${objectName}`,
-            handler,
-            packageName,
-            priority: 0
-        };
-        // Store in all hooks registry
-        const hookId = `${event}:${objectName}:${Date.now()}`;
-        this.allHooks.set(hookId, hook);
-        // Expand event patterns
-        const events = this.expandPattern(event);
-        // Handle wildcard object names
-        if (objectName === '*') {
-            for (const concreteEvent of events) {
-                // Register for all potential object names
-                // Since we don't know all object names upfront, we keep a special '*' pipeline
-                const wildcardKey = `${concreteEvent}:*`;
-                if (!this.pipelines.has(wildcardKey)) {
-                    this.pipelines.set(wildcardKey, []);
-                }
-                this.pipelines.get(wildcardKey).push(hook);
-            }
-        }
-        else {
-            // Pre-group hooks by concrete event names (only for non-wildcard objects)
-            for (const concreteEvent of events) {
-                const key = `${concreteEvent}:${objectName}`;
-                if (!this.pipelines.has(key)) {
-                    this.pipelines.set(key, []);
-                }
-                this.pipelines.get(key).push(hook);
-            }
-        }
-    }
-    /**
-     * Run hooks for an event - direct lookup, no pattern matching
-     */
-    async runHooks(event, objectName, context) {
-        const key = `${event}:${objectName}`;
-        const wildcardKey = `${event}:*`;
-        // Collect all applicable hooks
-        const hooks = [];
-        // Add object-specific hooks
-        const objectHooks = this.pipelines.get(key);
-        if (objectHooks) {
-            hooks.push(...objectHooks);
-        }
-        // Add wildcard hooks
-        const wildcardHooks = this.pipelines.get(wildcardKey);
-        if (wildcardHooks) {
-            hooks.push(...wildcardHooks);
-        }
-        if (hooks.length === 0) {
-            return;
-        }
-        // Sort by priority (higher priority first)
-        hooks.sort((a, b) => (b.priority || 0) - (a.priority || 0));
-        // Execute hooks in parallel for better performance
-        // Note: If order matters, change to sequential execution
-        await Promise.all(hooks.map(hook => {
-            try {
-                return Promise.resolve(hook.handler(context));
-            }
-            catch (error) {
-                console.error(`Hook execution failed for ${event}:${objectName}`, error);
-                return Promise.resolve();
-            }
-        }));
-    }
-    /**
-     * Remove all hooks from a package
-     */
-    removePackage(packageName) {
-        // Remove from all hooks registry
-        const hooksToRemove = [];
-        for (const [hookId, hook] of this.allHooks.entries()) {
-            if (hook.packageName === packageName) {
-                hooksToRemove.push(hookId);
-            }
-        }
-        hooksToRemove.forEach(id => this.allHooks.delete(id));
-        // Remove from pipelines
-        for (const [key, hooks] of this.pipelines.entries()) {
-            const filtered = hooks.filter(h => h.packageName !== packageName);
-            if (filtered.length === 0) {
-                this.pipelines.delete(key);
-            }
-            else {
-                this.pipelines.set(key, filtered);
-            }
-        }
-    }
-    /**
-     * Clear all hooks
-     */
-    clear() {
-        this.pipelines.clear();
-        this.allHooks.clear();
-    }
-    /**
-     * Get statistics about registered hooks
-     */
-    getStats() {
-        return {
-            totalHooks: this.allHooks.size,
-            totalPipelines: this.pipelines.size
-        };
-    }
-}
-exports.CompiledHookManager = CompiledHookManager;
-//# sourceMappingURL=CompiledHookManager.js.map

package/dist/optimizations/CompiledHookManager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"CompiledHookManager.js","sourceRoot":"","sources":["../../src/optimizations/CompiledHookManager.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAYH;;;;;;;GAOG;AACH,MAAa,mBAAmB;IAAhC;QACI,iEAAiE;QACzD,cAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE9C,oDAAoD;QAC5C,aAAQ,GAAG,IAAI,GAAG,EAAgB,CAAC;IAyJ/C,CAAC;IAvJG;;OAEG;IACK,aAAa,CAAC,OAAe;QACjC,wBAAwB;QACxB,MAAM,UAAU,GAAG;YACf,cAAc,EAAE,aAAa;YAC7B,cAAc,EAAE,aAAa;YAC7B,cAAc,EAAE,aAAa;YAC7B,YAAY,EAAE,WAAW;YACzB,aAAa,EAAE,YAAY;SAC9B,CAAC;QAEF,mBAAmB;QACnB,IAAI,OAAO,KAAK,GAAG,EAAE,CAAC;YAClB,OAAO,UAAU,CAAC;QACtB,CAAC;QAED,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,oDAAoD;YACpD,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;YACnE,OAAO,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,cAAc;QACd,OAAO,CAAC,OAAO,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,KAAa,EAAE,UAAkB,EAAE,OAAY,EAAE,WAAoB;QAC9E,MAAM,IAAI,GAAS;YACf,OAAO,EAAE,GAAG,KAAK,IAAI,UAAU,EAAE;YACjC,OAAO;YACP,WAAW;YACX,QAAQ,EAAE,CAAC;SACd,CAAC;QAEF,8BAA8B;QAC9B,MAAM,MAAM,GAAG,GAAG,KAAK,IAAI,UAAU,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACtD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAEhC,wBAAwB;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAEzC,+BAA+B;QAC/B,IAAI,UAAU,KAAK,GAAG,EAAE,CAAC;YACrB,KAAK,MAAM,aAAa,IAAI,MAAM,EAAE,CAAC;gBACjC,0CAA0C;gBAC1C,+EAA+E;gBAC/E,MAAM,WAAW,GAAG,GAAG,aAAa,IAAI,CAAC;gBACzC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;oBACnC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;gBACxC,CAAC;gBACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChD,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,0EAA0E;YAC1E,KAAK,MAAM,aAAa,IAAI,MAAM,EAAE,CAAC;gBACjC,MAAM,GAAG,GAAG,GAAG,aAAa,IAAI,UAAU,EAAE,CAAC;gBAC7C,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC3B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBAChC,CAAC;gBACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,CAAC;QACL,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,KAAa,EAAE,UAAkB,EAAE,OAAY;QAC1D,MAAM,GAAG,GAAG,GAAG,KAAK,IAAI,UAAU,EAAE,CAAC;QACrC,MAAM,WAAW,GAAG,GAAG,KAAK,IAAI,CAAC;QAEjC,+BAA+B;QAC/B,MAAM,KAAK,GAAW,EAAE,CAAC;QAEzB,4BAA4B;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,WAAW,EAAE,CAAC;YACd,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QAC/B,CAAC;QAED,qBAAqB;QACrB,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACtD,IAAI,aAAa,EAAE,CAAC;YAChB,KAAK,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO;QACX,CAAC;QAED,2CAA2C;QAC3C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;QAE5D,mDAAmD;QACnD,yDAAyD;QACzD,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YAC/B,IAAI,CAAC;gBACD,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;YAClD,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACb,OAAO,CAAC,KAAK,CAAC,6BAA6B,KAAK,IAAI,UAAU,EAAE,EAAE,KAAK,CAAC,CAAC;gBACzE,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;YAC7B,CAAC;QACL,CAAC,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,WAAmB;QAC7B,iCAAiC;QACjC,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YACnD,IAAI,IAAI,CAAC,WAAW,KAAK,WAAW,EAAE,CAAC;gBACnC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;QACD,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAEtD,wBAAwB;QACxB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,WAAW,CAAC,CAAC;YAClE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACJ,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACtC,CAAC;QACL,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,QAAQ;QACJ,OAAO;YACH,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI;YAC9B,cAAc,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;SACtC,CAAC;IACN,CAAC;CACJ;AA9JD,kDA8JC"}

package/dist/optimizations/DependencyGraph.d.ts

@@ -1,82 +0,0 @@
-/**
- * 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.
- */
-/**
- * Dependency type
- */
-export type DependencyType = 'lookup' | 'master_detail' | 'foreign_key';
-/**
- * Edge in the dependency graph
- */
-export interface DependencyEdge {
-    from: string;
-    to: string;
-    type: DependencyType;
-    fieldName: string;
-}
-/**
- * Smart Dependency Graph
- *
- * Improvement: DAG-based dependency resolution for cascading operations.
- * Automatically handles cascade deletes and updates in correct order.
- *
- * Expected: Eliminates manual cascade logic, prevents orphaned data
- */
-export declare class DependencyGraph {
-    private graph;
-    private edges;
-    /**
-     * Add an object to the graph
-     */
-    addObject(objectName: string): void;
-    /**
-     * Add a dependency edge
-     * from -> to means "to depends on from"
-     */
-    addDependency(from: string, to: string, type: DependencyType, fieldName: string): void;
-    /**
-     * Get all objects that depend on the given object
-     */
-    getDependents(objectName: string): string[];
-    /**
-     * Topological sort using DFS
-     */
-    topologicalSort(objects: string[]): string[];
-    /**
-     * Check for circular dependencies
-     */
-    hasCircularDependency(): boolean;
-    /**
-     * Get cascade delete order for an object
-     * Returns objects in the order they should be deleted
-     */
-    getCascadeDeleteOrder(objectName: string): string[];
-    /**
-     * Automatically cascade delete based on dependency graph
-     *
-     * @param objectName The object type being deleted
-     * @param id The ID of the record being deleted
-     * @param deleteFunc Function to delete a record: (objectName, id) => Promise<void>
-     */
-    cascadeDelete(objectName: string, id: string, deleteFunc: (objName: string, recordId: string) => Promise<void>): Promise<void>;
-    /**
-     * Get graph statistics
-     */
-    getStats(): {
-        totalObjects: number;
-        totalDependencies: number;
-        hasCircularDependency: boolean;
-    };
-    /**
-     * Clear the graph
-     */
-    clear(): void;
-    /**
-     * Export graph as DOT format for visualization
-     */
-    toDot(): string;
-}

package/dist/optimizations/DependencyGraph.js

@@ -1,211 +0,0 @@
-"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.DependencyGraph = void 0;
-/**
- * Smart Dependency Graph
- *
- * Improvement: DAG-based dependency resolution for cascading operations.
- * Automatically handles cascade deletes and updates in correct order.
- *
- * Expected: Eliminates manual cascade logic, prevents orphaned data
- */
-class DependencyGraph {
-    constructor() {
-        // Adjacency list: object -> list of dependent objects
-        this.graph = new Map();
-        // Store edge metadata
-        this.edges = new Map();
-    }
-    /**
-     * Add an object to the graph
-     */
-    addObject(objectName) {
-        if (!this.graph.has(objectName)) {
-            this.graph.set(objectName, new Set());
-        }
-        if (!this.edges.has(objectName)) {
-            this.edges.set(objectName, []);
-        }
-    }
-    /**
-     * Add a dependency edge
-     * from -> to means "to depends on from"
-     */
-    addDependency(from, to, type, fieldName) {
-        this.addObject(from);
-        this.addObject(to);
-        // Add edge
-        this.graph.get(from).add(to);
-        // Store edge metadata
-        const edge = { from, to, type, fieldName };
-        const fromEdges = this.edges.get(from) || [];
-        fromEdges.push(edge);
-        this.edges.set(from, fromEdges);
-    }
-    /**
-     * Get all objects that depend on the given object
-     */
-    getDependents(objectName) {
-        return Array.from(this.graph.get(objectName) || []);
-    }
-    /**
-     * Topological sort using DFS
-     */
-    topologicalSort(objects) {
-        const visited = new Set();
-        const stack = [];
-        const dfs = (node) => {
-            if (visited.has(node))
-                return;
-            visited.add(node);
-            const dependents = this.graph.get(node);
-            if (dependents) {
-                for (const dependent of dependents) {
-                    if (objects.includes(dependent)) {
-                        dfs(dependent);
-                    }
-                }
-            }
-            stack.push(node);
-        };
-        for (const obj of objects) {
-            dfs(obj);
-        }
-        return stack;
-    }
-    /**
-     * Check for circular dependencies
-     */
-    hasCircularDependency() {
-        const visited = new Set();
-        const recursionStack = new Set();
-        const hasCycle = (node) => {
-            visited.add(node);
-            recursionStack.add(node);
-            const dependents = this.graph.get(node);
-            if (dependents) {
-                for (const dependent of dependents) {
-                    if (!visited.has(dependent)) {
-                        if (hasCycle(dependent)) {
-                            return true;
-                        }
-                    }
-                    else if (recursionStack.has(dependent)) {
-                        return true;
-                    }
-                }
-            }
-            recursionStack.delete(node);
-            return false;
-        };
-        for (const node of this.graph.keys()) {
-            if (!visited.has(node)) {
-                if (hasCycle(node)) {
-                    return true;
-                }
-            }
-        }
-        return false;
-    }
-    /**
-     * Get cascade delete order for an object
-     * Returns objects in the order they should be deleted
-     */
-    getCascadeDeleteOrder(objectName) {
-        const dependents = this.getDependents(objectName);
-        if (dependents.length === 0) {
-            return [objectName];
-        }
-        // Recursively get all transitive dependents
-        const allDependents = new Set();
-        const collectDependents = (obj) => {
-            const deps = this.getDependents(obj);
-            for (const dep of deps) {
-                if (!allDependents.has(dep)) {
-                    allDependents.add(dep);
-                    collectDependents(dep);
-                }
-            }
-        };
-        collectDependents(objectName);
-        // Add the original object
-        allDependents.add(objectName);
-        // Sort topologically to get correct deletion order
-        const sorted = this.topologicalSort(Array.from(allDependents));
-        return sorted;
-    }
-    /**
-     * Automatically cascade delete based on dependency graph
-     *
-     * @param objectName The object type being deleted
-     * @param id The ID of the record being deleted
-     * @param deleteFunc Function to delete a record: (objectName, id) => Promise<void>
-     */
-    async cascadeDelete(objectName, id, deleteFunc) {
-        const deleteOrder = this.getCascadeDeleteOrder(objectName);
-        // Delete in correct order based on DAG
-        for (const objToDelete of deleteOrder) {
-            if (objToDelete === objectName) {
-                // Delete the main record
-                await deleteFunc(objectName, id);
-            }
-            else {
-                // Find and delete dependent records
-                // This is a simplified version - in production, you'd need to:
-                // 1. Query for records that reference the deleted record
-                // 2. Delete them based on cascade rules (CASCADE vs SET NULL vs RESTRICT)
-                const edgesFromParent = this.edges.get(objectName) || [];
-                for (const edge of edgesFromParent) {
-                    if (edge.to === objToDelete && edge.type === 'master_detail') {
-                        // For master-detail, cascade delete dependent records
-                        // await deleteFunc(objToDelete, <dependent_id>);
-                        // Implementation would require querying for dependent records
-                    }
-                }
-            }
-        }
-    }
-    /**
-     * Get graph statistics
-     */
-    getStats() {
-        let totalDeps = 0;
-        for (const deps of this.graph.values()) {
-            totalDeps += deps.size;
-        }
-        return {
-            totalObjects: this.graph.size,
-            totalDependencies: totalDeps,
-            hasCircularDependency: this.hasCircularDependency()
-        };
-    }
-    /**
-     * Clear the graph
-     */
-    clear() {
-        this.graph.clear();
-        this.edges.clear();
-    }
-    /**
-     * Export graph as DOT format for visualization
-     */
-    toDot() {
-        let dot = 'digraph Dependencies {\n';
-        for (const [from, dependents] of this.graph.entries()) {
-            for (const to of dependents) {
-                dot += `  "${from}" -> "${to}";\n`;
-            }
-        }
-        dot += '}';
-        return dot;
-    }
-}
-exports.DependencyGraph = DependencyGraph;
-//# sourceMappingURL=DependencyGraph.js.map

package/dist/optimizations/DependencyGraph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"DependencyGraph.js","sourceRoot":"","sources":["../../src/optimizations/DependencyGraph.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAiBH;;;;;;;GAOG;AACH,MAAa,eAAe;IAA5B;QACI,sDAAsD;QAC9C,UAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;QAE/C,sBAAsB;QACd,UAAK,GAAG,IAAI,GAAG,EAA4B,CAAC;IA0NxD,CAAC;IAxNG;;OAEG;IACH,SAAS,CAAC,UAAkB;QACxB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC1C,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QACnC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,IAAY,EAAE,EAAU,EAAE,IAAoB,EAAE,SAAiB;QAC3E,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAEnB,WAAW;QACX,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAE9B,sBAAsB;QACtB,MAAM,IAAI,GAAmB,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC7C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,UAAkB;QAC5B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IACxD,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,OAAiB;QAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,MAAM,GAAG,GAAG,CAAC,IAAY,EAAE,EAAE;YACzB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO;YAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAElB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,UAAU,EAAE,CAAC;gBACb,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;oBACjC,IAAI,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC9B,GAAG,CAAC,SAAS,CAAC,CAAC;oBACnB,CAAC;gBACL,CAAC;YACL,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC,CAAC;QAEF,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YACxB,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,qBAAqB;QACjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAW,EAAE;YACvC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAEzB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,UAAU,EAAE,CAAC;gBACb,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;oBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC1B,IAAI,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;4BACtB,OAAO,IAAI,CAAC;wBAChB,CAAC;oBACL,CAAC;yBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;wBACvC,OAAO,IAAI,CAAC;oBAChB,CAAC;gBACL,CAAC;YACL,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5B,OAAO,KAAK,CAAC;QACjB,CAAC,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBACjB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,qBAAqB,CAAC,UAAkB;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,UAAU,CAAC,CAAC;QACxB,CAAC;QAED,4CAA4C;QAC5C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QACxC,MAAM,iBAAiB,GAAG,CAAC,GAAW,EAAE,EAAE;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;YACrC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACrB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC1B,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACvB,iBAAiB,CAAC,GAAG,CAAC,CAAC;gBAC3B,CAAC;YACL,CAAC;QACL,CAAC,CAAC;QACF,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAE9B,0BAA0B;QAC1B,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAE9B,mDAAmD;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;QAE/D,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,aAAa,CACf,UAAkB,EAClB,EAAU,EACV,UAAgE;QAEhE,MAAM,WAAW,GAAG,IAAI,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QAE3D,uCAAuC;QACvC,KAAK,MAAM,WAAW,IAAI,WAAW,EAAE,CAAC;YACpC,IAAI,WAAW,KAAK,UAAU,EAAE,CAAC;gBAC7B,yBAAyB;gBACzB,MAAM,UAAU,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACJ,oCAAoC;gBACpC,+DAA+D;gBAC/D,yDAAyD;gBACzD,0EAA0E;gBAE1E,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;gBACzD,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;oBACjC,IAAI,IAAI,CAAC,EAAE,KAAK,WAAW,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;wBAC3D,sDAAsD;wBACtD,iDAAiD;wBACjD,8DAA8D;oBAClE,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED;;OAEG;IACH,QAAQ;QAKJ,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC;QAC3B,CAAC;QAED,OAAO;YACH,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC7B,iBAAiB,EAAE,SAAS;YAC5B,qBAAqB,EAAE,IAAI,CAAC,qBAAqB,EAAE;SACtD,CAAC;IACN,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,GAAG,GAAG,0BAA0B,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;gBAC1B,GAAG,IAAI,MAAM,IAAI,SAAS,EAAE,MAAM,CAAC;YACvC,CAAC;QACL,CAAC;QACD,GAAG,IAAI,GAAG,CAAC;QACX,OAAO,GAAG,CAAC;IACf,CAAC;CACJ;AA/ND,0CA+NC"}