@linklabjs/core 0.1.0 → 0.1.2

package/dist/navigation/NavigationEngine.d.ts

@@ -0,0 +1,69 @@
+/**
+ * NavigationEngine - Moteur de navigation sémantique
+ *
+ * Trois modes orthogonaux :
+ *
+ *   PATHFIND  — Trouver les N meilleurs chemins entre deux nœuds
+ *   NAVIGATE  — Résoudre une stack de frames étape par étape
+ *   SCHEDULE  — Exécuter des actions par priorité sur un contexte
+ *
+ * Trois bus exposés sur chaque instance :
+ *
+ *   engine.hooks   — awaitable, enrichit ou annule le flux
+ *   engine.events  — fire-and-forget, observation pure
+ *   engine.errors  — synchrone, jamais silencieux
+ *
+ * Trail :
+ *   Le moteur accepte un Trail existant (Option B).
+ *   Si aucun Trail n'est fourni, il en crée un à partir de initialStack.
+ *   engine.trail est toujours accessible après création.
+ *
+ * ── Instrumentation @linklab/telemetry ──────────────────────────────────────
+ *   Chaque appel à run() produit un Span si @linklab/telemetry est installé.
+ *   Points mesurés :
+ *     - Step 'PathFinder'  : durée de findAllPaths() (mode PATHFIND)
+ *     - Step 'Resolver'    : durée de resolver.resolve() par frame (mode NAVIGATE)
+ *     - Step 'Scheduler'   : durée de scheduler.step() (mode SCHEDULE)
+ *   Le span est émis sur traceBus à la fin de run(), succès ou erreur.
+ */
+import type { Graph, Frame, ScheduleAction, EngineMode, NavigationEngineConfig, EngineStepResult, PathQuery } from '../types/index.js';
+import { Trail } from './Trail.js';
+import { type GraphBuses } from '../core/GraphEvents.js';
+export declare class NavigationEngine {
+    private mode;
+    private graph;
+    private pathFinder?;
+    private resolver?;
+    private scheduler?;
+    private config;
+    readonly trail: Trail;
+    readonly hooks: GraphBuses['hooks'];
+    readonly events: GraphBuses['events'];
+    readonly errors: GraphBuses['errors'];
+    constructor(config: NavigationEngineConfig);
+    static forPathfinding(graph: Graph, query: PathQuery): NavigationEngine;
+    static forNavigation(graph: Graph, options: {
+        trail: Trail;
+    } | {
+        stack: Frame[];
+    }): NavigationEngine;
+    static forScheduling(graph: Graph, options: {
+        trail?: Trail;
+        stack?: Frame[];
+        actions: ScheduleAction[];
+    }): NavigationEngine;
+    run(maxSteps?: number): Promise<EngineStepResult[]>;
+    private runPathfind;
+    private runNavigate;
+    private runSchedule;
+    private _buildTrailString;
+    private _resolvedFrom;
+    private _targetTo;
+    private _currentFilters;
+    private _countRows;
+    getMode(): EngineMode;
+    getGraph(): Graph;
+    /** @deprecated Utiliser engine.trail directement */
+    getCurrentStack(): Frame[];
+}
+//# sourceMappingURL=NavigationEngine.d.ts.map

package/dist/navigation/NavigationEngine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"NavigationEngine.d.ts","sourceRoot":"","sources":["../../src/navigation/NavigationEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,KAAK,EACV,KAAK,EAEL,KAAK,EACL,cAAc,EACd,UAAU,EACV,sBAAsB,EACtB,gBAAgB,EAChB,SAAS,EAEV,MAAM,mBAAmB,CAAA;AAK1B,OAAO,EAAE,KAAK,EAAE,MAAW,YAAY,CAAA;AACvC,OAAO,EAAoB,KAAK,UAAU,EAAE,MAAM,wBAAwB,CAAA;AAG1E,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,IAAI,CAAmB;IAC/B,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,UAAU,CAAC,CAAY;IAC/B,OAAO,CAAC,QAAQ,CAAC,CAAY;IAC7B,OAAO,CAAC,SAAS,CAAC,CAAY;IAC9B,OAAO,CAAC,MAAM,CAA6B;IAG3C,SAAgB,KAAK,EAAE,KAAK,CAAA;IAG5B,SAAgB,KAAK,EAAG,UAAU,CAAC,OAAO,CAAC,CAAA;IAC3C,SAAgB,MAAM,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAA;IAC5C,SAAgB,MAAM,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAA;gBAEhC,MAAM,EAAE,sBAAsB;IAqC1C,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,GAAG,gBAAgB;IAIvE,MAAM,CAAC,aAAa,CAClB,KAAK,EAAE,KAAK,EACZ,OAAO,EAAE;QAAE,KAAK,EAAE,KAAK,CAAA;KAAE,GAAG;QAAE,KAAK,EAAE,KAAK,EAAE,CAAA;KAAE,GAC7C,gBAAgB;IAOnB,MAAM,CAAC,aAAa,CAClB,KAAK,EAAE,KAAK,EACZ,OAAO,EAAE;QAAE,KAAK,CAAC,EAAE,KAAK,CAAC;QAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;QAAC,OAAO,EAAE,cAAc,EAAE,CAAA;KAAE,GACrE,gBAAgB;IAOb,GAAG,CAAC,QAAQ,GAAE,MAAU,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAqD9C,WAAW;YA0EX,WAAW;YAoGX,WAAW;IA+CzB,OAAO,CAAC,iBAAiB;IAMzB,OAAO,CAAC,aAAa;IAOrB,OAAO,CAAC,SAAS;IAOjB,OAAO,CAAC,eAAe;IAKvB,OAAO,CAAC,UAAU;IAWlB,OAAO,IAAK,UAAU;IACtB,QAAQ,IAAI,KAAK;IAEjB,oDAAoD;IACpD,eAAe,IAAI,KAAK,EAAE;CAC3B"}

package/dist/navigation/NavigationEngine.js

