@versori/run 0.0.1-alpha.0 → 0.0.1-alpha.2

package/script/deps/jsr.io/@std/log/0.224.14/warn.d.ts

@@ -0,0 +1,53 @@
+import type { GenericFunction } from "./logger.js";
+import "./setup.js";
+export type { GenericFunction };
+/**
+ * Log at the warning level.
+ *
+ * This function is a pass-through to the default logger's `warn` method. By
+ * default, the default logger is configured to use {@linkcode console.log} and
+ * print in yellow text.
+ *
+ * @template T The type of the message to log.
+ * @param msg The message to log.
+ * @param args Arguments to be formatted into the message.
+ * @returns The message that was logged.
+ *
+ * @example Usage
+ * ```ts
+ * import { warn } from "@std/log/warn";
+ * import { assertEquals } from "@std/assert/equals";
+ *
+ * assertEquals(warn("This is a warning message."), "This is a warning message.");
+ * // Prints: "WARN This is a warning message."
+ *
+ * assertEquals(warn(() => "This is a warning message."), "This is a warning message.");
+ * // Prints: "WARN This is a warning message."
+ * ```
+ */
+export declare function warn<T>(msg: () => T, ...args: unknown[]): T | undefined;
+/**
+ * Log at the warning level.
+ *
+ * This function is a pass-through to the default logger's `warn` method. By
+ * default, the default logger is configured to use {@linkcode console.log}.
+ *
+ * @template T The type of the message to log.
+ * @param msg The message to log.
+ * @param args Arguments to be formatted into the message.
+ * @returns The message that was logged.
+ *
+ * @example Usage
+ * ```ts
+ * import { warn } from "@std/log/warn";
+ * import { assertEquals } from "@std/assert/equals";
+ *
+ * assertEquals(warn("This is a warning message."), "This is a warning message.");
+ * // Prints: "WARN This is a warning message."
+ *
+ * assertEquals(warn(() => "This is a warning message."), "This is a warning message.");
+ * // Prints: "WARN This is a warning message."
+ * ```
+ */
+export declare function warn<T>(msg: T extends GenericFunction ? never : T, ...args: unknown[]): T;
+//# sourceMappingURL=warn.d.ts.map

package/script/deps/jsr.io/@std/log/0.224.14/warn.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"warn.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/log/0.224.14/warn.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,YAAY,CAAC;AAEpB,YAAY,EAAE,eAAe,EAAE,CAAC;AAEhC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,GAAG,SAAS,CAAC;AACzE;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,IAAI,CAAC,CAAC,EACpB,GAAG,EAAE,CAAC,SAAS,eAAe,GAAG,KAAK,GAAG,CAAC,EAC1C,GAAG,IAAI,EAAE,OAAO,EAAE,GACjB,CAAC,CAAC"}

package/script/deps/jsr.io/@std/log/0.224.14/warn.js

@@ -0,0 +1,14 @@
+"use strict";
+// Copyright 2018-2025 the Deno authors. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.warn = warn;
+const get_logger_js_1 = require("./get_logger.js");
+require("./setup.js");
+function warn(msg, ...args) {
+    // Assist TS compiler with pass-through generic type
+    if (msg instanceof Function) {
+        return (0, get_logger_js_1.getLogger)("default").warn(msg, ...args);
+    }
+    return (0, get_logger_js_1.getLogger)("default").warn(msg, ...args);
+}

package/script/deps/jsr.io/@std/ulid/1.0.0/_util.d.ts

@@ -0,0 +1,14 @@
+/** Type for a ULID generator function. */
+export type ULID = (seedTime?: number) => string;
+export declare const ENCODING = "0123456789ABCDEFGHJKMNPQRSTVWXYZ";
+export declare const ENCODING_LEN: number;
+export declare const TIME_MAX: number;
+export declare const TIME_LEN = 10;
+export declare const RANDOM_LEN = 16;
+export declare const ULID_LEN: number;
+export declare function encodeTime(timestamp: number): string;
+export declare function encodeRandom(): string;
+export declare function incrementBase32(str: string): string;
+/** Generates a monotonically increasing ULID. */
+export declare function monotonicFactory(encodeRand?: typeof encodeRandom): ULID;
+//# sourceMappingURL=_util.d.ts.map

