@libar-dev/architect 1.0.0-pre.3

package/dist/generators/content-deduplicator.js

@@ -0,0 +1,356 @@
+/**
+ * @architect
+ * @architect-core
+ * @architect-pattern ContentDeduplicator
+ * @architect-status completed
+ * @architect-arch-role infrastructure
+ * @architect-arch-context generator
+ * @architect-arch-layer infrastructure
+ *
+ * ## Content Deduplicator - Duplicate Content Detection and Merging
+ *
+ * Identifies and merges duplicate sections extracted from multiple sources.
+ * Uses content fingerprinting to detect duplicates and merges them based on
+ * configurable priority rules.
+ *
+ * ### When to Use
+ *
+ * - After source mapping extracts content from multiple files
+ * - When multiple sources may contain the same documentation
+ * - Before assembling the final RenderableDocument
+ *
+ * ### Key Concepts
+ *
+ * - **Content Fingerprint**: SHA-256 hash of normalized text for duplicate detection
+ * - **Source Priority**: TypeScript > Decision > Feature file
+ * - **Content Richness**: More lines wins when priorities are equal
+ * - **Header Disambiguation**: Adds source suffix when headers conflict
+ */
+import * as crypto from 'node:crypto';
+// =============================================================================
+// Constants
+// =============================================================================
+/**
+ * Source priority values (higher = more authoritative)
+ */
+const SOURCE_PRIORITY = {
+    typescript: 3, // .ts files
+    decision: 2, // THIS DECISION markers
+    feature: 1, // .feature files
+};
+/**
+ * Length of fingerprint hex string to display.
+ *
+ * 16 hex characters = 64 bits provides sufficient collision resistance for
+ * documentation deduplication. Birthday paradox collision probability is
+ * less than 0.001% for up to 10,000 sections.
+ */
+const FINGERPRINT_DISPLAY_LENGTH = 16;
+// =============================================================================
+// Helper Functions
+// =============================================================================
+/**
+ * Normalize content for fingerprinting.
+ * Strips whitespace variations to detect semantically identical content.
+ */
+function normalizeForFingerprint(content) {
+    return content
+        .split('\n')
+        .map((line) => line.trim())
+        .filter((line) => line.length > 0)
+        .join(' ')
+        .replace(/\s+/g, ' ')
+        .toLowerCase();
+}
+/**
+ * Compute a content fingerprint using SHA-256.
+ * Returns a 16-character hex string (64 bits).
+ *
+ * Note: 16 hex chars (64 bits) provides sufficient collision resistance for
+ * documentation deduplication. Birthday paradox collision probability is
+ * less than 0.001% for up to 10,000 sections, which exceeds expected usage.
+ */
+export function computeFingerprint(content) {
+    const normalized = normalizeForFingerprint(content);
+    return crypto
+        .createHash('sha256')
+        .update(normalized)
+        .digest('hex')
+        .slice(0, FINGERPRINT_DISPLAY_LENGTH);
+}
+/**
+ * Determine source type from file path.
+ * Returns isUnknown=true for unrecognized file extensions.
+ */
+function getSourceType(sourceFile) {
+    if (sourceFile.endsWith('.ts')) {
+        return { type: 'typescript', isUnknown: false };
+    }
+    if (sourceFile.toUpperCase().includes('THIS DECISION')) {
+        return { type: 'decision', isUnknown: false };
+    }
+    if (sourceFile.endsWith('.feature')) {
+        return { type: 'feature', isUnknown: false };
+    }
+    // Default to feature (lowest priority) for unknown types
+    return { type: 'feature', isUnknown: true };
+}
+/**
+ * Get priority value for a source file
+ */
+function getSourcePriority(sourceFile) {
+    const { type } = getSourceType(sourceFile);
+    return SOURCE_PRIORITY[type] ?? 1;
+}
+/**
+ * Count non-empty lines in content
+ */
+function countLines(content) {
+    return content.split('\n').filter((line) => line.trim().length > 0).length;
+}
+/**
+ * Convert ExtractedSection to ContentBlock with original index tracking
+ *
+ * @param section - The extracted section to convert
+ * @param index - Original index in the sections array (for precise removal)
+ */
+function sectionToBlock(section, index) {
+    return {
+        header: section.section,
+        body: section.content,
+        source: section.sourceFile,
+        fingerprint: computeFingerprint(section.content),
+        lineCount: countLines(section.content),
+        originalIndex: index,
+    };
+}
+/**
+ * Find duplicate content blocks by fingerprint.
+ * Returns a map from fingerprint to all blocks with that fingerprint.
+ */
+export function findDuplicates(blocks) {
+    const groups = new Map();
+    for (const block of blocks) {
+        if (!block.fingerprint) {
+            continue;
+        }
+        const existing = groups.get(block.fingerprint);
+        if (existing) {
+            existing.push(block);
+        }
+        else {
+            groups.set(block.fingerprint, [block]);
+        }
+    }
+    // Filter to only groups with duplicates
+    const duplicates = new Map();
+    for (const [fingerprint, group] of groups) {
+        if (group.length > 1) {
+            duplicates.set(fingerprint, group);
+        }
+    }
+    return duplicates;
+}
+/**
+ * Choose which block to keep from a set of duplicates.
+ * Higher priority source wins; if equal, richer content (more lines) wins.
+ *
+ * Uses non-empty tuple type to guarantee at compile time that at least
+ * one block exists. Callers must ensure the array is non-empty before calling.
+ *
+ * @param blocks - Non-empty array of content blocks (at least one element)
+ * @returns The winning block
+ */
+function chooseWinner(blocks) {
+    const [first, ...rest] = blocks;
+    let winner = first;
+    for (const block of rest) {
+        const winnerPriority = getSourcePriority(winner.source);
+        const blockPriority = getSourcePriority(block.source);
+        if (blockPriority > winnerPriority) {
+            winner = block;
+        }
+        else if (blockPriority === winnerPriority && block.lineCount > winner.lineCount) {
+            winner = block;
+        }
+    }
+    return winner;
+}
+/**
+ * Find sections with same header but different content (header conflicts)
+ */
+function findHeaderConflicts(sections) {
+    const byHeader = new Map();
+    for (const section of sections) {
+        const existing = byHeader.get(section.section);
+        if (existing) {
+            existing.push(section);
+        }
+        else {
+            byHeader.set(section.section, [section]);
+        }
+    }
+    // Filter to only headers with multiple sections AND different fingerprints
+    const conflicts = new Map();
+    for (const [header, group] of byHeader) {
+        if (group.length > 1) {
+            const fingerprints = new Set(group.map((s) => computeFingerprint(s.content)));
+            if (fingerprints.size > 1) {
+                conflicts.set(header, group);
+            }
+        }
+    }
+    return conflicts;
+}
+/**
+ * Disambiguate headers by adding source suffix
+ */
+function disambiguateHeader(section) {
+    // Extract a short source name from the file path
+    const sourceName = section.sourceFile
+        .replace(/^.*\//, '') // Remove path
+        .replace(/\.[^.]+$/, '') // Remove extension
+        .replace(/[_]/g, '-') // Normalize underscores to hyphens
+        .toLowerCase();
+    return `${section.section} (from ${sourceName})`;
+}
+// =============================================================================
+// Main Function
+// =============================================================================
+/**
+ * Deduplicate sections extracted from multiple sources.
+ *
+ * Algorithm:
+ * 1. Convert sections to content blocks with fingerprints
+ * 2. Find duplicate fingerprints
+ * 3. For each duplicate group, keep highest priority source (or richest content)
+ * 4. Handle header conflicts (same header, different content)
+ * 5. Remove empty sections
+ * 6. Preserve original order (first occurrence position)
+ *
+ * @param sections - Extracted sections to deduplicate
+ * @param options - Deduplication options
+ * @returns Deduplicated sections with merge info and warnings
+ */
+export function deduplicateSections(sections, options) {
+    const warnings = [];
+    const mergedPairs = [];
+    if (sections.length === 0) {
+        return { sections: [], mergedPairs: [], warnings: [] };
+    }
+    // Check for unknown source types and warn (prevents silent data deprioritization)
+    const seenUnknownExtensions = new Set();
+    for (const section of sections) {
+        const { isUnknown } = getSourceType(section.sourceFile);
+        if (isUnknown) {
+            const ext = section.sourceFile.slice(section.sourceFile.lastIndexOf('.'));
+            // Only warn once per extension type to avoid flooding
+            if (!seenUnknownExtensions.has(ext)) {
+                seenUnknownExtensions.add(ext);
+                const warning = {
+                    source: section.sourceFile,
+                    category: 'deduplication',
+                    message: `Unknown file type "${ext}" treated as feature (lowest priority)`,
+                };
+                warnings.push(warning);
+                if (options?.warningCollector) {
+                    options.warningCollector.capture(warning);
+                }
+            }
+        }
+    }
+    // Convert to content blocks with original indices for precise removal
+    const blocks = sections.map((section, index) => sectionToBlock(section, index));
+    // Find duplicates by fingerprint
+    const duplicates = findDuplicates(blocks);
+    // Track which sections to remove (by original index)
+    const removeIndices = new Set();
+    // Process each duplicate group
+    for (const [_fingerprint, duplicateBlocks] of duplicates) {
+        // Defensive guard: findDuplicates() should only return groups with 2+ blocks
+        // (see filter at line 216), but we guard against invariant violations.
+        if (duplicateBlocks.length === 0) {
+            continue;
+        }
+        const winner = chooseWinner(duplicateBlocks);
+        // Mark losers for removal using their original indices
+        for (const block of duplicateBlocks) {
+            if (block !== winner) {
+                // Use the tracked original index for precise removal
+                // This avoids mismatch when same file has duplicate headers
+                const idx = block.originalIndex;
+                if (idx !== undefined) {
+                    removeIndices.add(idx);
+                    mergedPairs.push({
+                        kept: winner,
+                        removed: block,
+                    });
+                    // Capture warning if collector provided
+                    if (options?.warningCollector) {
+                        options.warningCollector.capture({
+                            source: block.source,
+                            category: 'deduplication',
+                            message: `Duplicate content merged; kept version from ${winner.source}`,
+                        });
+                    }
+                    warnings.push({
+                        source: block.source,
+                        category: 'deduplication',
+                        message: `Duplicate content merged; kept version from ${winner.source}`,
+                    });
+                }
+            }
+        }
+    }
+    // Build filtered section list (preserving order)
+    // Explicitly type to ensure ExtractedSection compatibility
+    let filteredSections = sections
+        .filter((_, idx) => !removeIndices.has(idx))
+        .map((s) => ({
+        section: s.section,
+        sourceFile: s.sourceFile,
+        extractionMethod: s.extractionMethod,
+        content: s.content,
+        ...(s.shapes !== undefined && { shapes: s.shapes }),
+        ...(s.docStrings !== undefined && { docStrings: s.docStrings }),
+    }));
+    // Handle header conflicts (same header, different content from different sources)
+    const headerConflicts = findHeaderConflicts(filteredSections);
+    for (const [header, conflictingSections] of headerConflicts) {
+        // Disambiguate headers
+        for (const section of conflictingSections) {
+            const idx = filteredSections.findIndex((s) => s.section === header && s.sourceFile === section.sourceFile);
+            const existing = idx !== -1 ? filteredSections[idx] : undefined;
+            if (idx !== -1 && existing) {
+                filteredSections[idx] = {
+                    section: disambiguateHeader(section),
+                    sourceFile: existing.sourceFile,
+                    extractionMethod: existing.extractionMethod,
+                    content: existing.content,
+                    ...(existing.shapes !== undefined && { shapes: existing.shapes }),
+                    ...(existing.docStrings !== undefined && { docStrings: existing.docStrings }),
+                };
+            }
+        }
+    }
+    // Remove empty sections
+    const emptySections = filteredSections.filter((s) => !s.content || s.content.trim().length === 0);
+    for (const emptySection of emptySections) {
+        const warning = {
+            source: emptySection.sourceFile,
+            category: 'deduplication',
+            message: `Empty section "${emptySection.section}" removed`,
+        };
+        warnings.push(warning);
+        if (options?.warningCollector) {
+            options.warningCollector.capture(warning);
+        }
+    }
+    filteredSections = filteredSections.filter((s) => s.content.trim().length > 0);
+    return {
+        sections: filteredSections,
+        mergedPairs,
+        warnings,
+    };
+}
+//# sourceMappingURL=content-deduplicator.js.map

package/dist/generators/content-deduplicator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"content-deduplicator.js","sourceRoot":"","sources":["../../src/generators/content-deduplicator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AAyEtC,gFAAgF;AAChF,YAAY;AACZ,gFAAgF;AAEhF;;GAEG;AACH,MAAM,eAAe,GAA2B;IAC9C,UAAU,EAAE,CAAC,EAAE,YAAY;IAC3B,QAAQ,EAAE,CAAC,EAAE,wBAAwB;IACrC,OAAO,EAAE,CAAC,EAAE,iBAAiB;CAC9B,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,0BAA0B,GAAG,EAAE,CAAC;AAEtC,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;GAGG;AACH,SAAS,uBAAuB,CAAC,OAAe;IAC9C,OAAO,OAAO;SACX,KAAK,CAAC,IAAI,CAAC;SACX,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;SAC1B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SACjC,IAAI,CAAC,GAAG,CAAC;SACT,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,WAAW,EAAE,CAAC;AACnB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAe;IAChD,MAAM,UAAU,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;IACpD,OAAO,MAAM;SACV,UAAU,CAAC,QAAQ,CAAC;SACpB,MAAM,CAAC,UAAU,CAAC;SAClB,MAAM,CAAC,KAAK,CAAC;SACb,KAAK,CAAC,CAAC,EAAE,0BAA0B,CAAC,CAAC;AAC1C,CAAC;AAUD;;;GAGG;AACH,SAAS,aAAa,CAAC,UAAkB;IACvC,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAClD,CAAC;IACD,IAAI,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,eAAe,CAAC,EAAE,CAAC;QACvD,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAChD,CAAC;IACD,IAAI,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QACpC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAC/C,CAAC;IACD,yDAAyD;IACzD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAC9C,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,UAAkB;IAC3C,MAAM,EAAE,IAAI,EAAE,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;IAC3C,OAAO,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,OAAe;IACjC,OAAO,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;AAC7E,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,OAAyB,EAAE,KAAa;IAC9D,OAAO;QACL,MAAM,EAAE,OAAO,CAAC,OAAO;QACvB,IAAI,EAAE,OAAO,CAAC,OAAO;QACrB,MAAM,EAAE,OAAO,CAAC,UAAU;QAC1B,WAAW,EAAE,kBAAkB,CAAC,OAAO,CAAC,OAAO,CAAC;QAChD,SAAS,EAAE,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC;QACtC,aAAa,EAAE,KAAK;KACrB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAsB;IACnD,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IAEjD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YACvB,SAAS;QACX,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC/C,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,wCAAwC;IACxC,MAAM,UAAU,GAAG,IAAI,GAAG,EAA0B,CAAC;IACrD,KAAK,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QAC1C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,YAAY,CAAC,MAAyC;IAC7D,MAAM,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC;IAEhC,IAAI,MAAM,GAAiB,KAAK,CAAC;IAEjC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,cAAc,GAAG,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,aAAa,GAAG,iBAAiB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAEtD,IAAI,aAAa,GAAG,cAAc,EAAE,CAAC;YACnC,MAAM,GAAG,KAAK,CAAC;QACjB,CAAC;aAAM,IAAI,aAAa,KAAK,cAAc,IAAI,KAAK,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;YAClF,MAAM,GAAG,KAAK,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,QAA4B;IACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA8B,CAAC;IAEvD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC/C,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,MAAM,SAAS,GAAG,IAAI,GAAG,EAA8B,CAAC;IACxD,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACvC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9E,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC1B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,OAAyB;IACnD,iDAAiD;IACjD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU;SAClC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,cAAc;SACnC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,mBAAmB;SAC3C,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,mCAAmC;SACxD,WAAW,EAAE,CAAC;IAEjB,OAAO,GAAG,OAAO,CAAC,OAAO,UAAU,UAAU,GAAG,CAAC;AACnD,CAAC;AAED,gFAAgF;AAChF,gBAAgB;AAChB,gFAAgF;AAEhF;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,mBAAmB,CACjC,QAAqC,EACrC,OAA6B;IAE7B,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,WAAW,GAAiB,EAAE,CAAC;IAErC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACzD,CAAC;IAED,kFAAkF;IAClF,MAAM,qBAAqB,GAAG,IAAI,GAAG,EAAU,CAAC;IAChD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,EAAE,SAAS,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACxD,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1E,sDAAsD;YACtD,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpC,qBAAqB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC/B,MAAM,OAAO,GAAY;oBACvB,MAAM,EAAE,OAAO,CAAC,UAAU;oBAC1B,QAAQ,EAAE,eAAe;oBACzB,OAAO,EAAE,sBAAsB,GAAG,wCAAwC;iBAC3E,CAAC;gBACF,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACvB,IAAI,OAAO,EAAE,gBAAgB,EAAE,CAAC;oBAC9B,OAAO,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;IAEhF,iCAAiC;IACjC,MAAM,UAAU,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IAE1C,qDAAqD;IACrD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IAExC,+BAA+B;IAC/B,KAAK,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,IAAI,UAAU,EAAE,CAAC;QACzD,6EAA6E;QAC7E,uEAAuE;QACvE,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,SAAS;QACX,CAAC;QAED,MAAM,MAAM,GAAG,YAAY,CAAC,eAAoD,CAAC,CAAC;QAElF,uDAAuD;QACvD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;gBACrB,qDAAqD;gBACrD,4DAA4D;gBAC5D,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,CAAC;gBAChC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;oBACtB,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACvB,WAAW,CAAC,IAAI,CAAC;wBACf,IAAI,EAAE,MAAM;wBACZ,OAAO,EAAE,KAAK;qBACf,CAAC,CAAC;oBAEH,wCAAwC;oBACxC,IAAI,OAAO,EAAE,gBAAgB,EAAE,CAAC;wBAC9B,OAAO,CAAC,gBAAgB,CAAC,OAAO,CAAC;4BAC/B,MAAM,EAAE,KAAK,CAAC,MAAM;4BACpB,QAAQ,EAAE,eAAe;4BACzB,OAAO,EAAE,+CAA+C,MAAM,CAAC,MAAM,EAAE;yBACxE,CAAC,CAAC;oBACL,CAAC;oBAED,QAAQ,CAAC,IAAI,CAAC;wBACZ,MAAM,EAAE,KAAK,CAAC,MAAM;wBACpB,QAAQ,EAAE,eAAe;wBACzB,OAAO,EAAE,+CAA+C,MAAM,CAAC,MAAM,EAAE;qBACxE,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,2DAA2D;IAC3D,IAAI,gBAAgB,GAAuB,QAAQ;SAChD,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;SAC3C,GAAG,CACF,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC;QACxB,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;QACpC,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,GAAG,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;QACnD,GAAG,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC;KAChE,CAAC,CACH,CAAC;IAEJ,kFAAkF;IAClF,MAAM,eAAe,GAAG,mBAAmB,CAAC,gBAAgB,CAAC,CAAC;IAC9D,KAAK,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,IAAI,eAAe,EAAE,CAAC;QAC5D,uBAAuB;QACvB,KAAK,MAAM,OAAO,IAAI,mBAAmB,EAAE,CAAC;YAC1C,MAAM,GAAG,GAAG,gBAAgB,CAAC,SAAS,CACpC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,OAAO,CAAC,UAAU,CACnE,CAAC;YACF,MAAM,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAChE,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAC3B,gBAAgB,CAAC,GAAG,CAAC,GAAG;oBACtB,OAAO,EAAE,kBAAkB,CAAC,OAAO,CAAC;oBACpC,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;oBAC3C,OAAO,EAAE,QAAQ,CAAC,OAAO;oBACzB,GAAG,CAAC,QAAQ,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACjE,GAAG,CAAC,QAAQ,CAAC,UAAU,KAAK,SAAS,IAAI,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC;iBAC9E,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,MAAM,aAAa,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IAClG,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;QACzC,MAAM,OAAO,GAAY;YACvB,MAAM,EAAE,YAAY,CAAC,UAAU;YAC/B,QAAQ,EAAE,eAAe;YACzB,OAAO,EAAE,kBAAkB,YAAY,CAAC,OAAO,WAAW;SAC3D,CAAC;QACF,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAEvB,IAAI,OAAO,EAAE,gBAAgB,EAAE,CAAC;YAC9B,OAAO,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,gBAAgB,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE/E,OAAO;QACL,QAAQ,EAAE,gBAAgB;QAC1B,WAAW;QACX,QAAQ;KACT,CAAC;AACJ,CAAC"}

package/dist/generators/index.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Generators Module
+ *
+ * @architect
+ * @architect-core @architect-infra
+ * @architect-pattern Generators Module
+ *
+ * RDM (RenderableDocument Model) based document generation system.
+ * Uses Zod 4 codecs to transform MasterDataset into RenderableDocuments.
+ *
+ * ### When to Use
+ *
+ * - When importing generator types, registry, or orchestrator functions
+ * - When building custom generators or extending the generation pipeline
+ * - When programmatically generating documentation from code
+ *
+ * ## Usage
+ *
+ * ```typescript
+ * import { generatorRegistry } from '@libar-dev/architect/generators';
+ * import '@libar-dev/architect/generators/built-in'; // Register built-in generators
+ *
+ * const generator = generatorRegistry.get('patterns');
+ * const output = await generator.generate(patterns, context);
+ * ```
+ *
+ * ### Key Concepts
+ *
+ * - **DocumentGenerator Protocol:** Minimal interface for pluggable generators
+ * - **Codec-Based Generators:** Use Zod 4 codecs for type-safe transformations
+ * - **Registry Pattern:** Explicit registration for transparency
+ */
+export type { DocumentGenerator, GeneratorContext, GeneratorOutput, OutputFile } from './types.js';
+export { GeneratorRegistry, generatorRegistry } from './registry.js';
+export { CodecBasedGenerator, createCodecGenerator, DOCUMENT_TYPES, type DocumentType, } from './codec-based.js';
+export { generateDocumentation, type GenerateOptions, type GenerateResult, type GeneratedFile, type GenerationError, type GenerationWarning, } from './orchestrator.js';
+export { buildMasterDataset, type PipelineOptions, mergePatterns, transformToMasterDataset, type RawDataset, type RuntimeMasterDataset, } from './pipeline/index.js';
+export { createProductAreaConfigs, PRODUCT_AREA_VALUES, type ProductAreaConfigOptions, } from './built-in/reference-generators.js';
+/**
+ * NOTE: Built-in generators are NOT auto-registered.
+ * Import './built-in/index.js' explicitly to register them:
+ *
+ * ```typescript
+ * import '@libar-dev/architect/generators/built-in';
+ * ```
+ *
+ * This explicit registration makes side effects visible and prevents
+ * accidental registration in contexts where it's not needed.
+ */
+//# sourceMappingURL=index.d.ts.map

package/dist/generators/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/generators/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAGH,YAAY,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAGnG,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAGrE,OAAO,EACL,mBAAmB,EACnB,oBAAoB,EACpB,cAAc,EACd,KAAK,YAAY,GAClB,MAAM,kBAAkB,CAAC;AAG1B,OAAO,EACL,qBAAqB,EACrB,KAAK,eAAe,EACpB,KAAK,cAAc,EACnB,KAAK,aAAa,EAClB,KAAK,eAAe,EACpB,KAAK,iBAAiB,GACvB,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EACL,kBAAkB,EAClB,KAAK,eAAe,EACpB,aAAa,EACb,wBAAwB,EACxB,KAAK,UAAU,EACf,KAAK,oBAAoB,GAC1B,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EACL,wBAAwB,EACxB,mBAAmB,EACnB,KAAK,wBAAwB,GAC9B,MAAM,oCAAoC,CAAC;AAE5C;;;;;;;;;;GAUG"}

package/dist/generators/index.js

@@ -0,0 +1,54 @@
+/**
+ * Generators Module
+ *
+ * @architect
+ * @architect-core @architect-infra
+ * @architect-pattern Generators Module
+ *
+ * RDM (RenderableDocument Model) based document generation system.
+ * Uses Zod 4 codecs to transform MasterDataset into RenderableDocuments.
+ *
+ * ### When to Use
+ *
+ * - When importing generator types, registry, or orchestrator functions
+ * - When building custom generators or extending the generation pipeline
+ * - When programmatically generating documentation from code
+ *
+ * ## Usage
+ *
+ * ```typescript
+ * import { generatorRegistry } from '@libar-dev/architect/generators';
+ * import '@libar-dev/architect/generators/built-in'; // Register built-in generators
+ *
+ * const generator = generatorRegistry.get('patterns');
+ * const output = await generator.generate(patterns, context);
+ * ```
+ *
+ * ### Key Concepts
+ *
+ * - **DocumentGenerator Protocol:** Minimal interface for pluggable generators
+ * - **Codec-Based Generators:** Use Zod 4 codecs for type-safe transformations
+ * - **Registry Pattern:** Explicit registration for transparency
+ */
+// Generator registry (singleton + class for custom instances)
+export { GeneratorRegistry, generatorRegistry } from './registry.js';
+// Codec-based generators (RDM architecture)
+export { CodecBasedGenerator, createCodecGenerator, DOCUMENT_TYPES, } from './codec-based.js';
+// Orchestrator - programmatic API for documentation generation
+export { generateDocumentation, } from './orchestrator.js';
+// Pipeline - MasterDataset transformation for ProcessStateAPI usage
+export { buildMasterDataset, mergePatterns, transformToMasterDataset, } from './pipeline/index.js';
+// Product area and reference document config helpers (for downstream repo configs)
+export { createProductAreaConfigs, PRODUCT_AREA_VALUES, } from './built-in/reference-generators.js';
+/**
+ * NOTE: Built-in generators are NOT auto-registered.
+ * Import './built-in/index.js' explicitly to register them:
+ *
+ * ```typescript
+ * import '@libar-dev/architect/generators/built-in';
+ * ```
+ *
+ * This explicit registration makes side effects visible and prevents
+ * accidental registration in contexts where it's not needed.
+ */
+//# sourceMappingURL=index.js.map

package/dist/generators/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/generators/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAKH,8DAA8D;AAC9D,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAErE,4CAA4C;AAC5C,OAAO,EACL,mBAAmB,EACnB,oBAAoB,EACpB,cAAc,GAEf,MAAM,kBAAkB,CAAC;AAE1B,+DAA+D;AAC/D,OAAO,EACL,qBAAqB,GAMtB,MAAM,mBAAmB,CAAC;AAE3B,oEAAoE;AACpE,OAAO,EACL,kBAAkB,EAElB,aAAa,EACb,wBAAwB,GAGzB,MAAM,qBAAqB,CAAC;AAE7B,mFAAmF;AACnF,OAAO,EACL,wBAAwB,EACxB,mBAAmB,GAEpB,MAAM,oCAAoC,CAAC;AAE5C;;;;;;;;;;GAUG"}