@gotza02/mathinking 1.0.0

package/README.md

@@ -0,0 +1,366 @@
+# 🚀 Intelligent Agent MCP Server
+
+A powerful Model Context Protocol (MCP) server featuring two core capabilities:
+- **🧠 The Brain** (`sequential_thinking`) - Deep reasoning and planning
+- **🤖 The Body** (`orchestrator`) - Parallel task execution
+
+## 📋 Overview
+
+This MCP server enables AI agents to:
+1. Think through complex problems step-by-step with branching and revision
+2. Execute multi-step task plans with parallel processing and dependency management
+
+```
+┌─────────────────────────────────────────────────────────────────┐
+│                    Intelligent Agent Flow                        │
+├─────────────────────────────────────────────────────────────────┤
+│                                                                   │
+│   User Query → [sequential_thinking] → Plan → [orchestrator]    │
+│                      (Analysis)              (Execution)          │
+│                          ↓                        ↓               │
+│                   Thought Steps            Parallel Tasks         │
+│                   Branching/Revision       DAG Resolution         │
+│                   Hypothesis Testing       Result Aggregation     │
+│                          ↓                        ↓               │
+│                    Final Plan              Final Results          │
+│                                                                   │
+└─────────────────────────────────────────────────────────────────┘
+```
+
+## 🛠️ Installation
+
+```bash
+# Clone or create the project
+cd intelligent-agent-mcp
+
+# Install dependencies
+npm install
+
+# Build TypeScript
+npm run build
+
+# Run the server
+npm start
+```
+
+## ⚙️ Configuration
+
+Add to your MCP client configuration (e.g., Claude Desktop):
+
+```json
+{
+  "mcpServers": {
+    "intelligent-agent": {
+      "command": "node",
+      "args": ["/path/to/intelligent-agent-mcp/dist/index.js"]
+    }
+  }
+}
+```
+
+---
+
+## 🧠 Tool 1: Sequential Thinking (The Brain)
+
+A sophisticated reasoning system for complex problem-solving.
+
+### Features
+
+| Feature | Description |
+|---------|-------------|
+| **Iterative Thinking** | Step-by-step reasoning with adjustable depth |
+| **Dynamic Adjustment** | Modify thinking steps on-the-fly |
+| **Branching** | Explore alternative solution paths |
+| **Revision** | Correct previous thoughts when errors found |
+| **Hypothesis Testing** | Formulate and verify theories |
+| **Confidence Tracking** | Monitor certainty levels |
+
+### Actions
+
+| Action | Description | Required Params |
+|--------|-------------|-----------------|
+| `start_session` | Begin new thinking session | `problemStatement` |
+| `add_thought` | Add a reasoning step | `sessionId`, `thought` |
+| `create_branch` | Explore alternative | `sessionId`, `branchFromThoughtId` |
+| `revise_thought` | Correct previous thought | `sessionId`, `reviseThoughtId`, `thought` |
+| `set_hypothesis` | Propose testable theory | `sessionId`, `hypothesis` |
+| `verify_hypothesis` | Confirm/refute theory | `sessionId`, `verificationStatus` |
+| `adjust_total_thoughts` | Change thinking depth | `sessionId`, `totalThoughts` |
+| `conclude` | Synthesize final answer | `sessionId`, `thought` |
+| `get_status` | Check session progress | `sessionId` |
+| `get_history` | Review all thoughts | `sessionId` |
+
+### Example Usage
+
+```typescript
+// 1. Start a thinking session
+{
+  "action": "start_session",
+  "problemStatement": "Design a scalable microservices architecture for an e-commerce platform",
+  "totalThoughts": 6
+}
+
+// 2. Add initial analysis
+{
+  "action": "add_thought",
+  "sessionId": "abc-123",
+  "thought": "The core domains are: User Management, Product Catalog, Order Processing, Payment, and Inventory",
+  "thoughtType": "initial_analysis",
+  "confidence": 85
+}
+
+// 3. Set a hypothesis
+{
+  "action": "set_hypothesis",
+  "sessionId": "abc-123",
+  "hypothesis": "Event-driven architecture with Kafka will handle peak loads better than synchronous REST"
+}
+
+// 4. Create a branch to explore alternatives
+{
+  "action": "create_branch",
+  "sessionId": "abc-123",
+  "branchFromThoughtId": "thought-456",
+  "branchLabel": "Option B: GraphQL Federation",
+  "thought": "Alternative approach using GraphQL for unified API layer"
+}
+
+// 5. Verify the hypothesis
+{
+  "action": "verify_hypothesis",
+  "sessionId": "abc-123",
+  "verificationStatus": "verified",
+  "verificationEvidence": "Benchmark shows 3x throughput improvement under load"
+}
+
+// 6. Conclude
+{
+  "action": "conclude",
+  "sessionId": "abc-123",
+  "thought": "Recommended architecture: Event-driven microservices with Kafka, using CQRS pattern for read-heavy services",
+  "confidence": 90
+}
+```
+
+---
+
+## 🤖 Tool 2: Orchestrator (The Body)
+
+A DAG-based execution engine for parallel task processing.
+
+### Features
+
+| Feature | Description |
+|---------|-------------|
+| **DAG Execution** | Topological sorting for dependency resolution |
+| **Parallel Processing** | Independent tasks run concurrently |
+| **Tool Chaining** | Reference outputs from previous tasks |
+| **Error Handling** | Graceful degradation with retries |
+| **Result Aggregation** | Combine all task outputs |
+
+### Built-in Tools
+
+| Tool | Description | Input |
+|------|-------------|-------|
+| `echo` | Returns input as-is | `{ any: "value" }` |
+| `delay` | Waits specified ms | `{ milliseconds: 1000 }` |
+| `transform` | Text/number transforms | `{ data: "text", operation: "uppercase" }` |
+| `aggregate` | Combine values | `{ values: [...], operation: "sum" }` |
+| `fetch` | HTTP request (simulated) | `{ url: "https://..." }` |
+| `compute` | Math expressions | `{ expression: "a + b", variables: { a: 1, b: 2 } }` |
+
+### Transform Operations
+- `uppercase` / `lowercase` / `reverse` / `length` / `double`
+
+### Aggregate Operations
+- `sum` / `concat` / `array` / `count`
+
+### Actions
+
+| Action | Description | Required Params |
+|--------|-------------|-----------------|
+| `validate_plan` | Check plan validity | `plan` |
+| `execute_plan` | Run the full plan | `plan` |
+| `get_execution_status` | Check previous results | `planId` |
+
+### Example: Parallel Data Processing
+
+```typescript
+{
+  "action": "execute_plan",
+  "plan": {
+    "planId": "data-pipeline-001",
+    "name": "Parallel Data Pipeline",
+    "tasks": [
+      {
+        "id": "fetch_users",
+        "name": "Fetch Users",
+        "toolName": "fetch",
+        "toolInput": { "url": "https://api.example.com/users" },
+        "dependencies": []
+      },
+      {
+        "id": "fetch_orders",
+        "name": "Fetch Orders",
+        "toolName": "fetch",
+        "toolInput": { "url": "https://api.example.com/orders" },
+        "dependencies": []
+      },
+      {
+        "id": "fetch_products",
+        "name": "Fetch Products",
+        "toolName": "fetch",
+        "toolInput": { "url": "https://api.example.com/products" },
+        "dependencies": []
+      },
+      {
+        "id": "transform_users",
+        "name": "Process Users",
+        "toolName": "transform",
+        "toolInput": { 
+          "data": "${fetch_users.body}", 
+          "operation": "uppercase" 
+        },
+        "dependencies": ["fetch_users"]
+      },
+      {
+        "id": "aggregate_all",
+        "name": "Combine Results",
+        "toolName": "aggregate",
+        "toolInput": { 
+          "values": [
+            "${fetch_users}",
+            "${fetch_orders}",
+            "${fetch_products}"
+          ],
+          "operation": "array"
+        },
+        "dependencies": ["fetch_users", "fetch_orders", "fetch_products"]
+      }
+    ]
+  }
+}
+```
+
+### Execution Visualization
+
+```
+┌─────────────────────────────────────────────────┐
+│           DAG Execution Visualization           │
+├─────────────────────────────────────────────────┤
+│ Layer 1 (Parallel):                             │
+│   ├── Fetch Users (no deps)                     │
+│   ├── Fetch Orders (no deps)                    │
+│   ├── Fetch Products (no deps)                  │
+│         ↓                                       │
+│ Layer 2 (Parallel):                             │
+│   ├── Process Users ← [fetch_users]             │
+│   ├── Combine Results ← [fetch_users, ...]      │
+└─────────────────────────────────────────────────┘
+```
+
+---
+
+## 🔗 Integration Workflow
+
+The recommended pattern for complex tasks:
+
+```
+1. User: "Analyze competitors and create a market report"
+
+2. AI calls sequential_thinking:
+   - start_session: "Analyze competitors and create market report"
+   - add_thought: "Need to gather data from multiple sources"
+   - add_thought: "Identify key competitors: A, B, C"
+   - set_hypothesis: "Competitor A leads in market share"
+   - add_thought: "Data sources: financial reports, social media, reviews"
+   - conclude: "Plan: Fetch data in parallel, then synthesize"
+
+3. AI creates execution plan from thinking output
+
+4. AI calls orchestrator:
+   - execute_plan with parallel fetch tasks
+   - Aggregate results
+   - Generate final report
+
+5. Return synthesized results to user
+```
+
+---
+
+## 📊 Error Handling
+
+### Sequential Thinking
+- Invalid sessions return helpful error messages
+- Unverified hypotheses block conclusion
+- Revision history maintained for audit
+
+### Orchestrator
+- Failed tasks don't crash the pipeline
+- Retry support with configurable delays
+- Skipped tasks for unmet dependencies
+- Comprehensive error reporting
+
+```typescript
+// Example error response
+{
+  "success": false,
+  "status": "completed_with_errors",
+  "errors": [
+    {
+      "taskId": "fetch_data",
+      "taskName": "Fetch External Data",
+      "error": "Task timed out after 5000ms",
+      "timestamp": "2024-01-15T10:30:00Z"
+    }
+  ]
+}
+```
+
+---
+
+## 🧪 Testing
+
+```bash
+# Run in development mode
+npm run dev
+
+# Build and run
+npm run build && npm start
+```
+
+---
+
+## 📁 Project Structure
+
+```
+intelligent-agent-mcp/
+├── package.json
+├── tsconfig.json
+├── src/
+│   ├── index.ts              # MCP Server entry point
+│   ├── tools/
+│   │   ├── sequential-thinking.ts  # The Brain
+│   │   └── orchestrator.ts         # The Body
+│   ├── types/
+│   │   └── index.ts          # TypeScript interfaces
+│   └── utils/
+│       └── dag.ts            # DAG utilities
+└── README.md
+```
+
+---
+
+## 📜 License
+
+MIT
+
+---
+
+## 🤝 Contributing
+
+Contributions welcome! Areas of interest:
+- Additional built-in tools for orchestrator
+- Persistent session storage for thinking
+- WebSocket transport support
+- Visualization dashboard