package/script/deps/jsr.io/@std/ulid/1.0.0/_util.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_util.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/ulid/1.0.0/_util.ts"],"names":[],"mappings":"AAEA,0CAA0C;AAC1C,MAAM,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;AAIjD,eAAO,MAAM,QAAQ,qCAAqC,CAAC;AAC3D,eAAO,MAAM,YAAY,QAAkB,CAAC;AAC5C,eAAO,MAAM,QAAQ,QAAsB,CAAC;AAC5C,eAAO,MAAM,QAAQ,KAAK,CAAC;AAC3B,eAAO,MAAM,UAAU,KAAK,CAAC;AAC7B,eAAO,MAAM,QAAQ,QAAwB,CAAC;AAM9C,wBAAgB,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAapD;AAED,wBAAgB,YAAY,IAAI,MAAM,CAOrC;AAED,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAkBnD;AAED,iDAAiD;AACjD,wBAAgB,gBAAgB,CAAC,UAAU,sBAAe,GAAG,IAAI,CAYhE"}

package/script/deps/jsr.io/@std/ulid/1.0.0/_util.js

@@ -0,0 +1,72 @@
+"use strict";
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ULID_LEN = exports.RANDOM_LEN = exports.TIME_LEN = exports.TIME_MAX = exports.ENCODING_LEN = exports.ENCODING = void 0;
+exports.encodeTime = encodeTime;
+exports.encodeRandom = encodeRandom;
+exports.incrementBase32 = incrementBase32;
+exports.monotonicFactory = monotonicFactory;
+// These values should NEVER change. If
+// they do, we're no longer making ulids!
+exports.ENCODING = "0123456789ABCDEFGHJKMNPQRSTVWXYZ"; // Crockford's Base32
+exports.ENCODING_LEN = exports.ENCODING.length;
+exports.TIME_MAX = Math.pow(2, 48) - 1;
+exports.TIME_LEN = 10;
+exports.RANDOM_LEN = 16;
+exports.ULID_LEN = exports.TIME_LEN + exports.RANDOM_LEN;
+function replaceCharAt(str, index, char) {
+    return str.substring(0, index) + char + str.substring(index + 1);
+}
+function encodeTime(timestamp) {
+    if (!Number.isInteger(timestamp) || timestamp < 0 || timestamp > exports.TIME_MAX) {
+        throw new RangeError(`Time must be a positive integer less than ${exports.TIME_MAX}`);
+    }
+    let str = "";
+    for (let len = exports.TIME_LEN; len > 0; len--) {
+        const mod = timestamp % exports.ENCODING_LEN;
+        str = exports.ENCODING[mod] + str;
+        timestamp = Math.floor(timestamp / exports.ENCODING_LEN);
+    }
+    return str;
+}
+function encodeRandom() {
+    let str = "";
+    const bytes = crypto.getRandomValues(new Uint8Array(exports.RANDOM_LEN));
+    for (const byte of bytes) {
+        str += exports.ENCODING[byte % exports.ENCODING_LEN];
+    }
+    return str;
+}
+function incrementBase32(str) {
+    let index = str.length;
+    let char;
+    let charIndex;
+    const maxCharIndex = exports.ENCODING_LEN - 1;
+    while (--index >= 0) {
+        char = str[index];
+        charIndex = exports.ENCODING.indexOf(char);
+        if (charIndex === -1) {
+            throw new TypeError("Incorrectly encoded string");
+        }
+        if (charIndex === maxCharIndex) {
+            str = replaceCharAt(str, index, exports.ENCODING[0]);
+            continue;
+        }
+        return replaceCharAt(str, index, exports.ENCODING[charIndex + 1]);
+    }
+    throw new Error("Cannot increment this string");
+}
+/** Generates a monotonically increasing ULID. */
+function monotonicFactory(encodeRand = encodeRandom) {
+    let lastTime = 0;
+    let lastRandom;
+    return function ulid(seedTime = Date.now()) {
+        if (seedTime <= lastTime) {
+            const incrementedRandom = (lastRandom = incrementBase32(lastRandom));
+            return encodeTime(lastTime) + incrementedRandom;
+        }
+        lastTime = seedTime;
+        const newRandom = (lastRandom = encodeRand());
+        return encodeTime(seedTime) + newRandom;
+    };
+}

