@mtkruto/node 0.1.289 → 0.1.299

package/script/deps/deno.land/x/html_parser@v0.1.3/src/utils/traversal.js

@@ -0,0 +1,112 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.prevElementSibling = exports.nextElementSibling = exports.getName = exports.hasAttrib = exports.getAttributeValue = exports.getSiblings = exports.getParent = exports.getChildren = void 0;
+const Node_js_1 = require("../Node.js");
+const emptyArray = [];
+/**
+ * Get a node's children.
+ *
+ * @param elem Node to get the children of.
+ * @returns `elem`'s children, or an empty array.
+ */
+function getChildren(elem) {
+    return elem.children ?? emptyArray;
+}
+exports.getChildren = getChildren;
+/**
+ * Get a node's parent.
+ *
+ * @param elem Node to get the parent of.
+ * @returns `elem`'s parent node.
+ */
+function getParent(elem) {
+    return elem.parent || null;
+}
+exports.getParent = getParent;
+/**
+ * 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.
+ *
+ * @param elem Element to get the siblings of.
+ * @returns `elem`'s siblings.
+ */
+function getSiblings(elem) {
+    const parent = getParent(elem);
+    if (parent != null)
+        return getChildren(parent);
+    const siblings = [elem];
+    let { prev, next } = elem;
+    while (prev != null) {
+        siblings.unshift(prev);
+        ({ prev } = prev);
+    }
+    while (next != null) {
+        siblings.push(next);
+        ({ next } = next);
+    }
+    return siblings;
+}
+exports.getSiblings = getSiblings;
+/**
+ * Gets an attribute from an element.
+ *
+ * @param elem Element to check.
+ * @param name Attribute name to retrieve.
+ * @returns The element's attribute value, or `undefined`.
+ */
+function getAttributeValue(elem, name) {
+    return elem.attribs?.[name];
+}
+exports.getAttributeValue = getAttributeValue;
+/**
+ * Checks whether an element has an attribute.
+ *
+ * @param elem Element to check.
+ * @param name Attribute name to look for.
+ * @returns Returns whether `elem` has the attribute `name`.
+ */
+function hasAttrib(elem, name) {
+    return (elem.attribs != null &&
+        Object.prototype.hasOwnProperty.call(elem.attribs, name) &&
+        elem.attribs[name] != null);
+}
+exports.hasAttrib = hasAttrib;
+/**
+ * Get the tag name of an element.
+ *
+ * @param elem The element to get the name for.
+ * @returns The tag name of `elem`.
+ */
+function getName(elem) {
+    return elem.name;
+}
+exports.getName = getName;
+/**
+ * Returns the next element sibling of a node.
+ *
+ * @param elem The element to get the next sibling of.
+ * @returns `elem`'s next sibling that is a tag.
+ */
+function nextElementSibling(elem) {
+    let { next } = elem;
+    while (next !== null && !(0, Node_js_1.isTag)(next))
+        ({ next } = next);
+    return next;
+}
+exports.nextElementSibling = nextElementSibling;
+/**
+ * Returns the previous element sibling of a node.
+ *
+ * @param elem The element to get the previous sibling of.
+ * @returns `elem`'s previous sibling that is a tag.
+ */
+function prevElementSibling(elem) {
+    let { prev } = elem;
+    while (prev !== null && !(0, Node_js_1.isTag)(prev))
+        ({ prev } = prev);
+    return prev;
+}
+exports.prevElementSibling = prevElementSibling;

package/script/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/deflate.d.ts

@@ -24,4 +24,6 @@ export declare class Deflate {
     constructor(options?: DeflateOptions);
     push(data: Uint8Array, mode: boolean | number): Uint8Array;
 }
+export declare function deflate(input: Uint8Array, options?: DeflateOptions): Uint8Array;
+export declare function deflateRaw(input: Uint8Array, options?: DeflateOptions): Uint8Array;
 export declare function gzip(input: Uint8Array, options?: DeflateOptions): Uint8Array;

