@nahisaho/musubix-neural-search 2.0.0

package/dist/scorer/EmbeddingModel.js

@@ -0,0 +1,104 @@
+/**
+ * Embedding Model
+ * @module @nahisaho/musubix-neural-search
+ * @description Neural embedding model for code and specifications
+ * Traces to: REQ-NS-001 (分岐スコアリング)
+ */
+import { EmbeddingError } from '../errors.js';
+/**
+ * Default embedding configuration
+ */
+const DEFAULT_CONFIG = {
+    modelName: 'simple-hash',
+    dimension: 128,
+    maxLength: 512,
+    poolingStrategy: 'mean',
+};
+/**
+ * Simple hash-based embedding model (for testing without ML dependencies)
+ */
+export class EmbeddingModel {
+    config;
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    /**
+     * Embed source code
+     */
+    async embedCode(code) {
+        if (!code) {
+            throw new EmbeddingError('Code cannot be empty');
+        }
+        return this.hashEmbed(code, 'code');
+    }
+    /**
+     * Embed specification
+     */
+    async embedSpec(spec) {
+        if (!spec) {
+            throw new EmbeddingError('Specification cannot be empty');
+        }
+        return this.hashEmbed(spec, 'spec');
+    }
+    /**
+     * Calculate cosine similarity between embeddings
+     */
+    similarity(a, b) {
+        if (a.length !== b.length) {
+            throw new EmbeddingError('Embedding dimensions must match');
+        }
+        let dotProduct = 0;
+        let normA = 0;
+        let normB = 0;
+        for (let i = 0; i < a.length; i++) {
+            const valA = a[i];
+            const valB = b[i];
+            dotProduct += valA * valB;
+            normA += valA * valA;
+            normB += valB * valB;
+        }
+        const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+        if (denominator === 0) {
+            return 0;
+        }
+        return dotProduct / denominator;
+    }
+    /**
+     * Batch embed multiple texts
+     */
+    async embedBatch(texts) {
+        return Promise.all(texts.map((text) => this.hashEmbed(text, 'batch')));
+    }
+    /**
+     * Get configuration
+     */
+    getConfig() {
+        return this.config;
+    }
+    /**
+     * Simple hash-based embedding (deterministic, for testing)
+     */
+    hashEmbed(text, prefix) {
+        const combined = `${prefix}:${text}`;
+        const embedding = new Float32Array(this.config.dimension);
+        // Simple character-based hashing
+        for (let i = 0; i < combined.length && i < this.config.maxLength; i++) {
+            const charCode = combined.charCodeAt(i);
+            const idx = i % this.config.dimension;
+            embedding[idx] += charCode / 256;
+        }
+        // Normalize
+        let norm = 0;
+        for (let i = 0; i < embedding.length; i++) {
+            norm += embedding[i] * embedding[i];
+        }
+        norm = Math.sqrt(norm);
+        if (norm > 0) {
+            for (let i = 0; i < embedding.length; i++) {
+                embedding[i] /= norm;
+            }
+        }
+        return embedding;
+    }
+}
+//# sourceMappingURL=EmbeddingModel.js.map

package/dist/scorer/EmbeddingModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EmbeddingModel.js","sourceRoot":"","sources":["../../src/scorer/EmbeddingModel.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAE9C;;GAEG;AACH,MAAM,cAAc,GAAoB;IACtC,SAAS,EAAE,aAAa;IACxB,SAAS,EAAE,GAAG;IACd,SAAS,EAAE,GAAG;IACd,eAAe,EAAE,MAAM;CACxB,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,cAAc;IACR,MAAM,CAAkB;IAEzC,YAAY,SAAmC,EAAE;QAC/C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,IAAY;QAC1B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,cAAc,CAAC,sBAAsB,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,IAAY;QAC1B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,cAAc,CAAC,+BAA+B,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,CAAY,EAAE,CAAY;QACnC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,cAAc,CAAC,iCAAiC,CAAC,CAAC;QAC9D,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,UAAU,IAAI,IAAI,GAAG,IAAI,CAAC;YAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC;YACrB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC;QACvB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,OAAO,UAAU,GAAG,WAAW,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,KAAe;QAC9B,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACzE,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,IAAY,EAAE,MAAc;QAC5C,MAAM,QAAQ,GAAG,GAAG,MAAM,IAAI,IAAI,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAE1D,iCAAiC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACtE,MAAM,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;YACtC,SAAS,CAAC,GAAG,CAAC,IAAI,QAAQ,GAAG,GAAG,CAAC;QACnC,CAAC;QAED,YAAY;QACZ,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEvB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;CACF"}