package/script/deps/jsr.io/@std/ulid/1.0.0/decode_time.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Extracts the number of milliseconds since the Unix epoch that had passed when
+ * the ULID was generated. If the ULID is malformed, an error will be thrown.
+ *
+ * @example Decode the time from a ULID
+ * ```ts
+ * import { decodeTime, ulid } from "@std/ulid";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const timestamp = 150_000;
+ * const ulidString = ulid(timestamp);
+ *
+ * assertEquals(decodeTime(ulidString), timestamp);
+ * ```
+ *
+ * @param ulid The ULID to extract the timestamp from.
+ * @returns The number of milliseconds since the Unix epoch that had passed when the ULID was generated.
+ */
+export declare function decodeTime(ulid: string): number;
+//# sourceMappingURL=decode_time.d.ts.map

package/script/deps/jsr.io/@std/ulid/1.0.0/decode_time.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decode_time.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/ulid/1.0.0/decode_time.ts"],"names":[],"mappings":"AAaA;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAqB/C"}

package/script/deps/jsr.io/@std/ulid/1.0.0/decode_time.js

@@ -0,0 +1,46 @@
+"use strict";
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// Copyright 2023 Yoshiya Hinosawa. All rights reserved. MIT license.
+// Copyright 2017 Alizain Feerasta. All rights reserved. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.decodeTime = decodeTime;
+const _util_js_1 = require("./_util.js");
+/**
+ * Extracts the number of milliseconds since the Unix epoch that had passed when
+ * the ULID was generated. If the ULID is malformed, an error will be thrown.
+ *
+ * @example Decode the time from a ULID
+ * ```ts
+ * import { decodeTime, ulid } from "@std/ulid";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const timestamp = 150_000;
+ * const ulidString = ulid(timestamp);
+ *
+ * assertEquals(decodeTime(ulidString), timestamp);
+ * ```
+ *
+ * @param ulid The ULID to extract the timestamp from.
+ * @returns The number of milliseconds since the Unix epoch that had passed when the ULID was generated.
+ */
+function decodeTime(ulid) {
+    if (ulid.length !== _util_js_1.ULID_LEN) {
+        throw new Error(`ULID must be exactly ${_util_js_1.ULID_LEN} characters long`);
+    }
+    const time = ulid
+        .substring(0, _util_js_1.TIME_LEN)
+        .split("")
+        .reverse()
+        .reduce((carry, char, index) => {
+        const encodingIndex = _util_js_1.ENCODING.indexOf(char);
+        if (encodingIndex === -1) {
+            throw new Error(`Invalid ULID character found: ${char}`);
+        }
+        return (carry += encodingIndex * Math.pow(_util_js_1.ENCODING_LEN, index));
+    }, 0);
+    if (time > _util_js_1.TIME_MAX) {
+        throw new RangeError(`ULID timestamp component exceeds maximum value of ${_util_js_1.TIME_MAX}`);
+    }
+    return time;
+}

