@skmtc/core 0.0.225 → 0.0.227

package/script/context/Trail.js

@@ -0,0 +1,108 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Trail = void 0;
+class Trail {
+    constructor({ path = [], apiPath, method, schemaRef, document, subMethodIndex } = {}) {
+        Object.defineProperty(this, "path", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "apiPath", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "method", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "schemaRef", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "document", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "subMethodIndex", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        this.path = Array.isArray(path) ? path : [path];
+        this.apiPath = apiPath;
+        this.method = method;
+        this.schemaRef = schemaRef;
+        this.document = document;
+        this.subMethodIndex = subMethodIndex;
+    }
+    add(path) {
+        return new Trail({
+            path: this.path.concat(path),
+            apiPath: this.apiPath,
+            method: this.method,
+            schemaRef: this.schemaRef,
+            document: this.document,
+            subMethodIndex: this.subMethodIndex
+        });
+    }
+    addApiPath(apiPath) {
+        return new Trail({
+            path: this.path.concat(`[${apiPath}]`),
+            apiPath,
+            method: this.method,
+            schemaRef: this.schemaRef,
+            document: this.document,
+            subMethodIndex: this.subMethodIndex
+        });
+    }
+    addMethod(method) {
+        return new Trail({
+            path: this.path.concat(method),
+            apiPath: this.apiPath,
+            method,
+            schemaRef: this.schemaRef,
+            document: this.document,
+            subMethodIndex: this.path.length + 1
+        });
+    }
+    addSchemaRef(schemaRef) {
+        return new Trail({
+            path: this.path.concat(schemaRef),
+            apiPath: this.apiPath,
+            method: this.method,
+            schemaRef,
+            document: this.document,
+            subMethodIndex: this.subMethodIndex
+        });
+    }
+    toSubMethodTrail() {
+        return new Trail({
+            path: this.path.slice(this.subMethodIndex),
+            apiPath: this.apiPath,
+            method: this.method,
+            schemaRef: this.schemaRef,
+            document: this.document,
+            subMethodIndex: 0
+        });
+    }
+    toString() {
+        return this.path.reduce((acc, path) => {
+            if (!acc) {
+                return path;
+            }
+            return path.startsWith('[') ? `${acc}${path}` : `${acc}.${path}`;
+        }, '');
+    }
+}
+exports.Trail = Trail;

package/script/context/types.d.ts

@@ -0,0 +1,19 @@
+import type { Definition } from '../dsl/Definition.js';
+import type { GeneratorKey } from '../types/GeneratorKeys.js';
+export type PhaseType = 'parse' | 'generate' | 'render';
+export type FileContents = {
+    imports: Map<string, Set<string>>;
+    definitions: Map<string, Definition>;
+    generatorKeys: Set<GeneratorKey>;
+};
+export type RenderOptions = {
+    packageJson?: boolean;
+};
+export type RenderDependencies = Map<string, Set<GeneratorKey>>;
+export type GetFileOptions = {
+    throwIfNotFound?: boolean;
+};
+export type AddGeneratorKeyArgs = {
+    generatorKey: GeneratorKey;
+};
+//# sourceMappingURL=types.d.ts.map

package/script/context/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/context/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAA;AACtD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAA;AAE7D,MAAM,MAAM,SAAS,GAAG,OAAO,GAAG,UAAU,GAAG,QAAQ,CAAA;AAEvD,MAAM,MAAM,YAAY,GAAG;IACzB,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;IACjC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IACpC,aAAa,EAAE,GAAG,CAAC,YAAY,CAAC,CAAA;CACjC,CAAA;AAED,MAAM,MAAM,aAAa,GAAG;IAC1B,WAAW,CAAC,EAAE,OAAO,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,kBAAkB,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAA;AAE/D,MAAM,MAAM,cAAc,GAAG;IAC3B,eAAe,CAAC,EAAE,OAAO,CAAA;CAC1B,CAAA;AAED,MAAM,MAAM,mBAAmB,GAAG;IAChC,YAAY,EAAE,YAAY,CAAA;CAC3B,CAAA"}

package/script/context/types.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/script/deps/jsr.io/@std/encoding/1.0.1/_validate_binary_like.d.ts

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

package/script/deps/jsr.io/@std/encoding/1.0.1/_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.1/_validate_binary_like.ts"],"names":[],"mappings":"AAeA,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,OAAO,GAAG,UAAU,CAa9D"}

package/script/deps/jsr.io/@std/encoding/1.0.1/_validate_binary_like.js

@@ -0,0 +1,29 @@
+"use strict";
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.validateBinaryLike = validateBinaryLike;
+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";
+    }
+}
+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/script/deps/jsr.io/@std/encoding/1.0.1/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/script/deps/jsr.io/@std/encoding/1.0.1/ascii85.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ascii85.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/encoding/1.0.1/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"}

