@llm-dev-ops/agentics-cli 1.4.29 → 1.4.32

package/dist/bundled-agents/copilot-agents/functions/lib/services/agents/planner/planner-agent.d.ts

@@ -0,0 +1,119 @@
+/**
+ * Planner Agent
+ *
+ * Purpose: Translate clarified objectives into structured execution plans
+ * Classification: PLANNING, STRUCTURAL_SYNTHESIS
+ * decision_type: plan_generation
+ *
+ * Scope:
+ * - Generate ordered plan steps
+ * - Identify dependencies
+ * - Define sequencing
+ *
+ * CONSTITUTION COMPLIANCE:
+ * ✓ Stateless at runtime
+ * ✓ Emits exactly ONE DecisionEvent per invocation
+ * ✓ Persists ONLY via ruvector-service
+ * ✓ NEVER connects directly to databases
+ * ✓ NEVER executes SQL
+ * ✓ NEVER modifies runtime behavior
+ * ✓ NEVER orchestrates other agents
+ * ✓ NEVER enforces policy
+ * ✓ NEVER intercepts execution paths
+ *
+ * Must Never:
+ * - Execute steps
+ * - Assign agents
+ * - Allocate resources
+ * - Schedule execution
+ */
+import { BaseAgent, AgentMetadata, AgentResult, PlannerInput, PlannerOutput } from '../contracts';
+import { RuvectorPersistence } from './ruvector-persistence';
+import { Telemetry } from './telemetry';
+/**
+ * Planner Agent Implementation
+ *
+ * This agent analyzes objectives and produces structured execution plans.
+ * It is purely analytical - it NEVER executes, assigns, or schedules anything.
+ */
+export declare class PlannerAgent implements BaseAgent<PlannerInput, PlannerOutput> {
+    readonly metadata: AgentMetadata;
+    private readonly persistence;
+    private readonly telemetry;
+    constructor(persistence: RuvectorPersistence, telemetry: Telemetry);
+    /**
+     * Validate input against PlannerInputSchema
+     */
+    validateInput(input: unknown): PlannerInput;
+    /**
+     * Invoke the planner agent
+     *
+     * DETERMINISTIC: Same input always produces same output structure
+     * STATELESS: No internal state modified
+     * NON-BLOCKING: Fully async
+     */
+    invoke(input: PlannerInput, executionRef: string): Promise<AgentResult>;
+    /**
+     * Generate structured execution plan from objective
+     *
+     * This is the core planning logic - purely analytical.
+     * NEVER executes, assigns agents, or schedules anything.
+     */
+    private generatePlan;
+    /**
+     * Decompose objective into ordered steps
+     */
+    private decomposeObjective;
+    /**
+     * Create a plan step
+     */
+    private createStep;
+    /**
+     * Build dependency graph as adjacency list
+     */
+    private buildDependencyGraph;
+    /**
+     * Find critical path (longest dependency chain)
+     */
+    private findCriticalPath;
+    /**
+     * Identify groups of steps that can run in parallel
+     */
+    private identifyParallelGroups;
+    /**
+     * Resequence steps based on dependency order
+     */
+    private resequenceSteps;
+    /**
+     * Calculate maximum dependency depth
+     */
+    private calculateMaxDepth;
+    /**
+     * Identify potential risks based on plan structure
+     */
+    private identifyRisks;
+    /**
+     * Extract assumptions made during planning
+     */
+    private extractAssumptions;
+    /**
+     * Summarize objective for output
+     */
+    private summarizeObjective;
+    /**
+     * Calculate confidence score based on plan quality
+     */
+    private calculateConfidence;
+    /**
+     * Get constraints applied during planning
+     */
+    private getAppliedConstraints;
+    /**
+     * Classify error for proper error code
+     */
+    private classifyError;
+    /**
+     * Helper: Check if text contains any of the keywords
+     */
+    private containsAny;
+}

package/dist/bundled-agents/copilot-agents/functions/lib/services/agents/planner/planner-agent.js

