claude-flow-novice 1.6.4 → 1.6.5

package/.claude-flow-novice/dist/src/coordination/archives/v2-sdk-typescript/v2/core/topic-manager.js

@@ -0,0 +1,337 @@
+/**
+ * Agent Coordination V2 - Topic Manager
+ *
+ * Efficient topic pattern matching with wildcard support for message routing.
+ * Implements O(log n) pattern matching using a radix tree (trie) structure.
+ *
+ * Supported wildcards:
+ * - `*` - Matches single level (e.g., "agent.*" matches "agent.status" but not "agent.status.online")
+ * - `**` - Matches multiple levels (e.g., "agent.**" matches "agent.status.online")
+ *
+ * @module coordination/v2/core/topic-manager
+ */ /**
+ * Topic Manager - Efficient wildcard pattern matching for message routing.
+ *
+ * Performance:
+ * - register(): O(m) where m is pattern length
+ * - deregister(): O(m) where m is pattern length
+ * - match(): O(log n) where n is number of registered patterns
+ *
+ * @example
+ * ```typescript
+ * const manager = new TopicManager();
+ *
+ * // Register patterns
+ * const id1 = manager.register('task.*');
+ * const id2 = manager.register('agent.**');
+ * const id3 = manager.register('task.completed');
+ *
+ * // Match topics
+ * manager.match('task.completed'); // Returns [id1, id3]
+ * manager.match('agent.status.online'); // Returns [id2]
+ * manager.match('unmatched'); // Returns []
+ * ```
+ */ export class TopicManager {
+    /** Root node of the pattern tree */ root;
+    /** Pattern registrations by ID */ registrations;
+    /** Match statistics */ stats;
+    /** Next registration ID counter */ nextId;
+    constructor(){
+        this.root = this.createNode('', null);
+        this.registrations = new Map();
+        this.stats = {
+            totalMatches: 0,
+            totalMatchTime: 0
+        };
+        this.nextId = 1;
+    }
+    /**
+   * Registers a topic pattern for matching.
+   *
+   * @param pattern - Topic pattern (supports *, **)
+   * @returns Unique registration ID
+   *
+   * @example
+   * ```typescript
+   * const id = manager.register('task.*.completed');
+   * ```
+   */ register(pattern) {
+        if (!pattern || typeof pattern !== 'string') {
+            throw new Error('Pattern must be a non-empty string');
+        }
+        const id = `topic-${this.nextId++}`;
+        const segments = this.parsePattern(pattern);
+        // Build pattern tree
+        let currentNode = this.root;
+        for(let i = 0; i < segments.length; i++){
+            const segment = segments[i];
+            const wildcard = this.getWildcardType(segment);
+            if (!currentNode.children.has(segment)) {
+                currentNode.children.set(segment, this.createNode(segment, wildcard));
+            }
+            currentNode = currentNode.children.get(segment);
+        }
+        // Add subscription ID to final node
+        currentNode.subscriptionIds.add(id);
+        currentNode.pattern = pattern;
+        // Store registration
+        this.registrations.set(id, {
+            id,
+            pattern,
+            createdAt: Date.now(),
+            matchCount: 0
+        });
+        return id;
+    }
+    /**
+   * Deregisters a topic pattern.
+   *
+   * @param id - Registration ID from register()
+   * @returns True if deregistered, false if ID not found
+   *
+   * @example
+   * ```typescript
+   * const id = manager.register('task.*');
+   * manager.deregister(id); // true
+   * manager.deregister(id); // false (already removed)
+   * ```
+   */ deregister(id) {
+        const registration = this.registrations.get(id);
+        if (!registration) {
+            return false;
+        }
+        const segments = this.parsePattern(registration.pattern);
+        this.removeFromTree(this.root, segments, id, 0);
+        this.registrations.delete(id);
+        return true;
+    }
+    /**
+   * Matches a topic against all registered patterns.
+   * Returns all registration IDs that match the topic.
+   *
+   * @param topic - Topic to match (e.g., "task.completed")
+   * @returns Array of registration IDs that match
+   *
+   * @example
+   * ```typescript
+   * const ids = manager.match('task.completed');
+   * // Returns: ['topic-1', 'topic-5']
+   * ```
+   */ match(topic) {
+        const startTime = performance.now();
+        if (!topic || typeof topic !== 'string') {
+            return [];
+        }
+        const segments = this.parsePattern(topic);
+        const matchedIds = new Set();
+        this.matchRecursive(this.root, segments, 0, matchedIds);
+        // Update statistics
+        const endTime = performance.now();
+        this.stats.totalMatches++;
+        this.stats.totalMatchTime += endTime - startTime;
+        // Update match counts
+        for (const id of Array.from(matchedIds)){
+            const registration = this.registrations.get(id);
+            if (registration) {
+                registration.matchCount++;
+            }
+        }
+        return Array.from(matchedIds);
+    }
+    /**
+   * Gets all registered patterns.
+   *
+   * @returns Array of topic registrations
+   */ getRegistrations() {
+        return Array.from(this.registrations.values());
+    }
+    /**
+   * Gets a specific registration by ID.
+   *
+   * @param id - Registration ID
+   * @returns Registration or undefined if not found
+   */ getRegistration(id) {
+        return this.registrations.get(id);
+    }
+    /**
+   * Gets topic matching statistics.
+   *
+   * @returns Statistics object
+   */ getStats() {
+        const patterns = Array.from(this.registrations.values());
+        // Count by wildcard type
+        const patternsByWildcard = {
+            exact: 0,
+            single: 0,
+            multi: 0
+        };
+        for (const reg of patterns){
+            if (reg.pattern.includes('**')) {
+                patternsByWildcard.multi++;
+            } else if (reg.pattern.includes('*')) {
+                patternsByWildcard.single++;
+            } else {
+                patternsByWildcard.exact++;
+            }
+        }
+        // Top patterns
+        const topPatterns = patterns.sort((a, b)=>b.matchCount - a.matchCount).slice(0, 10).map((reg)=>({
+                pattern: reg.pattern,
+                matchCount: reg.matchCount
+            }));
+        return {
+            totalPatterns: patterns.length,
+            totalMatches: this.stats.totalMatches,
+            avgMatchTimeMs: this.stats.totalMatches > 0 ? this.stats.totalMatchTime / this.stats.totalMatches : 0,
+            patternsByWildcard,
+            topPatterns
+        };
+    }
+    /**
+   * Clears all registrations and resets statistics.
+   */ clear() {
+        this.root = this.createNode('', null);
+        this.registrations.clear();
+        this.stats = {
+            totalMatches: 0,
+            totalMatchTime: 0
+        };
+        this.nextId = 1;
+    }
+    /**
+   * Creates a new pattern node.
+   */ createNode(segment, wildcard) {
+        return {
+            segment,
+            children: new Map(),
+            wildcard,
+            subscriptionIds: new Set(),
+            pattern: ''
+        };
+    }
+    /**
+   * Parses a pattern or topic into segments.
+   *
+   * @param pattern - Pattern string (e.g., "task.*.completed")
+   * @returns Array of segments (e.g., ["task", "*", "completed"])
+   */ parsePattern(pattern) {
+        return pattern.split('.').filter((s)=>s.length > 0);
+    }
+    /**
+   * Determines wildcard type for a segment.
+   *
+   * @param segment - Pattern segment
+   * @returns Wildcard type or null for exact match
+   */ getWildcardType(segment) {
+        if (segment === '**') {
+            return 'multi';
+        } else if (segment === '*') {
+            return 'single';
+        }
+        return null;
+    }
+    /**
+   * Recursively matches topic segments against pattern tree.
+   *
+   * @param node - Current pattern node
+   * @param segments - Topic segments to match
+   * @param index - Current segment index
+   * @param matchedIds - Accumulator for matched registration IDs
+   */ matchRecursive(node, segments, index, matchedIds) {
+        // If we've consumed all segments, collect subscription IDs
+        if (index >= segments.length) {
+            for (const id of Array.from(node.subscriptionIds)){
+                matchedIds.add(id);
+            }
+            return;
+        }
+        const segment = segments[index];
+        // 1. Try exact match
+        if (node.children.has(segment)) {
+            this.matchRecursive(node.children.get(segment), segments, index + 1, matchedIds);
+        }
+        // 2. Try single-level wildcard (*)
+        if (node.children.has('*')) {
+            this.matchRecursive(node.children.get('*'), segments, index + 1, matchedIds);
+        }
+        // 3. Try multi-level wildcard (**)
+        if (node.children.has('**')) {
+            const multiNode = node.children.get('**');
+            // Multi-level wildcard matches:
+            // - Current segment + continue matching (consumes one level)
+            // - Remaining segments (consumes all levels)
+            // - Zero segments (at end of topic)
+            // Match current segment and continue
+            for(let i = index; i <= segments.length; i++){
+                // Collect IDs if this is a terminal node
+                for (const id of Array.from(multiNode.subscriptionIds)){
+                    matchedIds.add(id);
+                }
+                // Continue matching children if segments remain
+                if (i < segments.length) {
+                    for (const [childSegment, childNode] of Array.from(multiNode.children.entries())){
+                        if (childSegment === segments[i] || childSegment === '*') {
+                            this.matchRecursive(childNode, segments, i + 1, matchedIds);
+                        }
+                    }
+                }
+            }
+        }
+    }
+    /**
+   * Removes a subscription ID from the pattern tree.
+   *
+   * @param node - Current node
+   * @param segments - Pattern segments
+   * @param id - Subscription ID to remove
+   * @param index - Current segment index
+   * @returns True if node should be removed (empty)
+   */ removeFromTree(node, segments, id, index) {
+        if (index >= segments.length) {
+            // Reached the end of the pattern, remove ID
+            node.subscriptionIds.delete(id);
+            return node.subscriptionIds.size === 0 && node.children.size === 0;
+        }
+        const segment = segments[index];
+        const childNode = node.children.get(segment);
+        if (!childNode) {
+            return false;
+        }
+        const shouldRemoveChild = this.removeFromTree(childNode, segments, id, index + 1);
+        if (shouldRemoveChild) {
+            node.children.delete(segment);
+        }
+        // Node can be removed if it has no subscriptions and no children
+        return node.subscriptionIds.size === 0 && node.children.size === 0;
+    }
+    /**
+   * Validates that the pattern tree is well-formed (for testing).
+   *
+   * @returns True if tree is valid
+   */ validateTree() {
+        return this.validateNode(this.root);
+    }
+    /**
+   * Recursively validates a pattern node.
+   */ validateNode(node) {
+        // Check wildcard consistency
+        if (node.wildcard) {
+            const expectedSegment = node.wildcard === 'single' ? '*' : '**';
+            if (node.segment !== expectedSegment && node.segment !== '') {
+                return false;
+            }
+        }
+        // Validate children
+        for (const [segment, childNode] of Array.from(node.children.entries())){
+            if (childNode.segment !== segment) {
+                return false;
+            }
+            if (!this.validateNode(childNode)) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+
+//# sourceMappingURL=topic-manager.js.map

package/.claude-flow-novice/dist/src/coordination/archives/v2-sdk-typescript/v2/core/topic-manager.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../src/coordination/archives/v2-sdk-typescript/v2/core/topic-manager.ts"],"names":["TopicManager","root","registrations","stats","nextId","createNode","Map","totalMatches","totalMatchTime","register","pattern","Error","id","segments","parsePattern","currentNode","i","length","segment","wildcard","getWildcardType","children","has","set","get","subscriptionIds","add","createdAt","Date","now","matchCount","deregister","registration","removeFromTree","delete","match","topic","startTime","performance","matchedIds","Set","matchRecursive","endTime","Array","from","getRegistrations","values","getRegistration","getStats","patterns","patternsByWildcard","exact","single","multi","reg","includes","topPatterns","sort","a","b","slice","map","totalPatterns","avgMatchTimeMs","clear","split","filter","s","node","index","multiNode","childSegment","childNode","entries","size","shouldRemoveChild","validateTree","validateNode","expectedSegment"],"mappings":"AAAA;;;;;;;;;;;CAWC,GAkED;;;;;;;;;;;;;;;;;;;;;;CAsBC,GACD,OAAO,MAAMA;IACX,kCAAkC,GAClC,AAAQC,KAAkB;IAE1B,gCAAgC,GAChC,AAAQC,cAA8C;IAEtD,qBAAqB,GACrB,AAAQC,MAGN;IAEF,iCAAiC,GACjC,AAAQC,OAAe;IAEvB,aAAc;QACZ,IAAI,CAACH,IAAI,GAAG,IAAI,CAACI,UAAU,CAAC,IAAI;QAChC,IAAI,CAACH,aAAa,GAAG,IAAII;QACzB,IAAI,CAACH,KAAK,GAAG;YACXI,cAAc;YACdC,gBAAgB;QAClB;QACA,IAAI,CAACJ,MAAM,GAAG;IAChB;IAEA;;;;;;;;;;GAUC,GACDK,SAASC,OAAe,EAAU;QAChC,IAAI,CAACA,WAAW,OAAOA,YAAY,UAAU;YAC3C,MAAM,IAAIC,MAAM;QAClB;QAEA,MAAMC,KAAK,CAAC,MAAM,EAAE,IAAI,CAACR,MAAM,IAAI;QACnC,MAAMS,WAAW,IAAI,CAACC,YAAY,CAACJ;QAEnC,qBAAqB;QACrB,IAAIK,cAAc,IAAI,CAACd,IAAI;QAE3B,IAAK,IAAIe,IAAI,GAAGA,IAAIH,SAASI,MAAM,EAAED,IAAK;YACxC,MAAME,UAAUL,QAAQ,CAACG,EAAE;YAC3B,MAAMG,WAAW,IAAI,CAACC,eAAe,CAACF;YAEtC,IAAI,CAACH,YAAYM,QAAQ,CAACC,GAAG,CAACJ,UAAU;gBACtCH,YAAYM,QAAQ,CAACE,GAAG,CAACL,SAAS,IAAI,CAACb,UAAU,CAACa,SAASC;YAC7D;YAEAJ,cAAcA,YAAYM,QAAQ,CAACG,GAAG,CAACN;QACzC;QAEA,oCAAoC;QACpCH,YAAYU,eAAe,CAACC,GAAG,CAACd;QAChCG,YAAYL,OAAO,GAAGA;QAEtB,qBAAqB;QACrB,IAAI,CAACR,aAAa,CAACqB,GAAG,CAACX,IAAI;YACzBA;YACAF;YACAiB,WAAWC,KAAKC,GAAG;YACnBC,YAAY;QACd;QAEA,OAAOlB;IACT;IAEA;;;;;;;;;;;;GAYC,GACDmB,WAAWnB,EAAU,EAAW;QAC9B,MAAMoB,eAAe,IAAI,CAAC9B,aAAa,CAACsB,GAAG,CAACZ;QAC5C,IAAI,CAACoB,cAAc;YACjB,OAAO;QACT;QAEA,MAAMnB,WAAW,IAAI,CAACC,YAAY,CAACkB,aAAatB,OAAO;QACvD,IAAI,CAACuB,cAAc,CAAC,IAAI,CAAChC,IAAI,EAAEY,UAAUD,IAAI;QAE7C,IAAI,CAACV,aAAa,CAACgC,MAAM,CAACtB;QAC1B,OAAO;IACT;IAEA;;;;;;;;;;;;GAYC,GACDuB,MAAMC,KAAa,EAAY;QAC7B,MAAMC,YAAYC,YAAYT,GAAG;QAEjC,IAAI,CAACO,SAAS,OAAOA,UAAU,UAAU;YACvC,OAAO,EAAE;QACX;QAEA,MAAMvB,WAAW,IAAI,CAACC,YAAY,CAACsB;QACnC,MAAMG,aAAa,IAAIC;QAEvB,IAAI,CAACC,cAAc,CAAC,IAAI,CAACxC,IAAI,EAAEY,UAAU,GAAG0B;QAE5C,oBAAoB;QACpB,MAAMG,UAAUJ,YAAYT,GAAG;QAC/B,IAAI,CAAC1B,KAAK,CAACI,YAAY;QACvB,IAAI,CAACJ,KAAK,CAACK,cAAc,IAAIkC,UAAUL;QAEvC,sBAAsB;QACtB,KAAK,MAAMzB,MAAM+B,MAAMC,IAAI,CAACL,YAAa;YACvC,MAAMP,eAAe,IAAI,CAAC9B,aAAa,CAACsB,GAAG,CAACZ;YAC5C,IAAIoB,cAAc;gBAChBA,aAAaF,UAAU;YACzB;QACF;QAEA,OAAOa,MAAMC,IAAI,CAACL;IACpB;IAEA;;;;GAIC,GACDM,mBAAwC;QACtC,OAAOF,MAAMC,IAAI,CAAC,IAAI,CAAC1C,aAAa,CAAC4C,MAAM;IAC7C;IAEA;;;;;GAKC,GACDC,gBAAgBnC,EAAU,EAAiC;QACzD,OAAO,IAAI,CAACV,aAAa,CAACsB,GAAG,CAACZ;IAChC;IAEA;;;;GAIC,GACDoC,WAAuB;QACrB,MAAMC,WAAWN,MAAMC,IAAI,CAAC,IAAI,CAAC1C,aAAa,CAAC4C,MAAM;QAErD,yBAAyB;QACzB,MAAMI,qBAAqB;YACzBC,OAAO;YACPC,QAAQ;YACRC,OAAO;QACT;QAEA,KAAK,MAAMC,OAAOL,SAAU;YAC1B,IAAIK,IAAI5C,OAAO,CAAC6C,QAAQ,CAAC,OAAO;gBAC9BL,mBAAmBG,KAAK;YAC1B,OAAO,IAAIC,IAAI5C,OAAO,CAAC6C,QAAQ,CAAC,MAAM;gBACpCL,mBAAmBE,MAAM;YAC3B,OAAO;gBACLF,mBAAmBC,KAAK;YAC1B;QACF;QAEA,eAAe;QACf,MAAMK,cAAcP,SACjBQ,IAAI,CAAC,CAACC,GAAGC,IAAMA,EAAE7B,UAAU,GAAG4B,EAAE5B,UAAU,EAC1C8B,KAAK,CAAC,GAAG,IACTC,GAAG,CAACP,CAAAA,MAAQ,CAAA;gBACX5C,SAAS4C,IAAI5C,OAAO;gBACpBoB,YAAYwB,IAAIxB,UAAU;YAC5B,CAAA;QAEF,OAAO;YACLgC,eAAeb,SAAShC,MAAM;YAC9BV,cAAc,IAAI,CAACJ,KAAK,CAACI,YAAY;YACrCwD,gBAAgB,IAAI,CAAC5D,KAAK,CAACI,YAAY,GAAG,IACtC,IAAI,CAACJ,KAAK,CAACK,cAAc,GAAG,IAAI,CAACL,KAAK,CAACI,YAAY,GACnD;YACJ2C;YACAM;QACF;IACF;IAEA;;GAEC,GACDQ,QAAc;QACZ,IAAI,CAAC/D,IAAI,GAAG,IAAI,CAACI,UAAU,CAAC,IAAI;QAChC,IAAI,CAACH,aAAa,CAAC8D,KAAK;QACxB,IAAI,CAAC7D,KAAK,GAAG;YACXI,cAAc;YACdC,gBAAgB;QAClB;QACA,IAAI,CAACJ,MAAM,GAAG;IAChB;IAEA;;GAEC,GACD,AAAQC,WAAWa,OAAe,EAAEC,QAAmC,EAAe;QACpF,OAAO;YACLD;YACAG,UAAU,IAAIf;YACda;YACAM,iBAAiB,IAAIe;YACrB9B,SAAS;QACX;IACF;IAEA;;;;;GAKC,GACD,AAAQI,aAAaJ,OAAe,EAAY;QAC9C,OAAOA,QAAQuD,KAAK,CAAC,KAAKC,MAAM,CAACC,CAAAA,IAAKA,EAAElD,MAAM,GAAG;IACnD;IAEA;;;;;GAKC,GACD,AAAQG,gBAAgBF,OAAe,EAA6B;QAClE,IAAIA,YAAY,MAAM;YACpB,OAAO;QACT,OAAO,IAAIA,YAAY,KAAK;YAC1B,OAAO;QACT;QACA,OAAO;IACT;IAEA;;;;;;;GAOC,GACD,AAAQuB,eACN2B,IAAiB,EACjBvD,QAAkB,EAClBwD,KAAa,EACb9B,UAAuB,EACjB;QACN,2DAA2D;QAC3D,IAAI8B,SAASxD,SAASI,MAAM,EAAE;YAC5B,KAAK,MAAML,MAAM+B,MAAMC,IAAI,CAACwB,KAAK3C,eAAe,EAAG;gBACjDc,WAAWb,GAAG,CAACd;YACjB;YACA;QACF;QAEA,MAAMM,UAAUL,QAAQ,CAACwD,MAAM;QAE/B,qBAAqB;QACrB,IAAID,KAAK/C,QAAQ,CAACC,GAAG,CAACJ,UAAU;YAC9B,IAAI,CAACuB,cAAc,CAAC2B,KAAK/C,QAAQ,CAACG,GAAG,CAACN,UAAWL,UAAUwD,QAAQ,GAAG9B;QACxE;QAEA,mCAAmC;QACnC,IAAI6B,KAAK/C,QAAQ,CAACC,GAAG,CAAC,MAAM;YAC1B,IAAI,CAACmB,cAAc,CAAC2B,KAAK/C,QAAQ,CAACG,GAAG,CAAC,MAAOX,UAAUwD,QAAQ,GAAG9B;QACpE;QAEA,mCAAmC;QACnC,IAAI6B,KAAK/C,QAAQ,CAACC,GAAG,CAAC,OAAO;YAC3B,MAAMgD,YAAYF,KAAK/C,QAAQ,CAACG,GAAG,CAAC;YAEpC,gCAAgC;YAChC,6DAA6D;YAC7D,6CAA6C;YAC7C,oCAAoC;YAEpC,qCAAqC;YACrC,IAAK,IAAIR,IAAIqD,OAAOrD,KAAKH,SAASI,MAAM,EAAED,IAAK;gBAC7C,yCAAyC;gBACzC,KAAK,MAAMJ,MAAM+B,MAAMC,IAAI,CAAC0B,UAAU7C,eAAe,EAAG;oBACtDc,WAAWb,GAAG,CAACd;gBACjB;gBAEA,gDAAgD;gBAChD,IAAII,IAAIH,SAASI,MAAM,EAAE;oBACvB,KAAK,MAAM,CAACsD,cAAcC,UAAU,IAAI7B,MAAMC,IAAI,CAAC0B,UAAUjD,QAAQ,CAACoD,OAAO,IAAK;wBAChF,IAAIF,iBAAiB1D,QAAQ,CAACG,EAAE,IAAIuD,iBAAiB,KAAK;4BACxD,IAAI,CAAC9B,cAAc,CAAC+B,WAAW3D,UAAUG,IAAI,GAAGuB;wBAClD;oBACF;gBACF;YACF;QACF;IACF;IAEA;;;;;;;;GAQC,GACD,AAAQN,eACNmC,IAAiB,EACjBvD,QAAkB,EAClBD,EAAU,EACVyD,KAAa,EACJ;QACT,IAAIA,SAASxD,SAASI,MAAM,EAAE;YAC5B,4CAA4C;YAC5CmD,KAAK3C,eAAe,CAACS,MAAM,CAACtB;YAC5B,OAAOwD,KAAK3C,eAAe,CAACiD,IAAI,KAAK,KAAKN,KAAK/C,QAAQ,CAACqD,IAAI,KAAK;QACnE;QAEA,MAAMxD,UAAUL,QAAQ,CAACwD,MAAM;QAC/B,MAAMG,YAAYJ,KAAK/C,QAAQ,CAACG,GAAG,CAACN;QAEpC,IAAI,CAACsD,WAAW;YACd,OAAO;QACT;QAEA,MAAMG,oBAAoB,IAAI,CAAC1C,cAAc,CAACuC,WAAW3D,UAAUD,IAAIyD,QAAQ;QAE/E,IAAIM,mBAAmB;YACrBP,KAAK/C,QAAQ,CAACa,MAAM,CAAChB;QACvB;QAEA,iEAAiE;QACjE,OAAOkD,KAAK3C,eAAe,CAACiD,IAAI,KAAK,KAAKN,KAAK/C,QAAQ,CAACqD,IAAI,KAAK;IACnE;IAEA;;;;GAIC,GACDE,eAAwB;QACtB,OAAO,IAAI,CAACC,YAAY,CAAC,IAAI,CAAC5E,IAAI;IACpC;IAEA;;GAEC,GACD,AAAQ4E,aAAaT,IAAiB,EAAW;QAC/C,6BAA6B;QAC7B,IAAIA,KAAKjD,QAAQ,EAAE;YACjB,MAAM2D,kBAAkBV,KAAKjD,QAAQ,KAAK,WAAW,MAAM;YAC3D,IAAIiD,KAAKlD,OAAO,KAAK4D,mBAAmBV,KAAKlD,OAAO,KAAK,IAAI;gBAC3D,OAAO;YACT;QACF;QAEA,oBAAoB;QACpB,KAAK,MAAM,CAACA,SAASsD,UAAU,IAAI7B,MAAMC,IAAI,CAACwB,KAAK/C,QAAQ,CAACoD,OAAO,IAAK;YACtE,IAAID,UAAUtD,OAAO,KAAKA,SAAS;gBACjC,OAAO;YACT;YACA,IAAI,CAAC,IAAI,CAAC2D,YAAY,CAACL,YAAY;gBACjC,OAAO;YACT;QACF;QAEA,OAAO;IACT;AACF"}