rawsql-ts 0.1.0-beta.1 → 0.1.0-beta.10

package/dist/tokenReaders/SymbolTokenReader.js

@@ -0,0 +1,35 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SpecialSymbolTokenReader = void 0;
+const BaseTokenReader_1 = require("./BaseTokenReader");
+const Lexeme_1 = require("../models/Lexeme");
+/**
+ * Reads SQL symbol tokens (., ,, (, ))
+ */
+class SpecialSymbolTokenReader extends BaseTokenReader_1.BaseTokenReader {
+    /**
+     * Try to read a symbol token
+     */
+    tryRead(previous) {
+        if (this.isEndOfInput()) {
+            return null;
+        }
+        const char = this.input[this.position];
+        // symbol tokens
+        if (char in SpecialSymbolTokenReader.SPECIAL_SYMBOL_TOKENS) {
+            this.position++;
+            return this.createLexeme(SpecialSymbolTokenReader.SPECIAL_SYMBOL_TOKENS[char], char);
+        }
+        return null;
+    }
+}
+exports.SpecialSymbolTokenReader = SpecialSymbolTokenReader;
+SpecialSymbolTokenReader.SPECIAL_SYMBOL_TOKENS = {
+    '.': Lexeme_1.TokenType.Dot,
+    ',': Lexeme_1.TokenType.Comma,
+    '(': Lexeme_1.TokenType.OpenParen,
+    ')': Lexeme_1.TokenType.CloseParen,
+    '[': Lexeme_1.TokenType.OpenBracket,
+    ']': Lexeme_1.TokenType.CloseBracket,
+};
+//# sourceMappingURL=SymbolTokenReader.js.map

package/dist/tokenReaders/SymbolTokenReader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SymbolTokenReader.js","sourceRoot":"","sources":["../../src/tokenReaders/SymbolTokenReader.ts"],"names":[],"mappings":";;;AAAA,uDAAoD;AACpD,6CAAqD;AAErD;;GAEG;AACH,MAAa,wBAAyB,SAAQ,iCAAe;IAUzD;;OAEG;IACI,OAAO,CAAC,QAAuB;QAClC,IAAI,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEvC,gBAAgB;QAChB,IAAI,IAAI,IAAI,wBAAwB,CAAC,qBAAqB,EAAE,CAAC;YACzD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC,YAAY,CACpB,wBAAwB,CAAC,qBAAqB,CAAC,IAAI,CAAC,EACpD,IAAI,CACP,CAAC;QACN,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;;AA7BL,4DA8BC;AA7B2B,8CAAqB,GAA8B;IACvE,GAAG,EAAE,kBAAS,CAAC,GAAG;IAClB,GAAG,EAAE,kBAAS,CAAC,KAAK;IACpB,GAAG,EAAE,kBAAS,CAAC,SAAS;IACxB,GAAG,EAAE,kBAAS,CAAC,UAAU;IACzB,GAAG,EAAE,kBAAS,CAAC,WAAW;IAC1B,GAAG,EAAE,kBAAS,CAAC,YAAY;CAC9B,CAAC"}

package/dist/tokenReaders/TokenReaderManager.d.ts

@@ -0,0 +1,53 @@
+import { BaseTokenReader } from './BaseTokenReader';
+import { Lexeme } from '../models/Lexeme';
+/**
+ * Manages and coordinates multiple token readers
+ */
+export declare class TokenReaderManager {
+    private readers;
+    private input;
+    private position;
+    private tokenCache;
+    private cacheHits;
+    private cacheMisses;
+    constructor(input: string, position?: number);
+    /**
+     * Register a token reader
+     * @param reader The reader to register
+     * @returns This manager instance for chaining
+     */
+    register(reader: BaseTokenReader): TokenReaderManager;
+    /**
+     * Register multiple token readers
+     * @param readers The readers to register
+     * @returns This manager instance for chaining
+     */
+    registerAll(readers: BaseTokenReader[]): TokenReaderManager;
+    /**
+     * Update the position for all readers
+     */
+    private setPosition;
+    /**
+     * Try to read a token using all registered readers
+     * @param position The position to read from
+     * @param previous The previous token, if any
+     * @returns The lexeme if a reader could read it, null otherwise
+     */
+    tryRead(position: number, previous: Lexeme | null): Lexeme | null;
+    /**
+     * Get the maximum position among all readers
+     */
+    getMaxPosition(): number;
+    /**
+     * Get the input string
+     */
+    getInput(): string;
+    /**
+     * Get cache statistics
+     */
+    getCacheStats(): {
+        hits: number;
+        misses: number;
+        ratio: number;
+    };
+}