@@ -0,0 +1,421 @@
+"use strict";
+/**
+ * Planner Agent
+ *
+ * Purpose: Translate clarified objectives into structured execution plans
+ * Classification: PLANNING, STRUCTURAL_SYNTHESIS
+ * decision_type: plan_generation
+ *
+ * Scope:
+ * - Generate ordered plan steps
+ * - Identify dependencies
+ * - Define sequencing
+ *
+ * CONSTITUTION COMPLIANCE:
+ * ✓ Stateless at runtime
+ * ✓ Emits exactly ONE DecisionEvent per invocation
+ * ✓ Persists ONLY via ruvector-service
+ * ✓ NEVER connects directly to databases
+ * ✓ NEVER executes SQL
+ * ✓ NEVER modifies runtime behavior
+ * ✓ NEVER orchestrates other agents
+ * ✓ NEVER enforces policy
+ * ✓ NEVER intercepts execution paths
+ *
+ * Must Never:
+ * - Execute steps
+ * - Assign agents
+ * - Allocate resources
+ * - Schedule execution
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PlannerAgent = void 0;
+const uuid_1 = require("uuid");
+const contracts_1 = require("../contracts");
+const AGENT_ID = 'planner-agent';
+const AGENT_VERSION = '1.0.0';
+const DECISION_TYPE = 'plan_generation';
+/**
+ * Planner Agent Implementation
+ *
+ * This agent analyzes objectives and produces structured execution plans.
+ * It is purely analytical - it NEVER executes, assigns, or schedules anything.
+ */
+class PlannerAgent {
+    metadata = {
+        id: AGENT_ID,
+        name: 'Planner Agent',
+        version: AGENT_VERSION,
+        classifications: [
+            contracts_1.AgentClassification.PLANNING,
+            contracts_1.AgentClassification.STRUCTURAL_SYNTHESIS,
+        ],
+        decision_type: DECISION_TYPE,
+        description: 'Translates clarified objectives into structured execution plans with dependencies and sequencing.',
+    };
+    persistence;
+    telemetry;
+    constructor(persistence, telemetry) {
+        this.persistence = persistence;
+        this.telemetry = telemetry;
+    }
+    /**
+     * Validate input against PlannerInputSchema
+     */
+    validateInput(input) {
+        return contracts_1.PlannerInputSchema.parse(input);
+    }
+    /**
+     * Invoke the planner agent
+     *
+     * DETERMINISTIC: Same input always produces same output structure
+     * STATELESS: No internal state modified
+     * NON-BLOCKING: Fully async
+     */
+    async invoke(input, executionRef) {
+        const startTime = Date.now();
+        try {
+            // Emit telemetry start
+            this.telemetry.recordStart(AGENT_ID, executionRef, input);
+            // Generate the plan (pure analysis, no side effects)
+            const output = this.generatePlan(input);
+            // Validate output
+            const validatedOutput = contracts_1.PlannerOutputSchema.parse(output);
+            // Calculate confidence based on plan quality metrics
+            const confidence = this.calculateConfidence(validatedOutput);
+            // Constraints applied during planning
+            const constraintsApplied = this.getAppliedConstraints(input);
+            // Create the DecisionEvent
+            const event = (0, contracts_1.createDecisionEvent)(AGENT_ID, AGENT_VERSION, DECISION_TYPE, input, validatedOutput, confidence, constraintsApplied, executionRef);
+            // Persist via ruvector-service (best-effort, non-blocking)
+            let persistence_status;
+            try {
+                await this.persistence.store(event);
+                persistence_status = { status: 'persisted' };
+            }
+            catch (persistError) {
+                const persistMessage = persistError instanceof Error ? persistError.message : 'Unknown persistence error';
+                console.error(`[${AGENT_ID}] RuVector persistence failed (non-blocking): ${persistMessage}`);
+                persistence_status = { status: 'skipped', error: persistMessage };
+            }
+            // Emit telemetry success
+            this.telemetry.recordSuccess(AGENT_ID, executionRef, Date.now() - startTime);
+            return {
+                status: 'success',
+                event,
+                persistence_status,
+            };
+        }
+        catch (error) {
+            const errorMessage = error instanceof Error ? error.message : 'Unknown error';
+            const errorCode = this.classifyError(error);
+            // Emit telemetry failure
+            this.telemetry.recordFailure(AGENT_ID, executionRef, errorCode, errorMessage);
+            return (0, contracts_1.createErrorResult)(errorCode, errorMessage, executionRef);
+        }
+    }
+    /**
+     * Generate structured execution plan from objective
+     *
+     * This is the core planning logic - purely analytical.
+     * NEVER executes, assigns agents, or schedules anything.
+     */
+    generatePlan(input) {
+        const planId = (0, uuid_1.v4)();
+        const steps = this.decomposeObjective(input);
+        const dependencyGraph = this.buildDependencyGraph(steps);
+        const criticalPath = this.findCriticalPath(steps, dependencyGraph);
+        const parallelGroups = this.identifyParallelGroups(steps, dependencyGraph);
+        return {
+            plan_id: planId,
+            objective_summary: this.summarizeObjective(input.objective),
+            steps,
+            dependency_graph: dependencyGraph,
+            critical_path: criticalPath,
+            parallel_groups: parallelGroups,
+            analysis: {
+                total_steps: steps.length,
+                max_depth: this.calculateMaxDepth(dependencyGraph),
+                parallel_opportunities: parallelGroups.filter(g => g.length > 1).length,
+                risks: this.identifyRisks(steps, input),
+                assumptions: this.extractAssumptions(input),
+            },
+            version: '1.0.0',
+        };
+    }
+    /**
+     * Decompose objective into ordered steps
+     */
+    decomposeObjective(input) {
+        const objective = input.objective.toLowerCase();
+        const steps = [];
+        // Pattern-based decomposition
+        // This is a deterministic analysis based on objective structure
+        // Always start with analysis/understanding phase
+        steps.push(this.createStep('analyze-requirements', 'Analyze Requirements', 'Analyze and validate the requirements from the objective', 0, [], ['requirements', 'analysis'], 'high'));
+        // Design phase
+        steps.push(this.createStep('design-solution', 'Design Solution', 'Design the solution architecture and approach', 1, [{ depends_on: 'analyze-requirements', type: 'blocking' }], ['design', 'architecture'], 'high'));
+        // Implementation planning based on objective keywords
+        if (this.containsAny(objective, ['build', 'create', 'implement', 'develop'])) {
+            steps.push(this.createStep('plan-implementation', 'Plan Implementation', 'Define implementation steps and technical approach', 2, [{ depends_on: 'design-solution', type: 'blocking' }], ['implementation', 'planning'], 'high'));
+        }
+        // Validation phase
+        if (this.containsAny(objective, ['test', 'validate', 'verify', 'check'])) {
+            steps.push(this.createStep('plan-validation', 'Plan Validation', 'Define validation criteria and test approach', steps.length, [{ depends_on: steps[steps.length - 1]?.step_id || 'design-solution', type: 'data' }], ['validation', 'testing'], 'medium'));
+        }
+        // Integration consideration
+        if (this.containsAny(objective, ['integrate', 'connect', 'api', 'service'])) {
+            steps.push(this.createStep('plan-integration', 'Plan Integration', 'Define integration points and interface contracts', steps.length, [{ depends_on: 'design-solution', type: 'data' }], ['integration', 'interfaces'], 'medium', true // parallelizable
+            ));
+        }
+        // Documentation
+        steps.push(this.createStep('plan-documentation', 'Plan Documentation', 'Define documentation requirements and structure', steps.length, [{ depends_on: 'design-solution', type: 'data' }], ['documentation'], 'low', true));
+        // Completion/Review phase
+        steps.push(this.createStep('define-completion-criteria', 'Define Completion Criteria', 'Establish clear criteria for plan completion', steps.length, steps.slice(0, -1).map(s => ({ depends_on: s.step_id, type: 'data' })), ['completion', 'criteria'], 'high'));
+        // Re-sequence based on dependencies
+        return this.resequenceSteps(steps);
+    }
+    /**
+     * Create a plan step
+     */
+    createStep(stepId, name, description, sequenceOrder, dependencies, tags, criticality, parallelizable = false) {
+        return {
+            step_id: stepId,
+            name,
+            description,
+            sequence_order: sequenceOrder,
+            dependencies,
+            expected_inputs: [],
+            expected_outputs: [{
+                    name: `${stepId}-output`,
+                    type: 'artifact',
+                    description: `Output from ${name}`,
+                }],
+            tags,
+            constraints: [],
+            parallelizable,
+            criticality,
+        };
+    }
+    /**
+     * Build dependency graph as adjacency list
+     */
+    buildDependencyGraph(steps) {
+        const graph = {};
+        for (const step of steps) {
+            graph[step.step_id] = step.dependencies.map(d => d.depends_on);
+        }
+        return graph;
+    }
+    /**
+     * Find critical path (longest dependency chain)
+     */
+    findCriticalPath(steps, graph) {
+        const memo = new Map();
+        const findLongestPath = (stepId) => {
+            if (memo.has(stepId)) {
+                return memo.get(stepId);
+            }
+            const dependencies = graph[stepId] || [];
+            if (dependencies.length === 0) {
+                memo.set(stepId, [stepId]);
+                return [stepId];
+            }
+            let longestDep = [];
+            for (const dep of dependencies) {
+                const path = findLongestPath(dep);
+                if (path.length > longestDep.length) {
+                    longestDep = path;
+                }
+            }
+            const result = [...longestDep, stepId];
+            memo.set(stepId, result);
+            return result;
+        };
+        let criticalPath = [];
+        for (const step of steps) {
+            const path = findLongestPath(step.step_id);
+            if (path.length > criticalPath.length) {
+                criticalPath = path;
+            }
+        }
+        return criticalPath;
+    }
+    /**
+     * Identify groups of steps that can run in parallel
+     */
+    identifyParallelGroups(steps, graph) {
+        const groups = [];
+        const completed = new Set();
+        while (completed.size < steps.length) {
+            const currentGroup = [];
+            for (const step of steps) {
+                if (completed.has(step.step_id))
+                    continue;
+                const deps = graph[step.step_id] || [];
+                const allDepsComplete = deps.every(d => completed.has(d));
+                if (allDepsComplete) {
+                    currentGroup.push(step.step_id);
+                }
+            }
+            if (currentGroup.length === 0)
+                break; // Circular dependency protection
+            groups.push(currentGroup);
+            currentGroup.forEach(id => completed.add(id));
+        }
+        return groups;
+    }
+    /**
+     * Resequence steps based on dependency order
+     */
+    resequenceSteps(steps) {
+        const graph = this.buildDependencyGraph(steps);
+        const groups = this.identifyParallelGroups(steps, graph);
+        let order = 0;
+        const stepMap = new Map(steps.map(s => [s.step_id, s]));
+        for (const group of groups) {
+            for (const stepId of group) {
+                const step = stepMap.get(stepId);
+                if (step) {
+                    step.sequence_order = order;
+                }
+            }
+            order++;
+        }
+        return steps.sort((a, b) => a.sequence_order - b.sequence_order);
+    }
+    /**
+     * Calculate maximum dependency depth
+     */
+    calculateMaxDepth(graph) {
+        const memo = new Map();
+        const getDepth = (stepId, visited) => {
+            if (visited.has(stepId))
+                return 0; // Cycle protection
+            if (memo.has(stepId))
+                return memo.get(stepId);
+            visited.add(stepId);
+            const deps = graph[stepId] || [];
+            if (deps.length === 0) {
+                memo.set(stepId, 0);
+                return 0;
+            }
+            const maxDepDep = Math.max(...deps.map(d => getDepth(d, new Set(visited))));
+            const depth = maxDepDep + 1;
+            memo.set(stepId, depth);
+            return depth;
+        };
+        return Math.max(0, ...Object.keys(graph).map(id => getDepth(id, new Set())));
+    }
+    /**
+     * Identify potential risks based on plan structure
+     */
+    identifyRisks(steps, input) {
+        const risks = [];
+        // Check for critical path bottlenecks
+        const criticalSteps = steps.filter(s => s.criticality === 'critical' || s.criticality === 'high');
+        if (criticalSteps.length > steps.length * 0.5) {
+            risks.push({
+                description: 'High concentration of critical steps may indicate plan complexity risk',
+                severity: 'medium',
+                affected_steps: criticalSteps.map(s => s.step_id),
+            });
+        }
+        // Check for steps with many dependencies
+        const highDependencySteps = steps.filter(s => s.dependencies.length > 3);
+        if (highDependencySteps.length > 0) {
+            risks.push({
+                description: 'Steps with many dependencies may create coordination complexity',
+                severity: 'low',
+                affected_steps: highDependencySteps.map(s => s.step_id),
+            });
+        }
+        return risks;
+    }
+    /**
+     * Extract assumptions made during planning
+     */
+    extractAssumptions(input) {
+        const assumptions = [
+            'Objective has been clarified and validated',
+            'All implicit requirements have been captured',
+        ];
+        if (!input.context?.constraints?.length) {
+            assumptions.push('No explicit constraints provided - using default planning constraints');
+        }
+        if (!input.context?.existing_components?.length) {
+            assumptions.push('No existing components specified - planning as greenfield');
+        }
+        return assumptions;
+    }
+    /**
+     * Summarize objective for output
+     */
+    summarizeObjective(objective) {
+        // Truncate and clean for summary
+        const cleaned = objective.trim().replace(/\s+/g, ' ');
+        return cleaned.length > 200 ? cleaned.substring(0, 197) + '...' : cleaned;
+    }
+    /**
+     * Calculate confidence score based on plan quality
+     */
+    calculateConfidence(output) {
+        let confidence = 0.7; // Base confidence
+        // Boost for well-structured plans
+        if (output.steps.length >= 3 && output.steps.length <= 15) {
+            confidence += 0.1;
+        }
+        // Boost for clear critical path
+        if (output.critical_path.length > 0) {
+            confidence += 0.05;
+        }
+        // Boost for parallel opportunities
+        if (output.analysis.parallel_opportunities > 0) {
+            confidence += 0.05;
+        }
+        // Reduce for many risks
+        if (output.analysis.risks.length > 3) {
+            confidence -= 0.1;
+        }
+        return Math.min(1.0, Math.max(0.0, confidence));
+    }
+    /**
+     * Get constraints applied during planning
+     */
+    getAppliedConstraints(input) {
+        const constraints = [
+            'read_only_analysis',
+            'no_execution',
+            'no_agent_assignment',
+            'no_resource_allocation',
+            'no_scheduling',
+            'deterministic_output',
+        ];
+        if (input.context?.constraints) {
+            constraints.push(...input.context.constraints.map(c => `user_constraint:${c}`));
+        }
+        return constraints;
+    }
+    /**
+     * Classify error for proper error code
+     */
+    classifyError(error) {
+        if (error instanceof Error) {
+            if (error.name === 'ZodError') {
+                return contracts_1.AgentErrorCodes.VALIDATION_FAILED;
+            }
+            if (error.message.includes('persistence') || error.message.includes('ruvector')) {
+                return contracts_1.AgentErrorCodes.PERSISTENCE_ERROR;
+            }
+        }
+        return contracts_1.AgentErrorCodes.PROCESSING_ERROR;
+    }
+    /**
+     * Helper: Check if text contains any of the keywords
+     */
+    containsAny(text, keywords) {
+        return keywords.some(kw => text.includes(kw));
+    }
+}
+exports.PlannerAgent = PlannerAgent;
+//# sourceMappingURL=planner-agent.js.map

