@zowe/cli 8.36.1 → 8.37.0

package/node_modules/{domutils/lib/querying.js → sanitize-html/node_modules/domutils/src/querying.ts}

@@ -1,12 +1,11 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.filter = filter;
-exports.find = find;
-exports.findOneChild = findOneChild;
-exports.findOne = findOne;
-exports.existsOne = existsOne;
-exports.findAll = findAll;
-var domhandler_1 = require("domhandler");
+import {
+    type AnyNode,
+    type Element,
+    hasChildren,
+    isTag,
+    type ParentNode,
+} from "domhandler";
+
 /**
  * Search a node and its children for nodes passing a test function. If `node` is not an array, it will be wrapped in one.
  *
@@ -17,11 +16,15 @@ var domhandler_1 = require("domhandler");
  * @param limit Maximum number of nodes to return.
  * @returns All nodes passing `test`.
  */
-function filter(test, node, recurse, limit) {
-    if (recurse === void 0) { recurse = true; }
-    if (limit === void 0) { limit = Infinity; }
+export function filter(
+    test: (element: AnyNode) => boolean,
+    node: AnyNode | AnyNode[],
+    recurse = true,
+    limit: number = Number.POSITIVE_INFINITY,
+): AnyNode[] {
     return find(test, Array.isArray(node) ? node : [node], recurse, limit);
 }
+
 /**
  * Search an array of nodes and their children for nodes passing a test function.
  *
@@ -32,12 +35,18 @@ function filter(test, node, recurse, limit) {
  * @param limit Maximum number of nodes to return.
  * @returns All nodes passing `test`.
  */
-function find(test, nodes, recurse, limit) {
-    var result = [];
+export function find(
+    test: (element: AnyNode) => boolean,
+    nodes: AnyNode[] | ParentNode,
+    recurse: boolean,
+    limit: number,
+): AnyNode[] {
+    const result: AnyNode[] = [];
     /** Stack of the arrays we are looking at. */
-    var nodeStack = [Array.isArray(nodes) ? nodes : [nodes]];
+    const nodeStack: AnyNode[][] = [Array.isArray(nodes) ? nodes : [nodes]];
     /** Stack of the indices within the arrays. */
-    var indexStack = [0];
+    const indexStack = [0];
+
     for (;;) {
         // First, check if the current array has any more elements to look at.
         if (indexStack[0] >= nodeStack[0].length) {
@@ -45,40 +54,33 @@ function find(test, nodes, recurse, limit) {
             if (indexStack.length === 1) {
                 return result;
             }
+
             // Otherwise, remove the current array from the stack.
             nodeStack.shift();
             indexStack.shift();
+
             // Loop back to the start to continue with the next array.
             continue;
         }
-        var elem = nodeStack[0][indexStack[0]++];
-        if (test(elem)) {
-            result.push(elem);
-            if (--limit <= 0)
-                return result;
+
+        const element = nodeStack[0][indexStack[0]++];
+
+        if (test(element)) {
+            result.push(element);
+            if (--limit <= 0) return result;
         }
-        if (recurse && (0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {
+
+        if (recurse && hasChildren(element) && element.children.length > 0) {
             /*
              * Add the children to the stack. We are depth-first, so this is
              * the next array we look at.
              */
             indexStack.unshift(0);
-            nodeStack.unshift(elem.children);
+            nodeStack.unshift(element.children);
         }
     }
 }
-/**
- * Finds the first element inside of an array that matches a test function. This is an alias for `Array.prototype.find`.
- *
- * @category Querying
- * @param test Function to test nodes on.
- * @param nodes Array of nodes to search.
- * @returns The first node in the array that passes `test`.
- * @deprecated Use `Array.prototype.find` directly.
- */
-function findOneChild(test, nodes) {
-    return nodes.find(test);
-}
+
 /**
  * Finds one element in a tree that passes a test.
  *
@@ -88,22 +90,25 @@ function findOneChild(test, nodes) {
  * @param recurse Also consider child nodes.
  * @returns The first node that passes `test`.
  */
-function findOne(test, nodes, recurse) {
-    if (recurse === void 0) { recurse = true; }
-    var searchedNodes = Array.isArray(nodes) ? nodes : [nodes];
-    for (var i = 0; i < searchedNodes.length; i++) {
-        var node = searchedNodes[i];
-        if ((0, domhandler_1.isTag)(node) && test(node)) {
+export function findOne(
+    test: (element: Element) => boolean,
+    nodes: AnyNode[] | ParentNode,
+    recurse = true,
+): Element | null {
+    const searchedNodes = Array.isArray(nodes) ? nodes : [nodes];
+    for (const node of searchedNodes) {
+        if (isTag(node) && test(node)) {
             return node;
         }
-        if (recurse && (0, domhandler_1.hasChildren)(node) && node.children.length > 0) {
-            var found = findOne(test, node.children, true);
-            if (found)
-                return found;
+        if (recurse && hasChildren(node) && node.children.length > 0) {
+            const found = findOne(test, node.children, true);
+            if (found) return found;
         }
     }
+
     return null;
 }
+
 /**
  * Checks if a tree of nodes contains at least one node passing a test.
  *
@@ -112,12 +117,17 @@ function findOne(test, nodes, recurse) {
  * @param nodes Array of nodes to search.
  * @returns Whether a tree of nodes contains at least one node passing the test.
  */
-function existsOne(test, nodes) {
-    return (Array.isArray(nodes) ? nodes : [nodes]).some(function (node) {
-        return ((0, domhandler_1.isTag)(node) && test(node)) ||
-            ((0, domhandler_1.hasChildren)(node) && existsOne(test, node.children));
-    });
+export function existsOne(
+    test: (element: Element) => boolean,
+    nodes: AnyNode[] | ParentNode,
+): boolean {
+    return (Array.isArray(nodes) ? nodes : [nodes]).some(
+        (node) =>
+            (isTag(node) && test(node)) ||
+            (hasChildren(node) && existsOne(test, node.children)),
+    );
 }
+
 /**
  * Search an array of nodes and their children for elements passing a test function.
  *
@@ -128,28 +138,35 @@ function existsOne(test, nodes) {
  * @param nodes Array of nodes to search.
  * @returns All nodes passing `test`.
  */
-function findAll(test, nodes) {
-    var result = [];
-    var nodeStack = [Array.isArray(nodes) ? nodes : [nodes]];
-    var indexStack = [0];
+export function findAll(
+    test: (element: Element) => boolean,
+    nodes: AnyNode[] | ParentNode,
+): Element[] {
+    const result = [];
+    const nodeStack = [Array.isArray(nodes) ? nodes : [nodes]];
+    const indexStack = [0];
+
     for (;;) {
         if (indexStack[0] >= nodeStack[0].length) {
             if (nodeStack.length === 1) {
                 return result;
             }
+
             // Otherwise, remove the current array from the stack.
             nodeStack.shift();
             indexStack.shift();
+
             // Loop back to the start to continue with the next array.
             continue;
         }
-        var elem = nodeStack[0][indexStack[0]++];
-        if ((0, domhandler_1.isTag)(elem) && test(elem))
-            result.push(elem);
-        if ((0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {
+
+        const element = nodeStack[0][indexStack[0]++];
+
+        if (isTag(element) && test(element)) result.push(element);
+
+        if (hasChildren(element) && element.children.length > 0) {
             indexStack.unshift(0);
-            nodeStack.unshift(elem.children);
+            nodeStack.unshift(element.children);
         }
     }
 }
-//# sourceMappingURL=querying.js.map

package/node_modules/sanitize-html/node_modules/domutils/src/stringify.ts

@@ -0,0 +1,90 @@
+import renderHTML, { type DomSerializerOptions } from "dom-serializer";
+import { ElementType } from "domelementtype";
+import {
+    type AnyNode,
+    hasChildren,
+    isCDATA,
+    isComment,
+    isTag,
+    isText,
+} from "domhandler";
+
+/**
+ * @category Stringify
+ * @deprecated Use the `dom-serializer` module directly.
+ * @param node Node to get the outer HTML of.
+ * @param options Options for serialization.
+ * @returns `node`'s outer HTML.
+ */
+export function getOuterHTML(
+    node: AnyNode | ArrayLike<AnyNode>,
+    options?: DomSerializerOptions,
+): string {
+    return renderHTML(node, options);
+}
+
+/**
+ * @category Stringify
+ * @deprecated Use the `dom-serializer` module directly.
+ * @param node Node to get the inner HTML of.
+ * @param options Options for serialization.
+ * @returns `node`'s inner HTML.
+ */
+export function getInnerHTML(
+    node: AnyNode,
+    options?: DomSerializerOptions,
+): string {
+    return hasChildren(node)
+        ? node.children.map((node) => getOuterHTML(node, options)).join("")
+        : "";
+}
+
+/**
+ * Get a node's inner text. Same as `textContent`, but inserts newlines for `<br>` tags. Ignores comments.
+ *
+ * @category Stringify
+ * @deprecated Use `textContent` instead.
+ * @param node Node to get the inner text of.
+ * @returns `node`'s inner text.
+ */
+export function getText(node: AnyNode | AnyNode[]): string {
+    if (Array.isArray(node)) return node.map(getText).join("");
+    if (isTag(node)) return node.name === "br" ? "\n" : getText(node.children);
+    if (isCDATA(node)) return getText(node.children);
+    if (isText(node)) return node.data;
+    return "";
+}
+
+/**
+ * Get a node's text content. Ignores comments.
+ *
+ * @category Stringify
+ * @param node Node to get the text content of.
+ * @returns `node`'s text content.
+ * @see {@link https://developer.mozilla.org/en-US/docs/Web/API/Node/textContent}
+ */
+export function textContent(node: AnyNode | AnyNode[]): string {
+    if (Array.isArray(node)) return node.map(textContent).join("");
+    if (hasChildren(node) && !isComment(node)) {
+        return textContent(node.children);
+    }
+    if (isText(node)) return node.data;
+    return "";
+}
+
+/**
+ * Get a node's inner text, ignoring `<script>` and `<style>` tags. Ignores comments.
+ *
+ * @category Stringify
+ * @param node Node to get the inner text of.
+ * @returns `node`'s inner text.
+ * @see {@link https://developer.mozilla.org/en-US/docs/Web/API/Node/innerText}
+ */
+export function innerText(node: AnyNode | AnyNode[]): string {
+    if (Array.isArray(node)) return node.map(innerText).join("");
+    if (hasChildren(node) && (node.type === ElementType.Tag || isCDATA(node))) {
+        return innerText(node.children);
+    }
+    if (isText(node)) return node.data;
+    return "";
+}

package/node_modules/sanitize-html/node_modules/domutils/src/traversal.ts

@@ -0,0 +1,132 @@
+import {
+    type AnyNode,
+    type ChildNode,
+    type Element,
+    hasChildren,
+    isTag,
+    type ParentNode,
+} from "domhandler";
+
+/**
+ * Get a node's children.
+ *
+ * @category Traversal
+ * @param element Node to get the children of.
+ * @returns `element`'s children, or an empty array.
+ */
+export function getChildren(element: AnyNode): ChildNode[] {
+    return hasChildren(element) ? element.children : [];
+}
+
+/**
+ * Get a node's parent.
+ *
+ * @category Traversal
+ * @param element Node to get the parent of.
+ * @returns `element`'s parent node, or `null` if `element` is a root node.
+ */
+export function getParent(element: AnyNode): ParentNode | null;
+export function getParent(element: AnyNode): ParentNode | null {
+    return element.parent || null;
+}
+
+/**
+ * Gets an elements siblings, including the element itself.
+ *
+ * Attempts to get the children through the element's parent first. If we don't
+ * have a parent (the element is a root node), we walk the element's `prev` &
+ * `next` to get all remaining nodes.
+ *
+ * @category Traversal
+ * @param element Element to get the siblings of.
+ * @returns `element`'s siblings, including `element`.
+ */
+export function getSiblings(element: AnyNode): AnyNode[] {
+    const parent = getParent(element);
+    if (parent != null) return getChildren(parent);
+
+    const siblings = [element];
+    let { prev, next } = element;
+    while (prev != null) {
+        siblings.unshift(prev);
+        ({ prev } = prev);
+    }
+    while (next != null) {
+        siblings.push(next);
+        ({ next } = next);
+    }
+    return siblings;
+}
+
+/**
+ * Gets an attribute from an element.
+ *
+ * @category Traversal
+ * @param element Element to check.
+ * @param name Attribute name to retrieve.
+ * @returns The element's attribute value, or `undefined`.
+ */
+export function getAttributeValue(
+    element: Element,
+    name: string,
+): string | undefined {
+    const { attribs } = element as {
+        attribs?: Record<string, string | undefined>;
+    };
+    return attribs?.[name];
+}
+
+/**
+ * Checks whether an element has an attribute.
+ *
+ * @category Traversal
+ * @param element Element to check.
+ * @param name Attribute name to look for.
+ * @returns Returns whether `element` has the attribute `name`.
+ */
+export function hasAttrib(element: Element, name: string): boolean {
+    const { attribs } = element as { attribs?: Record<string, string | null> };
+    return (
+        attribs != null && Object.hasOwn(attribs, name) && attribs[name] != null
+    );
+}
+
+/**
+ * Get the tag name of an element.
+ *
+ * @category Traversal
+ * @param element The element to get the name for.
+ * @returns The tag name of `element`.
+ */
+export function getName(element: Element): string {
+    return element.name;
+}
+
+/**
+ * Returns the next element sibling of a node.
+ *
+ * @category Traversal
+ * @param element The element to get the next sibling of.
+ * @returns `element`'s next sibling that is a tag, or `null` if there is no next
+ * sibling.
+ */
+export function nextElementSibling(element: AnyNode): Element | null {
+    let { next } = element;
+    while (next !== null && !isTag(next)) ({ next } = next);
+    return next;
+}
+
+/**
+ * Returns the previous element sibling of a node.
+ *
+ * @category Traversal
+ * @param element The element to get the previous sibling of.
+ * @returns `element`'s previous sibling that is a tag, or `null` if there is no
+ * previous sibling.
+ */
+// eslint-disable-next-line unicorn/prevent-abbreviations -- Keep public API name for backwards compatibility.
+export function prevElementSibling(element: AnyNode): Element | null {
+    let { prev } = element;
+    while (prev !== null && !isTag(prev)) ({ prev } = prev);
+    return prev;
+}

package/node_modules/sanitize-html/node_modules/entities/dist/decode-codepoint.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Replace the given code point with U+FFFD if it is NUL (0), a surrogate, or
+ * outside the valid Unicode range. Code points in the C1 controls range
+ * (128–159) are remapped to their Windows-1252 equivalents, following the
+ * HTML spec. All other code points are returned unchanged.
+ * @param codePoint Unicode code point to convert.
+ */
+export declare function replaceCodePoint(codePoint: number): number;
+/**
+ * XML numeric character references are the referenced Unicode code point.
+ * Invalid values still become U+FFFD; the HTML Windows-1252 C1 remap is not
+ * applied.
+ * @see https://www.w3.org/TR/xml/#NT-CharRef
+ * @param codePoint Unicode code point to convert.
+ */
+export declare function replaceCodePointXML(codePoint: number): number;
+/**
+ * Convert the code point of a decoded numeric entity to a string, replacing
+ * invalid values.
+ *
+ * Fast path for plain BMP code points: [1..0x7F] and [0xA0..0xD7FF] pass
+ * `replaceCodePoint` unchanged (no NUL, C1 remap, surrogate, or out-of-range
+ * handling) and fit a single charCode. 0xd760 = 0xD800 (the first surrogate)
+ * - 0xA0.
+ * @param codePoint Unicode code point to convert.
+ */
+export declare function codePointToString(codePoint: number): string;
+//# sourceMappingURL=decode-codepoint.d.ts.map

package/node_modules/sanitize-html/node_modules/entities/dist/decode-codepoint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decode-codepoint.d.ts","sourceRoot":"","sources":["../src/decode-codepoint.ts"],"names":[],"mappings":"AAwBA;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAU1D;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAI3D"}

package/node_modules/sanitize-html/node_modules/entities/dist/decode-codepoint.js

@@ -0,0 +1,61 @@
+// Adapted from https://github.com/mathiasbynens/he/blob/36afe179392226cf1b6ccdb16ebbb7a5a844d93a/src/he.js#L106-L134
+/**
+ * C1 Unicode control character reference replacements (code points 128–159).
+ * Index i gives the replacement for code point 128+i; 0 means "no replacement".
+ */
+const c1 = [
+    8364, 0, 8218, 402, 8222, 8230, 8224, 8225, 710, 8240, 352, 8249, 338, 0,
+    381, 0, 0, 8216, 8217, 8220, 8221, 8226, 8211, 8212, 732, 8482, 353, 8250,
+    339, 0, 382, 376,
+];
+/**
+ * True for NUL, UTF-16 surrogates, and values past U+10FFFF.
+ * @param codePoint Unicode code point to check.
+ */
+function isInvalidCodePoint(codePoint) {
+    return (codePoint === 0 ||
+        (codePoint >= 0xd8_00 && codePoint <= 0xdf_ff) ||
+        codePoint > 0x10_ff_ff);
+}
+/**
+ * Replace the given code point with U+FFFD if it is NUL (0), a surrogate, or
+ * outside the valid Unicode range. Code points in the C1 controls range
+ * (128–159) are remapped to their Windows-1252 equivalents, following the
+ * HTML spec. All other code points are returned unchanged.
+ * @param codePoint Unicode code point to convert.
+ */
+export function replaceCodePoint(codePoint) {
+    if (isInvalidCodePoint(codePoint)) {
+        return 0xff_fd;
+    }
+    if (codePoint >= 128 && codePoint <= 159) {
+        return c1[codePoint - 128] || codePoint;
+    }
+    return codePoint;
+}
+/**
+ * XML numeric character references are the referenced Unicode code point.
+ * Invalid values still become U+FFFD; the HTML Windows-1252 C1 remap is not
+ * applied.
+ * @see https://www.w3.org/TR/xml/#NT-CharRef
+ * @param codePoint Unicode code point to convert.
+ */
+export function replaceCodePointXML(codePoint) {
+    return isInvalidCodePoint(codePoint) ? 0xff_fd : codePoint;
+}
+/**
+ * Convert the code point of a decoded numeric entity to a string, replacing
+ * invalid values.
+ *
+ * Fast path for plain BMP code points: [1..0x7F] and [0xA0..0xD7FF] pass
+ * `replaceCodePoint` unchanged (no NUL, C1 remap, surrogate, or out-of-range
+ * handling) and fit a single charCode. 0xd760 = 0xD800 (the first surrogate)
+ * - 0xA0.
+ * @param codePoint Unicode code point to convert.
+ */
+export function codePointToString(codePoint) {
+    return (codePoint - 1) >>> 0 < 0x7f || (codePoint - 0xa0) >>> 0 < 0xd7_60
+        ? String.fromCharCode(codePoint)
+        : String.fromCodePoint(replaceCodePoint(codePoint));
+}
+//# sourceMappingURL=decode-codepoint.js.map

package/node_modules/sanitize-html/node_modules/entities/dist/decode-codepoint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decode-codepoint.js","sourceRoot":"","sources":["../src/decode-codepoint.ts"],"names":[],"mappings":"AAAA,qHAAqH;AAErH;;;GAGG;AACH,MAAM,EAAE,GAAa;IACjB,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;IACxE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI;IACzE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG;CACnB,CAAC;AAEF;;;GAGG;AACH,SAAS,kBAAkB,CAAC,SAAiB;IACzC,OAAO,CACH,SAAS,KAAK,CAAC;QACf,CAAC,SAAS,IAAI,OAAO,IAAI,SAAS,IAAI,OAAO,CAAC;QAC9C,SAAS,GAAG,UAAU,CACzB,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,SAAiB;IAC9C,IAAI,kBAAkB,CAAC,SAAS,CAAC,EAAE,CAAC;QAChC,OAAO,OAAO,CAAC;IACnB,CAAC;IAED,IAAI,SAAS,IAAI,GAAG,IAAI,SAAS,IAAI,GAAG,EAAE,CAAC;QACvC,OAAO,EAAE,CAAC,SAAS,GAAG,GAAG,CAAC,IAAI,SAAS,CAAC;IAC5C,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,SAAiB;IACjD,OAAO,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;AAC/D,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAAC,SAAiB;IAC/C,OAAO,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO;QACrE,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC;QAChC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC,CAAC;AAC5D,CAAC"}