package/dist/tokenReaders/TokenReaderManager.js

@@ -0,0 +1,110 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TokenReaderManager = void 0;
+/**
+ * Manages and coordinates multiple token readers
+ */
+class TokenReaderManager {
+    constructor(input, position = 0) {
+        this.cacheHits = 0;
+        this.cacheMisses = 0;
+        this.input = input;
+        this.position = position;
+        this.readers = [];
+        this.tokenCache = new Map();
+    }
+    /**
+     * Register a token reader
+     * @param reader The reader to register
+     * @returns This manager instance for chaining
+     */
+    register(reader) {
+        this.readers.push(reader);
+        return this;
+    }
+    /**
+     * Register multiple token readers
+     * @param readers The readers to register
+     * @returns This manager instance for chaining
+     */
+    registerAll(readers) {
+        readers.forEach(reader => this.register(reader));
+        return this;
+    }
+    /**
+     * Update the position for all readers
+     */
+    setPosition(position) {
+        this.position = position;
+        for (const reader of this.readers) {
+            reader.setPosition(position);
+        }
+    }
+    /**
+     * Try to read a token using all registered readers
+     * @param position The position to read from
+     * @param previous The previous token, if any
+     * @returns The lexeme if a reader could read it, null otherwise
+     */
+    tryRead(position, previous) {
+        // Check cache - using position as the key
+        if (this.tokenCache.has(position)) {
+            // Cache hit
+            this.cacheHits++;
+            const lexeme = this.tokenCache.get(position) || null;
+            return lexeme;
+        }
+        // Cache miss - create new entry
+        this.cacheMisses++;
+        this.setPosition(position);
+        // Try to read with each reader
+        let lexeme = null;
+        for (const reader of this.readers) {
+            lexeme = reader.tryRead(previous);
+            if (lexeme) {
+                this.position = reader.getPosition();
+                break;
+            }
+        }
+        // Update all readers' positions
+        for (const reader of this.readers) {
+            reader.setPosition(this.position);
+        }
+        // Save to cache (even if null)
+        this.tokenCache.set(position, lexeme);
+        return lexeme;
+    }
+    /**
+     * Get the maximum position among all readers
+     */
+    getMaxPosition() {
+        let maxPosition = this.position;
+        for (const reader of this.readers) {
+            const position = reader.getPosition();
+            if (position > maxPosition) {
+                maxPosition = position;
+            }
+        }
+        return maxPosition;
+    }
+    /**
+     * Get the input string
+     */
+    getInput() {
+        return this.input;
+    }
+    /**
+     * Get cache statistics
+     */
+    getCacheStats() {
+        const total = this.cacheHits + this.cacheMisses;
+        const ratio = total > 0 ? this.cacheHits / total : 0;
+        return {
+            hits: this.cacheHits,
+            misses: this.cacheMisses,
+            ratio: ratio
+        };
+    }
+}
+exports.TokenReaderManager = TokenReaderManager;
+//# sourceMappingURL=TokenReaderManager.js.map

