@shin1ohno/sage 0.1.0

package/dist/utils/stakeholders.js

@@ -0,0 +1,301 @@
+/**
+ * Stakeholder Extraction System
+ * Identifies and extracts stakeholders from task content
+ * Requirements: 4.1-4.5
+ */
+// Manager keywords
+const MANAGER_KEYWORDS = [
+    'manager',
+    'マネージャー',
+    '上司',
+    'boss',
+    'supervisor',
+    '管理者',
+    'director',
+    'ディレクター',
+    'lead',
+    'リーダー',
+    'team lead',
+    'チームリード',
+];
+// Mention patterns
+const MENTION_PATTERNS = [
+    /@(\w+)/g, // @username
+    /@([^\s]+さん)/g, // @名前さん (Japanese)
+    /(?:from|by|with|to|cc|CC)\s+(\w+)/gi, // from/by/with person
+    /(?:から|と|へ|宛)\s*([^\s、]+(?:さん|様)?)/g, // Japanese particles
+];
+export class StakeholderExtractor {
+    /**
+     * Extract stakeholders from a task
+     * Requirement: 4.1, 4.5
+     */
+    static extractStakeholders(task, teamConfig) {
+        const text = `${task.title} ${task.description ?? ''}`;
+        const stakeholders = [];
+        const matchedTeamMembers = [];
+        // Extract @mentions
+        const mentions = this.findMentions(text);
+        stakeholders.push(...mentions);
+        // Match against team members
+        if (teamConfig) {
+            const matched = this.matchTeamMembers(text, teamConfig);
+            for (const member of matched) {
+                if (!stakeholders.includes(member.name)) {
+                    stakeholders.push(member.name);
+                    matchedTeamMembers.push(member);
+                }
+            }
+        }
+        // Check for manager involvement
+        const managerInvolved = this.checkManagerInvolvement(text, teamConfig);
+        // Add manager to stakeholders if involved
+        if (managerInvolved && teamConfig?.manager) {
+            if (!stakeholders.includes(teamConfig.manager.name)) {
+                stakeholders.push(teamConfig.manager.name);
+                matchedTeamMembers.push(teamConfig.manager);
+            }
+        }
+        return {
+            stakeholders,
+            managerInvolved,
+            reason: this.buildReason(stakeholders, managerInvolved, mentions),
+            mentions,
+            matchedTeamMembers,
+        };
+    }
+    /**
+     * Find @mentions in text
+     * Requirement: 4.3
+     */
+    static findMentions(text) {
+        const mentions = new Set();
+        for (const pattern of MENTION_PATTERNS) {
+            // Reset lastIndex for global patterns
+            pattern.lastIndex = 0;
+            let match;
+            while ((match = pattern.exec(text)) !== null) {
+                const mention = match[1].trim();
+                // Filter out common false positives
+                if (mention.length > 1 && !this.isCommonWord(mention)) {
+                    mentions.add(mention);
+                }
+            }
+        }
+        return Array.from(mentions);
+    }
+    /**
+     * Match text against configured team members
+     * Requirement: 4.2
+     */
+    static matchTeamMembers(text, teamConfig) {
+        const lowerText = text.toLowerCase();
+        const matched = [];
+        // Check manager
+        if (teamConfig.manager) {
+            if (this.memberMatchesText(teamConfig.manager, lowerText)) {
+                matched.push(teamConfig.manager);
+            }
+        }
+        // Check frequent collaborators
+        for (const collaborator of teamConfig.frequentCollaborators) {
+            if (this.memberMatchesText(collaborator, lowerText)) {
+                matched.push(collaborator);
+            }
+        }
+        return matched;
+    }
+    /**
+     * Check if a team member matches the text
+     */
+    static memberMatchesText(member, lowerText) {
+        // Check name
+        if (lowerText.includes(member.name.toLowerCase())) {
+            return true;
+        }
+        // Check keywords
+        for (const keyword of member.keywords) {
+            if (lowerText.includes(keyword.toLowerCase())) {
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Check if manager is involved in the task
+     * Requirement: 4.4
+     */
+    static checkManagerInvolvement(text, teamConfig) {
+        const lowerText = text.toLowerCase();
+        // Check generic manager keywords
+        if (MANAGER_KEYWORDS.some((keyword) => lowerText.includes(keyword.toLowerCase()))) {
+            return true;
+        }
+        // Check configured manager
+        if (teamConfig?.manager) {
+            if (lowerText.includes(teamConfig.manager.name.toLowerCase())) {
+                return true;
+            }
+            for (const keyword of teamConfig.manager.keywords) {
+                if (lowerText.includes(keyword.toLowerCase())) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * Check if a word is a common word (false positive)
+     */
+    static isCommonWord(word) {
+        const commonWords = [
+            'the',
+            'a',
+            'an',
+            'to',
+            'from',
+            'with',
+            'by',
+            'for',
+            'in',
+            'on',
+            'at',
+            'it',
+            'is',
+            'are',
+            'was',
+            'were',
+            'be',
+            'been',
+            'being',
+            'have',
+            'has',
+            'had',
+            'do',
+            'does',
+            'did',
+            'will',
+            'would',
+            'could',
+            'should',
+            'may',
+            'might',
+            'must',
+            'shall',
+            'can',
+            'need',
+            'dare',
+            'ought',
+            'used',
+            'this',
+            'that',
+            'these',
+            'those',
+            'の',
+            'に',
+            'を',
+            'で',
+            'が',
+            'は',
+        ];
+        return commonWords.includes(word.toLowerCase());
+    }
+    /**
+     * Build a human-readable reason
+     */
+    static buildReason(stakeholders, managerInvolved, mentions) {
+        if (stakeholders.length === 0) {
+            return '関係者は検出されませんでした';
+        }
+        const parts = [];
+        if (mentions.length > 0) {
+            parts.push(`@メンションから${mentions.length}名を検出`);
+        }
+        if (managerInvolved) {
+            parts.push('マネージャーが関与');
+        }
+        const nonMentionCount = stakeholders.length - mentions.length;
+        if (nonMentionCount > 0 && !managerInvolved) {
+            parts.push(`チームメンバーから${nonMentionCount}名を検出`);
+        }
+        return parts.join('、') || `${stakeholders.length}名の関係者を検出`;
+    }
+    /**
+     * Get priority boost for manager involvement
+     */
+    static getManagerPriorityBoost() {
+        return 1; // Boost priority by 1 level (e.g., P2 -> P1)
+    }
+    /**
+     * Extract all names from text (broader matching)
+     */
+    static extractPotentialNames(text) {
+        const names = new Set();
+        // Japanese name patterns (漢字 + さん/様/氏)
+        const japaneseNamePattern = /([一-龯]{2,4})(さん|様|氏)/g;
+        let match;
+        while ((match = japaneseNamePattern.exec(text)) !== null) {
+            names.add(match[1]);
+        }
+        // English capitalized names
+        const englishNamePattern = /\b([A-Z][a-z]+(?:\s+[A-Z][a-z]+)?)\b/g;
+        while ((match = englishNamePattern.exec(text)) !== null) {
+            const name = match[1];
+            // Filter out common non-names
+            if (!this.isCommonCapitalizedWord(name)) {
+                names.add(name);
+            }
+        }
+        return Array.from(names);
+    }
+    /**
+     * Check if a capitalized word is commonly not a name
+     */
+    static isCommonCapitalizedWord(word) {
+        const commonWords = [
+            'Monday',
+            'Tuesday',
+            'Wednesday',
+            'Thursday',
+            'Friday',
+            'Saturday',
+            'Sunday',
+            'January',
+            'February',
+            'March',
+            'April',
+            'May',
+            'June',
+            'July',
+            'August',
+            'September',
+            'October',
+            'November',
+            'December',
+            'The',
+            'This',
+            'That',
+            'Please',
+            'Thanks',
+            'Hello',
+            'Hi',
+            'Dear',
+            'Task',
+            'Project',
+            'Meeting',
+            'Review',
+            'Update',
+            'Urgent',
+            'Important',
+            'TODO',
+            'FIXME',
+            'NOTE',
+            'API',
+            'UI',
+            'PR',
+            'MR',
+        ];
+        return commonWords.includes(word);
+    }
+}
+//# sourceMappingURL=stakeholders.js.map

package/dist/utils/stakeholders.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stakeholders.js","sourceRoot":"","sources":["../../src/utils/stakeholders.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAYH,mBAAmB;AACnB,MAAM,gBAAgB,GAAG;IACvB,SAAS;IACT,QAAQ;IACR,IAAI;IACJ,MAAM;IACN,YAAY;IACZ,KAAK;IACL,UAAU;IACV,QAAQ;IACR,MAAM;IACN,MAAM;IACN,WAAW;IACX,QAAQ;CACT,CAAC;AAEF,mBAAmB;AACnB,MAAM,gBAAgB,GAAG;IACvB,SAAS,EAAE,YAAY;IACvB,cAAc,EAAE,mBAAmB;IACnC,qCAAqC,EAAE,sBAAsB;IAC7D,oCAAoC,EAAE,qBAAqB;CAC5D,CAAC;AAEF,MAAM,OAAO,oBAAoB;IAC/B;;;OAGG;IACH,MAAM,CAAC,mBAAmB,CAAC,IAAU,EAAE,UAAuB;QAC5D,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;QACvD,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,kBAAkB,GAAiB,EAAE,CAAC;QAE5C,oBAAoB;QACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACzC,YAAY,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;QAE/B,6BAA6B;QAC7B,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YACxD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;oBACxC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC/B,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,eAAe,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAEvE,0CAA0C;QAC1C,IAAI,eAAe,IAAI,UAAU,EAAE,OAAO,EAAE,CAAC;YAC3C,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpD,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC3C,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,OAAO;YACL,YAAY;YACZ,eAAe;YACf,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,eAAe,EAAE,QAAQ,CAAC;YACjE,QAAQ;YACR,kBAAkB;SACnB,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,YAAY,CAAC,IAAY;QAC9B,MAAM,QAAQ,GAAgB,IAAI,GAAG,EAAE,CAAC;QAExC,KAAK,MAAM,OAAO,IAAI,gBAAgB,EAAE,CAAC;YACvC,sCAAsC;YACtC,OAAO,CAAC,SAAS,GAAG,CAAC,CAAC;YAEtB,IAAI,KAAK,CAAC;YACV,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC7C,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAChC,oCAAoC;gBACpC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC;oBACtD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,gBAAgB,CAAC,IAAY,EAAE,UAAsB;QAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,OAAO,GAAiB,EAAE,CAAC;QAEjC,gBAAgB;QAChB,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC;gBAC1D,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,YAAY,IAAI,UAAU,CAAC,qBAAqB,EAAE,CAAC;YAC5D,IAAI,IAAI,CAAC,iBAAiB,CAAC,YAAY,EAAE,SAAS,CAAC,EAAE,CAAC;gBACpD,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,iBAAiB,CAAC,MAAkB,EAAE,SAAiB;QACpE,aAAa;QACb,IAAI,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;YAClD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,iBAAiB;QACjB,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACtC,IAAI,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;gBAC9C,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,uBAAuB,CAAC,IAAY,EAAE,UAAuB;QAClE,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAErC,iCAAiC;QACjC,IAAI,gBAAgB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC;YAClF,OAAO,IAAI,CAAC;QACd,CAAC;QAED,2BAA2B;QAC3B,IAAI,UAAU,EAAE,OAAO,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;gBAC9D,OAAO,IAAI,CAAC;YACd,CAAC;YAED,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;gBAClD,IAAI,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;oBAC9C,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,YAAY,CAAC,IAAY;QACtC,MAAM,WAAW,GAAG;YAClB,KAAK;YACL,GAAG;YACH,IAAI;YACJ,IAAI;YACJ,MAAM;YACN,MAAM;YACN,IAAI;YACJ,KAAK;YACL,IAAI;YACJ,IAAI;YACJ,IAAI;YACJ,IAAI;YACJ,IAAI;YACJ,KAAK;YACL,KAAK;YACL,MAAM;YACN,IAAI;YACJ,MAAM;YACN,OAAO;YACP,MAAM;YACN,KAAK;YACL,KAAK;YACL,IAAI;YACJ,MAAM;YACN,KAAK;YACL,MAAM;YACN,OAAO;YACP,OAAO;YACP,QAAQ;YACR,KAAK;YACL,OAAO;YACP,MAAM;YACN,OAAO;YACP,KAAK;YACL,MAAM;YACN,MAAM;YACN,OAAO;YACP,MAAM;YACN,MAAM;YACN,MAAM;YACN,OAAO;YACP,OAAO;YACP,GAAG;YACH,GAAG;YACH,GAAG;YACH,GAAG;YACH,GAAG;YACH,GAAG;SACJ,CAAC;QAEF,OAAO,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,WAAW,CACxB,YAAsB,EACtB,eAAwB,EACxB,QAAkB;QAElB,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,gBAAgB,CAAC;QAC1B,CAAC;QAED,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,WAAW,QAAQ,CAAC,MAAM,MAAM,CAAC,CAAC;QAC/C,CAAC;QAED,IAAI,eAAe,EAAE,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC1B,CAAC;QAED,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC9D,IAAI,eAAe,GAAG,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;YAC5C,KAAK,CAAC,IAAI,CAAC,YAAY,eAAe,MAAM,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,YAAY,CAAC,MAAM,UAAU,CAAC;IAC7D,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,uBAAuB;QAC5B,OAAO,CAAC,CAAC,CAAC,6CAA6C;IACzD,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,qBAAqB,CAAC,IAAY;QACvC,MAAM,KAAK,GAAgB,IAAI,GAAG,EAAE,CAAC;QAErC,uCAAuC;QACvC,MAAM,mBAAmB,GAAG,uBAAuB,CAAC;QACpD,IAAI,KAAK,CAAC;QACV,OAAO,CAAC,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YACzD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QAED,4BAA4B;QAC5B,MAAM,kBAAkB,GAAG,uCAAuC,CAAC;QACnE,OAAO,CAAC,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YACxD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,8BAA8B;YAC9B,IAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,uBAAuB,CAAC,IAAY;QACjD,MAAM,WAAW,GAAG;YAClB,QAAQ;YACR,SAAS;YACT,WAAW;YACX,UAAU;YACV,QAAQ;YACR,UAAU;YACV,QAAQ;YACR,SAAS;YACT,UAAU;YACV,OAAO;YACP,OAAO;YACP,KAAK;YACL,MAAM;YACN,MAAM;YACN,QAAQ;YACR,WAAW;YACX,SAAS;YACT,UAAU;YACV,UAAU;YACV,KAAK;YACL,MAAM;YACN,MAAM;YACN,QAAQ;YACR,QAAQ;YACR,OAAO;YACP,IAAI;YACJ,MAAM;YACN,MAAM;YACN,SAAS;YACT,SAAS;YACT,QAAQ;YACR,QAAQ;YACR,QAAQ;YACR,WAAW;YACX,MAAM;YACN,OAAO;YACP,MAAM;YACN,KAAK;YACL,IAAI;YACJ,IAAI;YACJ,IAAI;SACL,CAAC;QAEF,OAAO,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;CACF"}

package/dist/utils/task-splitter.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Task Splitter
+ * Splits complex tasks or multiple tasks into manageable pieces
+ * Requirements: 11.1-11.6
+ */
+import type { Task, SplitResult, ComplexityAnalysis } from '../types/index.js';
+export declare class TaskSplitter {
+    /**
+     * Split input text into individual tasks
+     * Requirement: 11.1, 11.4
+     */
+    static splitTasks(input: string): SplitResult;
+    /**
+     * Analyze task complexity
+     * Requirement: 11.2, 11.3
+     */
+    static analyzeComplexity(task: Task): ComplexityAnalysis;
+    /**
+     * Split input into individual lines/items
+     */
+    private static splitIntoLines;
+    /**
+     * Check if input contains multiple tasks
+     */
+    private static containsMultipleTasks;
+    /**
+     * Suggest splits for project-level tasks
+     */
+    private static suggestProjectSplits;
+    /**
+     * Suggest splits for complex tasks
+     */
+    private static suggestComplexSplits;
+    /**
+     * Infer dependencies between tasks
+     * Requirement: 11.5
+     */
+    private static inferDependencies;
+    /**
+     * Calculate recommended execution order
+     * Requirement: 11.6
+     */
+    private static calculateRecommendedOrder;
+}
+//# sourceMappingURL=task-splitter.d.ts.map

package/dist/utils/task-splitter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-splitter.d.ts","sourceRoot":"","sources":["../../src/utils/task-splitter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EACV,IAAI,EAEJ,WAAW,EACX,kBAAkB,EAEnB,MAAM,mBAAmB,CAAC;AA6E3B,qBAAa,YAAY;IACvB;;;OAGG;IACH,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW;IAgD7C;;;OAGG;IACH,MAAM,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,GAAG,kBAAkB;IAwCxD;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IA2B7B;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAOpC;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IA8BnC;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAoBnC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAkDhC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,yBAAyB;CAuBzC"}

package/dist/utils/task-splitter.js

@@ -0,0 +1,321 @@
+/**
+ * Task Splitter
+ * Splits complex tasks or multiple tasks into manageable pieces
+ * Requirements: 11.1-11.6
+ */
+// Patterns that indicate multiple tasks
+const MULTI_TASK_PATTERNS = [
+    /(?:^|\n)\s*[-•*]\s+/g, // Bullet points
+    /(?:^|\n)\s*\d+[.)]\s+/g, // Numbered lists
+    /(?:そして|また|さらに|加えて|それから)/g, // Japanese conjunctions
+    /(?:and then|also|additionally|furthermore|moreover)/gi, // English conjunctions
+    /[。.]\s*(?=[^。.]+[。.])/g, // Sentence boundaries with more content
+];
+// Keywords indicating complex tasks
+const COMPLEXITY_KEYWORDS = {
+    project: [
+        'システム',
+        'アーキテクチャ',
+        '設計',
+        '構築',
+        'プロジェクト',
+        'system',
+        'architecture',
+        'design',
+        'build',
+        'project',
+        'develop',
+        '開発',
+    ],
+    complex: [
+        'リファクタ',
+        '統合',
+        '移行',
+        'マイグレーション',
+        '最適化',
+        'refactor',
+        'integrate',
+        'migrate',
+        'migration',
+        'optimize',
+        'implement',
+        '実装',
+    ],
+    medium: [
+        '修正',
+        '更新',
+        '変更',
+        '追加',
+        '作成',
+        'fix',
+        'update',
+        'change',
+        'add',
+        'create',
+        'modify',
+    ],
+    simple: [
+        '確認',
+        'レビュー',
+        'チェック',
+        '読む',
+        '返信',
+        'confirm',
+        'review',
+        'check',
+        'read',
+        'reply',
+        'send',
+        '送信',
+    ],
+};
+// Dependency indicator keywords
+const DEPENDENCY_KEYWORDS = {
+    before: ['前に', '先に', 'まず', 'before', 'first', 'prior to'],
+    after: ['後に', '次に', 'その後', 'after', 'then', 'following'],
+    requires: ['必要', '依存', 'requires', 'depends on', 'needs'],
+};
+export class TaskSplitter {
+    /**
+     * Split input text into individual tasks
+     * Requirement: 11.1, 11.4
+     */
+    static splitTasks(input) {
+        const tasks = [];
+        const lines = this.splitIntoLines(input);
+        if (lines.length === 1 && !this.containsMultipleTasks(input)) {
+            // Single task - check if it needs complexity-based splitting
+            const task = { title: input.trim() };
+            const complexity = this.analyzeComplexity(task);
+            if (complexity.isComplex && complexity.suggestedSplits) {
+                return {
+                    originalInput: input,
+                    splitTasks: complexity.suggestedSplits,
+                    splitReason: complexity.reasoning,
+                    recommendedOrder: complexity.suggestedSplits.map((_, i) => i),
+                    dependencies: this.inferDependencies(complexity.suggestedSplits),
+                };
+            }
+            return {
+                originalInput: input,
+                splitTasks: [task],
+                splitReason: 'シンプルなタスクのため分割不要',
+                recommendedOrder: [0],
+                dependencies: [],
+            };
+        }
+        // Multiple lines/tasks detected
+        for (const line of lines) {
+            const trimmed = line.trim();
+            if (trimmed) {
+                tasks.push({ title: trimmed });
+            }
+        }
+        const dependencies = this.inferDependencies(tasks);
+        const recommendedOrder = this.calculateRecommendedOrder(tasks, dependencies);
+        return {
+            originalInput: input,
+            splitTasks: tasks,
+            splitReason: `${tasks.length}個のタスクを検出しました`,
+            recommendedOrder,
+            dependencies,
+        };
+    }
+    /**
+     * Analyze task complexity
+     * Requirement: 11.2, 11.3
+     */
+    static analyzeComplexity(task) {
+        const text = `${task.title} ${task.description ?? ''}`.toLowerCase();
+        // Check for project-level complexity
+        if (COMPLEXITY_KEYWORDS.project.some((k) => text.includes(k.toLowerCase()))) {
+            return {
+                isComplex: true,
+                complexity: 'project',
+                suggestedSplits: this.suggestProjectSplits(task),
+                reasoning: 'プロジェクトレベルのタスクです。複数のフェーズに分割することを推奨します。',
+            };
+        }
+        // Check for complex tasks
+        if (COMPLEXITY_KEYWORDS.complex.some((k) => text.includes(k.toLowerCase()))) {
+            return {
+                isComplex: true,
+                complexity: 'complex',
+                suggestedSplits: this.suggestComplexSplits(task),
+                reasoning: '複雑なタスクです。より小さなステップに分割することを推奨します。',
+            };
+        }
+        // Check for medium tasks
+        if (COMPLEXITY_KEYWORDS.medium.some((k) => text.includes(k.toLowerCase()))) {
+            return {
+                isComplex: false,
+                complexity: 'medium',
+                reasoning: '中程度の複雑さのタスクです。そのまま実行可能です。',
+            };
+        }
+        // Simple task
+        return {
+            isComplex: false,
+            complexity: 'simple',
+            reasoning: 'シンプルなタスクです。分割は不要です。',
+        };
+    }
+    /**
+     * Split input into individual lines/items
+     */
+    static splitIntoLines(input) {
+        // First, try to split by bullet points or numbered lists
+        const bulletSplit = input.split(/(?:^|\n)\s*[-•*]\s+/).filter(Boolean);
+        if (bulletSplit.length > 1) {
+            return bulletSplit.map((s) => s.trim());
+        }
+        const numberedSplit = input.split(/(?:^|\n)\s*\d+[.)]\s+/).filter(Boolean);
+        if (numberedSplit.length > 1) {
+            return numberedSplit.map((s) => s.trim());
+        }
+        // Try splitting by Japanese conjunctions
+        const conjunctionSplit = input.split(/(?:そして|また|さらに|加えて|それから)/);
+        if (conjunctionSplit.length > 1) {
+            return conjunctionSplit.map((s) => s.trim()).filter(Boolean);
+        }
+        // Split by newlines
+        const newlineSplit = input.split('\n').filter((s) => s.trim());
+        if (newlineSplit.length > 1) {
+            return newlineSplit;
+        }
+        return [input];
+    }
+    /**
+     * Check if input contains multiple tasks
+     */
+    static containsMultipleTasks(input) {
+        return MULTI_TASK_PATTERNS.some((pattern) => {
+            const matches = input.match(pattern);
+            return matches && matches.length > 1;
+        });
+    }
+    /**
+     * Suggest splits for project-level tasks
+     */
+    static suggestProjectSplits(task) {
+        return [
+            {
+                title: `${task.title} - 要件定義と計画`,
+                order: 0,
+                status: 'not_started',
+            },
+            {
+                title: `${task.title} - 設計とアーキテクチャ`,
+                order: 1,
+                status: 'not_started',
+            },
+            {
+                title: `${task.title} - 実装`,
+                order: 2,
+                status: 'not_started',
+            },
+            {
+                title: `${task.title} - テストと検証`,
+                order: 3,
+                status: 'not_started',
+            },
+            {
+                title: `${task.title} - デプロイとドキュメント`,
+                order: 4,
+                status: 'not_started',
+            },
+        ];
+    }
+    /**
+     * Suggest splits for complex tasks
+     */
+    static suggestComplexSplits(task) {
+        return [
+            {
+                title: `${task.title} - 調査と準備`,
+                order: 0,
+                status: 'not_started',
+            },
+            {
+                title: `${task.title} - 実装`,
+                order: 1,
+                status: 'not_started',
+            },
+            {
+                title: `${task.title} - 確認とテスト`,
+                order: 2,
+                status: 'not_started',
+            },
+        ];
+    }
+    /**
+     * Infer dependencies between tasks
+     * Requirement: 11.5
+     */
+    static inferDependencies(tasks) {
+        const dependencies = [];
+        for (let i = 0; i < tasks.length; i++) {
+            const task = tasks[i];
+            const text = `${task.title} ${task.description ?? ''}`.toLowerCase();
+            const dependsOn = [];
+            // Check for explicit dependency keywords
+            for (const [type, keywords] of Object.entries(DEPENDENCY_KEYWORDS)) {
+                if (keywords.some((k) => text.includes(k.toLowerCase()))) {
+                    if (type === 'after' && i > 0) {
+                        dependsOn.push(i - 1);
+                    }
+                    if (type === 'requires' && i > 0) {
+                        // Look for references to previous tasks
+                        for (let j = 0; j < i; j++) {
+                            const prevTitle = tasks[j].title.toLowerCase();
+                            if (text.includes(prevTitle.substring(0, 10))) {
+                                dependsOn.push(j);
+                            }
+                        }
+                    }
+                }
+            }
+            if (dependsOn.length > 0) {
+                dependencies.push({
+                    taskIndex: i,
+                    dependsOn,
+                    type: 'sequential',
+                });
+            }
+        }
+        // If no explicit dependencies found, assume sequential order
+        if (dependencies.length === 0 && tasks.length > 1) {
+            for (let i = 1; i < tasks.length; i++) {
+                dependencies.push({
+                    taskIndex: i,
+                    dependsOn: [i - 1],
+                    type: 'sequential',
+                });
+            }
+        }
+        return dependencies;
+    }
+    /**
+     * Calculate recommended execution order
+     * Requirement: 11.6
+     */
+    static calculateRecommendedOrder(tasks, dependencies) {
+        const order = [];
+        const completed = new Set();
+        // Note: Circular dependencies cannot occur with current inferDependencies
+        // implementation as it only references previous tasks
+        while (order.length < tasks.length) {
+            for (let i = 0; i < tasks.length; i++) {
+                if (completed.has(i))
+                    continue;
+                const dep = dependencies.find((d) => d.taskIndex === i);
+                if (!dep || dep.dependsOn.every((d) => completed.has(d))) {
+                    order.push(i);
+                    completed.add(i);
+                }
+            }
+        }
+        return order;
+    }
+}
+//# sourceMappingURL=task-splitter.js.map