structured-outputs 0.1.0-beta.2 → 0.1.0-beta.20

package/esm/deps/jsr.io/@std/collections/1.0.9/invert_by.js

@@ -0,0 +1,46 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Composes a new record with all keys and values inverted.
+ *
+ * The new record is generated from the result of running each element of the
+ * input record through the given transformer function.
+ *
+ * The corresponding inverted value of each inverted key is an array of keys
+ * responsible for generating the inverted value.
+ *
+ * @typeParam R The type of the input record.
+ * @typeParam T The type of the iterator function.
+ *
+ * @param record The record to invert.
+ * @param transformer The function to transform keys.
+ *
+ * @returns A new record with all keys and values inverted.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { invertBy } from "@std/collections/invert-by";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const record = { a: "x", b: "y", c: "z" };
+ *
+ * assertEquals(
+ *   invertBy(record, (key) => String(key).toUpperCase()),
+ *   { X: ["a"], Y: ["b"], Z: ["c"] }
+ * );
+ * ```
+ */
+export function invertBy(record, transformer) {
+    const result = {};
+    for (const [key, value] of Object.entries(record)) {
+        const mappedKey = transformer(value);
+        if (!Object.hasOwn(result, mappedKey)) {
+            result[mappedKey] = [key];
+        }
+        else {
+            result[mappedKey].push(key);
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=invert_by.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/invert_by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"invert_by.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/invert_by.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAQrC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,UAAU,QAAQ,CAGtB,MAAmB,EAAE,WAAc;IACnC,MAAM,MAAM,GAAG,EAAgC,CAAC;IAEhD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC;YACtC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/join_to_string.js

@@ -0,0 +1,59 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Transforms the elements in the given array to strings using the given
+ * selector. Joins the produced strings into one using the given `separator`
+ * and applying the given `prefix` and `suffix` to the whole string afterwards.
+ *
+ * If the array could be huge, you can specify a non-negative value of `limit`,
+ * in which case only the first `limit` elements will be appended, followed by
+ * the `truncated` string.
+ *
+ * @typeParam T The type of the elements in the input array.
+ *
+ * @param array The array to join elements from.
+ * @param selector The function to transform elements to strings.
+ * @param options The options to configure the joining.
+ *
+ * @returns The resulting string.
+ *
+ * @example Usage with options
+ * ```ts
+ * import { joinToString } from "@std/collections/join-to-string";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const users = [
+ *   { name: "Kim" },
+ *   { name: "Anna" },
+ *   { name: "Tim" },
+ * ];
+ *
+ * const message = joinToString(users, (user) => user.name, {
+ *   suffix: " are winners",
+ *   prefix: "result: ",
+ *   separator: " and ",
+ *   limit: 1,
+ *   truncated: "others",
+ * });
+ *
+ * assertEquals(message, "result: Kim and others are winners");
+ * ```
+ */
+export function joinToString(array, selector, options = {}) {
+    const { separator = ",", prefix = "", suffix = "", limit = -1, truncated = "...", } = options;
+    let result = "";
+    let index = 0;
+    for (const el of array) {
+        if (index > 0) {
+            result += separator;
+        }
+        if (limit >= 0 && index >= limit) {
+            result += truncated;
+            break;
+        }
+        result += selector(el);
+        index++;
+    }
+    return prefix + result + suffix;
+}
+//# sourceMappingURL=join_to_string.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/join_to_string.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"join_to_string.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/join_to_string.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAqCrC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAkB,EAClB,QAA2B,EAC3B,UAAyC,EAAE;IAE3C,MAAM,EACJ,SAAS,GAAG,GAAG,EACf,MAAM,GAAG,EAAE,EACX,MAAM,GAAG,EAAE,EACX,KAAK,GAAG,CAAC,CAAC,EACV,SAAS,GAAG,KAAK,GAClB,GAAG,OAAO,CAAC;IAEZ,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,IAAI,SAAS,CAAC;QACtB,CAAC;QAED,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACjC,MAAM,IAAI,SAAS,CAAC;YACpB,MAAM;QACR,CAAC;QAED,MAAM,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;QACvB,KAAK,EAAE,CAAC;IACV,CAAC;IAED,OAAO,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;AAClC,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/map_entries.js

@@ -0,0 +1,47 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Applies the given transformer to all entries in the given record and returns
+ * a new record containing the results.
+ *
+ * @typeParam T The type of the values in the input record.
+ * @typeParam O The type of the values in the output record.
+ *
+ * @param record The record to map entries from.
+ * @param transformer The function to transform each entry.
+ *
+ * @returns A new record with all entries transformed by the given transformer.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { mapEntries } from "@std/collections/map-entries";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const usersById = {
+ *   "a2e": { name: "Kim", age: 22 },
+ *   "dfe": { name: "Anna", age: 31 },
+ *   "34b": { name: "Tim", age: 58 },
+ * };
+ *
+ * const agesByNames = mapEntries(usersById, ([id, { name, age }]) => [name, age]);
+ *
+ * assertEquals(
+ *   agesByNames,
+ *   {
+ *     Kim: 22,
+ *     Anna: 31,
+ *     Tim: 58,
+ *   },
+ * );
+ * ```
+ */
+export function mapEntries(record, transformer) {
+    const result = {};
+    const entries = Object.entries(record);
+    for (const entry of entries) {
+        const [mappedKey, mappedValue] = transformer(entry);
+        result[mappedKey] = mappedValue;
+    }
+    return result;
+}
+//# sourceMappingURL=map_entries.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/map_entries.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"map_entries.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/map_entries.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,UAAU,UAAU,CACxB,MAAmC,EACnC,WAAgD;IAEhD,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAEvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,CAAC,SAAS,EAAE,WAAW,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QAEpD,MAAM,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC;IAClC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/map_keys.js

