windmill-cli 0.0.1

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

@@ -0,0 +1,74 @@
+// 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.d.ts

@@ -0,0 +1,2 @@
+export declare function validateBinaryLike(source: unknown): Uint8Array;
+//# sourceMappingURL=_validate_binary_like.d.ts.map

package/esm/deps/jsr.io/@std/encoding/1.0.0-rc.2/_validate_binary_like.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_validate_binary_like.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/encoding/1.0.0-rc.2/_validate_binary_like.ts"],"names":[],"mappings":"AAeA,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,OAAO,GAAG,UAAU,CAa9D"}

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

@@ -0,0 +1,26 @@
+// 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.d.ts

@@ -0,0 +1,38 @@
+/**
+ * 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 declare function encodeBase64(data: ArrayBuffer | Uint8Array | string): string;
+/**
+ * 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 declare function decodeBase64(b64: string): Uint8Array;
+//# sourceMappingURL=base64.d.ts.map

package/esm/deps/jsr.io/@std/encoding/1.0.0-rc.2/base64.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base64.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/encoding/1.0.0-rc.2/base64.ts"],"names":[],"mappings":"AA6FA;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,WAAW,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,CAmC5E;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,CAQpD"}

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

@@ -0,0 +1,163 @@
+// 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.d.ts

@@ -0,0 +1,17 @@
+/**
+ * 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 declare function decode(b32: string, lookup: ReadonlyArray<string>): Uint8Array;
+/**
+ * Encodes the given data using the lookup table.
+ *
+ * @param data The data to encode.
+ * @param lookup The lookup table.
+ * @returns The encoded string.
+ */
+export declare function encode(data: ArrayBuffer | Uint8Array | string, lookup: ReadonlyArray<string>): string;
+//# sourceMappingURL=_base32_common.d.ts.map

package/esm/deps/jsr.io/@std/encoding/1.0.4/_base32_common.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_base32_common.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/encoding/1.0.4/_base32_common.ts"],"names":[],"mappings":"AAyCA;;;;;;GAMG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,UAAU,CAqE7E;AA6BD;;;;;;GAMG;AACH,wBAAgB,MAAM,CACpB,IAAI,EAAE,WAAW,GAAG,UAAU,GAAG,MAAM,EACvC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,GAC5B,MAAM,CA6DR"}

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

@@ -0,0 +1,183 @@
+// 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.d.ts

@@ -0,0 +1,2 @@
+export declare function validateBinaryLike(source: unknown): Uint8Array;
+//# sourceMappingURL=_validate_binary_like.d.ts.map

package/esm/deps/jsr.io/@std/encoding/1.0.4/_validate_binary_like.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_validate_binary_like.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/encoding/1.0.4/_validate_binary_like.ts"],"names":[],"mappings":"AAeA,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,OAAO,GAAG,UAAU,CAa9D"}

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

@@ -0,0 +1,26 @@
+// 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.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Supported ascii85 standards for {@linkcode EncodeAscii85Options} and
+ * {@linkcode DecodeAscii85Options}.
+ */
+export type Ascii85Standard = "Adobe" | "btoa" | "RFC 1924" | "Z85";
+/** Options for {@linkcode encodeAscii85}. */
+export interface EncodeAscii85Options {
+    /**
+     * Character set and delimiter (if supported and used).
+     *
+     * @default {"Adobe"}
+     */
+    standard?: Ascii85Standard;
+    /**
+     * Whether to use a delimiter (if supported).
+     *
+     * @default {false}
+     */
+    delimiter?: boolean;
+}
+/**
+ * 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 declare function encodeAscii85(data: ArrayBuffer | Uint8Array | string, options?: EncodeAscii85Options): string;
+/** Options for {@linkcode decodeAscii85}. */
+export type DecodeAscii85Options = Omit<EncodeAscii85Options, "delimiter">;
+/**
+ * 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 declare function decodeAscii85(ascii85: string, options?: DecodeAscii85Options): Uint8Array;
+//# sourceMappingURL=ascii85.d.ts.map

package/esm/deps/jsr.io/@std/encoding/1.0.4/ascii85.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ascii85.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/encoding/1.0.4/ascii85.ts"],"names":[],"mappings":"AAyBA;;;GAGG;AACH,MAAM,MAAM,eAAe,GAAG,OAAO,GAAG,MAAM,GAAG,UAAU,GAAG,KAAK,CAAC;AAEpE,6CAA6C;AAC7C,MAAM,WAAW,oBAAoB;IACnC;;;;OAIG;IACH,QAAQ,CAAC,EAAE,eAAe,CAAC;IAC3B;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAOD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE,WAAW,GAAG,UAAU,GAAG,MAAM,EACvC,OAAO,GAAE,oBAAyB,GACjC,MAAM,CA6DR;AAED,6CAA6C;AAC7C,MAAM,MAAM,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,EAAE,WAAW,CAAC,CAAC;AAE3E;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,oBAAyB,GACjC,UAAU,CA4CZ"}