windmill-cli 1.641.0 → 1.643.0

package/esm/deps/jsr.io/@std/cli/1.0.0-rc.2/_run_length.js

@@ -1,34 +0,0 @@
-// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
-export function runLengthEncode(arr) {
-    const data = [];
-    const runLengths = [];
-    let prev = Symbol("none");
-    for (const x of arr) {
-        if (x === prev) {
-            ++runLengths[runLengths.length - 1];
-        }
-        else {
-            prev = x;
-            data.push(x);
-            runLengths.push(1);
-        }
-    }
-    for (const r of runLengths) {
-        if (r >= 0x100) {
-            throw new Error(`Run length too long: ${r}`);
-        }
-    }
-    return {
-        d: btoa(String.fromCharCode(...data)),
-        r: btoa(String.fromCharCode(...runLengths)),
-    };
-}
-export function runLengthDecode({ d, r }) {
-    const data = atob(d);
-    const runLengths = atob(r);
-    let out = "";
-    for (const [i, ch] of [...runLengths].entries()) {
-        out += data[i].repeat(ch.codePointAt(0));
-    }
-    return Uint8Array.from([...out].map((x) => x.codePointAt(0)));
-}

package/esm/deps/jsr.io/@std/cli/1.0.0-rc.2/unicode_width.js

@@ -1,74 +0,0 @@
-// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
-// This module is browser compatible.
-// Ported from unicode_width rust crate, Copyright (c) 2015 The Rust Project Developers. MIT license.
-import data from "./_data.js";
-import { runLengthDecode } from "./_run_length.js";
-let tables = null;
-function lookupWidth(cp) {
-    if (!tables)
-        tables = data.tables.map(runLengthDecode);
-    const t1Offset = tables[0][(cp >> 13) & 0xff];
-    const t2Offset = tables[1][128 * t1Offset + ((cp >> 6) & 0x7f)];
-    const packedWidths = tables[2][16 * t2Offset + ((cp >> 2) & 0xf)];
-    const width = (packedWidths >> (2 * (cp & 0b11))) & 0b11;
-    return width === 3 ? 1 : width;
-}
-const cache = new Map();
-function charWidth(char) {
-    if (cache.has(char))
-        return cache.get(char);
-    const codePoint = char.codePointAt(0);
-    let width = null;
-    if (codePoint < 0x7f) {
-        width = codePoint >= 0x20 ? 1 : codePoint === 0 ? 0 : null;
-    }
-    else if (codePoint >= 0xa0) {
-        width = lookupWidth(codePoint);
-    }
-    else {
-        width = null;
-    }
-    cache.set(char, width);
-    return width;
-}
-/**
- * Calculate the physical width of a string in a TTY-like environment. This is
- * useful for cases such as calculating where a line-wrap will occur and
- * underlining strings.
- *
- * The physical width is given by the number of columns required to display
- * the string. The number of columns a given unicode character occupies can
- * vary depending on the character itself.
- *
- * @param str The string to measure.
- * @returns The unicode width of the string.
- *
- * @example Calculating the unicode width of a string
- * ```ts
- * import { unicodeWidth } from "@std/cli/unicode-width";
- * import { assertEquals } from "@std/assert/assert-equals";
- *
- * assertEquals(unicodeWidth("hello world"), 11);
- * assertEquals(unicodeWidth("天地玄黃宇宙洪荒"), 16);
- * assertEquals(unicodeWidth("ｆｕｌｌｗｉｄｔｈ"), 18);
- * ```
- *
- * @example Calculating the unicode width of a color-encoded string
- * ```ts
- * import { unicodeWidth } from "@std/cli/unicode-width";
- * import { stripAnsiCode } from "@std/fmt/colors";
- * import { assertEquals } from "@std/assert/assert-equals";
- *
- * assertEquals(unicodeWidth(stripAnsiCode("\x1b[36mголубой\x1b[39m")), 7);
- * assertEquals(unicodeWidth(stripAnsiCode("\x1b[31m紅色\x1b[39m")), 4);
- * assertEquals(unicodeWidth(stripAnsiCode("\x1B]8;;https://deno.land\x07🦕\x1B]8;;\x07")), 2);
- * ```
- *
- * Use
- * {@linkcode https://jsr.io/@std/fmt/doc/colors/~/stripAnsiCode | stripAnsiCode}
- * to remove ANSI escape codes from a string before passing it to
- * {@linkcode unicodeWidth}.
- */
-export function unicodeWidth(str) {
-    return [...str].map((ch) => charWidth(ch) ?? 0).reduce((a, b) => a + b, 0);
-}