package/dist/scorer/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Neural Scorer Module
+ * @module @nahisaho/musubix-neural-search/scorer
+ */
+export { EmbeddingModel } from './EmbeddingModel.js';
+export { BranchScorer } from './BranchScorer.js';
+export type { ScoreWeights } from './BranchScorer.js';
+export { ContextEncoder } from './ContextEncoder.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/scorer/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/scorer/index.js

@@ -0,0 +1,8 @@
+/**
+ * Neural Scorer Module
+ * @module @nahisaho/musubix-neural-search/scorer
+ */
+export { EmbeddingModel } from './EmbeddingModel.js';
+export { BranchScorer } from './BranchScorer.js';
+export { ContextEncoder } from './ContextEncoder.js';
+//# sourceMappingURL=index.js.map

package/dist/scorer/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/scorer/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEjD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/search/BeamSearch.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Beam Search
+ * @module @nahisaho/musubix-neural-search
+ * @description Beam search algorithm for code synthesis
+ * Traces to: REQ-NS-002 (探索優先順位付け)
+ */
+import type { Branch, IBranchScorer, IBeamSearch, SearchConfig, SearchContext, SearchResult, SearchState, SearchStatistics } from '../types.js';
+/**
+ * Beam search implementation
+ */
+export declare class BeamSearch implements IBeamSearch {
+    private currentBeam;
+    private statistics;
+    constructor();
+    /**
+     * Execute beam search
+     */
+    search(initial: SearchState, expand: (state: SearchState) => Promise<Branch[]>, scorer: IBranchScorer, context: SearchContext, config: SearchConfig): Promise<SearchResult[]>;
+    /**
+     * Get current beam
+     */
+    getCurrentBeam(): SearchState[];
+    /**
+     * Get search statistics
+     */
+    getStatistics(): SearchStatistics;
+    /**
+     * Build path from state to root
+     */
+    private buildPath;
+}
+//# sourceMappingURL=BeamSearch.d.ts.map

package/dist/search/BeamSearch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BeamSearch.d.ts","sourceRoot":"","sources":["../../src/search/BeamSearch.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,MAAM,EACN,aAAa,EACb,WAAW,EACX,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,WAAW,EACX,gBAAgB,EACjB,MAAM,aAAa,CAAC;AAGrB;;GAEG;AACH,qBAAa,UAAW,YAAW,WAAW;IAC5C,OAAO,CAAC,WAAW,CAAgB;IACnC,OAAO,CAAC,UAAU,CAAmB;;IAarC;;OAEG;IACG,MAAM,CACV,OAAO,EAAE,WAAW,EACpB,MAAM,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC,EACjD,MAAM,EAAE,aAAa,EACrB,OAAO,EAAE,aAAa,EACtB,MAAM,EAAE,YAAY,GACnB,OAAO,CAAC,YAAY,EAAE,CAAC;IAsG1B;;OAEG;IACH,cAAc,IAAI,WAAW,EAAE;IAI/B;;OAEG;IACH,aAAa,IAAI,gBAAgB;IAIjC;;OAEG;IACH,OAAO,CAAC,SAAS;CAalB"}

package/dist/search/BeamSearch.js