package/dist/tokenReaders/TokenReaderManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TokenReaderManager.js","sourceRoot":"","sources":["../../src/tokenReaders/TokenReaderManager.ts"],"names":[],"mappings":";;;AAGA;;GAEG;AACH,MAAa,kBAAkB;IAQ3B,YAAY,KAAa,EAAE,WAAmB,CAAC;QAHvC,cAAS,GAAW,CAAC,CAAC;QACtB,gBAAW,GAAW,CAAC,CAAC;QAG5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,MAAuB;QACnC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,OAA0B;QACzC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,QAAgB;QAChC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACI,OAAO,CAAC,QAAgB,EAAE,QAAuB;QACpD,0CAA0C;QAC1C,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,YAAY;YACZ,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;YACrD,OAAO,MAAM,CAAC;QAClB,CAAC;QAED,gCAAgC;QAChC,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAE3B,+BAA+B;QAC/B,IAAI,MAAM,GAAkB,IAAI,CAAC;QACjC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,MAAM,EAAE,CAAC;gBACT,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;gBACrC,MAAM;YACV,CAAC;QACL,CAAC;QAED,gCAAgC;QAChC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC;QAED,+BAA+B;QAC/B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACI,cAAc;QACjB,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACtC,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;gBACzB,WAAW,GAAG,QAAQ,CAAC;YAC3B,CAAC;QACL,CAAC;QACD,OAAO,WAAW,CAAC;IACvB,CAAC;IAED;;OAEG;IACI,QAAQ;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;OAEG;IACI,aAAa;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC;QAChD,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,OAAO;YACH,IAAI,EAAE,IAAI,CAAC,SAAS;YACpB,MAAM,EAAE,IAAI,CAAC,WAAW;YACxB,KAAK,EAAE,KAAK;SACf,CAAC;IACN,CAAC;CACJ;AArHD,gDAqHC"}

package/dist/tokenReaders/TypeTokenReader.d.ts

@@ -0,0 +1,11 @@
+import { BaseTokenReader } from './BaseTokenReader';
+import { Lexeme } from '../models/Lexeme';
+/**
+ * Reads SQL identifier tokens
+ */
+export declare class TypeTokenReader extends BaseTokenReader {
+    /**
+     * Try to read an identifier token
+     */
+    tryRead(previous: Lexeme | null): Lexeme | null;
+}

package/dist/tokenReaders/TypeTokenReader.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TypeTokenReader = void 0;
+const BaseTokenReader_1 = require("./BaseTokenReader");
+const Lexeme_1 = require("../models/Lexeme");
+const stringUtils_1 = require("../utils/stringUtils");
+const KeywordTrie_1 = require("../models/KeywordTrie");
+const KeywordParser_1 = require("../parsers/KeywordParser");
+// Use KeywordTrie to identify type names composed of multiple words.
+const trie = new KeywordTrie_1.KeywordTrie([
+    // type
+    ["double", "precision"],
+    ["character", "varying"],
+    ["time", "without", "time", "zone"],
+    ["time", "with", "time", "zone"],
+    ["timestamp", "without", "time", "zone"],
+    ["timestamp", "with", "time", "zone"],
+]);
+const typeParser = new KeywordParser_1.KeywordParser(trie);
+/**
+ * Reads SQL identifier tokens
+ */
+class TypeTokenReader extends BaseTokenReader_1.BaseTokenReader {
+    /**
+     * Try to read an identifier token
+     */
+    tryRead(previous) {
+        if (this.isEndOfInput()) {
+            return null;
+        }
+        // Check for keyword identifiers
+        const keyword = typeParser.parse(this.input, this.position);
+        if (keyword !== null) {
+            this.position = keyword.newPosition;
+            return this.createLexeme(Lexeme_1.TokenType.Type, keyword.keyword);
+        }
+        // check pervious token
+        if (previous === null) {
+            return null;
+        }
+        const result = stringUtils_1.StringUtils.tryReadRegularIdentifier(this.input, this.position);
+        if (!result) {
+            return null;
+        }
+        this.position = result.newPosition;
+        // type cast command
+        if (previous.type === Lexeme_1.TokenType.Command && previous.value === "as") {
+            // If the previous token is the `as` keyword, it could be a type cast or an identifier
+            return this.createLexeme(Lexeme_1.TokenType.Identifier, result.identifier, true);
+        }
+        // postgres type conversion
+        if (previous.type === Lexeme_1.TokenType.Operator && previous.value === "::") {
+            return this.createLexeme(Lexeme_1.TokenType.Type, result.identifier);
+        }
+        return null;
+    }
+}
+exports.TypeTokenReader = TypeTokenReader;
+//# sourceMappingURL=TypeTokenReader.js.map