@@ -0,0 +1,361 @@
+/**
+ * NavigationEngine - Moteur de navigation sémantique
+ *
+ * Trois modes orthogonaux :
+ *
+ *   PATHFIND  — Trouver les N meilleurs chemins entre deux nœuds
+ *   NAVIGATE  — Résoudre une stack de frames étape par étape
+ *   SCHEDULE  — Exécuter des actions par priorité sur un contexte
+ *
+ * Trois bus exposés sur chaque instance :
+ *
+ *   engine.hooks   — awaitable, enrichit ou annule le flux
+ *   engine.events  — fire-and-forget, observation pure
+ *   engine.errors  — synchrone, jamais silencieux
+ *
+ * Trail :
+ *   Le moteur accepte un Trail existant (Option B).
+ *   Si aucun Trail n'est fourni, il en crée un à partir de initialStack.
+ *   engine.trail est toujours accessible après création.
+ *
+ * ── Instrumentation @linklab/telemetry ──────────────────────────────────────
+ *   Chaque appel à run() produit un Span si @linklab/telemetry est installé.
+ *   Points mesurés :
+ *     - Step 'PathFinder'  : durée de findAllPaths() (mode PATHFIND)
+ *     - Step 'Resolver'    : durée de resolver.resolve() par frame (mode NAVIGATE)
+ *     - Step 'Scheduler'   : durée de scheduler.step() (mode SCHEDULE)
+ *   Le span est émis sur traceBus à la fin de run(), succès ou erreur.
+ */
+import { PathFinder } from '../core/PathFinder.js';
+import { Resolver } from './Resolver.js';
+import { Scheduler } from './Scheduler.js';
+import { Trail } from './Trail.js';
+import { createGraphBuses } from '../core/GraphEvents.js';
+import { shim } from '../instrumentation/TelemetryShim.js';
+export class NavigationEngine {
+    mode;
+    graph;
+    pathFinder;
+    resolver;
+    scheduler;
+    config;
+    // ── Trail — contexte de navigation vivant ────────────────────
+    trail;
+    // ── Les trois bus ────────────────────────────────────────────
+    hooks;
+    events;
+    errors;
+    constructor(config) {
+        this.config = config;
+        this.mode = config.mode;
+        this.graph = config.graph;
+        this.trail = config.trail ?? Trail.create({
+            frames: config.initialStack ?? []
+        });
+        if (!config.trail && config.initialStack) {
+            for (const frame of config.initialStack) {
+                if (!frame.state) {
+                    frame.state = frame.id !== undefined ? 'RESOLVED' : 'UNRESOLVED';
+                }
+            }
+        }
+        const buses = createGraphBuses();
+        this.hooks = buses.hooks;
+        this.events = buses.events;
+        this.errors = buses.errors;
+        switch (this.mode) {
+            case 'PATHFIND':
+                this.pathFinder = new PathFinder(this.graph);
+                break;
+            case 'NAVIGATE':
+                this.resolver = new Resolver(this.graph);
+                break;
+            case 'SCHEDULE':
+                this.scheduler = new Scheduler(config.actions ?? [], this.graph);
+                break;
+        }
+    }
+    // ==================== FACTORY METHODS ====================
+    static forPathfinding(graph, query) {
+        return new NavigationEngine({ mode: 'PATHFIND', graph, pathQuery: query });
+    }
+    static forNavigation(graph, options) {
+        if ('trail' in options) {
+            return new NavigationEngine({ mode: 'NAVIGATE', graph, trail: options.trail });
+        }
+        return new NavigationEngine({ mode: 'NAVIGATE', graph, initialStack: options.stack });
+    }
+    static forScheduling(graph, options) {
+        const trail = options.trail ?? Trail.create({ frames: options.stack ?? [] });
+        return new NavigationEngine({ mode: 'SCHEDULE', graph, trail, actions: options.actions });
+    }
+    // ==================== RUN ====================
+    async run(maxSteps = 1) {
+        // ── Span : contexte commun aux trois modes ───────────────
+        const trailStr = this._buildTrailString();
+        const spanBuilder = shim.startSpan({
+            trail: trailStr,
+            from: this._resolvedFrom(),
+            to: this._targetTo(),
+            filters: this._currentFilters(),
+            path: [], // mis à jour après résolution
+        });
+        try {
+            let results;
+            switch (this.mode) {
+                case 'PATHFIND':
+                    results = await this.runPathfind(spanBuilder);
+                    break;
+                case 'NAVIGATE':
+                    results = await this.runNavigate(maxSteps, spanBuilder);
+                    break;
+                case 'SCHEDULE':
+                    results = await this.runSchedule(maxSteps, spanBuilder);
+                    break;
+                default:
+                    throw new Error(`Mode inconnu : ${this.mode}`);
+            }
+            // Émettre le span de succès
+            if (spanBuilder) {
+                const rowCount = this._countRows(results);
+                const span = spanBuilder.end({ rowCount });
+                shim.emitEnd(span);
+            }
+            return results;
+        }
+        catch (err) {
+            // Émettre le span d'erreur
+            if (spanBuilder) {
+                const span = spanBuilder.endWithError(err, {
+                    compiledGraphHash: 'unknown',
+                    weights: {},
+                    cacheState: { l1HitRate: 0, l2HitRate: 0, globalHitRate: 0, yoyoEvents: 0 },
+                });
+                shim.emitError(span);
+            }
+            throw err;
+        }
+    }
+    // ==================== PRIVATE (inchangé sauf signature + step timings) ====================
+    async runPathfind(spanBuilder) {
+        if (!this.pathFinder || !this.config.pathQuery) {
+            throw new Error('PATHFIND requiert pathQuery');
+        }
+        const { from, to, maxPaths = 5, transferPenalty = 0, via, minHops = 0 } = this.config.pathQuery;
+        const startTime = Date.now();
+        const hookResult = await this.hooks.call('traversal.before', {
+            from, to,
+            stack: [...this.trail.frames],
+            graph: this.graph,
+        });
+        if (hookResult.cancelled) {
+            this.errors.emit('traversal.failed', {
+                from, to,
+                reason: hookResult.reason ?? 'Annulé par hook traversal.before',
+            });
+            return [{ time: 0, mode: 'PATHFIND', result: { type: 'FAIL', reason: hookResult.reason } }];
+        }
+        // ── Step : PathFinder ────────────────────────────────────
+        spanBuilder?.stepStart('PathFinder');
+        const allPaths = this.pathFinder.findAllPaths(from, to, maxPaths, 50, transferPenalty, via, minHops);
+        spanBuilder?.stepEnd('PathFinder');
+        if (allPaths.length === 0) {
+            this.errors.emit('route.notfound', {
+                from, to,
+                stack: [...this.trail.frames],
+            });
+            return [{ time: 0, mode: 'PATHFIND', result: { type: 'FAIL', reason: 'Aucun chemin trouvé' } }];
+        }
+        const pathsWithDetails = allPaths
+            .map(nodes => {
+            const edges = [];
+            let totalWeight = 0;
+            for (let i = 0; i < nodes.length - 1; i++) {
+                const edge = this.graph.edges.find(e => e.from === nodes[i] && e.to === nodes[i + 1]);
+                if (edge) {
+                    edges.push(edge);
+                    totalWeight += edge.weight;
+                }
+            }
+            return { nodes, edges, totalWeight };
+        })
+            .sort((a, b) => a.totalWeight - b.totalWeight)
+            .slice(0, maxPaths);
+        const best = pathsWithDetails[0];
+        // Mettre à jour le path dans le span
+        if (spanBuilder) {
+            ;
+            spanBuilder.withPath?.(best.nodes);
+        }
+        this.events.emit('traversal.complete', {
+            from, to,
+            path: best,
+            durationMs: Date.now() - startTime,
+            stackDepth: this.trail.depth,
+            routeUsed: best.nodes.join('→'),
+            routeWeight: best.totalWeight,
+        });
+        return pathsWithDetails.map((path, index) => ({
+            time: index,
+            mode: 'PATHFIND',
+            path,
+            result: { type: 'SUCCESS', data: { rank: index + 1, allPaths: pathsWithDetails } }
+        }));
+    }
+    async runNavigate(maxSteps, spanBuilder) {
+        if (!this.resolver)
+            throw new Error('NAVIGATE requiert Resolver');
+        const results = [];
+        for (let t = 0; t < maxSteps; t++) {
+            const resolved = this.trail.frames.filter(f => f.state === 'RESOLVED').length;
+            const unresolved = this.trail.unresolved;
+            if (unresolved.length === 0) {
+                results.push({
+                    time: t, mode: 'NAVIGATE', phase: 'COMPLETE',
+                    resolvedCount: resolved, unresolvedCount: 0,
+                    result: { type: 'SUCCESS' }
+                });
+                break;
+            }
+            const nextUnresolved = unresolved[0];
+            const hookResult = await this.hooks.call('traversal.before', {
+                from: [...this.trail.frames].reverse().find(f => f.state === 'RESOLVED')?.entity ?? '',
+                to: nextUnresolved.entity,
+                stack: [...this.trail.frames],
+                graph: this.graph,
+            });
+            if (hookResult.cancelled) {
+                this.errors.emit('traversal.failed', {
+                    from: '',
+                    to: nextUnresolved.entity,
+                    reason: hookResult.reason ?? 'Annulé par hook traversal.before',
+                });
+                results.push({
+                    time: t, mode: 'NAVIGATE', phase: 'COMPLETE',
+                    result: { type: 'FAIL', reason: hookResult.reason }
+                });
+                break;
+            }
+            const accessResult = await this.hooks.call('access.check', {
+                node: nextUnresolved.entity,
+                stack: [...this.trail.frames],
+                context: this.trail.user,
+            });
+            if (accessResult.cancelled) {
+                this.errors.emit('access.denied', {
+                    node: nextUnresolved.entity,
+                    reason: accessResult.reason ?? 'Accès refusé',
+                    stack: [...this.trail.frames],
+                });
+                results.push({
+                    time: t, mode: 'NAVIGATE', phase: 'COMPLETE',
+                    result: { type: 'FAIL', reason: accessResult.reason }
+                });
+                break;
+            }
+            const startTime = Date.now();
+            const currentStack = [...this.trail.frames];
+            // ── Step : Resolver ──────────────────────────────────
+            spanBuilder?.stepStart('Resolver');
+            const newStack = await this.resolver.resolve(currentStack);
+            spanBuilder?.stepEnd('Resolver');
+            for (const newFrame of newStack) {
+                if (newFrame.state === 'RESOLVED' || newFrame.state === 'DEFERRED') {
+                    this.trail.updateFrame(newFrame.entity, newFrame);
+                }
+            }
+            const justResolved = newStack.find(f => f.entity === nextUnresolved.entity && f.state === 'RESOLVED');
+            if (justResolved?.resolvedBy) {
+                this.events.emit('traversal.complete', {
+                    from: justResolved.resolvedBy.via,
+                    to: justResolved.entity,
+                    path: { nodes: [justResolved.resolvedBy.via, justResolved.entity], edges: [], totalWeight: 0 },
+                    durationMs: Date.now() - startTime,
+                    stackDepth: this.trail.depth,
+                    routeUsed: justResolved.resolvedBy.relation,
+                    routeWeight: 0,
+                });
+            }
+            results.push({
+                time: t, mode: 'NAVIGATE', phase: 'RESOLVE',
+                resolvedCount: resolved, unresolvedCount: unresolved.length
+            });
+        }
+        return results;
+    }
+    async runSchedule(maxSteps, spanBuilder) {
+        if (!this.scheduler)
+            throw new Error('SCHEDULE requiert Scheduler');
+        const results = [];
+        let currentStack = [...this.trail.frames];
+        for (let t = 0; t < maxSteps; t++) {
+            // ── Step : Scheduler ─────────────────────────────────
+            spanBuilder?.stepStart('Scheduler');
+            const stepResult = await this.scheduler.step(t, currentStack);
+            spanBuilder?.stepEnd('Scheduler');
+            if (!stepResult) {
+                results.push({
+                    time: t, mode: 'SCHEDULE', phase: 'COMPLETE',
+                    result: { type: 'SUCCESS', reason: 'Plus aucune action disponible' }
+                });
+                break;
+            }
+            currentStack = stepResult.updatedStack;
+            this.events.emit('traversal.complete', {
+                from: stepResult.selectedAction,
+                to: currentStack[currentStack.length - 1]?.entity ?? '',
+                path: { nodes: [], edges: [], totalWeight: 0 },
+                durationMs: 0,
+                stackDepth: this.trail.depth,
+                routeUsed: stepResult.selectedAction,
+                routeWeight: 0,
+            });
+            results.push({
+                time: t, mode: 'SCHEDULE', phase: 'EXECUTE',
+                selectedAction: stepResult.selectedAction,
+                result: stepResult.result
+            });
+        }
+        return results;
+    }
+    // ==================== HELPERS INSTRUMENTATION ====================
+    _buildTrailString() {
+        return this.trail.frames
+            .map(f => f.id !== undefined ? `${f.entity}(${f.id})` : f.entity)
+            .join('.');
+    }
+    _resolvedFrom() {
+        const resolved = [...this.trail.frames].reverse().find(f => f.state === 'RESOLVED');
+        if (resolved)
+            return resolved.entity;
+        if (this.config.pathQuery)
+            return this.config.pathQuery.from;
+        return this.trail.frames[0]?.entity ?? '';
+    }
+    _targetTo() {
+        const unresolved = this.trail.unresolved[0];
+        if (unresolved)
+            return unresolved.entity;
+        if (this.config.pathQuery)
+            return this.config.pathQuery.to;
+        return this.trail.frames[this.trail.frames.length - 1]?.entity ?? '';
+    }
+    _currentFilters() {
+        const resolved = this.trail.frames.find(f => f.state === 'RESOLVED' && f.id !== undefined);
+        return resolved?.id !== undefined ? { id: resolved.id } : {};
+    }
+    _countRows(results) {
+        // PATHFIND : nombre de chemins trouvés
+        if (this.mode === 'PATHFIND') {
+            return results.filter(r => r.result?.type === 'SUCCESS').length;
+        }
+        // NAVIGATE/SCHEDULE : nombre de steps résolus
+        return results.filter(r => r.phase === 'RESOLVE' || r.phase === 'EXECUTE').length;
+    }
+    // ==================== GETTERS ====================
+    getMode() { return this.mode; }
+    getGraph() { return this.graph; }
+    /** @deprecated Utiliser engine.trail directement */
+    getCurrentStack() { return [...this.trail.frames]; }
+}
+//# sourceMappingURL=NavigationEngine.js.map