@@ -0,0 +1,139 @@
+/**
+ * Beam Search
+ * @module @nahisaho/musubix-neural-search
+ * @description Beam search algorithm for code synthesis
+ * Traces to: REQ-NS-002 (探索優先順位付け)
+ */
+import { SearchTimeoutError } from '../errors.js';
+/**
+ * Beam search implementation
+ */
+export class BeamSearch {
+    currentBeam;
+    statistics;
+    constructor() {
+        this.currentBeam = [];
+        this.statistics = {
+            totalExpanded: 0,
+            totalPruned: 0,
+            maxDepthReached: 0,
+            averageScore: 0,
+            timeElapsed: 0,
+        };
+    }
+    /**
+     * Execute beam search
+     */
+    async search(initial, expand, scorer, context, config) {
+        const startTime = Date.now();
+        const beamWidth = config.beamWidth ?? 5;
+        this.currentBeam = [initial];
+        const allResults = [];
+        let iteration = 0;
+        let totalPruned = 0;
+        let totalExpanded = 0;
+        let maxDepth = 0;
+        const scores = [];
+        while (iteration < config.maxIterations &&
+            this.currentBeam.length > 0) {
+            // Check timeout
+            if (Date.now() - startTime > config.timeout) {
+                throw new SearchTimeoutError(config.timeout);
+            }
+            // Check depth - return results instead of throwing
+            const maxBeamDepth = Math.max(...this.currentBeam.map((s) => s.depth));
+            maxDepth = Math.max(maxDepth, maxBeamDepth);
+            if (maxBeamDepth >= config.maxDepth) {
+                // Reached max depth, return current results
+                break;
+            }
+            // Expand all states in beam
+            const candidates = [];
+            for (const state of this.currentBeam) {
+                const branches = await expand(state);
+                totalExpanded += branches.length;
+                // Score all branches
+                const scored = await scorer.scoreBatch(branches, context);
+                for (const branchScore of scored) {
+                    // Apply pruning threshold
+                    if (config.pruneThreshold !== undefined &&
+                        branchScore.score < config.pruneThreshold) {
+                        totalPruned++;
+                        continue;
+                    }
+                    const path = this.buildPath(branchScore.branch.to, context.history);
+                    candidates.push({
+                        state: branchScore.branch.to,
+                        score: branchScore.score,
+                        path,
+                    });
+                    scores.push(branchScore.score);
+                }
+            }
+            // Sort by score and keep top beamWidth
+            candidates.sort((a, b) => b.score - a.score);
+            const nextBeam = candidates.slice(0, beamWidth);
+            // Add to results
+            for (const candidate of nextBeam) {
+                allResults.push({
+                    state: candidate.state,
+                    score: candidate.score,
+                    path: candidate.path,
+                    iterations: iteration + 1,
+                    pruned: totalPruned,
+                });
+            }
+            // Update beam
+            this.currentBeam = nextBeam.map((c) => c.state);
+            iteration++;
+        }
+        // Update statistics
+        this.statistics = {
+            totalExpanded,
+            totalPruned,
+            maxDepthReached: maxDepth,
+            averageScore: scores.length > 0
+                ? scores.reduce((a, b) => a + b, 0) / scores.length
+                : 0,
+            timeElapsed: Date.now() - startTime,
+        };
+        // Return best results (deduplicated by state id)
+        const seen = new Set();
+        return allResults
+            .filter((r) => {
+            if (seen.has(r.state.id))
+                return false;
+            seen.add(r.state.id);
+            return true;
+        })
+            .sort((a, b) => b.score - a.score)
+            .slice(0, beamWidth);
+    }
+    /**
+     * Get current beam
+     */
+    getCurrentBeam() {
+        return [...this.currentBeam];
+    }
+    /**
+     * Get search statistics
+     */
+    getStatistics() {
+        return { ...this.statistics };
+    }
+    /**
+     * Build path from state to root
+     */
+    buildPath(state, history) {
+        const path = [state];
+        // Add history states
+        for (let i = history.length - 1; i >= 0; i--) {
+            if (history[i].id === state.parent) {
+                path.unshift(history[i]);
+                break;
+            }
+        }
+        return path;
+    }
+}
+//# sourceMappingURL=BeamSearch.js.map

