@objectql/core 4.1.0 → 4.2.1

package/dist/optimizations/OptimizedValidationEngine.d.ts

@@ -1,73 +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.
- */
-/**
- * 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;
-    };
-}

package/dist/optimizations/OptimizedValidationEngine.js

@@ -1,141 +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.OptimizedValidationEngine = void 0;
-/**
- * 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
- */
-class OptimizedValidationEngine {
-    constructor() {
-        this.validators = new Map();
-    }
-    /**
-     * Compile a validation schema to an optimized validator function
-     */
-    compileSchema(schema) {
-        // Generate optimized validation function
-        return (data) => {
-            const errors = [];
-            // Type validation
-            if (schema.type) {
-                const actualType = Array.isArray(data) ? 'array' : typeof data;
-                if (actualType !== schema.type && !(schema.type === 'integer' && typeof data === 'number')) {
-                    errors.push(`Expected type ${schema.type}, got ${actualType}`);
-                }
-            }
-            // Required validation
-            if (schema.required && (data === null || data === undefined)) {
-                errors.push('Value is required');
-            }
-            // String validations
-            if (typeof data === 'string') {
-                if (schema.minLength !== undefined && data.length < schema.minLength) {
-                    errors.push(`String length must be at least ${schema.minLength}`);
-                }
-                if (schema.maxLength !== undefined && data.length > schema.maxLength) {
-                    errors.push(`String length must not exceed ${schema.maxLength}`);
-                }
-                if (schema.pattern) {
-                    const regex = new RegExp(schema.pattern);
-                    if (!regex.test(data)) {
-                        errors.push(`String does not match pattern ${schema.pattern}`);
-                    }
-                }
-            }
-            // Number validations
-            if (typeof data === 'number') {
-                if (schema.minimum !== undefined && data < schema.minimum) {
-                    errors.push(`Value must be at least ${schema.minimum}`);
-                }
-                if (schema.maximum !== undefined && data > schema.maximum) {
-                    errors.push(`Value must not exceed ${schema.maximum}`);
-                }
-            }
-            // Enum validation
-            if (schema.enum && !schema.enum.includes(data)) {
-                errors.push(`Value must be one of: ${schema.enum.join(', ')}`);
-            }
-            // Object property validation
-            if (schema.properties && typeof data === 'object' && data !== null) {
-                for (const [key, propSchema] of Object.entries(schema.properties)) {
-                    const propValidator = this.compileSchema(propSchema);
-                    const result = propValidator(data[key]);
-                    if (typeof result === 'object' && !result.valid) {
-                        errors.push(...(result.errors || []).map(e => `${key}: ${e}`));
-                    }
-                }
-            }
-            // Array item validation
-            if (schema.items && Array.isArray(data)) {
-                const itemValidator = this.compileSchema(schema.items);
-                data.forEach((item, index) => {
-                    const result = itemValidator(item);
-                    if (typeof result === 'object' && !result.valid) {
-                        errors.push(...(result.errors || []).map(e => `[${index}]: ${e}`));
-                    }
-                });
-            }
-            return {
-                valid: errors.length === 0,
-                errors: errors.length > 0 ? errors : undefined
-            };
-        };
-    }
-    /**
-     * Compile and cache a validator for an object
-     */
-    compile(objectName, schema) {
-        const validator = this.compileSchema(schema);
-        this.validators.set(objectName, validator);
-    }
-    /**
-     * Validate data against a compiled validator
-     */
-    validate(objectName, data) {
-        const validator = this.validators.get(objectName);
-        if (!validator) {
-            throw new Error(`No validator compiled for object: ${objectName}`);
-        }
-        const result = validator(data);
-        return typeof result === 'boolean' ? { valid: result } : result;
-    }
-    /**
-     * Check if a validator exists for an object
-     */
-    hasValidator(objectName) {
-        return this.validators.has(objectName);
-    }
-    /**
-     * Remove a compiled validator
-     */
-    removeValidator(objectName) {
-        this.validators.delete(objectName);
-    }
-    /**
-     * Clear all compiled validators
-     */
-    clearAll() {
-        this.validators.clear();
-    }
-    /**
-     * Get statistics about compiled validators
-     */
-    getStats() {
-        return {
-            totalValidators: this.validators.size
-        };
-    }
-}
-exports.OptimizedValidationEngine = OptimizedValidationEngine;
-//# sourceMappingURL=OptimizedValidationEngine.js.map

