@anh3d0nic/qwen-code-termux-ice 21.1.0 → 21.2.0

package/core-dist/src/services/gitService.test.js

@@ -0,0 +1,187 @@
+/**
+ * @license
+ * Copyright 2025 Google LLC
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { describe, it, expect, vi, beforeEach, afterEach, } from 'vitest';
+import { GitService } from './gitService.js';
+import { Storage } from '../config/storage.js';
+import * as path from 'node:path';
+import * as fs from 'node:fs/promises';
+import * as os from 'node:os';
+import { getProjectHash, QWEN_DIR } from '../utils/paths.js';
+import { isCommandAvailable } from '../utils/shell-utils.js';
+vi.mock('../utils/shell-utils.js', () => ({
+    isCommandAvailable: vi.fn(),
+}));
+const hoistedMockEnv = vi.hoisted(() => vi.fn());
+const hoistedMockSimpleGit = vi.hoisted(() => vi.fn());
+const hoistedMockCheckIsRepo = vi.hoisted(() => vi.fn());
+const hoistedMockInit = vi.hoisted(() => vi.fn());
+const hoistedMockRaw = vi.hoisted(() => vi.fn());
+const hoistedMockAdd = vi.hoisted(() => vi.fn());
+const hoistedMockCommit = vi.hoisted(() => vi.fn());
+vi.mock('simple-git', () => ({
+    simpleGit: hoistedMockSimpleGit.mockImplementation(() => ({
+        checkIsRepo: hoistedMockCheckIsRepo,
+        init: hoistedMockInit,
+        raw: hoistedMockRaw,
+        add: hoistedMockAdd,
+        commit: hoistedMockCommit,
+        env: hoistedMockEnv,
+    })),
+    CheckRepoActions: { IS_REPO_ROOT: 'is-repo-root' },
+}));
+const hoistedIsGitRepositoryMock = vi.hoisted(() => vi.fn());
+vi.mock('../utils/gitUtils.js', () => ({
+    isGitRepository: hoistedIsGitRepositoryMock,
+}));
+const hoistedMockHomedir = vi.hoisted(() => vi.fn());
+vi.mock('os', async (importOriginal) => {
+    const actual = await importOriginal();
+    return {
+        ...actual,
+        homedir: hoistedMockHomedir,
+    };
+});
+describe('GitService', () => {
+    let testRootDir;
+    let projectRoot;
+    let homedir;
+    let hash;
+    let storage;
+    beforeEach(async () => {
+        testRootDir = await fs.mkdtemp(path.join(os.tmpdir(), 'git-service-test-'));
+        projectRoot = path.join(testRootDir, 'project');
+        homedir = path.join(testRootDir, 'home');
+        await fs.mkdir(projectRoot, { recursive: true });
+        await fs.mkdir(homedir, { recursive: true });
+        hash = getProjectHash(projectRoot);
+        vi.clearAllMocks();
+        hoistedIsGitRepositoryMock.mockReturnValue(true);
+        isCommandAvailable.mockReturnValue({ available: true });
+        hoistedMockHomedir.mockReturnValue(homedir);
+        hoistedMockEnv.mockImplementation(() => ({
+            checkIsRepo: hoistedMockCheckIsRepo,
+            init: hoistedMockInit,
+            raw: hoistedMockRaw,
+            add: hoistedMockAdd,
+            commit: hoistedMockCommit,
+        }));
+        hoistedMockSimpleGit.mockImplementation(() => ({
+            checkIsRepo: hoistedMockCheckIsRepo,
+            init: hoistedMockInit,
+            raw: hoistedMockRaw,
+            add: hoistedMockAdd,
+            commit: hoistedMockCommit,
+            env: hoistedMockEnv,
+        }));
+        hoistedMockCheckIsRepo.mockResolvedValue(false);
+        hoistedMockInit.mockResolvedValue(undefined);
+        hoistedMockRaw.mockResolvedValue('');
+        hoistedMockAdd.mockResolvedValue(undefined);
+        hoistedMockCommit.mockResolvedValue({
+            commit: 'initial',
+        });
+        storage = new Storage(projectRoot);
+    });
+    afterEach(async () => {
+        vi.restoreAllMocks();
+        await fs.rm(testRootDir, { recursive: true, force: true });
+    });
+    describe('constructor', () => {
+        it('should successfully create an instance', () => {
+            expect(() => new GitService(projectRoot, storage)).not.toThrow();
+        });
+    });
+    describe('initialize', () => {
+        it('should throw an error if Git is not available', async () => {
+            isCommandAvailable.mockReturnValue({ available: false });
+            const service = new GitService(projectRoot, storage);
+            await expect(service.initialize()).rejects.toThrow('Checkpointing is enabled, but Git is not installed. Please install Git or disable checkpointing to continue.');
+        });
+        it('should call setupShadowGitRepository if Git is available', async () => {
+            const service = new GitService(projectRoot, storage);
+            const setupSpy = vi
+                .spyOn(service, 'setupShadowGitRepository')
+                .mockResolvedValue(undefined);
+            await service.initialize();
+            expect(setupSpy).toHaveBeenCalled();
+        });
+    });
+    describe('setupShadowGitRepository', () => {
+        let repoDir;
+        let gitConfigPath;
+        beforeEach(() => {
+            repoDir = path.join(homedir, QWEN_DIR, 'history', hash);
+            gitConfigPath = path.join(repoDir, '.gitconfig');
+        });
+        it('should create history and repository directories', async () => {
+            const service = new GitService(projectRoot, storage);
+            await service.setupShadowGitRepository();
+            const stats = await fs.stat(repoDir);
+            expect(stats.isDirectory()).toBe(true);
+        });
+        it('should create a .gitconfig file with the correct content', async () => {
+            const service = new GitService(projectRoot, storage);
+            await service.setupShadowGitRepository();
+            const expectedConfigContent = '[user]\n  name = Qwen Code\n  email = qwen-code@qwen.ai\n[commit]\n  gpgsign = false\n';
+            const actualConfigContent = await fs.readFile(gitConfigPath, 'utf-8');
+            expect(actualConfigContent).toBe(expectedConfigContent);
+        });
+        it('should initialize git repo in historyDir if not already initialized', async () => {
+            hoistedMockCheckIsRepo.mockResolvedValue(false);
+            const service = new GitService(projectRoot, storage);
+            await service.setupShadowGitRepository();
+            expect(hoistedMockSimpleGit).toHaveBeenCalledWith(repoDir);
+            expect(hoistedMockInit).toHaveBeenCalled();
+        });
+        it('should not initialize git repo if already initialized', async () => {
+            hoistedMockCheckIsRepo.mockResolvedValue(true);
+            const service = new GitService(projectRoot, storage);
+            await service.setupShadowGitRepository();
+            expect(hoistedMockInit).not.toHaveBeenCalled();
+        });
+        it('should copy .gitignore from projectRoot if it exists', async () => {
+            const gitignoreContent = 'node_modules/\n.env';
+            const visibleGitIgnorePath = path.join(projectRoot, '.gitignore');
+            await fs.writeFile(visibleGitIgnorePath, gitignoreContent);
+            const service = new GitService(projectRoot, storage);
+            await service.setupShadowGitRepository();
+            const hiddenGitIgnorePath = path.join(repoDir, '.gitignore');
+            const copiedContent = await fs.readFile(hiddenGitIgnorePath, 'utf-8');
+            expect(copiedContent).toBe(gitignoreContent);
+        });
+        it('should not create a .gitignore in shadow repo if project .gitignore does not exist', async () => {
+            const service = new GitService(projectRoot, storage);
+            await service.setupShadowGitRepository();
+            const hiddenGitIgnorePath = path.join(repoDir, '.gitignore');
+            // An empty string is written if the file doesn't exist.
+            const content = await fs.readFile(hiddenGitIgnorePath, 'utf-8');
+            expect(content).toBe('');
+        });
+        it('should throw an error if reading projectRoot .gitignore fails with other errors', async () => {
+            const visibleGitIgnorePath = path.join(projectRoot, '.gitignore');
+            // Create a directory instead of a file to cause a read error
+            await fs.mkdir(visibleGitIgnorePath);
+            const service = new GitService(projectRoot, storage);
+            // EISDIR is the expected error code on Unix-like systems
+            await expect(service.setupShadowGitRepository()).rejects.toThrow(/EISDIR: illegal operation on a directory, read|EBUSY: resource busy or locked, read/);
+        });
+        it('should make an initial commit if no commits exist in history repo', async () => {
+            hoistedMockCheckIsRepo.mockResolvedValue(false);
+            const service = new GitService(projectRoot, storage);
+            await service.setupShadowGitRepository();
+            expect(hoistedMockCommit).toHaveBeenCalledWith('Initial commit', {
+                '--allow-empty': null,
+            });
+        });
+        it('should not make an initial commit if commits already exist', async () => {
+            hoistedMockCheckIsRepo.mockResolvedValue(true);
+            const service = new GitService(projectRoot, storage);
+            await service.setupShadowGitRepository();
+            expect(hoistedMockCommit).not.toHaveBeenCalled();
+        });
+    });
+});
+//# sourceMappingURL=gitService.test.js.map

package/core-dist/src/services/gitService.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gitService.test.js","sourceRoot":"","sources":["../../../src/services/gitService.test.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,QAAQ,EACR,EAAE,EACF,MAAM,EACN,EAAE,EACF,UAAU,EACV,SAAS,GAEV,MAAM,QAAQ,CAAC;AAChB,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACvC,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7D,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAE7D,EAAE,CAAC,IAAI,CAAC,yBAAyB,EAAE,GAAG,EAAE,CAAC,CAAC;IACxC,kBAAkB,EAAE,EAAE,CAAC,EAAE,EAAE;CAC5B,CAAC,CAAC,CAAC;AAEJ,MAAM,cAAc,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACjD,MAAM,oBAAoB,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACvD,MAAM,sBAAsB,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACzD,MAAM,eAAe,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AAClD,MAAM,cAAc,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACjD,MAAM,cAAc,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACjD,MAAM,iBAAiB,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACpD,EAAE,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;IAC3B,SAAS,EAAE,oBAAoB,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC,CAAC;QACxD,WAAW,EAAE,sBAAsB;QACnC,IAAI,EAAE,eAAe;QACrB,GAAG,EAAE,cAAc;QACnB,GAAG,EAAE,cAAc;QACnB,MAAM,EAAE,iBAAiB;QACzB,GAAG,EAAE,cAAc;KACpB,CAAC,CAAC;IACH,gBAAgB,EAAE,EAAE,YAAY,EAAE,cAAc,EAAE;CACnD,CAAC,CAAC,CAAC;AAEJ,MAAM,0BAA0B,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AAC7D,EAAE,CAAC,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE,CAAC,CAAC;IACrC,eAAe,EAAE,0BAA0B;CAC5C,CAAC,CAAC,CAAC;AAEJ,MAAM,kBAAkB,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACrD,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,cAAc,EAAE,EAAE;IACrC,MAAM,MAAM,GAAG,MAAM,cAAc,EAAa,CAAC;IACjD,OAAO;QACL,GAAG,MAAM;QACT,OAAO,EAAE,kBAAkB;KAC5B,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,IAAI,WAAmB,CAAC;IACxB,IAAI,WAAmB,CAAC;IACxB,IAAI,OAAe,CAAC;IACpB,IAAI,IAAY,CAAC;IACjB,IAAI,OAAgB,CAAC;IAErB,UAAU,CAAC,KAAK,IAAI,EAAE;QACpB,WAAW,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,mBAAmB,CAAC,CAAC,CAAC;QAC5E,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;QAChD,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QACzC,MAAM,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACjD,MAAM,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAE7C,IAAI,GAAG,cAAc,CAAC,WAAW,CAAC,CAAC;QAEnC,EAAE,CAAC,aAAa,EAAE,CAAC;QACnB,0BAA0B,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAChD,kBAA2B,CAAC,eAAe,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAElE,kBAAkB,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAE5C,cAAc,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC,CAAC;YACvC,WAAW,EAAE,sBAAsB;YACnC,IAAI,EAAE,eAAe;YACrB,GAAG,EAAE,cAAc;YACnB,GAAG,EAAE,cAAc;YACnB,MAAM,EAAE,iBAAiB;SAC1B,CAAC,CAAC,CAAC;QACJ,oBAAoB,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC,CAAC;YAC7C,WAAW,EAAE,sBAAsB;YACnC,IAAI,EAAE,eAAe;YACrB,GAAG,EAAE,cAAc;YACnB,GAAG,EAAE,cAAc;YACnB,MAAM,EAAE,iBAAiB;YACzB,GAAG,EAAE,cAAc;SACpB,CAAC,CAAC,CAAC;QACJ,sBAAsB,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChD,eAAe,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAC7C,cAAc,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;QACrC,cAAc,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAC5C,iBAAiB,CAAC,iBAAiB,CAAC;YAClC,MAAM,EAAE,SAAS;SAClB,CAAC,CAAC;QACH,OAAO,GAAG,IAAI,OAAO,CAAC,WAAW,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,SAAS,CAAC,KAAK,IAAI,EAAE;QACnB,EAAE,CAAC,eAAe,EAAE,CAAC;QACrB,MAAM,EAAE,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAChD,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;QACnE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC1B,EAAE,CAAC,+CAA+C,EAAE,KAAK,IAAI,EAAE;YAC5D,kBAA2B,CAAC,eAAe,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;YACnE,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAChD,8GAA8G,CAC/G,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;YACxE,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,EAAE;iBAChB,KAAK,CAAC,OAAO,EAAE,0BAA0B,CAAC;iBAC1C,iBAAiB,CAAC,SAAS,CAAC,CAAC;YAEhC,MAAM,OAAO,CAAC,UAAU,EAAE,CAAC;YAC3B,MAAM,CAAC,QAAQ,CAAC,CAAC,gBAAgB,EAAE,CAAC;QACtC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACxC,IAAI,OAAe,CAAC;QACpB,IAAI,aAAqB,CAAC;QAE1B,UAAU,CAAC,GAAG,EAAE;YACd,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;YACxD,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kDAAkD,EAAE,KAAK,IAAI,EAAE;YAChE,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,OAAO,CAAC,wBAAwB,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrC,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;YACxE,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,OAAO,CAAC,wBAAwB,EAAE,CAAC;YAEzC,MAAM,qBAAqB,GACzB,wFAAwF,CAAC;YAC3F,MAAM,mBAAmB,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;YACtE,MAAM,CAAC,mBAAmB,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qEAAqE,EAAE,KAAK,IAAI,EAAE;YACnF,sBAAsB,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAChD,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,OAAO,CAAC,wBAAwB,EAAE,CAAC;YACzC,MAAM,CAAC,oBAAoB,CAAC,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;YAC3D,MAAM,CAAC,eAAe,CAAC,CAAC,gBAAgB,EAAE,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;YACrE,sBAAsB,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,OAAO,CAAC,wBAAwB,EAAE,CAAC;YACzC,MAAM,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sDAAsD,EAAE,KAAK,IAAI,EAAE;YACpE,MAAM,gBAAgB,GAAG,qBAAqB,CAAC;YAC/C,MAAM,oBAAoB,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAClE,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,EAAE,gBAAgB,CAAC,CAAC;YAE3D,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,OAAO,CAAC,wBAAwB,EAAE,CAAC;YAEzC,MAAM,mBAAmB,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAC7D,MAAM,aAAa,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC,CAAC;YACtE,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oFAAoF,EAAE,KAAK,IAAI,EAAE;YAClG,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,OAAO,CAAC,wBAAwB,EAAE,CAAC;YAEzC,MAAM,mBAAmB,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAC7D,wDAAwD;YACxD,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC,CAAC;YAChE,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iFAAiF,EAAE,KAAK,IAAI,EAAE;YAC/F,MAAM,oBAAoB,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAClE,6DAA6D;YAC7D,MAAM,EAAE,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;YAErC,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,yDAAyD;YACzD,MAAM,MAAM,CAAC,OAAO,CAAC,wBAAwB,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAC9D,qFAAqF,CACtF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mEAAmE,EAAE,KAAK,IAAI,EAAE;YACjF,sBAAsB,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAChD,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,OAAO,CAAC,wBAAwB,EAAE,CAAC;YACzC,MAAM,CAAC,iBAAiB,CAAC,CAAC,oBAAoB,CAAC,gBAAgB,EAAE;gBAC/D,eAAe,EAAE,IAAI;aACtB,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4DAA4D,EAAE,KAAK,IAAI,EAAE;YAC1E,sBAAsB,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,OAAO,CAAC,wBAAwB,EAAE,CAAC;YACzC,MAAM,CAAC,iBAAiB,CAAC,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC;QACnD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

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

@@ -0,0 +1,86 @@
+/**
+ * @license
+ * Copyright 2025 Google LLC
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import type { ServerGeminiStreamEvent } from '../core/turn.js';
+import type { 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 inCodeBlock;
+    private disabledForSession;
+    constructor(config: Config);
+    /**
+     * Disables loop detection for the current session.
+     */
+    disableForSession(): void;
+    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;
+    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
+     * 5. Disabling loop detection within code blocks to prevent false positives,
+     *    as repetitive code structures are common and not necessarily loops.
+     */
+    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;
+    /**
+     * Resets all loop detection state.
+     */
+    reset(promptId: string): void;
+    private resetToolCallCount;
+    private resetContentTracking;
+}

