@mhalder/qdrant-mcp-server 1.1.1 → 1.3.0

package/CHANGELOG.md

@@ -1,3 +1,21 @@
+## 1.3.0 (2025-10-11)
+
+* Merge pull request #25 from mhalder/feature/http-transport ([efc90c3](https://github.com/mhalder/qdrant-mcp-server/commit/efc90c3)), closes [#25](https://github.com/mhalder/qdrant-mcp-server/issues/25)
+* fix: address PR feedback for HTTP transport implementation ([1aec6d5](https://github.com/mhalder/qdrant-mcp-server/commit/1aec6d5))
+* fix: address PR feedback for HTTP transport implementation ([3243d0e](https://github.com/mhalder/qdrant-mcp-server/commit/3243d0e))
+* fix: clear cleanup interval on shutdown and improve error messages ([6aa29f3](https://github.com/mhalder/qdrant-mcp-server/commit/6aa29f3))
+* fix: implement per-IP rate limiting and consolidate port validation ([c3bfc92](https://github.com/mhalder/qdrant-mcp-server/commit/c3bfc92))
+* fix: prevent transport double closure and add rate limiter memory management ([2f92d78](https://github.com/mhalder/qdrant-mcp-server/commit/2f92d78))
+* fix: resolve critical issues in HTTP transport implementation ([7951f2b](https://github.com/mhalder/qdrant-mcp-server/commit/7951f2b))
+* fix: resolve race condition and resource leak in HTTP timeout handler ([6635ccb](https://github.com/mhalder/qdrant-mcp-server/commit/6635ccb))
+* docs: add Try It and Cleanup sections to hybrid-search example ([5e32f16](https://github.com/mhalder/qdrant-mcp-server/commit/5e32f16))
+* feat: add HTTP transport support for remote MCP server deployment ([983a9d6](https://github.com/mhalder/qdrant-mcp-server/commit/983a9d6)), closes [#24](https://github.com/mhalder/qdrant-mcp-server/issues/24)
+
+## 1.2.0 (2025-10-11)
+
+* Merge pull request #23 from mhalder/feature/hybrid-search ([5925df7](https://github.com/mhalder/qdrant-mcp-server/commit/5925df7)), closes [#23](https://github.com/mhalder/qdrant-mcp-server/issues/23)
+* feat: enable semantic search on hybrid collections ([c99e177](https://github.com/mhalder/qdrant-mcp-server/commit/c99e177))
+
 ## <small>1.1.1 (2025-10-11)</small>
 
 * Merge pull request #22 from mhalder/docs/clean-and-condense ([991cb9d](https://github.com/mhalder/qdrant-mcp-server/commit/991cb9d)), closes [#22](https://github.com/mhalder/qdrant-mcp-server/issues/22)

package/README.md

@@ -10,9 +10,11 @@ A Model Context Protocol (MCP) server providing semantic search capabilities usi
 - **Zero Setup**: Works out of the box with Ollama - no API keys required
 - **Privacy-First**: Local embeddings and vector storage - data never leaves your machine
 - **Multiple Providers**: Ollama (default), OpenAI, Cohere, and Voyage AI
+- **Hybrid Search**: Combine semantic and keyword search for better results
 - **Semantic Search**: Natural language search with metadata filtering
 - **Rate Limiting**: Intelligent throttling with exponential backoff
 - **Full CRUD**: Create, search, and manage collections and documents
+- **Flexible Deployment**: Run locally (stdio) or as a remote HTTP server
 
 ## Quick Start
 
@@ -39,6 +41,8 @@ npm run build
 
 ### Configuration
 
+#### Local Setup (stdio transport)
+
 Add to `~/.claude/claude_code_config.json`:
 
 ```json
@@ -56,6 +60,35 @@ Add to `~/.claude/claude_code_config.json`:
 }
 ```
 
+#### Remote Setup (HTTP transport)
+
+> **⚠️ Security Warning**: When deploying the HTTP transport in production:
+>
+> - **Always** run behind a reverse proxy (nginx, Caddy) with HTTPS
+> - Implement authentication/authorization at the proxy level
+> - Use firewalls to restrict access to trusted networks
+> - Never expose directly to the public internet without protection
+> - Consider implementing rate limiting at the proxy level
+> - Monitor server logs for suspicious activity
+
+**Start the server:**
+
+```bash
+TRANSPORT_MODE=http HTTP_PORT=3000 node build/index.js
+```
+
+**Configure client:**
+
+```json
+{
+  "mcpServers": {
+    "qdrant": {
+      "url": "http://your-server:3000/mcp"
+    }
+  }
+}
+```
+
 **Using a different provider:**
 
 ```json
@@ -87,6 +120,7 @@ See [Advanced Configuration](#advanced-configuration) section below for all opti
 | ------------------ | ----------------------------------------------------------------------------- |
 | `add_documents`    | Add documents with automatic embedding (supports string/number IDs, metadata) |
 | `semantic_search`  | Natural language search with optional metadata filtering                      |
+| `hybrid_search`    | Hybrid search combining semantic and keyword (BM25) search with RRF           |
 | `delete_documents` | Delete specific documents by ID                                               |
 
 ### Resources
@@ -109,6 +143,8 @@ See [examples/](examples/) directory for detailed guides:
 
 | Variable                            | Description                            | Default               |
 | ----------------------------------- | -------------------------------------- | --------------------- |
+| `TRANSPORT_MODE`                    | "stdio" or "http"                      | stdio                 |
+| `HTTP_PORT`                         | Port for HTTP transport                | 3000                  |
 | `EMBEDDING_PROVIDER`                | "ollama", "openai", "cohere", "voyage" | ollama                |
 | `QDRANT_URL`                        | Qdrant server URL                      | http://localhost:6333 |
 | `EMBEDDING_MODEL`                   | Model name                             | Provider-specific     |

package/biome.json

@@ -0,0 +1,34 @@
+{
+  "$schema": "https://biomejs.dev/schemas/2.2.5/schema.json",
+  "vcs": {
+    "enabled": true,
+    "clientKind": "git",
+    "useIgnoreFile": true,
+    "defaultBranch": "main"
+  },
+  "files": {
+    "ignoreUnknown": false
+  },
+  "formatter": {
+    "enabled": true,
+    "formatWithErrors": true,
+    "indentStyle": "space",
+    "indentWidth": 2,
+    "lineWidth": 100
+  },
+  "linter": {
+    "enabled": true,
+    "rules": {
+      "recommended": true
+    }
+  },
+  "javascript": {
+    "formatter": {
+      "quoteStyle": "double",
+      "jsxQuoteStyle": "double",
+      "trailingCommas": "es5",
+      "semicolons": "always",
+      "arrowParentheses": "always"
+    }
+  }
+}

package/build/embeddings/sparse.d.ts

@@ -0,0 +1,40 @@
+/**
+ * BM25 Sparse Vector Generator
+ *
+ * This module provides a simple BM25-like sparse vector generation for keyword search.
+ * For production use, consider using a proper BM25 implementation or Qdrant's built-in
+ * sparse vector generation via FastEmbed.
+ */
+import type { SparseVector } from "../qdrant/client.js";
+export declare class BM25SparseVectorGenerator {
+    private vocabulary;
+    private idfScores;
+    private documentCount;
+    private k1;
+    private b;
+    constructor(k1?: number, b?: number);
+    /**
+     * Tokenize text into words (simple whitespace tokenization + lowercase)
+     */
+    private tokenize;
+    /**
+     * Calculate term frequency for a document
+     */
+    private getTermFrequency;
+    /**
+     * Build vocabulary from training documents (optional pre-training step)
+     * In a simple implementation, we can skip this and use on-the-fly vocabulary
+     */
+    train(documents: string[]): void;
+    /**
+     * Generate sparse vector for a query or document
+     * Returns indices and values for non-zero dimensions
+     */
+    generate(text: string, avgDocLength?: number): SparseVector;
+    /**
+     * Simple static method for generating sparse vectors without training
+     * Useful for quick implementation
+     */
+    static generateSimple(text: string): SparseVector;
+}
+//# sourceMappingURL=sparse.d.ts.map

package/build/embeddings/sparse.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sparse.d.ts","sourceRoot":"","sources":["../../src/embeddings/sparse.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAMxD,qBAAa,yBAAyB;IACpC,OAAO,CAAC,UAAU,CAAsB;IACxC,OAAO,CAAC,SAAS,CAAsB;IACvC,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,CAAC,CAAS;gBAEN,EAAE,GAAE,MAAY,EAAE,CAAC,GAAE,MAAa;IAQ9C;;OAEG;IACH,OAAO,CAAC,QAAQ;IAQhB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAQxB;;;OAGG;IACH,KAAK,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI;IAwBhC;;;OAGG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,YAAY,GAAE,MAAW,GAAG,YAAY;IAmC/D;;;OAGG;IACH,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY;CAIlD"}

package/build/embeddings/sparse.js

@@ -0,0 +1,105 @@
+/**
+ * BM25 Sparse Vector Generator
+ *
+ * This module provides a simple BM25-like sparse vector generation for keyword search.
+ * For production use, consider using a proper BM25 implementation or Qdrant's built-in
+ * sparse vector generation via FastEmbed.
+ */
+export class BM25SparseVectorGenerator {
+    vocabulary;
+    idfScores;
+    documentCount;
+    k1;
+    b;
+    constructor(k1 = 1.2, b = 0.75) {
+        this.vocabulary = new Map();
+        this.idfScores = new Map();
+        this.documentCount = 0;
+        this.k1 = k1;
+        this.b = b;
+    }
+    /**
+     * Tokenize text into words (simple whitespace tokenization + lowercase)
+     */
+    tokenize(text) {
+        return text
+            .toLowerCase()
+            .replace(/[^\w\s]/g, " ")
+            .split(/\s+/)
+            .filter((token) => token.length > 0);
+    }
+    /**
+     * Calculate term frequency for a document
+     */
+    getTermFrequency(tokens) {
+        const tf = {};
+        for (const token of tokens) {
+            tf[token] = (tf[token] || 0) + 1;
+        }
+        return tf;
+    }
+    /**
+     * Build vocabulary from training documents (optional pre-training step)
+     * In a simple implementation, we can skip this and use on-the-fly vocabulary
+     */
+    train(documents) {
+        this.documentCount = documents.length;
+        const documentFrequency = new Map();
+        // Calculate document frequency for each term
+        for (const doc of documents) {
+            const tokens = this.tokenize(doc);
+            const uniqueTokens = new Set(tokens);
+            for (const token of uniqueTokens) {
+                if (!this.vocabulary.has(token)) {
+                    this.vocabulary.set(token, this.vocabulary.size);
+                }
+                documentFrequency.set(token, (documentFrequency.get(token) || 0) + 1);
+            }
+        }
+        // Calculate IDF scores
+        for (const [token, df] of documentFrequency.entries()) {
+            const idf = Math.log((this.documentCount - df + 0.5) / (df + 0.5) + 1.0);
+            this.idfScores.set(token, idf);
+        }
+    }
+    /**
+     * Generate sparse vector for a query or document
+     * Returns indices and values for non-zero dimensions
+     */
+    generate(text, avgDocLength = 50) {
+        const tokens = this.tokenize(text);
+        const tf = this.getTermFrequency(tokens);
+        const docLength = tokens.length;
+        const indices = [];
+        const values = [];
+        // Calculate BM25 score for each term
+        for (const [token, freq] of Object.entries(tf)) {
+            // Ensure token is in vocabulary
+            if (!this.vocabulary.has(token)) {
+                // For unseen tokens, add them to vocabulary dynamically
+                this.vocabulary.set(token, this.vocabulary.size);
+            }
+            const index = this.vocabulary.get(token);
+            // Use a default IDF if not trained
+            const idf = this.idfScores.get(token) || 1.0;
+            // BM25 formula
+            const numerator = freq * (this.k1 + 1);
+            const denominator = freq + this.k1 * (1 - this.b + this.b * (docLength / avgDocLength));
+            const score = idf * (numerator / denominator);
+            if (score > 0) {
+                indices.push(index);
+                values.push(score);
+            }
+        }
+        return { indices, values };
+    }
+    /**
+     * Simple static method for generating sparse vectors without training
+     * Useful for quick implementation
+     */
+    static generateSimple(text) {
+        const generator = new BM25SparseVectorGenerator();
+        return generator.generate(text);
+    }
+}
+//# sourceMappingURL=sparse.js.map

package/build/embeddings/sparse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sparse.js","sourceRoot":"","sources":["../../src/embeddings/sparse.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAQH,MAAM,OAAO,yBAAyB;IAC5B,UAAU,CAAsB;IAChC,SAAS,CAAsB;IAC/B,aAAa,CAAS;IACtB,EAAE,CAAS;IACX,CAAC,CAAS;IAElB,YAAY,KAAa,GAAG,EAAE,IAAY,IAAI;QAC5C,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,IAAY;QAC3B,OAAO,IAAI;aACR,WAAW,EAAE;aACb,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;aACxB,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,MAAgB;QACvC,MAAM,EAAE,GAAmB,EAAE,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,SAAmB;QACvB,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC;QACtC,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEpD,6CAA6C;QAC7C,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAClC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;YAErC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAChC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACnD,CAAC;gBACD,iBAAiB,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,iBAAiB,CAAC,OAAO,EAAE,EAAE,CAAC;YACtD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,aAAa,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YACzE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,IAAY,EAAE,eAAuB,EAAE;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACzC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;QAEhC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,qCAAqC;QACrC,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/C,gCAAgC;YAChC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChC,wDAAwD;gBACxD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;YAED,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;YAE1C,mCAAmC;YACnC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC;YAE7C,eAAe;YACf,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACvC,MAAM,WAAW,GAAG,IAAI,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC;YACxF,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC;YAE9C,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,cAAc,CAAC,IAAY;QAChC,MAAM,SAAS,GAAG,IAAI,yBAAyB,EAAE,CAAC;QAClD,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACF"}

package/build/embeddings/sparse.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=sparse.test.d.ts.map

package/build/embeddings/sparse.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sparse.test.d.ts","sourceRoot":"","sources":["../../src/embeddings/sparse.test.ts"],"names":[],"mappings":""}

package/build/embeddings/sparse.test.js

@@ -0,0 +1,69 @@
+import { describe, expect, it } from "vitest";
+import { BM25SparseVectorGenerator } from "./sparse.js";
+describe("BM25SparseVectorGenerator", () => {
+    it("should generate sparse vectors for simple text", () => {
+        const generator = new BM25SparseVectorGenerator();
+        const result = generator.generate("hello world");
+        expect(result.indices).toBeDefined();
+        expect(result.values).toBeDefined();
+        expect(result.indices.length).toBeGreaterThan(0);
+        expect(result.values.length).toBe(result.indices.length);
+    });
+    it("should generate different vectors for different texts", () => {
+        const generator = new BM25SparseVectorGenerator();
+        const result1 = generator.generate("hello world");
+        const result2 = generator.generate("goodbye world");
+        // Different texts should have different sparse representations
+        expect(result1.indices).not.toEqual(result2.indices);
+    });
+    it("should generate consistent vectors for the same text", () => {
+        const generator = new BM25SparseVectorGenerator();
+        const result1 = generator.generate("hello world");
+        const result2 = generator.generate("hello world");
+        expect(result1.indices).toEqual(result2.indices);
+        expect(result1.values).toEqual(result2.values);
+    });
+    it("should handle empty strings", () => {
+        const generator = new BM25SparseVectorGenerator();
+        const result = generator.generate("");
+        expect(result.indices).toHaveLength(0);
+        expect(result.values).toHaveLength(0);
+    });
+    it("should handle special characters and punctuation", () => {
+        const generator = new BM25SparseVectorGenerator();
+        const result = generator.generate("hello, world! how are you?");
+        expect(result.indices).toBeDefined();
+        expect(result.values).toBeDefined();
+        expect(result.indices.length).toBeGreaterThan(0);
+    });
+    it("should train on corpus and generate IDF scores", () => {
+        const generator = new BM25SparseVectorGenerator();
+        const corpus = ["the quick brown fox", "jumps over the lazy dog", "the fox is quick"];
+        generator.train(corpus);
+        const result = generator.generate("quick fox");
+        expect(result.indices).toBeDefined();
+        expect(result.values).toBeDefined();
+        expect(result.indices.length).toBeGreaterThan(0);
+    });
+    it("should use static generateSimple method", () => {
+        const result = BM25SparseVectorGenerator.generateSimple("hello world");
+        expect(result.indices).toBeDefined();
+        expect(result.values).toBeDefined();
+        expect(result.indices.length).toBeGreaterThan(0);
+    });
+    it("should lowercase and tokenize text properly", () => {
+        const generator = new BM25SparseVectorGenerator();
+        const result1 = generator.generate("HELLO WORLD");
+        const result2 = generator.generate("hello world");
+        // Should produce same results due to lowercasing
+        expect(result1.indices).toEqual(result2.indices);
+    });
+    it("should generate positive values", () => {
+        const generator = new BM25SparseVectorGenerator();
+        const result = generator.generate("hello world");
+        result.values.forEach((value) => {
+            expect(value).toBeGreaterThan(0);
+        });
+    });
+});
+//# sourceMappingURL=sparse.test.js.map

package/build/embeddings/sparse.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sparse.test.js","sourceRoot":"","sources":["../../src/embeddings/sparse.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,yBAAyB,EAAE,MAAM,aAAa,CAAC;AAExD,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,SAAS,GAAG,IAAI,yBAAyB,EAAE,CAAC;QAClD,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAEjD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,SAAS,GAAG,IAAI,yBAAyB,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;QAEpD,+DAA+D;QAC/D,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,SAAS,GAAG,IAAI,yBAAyB,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAElD,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,SAAS,GAAG,IAAI,yBAAyB,EAAE,CAAC;QAClD,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAEtC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,SAAS,GAAG,IAAI,yBAAyB,EAAE,CAAC;QAClD,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,4BAA4B,CAAC,CAAC;QAEhE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,SAAS,GAAG,IAAI,yBAAyB,EAAE,CAAC;QAClD,MAAM,MAAM,GAAG,CAAC,qBAAqB,EAAE,yBAAyB,EAAE,kBAAkB,CAAC,CAAC;QAEtF,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QAE/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,MAAM,GAAG,yBAAyB,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;QAEvE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,SAAS,GAAG,IAAI,yBAAyB,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAElD,iDAAiD;QACjD,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,SAAS,GAAG,IAAI,yBAAyB,EAAE,CAAC;QAClD,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAEjD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YAC9B,MAAM,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}