package/dist/navigation/NavigationEngine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NavigationEngine.js","sourceRoot":"","sources":["../../src/navigation/NavigationEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAcH,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAA;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAQ,eAAe,CAAA;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAO,gBAAgB,CAAA;AAC3C,OAAO,EAAE,KAAK,EAAE,MAAW,YAAY,CAAA;AACvC,OAAO,EAAE,gBAAgB,EAAmB,MAAM,wBAAwB,CAAA;AAC1E,OAAO,EAAE,IAAI,EAAE,MAAY,qCAAqC,CAAA;AAEhE,MAAM,OAAO,gBAAgB;IACnB,IAAI,CAAmB;IACvB,KAAK,CAAa;IAClB,UAAU,CAAa;IACvB,QAAQ,CAAa;IACrB,SAAS,CAAa;IACtB,MAAM,CAA6B;IAE3C,gEAAgE;IAChD,KAAK,CAAO;IAE5B,gEAAgE;IAChD,KAAK,CAAsB;IAC3B,MAAM,CAAsB;IAC5B,MAAM,CAAsB;IAE5C,YAAY,MAA8B;QACxC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;QACpB,IAAI,CAAC,IAAI,GAAK,MAAM,CAAC,IAAI,CAAA;QACzB,IAAI,CAAC,KAAK,GAAI,MAAM,CAAC,KAAK,CAAA;QAE1B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;YACxC,MAAM,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE;SAClC,CAAC,CAAA;QAEF,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YACzC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;gBACxC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;oBACjB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAA;gBAClE,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,gBAAgB,EAAE,CAAA;QAChC,IAAI,CAAC,KAAK,GAAI,KAAK,CAAC,KAAK,CAAA;QACzB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAA;QAC1B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAA;QAE1B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,UAAU;gBACb,IAAI,CAAC,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC5C,MAAK;YACP,KAAK,UAAU;gBACb,IAAI,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACxC,MAAK;YACP,KAAK,UAAU;gBACb,IAAI,CAAC,SAAS,GAAG,IAAI,SAAS,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;gBAChE,MAAK;QACT,CAAC;IACH,CAAC;IAED,4DAA4D;IAE5D,MAAM,CAAC,cAAc,CAAC,KAAY,EAAE,KAAgB;QAClD,OAAO,IAAI,gBAAgB,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAA;IAC5E,CAAC;IAED,MAAM,CAAC,aAAa,CAClB,KAAY,EACZ,OAA8C;QAE9C,IAAI,OAAO,IAAI,OAAO,EAAE,CAAC;YACvB,OAAO,IAAI,gBAAgB,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;QAChF,CAAC;QACD,OAAO,IAAI,gBAAgB,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IACvF,CAAC;IAED,MAAM,CAAC,aAAa,CAClB,KAAY,EACZ,OAAsE;QAEtE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC,CAAA;QAC5E,OAAO,IAAI,gBAAgB,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAA;IAC3F,CAAC;IAED,gDAAgD;IAEhD,KAAK,CAAC,GAAG,CAAC,WAAmB,CAAC;QAC5B,4DAA4D;QAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAA;QACzC,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC;YACjC,KAAK,EAAI,QAAQ;YACjB,IAAI,EAAK,IAAI,CAAC,aAAa,EAAE;YAC7B,EAAE,EAAO,IAAI,CAAC,SAAS,EAAE;YACzB,OAAO,EAAE,IAAI,CAAC,eAAe,EAAE;YAC/B,IAAI,EAAK,EAAE,EAAI,8BAA8B;SAC9C,CAAC,CAAA;QAEF,IAAI,CAAC;YACH,IAAI,OAA2B,CAAA;YAE/B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBAClB,KAAK,UAAU;oBACb,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAA;oBAC7C,MAAK;gBACP,KAAK,UAAU;oBACb,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAA;oBACvD,MAAK;gBACP,KAAK,UAAU;oBACb,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAA;oBACvD,MAAK;gBACP;oBACE,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;YAClD,CAAC;YAED,4BAA4B;YAC5B,IAAI,WAAW,EAAE,CAAC;gBAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAA;gBACzC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAA;gBAC1C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YACpB,CAAC;YAED,OAAO,OAAO,CAAA;QAEhB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,2BAA2B;YAC3B,IAAI,WAAW,EAAE,CAAC;gBAChB,MAAM,IAAI,GAAG,WAAW,CAAC,YAAY,CAAC,GAAY,EAAE;oBAClD,iBAAiB,EAAE,SAAS;oBAC5B,OAAO,EAAY,EAAE;oBACrB,UAAU,EAAS,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE;iBACnF,CAAC,CAAA;gBACF,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;YACtB,CAAC;YACD,MAAM,GAAG,CAAA;QACX,CAAC;IACH,CAAC;IAED,6FAA6F;IAErF,KAAK,CAAC,WAAW,CACvB,WAA8C;QAE9C,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YAC/C,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAA;QAChD,CAAC;QAED,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,GAAG,CAAC,EAAE,eAAe,GAAG,CAAC,EAAE,GAAG,EAAE,OAAO,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAA;QAC/F,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAE5B,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,EAAE;YAC3D,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAC7B,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC,CAAA;QAEF,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE;gBACnC,IAAI,EAAE,EAAE;gBACR,MAAM,EAAE,UAAU,CAAC,MAAM,IAAI,kCAAkC;aAChE,CAAC,CAAA;YACF,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;QAC7F,CAAC;QAED,4DAA4D;QAC5D,WAAW,EAAE,SAAS,CAAC,YAAY,CAAC,CAAA;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,eAAe,EAAE,GAAG,EAAE,OAAO,CAAC,CAAA;QACpG,WAAW,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;QAElC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,EAAE;gBACjC,IAAI,EAAE,EAAE;gBACR,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;aAC9B,CAAC,CAAA;YACF,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,qBAAqB,EAAE,EAAE,CAAC,CAAA;QACjG,CAAC;QAED,MAAM,gBAAgB,GAAG,QAAQ;aAC9B,GAAG,CAAC,KAAK,CAAC,EAAE;YACX,MAAM,KAAK,GAAgB,EAAE,CAAA;YAC7B,IAAI,WAAW,GAAG,CAAC,CAAA;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACrF,IAAI,IAAI,EAAE,CAAC;oBAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAAC,WAAW,IAAI,IAAI,CAAC,MAAM,CAAA;gBAAC,CAAC;YAC5D,CAAC;YACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAoB,CAAA;QACxD,CAAC,CAAC;aACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC;aAC7C,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;QAErB,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAA;QAEhC,qCAAqC;QACrC,IAAI,WAAW,EAAE,CAAC;YAChB,CAAC;YAAC,WAAmB,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC9C,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE;YACrC,IAAI,EAAE,EAAE;YACR,IAAI,EAAS,IAAI;YACjB,UAAU,EAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;YACnC,UAAU,EAAG,IAAI,CAAC,KAAK,CAAC,KAAK;YAC7B,SAAS,EAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;YACjC,WAAW,EAAE,IAAI,CAAC,WAAW;SAC9B,CAAC,CAAA;QAEF,OAAO,gBAAgB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YAC5C,IAAI,EAAI,KAAK;YACb,IAAI,EAAI,UAAmB;YAC3B,IAAI;YACJ,MAAM,EAAE,EAAE,IAAI,EAAE,SAAkB,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,EAAE,gBAAgB,EAAE,EAAE;SAC5F,CAAC,CAAC,CAAA;IACL,CAAC;IAEO,KAAK,CAAC,WAAW,CACvB,QAAgB,EAChB,WAA8C;QAE9C,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAA;QAEjE,MAAM,OAAO,GAAuB,EAAE,CAAA;QAEtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAK,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC,MAAM,CAAA;YAC/E,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAA;YAExC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU;oBAC5C,aAAa,EAAE,QAAQ,EAAE,eAAe,EAAE,CAAC;oBAC3C,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;iBAC5B,CAAC,CAAA;gBACF,MAAK;YACP,CAAC;YAED,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;YAEpC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,EAAE;gBAC3D,IAAI,EAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,CAAC,EAAE,MAAM,IAAI,EAAE;gBACvF,EAAE,EAAK,cAAc,CAAC,MAAM;gBAC5B,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;gBAC7B,KAAK,EAAE,IAAI,CAAC,KAAK;aAClB,CAAC,CAAA;YAEF,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE;oBACnC,IAAI,EAAI,EAAE;oBACV,EAAE,EAAM,cAAc,CAAC,MAAM;oBAC7B,MAAM,EAAE,UAAU,CAAC,MAAM,IAAI,kCAAkC;iBAChE,CAAC,CAAA;gBACF,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU;oBAC5C,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE;iBACpD,CAAC,CAAA;gBACF,MAAK;YACP,CAAC;YAED,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,EAAE;gBACzD,IAAI,EAAK,cAAc,CAAC,MAAM;gBAC9B,KAAK,EAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;gBAC/B,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;aACzB,CAAC,CAAA;YAEF,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC;gBAC3B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,EAAE;oBAChC,IAAI,EAAI,cAAc,CAAC,MAAM;oBAC7B,MAAM,EAAE,YAAY,CAAC,MAAM,IAAI,cAAc;oBAC7C,KAAK,EAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;iBAC/B,CAAC,CAAA;gBACF,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU;oBAC5C,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,CAAC,MAAM,EAAE;iBACtD,CAAC,CAAA;gBACF,MAAK;YACP,CAAC;YAED,MAAM,SAAS,GAAM,IAAI,CAAC,GAAG,EAAE,CAAA;YAC/B,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAY,CAAA;YAEtD,wDAAwD;YACxD,WAAW,EAAE,SAAS,CAAC,UAAU,CAAC,CAAA;YAClC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,CAAA;YAC1D,WAAW,EAAE,OAAO,CAAC,UAAU,CAAC,CAAA;YAEhC,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC;gBAChC,IAAI,QAAQ,CAAC,KAAK,KAAK,UAAU,IAAI,QAAQ,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;oBACnE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;gBACnD,CAAC;YACH,CAAC;YAED,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAChC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,cAAc,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,KAAK,UAAU,CAClE,CAAA;YACD,IAAI,YAAY,EAAE,UAAU,EAAE,CAAC;gBAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE;oBACrC,IAAI,EAAS,YAAY,CAAC,UAAU,CAAC,GAAG;oBACxC,EAAE,EAAW,YAAY,CAAC,MAAM;oBAChC,IAAI,EAAS,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,EAAE,YAAY,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE;oBACrG,UAAU,EAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;oBACnC,UAAU,EAAG,IAAI,CAAC,KAAK,CAAC,KAAK;oBAC7B,SAAS,EAAI,YAAY,CAAC,UAAU,CAAC,QAAQ;oBAC7C,WAAW,EAAE,CAAC;iBACf,CAAC,CAAA;YACJ,CAAC;YAED,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS;gBAC3C,aAAa,EAAE,QAAQ,EAAE,eAAe,EAAE,UAAU,CAAC,MAAM;aAC5D,CAAC,CAAA;QACJ,CAAC;QAED,OAAO,OAAO,CAAA;IAChB,CAAC;IAEO,KAAK,CAAC,WAAW,CACvB,QAAgB,EAChB,WAA8C;QAE9C,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAA;QAEnE,MAAM,OAAO,GAAuB,EAAE,CAAA;QACtC,IAAI,YAAY,GAAY,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QAElD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,wDAAwD;YACxD,WAAW,EAAE,SAAS,CAAC,WAAW,CAAC,CAAA;YACnC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,CAAA;YAC7D,WAAW,EAAE,OAAO,CAAC,WAAW,CAAC,CAAA;YAEjC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU;oBAC5C,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,+BAA+B,EAAE;iBACrE,CAAC,CAAA;gBACF,MAAK;YACP,CAAC;YAED,YAAY,GAAG,UAAU,CAAC,YAAY,CAAA;YAEtC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE;gBACrC,IAAI,EAAS,UAAU,CAAC,cAAc;gBACtC,EAAE,EAAW,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE;gBAChE,IAAI,EAAS,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE;gBACrD,UAAU,EAAG,CAAC;gBACd,UAAU,EAAG,IAAI,CAAC,KAAK,CAAC,KAAK;gBAC7B,SAAS,EAAI,UAAU,CAAC,cAAc;gBACtC,WAAW,EAAE,CAAC;aACf,CAAC,CAAA;YAEF,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS;gBAC3C,cAAc,EAAE,UAAU,CAAC,cAAc;gBACzC,MAAM,EAAU,UAAU,CAAC,MAAM;aAClC,CAAC,CAAA;QACJ,CAAC;QAED,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,oEAAoE;IAE5D,iBAAiB;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM;aACrB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;aAChE,IAAI,CAAC,GAAG,CAAC,CAAA;IACd,CAAC;IAEO,aAAa;QACnB,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,CAAC,CAAA;QACnF,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC,MAAM,CAAA;QACpC,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAA;QAC5D,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAA;IAC3C,CAAC;IAEO,SAAS;QACf,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;QAC3C,IAAI,UAAU;YAAE,OAAO,UAAU,CAAC,MAAM,CAAA;QACxC,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAA;QAC1D,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAA;IACtE,CAAC;IAEO,eAAe;QACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAA;QAC1F,OAAO,QAAQ,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;IAC9D,CAAC;IAEO,UAAU,CAAC,OAA2B;QAC5C,uCAAuC;QACvC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7B,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC,MAAM,CAAA;QACjE,CAAC;QACD,8CAA8C;QAC9C,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,MAAM,CAAA;IACnF,CAAC;IAED,oDAAoD;IAEpD,OAAO,KAAkB,OAAO,IAAI,CAAC,IAAI,CAAA,CAAC,CAAC;IAC3C,QAAQ,KAAiB,OAAO,IAAI,CAAC,KAAK,CAAA,CAAC,CAAC;IAE5C,oDAAoD;IACpD,eAAe,KAAc,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA,CAAC,CAAC;CAC7D"}