package/esm/deps/jsr.io/@std/encoding/1.0.0-rc.2/_validate_binary_like.js

@@ -1,26 +0,0 @@
-// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
-const encoder = new TextEncoder();
-function getTypeName(value) {
-    const type = typeof value;
-    if (type !== "object") {
-        return type;
-    }
-    else if (value === null) {
-        return "null";
-    }
-    else {
-        return value?.constructor?.name ?? "object";
-    }
-}
-export function validateBinaryLike(source) {
-    if (typeof source === "string") {
-        return encoder.encode(source);
-    }
-    else if (source instanceof Uint8Array) {
-        return source;
-    }
-    else if (source instanceof ArrayBuffer) {
-        return new Uint8Array(source);
-    }
-    throw new TypeError(`The input must be a Uint8Array, a string, or an ArrayBuffer. Received a value of the type ${getTypeName(source)}.`);
-}

package/esm/deps/jsr.io/@std/encoding/1.0.0-rc.2/base64.js

@@ -1,163 +0,0 @@
-// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
-// This module is browser compatible.
-/**
- * Utilities for
- * {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-4 | base64}
- * encoding and decoding.
- *
- * ```ts
- * import {
- *   encodeBase64,
- *   decodeBase64,
- * } from "@std/encoding/base64";
- * import { assertEquals } from "@std/assert/assert-equals";
- *
- * const foobar = new TextEncoder().encode("foobar");
- *
- * assertEquals(encodeBase64(foobar), "Zm9vYmFy");
- * assertEquals(decodeBase64("Zm9vYmFy"), foobar);
- * ```
- *
- * @module
- */
-import { validateBinaryLike } from "./_validate_binary_like.js";
-const base64abc = [
-    "A",
-    "B",
-    "C",
-    "D",
-    "E",
-    "F",
-    "G",
-    "H",
-    "I",
-    "J",
-    "K",
-    "L",
-    "M",
-    "N",
-    "O",
-    "P",
-    "Q",
-    "R",
-    "S",
-    "T",
-    "U",
-    "V",
-    "W",
-    "X",
-    "Y",
-    "Z",
-    "a",
-    "b",
-    "c",
-    "d",
-    "e",
-    "f",
-    "g",
-    "h",
-    "i",
-    "j",
-    "k",
-    "l",
-    "m",
-    "n",
-    "o",
-    "p",
-    "q",
-    "r",
-    "s",
-    "t",
-    "u",
-    "v",
-    "w",
-    "x",
-    "y",
-    "z",
-    "0",
-    "1",
-    "2",
-    "3",
-    "4",
-    "5",
-    "6",
-    "7",
-    "8",
-    "9",
-    "+",
-    "/",
-];
-/**
- * Converts data into a base64-encoded string.
- *
- * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-4}
- *
- * @param data The data to encode.
- * @returns The base64-encoded string.
- *
- * @example Usage
- * ```ts
- * import { encodeBase64 } from "@std/encoding/base64";
- * import { assertEquals } from "@std/assert/assert-equals";
- *
- * assertEquals(encodeBase64("foobar"), "Zm9vYmFy");
- * ```
- */
-export function encodeBase64(data) {
-    // CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727
-    const uint8 = validateBinaryLike(data);
-    let result = "";
-    let i;
-    const l = uint8.length;
-    for (i = 2; i < l; i += 3) {
-        result += base64abc[(uint8[i - 2]) >> 2];
-        result += base64abc[(((uint8[i - 2]) & 0x03) << 4) |
-            ((uint8[i - 1]) >> 4)];
-        result += base64abc[(((uint8[i - 1]) & 0x0f) << 2) |
-            ((uint8[i]) >> 6)];
-        result += base64abc[(uint8[i]) & 0x3f];
-    }
-    if (i === l + 1) {
-        // 1 octet yet to write
-        result += base64abc[(uint8[i - 2]) >> 2];
-        result += base64abc[((uint8[i - 2]) & 0x03) << 4];
-        result += "==";
-    }
-    if (i === l) {
-        // 2 octets yet to write
-        result += base64abc[(uint8[i - 2]) >> 2];
-        result += base64abc[(((uint8[i - 2]) & 0x03) << 4) |
-            ((uint8[i - 1]) >> 4)];
-        result += base64abc[((uint8[i - 1]) & 0x0f) << 2];
-        result += "=";
-    }
-    return result;
-}
-/**
- * Decodes a base64-encoded string.
- *
- * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-4}
- *
- * @param b64 The base64-encoded string to decode.
- * @returns The decoded data.
- *
- * @example Usage
- * ```ts
- * import { decodeBase64 } from "@std/encoding/base64";
- * import { assertEquals } from "@std/assert/assert-equals";
- *
- * assertEquals(
- *   decodeBase64("Zm9vYmFy"),
- *   new TextEncoder().encode("foobar")
- * );
- * ```
- */
-export function decodeBase64(b64) {
-    const binString = atob(b64);
-    const size = binString.length;
-    const bytes = new Uint8Array(size);
-    for (let i = 0; i < size; i++) {
-        bytes[i] = binString.charCodeAt(i);
-    }
-    return bytes;
-}