package/dist/search/BeamSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BeamSearch.js","sourceRoot":"","sources":["../../src/search/BeamSearch.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAYH,OAAO,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAElD;;GAEG;AACH,MAAM,OAAO,UAAU;IACb,WAAW,CAAgB;IAC3B,UAAU,CAAmB;IAErC;QACE,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG;YAChB,aAAa,EAAE,CAAC;YAChB,WAAW,EAAE,CAAC;YACd,eAAe,EAAE,CAAC;YAClB,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,CAAC;SACf,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,OAAoB,EACpB,MAAiD,EACjD,MAAqB,EACrB,OAAsB,EACtB,MAAoB;QAEpB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;QAExC,IAAI,CAAC,WAAW,GAAG,CAAC,OAAO,CAAC,CAAC;QAC7B,MAAM,UAAU,GAAmB,EAAE,CAAC;QACtC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,OACE,SAAS,GAAG,MAAM,CAAC,aAAa;YAChC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAC3B,CAAC;YACD,gBAAgB;YAChB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC5C,MAAM,IAAI,kBAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC/C,CAAC;YAED,mDAAmD;YACnD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACvE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YAC5C,IAAI,YAAY,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,4CAA4C;gBAC5C,MAAM;YACR,CAAC;YAED,4BAA4B;YAC5B,MAAM,UAAU,GAAsE,EAAE,CAAC;YAEzF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrC,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,CAAC;gBACrC,aAAa,IAAI,QAAQ,CAAC,MAAM,CAAC;gBAEjC,qBAAqB;gBACrB,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBAE1D,KAAK,MAAM,WAAW,IAAI,MAAM,EAAE,CAAC;oBACjC,0BAA0B;oBAC1B,IACE,MAAM,CAAC,cAAc,KAAK,SAAS;wBACnC,WAAW,CAAC,KAAK,GAAG,MAAM,CAAC,cAAc,EACzC,CAAC;wBACD,WAAW,EAAE,CAAC;wBACd,SAAS;oBACX,CAAC;oBAED,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;oBACpE,UAAU,CAAC,IAAI,CAAC;wBACd,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE;wBAC5B,KAAK,EAAE,WAAW,CAAC,KAAK;wBACxB,IAAI;qBACL,CAAC,CAAC;oBACH,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;YAED,uCAAuC;YACvC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAC7C,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAEhD,iBAAiB;YACjB,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;gBACjC,UAAU,CAAC,IAAI,CAAC;oBACd,KAAK,EAAE,SAAS,CAAC,KAAK;oBACtB,KAAK,EAAE,SAAS,CAAC,KAAK;oBACtB,IAAI,EAAE,SAAS,CAAC,IAAI;oBACpB,UAAU,EAAE,SAAS,GAAG,CAAC;oBACzB,MAAM,EAAE,WAAW;iBACpB,CAAC,CAAC;YACL,CAAC;YAED,cAAc;YACd,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAChD,SAAS,EAAE,CAAC;QACd,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,UAAU,GAAG;YAChB,aAAa;YACb,WAAW;YACX,eAAe,EAAE,QAAQ;YACzB,YAAY,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC;gBAC7B,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM;gBACnD,CAAC,CAAC,CAAC;YACL,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACpC,CAAC;QAEF,iDAAiD;QACjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,OAAO,UAAU;aACd,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACZ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,OAAO,KAAK,CAAC;YACvC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;aACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,OAAO,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,KAAkB,EAAE,OAAsB;QAC1D,MAAM,IAAI,GAAkB,CAAC,KAAK,CAAC,CAAC;QAEpC,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/search/BestFirstSearch.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Best-First Search
+ * @module @nahisaho/musubix-neural-search
+ * @description Best-first search algorithm for code synthesis
+ */
+import type { Branch, IBranchScorer, IBestFirstSearch, SearchConfig, SearchContext, SearchResult, SearchState } from '../types.js';
+/**
+ * Best-first search implementation
+ */
+export declare class BestFirstSearch implements IBestFirstSearch {
+    private openList;
+    private closedSet;
+    constructor();
+    /**
+     * Execute best-first search
+     */
+    search(initial: SearchState, expand: (state: SearchState) => Promise<Branch[]>, scorer: IBranchScorer, context: SearchContext, config: SearchConfig): Promise<SearchResult>;
+    /**
+     * Get open list size
+     */
+    getOpenListSize(): number;
+}
+//# sourceMappingURL=BestFirstSearch.d.ts.map

package/dist/search/BestFirstSearch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BestFirstSearch.d.ts","sourceRoot":"","sources":["../../src/search/BestFirstSearch.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EACV,MAAM,EACN,aAAa,EACb,gBAAgB,EAChB,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,WAAW,EACZ,MAAM,aAAa,CAAC;AAIrB;;GAEG;AACH,qBAAa,eAAgB,YAAW,gBAAgB;IACtD,OAAO,CAAC,QAAQ,CAA4E;IAC5F,OAAO,CAAC,SAAS,CAAc;;IAO/B;;OAEG;IACG,MAAM,CACV,OAAO,EAAE,WAAW,EACpB,MAAM,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC,EACjD,MAAM,EAAE,aAAa,EACrB,OAAO,EAAE,aAAa,EACtB,MAAM,EAAE,YAAY,GACnB,OAAO,CAAC,YAAY,CAAC;IA0GxB;;OAEG;IACH,eAAe,IAAI,MAAM;CAG1B"}

package/dist/search/BestFirstSearch.js

