claude-flow 2.0.0-alpha.7 → 2.0.0-alpha.71

package/src/ui/extension/node_modules/cheerio/src/api/traversing.ts

@@ -3,7 +3,6 @@
  *
  * @module cheerio/traversing
  */
-
 import {
   isTag,
   type AnyNode,
@@ -25,7 +24,6 @@ import {
 } from 'domutils';
 import type { FilterFunction, AcceptedFilters } from '../types.js';
 const reSiblingSelector = /^\s*[+~]/;
-
 /**
  * Get the descendants of each element in the current set of matched elements,
  * filtered by a selector, jQuery object, or element.
@@ -51,22 +49,17 @@ export function find<T extends AnyNode>(
   if (!selectorOrHaystack) {
     return this._make([]);
   }
-
   if (typeof selectorOrHaystack !== 'string') {
     const haystack = isCheerio(selectorOrHaystack)
       ? selectorOrHaystack.toArray()
       : [selectorOrHaystack];
-
     const context = this.toArray();
-
     return this._make(
       haystack.filter((elem) => context.some((node) => contains(node, elem))),
     );
   }
-
   return this._findBySelector(selectorOrHaystack, Number.POSITIVE_INFINITY);
 }
-
 /**
  * Find elements by a specific selector.
  *
@@ -82,15 +75,12 @@ export function _findBySelector<T extends AnyNode>(
   limit: number,
 ): Cheerio<Element> {
   const context = this.toArray();
-
   const elems = reSiblingSelector.test(selector)
     ? context
     : this.children().toArray();
-
   const options = {
     context,
     root: this._root?.[0],
-
     // Pass options that are recognized by `cheerio-select`
     xmlMode: this.options.xmlMode,
     lowerCaseTags: this.options.lowerCaseTags,
@@ -98,10 +88,8 @@ export function _findBySelector<T extends AnyNode>(
     pseudos: this.options.pseudos,
     quirksMode: this.options.quirksMode,
   };
-
   return this._make(select.select(selector, elems, options, limit));
 }
-
 /**
  * Creates a matcher, using a particular mapping function. Matchers provide a
  * function that finds elements using a generating function, supporting
@@ -123,7 +111,6 @@ function _getMatcher<P>(
       selector?: AcceptedFilters<Element>,
     ): Cheerio<Element> {
       let matched: Element[] = matchMap(fn, this);
-
       if (selector) {
         matched = filterArray(
           matched,
@@ -132,7 +119,6 @@ function _getMatcher<P>(
           this._root?.[0],
         );
       }
-
       return this._make(
         // Post processing is only necessary if there is more than one element.
         this.length > 1 && matched.length > 1
@@ -142,24 +128,19 @@ function _getMatcher<P>(
     };
   };
 }
-
 /** Matcher that adds multiple elements for each entry in the input. */
 const _matcher = _getMatcher((fn: (elem: AnyNode) => Element[], elems) => {
   let ret: Element[] = [];
-
   for (let i = 0; i < elems.length; i++) {
     const value = fn(elems[i]);
     if (value.length > 0) ret = ret.concat(value);
   }
-
   return ret;
 });
-
 /** Matcher that adds at most one element for each entry in the input. */
 const _singleMatcher = _getMatcher(
   (fn: (elem: AnyNode) => Element | null, elems) => {
     const ret: Element[] = [];
-
     for (let i = 0; i < elems.length; i++) {
       const value = fn(elems[i]);
       if (value !== null) {
@@ -169,7 +150,6 @@ const _singleMatcher = _getMatcher(
     return ret;
   },
 );
-
 /**
  * Matcher that supports traversing until a condition is met.
  *
@@ -183,11 +163,9 @@ function _matchUntil(
 ) {
   // We use a variable here that is used from within the matcher.
   let matches: ((el: Element, i: number) => boolean) | null = null;
-
   const innerMatcher = _getMatcher(
     (nextElem: (elem: AnyNode) => Element | null, elems) => {
       const matched: Element[] = [];
-
 constructor(elems, (elem) => {
         for (let next; (next = nextElem(elem)); elem = next) {
           // FIXME: `matched` might contain duplicates here and the index is too large.
@@ -195,11 +173,9 @@ constructor(elems, (elem) => {
           (matched as any[]).push(next);
         }
       });
-
       return matched;
     },
   )(nextElem, ...postFns);
-
   return function <T extends AnyNode>(
     this: Cheerio<T>,
     selector?: AcceptedFilters<Element> | null,
@@ -212,20 +188,15 @@ constructor(elems, (elem) => {
         : selector
           ? getFilterFn(selector)
           : null;
-
     const ret = innerMatcher.call(this, filterSelector);
-
     // Set `matches` to `null`, so we don't waste memory.
     matches = null;
-
     return ret;
   };
 }
-
 function _removeDuplicates<T extends AnyNode>(elems: T[]): T[] {
   return elems.length > 1 ? Array.from(new Set<T>(elems)) : elems;
 }
-
 /**
  * Get the parent of each element in the current set of matched elements,
  * optionally filtered by a selector.
@@ -249,7 +220,6 @@ export const parent: <T extends AnyNode>(
   ({ parent }) => (parent && !isDocument(parent) ? (parent as Element) : null),
   _removeDuplicates,
 );
-
 /**
  * Get a set of parents filtered by `selector` of each element in the current
  * set of match elements.
@@ -283,7 +253,6 @@ export const parents: <T extends AnyNode>(
   uniqueSort,
   (elems) => elems.reverse(),
 );
-
 /**
  * Get the ancestors of each element in the current set of matched elements, up
  * to but not including the element matched by the selector, DOM node, or
@@ -311,7 +280,6 @@ export const parentsUntil: <T extends AnyNode>(
   uniqueSort,
   (elems) => elems.reverse(),
 );
-
 /**
  * For each element in the set, get the first element that matches the selector
  * by testing the element itself and traversing up through its ancestors in the
@@ -343,21 +311,17 @@ export function closest<T extends AnyNode>(
   selector?: AcceptedFilters<Element>,
 ): Cheerio<AnyNode> {
   const set: AnyNode[] = [];
-
   if (!selector) {
     return this._make(set);
   }
-
   const selectOpts = {
     xmlMode: this.options.xmlMode,
     root: this._root?.[0],
   };
-
   const selectFn =
     typeof selector === 'string'
       ? (elem: Element) => select.is(elem, selector, selectOpts)
       : getFilterFn(selector);
-
 constructor(this, (elem: AnyNode | null) => {
     if (elem && !isDocument(elem) && !isTag(elem)) {
       elem = elem.parent;
@@ -373,10 +337,8 @@ constructor(this, (elem: AnyNode | null) => {
       elem = elem.parent;
     }
   });
-
   return this._make(set);
 }
-
 /**
  * Gets the next sibling of each selected element, optionally filtered by a
  * selector.
@@ -397,7 +359,6 @@ export const next: <T extends AnyNode>(
   this: Cheerio<T>,
   selector?: AcceptedFilters<Element>,
 ) => Cheerio<Element> = _singleMatcher((elem) => nextElementSibling(elem));
-
 /**
  * Gets all the following siblings of the each selected element, optionally
  * filtered by a selector.
@@ -427,7 +388,6 @@ export const nextAll: <T extends AnyNode>(
   }
   return matched;
 }, _removeDuplicates);
-
 /**
  * Gets all the following siblings up to but not including the element matched
  * by the selector, optionally filtered by another selector.
@@ -453,7 +413,6 @@ export const nextUntil: <T extends AnyNode>(
   (el) => nextElementSibling(el),
   _removeDuplicates,
 );
-
 /**
  * Gets the previous sibling of each selected element optionally filtered by a
  * selector.
@@ -474,7 +433,6 @@ export const prev: <T extends AnyNode>(
   this: Cheerio<T>,
   selector?: AcceptedFilters<Element>,
 ) => Cheerio<Element> = _singleMatcher((elem) => prevElementSibling(elem));
-
 /**
  * Gets all the preceding siblings of each selected element, optionally filtered
  * by a selector.
@@ -505,7 +463,6 @@ export const prevAll: <T extends AnyNode>(
   }
   return matched;
 }, _removeDuplicates);
-
 /**
  * Gets all the preceding siblings up to but not including the element matched
  * by the selector, optionally filtered by another selector.
@@ -531,7 +488,6 @@ export const prevUntil: <T extends AnyNode>(
   (el) => prevElementSibling(el),
   _removeDuplicates,
 );
-
 /**
  * Get the siblings of each element (excluding the element) in the set of
  * matched elements, optionally filtered by a selector.
@@ -559,7 +515,6 @@ export const siblings: <T extends AnyNode>(
 constructor(elem).filter((el): el is Element => isTag(el) && el !== elem),
   uniqueSort,
 );
-
 /**
  * Gets the element children of each element in the set of matched elements.
  *
@@ -585,7 +540,6 @@ export const children: <T extends AnyNode>(
   (elem) => getChildren(elem).filter(isTag),
   _removeDuplicates,
 );
-
 /**
  * Gets the children of each element in the set of matched elements, including
  * text and comment nodes.
@@ -611,7 +565,6 @@ constructor(elem) ? newElems.concat(elem.children) : newElems,
   );
   return this._make(elems);
 }
-
 /**
  * Iterates over a cheerio object, executing a function for each matched
  * element. When the callback is fired, the function is fired in the context of
@@ -646,7 +599,6 @@ export function each<T>(
   while (i < len && fn.call(this[i], i, this[i]) !== false) ++i;
   return this;
 }
-
 /**
  * Pass each element in the current matched set through a function, producing a
  * new Cheerio object containing the return values. The function can return an
@@ -687,7 +639,6 @@ export function map<T, M>(
   }
   return this._make(elems);
 }
-
 /**
  * Creates a function to test if a filter is matched.
  *
@@ -707,7 +658,6 @@ function getFilterFn<T>(
     return match === el;
   };
 }
-
 /**
  * Iterates over a cheerio object, reducing the set of selector elements to
  * those that match the selector or pass the function's test.
@@ -783,7 +733,6 @@ export function filter<T>(
 constructor(this.toArray(), match, this.options.xmlMode, this._root?.[0]),
   );
 }
-
 export function filterArray<T>(
   nodes: T[],
   match: AcceptedFilters<T>,
@@ -794,7 +743,6 @@ export function filterArray<T>(
     ? select.filter(match, nodes as unknown as AnyNode[], { xmlMode, root })
     : nodes.filter(getFilterFn<T>(match));
 }
-
 /**
  * Checks the current list of elements and returns `true` if _any_ of the
  * elements match the selector. If using an element or Cheerio selection,
@@ -822,7 +770,6 @@ export function is<T>(
       ? nodes.some(getFilterFn<T>(selector))
       : false;
 }
-
 /**
  * Remove elements from the set of matched elements. Given a Cheerio object that
  * represents a set of DOM elements, the `.not()` method constructs a new
@@ -860,7 +807,6 @@ export function not<T extends AnyNode>(
   match: AcceptedFilters<T>,
 ): Cheerio<T> {
   let nodes = this.toArray();
-
   if (typeof match === 'string') {
     const matches = new Set<AnyNode>(select.filter(match, nodes, this.options));
     nodes = nodes.filter((el) => !matches.has(el));
@@ -868,10 +814,8 @@ export function not<T extends AnyNode>(
     const filterFn = getFilterFn(match);
     nodes = nodes.filter((el, i) => !filterFn(el, i));
   }
-
   return this._make(nodes);
 }
-
 /**
  * Filters the set of matched elements to only those which have the given DOM
  * element as a descendant or which have a descendant that matches the given
@@ -907,7 +851,6 @@ export function has(
       : (_, el) => this._make(el).find(selectorOrHaystack).length > 0,
   );
 }
-
 /**
  * Will select the first element of a cheerio object.
  *
@@ -925,7 +868,6 @@ export function has(
 export function first<T extends AnyNode>(this: Cheerio<T>): Cheerio<T> {
   return this.length > 1 ? this._make(this[0]) : this;
 }
-
 /**
  * Will select the last element of a cheerio object.
  *
@@ -943,7 +885,6 @@ export function first<T extends AnyNode>(this: Cheerio<T>): Cheerio<T> {
 export function last<T>(this: Cheerio<T>): Cheerio<T> {
   return this.length > 0 ? this._make(this[this.length - 1]) : this;
 }
-
 /**
  * Reduce the set of matched elements to the one at the specified index. Use
  * `.eq(-i)` to count backwards from the last selected element.
@@ -965,14 +906,11 @@ export function last<T>(this: Cheerio<T>): Cheerio<T> {
  */
 export function eq<T>(this: Cheerio<T>, i: number): Cheerio<T> {
   i = +i;
-
   // Use the first identity optimization if possible
   if (i === 0 && this.length <= 1) return this;
-
   if (i < 0) i = this.length + i;
   return this._make(this[i] ?? []);
 }
-
 /**
  * Retrieve one of the elements matched by the Cheerio object, at the `i`th
  * position.
@@ -1011,7 +949,6 @@ export function get<T>(this: Cheerio<T>, i?: number): T | T[] {
   }
   return this[i < 0 ? this.length + i : i];
 }
-
 /**
  * Retrieve all the DOM elements contained in the jQuery set as an array.
  *
@@ -1027,7 +964,6 @@ export function get<T>(this: Cheerio<T>, i?: number): T | T[] {
 export function toArray<T>(this: Cheerio<T>): T[] {
   return (Array.prototype as T[]).slice.call(this);
 }
-
 /**
  * Search for a given element from among the matched elements.
  *
@@ -1050,9 +986,8 @@ export function index<T extends AnyNode>(
   this: Cheerio<T>,
   selectorOrNeedle?: string | Cheerio<AnyNode> | AnyNode,
 ): number {
-  let $haystack: Cheerio<AnyNode>;
-  let needle: AnyNode;
-
+  let $haystack: Cheerio<AnyNode>; // TODO: Remove if unused
+  let needle: AnyNode; // TODO: Remove if unused
   if (selectorOrNeedle == null) {
     $haystack = this.parent().children();
     needle = this[0];
@@ -1066,10 +1001,8 @@ export function index<T extends AnyNode>(
       ? selectorOrNeedle[0]
       : selectorOrNeedle;
   }
-
   return Array.prototype.indexOf.call($haystack, needle);
 }
-
 /**
  * Gets the elements matching the specified range (0-based position).
  *
@@ -1099,7 +1032,6 @@ export function slice<T>(
 ): Cheerio<T> {
   return this._make<T>(Array.prototype.slice.call(this, start, end));
 }
-
 /**
  * End the most recent filtering operation in the current chain and return the
  * set of matched elements to its previous state.
@@ -1118,7 +1050,6 @@ export function slice<T>(
 export function end<T>(this: Cheerio<T>): Cheerio<AnyNode> {
   return (this.prevObject as Cheerio<AnyNode> | null) ?? this._make([]);
 }
-
 /**
  * Add elements to the set of matched elements.
  *
@@ -1144,7 +1075,6 @@ export function add<S extends AnyNode, T extends AnyNode>(
   const contents = uniqueSort([...this.get(), ...selection.get()]);
   return this._make(contents);
 }
-
 /**
  * Add the previous set of elements on the stack to the current set, optionally
  * filtered by a selector.
@@ -1170,4 +1100,4 @@ export function addBack<T extends AnyNode>(
         selector ? this.prevObject.filter(selector) : this.prevObject,
       )
     : this;
-}
+}

package/src/ui/extension/node_modules/cheerio/src/index.spec.ts

@@ -2,21 +2,17 @@ import { describe, it, expect, afterEach } from 'vitest';
 import * as cheerio from './index.js';
 import { Writable } from 'node:stream';
 import { createServer, type Server, type RequestListener } from 'node:http';
-
 function noop() {
   // Ignore
 }
-
 // Returns a promise and a resolve function
 function getPromise() {
-  let cb!: (error: Error | null | undefined, $: cheerio.CheerioAPI) => void;
+  let cb!: (_error: Error | null | undefined, $: cheerio.CheerioAPI) => void;
   const promise = new Promise<cheerio.CheerioAPI>((resolve, reject) => {
-    cb = (error, $) => (error ? reject(error) : resolve($));
+    cb = (_error, $) => (error ? reject(_error) : resolve($));
   });
-
   return { promise, cb };
 }
-
 const TEST_HTML = '<h1>Hello World</h1>';
 const TEST_HTML_UTF16 = Buffer.from(TEST_HTML, 'utf16le');
 const TEST_HTML_UTF16_BOM = Buffer.from([
@@ -25,111 +21,81 @@ const TEST_HTML_UTF16_BOM = Buffer.from([
   0xfe,
   ...Array.from(TEST_HTML_UTF16),
 ]);
-
 constructor('loadBuffer', () => {
 constructor('should parse UTF-8 HTML', () => {
     const $ = cheerio.loadBuffer(Buffer.from(TEST_HTML));
-
 constructor($.html()).toBe(
       `<html><head></head><body>${TEST_HTML}</body></html>`,
     );
   });
-
 constructor('should parse UTF-16 HTML', () => {
     const $ = cheerio.loadBuffer(TEST_HTML_UTF16_BOM);
-
 constructor($.html()).toBe(
       `<html><head></head><body>${TEST_HTML}</body></html>`,
     );
   });
 });
-
 constructor('stringStream', () => {
 constructor('should use parse5 by default', async () => {
     const { promise, cb } = getPromise();
     const stream = cheerio.stringStream({}, cb);
-
 constructor(stream).toBeInstanceOf(Writable);
-
     stream.end(TEST_HTML);
-
     const $ = await promise;
-
 constructor($.html()).toBe(
       `<html><head></head><body>${TEST_HTML}</body></html>`,
     );
   });
-
 constructor('should error from parse5 on buffer', () => {
     const stream = cheerio.stringStream({}, noop);
 constructor(stream).toBeInstanceOf(Writable);
-
 constructor(() => stream.write(Buffer.from(TEST_HTML))).toThrow(
       'Parser can work only with string streams.',
     );
   });
-
 constructor('should use htmlparser2 for XML', async () => {
     const { promise, cb } = getPromise();
     const stream = cheerio.stringStream({ xmlMode: true }, cb);
-
 constructor(stream).toBeInstanceOf(Writable);
-
     stream.end(TEST_HTML);
-
     const $ = await promise;
-
 constructor($.html()).toBe(TEST_HTML);
   });
 });
-
 constructor('decodeStream', () => {
 constructor('should use parse5 by default', async () => {
     const { promise, cb } = getPromise();
     const stream = cheerio.decodeStream({}, cb);
-
 constructor(stream).toBeInstanceOf(Writable);
-
     stream.end(TEST_HTML_UTF16_BOM);
-
     const $ = await promise;
-
 constructor($.html()).toBe(
       `<html><head></head><body>${TEST_HTML}</body></html>`,
     );
   });
-
 constructor('should use htmlparser2 for XML', async () => {
     const { promise, cb } = getPromise();
     const stream = cheerio.decodeStream({ xmlMode: true }, cb);
-
 constructor(stream).toBeInstanceOf(Writable);
-
     stream.end(TEST_HTML_UTF16_BOM);
-
     const $ = await promise;
-
 constructor($.html()).toBe(TEST_HTML);
   });
 });
-
 constructor('fromURL', () => {
-  let server: Server | undefined;
-
+  let server: Server | undefined; // TODO: Remove if unused
   function createTestServer(
     contentType: string,
     body: string | Buffer,
-    handler: RequestListener = (_req, res) => {
+    handler: RequestListener = (_req, _res) => {
       res.writeHead(200, { 'Content-Type': contentType });
       res.end(body);
     },
   ): Promise<number> {
     return new Promise((resolve, reject) => {
       server = createServer(handler);
-
       server.listen(0, () => {
         const address = server?.address();
-
         if (typeof address === 'string' || address == null) {
 constructor(new Error('Failed to get port'));
         } else {
@@ -138,7 +104,6 @@ constructor(address.port);
       });
     });
   }
-
 constructor(
     async () =>
       new Promise<void>((resolve, reject) => {
@@ -150,50 +115,41 @@ constructor();
         }
       }),
   );
-
 constructor('should fetch UTF-8 HTML', async () => {
     const port = await createTestServer('text/html', TEST_HTML);
     const $ = await cheerio.fromURL(`http://localhost:${port}`);
-
 constructor($.html()).toBe(
       `<html><head></head><body>${TEST_HTML}</body></html>`,
     );
   });
-
 constructor('should fetch UTF-16 HTML', async () => {
     const port = await createTestServer(
       'text/html; charset=utf-16le',
       TEST_HTML_UTF16,
     );
     const $ = await cheerio.fromURL(`http://localhost:${port}`);
-
 constructor($.html()).toBe(
       `<html><head></head><body>${TEST_HTML}</body></html>`,
     );
   });
-
 constructor('should parse XML based on Content-Type', async () => {
     const port = await createTestServer('text/xml', TEST_HTML);
     const $ = await cheerio.fromURL(`http://localhost:${port}`);
-
 constructor($.html()).toBe(TEST_HTML);
   });
-
 constructor('should throw on non-HTML/XML Content-Type', async () => {
     const port = await createTestServer('text/plain', TEST_HTML);
     await expect(cheerio.fromURL(`http://localhost:${port}`)).rejects.toThrow(
       'The content-type "text/plain" is neither HTML nor XML.',
     );
   });
-
 constructor('should throw on non-2xx responses', async () => {
-    const port = await createTestServer('text/html', TEST_HTML, (_, res) => {
+    const port = await createTestServer('text/html', TEST_HTML, (_, _res) => {
       res.writeHead(500);
       res.end();
     });
-
     await expect(cheerio.fromURL(`http://localhost:${port}`)).rejects.toThrow(
       'Response Error',
     );
   });
-});
+});