package/esm/deps/jsr.io/@std/encoding/1.0.4/_base32_common.js

@@ -1,183 +0,0 @@
-// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
-// Copyright (c) 2014 Jameson Little. MIT License.
-// This module is browser compatible.
-/**
- * common code for base32 and base32hex encodings.
- */
-import { validateBinaryLike } from "./_validate_binary_like.js";
-const placeHolderPadLookup = [0, 1, , 2, 3, , 4];
-function getPadLength(placeHoldersLen) {
-    const maybeLen = placeHolderPadLookup[placeHoldersLen];
-    if (typeof maybeLen !== "number") {
-        throw new Error("Invalid pad length");
-    }
-    return maybeLen;
-}
-function getLens(b32) {
-    const len = b32.length;
-    if (len % 8 > 0) {
-        throw new Error(`Cannot decode base32 string as the length must be a multiple of 8: received length ${len}`);
-    }
-    let validLen = b32.indexOf("=");
-    if (validLen === -1)
-        validLen = len;
-    const placeHoldersLen = validLen === len ? 0 : 8 - (validLen % 8);
-    return [validLen, placeHoldersLen];
-}
-function getByteLength(validLen, placeHoldersLen) {
-    return ((validLen + placeHoldersLen) * 5) / 8 - getPadLength(placeHoldersLen);
-}
-/**
- * Decodes an encoded string with the given lookup table.
- *
- * @param b32 The string to encode.
- * @param lookup The lookup table
- * @returns The encoded string.
- */
-export function decode(b32, lookup) {
-    const revLookup = [];
-    lookup.forEach((c, i) => (revLookup[c.charCodeAt(0)] = i));
-    let tmp;
-    const [validLen, placeHoldersLen] = getLens(b32);
-    const arr = new Uint8Array(getByteLength(validLen, placeHoldersLen));
-    let curByte = 0;
-    // if there are placeholders, only get up to the last complete 8 chars
-    const len = placeHoldersLen > 0 ? validLen - 8 : validLen;
-    let i;
-    for (i = 0; i < len; i += 8) {
-        tmp = (revLookup[b32.charCodeAt(i)] << 20) |
-            (revLookup[b32.charCodeAt(i + 1)] << 15) |
-            (revLookup[b32.charCodeAt(i + 2)] << 10) |
-            (revLookup[b32.charCodeAt(i + 3)] << 5) |
-            revLookup[b32.charCodeAt(i + 4)];
-        arr[curByte++] = (tmp >> 17) & 0xff;
-        arr[curByte++] = (tmp >> 9) & 0xff;
-        arr[curByte++] = (tmp >> 1) & 0xff;
-        tmp = ((tmp & 1) << 15) |
-            (revLookup[b32.charCodeAt(i + 5)] << 10) |
-            (revLookup[b32.charCodeAt(i + 6)] << 5) |
-            revLookup[b32.charCodeAt(i + 7)];
-        arr[curByte++] = (tmp >> 8) & 0xff;
-        arr[curByte++] = tmp & 0xff;
-    }
-    if (placeHoldersLen === 1) {
-        tmp = (revLookup[b32.charCodeAt(i)] << 20) |
-            (revLookup[b32.charCodeAt(i + 1)] << 15) |
-            (revLookup[b32.charCodeAt(i + 2)] << 10) |
-            (revLookup[b32.charCodeAt(i + 3)] << 5) |
-            revLookup[b32.charCodeAt(i + 4)];
-        arr[curByte++] = (tmp >> 17) & 0xff;
-        arr[curByte++] = (tmp >> 9) & 0xff;
-        arr[curByte++] = (tmp >> 1) & 0xff;
-        tmp = ((tmp & 1) << 7) |
-            (revLookup[b32.charCodeAt(i + 5)] << 2) |
-            (revLookup[b32.charCodeAt(i + 6)] >> 3);
-        arr[curByte++] = tmp & 0xff;
-    }
-    else if (placeHoldersLen === 3) {
-        tmp = (revLookup[b32.charCodeAt(i)] << 19) |
-            (revLookup[b32.charCodeAt(i + 1)] << 14) |
-            (revLookup[b32.charCodeAt(i + 2)] << 9) |
-            (revLookup[b32.charCodeAt(i + 3)] << 4) |
-            (revLookup[b32.charCodeAt(i + 4)] >> 1);
-        arr[curByte++] = (tmp >> 16) & 0xff;
-        arr[curByte++] = (tmp >> 8) & 0xff;
-        arr[curByte++] = tmp & 0xff;
-    }
-    else if (placeHoldersLen === 4) {
-        tmp = (revLookup[b32.charCodeAt(i)] << 11) |
-            (revLookup[b32.charCodeAt(i + 1)] << 6) |
-            (revLookup[b32.charCodeAt(i + 2)] << 1) |
-            (revLookup[b32.charCodeAt(i + 3)] >> 4);
-        arr[curByte++] = (tmp >> 8) & 0xff;
-        arr[curByte++] = tmp & 0xff;
-    }
-    else if (placeHoldersLen === 6) {
-        tmp = (revLookup[b32.charCodeAt(i)] << 3) |
-            (revLookup[b32.charCodeAt(i + 1)] >> 2);
-        arr[curByte++] = tmp & 0xff;
-    }
-    return arr;
-}
-function encodeChunk(uint8, start, end, lookup) {
-    let tmp;
-    const output = [];
-    for (let i = start; i < end; i += 5) {
-        tmp = ((uint8[i] << 16) & 0xff0000) |
-            ((uint8[i + 1] << 8) & 0xff00) |
-            (uint8[i + 2] & 0xff);
-        output.push(lookup[(tmp >> 19) & 0x1f]);
-        output.push(lookup[(tmp >> 14) & 0x1f]);
-        output.push(lookup[(tmp >> 9) & 0x1f]);
-        output.push(lookup[(tmp >> 4) & 0x1f]);
-        tmp = ((tmp & 0xf) << 16) |
-            ((uint8[i + 3] << 8) & 0xff00) |
-            (uint8[i + 4] & 0xff);
-        output.push(lookup[(tmp >> 15) & 0x1f]);
-        output.push(lookup[(tmp >> 10) & 0x1f]);
-        output.push(lookup[(tmp >> 5) & 0x1f]);
-        output.push(lookup[tmp & 0x1f]);
-    }
-    return output.join("");
-}
-/**
- * Encodes the given data using the lookup table.
- *
- * @param data The data to encode.
- * @param lookup The lookup table.
- * @returns The encoded string.
- */
-export function encode(data, lookup) {
-    const uint8 = validateBinaryLike(data);
-    let tmp;
-    const len = uint8.length;
-    const extraBytes = len % 5;
-    const parts = [];
-    const maxChunkLength = 16385; // must be multiple of 5
-    const len2 = len - extraBytes;
-    // go through the array every 5 bytes, we'll deal with trailing stuff later
-    for (let i = 0; i < len2; i += maxChunkLength) {
-        parts.push(encodeChunk(uint8, i, i + maxChunkLength > len2 ? len2 : i + maxChunkLength, lookup));
-    }
-    // pad the end with zeros, but make sure to not forget the extra bytes
-    if (extraBytes === 4) {
-        tmp = ((uint8[len2] & 0xff) << 16) |
-            ((uint8[len2 + 1] & 0xff) << 8) |
-            (uint8[len2 + 2] & 0xff);
-        parts.push(lookup[(tmp >> 19) & 0x1f]);
-        parts.push(lookup[(tmp >> 14) & 0x1f]);
-        parts.push(lookup[(tmp >> 9) & 0x1f]);
-        parts.push(lookup[(tmp >> 4) & 0x1f]);
-        tmp = ((tmp & 0xf) << 11) | (uint8[len2 + 3] << 3);
-        parts.push(lookup[(tmp >> 10) & 0x1f]);
-        parts.push(lookup[(tmp >> 5) & 0x1f]);
-        parts.push(lookup[tmp & 0x1f]);
-        parts.push("=");
-    }
-    else if (extraBytes === 3) {
-        tmp = ((uint8[len2] & 0xff) << 17) |
-            ((uint8[len2 + 1] & 0xff) << 9) |
-            ((uint8[len2 + 2] & 0xff) << 1);
-        parts.push(lookup[(tmp >> 20) & 0x1f]);
-        parts.push(lookup[(tmp >> 15) & 0x1f]);
-        parts.push(lookup[(tmp >> 10) & 0x1f]);
-        parts.push(lookup[(tmp >> 5) & 0x1f]);
-        parts.push(lookup[tmp & 0x1f]);
-        parts.push("===");
-    }
-    else if (extraBytes === 2) {
-        tmp = ((uint8[len2] & 0xff) << 12) | ((uint8[len2 + 1] & 0xff) << 4);
-        parts.push(lookup[(tmp >> 15) & 0x1f]);
-        parts.push(lookup[(tmp >> 10) & 0x1f]);
-        parts.push(lookup[(tmp >> 5) & 0x1f]);
-        parts.push(lookup[tmp & 0x1f]);
-        parts.push("====");
-    }
-    else if (extraBytes === 1) {
-        tmp = (uint8[len2] & 0xff) << 2;
-        parts.push(lookup[(tmp >> 5) & 0x1f]);
-        parts.push(lookup[tmp & 0x1f]);
-        parts.push("======");
-    }
-    return parts.join("");
-}

