@google/gemini-cli-core 0.1.12 → 0.1.13-nightly.250727.3e81359c

package/dist/src/services/loopDetectionService.d.ts

@@ -0,0 +1,94 @@
+/**
+ * @license
+ * Copyright 2025 Google LLC
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { ServerGeminiStreamEvent } from '../core/turn.js';
+import { Config } from '../config/config.js';
+/**
+ * Service for detecting and preventing infinite loops in AI responses.
+ * Monitors tool call repetitions and content sentence repetitions.
+ */
+export declare class LoopDetectionService {
+    private readonly config;
+    private promptId;
+    private lastToolCallKey;
+    private toolCallRepetitionCount;
+    private streamContentHistory;
+    private contentStats;
+    private lastContentIndex;
+    private loopDetected;
+    private turnsInCurrentPrompt;
+    private llmCheckInterval;
+    private lastCheckTurn;
+    constructor(config: Config);
+    private getToolCallKey;
+    /**
+     * Processes a stream event and checks for loop conditions.
+     * @param event - The stream event to process
+     * @returns true if a loop is detected, false otherwise
+     */
+    addAndCheck(event: ServerGeminiStreamEvent): boolean;
+    /**
+     * Signals the start of a new turn in the conversation.
+     *
+     * This method increments the turn counter and, if specific conditions are met,
+     * triggers an LLM-based check to detect potential conversation loops. The check
+     * is performed periodically based on the `llmCheckInterval`.
+     *
+     * @param signal - An AbortSignal to allow for cancellation of the asynchronous LLM check.
+     * @returns A promise that resolves to `true` if a loop is detected, and `false` otherwise.
+     */
+    turnStarted(signal: AbortSignal): Promise<boolean>;
+    private checkToolCallLoop;
+    /**
+     * Detects content loops by analyzing streaming text for repetitive patterns.
+     *
+     * The algorithm works by:
+     * 1. Appending new content to the streaming history
+     * 2. Truncating history if it exceeds the maximum length
+     * 3. Analyzing content chunks for repetitive patterns using hashing
+     * 4. Detecting loops when identical chunks appear frequently within a short distance
+     */
+    private checkContentLoop;
+    /**
+     * Truncates the content history to prevent unbounded memory growth.
+     * When truncating, adjusts all stored indices to maintain their relative positions.
+     */
+    private truncateAndUpdate;
+    /**
+     * Analyzes content in fixed-size chunks to detect repetitive patterns.
+     *
+     * Uses a sliding window approach:
+     * 1. Extract chunks of fixed size (CONTENT_CHUNK_SIZE)
+     * 2. Hash each chunk for efficient comparison
+     * 3. Track positions where identical chunks appear
+     * 4. Detect loops when chunks repeat frequently within a short distance
+     */
+    private analyzeContentChunksForLoop;
+    private hasMoreChunksToProcess;
+    /**
+     * Determines if a content chunk indicates a loop pattern.
+     *
+     * Loop detection logic:
+     * 1. Check if we've seen this hash before (new chunks are stored for future comparison)
+     * 2. Verify actual content matches to prevent hash collisions
+     * 3. Track all positions where this chunk appears
+     * 4. A loop is detected when the same chunk appears CONTENT_LOOP_THRESHOLD times
+     *    within a small average distance (≤ 1.5 * chunk size)
+     */
+    private isLoopDetectedForChunk;
+    /**
+     * Verifies that two chunks with the same hash actually contain identical content.
+     * This prevents false positives from hash collisions.
+     */
+    private isActualContentMatch;
+    private checkForLoopWithLLM;
+    /**
+     * Resets all loop detection state.
+     */
+    reset(promptId: string): void;
+    private resetToolCallCount;
+    private resetContentTracking;
+    private resetLlmCheckTracking;
+}

package/dist/src/services/loopDetectionService.js