package/dist/tokenReaders/TypeTokenReader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TypeTokenReader.js","sourceRoot":"","sources":["../../src/tokenReaders/TypeTokenReader.ts"],"names":[],"mappings":";;;AAAA,uDAAoD;AACpD,6CAAqD;AACrD,sDAAmD;AACnD,uDAAoD;AACpD,4DAAyD;AAEzD,qEAAqE;AACrE,MAAM,IAAI,GAAG,IAAI,yBAAW,CAAC;IACzB,OAAO;IACP,CAAC,QAAQ,EAAE,WAAW,CAAC;IACvB,CAAC,WAAW,EAAE,SAAS,CAAC;IACxB,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC;IACnC,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;IAChC,CAAC,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC;IACxC,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;CACxC,CAAC,CAAC;AACH,MAAM,UAAU,GAAG,IAAI,6BAAa,CAAC,IAAI,CAAC,CAAC;AAE3C;;GAEG;AACH,MAAa,eAAgB,SAAQ,iCAAe;IAChD;;OAEG;IACI,OAAO,CAAC,QAAuB;QAClC,IAAI,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,gCAAgC;QAChC,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,WAAW,CAAC;YACpC,OAAO,IAAI,CAAC,YAAY,CAAC,kBAAS,CAAC,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;QAC9D,CAAC;QAED,uBAAuB;QACvB,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,MAAM,GAAG,yBAAW,CAAC,wBAAwB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/E,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC;QAEnC,oBAAoB;QACpB,IAAI,QAAQ,CAAC,IAAI,KAAK,kBAAS,CAAC,OAAO,IAAI,QAAQ,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACjE,sFAAsF;YACtF,OAAO,IAAI,CAAC,YAAY,CAAC,kBAAS,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC5E,CAAC;QAED,2BAA2B;QAC3B,IAAI,QAAQ,CAAC,IAAI,KAAK,kBAAS,CAAC,QAAQ,IAAI,QAAQ,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YAClE,OAAO,IAAI,CAAC,YAAY,CAAC,kBAAS,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;QAChE,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;CACJ;AAxCD,0CAwCC"}

package/dist/transformers/CTEBuilder.d.ts

@@ -0,0 +1,52 @@
+import { CommonTable, WithClause } from "../models/Clause";
+/**
+ * CTENameConflictResolver is responsible for resolving name conflicts among Common Table Expressions (CTEs).
+ * It also sorts the tables in the proper order based on dependencies and recursiveness.
+ */
+export declare class CTEBuilder {
+    private sourceCollector;
+    private cteCollector;
+    private formatter;
+    constructor();
+    /**
+     * Resolves name conflicts among CommonTables.
+     * If there are duplicate CTE names, they must have identical definitions.
+     * Also sorts the tables so that:
+     * 1. Recursive CTEs come first (CTEs that reference themselves)
+     * 2. Then remaining tables are sorted so inner (deeper) CTEs come before outer CTEs
+     *
+     * @param commonTables The list of CommonTables to check for name conflicts
+     * @returns An object containing:
+     *          - needRecursive: boolean indicating if any recursive CTEs are present
+     *          - commonTables: A new list of CommonTables with resolved name conflicts and proper order
+     * @throws Error if there are duplicate CTE names with different definitions
+     */
+    build(commonTables: CommonTable[]): WithClause;
+    /**
+     * Resolves duplicate CTE names by checking if they have identical definitions.
+     * If definitions differ, throws an error.
+     *
+     * @param commonTables The list of CTEs to check for duplicates
+     * @returns A list of CTEs with duplicates removed
+     * @throws Error if there are duplicate CTE names with different definitions
+     */
+    private resolveDuplicateNames;
+    /**
+     * Builds a dependency graph of CTEs and identifies recursive CTEs.
+     *
+     * @param tables The list of CTEs to analyze
+     * @returns Object containing the table map, set of recursive CTEs, and dependency map
+     */
+    private buildDependencyGraph;
+    /**
+     * Sorts the CTEs using topological sort, with recursive CTEs coming first.
+     *
+     * @param tables The list of CTEs to sort
+     * @param tableMap Map of table names to their CommonTable objects
+     * @param recursiveCTEs Set of table names that are recursive (self-referential)
+     * @param dependencies Map of table dependencies
+     * @returns Sorted list of CTEs
+     * @throws Error if a circular reference is detected
+     */
+    private sortCommonTables;
+}