package/dist/dag.d.ts

@@ -0,0 +1,39 @@
+import type { ExecutionPlan } from '../types/index.js';
+/**
+ * DAG (Directed Acyclic Graph) Utilities
+ * Provides topological sorting and parallel layer detection for task orchestration
+ */
+export interface DAGValidationResult {
+    isValid: boolean;
+    errors: string[];
+    hasCycle: boolean;
+    missingDependencies: string[];
+}
+export interface TopologicalResult {
+    isValid: boolean;
+    order: string[];
+    layers: string[][];
+    errors: string[];
+}
+/**
+ * Validates a DAG for cycles and missing dependencies
+ */
+export declare function validateDAG(plan: ExecutionPlan): DAGValidationResult;
+/**
+ * Performs topological sort and groups tasks into parallel execution layers
+ * Uses Kahn's algorithm for layered topological sort
+ */
+export declare function topologicalSortWithLayers(plan: ExecutionPlan): TopologicalResult;
+/**
+ * Gets the maximum parallelism possible for a plan
+ */
+export declare function getMaxParallelism(plan: ExecutionPlan): number;
+/**
+ * Calculates critical path (longest execution path)
+ */
+export declare function getCriticalPath(plan: ExecutionPlan): string[];
+/**
+ * Visualizes the DAG as ASCII art
+ */
+export declare function visualizeDAG(plan: ExecutionPlan): string;
+//# sourceMappingURL=dag.d.ts.map