@@ -0,0 +1,110 @@
+/**
+ * Best-First Search
+ * @module @nahisaho/musubix-neural-search
+ * @description Best-first search algorithm for code synthesis
+ */
+import { SearchDepthExceededError, SearchTimeoutError } from '../errors.js';
+import { PriorityQueue } from './PriorityQueue.js';
+/**
+ * Best-first search implementation
+ */
+export class BestFirstSearch {
+    openList;
+    closedSet;
+    constructor() {
+        this.openList = new PriorityQueue();
+        this.closedSet = new Set();
+    }
+    /**
+     * Execute best-first search
+     */
+    async search(initial, expand, scorer, context, config) {
+        const startTime = Date.now();
+        // Reset state
+        this.openList.clear();
+        this.closedSet.clear();
+        // Add initial state with neutral score (not a goal yet)
+        this.openList.push({ state: initial, score: 0.0, path: [initial] }, 0.0);
+        let iteration = 0;
+        let totalPruned = 0;
+        while (!this.openList.isEmpty() && iteration < config.maxIterations) {
+            // Check timeout
+            if (Date.now() - startTime > config.timeout) {
+                throw new SearchTimeoutError(config.timeout);
+            }
+            // Get best state
+            const current = this.openList.pop();
+            if (!current)
+                break;
+            const { state, score, path } = current;
+            // Skip if already visited
+            if (this.closedSet.has(state.id)) {
+                continue;
+            }
+            this.closedSet.add(state.id);
+            // Check depth (only after at least one expansion)
+            if (state.depth > 0 && state.depth >= config.maxDepth) {
+                throw new SearchDepthExceededError(config.maxDepth);
+            }
+            // Check if goal (assume high score = goal, but only for non-initial states)
+            if (state.depth > 0 && score >= 0.9) {
+                return {
+                    state,
+                    score,
+                    path,
+                    iterations: iteration + 1,
+                    pruned: totalPruned,
+                };
+            }
+            // Expand state
+            const branches = await expand(state);
+            // Check timeout again after expansion (expansion might be slow)
+            if (Date.now() - startTime > config.timeout) {
+                throw new SearchTimeoutError(config.timeout);
+            }
+            const scored = await scorer.scoreBatch(branches, context);
+            for (const branchScore of scored) {
+                const nextState = branchScore.branch.to;
+                // Skip if already visited
+                if (this.closedSet.has(nextState.id)) {
+                    continue;
+                }
+                // Apply pruning
+                if (config.pruneThreshold !== undefined &&
+                    branchScore.score < config.pruneThreshold) {
+                    totalPruned++;
+                    continue;
+                }
+                const nextPath = [...path, nextState];
+                this.openList.push({ state: nextState, score: branchScore.score, path: nextPath }, branchScore.score);
+            }
+            iteration++;
+        }
+        // Return best found if no goal reached
+        const best = this.openList.pop();
+        if (best) {
+            return {
+                state: best.state,
+                score: best.score,
+                path: best.path,
+                iterations: iteration,
+                pruned: totalPruned,
+            };
+        }
+        // Return initial if nothing better found
+        return {
+            state: initial,
+            score: 0,
+            path: [initial],
+            iterations: iteration,
+            pruned: totalPruned,
+        };
+    }
+    /**
+     * Get open list size
+     */
+    getOpenListSize() {
+        return this.openList.size();
+    }
+}
+//# sourceMappingURL=BestFirstSearch.js.map