package/dist/transformers/CTEBuilder.js

@@ -0,0 +1,188 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CTEBuilder = void 0;
+const Clause_1 = require("../models/Clause");
+const CTECollector_1 = require("./CTECollector");
+const TableSourceCollector_1 = require("./TableSourceCollector");
+const Formatter_1 = require("./Formatter");
+/**
+ * CTENameConflictResolver is responsible for resolving name conflicts among Common Table Expressions (CTEs).
+ * It also sorts the tables in the proper order based on dependencies and recursiveness.
+ */
+class CTEBuilder {
+    constructor() {
+        this.sourceCollector = new TableSourceCollector_1.TableSourceCollector(true);
+        this.cteCollector = new CTECollector_1.CTECollector();
+        this.formatter = new Formatter_1.Formatter();
+    }
+    /**
+     * Resolves name conflicts among CommonTables.
+     * If there are duplicate CTE names, they must have identical definitions.
+     * Also sorts the tables so that:
+     * 1. Recursive CTEs come first (CTEs that reference themselves)
+     * 2. Then remaining tables are sorted so inner (deeper) CTEs come before outer CTEs
+     *
+     * @param commonTables The list of CommonTables to check for name conflicts
+     * @returns An object containing:
+     *          - needRecursive: boolean indicating if any recursive CTEs are present
+     *          - commonTables: A new list of CommonTables with resolved name conflicts and proper order
+     * @throws Error if there are duplicate CTE names with different definitions
+     */
+    build(commonTables) {
+        // Early return for empty CTEs
+        // Note:
+        // Although it may seem reasonable to return early when there is only one element,
+        // the 'recursive' property is determined dynamically. Therefore, if there is at least one element,
+        // the CTEs must be rebuilt to ensure correct recursive detection.
+        if (commonTables.length === 0) {
+            return new Clause_1.WithClause(false, commonTables);
+        }
+        // Step 1: Resolve name conflicts
+        const resolvedTables = this.resolveDuplicateNames(commonTables);
+        // Step 2: Identify recursive CTEs and build dependency graph
+        const { tableMap, recursiveCTEs, dependencies } = this.buildDependencyGraph(resolvedTables);
+        // Step 3: Sort tables according to dependencies and recursiveness
+        const sortedTables = this.sortCommonTables(resolvedTables, tableMap, recursiveCTEs, dependencies);
+        return new Clause_1.WithClause(recursiveCTEs.size > 0, sortedTables);
+    }
+    /**
+     * Resolves duplicate CTE names by checking if they have identical definitions.
+     * If definitions differ, throws an error.
+     *
+     * @param commonTables The list of CTEs to check for duplicates
+     * @returns A list of CTEs with duplicates removed
+     * @throws Error if there are duplicate CTE names with different definitions
+     */
+    resolveDuplicateNames(commonTables) {
+        // Group CTEs by their names
+        const ctesByName = new Map();
+        for (const table of commonTables) {
+            const tableName = table.aliasExpression.table.name;
+            if (!ctesByName.has(tableName)) {
+                ctesByName.set(tableName, []);
+            }
+            ctesByName.get(tableName).push(table);
+        }
+        // Resolve name duplications
+        const resolvedTables = [];
+        for (const [name, tables] of ctesByName.entries()) {
+            if (tables.length === 1) {
+                // No duplication
+                resolvedTables.push(tables[0]);
+                continue;
+            }
+            // For duplicate names, check if definitions are identical
+            const definitions = tables.map(table => this.formatter.format(table.query));
+            const uniqueDefinitions = new Set(definitions);
+            if (uniqueDefinitions.size === 1) {
+                // If all definitions are identical, use only the first one
+                resolvedTables.push(tables[0]);
+            }
+            else {
+                // Error if definitions differ
+                throw new Error(`CTE name conflict detected: '${name}' has multiple different definitions`);
+            }
+        }
+        return resolvedTables;
+    }
+    /**
+     * Builds a dependency graph of CTEs and identifies recursive CTEs.
+     *
+     * @param tables The list of CTEs to analyze
+     * @returns Object containing the table map, set of recursive CTEs, and dependency map
+     */
+    buildDependencyGraph(tables) {
+        // Create a map of table names for quick lookup
+        const tableMap = new Map();
+        for (const table of tables) {
+            tableMap.set(table.aliasExpression.table.name, table);
+        }
+        // Identify recursive CTEs (those that reference themselves)
+        const recursiveCTEs = new Set();
+        // Build dependency graph: which tables reference which other tables
+        const dependencies = new Map();
+        const referencedBy = new Map();
+        for (const table of tables) {
+            const tableName = table.aliasExpression.table.name;
+            // Check for self-references (recursive CTEs)
+            const referencedTables = this.sourceCollector.collect(table.query);
+            // Check if this CTE references itself
+            for (const referencedTable of referencedTables) {
+                if (referencedTable.table.name === tableName) {
+                    recursiveCTEs.add(tableName);
+                    break;
+                }
+            }
+            // Setup dependencies
+            if (!dependencies.has(tableName)) {
+                dependencies.set(tableName, new Set());
+            }
+            // Find any references to other CTEs in this table's query
+            const referencedCTEs = this.cteCollector.collect(table.query);
+            for (const referencedCTE of referencedCTEs) {
+                const referencedName = referencedCTE.aliasExpression.table.name;
+                // Only consider references to tables in our collection
+                if (tableMap.has(referencedName)) {
+                    dependencies.get(tableName).add(referencedName);
+                    // Add the reverse relationship
+                    if (!referencedBy.has(referencedName)) {
+                        referencedBy.set(referencedName, new Set());
+                    }
+                    referencedBy.get(referencedName).add(tableName);
+                }
+            }
+        }
+        return { tableMap, recursiveCTEs, dependencies };
+    }
+    /**
+     * Sorts the CTEs using topological sort, with recursive CTEs coming first.
+     *
+     * @param tables The list of CTEs to sort
+     * @param tableMap Map of table names to their CommonTable objects
+     * @param recursiveCTEs Set of table names that are recursive (self-referential)
+     * @param dependencies Map of table dependencies
+     * @returns Sorted list of CTEs
+     * @throws Error if a circular reference is detected
+     */
+    sortCommonTables(tables, tableMap, recursiveCTEs, dependencies) {
+        const recursiveResult = [];
+        const nonRecursiveResult = [];
+        const visited = new Set();
+        const visiting = new Set();
+        // Topological sort function
+        const visit = (tableName) => {
+            if (visited.has(tableName))
+                return;
+            if (visiting.has(tableName)) {
+                throw new Error(`Circular reference detected in CTE: ${tableName}`);
+            }
+            visiting.add(tableName);
+            // Process dependencies first (inner CTEs)
+            const deps = dependencies.get(tableName) || new Set();
+            for (const dep of deps) {
+                visit(dep);
+            }
+            visiting.delete(tableName);
+            visited.add(tableName);
+            // Add this table after its dependencies
+            // Recursive CTEs go to recursiveResult, others to nonRecursiveResult
+            if (recursiveCTEs.has(tableName)) {
+                recursiveResult.push(tableMap.get(tableName));
+            }
+            else {
+                nonRecursiveResult.push(tableMap.get(tableName));
+            }
+        };
+        // Process all tables
+        for (const table of tables) {
+            const tableName = table.aliasExpression.table.name;
+            if (!visited.has(tableName)) {
+                visit(tableName);
+            }
+        }
+        // Combine the results: recursive CTEs first, then non-recursive CTEs
+        return [...recursiveResult, ...nonRecursiveResult];
+    }
+}
+exports.CTEBuilder = CTEBuilder;
+//# sourceMappingURL=CTEBuilder.js.map