package/dist/navigation/Resolver.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Resolver - Résolution sémantique de frames (mode NAVIGATE)
+ *
+ * Parcourt la stack, trouve la première frame UNRESOLVED,
+ * identifie la meilleure arête dans le graphe V3 (nodes/edges)
+ * et résout la frame avec les filtres appropriés.
+ */
+import type { Frame, Graph } from '../types/index.js';
+export declare class Resolver {
+    private graph;
+    constructor(graph: Graph);
+    /**
+     * Résout la prochaine frame UNRESOLVED dans la stack.
+     * Retourne une nouvelle stack avec la frame résolue (ou DEFERRED si impossible).
+     */
+    resolve(stack: Frame[]): Promise<Frame[]>;
+    /**
+     * Trouve l'arête la plus pertinente pour résoudre une frame.
+     *
+     * Logique : on cherche parmi les frames RESOLVED (en remontant la stack),
+     * une arête qui va de cette entité source vers l'entité cible.
+     */
+    private selectBestEdge;
+    /**
+     * Vérifie si l'intention de la frame est compatible avec
+     * les conditions sémantiques portées par l'arête.
+     */
+    private intentMatchesCondition;
+    /**
+     * Extrait les filtres implicites portés par les métadonnées d'une arête.
+     * Ex: une arête sémantique { condition: { jobId: 2 } } devient un filtre.
+     */
+    private extractEdgeFilters;
+}
+//# sourceMappingURL=Resolver.d.ts.map