package/dist/search/BestFirstSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BestFirstSearch.js","sourceRoot":"","sources":["../../src/search/BestFirstSearch.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAWH,OAAO,EAAE,wBAAwB,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAEnD;;GAEG;AACH,MAAM,OAAO,eAAe;IAClB,QAAQ,CAA4E;IACpF,SAAS,CAAc;IAE/B;QACE,IAAI,CAAC,QAAQ,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,OAAoB,EACpB,MAAiD,EACjD,MAAqB,EACrB,OAAsB,EACtB,MAAoB;QAEpB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,cAAc;QACd,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QAEvB,wDAAwD;QACxD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAEzE,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,SAAS,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;YACpE,gBAAgB;YAChB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC5C,MAAM,IAAI,kBAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC/C,CAAC;YAED,iBAAiB;YACjB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO;gBAAE,MAAM;YAEpB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;YAEvC,0BAA0B;YAC1B,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjC,SAAS;YACX,CAAC;YACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAE7B,kDAAkD;YAClD,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACtD,MAAM,IAAI,wBAAwB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACtD,CAAC;YAED,4EAA4E;YAC5E,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACpC,OAAO;oBACL,KAAK;oBACL,KAAK;oBACL,IAAI;oBACJ,UAAU,EAAE,SAAS,GAAG,CAAC;oBACzB,MAAM,EAAE,WAAW;iBACpB,CAAC;YACJ,CAAC;YAED,eAAe;YACf,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,CAAC;YAErC,gEAAgE;YAChE,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC5C,MAAM,IAAI,kBAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC/C,CAAC;YAED,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAE1D,KAAK,MAAM,WAAW,IAAI,MAAM,EAAE,CAAC;gBACjC,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;gBAExC,0BAA0B;gBAC1B,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;oBACrC,SAAS;gBACX,CAAC;gBAED,gBAAgB;gBAChB,IACE,MAAM,CAAC,cAAc,KAAK,SAAS;oBACnC,WAAW,CAAC,KAAK,GAAG,MAAM,CAAC,cAAc,EACzC,CAAC;oBACD,WAAW,EAAE,CAAC;oBACd,SAAS;gBACX,CAAC;gBAED,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,EAAE,SAAS,CAAC,CAAC;gBACtC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAChB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,EAC9D,WAAW,CAAC,KAAK,CAClB,CAAC;YACJ,CAAC;YAED,SAAS,EAAE,CAAC;QACd,CAAC;QAED,uCAAuC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;QACjC,IAAI,IAAI,EAAE,CAAC;YACT,OAAO;gBACL,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,UAAU,EAAE,SAAS;gBACrB,MAAM,EAAE,WAAW;aACpB,CAAC;QACJ,CAAC;QAED,yCAAyC;QACzC,OAAO;YACL,KAAK,EAAE,OAAO;YACd,KAAK,EAAE,CAAC;YACR,IAAI,EAAE,CAAC,OAAO,CAAC;YACf,UAAU,EAAE,SAAS;YACrB,MAAM,EAAE,WAAW;SACpB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IAC9B,CAAC;CACF"}

package/dist/search/PriorityQueue.d.ts

@@ -0,0 +1,54 @@
+/**
+ * Priority Queue
+ * @module @nahisaho/musubix-neural-search
+ * @description Max-heap priority queue for search
+ */
+import type { IPriorityQueue } from '../types.js';
+/**
+ * Max-heap priority queue implementation
+ */
+export declare class PriorityQueue<T> implements IPriorityQueue<T> {
+    private heap;
+    constructor();
+    /**
+     * Add item with priority
+     */
+    push(item: T, priority: number): void;
+    /**
+     * Remove and return highest priority item
+     */
+    pop(): T | undefined;
+    /**
+     * Peek at highest priority item
+     */
+    peek(): T | undefined;
+    /**
+     * Get queue size
+     */
+    size(): number;
+    /**
+     * Check if empty
+     */
+    isEmpty(): boolean;
+    /**
+     * Clear the queue
+     */
+    clear(): void;
+    /**
+     * Get all items sorted by priority
+     */
+    toArray(): T[];
+    /**
+     * Bubble up the element at index
+     */
+    private bubbleUp;
+    /**
+     * Bubble down the element at index
+     */
+    private bubbleDown;
+    /**
+     * Swap two elements
+     */
+    private swap;
+}
+//# sourceMappingURL=PriorityQueue.d.ts.map

package/dist/search/PriorityQueue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PriorityQueue.d.ts","sourceRoot":"","sources":["../../src/search/PriorityQueue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAgB,MAAM,aAAa,CAAC;AAEhE;;GAEG;AACH,qBAAa,aAAa,CAAC,CAAC,CAAE,YAAW,cAAc,CAAC,CAAC,CAAC;IACxD,OAAO,CAAC,IAAI,CAAoB;;IAMhC;;OAEG;IACH,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAKrC;;OAEG;IACH,GAAG,IAAI,CAAC,GAAG,SAAS;IAgBpB;;OAEG;IACH,IAAI,IAAI,CAAC,GAAG,SAAS;IAIrB;;OAEG;IACH,IAAI,IAAI,MAAM;IAId;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,OAAO,IAAI,CAAC,EAAE;IAMd;;OAEG;IACH,OAAO,CAAC,QAAQ;IAWhB;;OAEG;IACH,OAAO,CAAC,UAAU;IA+BlB;;OAEG;IACH,OAAO,CAAC,IAAI;CAKb"}