package/script/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/deflate.js

@@ -26,7 +26,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.gzip = exports.Deflate = void 0;
+exports.gzip = exports.deflateRaw = exports.deflate = exports.Deflate = void 0;
 // from https://github.com/nodeca/pako
 const zlibDeflate = __importStar(require("./zlib/deflate.js"));
 const uint8_js_1 = require("../utils/uint8.js");
@@ -159,6 +159,12 @@ function deflate(input, options = {}) {
         throw deflator.msg || messages_js_1.message[deflator.err];
     return result;
 }
+exports.deflate = deflate;
+function deflateRaw(input, options = {}) {
+    options.raw = true;
+    return deflate(input, options);
+}
+exports.deflateRaw = deflateRaw;
 function gzip(input, options = {}) {
     options.gzip = true;
     return deflate(input, options);

package/script/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/inflate.d.ts

@@ -18,6 +18,6 @@ export declare class Inflate {
     constructor(options: InflateOptions);
     push(data: Uint8Array, mode: boolean | number): Uint8Array;
 }
-declare function inflate(input: Uint8Array, options?: InflateOptions): Uint8Array;
+export declare function inflate(input: Uint8Array, options?: InflateOptions): Uint8Array;
+export declare function inflateRaw(input: Uint8Array, options?: InflateOptions): Uint8Array;
 export declare const gunzip: typeof inflate;
-export {};

package/script/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/inflate.js

@@ -26,7 +26,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.gunzip = exports.Inflate = void 0;
+exports.gunzip = exports.inflateRaw = exports.inflate = exports.Inflate = void 0;
 // from https://github.com/nodeca/pako
 const uint8_js_1 = require("../utils/uint8.js");
 const zlibInflate = __importStar(require("./zlib/inflate.js"));
@@ -199,4 +199,10 @@ function inflate(input, options = {}) {
         throw inflator.msg || messages_js_1.message[inflator.err];
     return result;
 }
+exports.inflate = inflate;
+function inflateRaw(input, options = {}) {
+    options.raw = true;
+    return inflate(input, options);
+}
+exports.inflateRaw = inflateRaw;
 exports.gunzip = inflate;

package/script/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/crc32.js

@@ -8,7 +8,7 @@ function makeTable() {
     for (let n = 0; n < 256; n++) {
         c = n;
         for (let k = 0; k < 8; k++) {
-            c = (c & 1) ? (m ^ (c >>> 1)) : (c >>> 1);
+            c = ((c & 1) ? (m ^ (c >>> 1)) : (c >>> 1));
         }
         table[n] = c;
     }

package/script/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/deflate.js

@@ -82,7 +82,7 @@ const MAX_BITS = 15;
 /* All codes must not exceed MAX_BITS bits */
 const MIN_MATCH = 3;
 const MAX_MATCH = 258;
-const MIN_LOOKAHEAD = MAX_MATCH + MIN_MATCH + 1;
+const MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);
 const PRESET_DICT = 0x20;
 const INIT_STATE = 42;
 const EXTRA_STATE = 69;
@@ -101,7 +101,7 @@ function err(strm, errorCode) {
     return errorCode;
 }
 function rank(f) {
-    return (f << 1) - (f > 4 ? 9 : 0);
+    return ((f) << 1) - ((f) > 4 ? 9 : 0);
 }
 function zero(buf) {
     buf.fill(0, 0, buf.length);
@@ -132,7 +132,7 @@ function flush_pending(strm) {
     }
 }
 function flush_block_only(s, last) {
-    trees._tr_flush_block(s, s.block_start >= 0 ? s.block_start : -1, s.strstart - s.block_start, last);
+    trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);
     s.block_start = s.strstart;
     flush_pending(s.strm);
 }