package/dist/optimizations/OptimizedValidationEngine.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"OptimizedValidationEngine.js","sourceRoot":"","sources":["../../src/optimizations/OptimizedValidationEngine.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAuBH;;;;;;;GAOG;AACH,MAAa,yBAAyB;IAAtC;QACY,eAAU,GAAG,IAAI,GAAG,EAA6B,CAAC;IAqI9D,CAAC;IAnIG;;OAEG;IACK,aAAa,CAAC,MAAwB;QAC1C,yCAAyC;QACzC,OAAO,CAAC,IAAS,EAAyC,EAAE;YACxD,MAAM,MAAM,GAAa,EAAE,CAAC;YAE5B,kBAAkB;YAClB,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBACd,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC;gBAC/D,IAAI,UAAU,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,OAAO,IAAI,KAAK,QAAQ,CAAC,EAAE,CAAC;oBACzF,MAAM,CAAC,IAAI,CAAC,iBAAiB,MAAM,CAAC,IAAI,SAAS,UAAU,EAAE,CAAC,CAAC;gBACnE,CAAC;YACL,CAAC;YAED,sBAAsB;YACtB,IAAI,MAAM,CAAC,QAAQ,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,CAAC,EAAE,CAAC;gBAC3D,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;YACrC,CAAC;YAED,qBAAqB;YACrB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC3B,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;oBACnE,MAAM,CAAC,IAAI,CAAC,kCAAkC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBACtE,CAAC;gBACD,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;oBACnE,MAAM,CAAC,IAAI,CAAC,iCAAiC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBACrE,CAAC;gBACD,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACjB,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;oBACzC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;wBACpB,MAAM,CAAC,IAAI,CAAC,iCAAiC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;oBACnE,CAAC;gBACL,CAAC;YACL,CAAC;YAED,qBAAqB;YACrB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC3B,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;oBACxD,MAAM,CAAC,IAAI,CAAC,0BAA0B,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;gBAC5D,CAAC;gBACD,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;oBACxD,MAAM,CAAC,IAAI,CAAC,yBAAyB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACL,CAAC;YAED,kBAAkB;YAClB,IAAI,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7C,MAAM,CAAC,IAAI,CAAC,yBAAyB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnE,CAAC;YAED,6BAA6B;YAC7B,IAAI,MAAM,CAAC,UAAU,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBACjE,KAAK,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;oBAChE,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;oBACrD,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBACxC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;wBAC9C,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;oBACnE,CAAC;gBACL,CAAC;YACL,CAAC;YAED,wBAAwB;YACxB,IAAI,MAAM,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtC,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACvD,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;oBACzB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;oBACnC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;wBAC9C,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvE,CAAC;gBACL,CAAC,CAAC,CAAC;YACP,CAAC;YAED,OAAO;gBACH,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;gBAC1B,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;aACjD,CAAC;QACN,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,UAAkB,EAAE,MAAwB;QAChD,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,UAAkB,EAAE,IAAS;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,qCAAqC,UAAU,EAAE,CAAC,CAAC;QACvE,CAAC;QAED,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/B,OAAO,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IACpE,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,UAAkB;QAC3B,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,UAAkB;QAC9B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,QAAQ;QACJ,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,QAAQ;QACJ,OAAO;YACH,eAAe,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;SACxC,CAAC;IACN,CAAC;CACJ;AAtID,8DAsIC"}

package/dist/optimizations/QueryCompiler.d.ts

@@ -1,51 +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.
- */
-/**
- * Compiled Query representation
- * Contains optimized execution plan
- */
-export interface CompiledQuery {
-    objectName: string;
-    ast: any;
-    plan: any;
-    timestamp: number;
-}
-/**
- * Query Compiler with LRU Cache
- *
- * Improvement: Compiles Query AST to optimized execution plan and caches results.
- * Expected: 10x faster query planning, 50% lower CPU usage
- */
-export declare class QueryCompiler {
-    private cache;
-    constructor(cacheSize?: number);
-    /**
-     * Hash a Query AST to create a cache key
-     */
-    private hashAST;
-    /**
-     * Compile AST to optimized execution plan
-     */
-    private compileAST;
-    /**
-     * Detect fields that can use indexes
-     */
-    private detectIndexableFields;
-    /**
-     * Determine optimal join strategy
-     */
-    private determineJoinStrategy;
-    /**
-     * Compile and cache query
-     */
-    compile(objectName: string, ast: any): CompiledQuery;
-    /**
-     * Clear the cache (useful for testing or after schema changes)
-     */
-    clearCache(): void;
-}