package/dist/dag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../src/dag.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAY,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAEjE;;;GAGG;AAEH,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,QAAQ,EAAE,OAAO,CAAC;IAClB,mBAAmB,EAAE,MAAM,EAAE,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,aAAa,GAAG,mBAAmB,CA8BpE;AAuED;;;GAGG;AACH,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,aAAa,GAAG,iBAAiB,CAkFhF;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,CAK7D;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,EAAE,CAwC7D;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,CAkCxD"}

package/dist/dag.js

@@ -0,0 +1,241 @@
+/**
+ * Validates a DAG for cycles and missing dependencies
+ */
+export function validateDAG(plan) {
+    const errors = [];
+    const taskIds = new Set(plan.tasks.map(t => t.id));
+    const missingDependencies = [];
+    // Check for missing dependencies
+    for (const task of plan.tasks) {
+        for (const dep of task.dependencies) {
+            if (!taskIds.has(dep)) {
+                missingDependencies.push(`Task "${task.id}" depends on non-existent task "${dep}"`);
+            }
+        }
+    }
+    if (missingDependencies.length > 0) {
+        errors.push(...missingDependencies);
+    }
+    // Check for cycles using DFS
+    const hasCycle = detectCycle(plan.tasks);
+    if (hasCycle) {
+        errors.push('Circular dependency detected in task graph');
+    }
+    return {
+        isValid: errors.length === 0,
+        errors,
+        hasCycle,
+        missingDependencies
+    };
+}
+/**
+ * Detects cycles in the task graph using DFS with coloring
+ */
+function detectCycle(tasks) {
+    const WHITE = 0; // Not visited
+    const GRAY = 1; // Currently visiting (in recursion stack)
+    const BLACK = 2; // Completely visited
+    const color = new Map();
+    const adjacency = buildAdjacencyList(tasks);
+    // Initialize all nodes as white
+    for (const task of tasks) {
+        color.set(task.id, WHITE);
+    }
+    function dfs(nodeId) {
+        color.set(nodeId, GRAY);
+        const neighbors = adjacency.get(nodeId) || [];
+        for (const neighbor of neighbors) {
+            if (color.get(neighbor) === GRAY) {
+                // Found a back edge - cycle exists
+                return true;
+            }
+            if (color.get(neighbor) === WHITE && dfs(neighbor)) {
+                return true;
+            }
+        }
+        color.set(nodeId, BLACK);
+        return false;
+    }
+    // Check all nodes (handles disconnected components)
+    for (const task of tasks) {
+        if (color.get(task.id) === WHITE) {
+            if (dfs(task.id)) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Builds adjacency list from tasks (task -> tasks that depend on it)
+ */
+function buildAdjacencyList(tasks) {
+    const adjacency = new Map();
+    // Initialize empty arrays for all tasks
+    for (const task of tasks) {
+        adjacency.set(task.id, []);
+    }
+    // Build reverse adjacency (which tasks depend on which)
+    for (const task of tasks) {
+        for (const dep of task.dependencies) {
+            const dependents = adjacency.get(dep) || [];
+            dependents.push(task.id);
+            adjacency.set(dep, dependents);
+        }
+    }
+    return adjacency;
+}
+/**
+ * Performs topological sort and groups tasks into parallel execution layers
+ * Uses Kahn's algorithm for layered topological sort
+ */
+export function topologicalSortWithLayers(plan) {
+    const validation = validateDAG(plan);
+    if (!validation.isValid) {
+        return {
+            isValid: false,
+            order: [],
+            layers: [],
+            errors: validation.errors
+        };
+    }
+    const tasks = plan.tasks;
+    const taskMap = new Map(tasks.map(t => [t.id, t]));
+    // Calculate in-degree for each task
+    const inDegree = new Map();
+    for (const task of tasks) {
+        inDegree.set(task.id, task.dependencies.length);
+    }
+    // Build reverse adjacency (task -> tasks that depend on it)
+    const dependents = new Map();
+    for (const task of tasks) {
+        dependents.set(task.id, []);
+    }
+    for (const task of tasks) {
+        for (const dep of task.dependencies) {
+            dependents.get(dep).push(task.id);
+        }
+    }
+    const layers = [];
+    const order = [];
+    const processed = new Set();
+    // Start with tasks that have no dependencies (in-degree = 0)
+    let currentLayer = tasks
+        .filter(t => t.dependencies.length === 0)
+        .map(t => t.id);
+    while (currentLayer.length > 0) {
+        // Sort for deterministic ordering
+        currentLayer.sort();
+        layers.push([...currentLayer]);
+        order.push(...currentLayer);
+        const nextLayer = [];
+        for (const taskId of currentLayer) {
+            processed.add(taskId);
+            // Reduce in-degree for all dependent tasks
+            for (const dependentId of dependents.get(taskId) || []) {
+                const newInDegree = inDegree.get(dependentId) - 1;
+                inDegree.set(dependentId, newInDegree);
+                // If all dependencies are satisfied, add to next layer
+                if (newInDegree === 0 && !processed.has(dependentId)) {
+                    nextLayer.push(dependentId);
+                }
+            }
+        }
+        currentLayer = nextLayer;
+    }
+    // Verify all tasks were processed
+    if (order.length !== tasks.length) {
+        return {
+            isValid: false,
+            order: [],
+            layers: [],
+            errors: ['Not all tasks could be processed - possible cycle or invalid graph']
+        };
+    }
+    return {
+        isValid: true,
+        order,
+        layers,
+        errors: []
+    };
+}
+/**
+ * Gets the maximum parallelism possible for a plan
+ */
+export function getMaxParallelism(plan) {
+    const result = topologicalSortWithLayers(plan);
+    if (!result.isValid)
+        return 0;
+    return Math.max(...result.layers.map(layer => layer.length));
+}
+/**
+ * Calculates critical path (longest execution path)
+ */
+export function getCriticalPath(plan) {
+    const result = topologicalSortWithLayers(plan);
+    if (!result.isValid)
+        return [];
+    const taskMap = new Map(plan.tasks.map(t => [t.id, t]));
+    const longestPath = new Map();
+    // Initialize: tasks with no dependencies have path of just themselves
+    for (const task of plan.tasks) {
+        if (task.dependencies.length === 0) {
+            longestPath.set(task.id, [task.id]);
+        }
+    }
+    // Process in topological order
+    for (const taskId of result.order) {
+        const task = taskMap.get(taskId);
+        if (task.dependencies.length > 0) {
+            // Find the longest path among dependencies
+            let maxPath = [];
+            for (const depId of task.dependencies) {
+                const depPath = longestPath.get(depId) || [];
+                if (depPath.length > maxPath.length) {
+                    maxPath = depPath;
+                }
+            }
+            longestPath.set(taskId, [...maxPath, taskId]);
+        }
+    }
+    // Find the overall longest path
+    let criticalPath = [];
+    for (const path of longestPath.values()) {
+        if (path.length > criticalPath.length) {
+            criticalPath = path;
+        }
+    }
+    return criticalPath;
+}
+/**
+ * Visualizes the DAG as ASCII art
+ */
+export function visualizeDAG(plan) {
+    const result = topologicalSortWithLayers(plan);
+    if (!result.isValid) {
+        return `Invalid DAG: ${result.errors.join(', ')}`;
+    }
+    const taskMap = new Map(plan.tasks.map(t => [t.id, t]));
+    const lines = [];
+    lines.push('┌─────────────────────────────────────────────────┐');
+    lines.push('│           DAG Execution Visualization           │');
+    lines.push('├─────────────────────────────────────────────────┤');
+    for (let i = 0; i < result.layers.length; i++) {
+        const layer = result.layers[i];
+        lines.push(`│ Layer ${i + 1} (Parallel):                              │`);
+        for (const taskId of layer) {
+            const task = taskMap.get(taskId);
+            const deps = task.dependencies.length > 0
+                ? ` ← [${task.dependencies.join(', ')}]`
+                : ' (no deps)';
+            const line = `│   ├── ${task.name}${deps}`;
+            lines.push(line.padEnd(50) + '│');
+        }
+        if (i < result.layers.length - 1) {
+            lines.push('│         ↓                                       │');
+        }
+    }
+    lines.push('└─────────────────────────────────────────────────┘');
+    return lines.join('\n');
+}
+//# sourceMappingURL=dag.js.map

package/dist/dag.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.js","sourceRoot":"","sources":["../src/dag.ts"],"names":[],"mappings":"AAqBA;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,IAAmB;IAC7C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,mBAAmB,GAAa,EAAE,CAAC;IAEzC,iCAAiC;IACjC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,mBAAmB,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,mCAAmC,GAAG,GAAG,CAAC,CAAC;YACtF,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,mBAAmB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,CAAC;IACtC,CAAC;IAED,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC5B,MAAM;QACN,QAAQ;QACR,mBAAmB;KACpB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAC,KAAiB;IACpC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,cAAc;IAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAE,0CAA0C;IAC3D,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,qBAAqB;IAEtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IAE5C,gCAAgC;IAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,SAAS,GAAG,CAAC,MAAc;QACzB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAExB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC9C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;gBACjC,mCAAmC;gBACnC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACnD,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,oDAAoD;IACpD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC;YACjC,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjB,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,KAAiB;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,wCAAwC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,wDAAwD;IACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAC5C,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,yBAAyB,CAAC,IAAmB;IAC3D,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;QACxB,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,EAAE;YACT,MAAM,EAAE,EAAE;YACV,MAAM,EAAE,UAAU,CAAC,MAAM;SAC1B,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,oCAAoC;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAED,4DAA4D;IAC5D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC9B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,6DAA6D;IAC7D,IAAI,YAAY,GAAG,KAAK;SACrB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC;SACxC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAElB,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,kCAAkC;QAClC,YAAY,CAAC,IAAI,EAAE,CAAC;QACpB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAE5B,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEtB,2CAA2C;YAC3C,KAAK,MAAM,WAAW,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACvD,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAE,GAAG,CAAC,CAAC;gBACnD,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;gBAEvC,uDAAuD;gBACvD,IAAI,WAAW,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;oBACrD,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,YAAY,GAAG,SAAS,CAAC;IAC3B,CAAC;IAED,kCAAkC;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAClC,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,EAAE;YACT,MAAM,EAAE,EAAE;YACV,MAAM,EAAE,CAAC,oEAAoE,CAAC;SAC/E,CAAC;IACJ,CAAC;IAED,OAAO;QACL,OAAO,EAAE,IAAI;QACb,KAAK;QACL,MAAM;QACN,MAAM,EAAE,EAAE;KACX,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAmB;IACnD,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,CAAC,CAAC;IAE9B,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,IAAmB;IACjD,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEhD,sEAAsE;IACtE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAElC,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,2CAA2C;YAC3C,IAAI,OAAO,GAAa,EAAE,CAAC;YAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC7C,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;oBACpC,OAAO,GAAG,OAAO,CAAC;gBACpB,CAAC;YACH,CAAC;YACD,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,IAAI,YAAY,GAAa,EAAE,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACtC,YAAY,GAAG,IAAI,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,IAAmB;IAC9C,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO,gBAAgB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACpD,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IAClE,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IAClE,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IAElE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAC;QAE1E,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;gBACvC,CAAC,CAAC,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;gBACxC,CAAC,CAAC,YAAY,CAAC;YACjB,MAAM,IAAI,GAAG,WAAW,IAAI,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IAElE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

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