@@ -320,13 +320,13 @@ function fill_window(s) {
             p = n;
             do {
                 m = s.head[--p];
-                s.head[p] = m >= _w_size ? m - _w_size : 0;
+                s.head[p] = (m >= _w_size ? m - _w_size : 0);
             } while (--n);
             n = _w_size;
             p = n;
             do {
                 m = s.prev[--p];
-                s.prev[p] = m >= _w_size ? m - _w_size : 0;
+                s.prev[p] = (m >= _w_size ? m - _w_size : 0);
                 /* If n is not on any hash chain, prev[n] is garbage but
                  * its value will never be used.
                  */
@@ -607,7 +607,7 @@ function deflate_fast(s, flush) {
             /***/
         }
     }
-    s.insert = (s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1;
+    s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);
     if (flush === status_js_1.default.Z_FINISH) {
         /*** FLUSH_BLOCK(s, 1); ***/
         flush_block_only(s, true);
@@ -1467,7 +1467,7 @@ function deflateResetKeep(strm) {
         s.wrap = -s.wrap;
         /* was made negative by deflate(..., Z_FINISH); */
     }
-    s.status = s.wrap ? INIT_STATE : BUSY_STATE;
+    s.status = (s.wrap ? INIT_STATE : BUSY_STATE);
     strm.adler = (s.wrap === 2)
         ? 0 // crc32(0, Z_NULL, 0)
         : 1; // adler32(0, Z_NULL, 0)
@@ -1630,7 +1630,7 @@ function deflate(strm, flush) {
             else {
                 level_flags = 3;
             }
-            header |= level_flags << 6;
+            header |= (level_flags << 6);
             if (s.strstart !== 0)
                 header |= PRESET_DICT;
             header += 31 - (header % 31);

package/script/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/inffast.js

@@ -315,8 +315,8 @@ function inflate_fast(strm, start) {
     /* update state and return */
     strm.next_in = _in;
     strm.next_out = _out;
-    strm.avail_in = _in < last ? 5 + (last - _in) : 5 - (_in - last);
-    strm.avail_out = _out < end ? 257 + (end - _out) : 257 - (_out - end);
+    strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));
+    strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));
     state.hold = hold;
     state.bits = bits;
     return;

package/script/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/inflate.js