package/dist/optimizations/QueryCompiler.js

@@ -1,216 +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.QueryCompiler = void 0;
-/**
- * LRU Cache implementation
- * Simple doubly-linked list + hash map for O(1) operations
- */
-class LRUCache {
-    constructor(capacity) {
-        this.cache = new Map();
-        this.head = null;
-        this.tail = null;
-        this.capacity = capacity;
-    }
-    get(key) {
-        const node = this.cache.get(key);
-        if (!node)
-            return undefined;
-        // Move to front (most recently used)
-        this.moveToFront(key);
-        return node.value;
-    }
-    set(key, value) {
-        if (this.cache.has(key)) {
-            // Update existing
-            const node = this.cache.get(key);
-            node.value = value;
-            this.moveToFront(key);
-        }
-        else {
-            // Add new
-            if (this.cache.size >= this.capacity) {
-                // Evict least recently used (tail)
-                if (this.tail !== null) {
-                    const oldTail = this.tail;
-                    const tailNode = this.cache.get(this.tail);
-                    if (tailNode && tailNode.prev !== null) {
-                        const prevNode = this.cache.get(tailNode.prev);
-                        if (prevNode) {
-                            prevNode.next = null;
-                            this.tail = tailNode.prev;
-                        }
-                    }
-                    else {
-                        this.head = null;
-                        this.tail = null;
-                    }
-                    this.cache.delete(oldTail);
-                }
-            }
-            // Insert at head
-            this.cache.set(key, { value, prev: null, next: this.head });
-            if (this.head !== null) {
-                const headNode = this.cache.get(this.head);
-                if (headNode) {
-                    headNode.prev = key;
-                }
-            }
-            this.head = key;
-            if (this.tail === null) {
-                this.tail = key;
-            }
-        }
-    }
-    has(key) {
-        return this.cache.has(key);
-    }
-    moveToFront(key) {
-        if (key === this.head)
-            return; // Already at front
-        const node = this.cache.get(key);
-        if (!node)
-            return;
-        // Remove from current position
-        if (node.prev !== null) {
-            const prevNode = this.cache.get(node.prev);
-            if (prevNode) {
-                prevNode.next = node.next;
-            }
-        }
-        if (node.next !== null) {
-            const nextNode = this.cache.get(node.next);
-            if (nextNode) {
-                nextNode.prev = node.prev;
-            }
-        }
-        if (key === this.tail) {
-            this.tail = node.prev;
-        }
-        // Move to front
-        node.prev = null;
-        node.next = this.head;
-        if (this.head !== null) {
-            const headNode = this.cache.get(this.head);
-            if (headNode) {
-                headNode.prev = key;
-            }
-        }
-        this.head = key;
-    }
-}
-/**
- * Query Compiler with LRU Cache
- *
- * Improvement: Compiles Query AST to optimized execution plan and caches results.
- * Expected: 10x faster query planning, 50% lower CPU usage
- */
-class QueryCompiler {
-    constructor(cacheSize = 1000) {
-        this.cache = new LRUCache(cacheSize);
-    }
-    /**
-     * Hash a Query AST to create a cache key
-     */
-    hashAST(ast) {
-        // Simple JSON-based hash for now
-        // In production, consider a faster hash function
-        try {
-            return JSON.stringify(ast);
-        }
-        catch (e) {
-            // Fallback for circular references
-            return String(Date.now() + Math.random());
-        }
-    }
-    /**
-     * Compile AST to optimized execution plan
-     */
-    compileAST(objectName, ast) {
-        // Optimization opportunities:
-        // 1. Precompute field projections
-        // 2. Optimize filter conditions
-        // 3. Determine optimal join strategy
-        // 4. Index hint detection
-        const plan = {
-            objectName,
-            // Extract and optimize components
-            fields: ast.fields || ['*'],
-            filters: ast.filters || ast.where,
-            sort: ast.sort || ast.orderBy,
-            limit: ast.limit || ast.top,
-            offset: ast.offset || ast.skip,
-            // Add optimization hints
-            useIndex: this.detectIndexableFields(ast),
-            joinStrategy: this.determineJoinStrategy(ast)
-        };
-        return {
-            objectName,
-            ast,
-            plan,
-            timestamp: Date.now()
-        };
-    }
-    /**
-     * Detect fields that can use indexes
-     */
-    detectIndexableFields(ast) {
-        const indexable = [];
-        if (ast.filters) {
-            // Extract fields from filter conditions
-            const extractFields = (filters) => {
-                if (Array.isArray(filters)) {
-                    filters.forEach(extractFields);
-                }
-                else if (filters && typeof filters === 'object') {
-                    Object.keys(filters).forEach(key => {
-                        if (!key.startsWith('$')) {
-                            indexable.push(key);
-                        }
-                    });
-                }
-            };
-            extractFields(ast.filters);
-        }
-        return [...new Set(indexable)]; // Remove duplicates
-    }
-    /**
-     * Determine optimal join strategy
-     */
-    determineJoinStrategy(ast) {
-        // Simple heuristic: use hash join for large datasets
-        if (ast.limit && ast.limit < 100) {
-            return 'nested';
-        }
-        return 'hash';
-    }
-    /**
-     * Compile and cache query
-     */
-    compile(objectName, ast) {
-        const key = this.hashAST(ast);
-        if (this.cache.has(key)) {
-            // Cache hit ✅
-            return this.cache.get(key);
-        }
-        // Cache miss - compile and store
-        const compiled = this.compileAST(objectName, ast);
-        this.cache.set(key, compiled);
-        return compiled;
-    }
-    /**
-     * Clear the cache (useful for testing or after schema changes)
-     */
-    clearCache() {
-        this.cache = new LRUCache(1000);
-    }
-}
-exports.QueryCompiler = QueryCompiler;
-//# sourceMappingURL=QueryCompiler.js.map

