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

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

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/chunk.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,MAAM,UAAU,KAAK,CAAI,KAAmB,EAAE,IAAY;IACxD,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,UAAU,CAClB,2DAA2D,IAAI,EAAE,CAClE,CAAC;IACJ,CAAC;IAED,MAAM,MAAM,GAAU,EAAE,CAAC;IACzB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;QAC9C,KAAK,IAAI,IAAI,CAAC;IAChB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,96 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+import { filterInPlace } from "./_utils.js";
+export function deepMerge(record, other, options) {
+    return deepMergeInternal(record, other, new Set(), options);
+}
+function deepMergeInternal(record, other, seen, options) {
+    const result = {};
+    const keys = new Set([
+        ...getKeys(record),
+        ...getKeys(other),
+    ]);
+    // Iterate through each key of other object and use correct merging strategy
+    for (const key of keys) {
+        // Skip to prevent Object.prototype.__proto__ accessor property calls on non-Deno platforms
+        if (key === "__proto__") {
+            continue;
+        }
+        const a = record[key];
+        if (!Object.hasOwn(other, key)) {
+            result[key] = a;
+            continue;
+        }
+        const b = other[key];
+        if (isNonNullObject(a) && isNonNullObject(b) && !seen.has(a) && !seen.has(b)) {
+            seen.add(a);
+            seen.add(b);
+            result[key] = mergeObjects(a, b, seen, options);
+            continue;
+        }
+        // Override value
+        result[key] = b;
+    }
+    return result;
+}
+function mergeObjects(left, right, seen, options = {
+    arrays: "merge",
+    sets: "merge",
+    maps: "merge",
+}) {
+    // Recursively merge mergeable objects
+    if (isMergeable(left) && isMergeable(right)) {
+        return deepMergeInternal(left, right, seen, options);
+    }
+    if (isIterable(left) && isIterable(right)) {
+        // Handle arrays
+        if ((Array.isArray(left)) && (Array.isArray(right))) {
+            if (options.arrays === "merge") {
+                return left.concat(right);
+            }
+            return right;
+        }
+        // Handle maps
+        if ((left instanceof Map) && (right instanceof Map)) {
+            if (options.maps === "merge") {
+                return new Map([
+                    ...left,
+                    ...right,
+                ]);
+            }
+            return right;
+        }
+        // Handle sets
+        if ((left instanceof Set) && (right instanceof Set)) {
+            if (options.sets === "merge") {
+                return new Set([
+                    ...left,
+                    ...right,
+                ]);
+            }
+            return right;
+        }
+    }
+    return right;
+}
+/**
+ * Test whether a value is mergeable or not
+ * Builtins that look like objects, null and user defined classes
+ * are not considered mergeable (it means that reference will be copied)
+ */
+function isMergeable(value) {
+    return Object.getPrototypeOf(value) === Object.prototype;
+}
+function isIterable(value) {
+    return typeof value[Symbol.iterator] === "function";
+}
+function isNonNullObject(value) {
+    return value !== null && typeof value === "object";
+}
+function getKeys(record) {
+    const result = Object.getOwnPropertySymbols(record);
+    filterInPlace(result, (key) => Object.prototype.propertyIsEnumerable.call(record, key));
+    result.push(...Object.keys(record));
+    return result;
+}
+//# sourceMappingURL=deep_merge.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"deep_merge.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/deep_merge.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAwM5C,MAAM,UAAU,SAAS,CASvB,MAAmB,EACnB,KAAkB,EAClB,OAA2B;IAE3B,OAAO,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,OAAO,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,iBAAiB,CASxB,MAAmB,EACnB,KAAkB,EAClB,IAA+B,EAC/B,OAA2B;IAK3B,MAAM,MAAM,GAAoB,EAAE,CAAC;IAEnC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;QACnB,GAAG,OAAO,CAAC,MAAM,CAAC;QAClB,GAAG,OAAO,CAAC,KAAK,CAAC;KAClB,CAAsB,CAAC;IAExB,4EAA4E;IAC5E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,2FAA2F;QAC3F,IAAI,GAAG,KAAK,WAAW,EAAE,CAAC;YACxB,SAAS;QACX,CAAC;QAID,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAiB,CAAC;QAEtC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEhB,SAAS;QACX,CAAC;QAED,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAiB,CAAC;QAErC,IACE,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EACxE,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,CAAiB,CAAC;YAEhE,SAAS;QACX,CAAC;QAED,iBAAiB;QACjB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,OAAO,MAAgB,CAAC;AAC1B,CAAC;AAED,SAAS,YAAY,CACnB,IAAoD,EACpD,KAAqD,EACrD,IAA+B,EAC/B,UAAsC;IACpC,MAAM,EAAE,OAAO;IACf,IAAI,EAAE,OAAO;IACb,IAAI,EAAE,OAAO;CACd;IAED,sCAAsC;IACtC,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5C,OAAO,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1C,gBAAgB;QAChB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACpD,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;gBAC/B,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC;YAED,OAAO,KAAK,CAAC;QACf,CAAC;QAED,cAAc;QACd,IAAI,CAAC,IAAI,YAAY,GAAG,CAAC,IAAI,CAAC,KAAK,YAAY,GAAG,CAAC,EAAE,CAAC;YACpD,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC7B,OAAO,IAAI,GAAG,CAAC;oBACb,GAAG,IAAI;oBACP,GAAG,KAAK;iBACT,CAAC,CAAC;YACL,CAAC;YAED,OAAO,KAAK,CAAC;QACf,CAAC;QAED,cAAc;QACd,IAAI,CAAC,IAAI,YAAY,GAAG,CAAC,IAAI,CAAC,KAAK,YAAY,GAAG,CAAC,EAAE,CAAC;YACpD,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC7B,OAAO,IAAI,GAAG,CAAC;oBACb,GAAG,IAAI;oBACP,GAAG,KAAK;iBACT,CAAC,CAAC;YACL,CAAC;YAED,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAClB,KAA2B;IAE3B,OAAO,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,SAAS,CAAC;AAC3D,CAAC;AAED,SAAS,UAAU,CACjB,KAA2B;IAE3B,OAAO,OAAQ,KAA2B,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,CAAC;AAC7E,CAAC;AAED,SAAS,eAAe,CACtB,KAAc;IAEd,OAAO,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,CAAC;AACrD,CAAC;AAED,SAAS,OAAO,CAAoC,MAAS;IAC3D,MAAM,MAAM,GAAG,MAAM,CAAC,qBAAqB,CAAC,MAAM,CAAmB,CAAC;IACtE,aAAa,CACX,MAAM,EACN,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CACjE,CAAC;IACF,MAAM,CAAC,IAAI,CAAC,GAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAoB,CAAC,CAAC;IAExD,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,28 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns all distinct elements in the given array, preserving order by first
+ * occurrence.
+ *
+ * @typeParam T The type of the elements in the input array.
+ *
+ * @param array The array to filter for distinct elements.
+ *
+ * @returns An array of distinct elements in the input array.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { distinct } from "@std/collections/distinct";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [3, 2, 5, 2, 5];
+ * const distinctNumbers = distinct(numbers);
+ *
+ * assertEquals(distinctNumbers, [3, 2, 5]);
+ * ```
+ */
+export function distinct(array) {
+    const set = new Set(array);
+    return Array.from(set);
+}
+//# sourceMappingURL=distinct.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"distinct.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/distinct.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,QAAQ,CAAI,KAAkB;IAC5C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAE3B,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC"}

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

@@ -0,0 +1,39 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns all elements in the given array that produce a distinct value using
+ * the given selector, preserving order by first occurrence.
+ *
+ * @typeParam T The type of the elements in the input array.
+ * @typeParam D The type of the values produced by the selector function.
+ *
+ * @param array The array to filter for distinct elements.
+ * @param selector The function to extract the value to compare for
+ * distinctness.
+ *
+ * @returns An array of distinct elements in the input array.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { distinctBy } from "@std/collections/distinct-by";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const names = ["Anna", "Kim", "Arnold", "Kate"];
+ * const exampleNamesByFirstLetter = distinctBy(names, (name) => name.charAt(0));
+ *
+ * assertEquals(exampleNamesByFirstLetter, ["Anna", "Kim"]);
+ * ```
+ */
+export function distinctBy(array, selector) {
+    const selectedValues = new Set();
+    const result = [];
+    for (const element of array) {
+        const selected = selector(element);
+        if (!selectedValues.has(selected)) {
+            selectedValues.add(selected);
+            result.push(element);
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=distinct_by.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"distinct_by.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/distinct_by.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,UAAU,CACxB,KAAkB,EAClB,QAAsB;IAEtB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAK,CAAC;IACpC,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,33 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns a new array that drops all elements in the given collection until the
+ * last element that does not match the given predicate.
+ *
+ * @typeParam T The type of the elements in the input array.
+ *
+ * @param array The array to drop elements from.
+ * @param predicate The function to test each element for a condition.
+ *
+ * @returns A new array that drops all elements until the last element that does
+ * not match the given predicate.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { dropLastWhile } from "@std/collections/drop-last-while";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [11, 42, 55, 20, 33, 44];
+ *
+ * const notFortyFour = dropLastWhile(numbers, (number) => number > 30);
+ *
+ * assertEquals(notFortyFour, [11, 42, 55, 20]);
+ * ```
+ */
+export function dropLastWhile(array, predicate) {
+    let offset = array.length;
+    while (0 < offset && predicate(array[offset - 1]))
+        offset--;
+    return array.slice(0, offset);
+}
+//# sourceMappingURL=drop_last_while.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"drop_last_while.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/drop_last_while.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAmB,EACnB,SAA6B;IAE7B,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC1B,OAAO,CAAC,GAAG,MAAM,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAM,CAAC;QAAE,MAAM,EAAE,CAAC;IAEjE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAChC,CAAC"}

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

@@ -0,0 +1,34 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns a new array that drops all elements in the given collection until the
+ * first element that does not match the given predicate.
+ *
+ * @typeParam T The type of the elements in the input array.
+ *
+ * @param array The array to drop elements from.
+ * @param predicate The function to test each element for a condition.
+ *
+ * @returns A new array that drops all elements until the first element that
+ * does not match the given predicate.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { dropWhile } from "@std/collections/drop-while";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [3, 2, 5, 2, 5];
+ * const dropWhileNumbers = dropWhile(numbers, (number) => number !== 2);
+ *
+ * assertEquals(dropWhileNumbers, [2, 5, 2, 5]);
+ * ```
+ */
+export function dropWhile(array, predicate) {
+    let offset = 0;
+    const length = array.length;
+    while (length > offset && predicate(array[offset])) {
+        offset++;
+    }
+    return array.slice(offset, length);
+}
+//# sourceMappingURL=drop_while.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"drop_while.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/drop_while.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,SAAS,CACvB,KAAmB,EACnB,SAA6B;IAE7B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,OAAO,MAAM,GAAG,MAAM,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,CAAM,CAAC,EAAE,CAAC;QACxD,MAAM,EAAE,CAAC;IACX,CAAC;IAED,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AACrC,CAAC"}

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

@@ -0,0 +1,43 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns a new record with all entries of the given record except the ones
+ * that do not match the given predicate.
+ *
+ * @typeParam T The type of the values in the input record.
+ *
+ * @param record The record to filter entries from.
+ * @param predicate The function to test each entry for a condition.
+ *
+ * @returns A new record with all entries that match the given predicate.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { filterEntries } from "@std/collections/filter-entries";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const menu = {
+ *   Salad: 11,
+ *   Soup: 8,
+ *   Pasta: 13,
+ * };
+ *
+ * const myOptions = filterEntries(
+ *   menu,
+ *   ([item, price]) => item !== "Pasta" && price < 10,
+ * );
+ *
+ * assertEquals(myOptions, { Soup: 8 });
+ * ```
+ */
+export function filterEntries(record, predicate) {
+    const result = {};
+    const entries = Object.entries(record);
+    for (const [key, value] of entries) {
+        if (predicate([key, value])) {
+            result[key] = value;
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=filter_entries.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"filter_entries.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/filter_entries.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAmC,EACnC,SAA0C;IAE1C,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,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,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,46 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns a new record with all entries of the given record except the ones that
+ * have a key that does not match the given predicate.
+ *
+ * @typeParam T The type of the values in the input record.
+ *
+ * @param record The record to filter keys from.
+ * @param predicate The function to test each key for a condition.
+ *
+ * @returns A new record with all entries that have a key that matches the given
+ * predicate.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { filterKeys } from "@std/collections/filter-keys";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const menu = {
+ *   Salad: 11,
+ *   Soup: 8,
+ *   Pasta: 13,
+ * };
+ *
+ * const menuWithoutSalad = filterKeys(menu, (item) => item !== "Salad");
+ *
+ * assertEquals(
+ *   menuWithoutSalad,
+ *   {
+ *     Soup: 8,
+ *     Pasta: 13,
+ *   },
+ * );
+ * ```
+ */
+export function filterKeys(record, predicate) {
+    const result = {};
+    for (const [key, value] of Object.entries(record)) {
+        if (predicate(key)) {
+            result[key] = value;
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=filter_keys.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"filter_keys.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/filter_keys.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,MAAM,UAAU,UAAU,CACxB,MAAmC,EACnC,SAAmC;IAEnC,MAAM,MAAM,GAAsB,EAAE,CAAC;IAErC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,46 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns a new record with all entries of the given record except the ones
+ * that have a value that does not match the given predicate.
+ *
+ * @typeParam T The type of the values in the input record.
+ *
+ * @param record The record to filter values from.
+ * @param predicate The function to test each value for a condition.
+ *
+ * @returns A new record with all entries that have a value that matches the
+ * given predicate.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { filterValues } from "@std/collections/filter-values";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const people = {
+ *   Arnold: 37,
+ *   Sarah: 7,
+ *   Kim: 23,
+ * };
+ * const adults = filterValues(people, (person) => person >= 18);
+ *
+ * assertEquals(
+ *   adults,
+ *   {
+ *     Arnold: 37,
+ *     Kim: 23,
+ *   },
+ * );
+ * ```
+ */
+export function filterValues(record, predicate) {
+    const result = {};
+    const entries = Object.entries(record);
+    for (const [key, value] of entries) {
+        if (predicate(value)) {
+            result[key] = value;
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=filter_values.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"filter_values.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/filter_values.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAmC,EACnC,SAAgC;IAEhC,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,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,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,45 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns an element if and only if that element is the only one matching the
+ * given condition. Returns `undefined` otherwise.
+ *
+ * @typeParam T The type of the elements in the input array.
+ *
+ * @param array The array to find a single element in.
+ * @param predicate The function to test each element for a condition.
+ *
+ * @returns The single element that matches the given condition or `undefined`
+ * if there are zero or more than one matching elements.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { findSingle } from "@std/collections/find-single";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const bookings = [
+ *   { month: "January", active: false },
+ *   { month: "March", active: false },
+ *   { month: "June", active: true },
+ * ];
+ * const activeBooking = findSingle(bookings, (booking) => booking.active);
+ * const inactiveBooking = findSingle(bookings, (booking) => !booking.active);
+ *
+ * assertEquals(activeBooking, { month: "June", active: true });
+ * assertEquals(inactiveBooking, undefined); // There are two applicable items
+ * ```
+ */
+export function findSingle(array, predicate) {
+    let match;
+    let found = false;
+    for (const element of array) {
+        if (predicate(element)) {
+            if (found)
+                return undefined;
+            found = true;
+            match = element;
+        }
+    }
+    return match;
+}
+//# sourceMappingURL=find_single.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"find_single.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/find_single.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,UAAU,UAAU,CACxB,KAAkB,EAClB,SAA6B;IAE7B,IAAI,KAAoB,CAAC;IACzB,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YACvB,IAAI,KAAK;gBAAE,OAAO,SAAS,CAAC;YAC5B,KAAK,GAAG,IAAI,CAAC;YACb,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

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

@@ -0,0 +1,42 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Applies the given selector to elements in the given array until a value is
+ * produced that is neither `null` nor `undefined` and returns that value.
+ * Returns `undefined` if no such value is produced.
+ *
+ * @typeParam T The type of the elements in the input array.
+ * @typeParam O The type of the value produced by the selector function.
+ *
+ * @param array The array to select a value from.
+ * @param selector The function to extract a value from an element.
+ *
+ * @returns The first non-`null` and non-`undefined` value produced by the
+ * selector function, or `undefined` if no such value is produced.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { firstNotNullishOf } from "@std/collections/first-not-nullish-of";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const tables = [
+ *   { number: 11, order: null },
+ *   { number: 12, order: "Soup" },
+ *   { number: 13, order: "Salad" },
+ * ];
+ *
+ * const nextOrder = firstNotNullishOf(tables, (table) => table.order);
+ *
+ * assertEquals(nextOrder, "Soup");
+ * ```
+ */
+export function firstNotNullishOf(array, selector) {
+    for (const current of array) {
+        const selected = selector(current);
+        if (selected !== null && selected !== undefined) {
+            return selected;
+        }
+    }
+    return undefined;
+}
+//# sourceMappingURL=first_not_nullish_of.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"first_not_nullish_of.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/first_not_nullish_of.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAkB,EAClB,QAA2C;IAE3C,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAEnC,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChD,OAAO,QAA0B,CAAC;QACpC,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC"}

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

@@ -0,0 +1,39 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns true if the given value is part of the given object, otherwise it
+ * returns false.
+ *
+ * Note: this doesn't work with non-primitive values. For example,
+ * `includesValue({x: {}}, {})` returns false.
+ *
+ * @typeParam T The type of the values in the input record.
+ *
+ * @param record The record to check for the given value.
+ * @param value The value to check for in the record.
+ *
+ * @returns `true` if the value is part of the record, otherwise `false`.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { includesValue } from "@std/collections/includes-value";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const input = {
+ *   first: 33,
+ *   second: 34,
+ * };
+ *
+ * assertEquals(includesValue(input, 34), true);
+ * ```
+ */
+export function includesValue(record, value) {
+    for (const i in record) {
+        if (Object.hasOwn(record, i) &&
+            (record[i] === value || Number.isNaN(value) && Number.isNaN(record[i]))) {
+            return true;
+        }
+    }
+    return false;
+}
+//# sourceMappingURL=includes_value.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"includes_value.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/includes_value.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAmC,EACnC,KAAQ;IAER,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IACE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EACvE,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

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

@@ -0,0 +1,36 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns all distinct elements that appear at least once in each of the given
+ * arrays.
+ *
+ * @typeParam T The type of the elements in the input arrays.
+ *
+ * @param arrays The arrays to intersect.
+ *
+ * @returns An array of distinct elements that appear at least once in each of
+ * the given arrays.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { intersect } from "@std/collections/intersect";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const lisaInterests = ["Cooking", "Music", "Hiking"];
+ * const kimInterests = ["Music", "Tennis", "Cooking"];
+ * const commonInterests = intersect(lisaInterests, kimInterests);
+ *
+ * assertEquals(commonInterests, ["Cooking", "Music"]);
+ * ```
+ */
+export function intersect(...arrays) {
+    const [array, ...otherArrays] = arrays;
+    let set = new Set(array);
+    for (const array of otherArrays) {
+        set = set.intersection(new Set(array));
+        if (set.size === 0)
+            break;
+    }
+    return [...set];
+}
+//# sourceMappingURL=intersect.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"intersect.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/intersect.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,SAAS,CAAI,GAAG,MAAwB;IACtD,MAAM,CAAC,KAAK,EAAE,GAAG,WAAW,CAAC,GAAG,MAAM,CAAC;IACvC,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,GAAG,GAAG,GAAG,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACvC,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;YAAE,MAAM;IAC5B,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;AAClB,CAAC"}

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

@@ -0,0 +1,29 @@
+// 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.
+ *
+ * If the record contains duplicate values, subsequent values overwrite property
+ * assignments of previous values. If the record contains values which aren't
+ * {@linkcode PropertyKey}s their string representation is used as the key.
+ *
+ * @typeParam T The type of the input record.
+ *
+ * @param record The record to invert.
+ *
+ * @returns A new record with all keys and values inverted.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { invert } from "@std/collections/invert";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const record = { a: "x", b: "y", c: "z" };
+ *
+ * assertEquals(invert(record), { x: "a", y: "b", z: "c" });
+ * ```
+ */
+export function invert(record) {
+    return Object.fromEntries(Object.entries(record).map(([key, value]) => [value, key]));
+}
+//# sourceMappingURL=invert.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"invert.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/invert.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAOrC;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,MAAM,CACpB,MAAmB;IAEnB,OAAO,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAC3D,CAAC;AACJ,CAAC"}