package/dist/transformers/CTEBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CTEBuilder.js","sourceRoot":"","sources":["../../src/transformers/CTEBuilder.ts"],"names":[],"mappings":";;;AAAA,6CAA2D;AAC3D,iDAA8C;AAC9C,iEAA8D;AAC9D,2CAAwC;AAExC;;;GAGG;AACH,MAAa,UAAU;IAKnB;QACI,IAAI,CAAC,eAAe,GAAG,IAAI,2CAAoB,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,CAAC,YAAY,GAAG,IAAI,2BAAY,EAAE,CAAC;QACvC,IAAI,CAAC,SAAS,GAAG,IAAI,qBAAS,EAAE,CAAC;IACrC,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,KAAK,CAAC,YAA2B;QACpC,8BAA8B;QAC9B,QAAQ;QACR,kFAAkF;QAClF,mGAAmG;QACnG,kEAAkE;QAClE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,IAAI,mBAAU,CACjB,KAAK,EACL,YAAY,CACf,CAAC;QACN,CAAC;QAED,iCAAiC;QACjC,MAAM,cAAc,GAAG,IAAI,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC;QAEhE,6DAA6D;QAC7D,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC,cAAc,CAAC,CAAC;QAE5F,kEAAkE;QAClE,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,CAAC,CAAC;QAElG,OAAO,IAAI,mBAAU,CACjB,aAAa,CAAC,IAAI,GAAG,CAAC,EACtB,YAAY,CACf,CAAC;IACN,CAAC;IAED;;;;;;;OAOG;IACK,qBAAqB,CAAC,YAA2B;QACrD,4BAA4B;QAC5B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAC;QACpD,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC;YACnD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7B,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAClC,CAAC;YACD,UAAU,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC;QAED,4BAA4B;QAC5B,MAAM,cAAc,GAAkB,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,iBAAiB;gBACjB,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,SAAS;YACb,CAAC;YAED,0DAA0D;YAC1D,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5E,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;YAE/C,IAAI,iBAAiB,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC/B,2DAA2D;gBAC3D,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACJ,8BAA8B;gBAC9B,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,sCAAsC,CAAC,CAAC;YAChG,CAAC;QACL,CAAC;QAED,OAAO,cAAc,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACK,oBAAoB,CAAC,MAAqB;QAK9C,+CAA+C;QAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YACzB,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC1D,CAAC;QAED,4DAA4D;QAC5D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QAExC,oEAAoE;QACpE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;QACpD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;QAEpD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YACzB,MAAM,SAAS,GAAG,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC;YAEnD,6CAA6C;YAC7C,MAAM,gBAAgB,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAEnE,sCAAsC;YACtC,KAAK,MAAM,eAAe,IAAI,gBAAgB,EAAE,CAAC;gBAC7C,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC3C,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;oBAC7B,MAAM;gBACV,CAAC;YACL,CAAC;YAED,qBAAqB;YACrB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC/B,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC;YACnD,CAAC;YAED,0DAA0D;YAC1D,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAE9D,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE,CAAC;gBACzC,MAAM,cAAc,GAAG,aAAa,CAAC,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC;gBAEhE,uDAAuD;gBACvD,IAAI,QAAQ,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;oBAC/B,YAAY,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;oBAEjD,+BAA+B;oBAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;wBACpC,YAAY,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC;oBACxD,CAAC;oBACD,YAAY,CAAC,GAAG,CAAC,cAAc,CAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACrD,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC;IACrD,CAAC;IAED;;;;;;;;;OASG;IACK,gBAAgB,CACpB,MAAqB,EACrB,QAAkC,EAClC,aAA0B,EAC1B,YAAsC;QAEtC,MAAM,eAAe,GAAkB,EAAE,CAAC;QAC1C,MAAM,kBAAkB,GAAkB,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAEnC,4BAA4B;QAC5B,MAAM,KAAK,GAAG,CAAC,SAAiB,EAAE,EAAE;YAChC,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,OAAO;YACnC,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,KAAK,CAAC,uCAAuC,SAAS,EAAE,CAAC,CAAC;YACxE,CAAC;YAED,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAExB,0CAA0C;YAC1C,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YAC9D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACrB,KAAK,CAAC,GAAG,CAAC,CAAC;YACf,CAAC;YAED,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEvB,wCAAwC;YACxC,qEAAqE;YACrE,IAAI,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC/B,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,CAAC;YACnD,CAAC;iBAAM,CAAC;gBACJ,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,CAAC;YACtD,CAAC;QACL,CAAC,CAAC;QAEF,qBAAqB;QACrB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YACzB,MAAM,SAAS,GAAG,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC;YACnD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC1B,KAAK,CAAC,SAAS,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QAED,qEAAqE;QACrE,OAAO,CAAC,GAAG,eAAe,EAAE,GAAG,kBAAkB,CAAC,CAAC;IACvD,CAAC;CACJ;AA5ND,gCA4NC"}