package/dist/optimizations/QueryCompiler.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"QueryCompiler.js","sourceRoot":"","sources":["../../src/optimizations/QueryCompiler.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAEH;;;GAGG;AACH,MAAM,QAAQ;IAMV,YAAY,QAAgB;QAJpB,UAAK,GAAG,IAAI,GAAG,EAAmD,CAAC;QACnE,SAAI,GAAa,IAAI,CAAC;QACtB,SAAI,GAAa,IAAI,CAAC;QAG1B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAED,GAAG,CAAC,GAAM;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAE5B,qCAAqC;QACrC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAChB,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,kBAAkB;YAClB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YAClC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;aAAM,CAAC;YACJ,UAAU;YACV,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACnC,mCAAmC;gBACnC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;oBACrB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;oBAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC3C,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;wBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;wBAC/C,IAAI,QAAQ,EAAE,CAAC;4BACX,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;4BACrB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;wBAC9B,CAAC;oBACL,CAAC;yBAAM,CAAC;wBACJ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;wBACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;oBACrB,CAAC;oBACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBAC/B,CAAC;YACL,CAAC;YAED,iBAAiB;YACjB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YAC5D,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3C,IAAI,QAAQ,EAAE,CAAC;oBACX,QAAQ,CAAC,IAAI,GAAG,GAAG,CAAC;gBACxB,CAAC;YACL,CAAC;YACD,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;YAChB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACrB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;YACpB,CAAC;QACL,CAAC;IACL,CAAC;IAED,GAAG,CAAC,GAAM;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAEO,WAAW,CAAC,GAAM;QACtB,IAAI,GAAG,KAAK,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,mBAAmB;QAElD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,+BAA+B;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,QAAQ,EAAE,CAAC;gBACX,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAC9B,CAAC;QACL,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,QAAQ,EAAE,CAAC;gBACX,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAC9B,CAAC;QACL,CAAC;QACD,IAAI,GAAG,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1B,CAAC;QAED,gBAAgB;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,QAAQ,EAAE,CAAC;gBACX,QAAQ,CAAC,IAAI,GAAG,GAAG,CAAC;YACxB,CAAC;QACL,CAAC;QACD,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IACpB,CAAC;CACJ;AAaD;;;;;GAKG;AACH,MAAa,aAAa;IAGtB,YAAY,YAAoB,IAAI;QAChC,IAAI,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,SAAS,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACK,OAAO,CAAC,GAAQ;QACpB,iCAAiC;QACjC,iDAAiD;QACjD,IAAI,CAAC;YACD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACT,mCAAmC;YACnC,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,UAAkB,EAAE,GAAQ;QAC3C,8BAA8B;QAC9B,kCAAkC;QAClC,gCAAgC;QAChC,qCAAqC;QACrC,0BAA0B;QAE1B,MAAM,IAAI,GAAG;YACT,UAAU;YACV,kCAAkC;YAClC,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC;YAC3B,OAAO,EAAE,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,KAAK;YACjC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,OAAO;YAC7B,KAAK,EAAE,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,GAAG;YAC3B,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI;YAC9B,yBAAyB;YACzB,QAAQ,EAAE,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC;YACzC,YAAY,EAAE,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC;SAChD,CAAC;QAEF,OAAO;YACH,UAAU;YACV,GAAG;YACH,IAAI;YACJ,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACxB,CAAC;IACN,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,GAAQ;QAClC,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YACd,wCAAwC;YACxC,MAAM,aAAa,GAAG,CAAC,OAAY,EAAQ,EAAE;gBACzC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;oBACzB,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;gBACnC,CAAC;qBAAM,IAAI,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;oBAChD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;wBAC/B,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;4BACvB,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACxB,CAAC;oBACL,CAAC,CAAC,CAAC;gBACP,CAAC;YACL,CAAC,CAAC;YACF,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,oBAAoB;IACxD,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,GAAQ;QAClC,qDAAqD;QACrD,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,GAAG,GAAG,EAAE,CAAC;YAC/B,OAAO,QAAQ,CAAC;QACpB,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,UAAkB,EAAE,GAAQ;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAE9B,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,cAAc;YACd,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAChC,CAAC;QAED,iCAAiC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC9B,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,UAAU;QACN,IAAI,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;CACJ;AA/GD,sCA+GC"}