package/script/deps/jsr.io/@std/ulid/1.0.0/mod.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Utilities for generating and working with
+ * {@link https://github.com/ulid/spec | Universally Unique Lexicographically Sortable Identifiers (ULIDs)}.
+ *
+ * To generate a ULID use the {@linkcode ulid} function. This will generate a
+ * ULID based on the current time.
+ *
+ * ```ts no-assert
+ * import { ulid } from "@std/ulid";
+ *
+ * ulid(); // 01HYFKMDF3HVJ4J3JZW8KXPVTY
+ * ```
+ *
+ * {@linkcode ulid} does not guarantee that the ULIDs will be strictly
+ * increasing for the same current time. If you need to guarantee that the ULIDs
+ * will be strictly increasing, even for the same current time, use the
+ * {@linkcode monotonicUlid} function.
+ *
+ * ```ts no-assert
+ * import { monotonicUlid } from "@std/ulid";
+ *
+ * monotonicUlid(); // 01HYFKHG5F8RHM2PM3D7NSTDAS
+ * monotonicUlid(); // 01HYFKHG5F8RHM2PM3D7NSTDAT
+ * ```
+ *
+ * Because each ULID encodes the time it was generated, you can extract the
+ * timestamp from a ULID using the {@linkcode decodeTime} function.
+ *
+ * ```ts
+ * import { decodeTime, ulid } from "@std/ulid";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const timestamp = 150_000;
+ * const ulidString = ulid(timestamp);
+ *
+ * assertEquals(decodeTime(ulidString), timestamp);
+ * ```
+ *
+ * @module
+ */
+export * from "./decode_time.js";
+export * from "./monotonic_ulid.js";
+export * from "./ulid.js";
+//# sourceMappingURL=mod.d.ts.map

package/script/deps/jsr.io/@std/ulid/1.0.0/mod.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mod.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/ulid/1.0.0/mod.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AAEH,cAAc,kBAAkB,CAAC;AACjC,cAAc,qBAAqB,CAAC;AACpC,cAAc,WAAW,CAAC"}

package/script/deps/jsr.io/@std/ulid/1.0.0/mod.js

@@ -0,0 +1,63 @@
+"use strict";
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// Copyright 2023 Yoshiya Hinosawa. All rights reserved. MIT license.
+// Copyright 2017 Alizain Feerasta. All rights reserved. MIT license.
+// This module is browser compatible.
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Utilities for generating and working with
+ * {@link https://github.com/ulid/spec | Universally Unique Lexicographically Sortable Identifiers (ULIDs)}.
+ *
+ * To generate a ULID use the {@linkcode ulid} function. This will generate a
+ * ULID based on the current time.
+ *
+ * ```ts no-assert
+ * import { ulid } from "@std/ulid";
+ *
+ * ulid(); // 01HYFKMDF3HVJ4J3JZW8KXPVTY
+ * ```
+ *
+ * {@linkcode ulid} does not guarantee that the ULIDs will be strictly
+ * increasing for the same current time. If you need to guarantee that the ULIDs
+ * will be strictly increasing, even for the same current time, use the
+ * {@linkcode monotonicUlid} function.
+ *
+ * ```ts no-assert
+ * import { monotonicUlid } from "@std/ulid";
+ *
+ * monotonicUlid(); // 01HYFKHG5F8RHM2PM3D7NSTDAS
+ * monotonicUlid(); // 01HYFKHG5F8RHM2PM3D7NSTDAT
+ * ```
+ *
+ * Because each ULID encodes the time it was generated, you can extract the
+ * timestamp from a ULID using the {@linkcode decodeTime} function.
+ *
+ * ```ts
+ * import { decodeTime, ulid } from "@std/ulid";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const timestamp = 150_000;
+ * const ulidString = ulid(timestamp);
+ *
+ * assertEquals(decodeTime(ulidString), timestamp);
+ * ```
+ *
+ * @module
+ */
+__exportStar(require("./decode_time.js"), exports);
+__exportStar(require("./monotonic_ulid.js"), exports);
+__exportStar(require("./ulid.js"), exports);

package/script/deps/jsr.io/@std/ulid/1.0.0/monotonic_ulid.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Generate a ULID that monotonically increases even for the same millisecond,
+ * optionally passing the current time. If the current time is not passed, it
+ * will default to `Date.now()`.
+ *
+ * Unlike the {@linkcode ulid} function, this function is guaranteed to return
+ * strictly increasing ULIDs, even for the same seed time, but only if the seed
+ * time only ever increases. If the seed time ever goes backwards, the ULID will
+ * still be generated, but it will not be guaranteed to be monotonic with
+ * previous ULIDs for that same seed time.
+ *
+ * @example Generate a monotonic ULID
+ * ```ts no-assert
+ * import { monotonicUlid } from "@std/ulid";
+ *
+ * monotonicUlid(); // 01HYFKHG5F8RHM2PM3D7NSTDAS
+ * monotonicUlid(); // 01HYFKHG5F8RHM2PM3D7NSTDAT
+ * monotonicUlid(); // 01HYFKHHX8H4BRY8BYHAV1BZ2T
+ * ```
+ *
+ * @example Generate a monotonic ULID with a seed time
+ * ```ts no-assert
+ * import { monotonicUlid } from "@std/ulid";
+ *
+ * // Strict ordering for the same timestamp, by incrementing the least-significant random bit by 1
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1Q
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1R
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1S
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1T
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1U
+ *
+ * // A different timestamp will reset the random bits
+ * monotonicUlid(150001); // 0000004JFHJJ2Z7X64FN2B4F1P
+ *
+ * // A previous seed time will not guarantee ordering, and may result in a
+ * // ULID lower than one with the same seed time generated previously
+ * monotonicUlid(150000); // 0000004JFJ7XF6D76ES95SZR0X
+ * ```
+ *
+ * @param seedTime The time to base the ULID on, in milliseconds since the Unix epoch. Defaults to `Date.now()`.
+ * @returns A ULID that is guaranteed to be strictly increasing for the same seed time.
+ */
+export declare function monotonicUlid(seedTime?: number): string;
+//# sourceMappingURL=monotonic_ulid.d.ts.map

package/script/deps/jsr.io/@std/ulid/1.0.0/monotonic_ulid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"monotonic_ulid.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/ulid/1.0.0/monotonic_ulid.ts"],"names":[],"mappings":"AASA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AACH,wBAAgB,aAAa,CAAC,QAAQ,GAAE,MAAmB,GAAG,MAAM,CAEnE"}