@@ -630,7 +630,7 @@ function inflate(strm, flush) {
                     break;
                 }
                 if (state.head) {
-                    state.head.text = (hold >> 8) & 1;
+                    state.head.text = ((hold >> 8) & 1);
                 }
                 if (state.flags & 0x0200) {
                     //=== CRC2(state.check, hold);
@@ -684,8 +684,8 @@ function inflate(strm, flush) {
                 }
                 //===//
                 if (state.head) {
-                    state.head.xflags = hold & 0xff;
-                    state.head.os = hold >> 8;
+                    state.head.xflags = (hold & 0xff);
+                    state.head.os = (hold >> 8);
                 }
                 if (state.flags & 0x0200) {
                     //=== CRC2(state.check, hold);
@@ -841,7 +841,7 @@ function inflate(strm, flush) {
                     //===//
                 }
                 if (state.head) {
-                    state.head.hcrc = (state.flags >> 9) & 1;
+                    state.head.hcrc = ((state.flags >> 9) & 1);
                     state.head.done = true;
                 }
                 strm.adler = state.check = 0;
@@ -901,7 +901,7 @@ function inflate(strm, flush) {
                     bits += 8;
                 }
                 //===//
-                state.last = hold & 0x01 /*BITS(1)*/;
+                state.last = (hold & 0x01) /*BITS(1)*/;
                 //--- DROPBITS(1) ---//
                 hold >>>= 1;
                 bits -= 1;
@@ -1041,7 +1041,7 @@ function inflate(strm, flush) {
                         bits += 8;
                     }
                     //===//
-                    state.lens[order[state.have++]] = hold & 0x07; //BITS(3);
+                    state.lens[order[state.have++]] = (hold & 0x07); //BITS(3);
                     //--- DROPBITS(3) ---//
                     hold >>>= 3;
                     bits -= 3;
@@ -1076,7 +1076,7 @@ function inflate(strm, flush) {
                         here_bits = here >>> 24;
                         here_op = (here >>> 16) & 0xff;
                         here_val = here & 0xffff;
-                        if (here_bits <= bits)
+                        if ((here_bits) <= bits)
                             break;
                         //--- PULLBYTE() ---//
                         if (have === 0)
@@ -1350,7 +1350,7 @@ function inflate(strm, flush) {
                     here_bits = here >>> 24;
                     here_op = (here >>> 16) & 0xff;
                     here_val = here & 0xffff;
-                    if (here_bits <= bits)
+                    if ((here_bits) <= bits)
                         break;
                     //--- PULLBYTE() ---//
                     if (have === 0)
@@ -1399,7 +1399,7 @@ function inflate(strm, flush) {
                     break;
                 }
                 state.offset = here_val;
-                state.extra = here_op & 15;
+                state.extra = (here_op) & 15;
                 state.mode = DISTEXT;
             /* falls through */
             case DISTEXT:
@@ -1510,12 +1510,11 @@ function inflate(strm, flush) {
                     strm.total_out += _out;
                     state.total += _out;
                     if (_out) {
-                        strm.adler =
-                            state.check =
-                                /*UPDATE(state.check, put - _out, _out);*/
-                                state.flags
-                                    ? (0, crc32_js_1.crc32)(state.check, output, _out, put - _out)
-                                    : (0, adler32_js_1.default)(state.check, output, _out, put - _out);
+                        strm.adler = state.check =
+                            /*UPDATE(state.check, put - _out, _out);*/
+                            (state.flags
+                                ? (0, crc32_js_1.crc32)(state.check, output, _out, put - _out)
+                                : (0, adler32_js_1.default)(state.check, output, _out, put - _out));
                     }
                     _out = left;
                     // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too
@@ -1598,12 +1597,11 @@ function inflate(strm, flush) {
     strm.total_out += _out;
     state.total += _out;
     if (state.wrap && _out) {
-        strm.adler =
-            state
-                .check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
-                state.flags
-                    ? (0, crc32_js_1.crc32)(state.check, output, _out, strm.next_out - _out)
-                    : (0, adler32_js_1.default)(state.check, output, _out, strm.next_out - _out);
+        strm.adler = state
+            .check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
+            (state.flags
+                ? (0, crc32_js_1.crc32)(state.check, output, _out, strm.next_out - _out)
+                : (0, adler32_js_1.default)(state.check, output, _out, strm.next_out - _out));
     }
     strm.data_type = state.bits + (state.last ? 64 : 0) +
         (state.mode === TYPE ? 128 : 0) +

package/script/deps/raw.githubusercontent.com/MTKruto/compress/main/zlib/zlib/trees.js

@@ -264,7 +264,7 @@ function d_code(dist) {
 function put_short(s, w) {
     //    put_byte(s, (uch)((w) & 0xff));
     //    put_byte(s, (uch)((ush)(w) >> 8));
-    s.pending_buf[s.pending++] = w & 0xff;
+    s.pending_buf[s.pending++] = (w) & 0xff;
     s.pending_buf[s.pending++] = (w >>> 8) & 0xff;
 }
 /* ===========================================================================
@@ -699,7 +699,7 @@ function build_tree(s, desc) {
      * two codes of non zero frequency.
      */
     while (s.heap_len < 2) {
-        node = s.heap[++s.heap_len] = max_code < 2 ? ++max_code : 0;
+        node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);
         tree[node * 2] /*.Freq*/ = 1;
         s.depth[node] = 0;
         s.opt_len--;
@@ -712,7 +712,7 @@ function build_tree(s, desc) {
     /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
      * establish sub-heaps of increasing lengths:
      */
-    for (n = s.heap_len >> 1 /*int /2*/; n >= 1; n--)
+    for (n = (s.heap_len >> 1 /*int /2*/); n >= 1; n--)
         pqdownheap(s, tree, n);
     /* Construct the Huffman tree by repeatedly combining the least two
      * frequent nodes.