package/dist/navigation/Resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Resolver.d.ts","sourceRoot":"","sources":["../../src/navigation/Resolver.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK,EAA0B,MAAM,mBAAmB,CAAA;AAE7E,qBAAa,QAAQ;IACP,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,KAAK;IAEhC;;;OAGG;IACG,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAgD/C;;;;;OAKG;IACH,OAAO,CAAC,cAAc;IAgCtB;;;OAGG;IACH,OAAO,CAAC,sBAAsB;IAY9B;;;OAGG;IACH,OAAO,CAAC,kBAAkB;CAU3B"}

package/dist/navigation/Resolver.js

@@ -0,0 +1,113 @@
+/**
+ * Resolver - Résolution sémantique de frames (mode NAVIGATE)
+ *
+ * Parcourt la stack, trouve la première frame UNRESOLVED,
+ * identifie la meilleure arête dans le graphe V3 (nodes/edges)
+ * et résout la frame avec les filtres appropriés.
+ */
+export class Resolver {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Résout la prochaine frame UNRESOLVED dans la stack.
+     * Retourne une nouvelle stack avec la frame résolue (ou DEFERRED si impossible).
+     */
+    async resolve(stack) {
+        const unresolved = stack.filter(f => f.state === 'UNRESOLVED');
+        if (unresolved.length === 0)
+            return stack;
+        const frame = unresolved[0];
+        // Frame racine (en position 0, aucune frame résolue avant elle) :
+        // c'est une collection ou un point d'entrée — pas besoin d'arête entrante.
+        const frameIndex = stack.indexOf(frame);
+        const hasPriorResolved = stack
+            .slice(0, frameIndex)
+            .some(f => f.state === 'RESOLVED' && f.id !== undefined && f.id !== null);
+        if (!hasPriorResolved) {
+            return stack.map(f => (f === frame ? { ...f, state: 'RESOLVED' } : f));
+        }
+        const candidate = this.selectBestEdge(frame, stack);
+        if (!candidate) {
+            console.warn(`[Resolver] Aucune arête trouvée pour "${frame.entity}"`);
+            return stack.map(f => (f === frame ? { ...f, state: 'DEFERRED' } : f));
+        }
+        const { edge, sourceFrame } = candidate;
+        const resolved = {
+            ...frame,
+            state: 'RESOLVED',
+            resolvedBy: {
+                relation: edge.name ?? `${edge.from}→${edge.to}`,
+                via: edge.via ?? edge.from,
+                filters: [
+                    {
+                        field: `${sourceFrame.entity.toLowerCase()}Id`,
+                        operator: 'equals',
+                        value: sourceFrame.id
+                    },
+                    // Filtres portés par l'arête elle-même (ex: condition sémantique)
+                    ...this.extractEdgeFilters(edge)
+                ]
+            }
+        };
+        return stack.map(f => (f === frame ? resolved : f));
+    }
+    /**
+     * Trouve l'arête la plus pertinente pour résoudre une frame.
+     *
+     * Logique : on cherche parmi les frames RESOLVED (en remontant la stack),
+     * une arête qui va de cette entité source vers l'entité cible.
+     */
+    selectBestEdge(frame, stack) {
+        // Frames résolues, les plus récentes en premier (dernier contexte connu)
+        const resolvedFrames = [...stack]
+            .reverse()
+            .filter(f => f.state === 'RESOLVED' && f.id !== undefined && f.id !== null);
+        for (const source of resolvedFrames) {
+            const candidates = this.graph.edges.filter(edge => {
+                // L'arête doit partir de l'entité source et arriver à l'entité cible
+                const matchesDirection = edge.from === source.entity && edge.to === frame.entity;
+                // Si la frame a une intention, on vérifie la compatibilité sémantique
+                if (matchesDirection && frame.intent && edge.metadata?.condition) {
+                    return this.intentMatchesCondition(frame.intent, edge.metadata.condition);
+                }
+                return matchesDirection;
+            });
+            // On prend la candidate avec le poids le plus faible (chemin le plus direct)
+            if (candidates.length > 0) {
+                const best = candidates.sort((a, b) => a.weight - b.weight)[0];
+                return { edge: best, sourceFrame: source };
+            }
+        }
+        return null;
+    }
+    /**
+     * Vérifie si l'intention de la frame est compatible avec
+     * les conditions sémantiques portées par l'arête.
+     */
+    intentMatchesCondition(intent, condition) {
+        if (typeof condition === 'string')
+            return true; // Pas de condition structurée
+        return Object.entries(condition).every(([key, value]) => {
+            if (intent[key] === undefined)
+                return true; // On ne filtre pas ce qu'on ne connaît pas
+            return intent[key] === value;
+        });
+    }
+    /**
+     * Extrait les filtres implicites portés par les métadonnées d'une arête.
+     * Ex: une arête sémantique { condition: { jobId: 2 } } devient un filtre.
+     */
+    extractEdgeFilters(edge) {
+        const condition = edge.metadata?.condition;
+        if (!condition || typeof condition === 'string')
+            return [];
+        return Object.entries(condition).map(([field, value]) => ({
+            field,
+            operator: 'equals',
+            value
+        }));
+    }
+}
+//# sourceMappingURL=Resolver.js.map