package/script/deps/jsr.io/@std/encoding/1.0.1/ascii85.js

@@ -0,0 +1,156 @@
+"use strict";
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.encodeAscii85 = encodeAscii85;
+exports.decodeAscii85 = decodeAscii85;
+/**
+ * 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
+ */
+const _validate_binary_like_js_1 = require("./_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");
+ * ```
+ */
+function encodeAscii85(data, options = {}) {
+    let uint8 = (0, _validate_binary_like_js_1.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!"),
+ * );
+ * ```
+ */
+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));
+}

package/script/deps/jsr.io/@std/encoding/1.0.1/base32.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Decodes a base32-encoded string.
+ *
+ * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-6}
+ *
+ * @param b32 The base32-encoded string to decode.
+ * @returns The decoded data.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeBase32 } from "@std/encoding/base32";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(
+ *   decodeBase32("GZRTMMDDGA======"),
+ *   new TextEncoder().encode("6c60c0"),
+ * );
+ * ```
+ */
+export declare function decodeBase32(b32: string): Uint8Array;
+/**
+ * Converts data into a base32-encoded string.
+ *
+ * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-6}
+ *
+ * @param data The data to encode.
+ * @returns The base32-encoded string.
+ *
+ * @example Usage
+ * ```ts
+ * import { encodeBase32 } from "@std/encoding/base32";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeBase32("6c60c0"), "GZRTMMDDGA======");
+ * ```
+ */
+export declare function encodeBase32(data: ArrayBuffer | Uint8Array | string): string;
+//# sourceMappingURL=base32.d.ts.map

package/script/deps/jsr.io/@std/encoding/1.0.1/base32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base32.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/encoding/1.0.1/base32.ts"],"names":[],"mappings":"AA6DA;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,CAkEpD;AAwBD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,WAAW,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,CA6D5E"}

package/script/deps/jsr.io/@std/encoding/1.0.1/base32.js

@@ -0,0 +1,228 @@
+"use strict";
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// Copyright (c) 2014 Jameson Little. MIT License.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.decodeBase32 = decodeBase32;
+exports.encodeBase32 = encodeBase32;
+/**
+ * Utilities for
+ * {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-6 | base32}
+ * encoding and decoding.
+ *
+ * Modified from {@link https://github.com/beatgammit/base64-js}.
+ *
+ * ```ts
+ * import { encodeBase32, decodeBase32 } from "@std/encoding/base32";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeBase32("foobar"), "MZXW6YTBOI======");
+ *
+ * assertEquals(
+ *   decodeBase32("MZXW6YTBOI======"),
+ *   new TextEncoder().encode("foobar")
+ * );
+ * ```
+ *
+ * @module
+ */
+const _validate_binary_like_js_1 = require("./_validate_binary_like.js");
+const lookup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567".split("");
+const revLookup = [];
+lookup.forEach((c, i) => revLookup[c.charCodeAt(0)] = i);
+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("Invalid string. Length must be a multiple of 8");
+    }
+    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 a base32-encoded string.
+ *
+ * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-6}
+ *
+ * @param b32 The base32-encoded string to decode.
+ * @returns The decoded data.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeBase32 } from "@std/encoding/base32";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(
+ *   decodeBase32("GZRTMMDDGA======"),
+ *   new TextEncoder().encode("6c60c0"),
+ * );
+ * ```
+ */
+function decodeBase32(b32) {
+    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) {
+    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("");
+}
+/**
+ * Converts data into a base32-encoded string.
+ *
+ * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-6}
+ *
+ * @param data The data to encode.
+ * @returns The base32-encoded string.
+ *
+ * @example Usage
+ * ```ts
+ * import { encodeBase32 } from "@std/encoding/base32";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeBase32("6c60c0"), "GZRTMMDDGA======");
+ * ```
+ */
+function encodeBase32(data) {
+    const uint8 = (0, _validate_binary_like_js_1.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));
+    }
+    // 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("");
+}