package/dist/search/PriorityQueue.js

@@ -0,0 +1,114 @@
+/**
+ * Priority Queue
+ * @module @nahisaho/musubix-neural-search
+ * @description Max-heap priority queue for search
+ */
+/**
+ * Max-heap priority queue implementation
+ */
+export class PriorityQueue {
+    heap;
+    constructor() {
+        this.heap = [];
+    }
+    /**
+     * Add item with priority
+     */
+    push(item, priority) {
+        this.heap.push({ item, priority });
+        this.bubbleUp(this.heap.length - 1);
+    }
+    /**
+     * Remove and return highest priority item
+     */
+    pop() {
+        if (this.heap.length === 0) {
+            return undefined;
+        }
+        const top = this.heap[0];
+        const last = this.heap.pop();
+        if (this.heap.length > 0 && last) {
+            this.heap[0] = last;
+            this.bubbleDown(0);
+        }
+        return top.item;
+    }
+    /**
+     * Peek at highest priority item
+     */
+    peek() {
+        return this.heap[0]?.item;
+    }
+    /**
+     * Get queue size
+     */
+    size() {
+        return this.heap.length;
+    }
+    /**
+     * Check if empty
+     */
+    isEmpty() {
+        return this.heap.length === 0;
+    }
+    /**
+     * Clear the queue
+     */
+    clear() {
+        this.heap = [];
+    }
+    /**
+     * Get all items sorted by priority
+     */
+    toArray() {
+        return [...this.heap]
+            .sort((a, b) => b.priority - a.priority)
+            .map((item) => item.item);
+    }
+    /**
+     * Bubble up the element at index
+     */
+    bubbleUp(index) {
+        while (index > 0) {
+            const parentIdx = Math.floor((index - 1) / 2);
+            if (this.heap[parentIdx].priority >= this.heap[index].priority) {
+                break;
+            }
+            this.swap(parentIdx, index);
+            index = parentIdx;
+        }
+    }
+    /**
+     * Bubble down the element at index
+     */
+    bubbleDown(index) {
+        const length = this.heap.length;
+        while (true) {
+            const leftIdx = 2 * index + 1;
+            const rightIdx = 2 * index + 2;
+            let largestIdx = index;
+            if (leftIdx < length &&
+                this.heap[leftIdx].priority > this.heap[largestIdx].priority) {
+                largestIdx = leftIdx;
+            }
+            if (rightIdx < length &&
+                this.heap[rightIdx].priority > this.heap[largestIdx].priority) {
+                largestIdx = rightIdx;
+            }
+            if (largestIdx === index) {
+                break;
+            }
+            this.swap(index, largestIdx);
+            index = largestIdx;
+        }
+    }
+    /**
+     * Swap two elements
+     */
+    swap(i, j) {
+        const temp = this.heap[i];
+        this.heap[i] = this.heap[j];
+        this.heap[j] = temp;
+    }
+}
+//# sourceMappingURL=PriorityQueue.js.map

package/dist/search/PriorityQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../src/search/PriorityQueue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;GAEG;AACH,MAAM,OAAO,aAAa;IAChB,IAAI,CAAoB;IAEhC;QACE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,IAAO,EAAE,QAAgB;QAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YACjC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,GAAG,CAAC,IAAI,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;aAClB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;aACvC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,KAAa;QAC5B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC/D,MAAM;YACR,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC5B,KAAK,GAAG,SAAS,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAa;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAEhC,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAC9B,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAC/B,IAAI,UAAU,GAAG,KAAK,CAAC;YAEvB,IACE,OAAO,GAAG,MAAM;gBAChB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,QAAQ,EAC5D,CAAC;gBACD,UAAU,GAAG,OAAO,CAAC;YACvB,CAAC;YAED,IACE,QAAQ,GAAG,MAAM;gBACjB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,QAAQ,EAC7D,CAAC;gBACD,UAAU,GAAG,QAAQ,CAAC;YACxB,CAAC;YAED,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;gBACzB,MAAM;YACR,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YAC7B,KAAK,GAAG,UAAU,CAAC;QACrB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,IAAI,CAAC,CAAS,EAAE,CAAS;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACtB,CAAC;CACF"}