package/script/deps/jsr.io/@std/ulid/1.0.0/monotonic_ulid.js

@@ -0,0 +1,54 @@
+"use strict";
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// Copyright 2023 Yoshiya Hinosawa. All rights reserved. MIT license.
+// Copyright 2017 Alizain Feerasta. All rights reserved. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.monotonicUlid = monotonicUlid;
+const _util_js_1 = require("./_util.js");
+const defaultMonotonicUlid = (0, _util_js_1.monotonicFactory)();
+/**
+ * Generate a ULID that monotonically increases even for the same millisecond,
+ * optionally passing the current time. If the current time is not passed, it
+ * will default to `Date.now()`.
+ *
+ * Unlike the {@linkcode ulid} function, this function is guaranteed to return
+ * strictly increasing ULIDs, even for the same seed time, but only if the seed
+ * time only ever increases. If the seed time ever goes backwards, the ULID will
+ * still be generated, but it will not be guaranteed to be monotonic with
+ * previous ULIDs for that same seed time.
+ *
+ * @example Generate a monotonic ULID
+ * ```ts no-assert
+ * import { monotonicUlid } from "@std/ulid";
+ *
+ * monotonicUlid(); // 01HYFKHG5F8RHM2PM3D7NSTDAS
+ * monotonicUlid(); // 01HYFKHG5F8RHM2PM3D7NSTDAT
+ * monotonicUlid(); // 01HYFKHHX8H4BRY8BYHAV1BZ2T
+ * ```
+ *
+ * @example Generate a monotonic ULID with a seed time
+ * ```ts no-assert
+ * import { monotonicUlid } from "@std/ulid";
+ *
+ * // Strict ordering for the same timestamp, by incrementing the least-significant random bit by 1
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1Q
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1R
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1S
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1T
+ * monotonicUlid(150000); // 0000004JFHJJ2Z7X64FN2B4F1U
+ *
+ * // A different timestamp will reset the random bits
+ * monotonicUlid(150001); // 0000004JFHJJ2Z7X64FN2B4F1P
+ *
+ * // A previous seed time will not guarantee ordering, and may result in a
+ * // ULID lower than one with the same seed time generated previously
+ * monotonicUlid(150000); // 0000004JFJ7XF6D76ES95SZR0X
+ * ```
+ *
+ * @param seedTime The time to base the ULID on, in milliseconds since the Unix epoch. Defaults to `Date.now()`.
+ * @returns A ULID that is guaranteed to be strictly increasing for the same seed time.
+ */
+function monotonicUlid(seedTime = Date.now()) {
+    return defaultMonotonicUlid(seedTime);
+}

package/script/deps/jsr.io/@std/ulid/1.0.0/ulid.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Generate a ULID, optionally based on a given timestamp. If the timestamp is
+ * not passed, it will default to `Date.now()`.
+ *
+ * Multiple calls to this function with the same seed time will not guarantee
+ * that the ULIDs will be strictly increasing, even if the seed time is the
+ * same. For that, use the {@linkcode monotonicUlid} function.
+ *
+ * @example Generate a ULID
+ * ```ts no-assert
+ * import { ulid } from "@std/ulid";
+ *
+ * ulid(); // 01HYFKMDF3HVJ4J3JZW8KXPVTY
+ * ulid(); // 01HYFKMDF3D2P7G502B9Z2VKV0
+ * ulid(); // 01HYFKMDZQ7JD17CRKDXQSZ3Z4
+ * ```
+ *
+ * @example Generate a ULID with a seed time
+ * ```ts no-assert
+ * import { ulid } from "@std/ulid";
+ *
+ * ulid(150000); // 0000004JFG3EKDRE04TVVDJW7K
+ * ulid(150000); // 0000004JFGN0KHBH0447AK895X
+ * ulid(150000); // 0000004JFGMRDH0PN7SM8BZN06
+ * ```
+ *
+ * @param seedTime The time to base the ULID on, in milliseconds since the Unix epoch. Defaults to `Date.now()`.
+ * @returns A ULID.
+ */
+export declare function ulid(seedTime?: number): string;
+//# sourceMappingURL=ulid.d.ts.map

