@brxce/mcp-server 1.0.0 → 1.0.1

package/dist/tools/worknode-plan-organize-tool.js

@@ -0,0 +1,356 @@
+import { z } from 'zod';
+const PlanOrganizeRequestSchema = z.object({
+    workspaceId: z.string().uuid().describe('The workspace ID to analyze'),
+    targetNodeIds: z
+        .array(z.string().uuid())
+        .optional()
+        .describe('Specific WorkNode IDs to analyze (optional, defaults to inbox items)'),
+    parentNodeId: z
+        .string()
+        .uuid()
+        .optional()
+        .describe('Analyze all descendants of this node (e.g., all tasks under a project)'),
+    includeAll: z.boolean().optional().describe('Analyze ALL WorkNodes in workspace (default: false, only inbox)'),
+    keywords: z.array(z.string()).optional().describe('Filter by keywords (e.g., ["MCP", "backend"])')
+});
+/**
+ * Extract keywords from text
+ */
+function extractKeywords(text) {
+    if (!text)
+        return [];
+    return text
+        .toLowerCase()
+        .split(/[\s,.\-_()[\]{}]+/)
+        .filter(word => word.length > 2)
+        .filter(word => !['the', 'and', 'for', 'with', 'from'].includes(word));
+}
+/**
+ * Calculate similarity between node and potential parent
+ */
+function calculateSimilarity(nodeKeywords, candidateKeywords, candidateTitle) {
+    const matchedKeywords = [];
+    // Find matching keywords
+    for (const nk of nodeKeywords) {
+        for (const ck of candidateKeywords) {
+            if (ck.includes(nk) || nk.includes(ck)) {
+                if (!matchedKeywords.includes(nk)) {
+                    matchedKeywords.push(nk);
+                }
+            }
+        }
+    }
+    // Jaccard similarity
+    const intersection = matchedKeywords.length;
+    const union = new Set([...nodeKeywords, ...candidateKeywords]).size;
+    const score = union > 0 ? intersection / union : 0;
+    return { score, matchedKeywords };
+}
+/**
+ * Build node path string
+ */
+function buildPath(node, allNodes) {
+    const path = [node.title];
+    let current = node;
+    while (current.parentNodeId) {
+        const parent = allNodes.find(n => n.id === current.parentNodeId);
+        if (!parent)
+            break;
+        path.unshift(parent.title);
+        current = parent;
+    }
+    return path.join(' > ');
+}
+/**
+ * Suggest parent nodes for a given WorkNode
+ */
+function suggestParents(node, potentialParents, allNodes, maxSuggestions = 3, minConfidence = 0.7) {
+    const nodeKeywords = extractKeywords((node.title || '') + ' ' + (node.description || ''));
+    const scored = potentialParents.map(candidate => {
+        const candidateKeywords = extractKeywords((candidate.title || '') + ' ' + (candidate.description || ''));
+        const { score, matchedKeywords } = calculateSimilarity(nodeKeywords, candidateKeywords, candidate.title);
+        return {
+            id: candidate.id,
+            title: candidate.title,
+            nodeType: candidate.nodeType,
+            path: buildPath(candidate, allNodes),
+            score,
+            matchedKeywords
+        };
+    });
+    return scored
+        .filter(s => s.score >= minConfidence)
+        .sort((a, b) => b.score - a.score)
+        .slice(0, maxSuggestions);
+}
+export function registerWorknodePlanOrganizeTool(server, apiClient) {
+    server.tool('brxce_plan_organize', `Analyze workspace structure and suggest WorkNode reorganization plan.
+
+⚠️ **CRITICAL: This tool ONLY analyzes and suggests - it does NOT execute changes!**
+
+**Purpose:**
+Help LLM create a reorganization plan for WorkNodes by:
+1. Analyzing current workspace structure
+2. Finding suitable parent nodes for orphaned/misplaced items
+3. Calculating confidence scores based on keyword matching
+4. Generating execution plan using existing tools
+
+**When to use:**
+- User asks to "organize", "clean up", or "restructure" WorkNodes
+- User says "inbox를 정리해줘" or "MCP 관련 작업 정리해줘"
+- User wants to move multiple items to appropriate locations
+
+**What this tool does:**
+1. Fetches workspace tree and inbox items
+2. Extracts keywords from titles and descriptions
+3. Matches orphaned items with potential parent projects/subprojects
+4. Calculates similarity scores (Jaccard similarity)
+5. Returns top 3 suggestions per item with confidence scores
+6. Provides ready-to-execute plan for brxce_update_worknodes
+
+**What this tool does NOT do:**
+- Does NOT modify any data
+- Does NOT change parentNodeId, title, status, assignee, or any other field
+- Does NOT archive, delete, or create nodes
+- Only returns analysis and suggestions
+
+**Execution workflow:**
+1. Call this tool to get suggestions
+2. Present suggestions to user with confidence scores and reasoning
+3. Ask user for confirmation
+4. Execute using:
+   - brxce_create_worknodes (if intermediate nodes needed)
+   - brxce_update_worknodes (to move nodes)
+
+**Safety rules:**
+✅ ONLY suggests parentNodeId changes
+✅ ONLY suggests nodeType changes (when hierarchy rules require)
+❌ NEVER suggests title, description, status, assignee, priority, tags, or date changes
+❌ NEVER archives or deletes nodes
+❌ User must confirm before execution
+
+**Example usage:**
+
+Example 1: Organize inbox items
+\`\`\`
+User: "Inbox에 있는 MCP 관련 작업들 정리해줘"
+
+await brxce_plan_organize({
+  workspaceId: 138,
+  keywords: ["MCP"]
+})
+\`\`\`
+
+Example 2: Organize all items under a project
+\`\`\`
+User: "MVP 프로젝트 하위 작업들 정리해줘"
+
+Step 1: Find project ID (e.g., 856)
+Step 2: Call this tool
+await brxce_plan_organize({
+  workspaceId: 138,
+  parentNodeId: 856
+})
+\`\`\`
+
+Example 3: Organize entire workspace
+\`\`\`
+User: "workspace 전체를 정리해줘"
+
+await brxce_plan_organize({
+  workspaceId: 138,
+  includeAll: true
+})
+
+Step 2: Review suggestions
+- Shows inbox items matching "MCP"
+- Suggests parent nodes with confidence scores
+- Provides execution plan
+
+Step 3: Present to user
+"다음과 같이 정리하겠습니다:
+1. #3872 'brxce_read_worknodes 500 에러'
+   → #2719 'MCP 툴 개선' 하위로 이동 (신뢰도 92%)
+
+진행하시겠습니까?"
+
+Step 4: Execute (after confirmation)
+await brxce_update_worknodes({
+  updates: [
+    { nodeId: 3872, changes: { parentNodeId: 2719 }}
+  ],
+  preview: false
+})
+\`\`\`
+
+**Parameters:**
+- workspaceId: Required workspace ID
+- targetNodeIds: Optional specific nodes to analyze
+- parentNodeId: Optional - analyze all descendants of this node
+- includeAll: Optional - analyze ALL workspace nodes (default: false)
+- keywords: Optional keyword filter (e.g., ["MCP", "backend"])
+
+**Scope Selection (priority order):**
+1. If targetNodeIds provided → Analyze those specific nodes
+2. Else if parentNodeId provided → Analyze all descendants
+3. Else if includeAll=true → Analyze all active workspace nodes
+4. Else (default) → Analyze inbox items only
+
+**Returns:**
+- summary: Analysis statistics
+- suggestions: Parent suggestions per node with confidence scores
+- executionPlan: Ready-to-use plan for brxce_update_worknodes`, PlanOrganizeRequestSchema.shape, async (args) => {
+        const { workspaceId, targetNodeIds, parentNodeId, includeAll, keywords } = args;
+        try {
+            // Step 1: Fetch workspace tree
+            const treeParams = new URLSearchParams();
+            treeParams.append('includeCompleted', 'false');
+            treeParams.append('includeCancelled', 'false');
+            const treeResponse = await apiClient.get(`/mcp/workspaces/${workspaceId}/overview?${treeParams.toString()}`);
+            if (!treeResponse.success) {
+                throw new Error('Failed to fetch workspace tree');
+            }
+            const allNodes = treeResponse.data.tree || [];
+            // Step 2: Fetch inbox items
+            const inboxParams = new URLSearchParams();
+            inboxParams.append('workspaceId', workspaceId.toString());
+            inboxParams.append('limit', '50');
+            const inboxResponse = await apiClient.get(`/mcp/worknodes/inbox?${inboxParams.toString()}`);
+            if (!inboxResponse.success) {
+                throw new Error('Failed to fetch inbox items');
+            }
+            const myInbox = inboxResponse.data.myInbox || [];
+            const sharedInbox = inboxResponse.data.sharedInbox || [];
+            const inboxItems = [...myInbox, ...sharedInbox];
+            // Step 3: Filter target nodes
+            let targetNodes;
+            if (targetNodeIds && targetNodeIds.length > 0) {
+                // Specific nodes provided
+                targetNodes = allNodes.filter(n => targetNodeIds.includes(n.id));
+            }
+            else if (parentNodeId !== undefined) {
+                // All descendants of a specific parent
+                targetNodes = allNodes.filter(n => {
+                    // Check if this node is a descendant of parentNodeId
+                    if (n.id === parentNodeId)
+                        return false; // Don't include parent itself
+                    // Traverse up to check if parentNodeId is an ancestor
+                    let current = n;
+                    while (current.parentNodeId) {
+                        if (current.parentNodeId === parentNodeId)
+                            return true;
+                        const parent = allNodes.find(node => node.id === current.parentNodeId);
+                        if (!parent)
+                            break;
+                        current = parent;
+                    }
+                    return false;
+                });
+            }
+            else if (includeAll) {
+                // All nodes in workspace (excluding completed/cancelled)
+                targetNodes = allNodes.filter(n => n.status !== 'completed' &&
+                    n.status !== 'cancelled');
+            }
+            else {
+                // Default: inbox items only
+                targetNodes = inboxItems;
+            }
+            // Apply keyword filter if specified
+            if (keywords && keywords.length > 0) {
+                const keywordsLower = keywords.map(k => k.toLowerCase());
+                targetNodes = targetNodes.filter(node => {
+                    const text = ((node.title || '') + ' ' + (node.description || '')).toLowerCase();
+                    return keywordsLower.some(kw => text.includes(kw));
+                });
+            }
+            // Step 4: Find potential parents (projects and subprojects only)
+            const potentialParents = allNodes.filter(n => ['project', 'subproject'].includes(n.nodeType) &&
+                n.status !== 'completed' &&
+                n.status !== 'cancelled');
+            // Step 5: Generate suggestions
+            const suggestions = targetNodes.map(node => {
+                const parentSuggestions = suggestParents(node, potentialParents, allNodes, 3, // maxSuggestions
+                0.7 // minConfidence
+                );
+                return {
+                    nodeId: node.id,
+                    currentTitle: node.title,
+                    currentLocation: node.parentNodeId
+                        ? buildPath(node, allNodes)
+                        : 'Inbox (root)',
+                    suggestedParents: parentSuggestions.map(s => ({
+                        parentId: s.id,
+                        parentTitle: s.title,
+                        parentPath: s.path,
+                        confidence: Math.round(s.score * 100) / 100,
+                        matchedKeywords: s.matchedKeywords,
+                        reason: s.matchedKeywords.length > 0
+                            ? `제목/설명에 키워드 매칭: ${s.matchedKeywords.join(', ')}`
+                            : '일반적인 유사도'
+                    }))
+                };
+            });
+            // Step 6: Filter out nodes with no suggestions
+            const needsOrganization = suggestions.filter(s => s.suggestedParents.length > 0);
+            const wellOrganized = suggestions.length - needsOrganization.length;
+            // Step 7: Generate execution plan
+            const executionPlan = {
+                updateNodes: needsOrganization
+                    .filter(s => s.suggestedParents.length > 0)
+                    .map(s => ({
+                    nodeId: s.nodeId,
+                    changes: {
+                        parentNodeId: s.suggestedParents[0]?.parentId
+                    },
+                    confidence: s.suggestedParents[0]?.confidence || 0,
+                    reason: s.suggestedParents[0]?.reason || ''
+                }))
+            };
+            // Step 8: Return analysis
+            const result = {
+                summary: {
+                    totalAnalyzed: targetNodes.length,
+                    needsOrganization: needsOrganization.length,
+                    wellOrganized,
+                    avgConfidence: needsOrganization.length > 0
+                        ? Math.round(needsOrganization.reduce((sum, s) => sum + (s.suggestedParents[0]?.confidence || 0), 0) / needsOrganization.length * 100) / 100
+                        : 0
+                },
+                suggestions: needsOrganization,
+                executionPlan,
+                instructions: {
+                    step1: 'Review suggestions above',
+                    step2: 'Present to user with confidence scores',
+                    step3: 'Get user confirmation',
+                    step4: 'Execute using brxce_update_worknodes with executionPlan.updateNodes',
+                    warning: '⚠️ NEVER execute without user confirmation!'
+                }
+            };
+            return {
+                content: [
+                    {
+                        type: 'text',
+                        text: JSON.stringify(result, null, 2),
+                    },
+                ],
+            };
+        }
+        catch (error) {
+            return {
+                content: [
+                    {
+                        type: 'text',
+                        text: JSON.stringify({
+                            error: 'Failed to analyze workspace',
+                            message: error.message,
+                            workspaceId
+                        }, null, 2),
+                    },
+                ],
+                isError: true,
+            };
+        }
+    });
+}
+//# sourceMappingURL=worknode-plan-organize-tool.js.map