package/dist/navigation/Resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Resolver.js","sourceRoot":"","sources":["../../src/navigation/Resolver.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,MAAM,OAAO,QAAQ;IACC;IAApB,YAAoB,KAAY;QAAZ,UAAK,GAAL,KAAK,CAAO;IAAG,CAAC;IAEpC;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,KAAc;QAC1B,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,YAAY,CAAC,CAAA;QAE9D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAA;QAEzC,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;QAE3B,kEAAkE;QAClE,2EAA2E;QAC3E,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,MAAM,gBAAgB,GAAG,KAAK;aAC3B,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC;aACpB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAA;QAE3E,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,UAAmB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACjF,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QAEnD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,yCAAyC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;YACtE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,UAAmB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACjF,CAAC;QAED,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,SAAS,CAAA;QAEvC,MAAM,QAAQ,GAAU;YACtB,GAAG,KAAK;YACR,KAAK,EAAE,UAAU;YACjB,UAAU,EAAE;gBACV,QAAQ,EAAE,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,EAAE;gBAChD,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI;gBAC1B,OAAO,EAAE;oBACP;wBACE,KAAK,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI;wBAC9C,QAAQ,EAAE,QAAQ;wBAClB,KAAK,EAAE,WAAW,CAAC,EAAG;qBACvB;oBACD,kEAAkE;oBAClE,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;iBACjC;aACF;SACF,CAAA;QAED,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACrD,CAAC;IAED;;;;;OAKG;IACK,cAAc,CACpB,KAAY,EACZ,KAAc;QAEd,yEAAyE;QACzE,MAAM,cAAc,GAAG,CAAC,GAAG,KAAK,CAAC;aAC9B,OAAO,EAAE;aACT,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAA;QAE7E,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;YACpC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;gBAChD,qEAAqE;gBACrE,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM,CAAA;gBAEhF,sEAAsE;gBACtE,IAAI,gBAAgB,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC;oBACjE,OAAO,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;gBAC3E,CAAC;gBAED,OAAO,gBAAgB,CAAA;YACzB,CAAC,CAAC,CAAA;YAEF,6EAA6E;YAC7E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC9D,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,CAAA;YAC5C,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;OAGG;IACK,sBAAsB,CAC5B,MAA2B,EAC3B,SAAuC;QAEvC,IAAI,OAAO,SAAS,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAA,CAAC,8BAA8B;QAE7E,OAAO,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE;YACtD,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,SAAS;gBAAE,OAAO,IAAI,CAAA,CAAC,2CAA2C;YACtF,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,KAAK,CAAA;QAC9B,CAAC,CAAC,CAAA;IACJ,CAAC;IAED;;;OAGG;IACK,kBAAkB,CAAC,IAAe;QACxC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAA;QAC1C,IAAI,CAAC,SAAS,IAAI,OAAO,SAAS,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAA;QAE1D,OAAO,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YACxD,KAAK;YACL,QAAQ,EAAE,QAAiB;YAC3B,KAAK;SACN,CAAC,CAAC,CAAA;IACL,CAAC;CACF"}