package/script/deps/jsr.io/@std/ulid/1.0.0/ulid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ulid.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/ulid/1.0.0/ulid.ts"],"names":[],"mappings":"AAOA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,IAAI,CAAC,QAAQ,GAAE,MAAmB,GAAG,MAAM,CAE1D"}

package/script/deps/jsr.io/@std/ulid/1.0.0/ulid.js

@@ -0,0 +1,40 @@
+"use strict";
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// Copyright 2023 Yoshiya Hinosawa. All rights reserved. MIT license.
+// Copyright 2017 Alizain Feerasta. All rights reserved. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ulid = ulid;
+const _util_js_1 = require("./_util.js");
+/**
+ * Generate a ULID, optionally based on a given timestamp. If the timestamp is
+ * not passed, it will default to `Date.now()`.
+ *
+ * Multiple calls to this function with the same seed time will not guarantee
+ * that the ULIDs will be strictly increasing, even if the seed time is the
+ * same. For that, use the {@linkcode monotonicUlid} function.
+ *
+ * @example Generate a ULID
+ * ```ts no-assert
+ * import { ulid } from "@std/ulid";
+ *
+ * ulid(); // 01HYFKMDF3HVJ4J3JZW8KXPVTY
+ * ulid(); // 01HYFKMDF3D2P7G502B9Z2VKV0
+ * ulid(); // 01HYFKMDZQ7JD17CRKDXQSZ3Z4
+ * ```
+ *
+ * @example Generate a ULID with a seed time
+ * ```ts no-assert
+ * import { ulid } from "@std/ulid";
+ *
+ * ulid(150000); // 0000004JFG3EKDRE04TVVDJW7K
+ * ulid(150000); // 0000004JFGN0KHBH0447AK895X
+ * ulid(150000); // 0000004JFGMRDH0PN7SM8BZN06
+ * ```
+ *
+ * @param seedTime The time to base the ULID on, in milliseconds since the Unix epoch. Defaults to `Date.now()`.
+ * @returns A ULID.
+ */
+function ulid(seedTime = Date.now()) {
+    return (0, _util_js_1.encodeTime)(seedTime) + (0, _util_js_1.encodeRandom)();
+}

package/script/mod.d.ts

@@ -1,5 +1,2 @@
-export { schedule } from "./dsl/triggers/ScheduleTrigger.js";
-export { http } from "./dsl/tasks/HttpTask.js";
-export { fn } from "./dsl/tasks/FnTask.js";
-export { MemoryInterpreter } from "./interpreter/memory/MemoryInterpreter.js";
+export * from './src/mod.js';
 //# sourceMappingURL=mod.d.ts.map