package/dist/optimizations/SQLQueryOptimizer.d.ts

@@ -1,96 +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.
- */
-/**
- * Index metadata
- */
-export interface IndexMetadata {
-    name: string;
-    fields: string[];
-    unique: boolean;
-    type?: 'btree' | 'hash' | 'fulltext';
-}
-/**
- * Schema with index information
- */
-export interface SchemaWithIndexes {
-    name: string;
-    fields: Record<string, any>;
-    indexes?: IndexMetadata[];
-}
-/**
- * Query AST for optimization
- */
-export interface OptimizableQueryAST {
-    object: string;
-    fields?: string[];
-    filters?: any;
-    sort?: Array<{
-        field: string;
-        order: 'asc' | 'desc';
-    }>;
-    joins?: Array<{
-        type: 'left' | 'inner';
-        table: string;
-        on: any;
-    }>;
-    limit?: number;
-    offset?: number;
-}
-/**
- * SQL Query Optimizer
- *
- * Improvement: SQL-aware optimization with index hints and join reordering.
- * Analyzes query patterns and schema to generate optimal SQL.
- *
- * Expected: 2-5x faster queries on large datasets
- */
-export declare class SQLQueryOptimizer {
-    private schemas;
-    /**
-     * Register a schema with index information
-     */
-    registerSchema(schema: SchemaWithIndexes): void;
-    /**
-     * Check if a field has an index
-     */
-    private hasIndex;
-    /**
-     * Get the best index for given filter fields
-     */
-    private getBestIndex;
-    /**
-     * Extract filter fields from filter conditions
-     */
-    private extractFilterFields;
-    /**
-     * Optimize join type based on query characteristics
-     *
-     * Note: This method expects filter fields in one of two formats:
-     * 1. Table-prefixed: "tableName.fieldName" (e.g., "accounts.type")
-     * 2. Simple field name: "fieldName" (checked against joined table schema)
-     *
-     * Multi-level qualification (e.g., "schema.table.field") is not currently supported.
-     */
-    private optimizeJoinType;
-    /**
-     * Optimize a query AST to SQL
-     */
-    optimize(ast: OptimizableQueryAST): string;
-    /**
-     * Convert filter object to SQL WHERE clause
-     */
-    private filtersToSQL;
-    /**
-     * Fallback: generate basic SQL without optimizations
-     */
-    private generateBasicSQL;
-    /**
-     * Clear all registered schemas
-     */
-    clearSchemas(): void;
-}