package/dist/bundled-agents/copilot-agents/functions/lib/services/agents/planner/planner-agent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-agent.js","sourceRoot":"","sources":["../../../../../services/agents/planner/planner-agent.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;;;AAEH,+BAAoC;AACpC,4CAcsB;AAItB,MAAM,QAAQ,GAAG,eAAe,CAAC;AACjC,MAAM,aAAa,GAAG,OAAO,CAAC;AAC9B,MAAM,aAAa,GAAG,iBAAiB,CAAC;AAExC;;;;;GAKG;AACH,MAAa,YAAY;IACd,QAAQ,GAAkB;QACjC,EAAE,EAAE,QAAQ;QACZ,IAAI,EAAE,eAAe;QACrB,OAAO,EAAE,aAAa;QACtB,eAAe,EAAE;YACf,+BAAmB,CAAC,QAAQ;YAC5B,+BAAmB,CAAC,oBAAoB;SACzC;QACD,aAAa,EAAE,aAAa;QAC5B,WAAW,EAAE,mGAAmG;KACjH,CAAC;IAEe,WAAW,CAAsB;IACjC,SAAS,CAAY;IAEtC,YAAY,WAAgC,EAAE,SAAoB;QAChE,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,KAAc;QAC1B,OAAO,8BAAkB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,MAAM,CAAC,KAAmB,EAAE,YAAoB;QACpD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,IAAI,CAAC;YACH,uBAAuB;YACvB,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YAE1D,qDAAqD;YACrD,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAExC,kBAAkB;YAClB,MAAM,eAAe,GAAG,+BAAmB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAE1D,qDAAqD;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,eAAe,CAAC,CAAC;YAE7D,sCAAsC;YACtC,MAAM,kBAAkB,GAAG,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAE7D,2BAA2B;YAC3B,MAAM,KAAK,GAAG,IAAA,+BAAmB,EAC/B,QAAQ,EACR,aAAa,EACb,aAAa,EACb,KAAK,EACL,eAAe,EACf,UAAU,EACV,kBAAkB,EAClB,YAAY,CACb,CAAC;YAEF,oCAAoC;YACpC,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAEpC,yBAAyB;YACzB,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,QAAQ,EAAE,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC;YAE7E,OAAO;gBACL,MAAM,EAAE,SAAS;gBACjB,KAAK;aACN,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC;YAC9E,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAE5C,yBAAyB;YACzB,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,QAAQ,EAAE,YAAY,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;YAE9E,OAAO,IAAA,6BAAiB,EAAC,SAAS,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,YAAY,CAAC,KAAmB;QACtC,MAAM,MAAM,GAAG,IAAA,SAAM,GAAE,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,eAAe,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;QACnE,MAAM,cAAc,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;QAE3E,OAAO;YACL,OAAO,EAAE,MAAM;YACf,iBAAiB,EAAE,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,SAAS,CAAC;YAC3D,KAAK;YACL,gBAAgB,EAAE,eAAe;YACjC,aAAa,EAAE,YAAY;YAC3B,eAAe,EAAE,cAAc;YAC/B,QAAQ,EAAE;gBACR,WAAW,EAAE,KAAK,CAAC,MAAM;gBACzB,SAAS,EAAE,IAAI,CAAC,iBAAiB,CAAC,eAAe,CAAC;gBAClD,sBAAsB,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM;gBACvE,KAAK,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC;gBACvC,WAAW,EAAE,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;aAC5C;YACD,OAAO,EAAE,OAAO;SACjB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,KAAmB;QAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;QAChD,MAAM,KAAK,GAAe,EAAE,CAAC;QAE7B,8BAA8B;QAC9B,gEAAgE;QAEhE,iDAAiD;QACjD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CACxB,sBAAsB,EACtB,sBAAsB,EACtB,0DAA0D,EAC1D,CAAC,EACD,EAAE,EACF,CAAC,cAAc,EAAE,UAAU,CAAC,EAC5B,MAAM,CACP,CAAC,CAAC;QAEH,eAAe;QACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CACxB,iBAAiB,EACjB,iBAAiB,EACjB,+CAA+C,EAC/C,CAAC,EACD,CAAC,EAAE,UAAU,EAAE,sBAAsB,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAC1D,CAAC,QAAQ,EAAE,cAAc,CAAC,EAC1B,MAAM,CACP,CAAC,CAAC;QAEH,sDAAsD;QACtD,IAAI,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC;YAC7E,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CACxB,qBAAqB,EACrB,qBAAqB,EACrB,oDAAoD,EACpD,CAAC,EACD,CAAC,EAAE,UAAU,EAAE,iBAAiB,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EACrD,CAAC,gBAAgB,EAAE,UAAU,CAAC,EAC9B,MAAM,CACP,CAAC,CAAC;QACL,CAAC;QAED,mBAAmB;QACnB,IAAI,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;YACzE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CACxB,iBAAiB,EACjB,iBAAiB,EACjB,8CAA8C,EAC9C,KAAK,CAAC,MAAM,EACZ,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,OAAO,IAAI,iBAAiB,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EACrF,CAAC,YAAY,EAAE,SAAS,CAAC,EACzB,QAAQ,CACT,CAAC,CAAC;QACL,CAAC;QAED,4BAA4B;QAC5B,IAAI,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,WAAW,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC;YAC5E,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CACxB,kBAAkB,EAClB,kBAAkB,EAClB,mDAAmD,EACnD,KAAK,CAAC,MAAM,EACZ,CAAC,EAAE,UAAU,EAAE,iBAAiB,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EACjD,CAAC,aAAa,EAAE,YAAY,CAAC,EAC7B,QAAQ,EACR,IAAI,CAAC,iBAAiB;aACvB,CAAC,CAAC;QACL,CAAC;QAED,gBAAgB;QAChB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CACxB,oBAAoB,EACpB,oBAAoB,EACpB,iDAAiD,EACjD,KAAK,CAAC,MAAM,EACZ,CAAC,EAAE,UAAU,EAAE,iBAAiB,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EACjD,CAAC,eAAe,CAAC,EACjB,KAAK,EACL,IAAI,CACL,CAAC,CAAC;QAEH,0BAA0B;QAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CACxB,4BAA4B,EAC5B,4BAA4B,EAC5B,8CAA8C,EAC9C,KAAK,CAAC,MAAM,EACZ,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,MAAe,EAAE,CAAC,CAAC,EAC/E,CAAC,YAAY,EAAE,UAAU,CAAC,EAC1B,MAAM,CACP,CAAC,CAAC;QAEH,oCAAoC;QACpC,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACK,UAAU,CAChB,MAAc,EACd,IAAY,EACZ,WAAmB,EACnB,aAAqB,EACrB,YAA0B,EAC1B,IAAc,EACd,WAAmD,EACnD,iBAA0B,KAAK;QAE/B,OAAO;YACL,OAAO,EAAE,MAAM;YACf,IAAI;YACJ,WAAW;YACX,cAAc,EAAE,aAAa;YAC7B,YAAY;YACZ,eAAe,EAAE,EAAE;YACnB,gBAAgB,EAAE,CAAC;oBACjB,IAAI,EAAE,GAAG,MAAM,SAAS;oBACxB,IAAI,EAAE,UAAU;oBAChB,WAAW,EAAE,eAAe,IAAI,EAAE;iBACnC,CAAC;YACF,IAAI;YACJ,WAAW,EAAE,EAAE;YACf,cAAc;YACd,WAAW;SACZ,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,KAAiB;QAC5C,MAAM,KAAK,GAA6B,EAAE,CAAC;QAE3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACjE,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAAiB,EACjB,KAA+B;QAE/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;QAEzC,MAAM,eAAe,GAAG,CAAC,MAAc,EAAY,EAAE;YACnD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACrB,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAC3B,CAAC;YAED,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC9B,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3B,OAAO,CAAC,MAAM,CAAC,CAAC;YAClB,CAAC;YAED,IAAI,UAAU,GAAa,EAAE,CAAC;YAC9B,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;gBAClC,IAAI,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;oBACpC,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;YACH,CAAC;YAED,MAAM,MAAM,GAAG,CAAC,GAAG,UAAU,EAAE,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACzB,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,IAAI,YAAY,GAAa,EAAE,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;gBACtC,YAAY,GAAG,IAAI,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAC5B,KAAiB,EACjB,KAA+B;QAE/B,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,OAAO,SAAS,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YACrC,MAAM,YAAY,GAAa,EAAE,CAAC;YAElC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;oBAAE,SAAS;gBAE1C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBACvC,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE1D,IAAI,eAAe,EAAE,CAAC;oBACpB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;YAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,CAAC,iCAAiC;YAEvE,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC1B,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,KAAiB;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEzD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAExD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACjC,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC;gBAC9B,CAAC;YACH,CAAC;YACD,KAAK,EAAE,CAAC;QACV,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,KAA+B;QACvD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEvC,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAE,OAAoB,EAAU,EAAE;YAChE,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,mBAAmB;YACtD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAE/C,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACpB,OAAO,CAAC,CAAC;YACX,CAAC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,MAAM,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC;IAED;;OAEG;IACK,aAAa,CACnB,KAAiB,EACjB,KAAmB;QAEnB,MAAM,KAAK,GAAkG,EAAE,CAAC;QAEhH,sCAAsC;QACtC,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,UAAU,IAAI,CAAC,CAAC,WAAW,KAAK,MAAM,CAAC,CAAC;QAClG,IAAI,aAAa,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YAC9C,KAAK,CAAC,IAAI,CAAC;gBACT,WAAW,EAAE,wEAAwE;gBACrF,QAAQ,EAAE,QAAQ;gBAClB,cAAc,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;aAClD,CAAC,CAAC;QACL,CAAC;QAED,yCAAyC;QACzC,MAAM,mBAAmB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzE,IAAI,mBAAmB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,CAAC;gBACT,WAAW,EAAE,iEAAiE;gBAC9E,QAAQ,EAAE,KAAK;gBACf,cAAc,EAAE,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;aACxD,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,KAAmB;QAC5C,MAAM,WAAW,GAAa;YAC5B,4CAA4C;YAC5C,8CAA8C;SAC/C,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;YACxC,WAAW,CAAC,IAAI,CAAC,uEAAuE,CAAC,CAAC;QAC5F,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,mBAAmB,EAAE,MAAM,EAAE,CAAC;YAChD,WAAW,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;QAChF,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,SAAiB;QAC1C,iCAAiC;QACjC,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACtD,OAAO,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;IAC5E,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,MAAqB;QAC/C,IAAI,UAAU,GAAG,GAAG,CAAC,CAAC,kBAAkB;QAExC,kCAAkC;QAClC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YAC1D,UAAU,IAAI,GAAG,CAAC;QACpB,CAAC;QAED,gCAAgC;QAChC,IAAI,MAAM,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpC,UAAU,IAAI,IAAI,CAAC;QACrB,CAAC;QAED,mCAAmC;QACnC,IAAI,MAAM,CAAC,QAAQ,CAAC,sBAAsB,GAAG,CAAC,EAAE,CAAC;YAC/C,UAAU,IAAI,IAAI,CAAC;QACrB,CAAC;QAED,wBAAwB;QACxB,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,UAAU,IAAI,GAAG,CAAC;QACpB,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,KAAmB;QAC/C,MAAM,WAAW,GAAG;YAClB,oBAAoB;YACpB,cAAc;YACd,qBAAqB;YACrB,wBAAwB;YACxB,eAAe;YACf,sBAAsB;SACvB,CAAC;QAEF,IAAI,KAAK,CAAC,OAAO,EAAE,WAAW,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC;QAClF,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,KAAc;QAClC,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC9B,OAAO,2BAAe,CAAC,iBAAiB,CAAC;YAC3C,CAAC;YACD,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBAChF,OAAO,2BAAe,CAAC,iBAAiB,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,2BAAe,CAAC,gBAAgB,CAAC;IAC1C,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,IAAY,EAAE,QAAkB;QAClD,OAAO,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;CACF;AAvgBD,oCAugBC"}