package/dist/navigation/Scheduler.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Scheduler - Exécution d'actions par priorité (mode SCHEDULE)
+ *
+ * À chaque step :
+ *   1. Filtre les actions disponibles (condition when + cooldown + terminal)
+ *   2. Sélectionne la plus prioritaire (weight le plus élevé)
+ *   3. L'exécute et met à jour l'état interne
+ *
+ * C'est le cœur du moteur d'agent : une boucle de décision
+ * déterministe basée sur les poids et l'état de la stack.
+ */
+import type { ScheduleAction, ActionState, Frame, Graph, NavigationResult } from '../types/index.js';
+export interface SchedulerStepResult {
+    selectedAction: string;
+    result: NavigationResult;
+    updatedStack: Frame[];
+}
+export declare class Scheduler {
+    private actions;
+    private graph;
+    private actionStates;
+    constructor(actions: ScheduleAction[], graph: Graph);
+    /**
+     * Exécute un step du scheduler.
+     * Retourne null si aucune action n'est disponible (terminaison naturelle).
+     */
+    step(time: number, stack: Frame[]): Promise<SchedulerStepResult | null>;
+    /**
+     * Retourne les actions disponibles à un instant t pour une stack donnée.
+     * Filtre : terminal déjà exécuté, cooldown, maxExecutions, condition when().
+     */
+    getAvailableActions(time: number, stack: Frame[]): ScheduleAction[];
+    private updateState;
+    getActionState(name: string): ActionState | undefined;
+}
+//# sourceMappingURL=Scheduler.d.ts.map

package/dist/navigation/Scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Scheduler.d.ts","sourceRoot":"","sources":["../../src/navigation/Scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EACV,cAAc,EACd,WAAW,EACX,KAAK,EACL,KAAK,EACL,gBAAgB,EACjB,MAAM,mBAAmB,CAAA;AAE1B,MAAM,WAAW,mBAAmB;IAClC,cAAc,EAAE,MAAM,CAAA;IACtB,MAAM,EAAE,gBAAgB,CAAA;IACxB,YAAY,EAAE,KAAK,EAAE,CAAA;CACtB;AAED,qBAAa,SAAS;IAIlB,OAAO,CAAC,OAAO;IACf,OAAO,CAAC,KAAK;IAJf,OAAO,CAAC,YAAY,CAA0B;gBAGpC,OAAO,EAAE,cAAc,EAAE,EACzB,KAAK,EAAE,KAAK;IAWtB;;;OAGG;IACG,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,mBAAmB,GAAG,IAAI,CAAC;IA6C7E;;;OAGG;IACH,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,cAAc,EAAE;IA0BnE,OAAO,CAAC,WAAW;IAWnB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;CAGtD"}