@@ -0,0 +1,42 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Applies the given transformer to all keys in the given record's entries and
+ * returns a new record containing the transformed entries.
+ *
+ * If the transformed entries contain the same key multiple times, only the last
+ * one will appear in the returned record.
+ *
+ * @typeParam T The type of the values in the input record.
+ *
+ * @param record The record to map keys from.
+ * @param transformer The function to transform each key.
+ *
+ * @returns A new record with all keys transformed by the given transformer.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { mapKeys } from "@std/collections/map-keys";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const counts = { a: 5, b: 3, c: 8 };
+ *
+ * assertEquals(
+ *   mapKeys(counts, (key) => key.toUpperCase()),
+ *   {
+ *     A: 5,
+ *     B: 3,
+ *     C: 8,
+ *   },
+ * );
+ * ```
+ */
+export function mapKeys(record, transformer) {
+    const result = {};
+    for (const [key, value] of Object.entries(record)) {
+        const mappedKey = transformer(key);
+        result[mappedKey] = value;
+    }
+    return result;
+}
+//# sourceMappingURL=map_keys.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/map_keys.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"map_keys.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/map_keys.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,UAAU,OAAO,CACrB,MAAmC,EACnC,WAAoC;IAEpC,MAAM,MAAM,GAAsB,EAAE,CAAC;IAErC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/map_not_nullish.js

@@ -0,0 +1,43 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns a new array, containing all elements in the given array transformed
+ * using the given transformer, except the ones that were transformed to `null`
+ * or `undefined`.
+ *
+ * @typeParam T The type of the elements in the input array.
+ * @typeParam O The type of the elements in the output array.
+ *
+ * @param array The array to map elements from.
+ * @param transformer The function to transform each element.
+ *
+ * @returns A new array with all elements transformed by the given transformer,
+ * except the ones that were transformed to `null` or `undefined`.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { mapNotNullish } from "@std/collections/map-not-nullish";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const people = [
+ *   { middleName: null },
+ *   { middleName: "William" },
+ *   { middleName: undefined },
+ *   { middleName: "Martha" },
+ * ];
+ * const foundMiddleNames = mapNotNullish(people, (people) => people.middleName);
+ *
+ * assertEquals(foundMiddleNames, ["William", "Martha"]);
+ * ```
+ */
+export function mapNotNullish(array, transformer) {
+    const result = [];
+    for (const element of array) {
+        const transformedElement = transformer(element);
+        if (transformedElement !== undefined && transformedElement !== null) {
+            result.push(transformedElement);
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=map_not_nullish.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/map_not_nullish.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"map_not_nullish.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/map_not_nullish.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAkB,EAClB,WAAyB;IAEzB,MAAM,MAAM,GAAqB,EAAE,CAAC;IAEpC,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,kBAAkB,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;QAEhD,IAAI,kBAAkB,KAAK,SAAS,IAAI,kBAAkB,KAAK,IAAI,EAAE,CAAC;YACpE,MAAM,CAAC,IAAI,CAAC,kBAAoC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/map_values.js

@@ -0,0 +1,13 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+export function mapValues(record, transformer) {
+    // deno-lint-ignore no-explicit-any
+    const result = {};
+    const entries = Object.entries(record);
+    for (const [key, value] of entries) {
+        const mappedValue = transformer(value, key);
+        result[key] = mappedValue;
+    }
+    return result;
+}
+//# sourceMappingURL=map_values.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/map_values.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"map_values.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/map_values.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AA8ErC,MAAM,UAAU,SAAS,CACvB,MAAoB,EACpB,WAAoC;IAGpC,mCAAmC;IACnC,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAI,MAAM,CAAC,CAAC;IAE1C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QACnC,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,EAAE,GAAQ,CAAC,CAAC;QAEjD,MAAM,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;IAC5B,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/max_by.js

@@ -0,0 +1,15 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+export function maxBy(array, selector) {
+    let max;
+    let maxValue;
+    for (const current of array) {
+        const currentValue = selector(current);
+        if (maxValue === undefined || currentValue > maxValue) {
+            max = current;
+            maxValue = currentValue;
+        }
+    }
+    return max;
+}
+//# sourceMappingURL=max_by.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/max_by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"max_by.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/max_by.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAkIrC,MAAM,UAAU,KAAK,CACnB,KAAkB,EAClB,QAIqB;IAErB,IAAI,GAAkB,CAAC;IACvB,IAAI,QAAiD,CAAC;IAEtD,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAEvC,IAAI,QAAQ,KAAK,SAAS,IAAI,YAAY,GAAG,QAAQ,EAAE,CAAC;YACtD,GAAG,GAAG,OAAO,CAAC;YACd,QAAQ,GAAG,YAAY,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/max_of.js

@@ -0,0 +1,17 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+export function maxOf(array, selector) {
+    let maximumValue;
+    for (const element of array) {
+        const currentValue = selector(element);
+        if (maximumValue === undefined || currentValue > maximumValue) {
+            maximumValue = currentValue;
+            continue;
+        }
+        if (Number.isNaN(currentValue)) {
+            return currentValue;
+        }
+    }
+    return maximumValue;
+}
+//# sourceMappingURL=max_of.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/max_of.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"max_of.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/max_of.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAoErC,MAAM,UAAU,KAAK,CACnB,KAAkB,EAClB,QAAW;IAEX,IAAI,YAAuC,CAAC;IAE5C,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAkB,CAAC;QAExD,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,GAAG,YAAY,EAAE,CAAC;YAC9D,YAAY,GAAG,YAAY,CAAC;YAC5B,SAAS;QACX,CAAC;QAED,IAAI,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;YAC/B,OAAO,YAAY,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/max_with.js

@@ -0,0 +1,41 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns the first element having the largest value according to the provided
+ * comparator or undefined if there are no elements.
+ *
+ * The comparator is expected to work exactly like one passed to `Array.sort`,
+ * which means that `comparator(a, b)` should return a negative number if
+ * `a < b`, a positive number if `a > b` and `0` if `a === b`.
+ *
+ * @typeParam T The type of the elements in the array.
+ *
+ * @param array The array to find the maximum element in.
+ * @param comparator The function to compare elements.
+ *
+ * @returns The first element that is the largest value of the given function or
+ * undefined if there are no elements.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { maxWith } from "@std/collections/max-with";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const people = ["Kim", "Anna", "John", "Arthur"];
+ * const largestName = maxWith(people, (a, b) => a.length - b.length);
+ *
+ * assertEquals(largestName, "Arthur");
+ * ```
+ */
+export function maxWith(array, comparator) {
+    let max;
+    let isFirst = true;
+    for (const current of array) {
+        if (isFirst || comparator(current, max) > 0) {
+            max = current;
+            isFirst = false;
+        }
+    }
+    return max;
+}
+//# sourceMappingURL=max_with.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/max_with.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"max_with.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/max_with.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,UAAU,OAAO,CACrB,KAAkB,EAClB,UAAkC;IAElC,IAAI,GAAkB,CAAC;IACvB,IAAI,OAAO,GAAG,IAAI,CAAC;IAEnB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,IAAI,OAAO,IAAI,UAAU,CAAC,OAAO,EAAM,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAChD,GAAG,GAAG,OAAO,CAAC;YACd,OAAO,GAAG,KAAK,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/min_by.js

@@ -0,0 +1,15 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+export function minBy(array, selector) {
+    let min;
+    let minValue;
+    for (const current of array) {
+        const currentValue = selector(current);
+        if (minValue === undefined || currentValue < minValue) {
+            min = current;
+            minValue = currentValue;
+        }
+    }
+    return min;
+}
+//# sourceMappingURL=min_by.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/min_by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min_by.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/min_by.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAgIrC,MAAM,UAAU,KAAK,CACnB,KAAkB,EAClB,QAIqB;IAErB,IAAI,GAAkB,CAAC;IACvB,IAAI,QAAiD,CAAC;IAEtD,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAEvC,IAAI,QAAQ,KAAK,SAAS,IAAI,YAAY,GAAG,QAAQ,EAAE,CAAC;YACtD,GAAG,GAAG,OAAO,CAAC;YACd,QAAQ,GAAG,YAAY,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/min_of.js

@@ -0,0 +1,17 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+export function minOf(array, selector) {
+    let minimumValue;
+    for (const element of array) {
+        const currentValue = selector(element);
+        if (minimumValue === undefined || currentValue < minimumValue) {
+            minimumValue = currentValue;
+            continue;
+        }
+        if (Number.isNaN(currentValue)) {
+            return currentValue;
+        }
+    }
+    return minimumValue;
+}
+//# sourceMappingURL=min_of.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/min_of.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min_of.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/min_of.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAoErC,MAAM,UAAU,KAAK,CACnB,KAAkB,EAClB,QAAW;IAEX,IAAI,YAAuC,CAAC;IAE5C,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAkB,CAAC;QAExD,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,GAAG,YAAY,EAAE,CAAC;YAC9D,YAAY,GAAG,YAAY,CAAC;YAC5B,SAAS;QACX,CAAC;QAED,IAAI,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;YAC/B,OAAO,YAAY,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/min_with.js

@@ -0,0 +1,37 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns the first element having the smallest value according to the provided
+ * comparator or undefined if there are no elements.
+ *
+ * @typeParam T The type of the elements in the array.
+ *
+ * @param array The array to find the minimum element in.
+ * @param comparator The function to compare elements.
+ *
+ * @returns The first element that is the smallest value of the given function
+ * or undefined if there are no elements.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { minWith } from "@std/collections/min-with";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const people = ["Kim", "Anna", "John"];
+ * const smallestName = minWith(people, (a, b) => a.length - b.length);
+ *
+ * assertEquals(smallestName, "Kim");
+ * ```
+ */
+export function minWith(array, comparator) {
+    let min;
+    let isFirst = true;
+    for (const current of array) {
+        if (isFirst || comparator(current, min) < 0) {
+            min = current;
+            isFirst = false;
+        }
+    }
+    return min;
+}
+//# sourceMappingURL=min_with.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/min_with.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min_with.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/min_with.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,OAAO,CACrB,KAAkB,EAClB,UAAkC;IAElC,IAAI,GAAkB,CAAC;IACvB,IAAI,OAAO,GAAG,IAAI,CAAC;IAEnB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,IAAI,OAAO,IAAI,UAAU,CAAC,OAAO,EAAM,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAChD,GAAG,GAAG,OAAO,CAAC;YACd,OAAO,GAAG,KAAK,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/mod.js

@@ -0,0 +1,75 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Pure functions for common tasks around collection types like arrays and
+ * objects.
+ *
+ * Inspired by
+ * {@link https://kotlinlang.org/api/latest/jvm/stdlib/kotlin.collections/ | Kotlin's Collections}
+ * package and {@link https://lodash.com/ | Lodash}.
+ *
+ * ```ts
+ * import { intersect, sample, pick } from "@std/collections";
+ * import { assertEquals, assertArrayIncludes } from "@std/assert";
+ *
+ * const lisaInterests = ["Cooking", "Music", "Hiking"];
+ * const kimInterests = ["Music", "Tennis", "Cooking"];
+ *
+ * assertEquals(intersect(lisaInterests, kimInterests), ["Cooking", "Music"]);
+ *
+ * assertArrayIncludes(lisaInterests, [sample(lisaInterests)]);
+ *
+ * const cat = { name: "Lulu", age: 3, breed: "Ragdoll" };
+ *
+ * assertEquals(pick(cat, ["name", "breed"]), { name: "Lulu", breed: "Ragdoll"});
+ * ```
+ *
+ * @module
+ */
+export * from "./aggregate_groups.js";
+export * from "./associate_by.js";
+export * from "./associate_with.js";
+export * from "./chunk.js";
+export * from "./deep_merge.js";
+export * from "./distinct.js";
+export * from "./distinct_by.js";
+export * from "./drop_last_while.js";
+export * from "./drop_while.js";
+export * from "./filter_entries.js";
+export * from "./filter_keys.js";
+export * from "./filter_values.js";
+export * from "./find_single.js";
+export * from "./first_not_nullish_of.js";
+export * from "./includes_value.js";
+export * from "./intersect.js";
+export * from "./invert_by.js";
+export * from "./invert.js";
+export * from "./join_to_string.js";
+export * from "./map_entries.js";
+export * from "./map_keys.js";
+export * from "./map_not_nullish.js";
+export * from "./map_values.js";
+export * from "./max_by.js";
+export * from "./max_of.js";
+export * from "./max_with.js";
+export * from "./min_by.js";
+export * from "./min_of.js";
+export * from "./min_with.js";
+export * from "./omit.js";
+export * from "./partition.js";
+export * from "./partition_entries.js";
+export * from "./permutations.js";
+export * from "./pick.js";
+export * from "./reduce_groups.js";
+export * from "./running_reduce.js";
+export * from "./sample.js";
+export * from "./sliding_windows.js";
+export * from "./sort_by.js";
+export * from "./sum_of.js";
+export * from "./take_last_while.js";
+export * from "./take_while.js";
+export * from "./union.js";
+export * from "./unzip.js";
+export * from "./without_all.js";
+export * from "./zip.js";
+//# sourceMappingURL=mod.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/mod.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mod.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/mod.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,cAAc,uBAAuB,CAAC;AACtC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,YAAY,CAAC;AAC3B,cAAc,iBAAiB,CAAC;AAChC,cAAc,eAAe,CAAC;AAC9B,cAAc,kBAAkB,CAAC;AACjC,cAAc,sBAAsB,CAAC;AACrC,cAAc,iBAAiB,CAAC;AAChC,cAAc,qBAAqB,CAAC;AACpC,cAAc,kBAAkB,CAAC;AACjC,cAAc,oBAAoB,CAAC;AACnC,cAAc,kBAAkB,CAAC;AACjC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,qBAAqB,CAAC;AACpC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,qBAAqB,CAAC;AACpC,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC;AAC9B,cAAc,sBAAsB,CAAC;AACrC,cAAc,iBAAiB,CAAC;AAChC,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,eAAe,CAAC;AAC9B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,eAAe,CAAC;AAC9B,cAAc,WAAW,CAAC;AAC1B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,wBAAwB,CAAC;AACvC,cAAc,mBAAmB,CAAC;AAClC,cAAc,WAAW,CAAC;AAC1B,cAAc,oBAAoB,CAAC;AACnC,cAAc,qBAAqB,CAAC;AACpC,cAAc,aAAa,CAAC;AAC5B,cAAc,sBAAsB,CAAC;AACrC,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,sBAAsB,CAAC;AACrC,cAAc,iBAAiB,CAAC;AAChC,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,cAAc,UAAU,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/omit.js

@@ -0,0 +1,29 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Creates a new object by excluding the specified keys from the provided object.
+ *
+ * @typeParam T The type of the object.
+ * @typeParam K The type of the keys to omit.
+ *
+ * @param obj The object to omit keys from.
+ * @param keys The keys to omit from the object.
+ *
+ * @returns A new object with the specified keys omitted.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { omit } from "@std/collections/omit";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const obj = { a: 5, b: 6, c: 7, d: 8 };
+ * const omitted = omit(obj, ["a", "c"]);
+ *
+ * assertEquals(omitted, { b: 6, d: 8 });
+ * ```
+ */
+export function omit(obj, keys) {
+    const excludes = new Set(keys);
+    return Object.fromEntries(Object.entries(obj).filter(([k, _]) => !excludes.has(k)));
+}
+//# sourceMappingURL=omit.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/omit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"omit.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/omit.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,IAAI,CAClB,GAAgB,EAChB,IAAkB;IAElB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,OAAO,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAM,CAAC,CAAC,CAChD,CAAC;AAClB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/partition.js

@@ -0,0 +1,16 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+export function partition(array, predicate) {
+    const matches = [];
+    const rest = [];
+    for (const element of array) {
+        if (predicate(element)) {
+            matches.push(element);
+        }
+        else {
+            rest.push(element);
+        }
+    }
+    return [matches, rest];
+}
+//# sourceMappingURL=partition.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/partition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partition.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/partition.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAmErC,MAAM,UAAU,SAAS,CACvB,KAAwB,EACxB,SAAmC;IAEnC,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,MAAM,IAAI,GAAmB,EAAE,CAAC;IAEhC,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACzB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/partition_entries.js

@@ -0,0 +1,54 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns a tuple of two records with the first one containing all entries of
+ * the given record that match the given predicate and the second one containing
+ * all that do not.
+ *
+ * @typeParam T The type of the values in the record.
+ *
+ * @param record The record to partition.
+ * @param predicate The predicate function to determine which entries go where.
+ *
+ * @returns A tuple containing two records, the first one containing all entries
+ * that match the predicate and the second one containing all that do not.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { partitionEntries } from "@std/collections/partition-entries";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const menu = {
+ *   Salad: 11,
+ *   Soup: 8,
+ *   Pasta: 13,
+ * };
+ * const myOptions = partitionEntries(
+ *   menu,
+ *   ([item, price]) => item !== "Pasta" && price < 10,
+ * );
+ *
+ * assertEquals(
+ *   myOptions,
+ *   [
+ *     { Soup: 8 },
+ *     { Salad: 11, Pasta: 13 },
+ *   ],
+ * );
+ * ```
+ */
+export function partitionEntries(record, predicate) {
+    const match = {};
+    const rest = {};
+    const entries = Object.entries(record);
+    for (const [key, value] of entries) {
+        if (predicate([key, value])) {
+            match[key] = value;
+        }
+        else {
+            rest[key] = value;
+        }
+    }
+    return [match, rest];
+}
+//# sourceMappingURL=partition_entries.js.map

package/esm/deps/jsr.io/@std/collections/1.0.9/partition_entries.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partition_entries.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/partition_entries.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAmC,EACnC,SAA0C;IAE1C,MAAM,KAAK,GAAsB,EAAE,CAAC;IACpC,MAAM,IAAI,GAAsB,EAAE,CAAC;IACnC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAEvC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QACnC,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;YAC5B,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACvB,CAAC"}