package/dist/tools/worknode-plan-organize-tool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"worknode-plan-organize-tool.js","sourceRoot":"","sources":["../../src/tools/worknode-plan-organize-tool.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,MAAM,yBAAyB,GAAG,CAAC,CAAC,MAAM,CAAC;IACzC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,6BAA6B,CAAC;IACtE,aAAa,EAAE,CAAC;SACb,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC;SACxB,QAAQ,EAAE;SACV,QAAQ,CAAC,sEAAsE,CAAC;IACnF,YAAY,EAAE,CAAC;SACZ,MAAM,EAAE;SACR,IAAI,EAAE;SACN,QAAQ,EAAE;SACV,QAAQ,CAAC,wEAAwE,CAAC;IACrF,UAAU,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iEAAiE,CAAC;IAC9G,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,+CAA+C,CAAC;CACnG,CAAC,CAAC;AAsBH;;GAEG;AACH,SAAS,eAAe,CAAC,IAAY;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IAErB,OAAO,IAAI;SACR,WAAW,EAAE;SACb,KAAK,CAAC,mBAAmB,CAAC;SAC1B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SAC/B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAC1B,YAAsB,EACtB,iBAA2B,EAC3B,cAAsB;IAEtB,MAAM,eAAe,GAAa,EAAE,CAAC;IAErC,yBAAyB;IACzB,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;QAC9B,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;YACnC,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;oBAClC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC;IAEpE,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,OAAO,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,SAAS,SAAS,CAAC,IAAc,EAAE,QAAoB;IACrD,MAAM,IAAI,GAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,OAAO,GAAG,IAAI,CAAC;IAEnB,OAAO,OAAO,CAAC,YAAY,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,YAAY,CAAC,CAAC;QACjE,IAAI,CAAC,MAAM;YAAE,MAAM;QACnB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC3B,OAAO,GAAG,MAAM,CAAC;IACnB,CAAC;IAED,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CACrB,IAAc,EACd,gBAA4B,EAC5B,QAAoB,EACpB,iBAAyB,CAAC,EAC1B,gBAAwB,GAAG;IAE3B,MAAM,YAAY,GAAG,eAAe,CAClC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC,CACpD,CAAC;IAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;QAC9C,MAAM,iBAAiB,GAAG,eAAe,CACvC,CAAC,SAAS,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,SAAS,CAAC,WAAW,IAAI,EAAE,CAAC,CAC9D,CAAC;QAEF,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,mBAAmB,CACpD,YAAY,EACZ,iBAAiB,EACjB,SAAS,CAAC,KAAK,CAChB,CAAC;QAEF,OAAO;YACL,EAAE,EAAE,SAAS,CAAC,EAAE;YAChB,KAAK,EAAE,SAAS,CAAC,KAAK;YACtB,QAAQ,EAAE,SAAS,CAAC,QAAQ;YAC5B,IAAI,EAAE,SAAS,CAAC,SAAS,EAAE,QAAQ,CAAC;YACpC,KAAK;YACL,eAAe;SAChB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM;SACV,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,aAAa,CAAC;SACrC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,UAAU,gCAAgC,CAAC,MAAiB,EAAE,SAAoB;IACtF,MAAM,CAAC,IAAI,CACT,qBAAqB,EACrB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;8DAmH0D,EAC1D,yBAAyB,CAAC,KAAK,EAC/B,KAAK,EAAE,IAAI,EAAE,EAAE;QACb,MAAM,EAAE,WAAW,EAAE,aAAa,EAAE,YAAY,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,IAAiD,CAAC;QAE7H,IAAI,CAAC;YACH,+BAA+B;YAC/B,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;YACzC,UAAU,CAAC,MAAM,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC;YAC/C,UAAU,CAAC,MAAM,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC;YAE/C,MAAM,YAAY,GAAG,MAAM,SAAS,CAAC,GAAG,CACtC,mBAAmB,WAAW,aAAa,UAAU,CAAC,QAAQ,EAAE,EAAE,CACnE,CAAC;YAEF,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;gBAC1B,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;YACpD,CAAC;YAED,MAAM,QAAQ,GAAe,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAE1D,4BAA4B;YAC5B,MAAM,WAAW,GAAG,IAAI,eAAe,EAAE,CAAC;YAC1C,WAAW,CAAC,MAAM,CAAC,aAAa,EAAE,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC1D,WAAW,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAElC,MAAM,aAAa,GAAG,MAAM,SAAS,CAAC,GAAG,CACvC,wBAAwB,WAAW,CAAC,QAAQ,EAAE,EAAE,CACjD,CAAC;YAEF,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC;gBAC3B,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;YACjD,CAAC;YAED,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;YACjD,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC;YACzD,MAAM,UAAU,GAAG,CAAC,GAAG,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC;YAEhD,8BAA8B;YAC9B,IAAI,WAAuB,CAAC;YAE5B,IAAI,aAAa,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9C,0BAA0B;gBAC1B,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,CAAC;iBAAM,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBACtC,uCAAuC;gBACvC,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;oBAChC,qDAAqD;oBACrD,IAAI,CAAC,CAAC,EAAE,KAAK,YAAY;wBAAE,OAAO,KAAK,CAAC,CAAC,8BAA8B;oBAEvE,sDAAsD;oBACtD,IAAI,OAAO,GAAG,CAAC,CAAC;oBAChB,OAAO,OAAO,CAAC,YAAY,EAAE,CAAC;wBAC5B,IAAI,OAAO,CAAC,YAAY,KAAK,YAAY;4BAAE,OAAO,IAAI,CAAC;wBACvD,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,OAAO,CAAC,YAAY,CAAC,CAAC;wBACvE,IAAI,CAAC,MAAM;4BAAE,MAAM;wBACnB,OAAO,GAAG,MAAM,CAAC;oBACnB,CAAC;oBACD,OAAO,KAAK,CAAC;gBACf,CAAC,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,UAAU,EAAE,CAAC;gBACtB,yDAAyD;gBACzD,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAChC,CAAC,CAAC,MAAM,KAAK,WAAW;oBACxB,CAAC,CAAC,MAAM,KAAK,WAAW,CACzB,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,4BAA4B;gBAC5B,WAAW,GAAG,UAAU,CAAC;YAC3B,CAAC;YAED,oCAAoC;YACpC,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpC,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;gBACzD,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;oBACtC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;oBACjF,OAAO,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;gBACrD,CAAC,CAAC,CAAC;YACL,CAAC;YAED,iEAAiE;YACjE,MAAM,gBAAgB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAC3C,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAC9C,CAAC,CAAC,MAAM,KAAK,WAAW;gBACxB,CAAC,CAAC,MAAM,KAAK,WAAW,CACzB,CAAC;YAEF,+BAA+B;YAC/B,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBACzC,MAAM,iBAAiB,GAAG,cAAc,CACtC,IAAI,EACJ,gBAAgB,EAChB,QAAQ,EACR,CAAC,EAAE,iBAAiB;gBACpB,GAAG,CAAC,gBAAgB;iBACrB,CAAC;gBAEF,OAAO;oBACL,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,YAAY,EAAE,IAAI,CAAC,KAAK;oBACxB,eAAe,EAAE,IAAI,CAAC,YAAY;wBAChC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC;wBAC3B,CAAC,CAAC,cAAc;oBAClB,gBAAgB,EAAE,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBAC5C,QAAQ,EAAE,CAAC,CAAC,EAAE;wBACd,WAAW,EAAE,CAAC,CAAC,KAAK;wBACpB,UAAU,EAAE,CAAC,CAAC,IAAI;wBAClB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG;wBAC3C,eAAe,EAAE,CAAC,CAAC,eAAe;wBAClC,MAAM,EAAE,CAAC,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC;4BAClC,CAAC,CAAC,kBAAkB,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;4BAClD,CAAC,CAAC,UAAU;qBACf,CAAC,CAAC;iBACJ,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,+CAA+C;YAC/C,MAAM,iBAAiB,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACjF,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC;YAEpE,kCAAkC;YAClC,MAAM,aAAa,GAAG;gBACpB,WAAW,EAAE,iBAAiB;qBAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC;qBAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACT,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,OAAO,EAAE;wBACP,YAAY,EAAE,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,QAAQ;qBAC9C;oBACD,UAAU,EAAE,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,UAAU,IAAI,CAAC;oBAClD,MAAM,EAAE,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE;iBAC5C,CAAC,CAAC;aACN,CAAC;YAEF,0BAA0B;YAC1B,MAAM,MAAM,GAAG;gBACb,OAAO,EAAE;oBACP,aAAa,EAAE,WAAW,CAAC,MAAM;oBACjC,iBAAiB,EAAE,iBAAiB,CAAC,MAAM;oBAC3C,aAAa;oBACb,aAAa,EAAE,iBAAiB,CAAC,MAAM,GAAG,CAAC;wBACzC,CAAC,CAAC,IAAI,CAAC,KAAK,CACR,iBAAiB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAClC,GAAG,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,CAClD,GAAG,iBAAiB,CAAC,MAAM,GAAG,GAAG,CACnC,GAAG,GAAG;wBACT,CAAC,CAAC,CAAC;iBACN;gBACD,WAAW,EAAE,iBAAiB;gBAC9B,aAAa;gBACb,YAAY,EAAE;oBACZ,KAAK,EAAE,0BAA0B;oBACjC,KAAK,EAAE,wCAAwC;oBAC/C,KAAK,EAAE,uBAAuB;oBAC9B,KAAK,EAAE,qEAAqE;oBAC5E,OAAO,EAAE,6CAA6C;iBACvD;aACF,CAAC;YAEF,OAAO;gBACL,OAAO,EAAE;oBACP;wBACE,IAAI,EAAE,MAAM;wBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;qBACtC;iBACF;aACF,CAAC;QAEJ,CAAC;QAAC,OAAO,KAAU,EAAE,CAAC;YACpB,OAAO;gBACL,OAAO,EAAE;oBACP;wBACE,IAAI,EAAE,MAAM;wBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;4BACnB,KAAK,EAAE,6BAA6B;4BACpC,OAAO,EAAE,KAAK,CAAC,OAAO;4BACtB,WAAW;yBACZ,EAAE,IAAI,EAAE,CAAC,CAAC;qBACZ;iBACF;gBACD,OAAO,EAAE,IAAI;aACd,CAAC;QACJ,CAAC;IACH,CAAC,CACF,CAAC;AACJ,CAAC"}

package/dist/tools/worknode-read-tool.d.ts

@@ -0,0 +1,4 @@
+import { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import { ApiClient } from '../services/api-client.js';
+export declare function registerWorknodeReadTool(server: McpServer, apiClient: ApiClient): void;
+//# sourceMappingURL=worknode-read-tool.d.ts.map

package/dist/tools/worknode-read-tool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"worknode-read-tool.d.ts","sourceRoot":"","sources":["../../src/tools/worknode-read-tool.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAEpE,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAEtD,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,QA4W/E"}