@@ -0,0 +1,318 @@
+/**
+ * @license
+ * Copyright 2025 Google LLC
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { createHash } from 'crypto';
+import { GeminiEventType } from '../core/turn.js';
+import { logLoopDetected } from '../telemetry/loggers.js';
+import { LoopDetectedEvent, LoopType } from '../telemetry/types.js';
+import { DEFAULT_GEMINI_FLASH_MODEL } from '../config/config.js';
+import { Type } from '@google/genai';
+const TOOL_CALL_LOOP_THRESHOLD = 5;
+const CONTENT_LOOP_THRESHOLD = 10;
+const CONTENT_CHUNK_SIZE = 50;
+const MAX_HISTORY_LENGTH = 1000;
+/**
+ * The number of recent conversation turns to include in the history when asking the LLM to check for a loop.
+ */
+const LLM_LOOP_CHECK_HISTORY_COUNT = 20;
+/**
+ * The number of turns that must pass in a single prompt before the LLM-based loop check is activated.
+ */
+const LLM_CHECK_AFTER_TURNS = 30;
+/**
+ * The default interval, in number of turns, at which the LLM-based loop check is performed.
+ * This value is adjusted dynamically based on the LLM's confidence.
+ */
+const DEFAULT_LLM_CHECK_INTERVAL = 3;
+/**
+ * The minimum interval for LLM-based loop checks.
+ * This is used when the confidence of a loop is high, to check more frequently.
+ */
+const MIN_LLM_CHECK_INTERVAL = 5;
+/**
+ * The maximum interval for LLM-based loop checks.
+ * This is used when the confidence of a loop is low, to check less frequently.
+ */
+const MAX_LLM_CHECK_INTERVAL = 15;
+/**
+ * Service for detecting and preventing infinite loops in AI responses.
+ * Monitors tool call repetitions and content sentence repetitions.
+ */
+export class LoopDetectionService {
+    config;
+    promptId = '';
+    // Tool call tracking
+    lastToolCallKey = null;
+    toolCallRepetitionCount = 0;
+    // Content streaming tracking
+    streamContentHistory = '';
+    contentStats = new Map();
+    lastContentIndex = 0;
+    loopDetected = false;
+    // LLM loop track tracking
+    turnsInCurrentPrompt = 0;
+    llmCheckInterval = DEFAULT_LLM_CHECK_INTERVAL;
+    lastCheckTurn = 0;
+    constructor(config) {
+        this.config = config;
+    }
+    getToolCallKey(toolCall) {
+        const argsString = JSON.stringify(toolCall.args);
+        const keyString = `${toolCall.name}:${argsString}`;
+        return createHash('sha256').update(keyString).digest('hex');
+    }
+    /**
+     * Processes a stream event and checks for loop conditions.
+     * @param event - The stream event to process
+     * @returns true if a loop is detected, false otherwise
+     */
+    addAndCheck(event) {
+        if (this.loopDetected) {
+            return true;
+        }
+        switch (event.type) {
+            case GeminiEventType.ToolCallRequest:
+                // content chanting only happens in one single stream, reset if there
+                // is a tool call in between
+                this.resetContentTracking();
+                this.loopDetected = this.checkToolCallLoop(event.value);
+                break;
+            case GeminiEventType.Content:
+                this.loopDetected = this.checkContentLoop(event.value);
+                break;
+            default:
+                break;
+        }
+        return this.loopDetected;
+    }
+    /**
+     * Signals the start of a new turn in the conversation.
+     *
+     * This method increments the turn counter and, if specific conditions are met,
+     * triggers an LLM-based check to detect potential conversation loops. The check
+     * is performed periodically based on the `llmCheckInterval`.
+     *
+     * @param signal - An AbortSignal to allow for cancellation of the asynchronous LLM check.
+     * @returns A promise that resolves to `true` if a loop is detected, and `false` otherwise.
+     */
+    async turnStarted(signal) {
+        this.turnsInCurrentPrompt++;
+        if (this.turnsInCurrentPrompt >= LLM_CHECK_AFTER_TURNS &&
+            this.turnsInCurrentPrompt - this.lastCheckTurn >= this.llmCheckInterval) {
+            this.lastCheckTurn = this.turnsInCurrentPrompt;
+            return await this.checkForLoopWithLLM(signal);
+        }
+        return false;
+    }
+    checkToolCallLoop(toolCall) {
+        const key = this.getToolCallKey(toolCall);
+        if (this.lastToolCallKey === key) {
+            this.toolCallRepetitionCount++;
+        }
+        else {
+            this.lastToolCallKey = key;
+            this.toolCallRepetitionCount = 1;
+        }
+        if (this.toolCallRepetitionCount >= TOOL_CALL_LOOP_THRESHOLD) {
+            logLoopDetected(this.config, new LoopDetectedEvent(LoopType.CONSECUTIVE_IDENTICAL_TOOL_CALLS, this.promptId));
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Detects content loops by analyzing streaming text for repetitive patterns.
+     *
+     * The algorithm works by:
+     * 1. Appending new content to the streaming history
+     * 2. Truncating history if it exceeds the maximum length
+     * 3. Analyzing content chunks for repetitive patterns using hashing
+     * 4. Detecting loops when identical chunks appear frequently within a short distance
+     */
+    checkContentLoop(content) {
+        this.streamContentHistory += content;
+        this.truncateAndUpdate();
+        return this.analyzeContentChunksForLoop();
+    }
+    /**
+     * Truncates the content history to prevent unbounded memory growth.
+     * When truncating, adjusts all stored indices to maintain their relative positions.
+     */
+    truncateAndUpdate() {
+        if (this.streamContentHistory.length <= MAX_HISTORY_LENGTH) {
+            return;
+        }
+        // Calculate how much content to remove from the beginning
+        const truncationAmount = this.streamContentHistory.length - MAX_HISTORY_LENGTH;
+        this.streamContentHistory =
+            this.streamContentHistory.slice(truncationAmount);
+        this.lastContentIndex = Math.max(0, this.lastContentIndex - truncationAmount);
+        // Update all stored chunk indices to account for the truncation
+        for (const [hash, oldIndices] of this.contentStats.entries()) {
+            const adjustedIndices = oldIndices
+                .map((index) => index - truncationAmount)
+                .filter((index) => index >= 0);
+            if (adjustedIndices.length > 0) {
+                this.contentStats.set(hash, adjustedIndices);
+            }
+            else {
+                this.contentStats.delete(hash);
+            }
+        }
+    }
+    /**
+     * Analyzes content in fixed-size chunks to detect repetitive patterns.
+     *
+     * Uses a sliding window approach:
+     * 1. Extract chunks of fixed size (CONTENT_CHUNK_SIZE)
+     * 2. Hash each chunk for efficient comparison
+     * 3. Track positions where identical chunks appear
+     * 4. Detect loops when chunks repeat frequently within a short distance
+     */
+    analyzeContentChunksForLoop() {
+        while (this.hasMoreChunksToProcess()) {
+            // Extract current chunk of text
+            const currentChunk = this.streamContentHistory.substring(this.lastContentIndex, this.lastContentIndex + CONTENT_CHUNK_SIZE);
+            const chunkHash = createHash('sha256').update(currentChunk).digest('hex');
+            if (this.isLoopDetectedForChunk(currentChunk, chunkHash)) {
+                logLoopDetected(this.config, new LoopDetectedEvent(LoopType.CHANTING_IDENTICAL_SENTENCES, this.promptId));
+                return true;
+            }
+            // Move to next position in the sliding window
+            this.lastContentIndex++;
+        }
+        return false;
+    }
+    hasMoreChunksToProcess() {
+        return (this.lastContentIndex + CONTENT_CHUNK_SIZE <=
+            this.streamContentHistory.length);
+    }
+    /**
+     * Determines if a content chunk indicates a loop pattern.
+     *
+     * Loop detection logic:
+     * 1. Check if we've seen this hash before (new chunks are stored for future comparison)
+     * 2. Verify actual content matches to prevent hash collisions
+     * 3. Track all positions where this chunk appears
+     * 4. A loop is detected when the same chunk appears CONTENT_LOOP_THRESHOLD times
+     *    within a small average distance (≤ 1.5 * chunk size)
+     */
+    isLoopDetectedForChunk(chunk, hash) {
+        const existingIndices = this.contentStats.get(hash);
+        if (!existingIndices) {
+            this.contentStats.set(hash, [this.lastContentIndex]);
+            return false;
+        }
+        if (!this.isActualContentMatch(chunk, existingIndices[0])) {
+            return false;
+        }
+        existingIndices.push(this.lastContentIndex);
+        if (existingIndices.length < CONTENT_LOOP_THRESHOLD) {
+            return false;
+        }
+        // Analyze the most recent occurrences to see if they're clustered closely together
+        const recentIndices = existingIndices.slice(-CONTENT_LOOP_THRESHOLD);
+        const totalDistance = recentIndices[recentIndices.length - 1] - recentIndices[0];
+        const averageDistance = totalDistance / (CONTENT_LOOP_THRESHOLD - 1);
+        const maxAllowedDistance = CONTENT_CHUNK_SIZE * 1.5;
+        return averageDistance <= maxAllowedDistance;
+    }
+    /**
+     * Verifies that two chunks with the same hash actually contain identical content.
+     * This prevents false positives from hash collisions.
+     */
+    isActualContentMatch(currentChunk, originalIndex) {
+        const originalChunk = this.streamContentHistory.substring(originalIndex, originalIndex + CONTENT_CHUNK_SIZE);
+        return originalChunk === currentChunk;
+    }
+    async checkForLoopWithLLM(signal) {
+        const recentHistory = this.config
+            .getGeminiClient()
+            .getHistory()
+            .slice(-LLM_LOOP_CHECK_HISTORY_COUNT);
+        const prompt = `You are a sophisticated AI diagnostic agent specializing in identifying when a conversational AI is stuck in an unproductive state. Your task is to analyze the provided conversation history and determine if the assistant has ceased to make meaningful progress.
+
+An unproductive state is characterized by one or more of the following patterns over the last 5 or more assistant turns:
+
+Repetitive Actions: The assistant repeats the same tool calls or conversational responses a decent number of times. This includes simple loops (e.g., tool_A, tool_A, tool_A) and alternating patterns (e.g., tool_A, tool_B, tool_A, tool_B, ...).
+
+Cognitive Loop: The assistant seems unable to determine the next logical step. It might express confusion, repeatedly ask the same questions, or generate responses that don't logically follow from the previous turns, indicating it's stuck and not advancing the task.
+
+Crucially, differentiate between a true unproductive state and legitimate, incremental progress.
+For example, a series of 'tool_A' or 'tool_B' tool calls that make small, distinct changes to the same file (like adding docstrings to functions one by one) is considered forward progress and is NOT a loop. A loop would be repeatedly replacing the same text with the same content, or cycling between a small set of files with no net change.
+
+Please analyze the conversation history to determine the possibility that the conversation is stuck in a repetitive, non-productive state.`;
+        const contents = [
+            ...recentHistory,
+            { role: 'user', parts: [{ text: prompt }] },
+        ];
+        const schema = {
+            type: Type.OBJECT,
+            properties: {
+                reasoning: {
+                    type: Type.STRING,
+                    description: 'Your reasoning on if the conversation is looping without forward progress.',
+                },
+                confidence: {
+                    type: Type.NUMBER,
+                    description: 'A number between 0.0 and 1.0 representing your confidence that the conversation is in an unproductive state.',
+                },
+            },
+            required: ['reasoning', 'confidence'],
+        };
+        let result;
+        try {
+            result = await this.config
+                .getGeminiClient()
+                .generateJson(contents, schema, signal, DEFAULT_GEMINI_FLASH_MODEL);
+        }
+        catch (e) {
+            // Do nothing, treat it as a non-loop.
+            this.config.getDebugMode() ? console.error(e) : console.debug(e);
+            return false;
+        }
+        if (typeof result.confidence === 'number') {
+            if (result.confidence > 0.9) {
+                if (typeof result.reasoning === 'string' && result.reasoning) {
+                    console.warn(result.reasoning);
+                }
+                logLoopDetected(this.config, new LoopDetectedEvent(LoopType.LLM_DETECTED_LOOP, this.promptId));
+                return true;
+            }
+            else {
+                this.llmCheckInterval = Math.round(MIN_LLM_CHECK_INTERVAL +
+                    (MAX_LLM_CHECK_INTERVAL - MIN_LLM_CHECK_INTERVAL) *
+                        (1 - result.confidence));
+            }
+        }
+        return false;
+    }
+    /**
+     * Resets all loop detection state.
+     */
+    reset(promptId) {
+        this.promptId = promptId;
+        this.resetToolCallCount();
+        this.resetContentTracking();
+        this.resetLlmCheckTracking();
+        this.loopDetected = false;
+    }
+    resetToolCallCount() {
+        this.lastToolCallKey = null;
+        this.toolCallRepetitionCount = 0;
+    }
+    resetContentTracking(resetHistory = true) {
+        if (resetHistory) {
+            this.streamContentHistory = '';
+        }
+        this.contentStats.clear();
+        this.lastContentIndex = 0;
+    }
+    resetLlmCheckTracking() {
+        this.turnsInCurrentPrompt = 0;
+        this.llmCheckInterval = DEFAULT_LLM_CHECK_INTERVAL;
+        this.lastCheckTurn = 0;
+    }
+}
+//# sourceMappingURL=loopDetectionService.js.map

package/dist/src/services/loopDetectionService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"loopDetectionService.js","sourceRoot":"","sources":["../../../src/services/loopDetectionService.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpC,OAAO,EAAE,eAAe,EAA2B,MAAM,iBAAiB,CAAC;AAC3E,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,EAAU,0BAA0B,EAAE,MAAM,qBAAqB,CAAC;AACzE,OAAO,EAAe,IAAI,EAAE,MAAM,eAAe,CAAC;AAElD,MAAM,wBAAwB,GAAG,CAAC,CAAC;AACnC,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAClC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEhC;;GAEG;AACH,MAAM,4BAA4B,GAAG,EAAE,CAAC;AAExC;;GAEG;AACH,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAEjC;;;GAGG;AACH,MAAM,0BAA0B,GAAG,CAAC,CAAC;AAErC;;;GAGG;AACH,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAEjC;;;GAGG;AACH,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAElC;;;GAGG;AACH,MAAM,OAAO,oBAAoB;IACd,MAAM,CAAS;IACxB,QAAQ,GAAG,EAAE,CAAC;IAEtB,qBAAqB;IACb,eAAe,GAAkB,IAAI,CAAC;IACtC,uBAAuB,GAAW,CAAC,CAAC;IAE5C,6BAA6B;IACrB,oBAAoB,GAAG,EAAE,CAAC;IAC1B,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,gBAAgB,GAAG,CAAC,CAAC;IACrB,YAAY,GAAG,KAAK,CAAC;IAE7B,0BAA0B;IAClB,oBAAoB,GAAG,CAAC,CAAC;IACzB,gBAAgB,GAAG,0BAA0B,CAAC;IAC9C,aAAa,GAAG,CAAC,CAAC;IAE1B,YAAY,MAAc;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAEO,cAAc,CAAC,QAAwC;QAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjD,MAAM,SAAS,GAAG,GAAG,QAAQ,CAAC,IAAI,IAAI,UAAU,EAAE,CAAC;QACnD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9D,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,KAA8B;QACxC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,eAAe,CAAC,eAAe;gBAClC,qEAAqE;gBACrE,4BAA4B;gBAC5B,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBAC5B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACxD,MAAM;YACR,KAAK,eAAe,CAAC,OAAO;gBAC1B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACvD,MAAM;YACR;gBACE,MAAM;QACV,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,WAAW,CAAC,MAAmB;QACnC,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAE5B,IACE,IAAI,CAAC,oBAAoB,IAAI,qBAAqB;YAClD,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,gBAAgB,EACvE,CAAC;YACD,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/C,OAAO,MAAM,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,iBAAiB,CAAC,QAAwC;QAChE,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,eAAe,KAAK,GAAG,EAAE,CAAC;YACjC,IAAI,CAAC,uBAAuB,EAAE,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,eAAe,GAAG,GAAG,CAAC;YAC3B,IAAI,CAAC,uBAAuB,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,IAAI,CAAC,uBAAuB,IAAI,wBAAwB,EAAE,CAAC;YAC7D,eAAe,CACb,IAAI,CAAC,MAAM,EACX,IAAI,iBAAiB,CACnB,QAAQ,CAAC,gCAAgC,EACzC,IAAI,CAAC,QAAQ,CACd,CACF,CAAC;YACF,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;OAQG;IACK,gBAAgB,CAAC,OAAe;QACtC,IAAI,CAAC,oBAAoB,IAAI,OAAO,CAAC;QAErC,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC,2BAA2B,EAAE,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACK,iBAAiB;QACvB,IAAI,IAAI,CAAC,oBAAoB,CAAC,MAAM,IAAI,kBAAkB,EAAE,CAAC;YAC3D,OAAO;QACT,CAAC;QAED,0DAA0D;QAC1D,MAAM,gBAAgB,GACpB,IAAI,CAAC,oBAAoB,CAAC,MAAM,GAAG,kBAAkB,CAAC;QACxD,IAAI,CAAC,oBAAoB;YACvB,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACpD,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAC9B,CAAC,EACD,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CACzC,CAAC;QAEF,gEAAgE;QAChE,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YAC7D,MAAM,eAAe,GAAG,UAAU;iBAC/B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,gBAAgB,CAAC;iBACxC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAEjC,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;YAC/C,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACK,2BAA2B;QACjC,OAAO,IAAI,CAAC,sBAAsB,EAAE,EAAE,CAAC;YACrC,gCAAgC;YAChC,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,SAAS,CACtD,IAAI,CAAC,gBAAgB,EACrB,IAAI,CAAC,gBAAgB,GAAG,kBAAkB,CAC3C,CAAC;YACF,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAE1E,IAAI,IAAI,CAAC,sBAAsB,CAAC,YAAY,EAAE,SAAS,CAAC,EAAE,CAAC;gBACzD,eAAe,CACb,IAAI,CAAC,MAAM,EACX,IAAI,iBAAiB,CACnB,QAAQ,CAAC,4BAA4B,EACrC,IAAI,CAAC,QAAQ,CACd,CACF,CAAC;gBACF,OAAO,IAAI,CAAC;YACd,CAAC;YAED,8CAA8C;YAC9C,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC1B,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,sBAAsB;QAC5B,OAAO,CACL,IAAI,CAAC,gBAAgB,GAAG,kBAAkB;YAC1C,IAAI,CAAC,oBAAoB,CAAC,MAAM,CACjC,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACK,sBAAsB,CAAC,KAAa,EAAE,IAAY;QACxD,MAAM,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEpD,IAAI,CAAC,eAAe,EAAE,CAAC;YACrB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;YACrD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAE5C,IAAI,eAAe,CAAC,MAAM,GAAG,sBAAsB,EAAE,CAAC;YACpD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mFAAmF;QACnF,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,sBAAsB,CAAC,CAAC;QACrE,MAAM,aAAa,GACjB,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,eAAe,GAAG,aAAa,GAAG,CAAC,sBAAsB,GAAG,CAAC,CAAC,CAAC;QACrE,MAAM,kBAAkB,GAAG,kBAAkB,GAAG,GAAG,CAAC;QAEpD,OAAO,eAAe,IAAI,kBAAkB,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACK,oBAAoB,CAC1B,YAAoB,EACpB,aAAqB;QAErB,MAAM,aAAa,GAAG,IAAI,CAAC,oBAAoB,CAAC,SAAS,CACvD,aAAa,EACb,aAAa,GAAG,kBAAkB,CACnC,CAAC;QACF,OAAO,aAAa,KAAK,YAAY,CAAC;IACxC,CAAC;IAEO,KAAK,CAAC,mBAAmB,CAAC,MAAmB;QACnD,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM;aAC9B,eAAe,EAAE;aACjB,UAAU,EAAE;aACZ,KAAK,CAAC,CAAC,4BAA4B,CAAC,CAAC;QAExC,MAAM,MAAM,GAAG;;;;;;;;;;;2IAWwH,CAAC;QACxI,MAAM,QAAQ,GAAG;YACf,GAAG,aAAa;YAChB,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE;SAC5C,CAAC;QACF,MAAM,MAAM,GAAgB;YAC1B,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,UAAU,EAAE;gBACV,SAAS,EAAE;oBACT,IAAI,EAAE,IAAI,CAAC,MAAM;oBACjB,WAAW,EACT,4EAA4E;iBAC/E;gBACD,UAAU,EAAE;oBACV,IAAI,EAAE,IAAI,CAAC,MAAM;oBACjB,WAAW,EACT,8GAA8G;iBACjH;aACF;YACD,QAAQ,EAAE,CAAC,WAAW,EAAE,YAAY,CAAC;SACtC,CAAC;QACF,IAAI,MAAM,CAAC;QACX,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM;iBACvB,eAAe,EAAE;iBACjB,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,0BAA0B,CAAC,CAAC;QACxE,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,sCAAsC;YACtC,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACjE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;YAC1C,IAAI,MAAM,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;gBAC5B,IAAI,OAAO,MAAM,CAAC,SAAS,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;oBAC7D,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBACjC,CAAC;gBACD,eAAe,CACb,IAAI,CAAC,MAAM,EACX,IAAI,iBAAiB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,IAAI,CAAC,QAAQ,CAAC,CACjE,CAAC;gBACF,OAAO,IAAI,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAChC,sBAAsB;oBACpB,CAAC,sBAAsB,GAAG,sBAAsB,CAAC;wBAC/C,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAC5B,CAAC;YACJ,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAgB;QACpB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC1B,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC5B,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;IAC5B,CAAC;IAEO,kBAAkB;QACxB,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;QAC5B,IAAI,CAAC,uBAAuB,GAAG,CAAC,CAAC;IACnC,CAAC;IAEO,oBAAoB,CAAC,YAAY,GAAG,IAAI;QAC9C,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,CAAC,oBAAoB,GAAG,EAAE,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IAEO,qBAAqB;QAC3B,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,gBAAgB,GAAG,0BAA0B,CAAC;QACnD,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;IACzB,CAAC;CACF"}

package/dist/src/services/loopDetectionService.test.d.ts

@@ -0,0 +1,6 @@
+/**
+ * @license
+ * Copyright 2025 Google LLC
+ * SPDX-License-Identifier: Apache-2.0
+ */
+export {};