package/esm/deps/jsr.io/@std/encoding/1.0.4/_validate_binary_like.js

@@ -1,26 +0,0 @@
-// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
-const encoder = new TextEncoder();
-function getTypeName(value) {
-    const type = typeof value;
-    if (type !== "object") {
-        return type;
-    }
-    else if (value === null) {
-        return "null";
-    }
-    else {
-        return value?.constructor?.name ?? "object";
-    }
-}
-export function validateBinaryLike(source) {
-    if (typeof source === "string") {
-        return encoder.encode(source);
-    }
-    else if (source instanceof Uint8Array) {
-        return source;
-    }
-    else if (source instanceof ArrayBuffer) {
-        return new Uint8Array(source);
-    }
-    throw new TypeError(`Cannot validate the input as it must be a Uint8Array, a string, or an ArrayBuffer: received a value of the type ${getTypeName(source)}`);
-}

package/esm/deps/jsr.io/@std/encoding/1.0.4/ascii85.js

@@ -1,152 +0,0 @@
-// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
-// This module is browser compatible.
-/**
- * Utilities for working with {@link https://en.wikipedia.org/wiki/Ascii85 | ascii85} encoding.
- *
- * ## Specifying a standard and delimiter
- *
- * By default, all functions are using the most popular Adobe version of ascii85
- * and not adding any delimiter. However, there are three more standards
- * supported - btoa (different delimiter and additional compression of 4 bytes
- * equal to 32), {@link https://rfc.zeromq.org/spec/32/ | Z85} and
- * {@link https://www.rfc-editor.org/rfc/rfc1924.html | RFC 1924}. It's possible to use a
- * different encoding by specifying it in `options` object as a second parameter.
- *
- * Similarly, it's possible to make `encode` add a delimiter (`<~` and `~>` for
- * Adobe, `xbtoa Begin` and `xbtoa End` with newlines between the delimiters and
- * encoded data for btoa. Checksums for btoa are not supported. Delimiters are not
- * supported by other encodings.)
- *
- * @module
- */
-import { validateBinaryLike } from "./_validate_binary_like.js";
-const rfc1924 = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~";
-const Z85 = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ.-:+=^!/*?&<>()[]{}@%$#";
-/**
- * Converts data into an ascii85-encoded string.
- *
- * @param data The data to encode.
- * @param options Options for encoding.
- *
- * @returns The ascii85-encoded string.
- *
- * @example Usage
- * ```ts
- * import { encodeAscii85 } from "@std/encoding/ascii85";
- * import { assertEquals } from "@std/assert";
- *
- * assertEquals(encodeAscii85("Hello world!"), "87cURD]j7BEbo80");
- * ```
- */
-export function encodeAscii85(data, options = {}) {
-    let uint8 = validateBinaryLike(data);
-    const { standard = "Adobe" } = options;
-    let output = [];
-    let v;
-    let n = 0;
-    let difference = 0;
-    if (uint8.length % 4 !== 0) {
-        const tmp = uint8;
-        difference = 4 - (tmp.length % 4);
-        uint8 = new Uint8Array(tmp.length + difference);
-        uint8.set(tmp);
-    }
-    const view = new DataView(uint8.buffer, uint8.byteOffset, uint8.byteLength);
-    for (let i = 0; i < uint8.length; i += 4) {
-        v = view.getUint32(i);
-        // Adobe and btoa standards compress 4 zeroes to single "z" character
-        if ((standard === "Adobe" || standard === "btoa") &&
-            v === 0 &&
-            i < uint8.length - difference - 3) {
-            output[n++] = "z";
-            continue;
-        }
-        // btoa compresses 4 spaces - that is, bytes equal to 32 - into single "y" character
-        if (standard === "btoa" && v === 538976288) {
-            output[n++] = "y";
-            continue;
-        }
-        for (let j = 4; j >= 0; j--) {
-            output[n + j] = String.fromCharCode((v % 85) + 33);
-            v = Math.trunc(v / 85);
-        }
-        n += 5;
-    }
-    switch (standard) {
-        case "Adobe":
-            if (options?.delimiter) {
-                return `<~${output.slice(0, output.length - difference).join("")}~>`;
-            }
-            break;
-        case "btoa":
-            if (options?.delimiter) {
-                return `xbtoa Begin\n${output
-                    .slice(0, output.length - difference)
-                    .join("")}\nxbtoa End`;
-            }
-            break;
-        case "RFC 1924":
-            output = output.map((val) => rfc1924[val.charCodeAt(0) - 33]);
-            break;
-        case "Z85":
-            output = output.map((val) => Z85[val.charCodeAt(0) - 33]);
-            break;
-    }
-    return output.slice(0, output.length - difference).join("");
-}
-/**
- * Decodes a ascii85-encoded string.
- *
- * @param ascii85 The ascii85-encoded string to decode.
- * @param options Options for decoding.
- * @returns The decoded data.
- *
- * @example Usage
- * ```ts
- * import { decodeAscii85 } from "@std/encoding/ascii85";
- * import { assertEquals } from "@std/assert";
- *
- * assertEquals(
- *   decodeAscii85("87cURD]j7BEbo80"),
- *   new TextEncoder().encode("Hello world!"),
- * );
- * ```
- */
-export function decodeAscii85(ascii85, options = {}) {
-    const { standard = "Adobe" } = options;
-    // translate all encodings to most basic adobe/btoa one and decompress some special characters ("z" and "y")
-    switch (standard) {
-        case "Adobe":
-            ascii85 = ascii85.replaceAll(/(<~|~>)/g, "").replaceAll("z", "!!!!!");
-            break;
-        case "btoa":
-            ascii85 = ascii85
-                .replaceAll(/(xbtoa Begin|xbtoa End|\n)/g, "")
-                .replaceAll("z", "!!!!!")
-                .replaceAll("y", "+<VdL");
-            break;
-        case "RFC 1924":
-            ascii85 = ascii85.replaceAll(/./g, (match) => String.fromCharCode(rfc1924.indexOf(match) + 33));
-            break;
-        case "Z85":
-            ascii85 = ascii85.replaceAll(/./g, (match) => String.fromCharCode(Z85.indexOf(match) + 33));
-            break;
-    }
-    // remove all invalid characters
-    ascii85 = ascii85.replaceAll(/[^!-u]/g, "");
-    const len = ascii85.length;
-    const output = new Uint8Array(len + 4 - (len % 4));
-    const view = new DataView(output.buffer);
-    let v = 0;
-    let n = 0;
-    let max = 0;
-    for (let i = 0; i < len;) {
-        for (max += 5; i < max; i++) {
-            v = v * 85 + (i < len ? ascii85.charCodeAt(i) : 117) - 33;
-        }
-        view.setUint32(n, v);
-        v = 0;
-        n += 4;
-    }
-    return output.slice(0, Math.trunc(len * 0.8));
-}