package/core-dist/src/services/loopDetectionService.js

@@ -0,0 +1,239 @@
+/**
+ * @license
+ * Copyright 2025 Google LLC
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { createHash } from 'node:crypto';
+import { GeminiEventType } from '../core/turn.js';
+import { logLoopDetected, logLoopDetectionDisabled, } from '../telemetry/loggers.js';
+import { LoopDetectedEvent, LoopDetectionDisabledEvent, LoopType, } from '../telemetry/types.js';
+const TOOL_CALL_LOOP_THRESHOLD = 5;
+const CONTENT_LOOP_THRESHOLD = 10;
+const CONTENT_CHUNK_SIZE = 50;
+const MAX_HISTORY_LENGTH = 1000;
+/**
+ * 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;
+    inCodeBlock = false;
+    // Session-level disable flag
+    disabledForSession = false;
+    constructor(config) {
+        this.config = config;
+    }
+    /**
+     * Disables loop detection for the current session.
+     */
+    disableForSession() {
+        this.disabledForSession = true;
+        logLoopDetectionDisabled(this.config, new LoopDetectionDisabledEvent(this.promptId));
+    }
+    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 || this.disabledForSession) {
+            return this.loopDetected;
+        }
+        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;
+    }
+    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
+     * 5. Disabling loop detection within code blocks to prevent false positives,
+     *    as repetitive code structures are common and not necessarily loops.
+     */
+    checkContentLoop(content) {
+        // Different content elements can often contain repetitive syntax that is not indicative of a loop.
+        // To avoid false positives, we detect when we encounter different content types and
+        // reset tracking to avoid analyzing content that spans across different element boundaries.
+        const numFences = (content.match(/```/g) ?? []).length;
+        const hasTable = /(^|\n)\s*(\|.*\||[|+-]{3,})/.test(content);
+        const hasListItem = /(^|\n)\s*[*-+]\s/.test(content) || /(^|\n)\s*\d+\.\s/.test(content);
+        const hasHeading = /(^|\n)#+\s/.test(content);
+        const hasBlockquote = /(^|\n)>\s/.test(content);
+        const isDivider = /^[+-_=*\u2500-\u257F]+$/.test(content);
+        if (numFences ||
+            hasTable ||
+            hasListItem ||
+            hasHeading ||
+            hasBlockquote ||
+            isDivider) {
+            // Reset tracking when different content elements are detected to avoid analyzing content
+            // that spans across different element boundaries.
+            this.resetContentTracking();
+        }
+        const wasInCodeBlock = this.inCodeBlock;
+        this.inCodeBlock =
+            numFences % 2 === 0 ? this.inCodeBlock : !this.inCodeBlock;
+        if (wasInCodeBlock || this.inCodeBlock || isDivider) {
+            return false;
+        }
+        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;
+    }
+    /**
+     * Resets all loop detection state.
+     */
+    reset(promptId) {
+        this.promptId = promptId;
+        this.resetToolCallCount();
+        this.resetContentTracking();
+        this.loopDetected = false;
+    }
+    resetToolCallCount() {
+        this.lastToolCallKey = null;
+        this.toolCallRepetitionCount = 0;
+    }
+    resetContentTracking(resetHistory = true) {
+        if (resetHistory) {
+            this.streamContentHistory = '';
+        }
+        this.contentStats.clear();
+        this.lastContentIndex = 0;
+    }
+}
+//# sourceMappingURL=loopDetectionService.js.map

package/core-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,aAAa,CAAC;AAEzC,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EACL,eAAe,EACf,wBAAwB,GACzB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,iBAAiB,EACjB,0BAA0B,EAC1B,QAAQ,GACT,MAAM,uBAAuB,CAAC;AAG/B,MAAM,wBAAwB,GAAG,CAAC,CAAC;AACnC,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAClC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEhC;;;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;IACrB,WAAW,GAAG,KAAK,CAAC;IAE5B,6BAA6B;IACrB,kBAAkB,GAAG,KAAK,CAAC;IAEnC,YAAY,MAAc;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,iBAAiB;QACf,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC;QAC/B,wBAAwB,CACtB,IAAI,CAAC,MAAM,EACX,IAAI,0BAA0B,CAAC,IAAI,CAAC,QAAQ,CAAC,CAC9C,CAAC;IACJ,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,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC,YAAY,CAAC;QAC3B,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;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;;;;;;;;;;OAUG;IACK,gBAAgB,CAAC,OAAe;QACtC,mGAAmG;QACnG,oFAAoF;QACpF,4FAA4F;QAC5F,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QACvD,MAAM,QAAQ,GAAG,6BAA6B,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7D,MAAM,WAAW,GACf,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9C,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChD,MAAM,SAAS,GAAG,yBAAyB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAE1D,IACE,SAAS;YACT,QAAQ;YACR,WAAW;YACX,UAAU;YACV,aAAa;YACb,SAAS,EACT,CAAC;YACD,yFAAyF;YACzF,kDAAkD;YAClD,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC9B,CAAC;QAED,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC;QACxC,IAAI,CAAC,WAAW;YACd,SAAS,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;QAC7D,IAAI,cAAc,IAAI,IAAI,CAAC,WAAW,IAAI,SAAS,EAAE,CAAC;YACpD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,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;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,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;CACF"}

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

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