package/script/mod.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mod.d.ts","sourceRoot":"","sources":["../src/mod.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,mCAAmC,CAAC;AAC7D,OAAO,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAC;AAC/C,OAAO,EAAE,EAAE,EAAE,MAAM,uBAAuB,CAAC;AAC3C,OAAO,EAAE,iBAAiB,EAAE,MAAM,2CAA2C,CAAC"}
+{"version":3,"file":"mod.d.ts","sourceRoot":"","sources":["../src/mod.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC"}

package/script/mod.js

@@ -1,11 +1,17 @@
 "use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.MemoryInterpreter = exports.fn = exports.http = exports.schedule = void 0;
-var ScheduleTrigger_js_1 = require("./dsl/triggers/ScheduleTrigger.js");
-Object.defineProperty(exports, "schedule", { enumerable: true, get: function () { return ScheduleTrigger_js_1.schedule; } });
-var HttpTask_js_1 = require("./dsl/tasks/HttpTask.js");
-Object.defineProperty(exports, "http", { enumerable: true, get: function () { return HttpTask_js_1.http; } });
-var FnTask_js_1 = require("./dsl/tasks/FnTask.js");
-Object.defineProperty(exports, "fn", { enumerable: true, get: function () { return FnTask_js_1.fn; } });
-var MemoryInterpreter_js_1 = require("./interpreter/memory/MemoryInterpreter.js");
-Object.defineProperty(exports, "MemoryInterpreter", { enumerable: true, get: function () { return MemoryInterpreter_js_1.MemoryInterpreter; } });
+__exportStar(require("./src/mod.js"), exports);

package/script/src/context/Context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Context.d.ts","sourceRoot":"","sources":["../../../src/src/context/Context.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,oCAAoC,CAAC;AAE5D,MAAM,WAAW,OAAO,CAAC,CAAC;IACtB,GAAG,EAAE,MAAM,CAAC;IACZ,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,IAAI,CAAC;IAChB,IAAI,EAAE,CAAC,CAAC;CACX;AAED,MAAM,WAAW,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAE,SAAQ,OAAO,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACnD,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAClD,GAAG,EAAE,KAAK,CAAC;CACd;AAED,qBAAa,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAE,YAAW,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC;IAC1E,GAAG,EAAE,MAAM,CAAC;IACZ,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,IAAI,CAAC;IAChB,IAAI,EAAE,CAAC,CAAC;IAER,GAAG,EAAE,KAAK,CAAC;gBAEC,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAQtE,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC;IAOjD,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,KAAK,CAAC;CAGrD"}

package/script/src/context/ContextFunc.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ContextFunc.d.ts","sourceRoot":"","sources":["../../../src/src/context/ContextFunc.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEvC,MAAM,MAAM,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,IAAI,IAC7C,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,GACtC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AAE5C,MAAM,MAAM,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,KAAK,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;AAE1G,MAAM,MAAM,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,KAAK,KAAK,MAAM,CAAC"}

package/script/src/context/ContextProvider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ContextProvider.d.ts","sourceRoot":"","sources":["../../../src/src/context/ContextProvider.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,oCAAoC,CAAC;AAC5D,OAAO,EAAe,eAAe,EAAE,MAAM,cAAc,CAAC;AAE5D,MAAM,WAAW,eAAe;IAC5B,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;CAChD;AAED,qBAAa,mBAAoB,YAAW,eAAe;IACvD,GAAG,EAAE,MAAM,CAAC;gBAEA,GAAG,EAAE,MAAM;IAIvB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC;CAK/C"}

package/script/{context → src/context}/ContextProvider.js

@@ -1,7 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ContextProviderImpl = void 0;
-const ulid_1 = require("@std/ulid");
+const mod_js_1 = require("../../deps/jsr.io/@std/ulid/1.0.0/mod.js");
 const Context_js_1 = require("./Context.js");
 class ContextProviderImpl {
     constructor(log) {
@@ -14,7 +14,7 @@ class ContextProviderImpl {
         this.log = log;
     }
     create(data) {
-        const executionId = (0, ulid_1.ulid)();
+        const executionId = (0, mod_js_1.ulid)();
         return new Context_js_1.ContextImpl(this.log.child({ executionId }), executionId, new Date(), data);
     }
 }

package/script/src/context/mod.d.ts

@@ -0,0 +1,4 @@
+export * from './Context.js';
+export * from './ContextFunc.js';
+export * from './ContextProvider.js';
+//# sourceMappingURL=mod.d.ts.map

package/script/src/context/mod.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mod.d.ts","sourceRoot":"","sources":["../../../src/src/context/mod.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,kBAAkB,CAAC;AACjC,cAAc,sBAAsB,CAAC"}

package/script/src/context/mod.js

@@ -0,0 +1,19 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./Context.js"), exports);
+__exportStar(require("./ContextFunc.js"), exports);
+__exportStar(require("./ContextProvider.js"), exports);

package/script/{dsl → src/dsl}/Task.d.ts

@@ -21,13 +21,10 @@ export interface Task<In = any, Out = any> extends Object {
      * Run the current task in the background and continue execution of the workflow.
      */
     background(): Task<In, void>;
-    unpack<NextOut>(mapper?: (data: Out) => NextOut[]): ArrayTask<In, NextOut>;
+    unpack<NextOut = Out extends Array<infer Elem> ? Elem : Out>(): ArrayTask<In, NextOut>;
+    unpack<NextOut>(mapper: (data: Out) => NextOut[]): ArrayTask<In, NextOut>;
     clone(): Task<In, Out>;
 }
-export type AsyncTask<In, O> = {
-    then<NextOut>(task: Taskable<void, NextOut>): Task<In, NextOut>;
-    join(): Task<In, O>;
-};
 export type ArrayTask<In, OutElem> = Task<In, OutElem[]> & {
     parallel<NextOut>(task: Taskable<OutElem, NextOut, number>): Task<In, NextOut[]>;
     serial<NextOut>(task: Taskable<OutElem, NextOut, number>): Task<In, NextOut[]>;