package/dist/bundled-agents/copilot-agents/functions/lib/services/agents/planner/ruvector-persistence.d.ts

@@ -0,0 +1,49 @@
+/**
+ * RuVector Persistence Layer
+ *
+ * Per Constitution: Agents persist ONLY via ruvector-service.
+ * NEVER connect directly to Google SQL.
+ * NEVER execute SQL.
+ */
+import { DecisionEvent } from '../contracts';
+export interface RuvectorConfig {
+    endpoint: string;
+    apiKey?: string;
+    namespace: string;
+    timeout?: number;
+}
+/**
+ * RuVector Persistence Service
+ *
+ * Handles all persistence operations through the ruvector-service.
+ * This is the ONLY allowed persistence mechanism per constitution.
+ */
+export declare class RuvectorPersistence {
+    private readonly config;
+    constructor(config: RuvectorConfig);
+    /**
+     * Store a DecisionEvent in ruvector
+     */
+    store(event: DecisionEvent): Promise<{
+        id: string;
+        stored: boolean;
+    }>;
+    /**
+     * Retrieve a DecisionEvent by execution reference
+     */
+    retrieve(executionRef: string): Promise<DecisionEvent | null>;
+    /**
+     * Search for DecisionEvents by agent and decision type
+     */
+    search(params: {
+        agentId?: string;
+        decisionType?: string;
+        fromTimestamp?: string;
+        toTimestamp?: string;
+        limit?: number;
+    }): Promise<DecisionEvent[]>;
+}
+/**
+ * Create RuVector persistence from environment
+ */
+export declare function createRuvectorFromEnv(): RuvectorPersistence;