package/dist/transformers/CTECollector.d.ts

@@ -0,0 +1,81 @@
+import { CommonTable } from "../models/Clause";
+import { SelectQuery } from "../models/SelectQuery";
+import { SqlComponent, SqlComponentVisitor } from "../models/SqlComponent";
+/**
+ * A visitor that collects all CommonTable instances from a SQL query structure.
+ * This includes tables from:
+ * - WITH clauses
+ * - Subqueries
+ * - Inline queries
+ * - UNION queries
+ * - Value components that may contain queries
+ */
+export declare class CTECollector implements SqlComponentVisitor<void> {
+    private handlers;
+    private commonTables;
+    private visitedNodes;
+    private isRootVisit;
+    constructor();
+    /**
+     * Get all collected CommonTables
+     */
+    getCommonTables(): CommonTable[];
+    /**
+     * Reset the collection of CommonTables
+     */
+    private reset;
+    collect(query: SelectQuery): CommonTable[];
+    /**
+     * Main entry point for the visitor pattern.
+     * Implements the shallow visit pattern to distinguish between root and recursive visits.
+     */
+    visit(arg: SqlComponent): void;
+    /**
+     * Internal visit method used for all nodes.
+     * This separates the visit flag management from the actual node visitation logic.
+     */
+    private visitNode;
+    private visitSimpleSelectQuery;
+    private visitBinarySelectQuery;
+    private visitValuesQuery;
+    private visitWithClause;
+    private visitCommonTable;
+    private visitSelectClause;
+    private visitSelectItem;
+    private visitFromClause;
+    private visitSourceExpression;
+    private visitTableSource;
+    private visitParenSource;
+    private visitSubQuerySource;
+    private visitInlineQuery;
+    private visitJoinClause;
+    private visitJoinOnClause;
+    private visitJoinUsingClause;
+    private visitWhereClause;
+    private visitGroupByClause;
+    private visitHavingClause;
+    private visitOrderByClause;
+    private visitWindowFrameClause;
+    private visitLimitClause;
+    private visitForClause;
+    private visitOrderByItem;
+    private visitParenExpression;
+    private visitBinaryExpression;
+    private visitUnaryExpression;
+    private visitCaseExpression;
+    private visitSwitchCaseArgument;
+    private visitCaseKeyValuePair;
+    private visitBetweenExpression;
+    private visitFunctionCall;
+    private visitArrayExpression;
+    private visitTupleExpression;
+    private visitCastExpression;
+    private visitTypeValue;
+    private visitWindowFrameExpression;
+    private visitWindowFrameSpec;
+    private visitIdentifierString;
+    private visitRawString;
+    private visitColumnReference;
+    private visitParameterExpression;
+    private visitLiteralValue;
+}