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

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.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"mod.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/mod.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;;;;;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/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.d.ts

@@ -0,0 +1,24 @@
+/**
+ * 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 declare function omit<T extends object, K extends keyof T>(obj: Readonly<T>, keys: readonly K[]): Omit<T, K>;
+//# sourceMappingURL=omit.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"omit.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/omit.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,MAAM,CAAC,EACtD,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,EAChB,IAAI,EAAE,SAAS,CAAC,EAAE,GACjB,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAKZ"}

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.d.ts

@@ -0,0 +1,60 @@
+/**
+ * Returns a tuple of two arrays with the first one containing all elements in
+ * the given array that match the given predicate and the second one containing
+ * all that do not.
+ *
+ * @typeParam T The type of the elements in the array.
+ *
+ * @param array The array to partition.
+ * @param predicate The predicate function to determine which array an element
+ * belongs to.
+ *
+ * @returns A tuple of two arrays. The first array contains all elements that
+ * match the predicate, the second contains all elements that do not.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { partition } from "@std/collections/partition";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [5, 6, 7, 8, 9];
+ * const [even, odd] = partition(numbers, (it) => it % 2 === 0);
+ *
+ * assertEquals(even, [6, 8]);
+ * assertEquals(odd, [5, 7, 9]);
+ * ```
+ */
+export declare function partition<T>(array: Iterable<T>, predicate: (el: T) => boolean): [T[], T[]];
+/**
+ * Returns a tuple of two arrays with the first one containing all elements in
+ * the given array that match the given predicate and the second one containing
+ * all that do not.
+ *
+ * This version of the function is a type-guard version of the function. It
+ * allows you to specify a type-guard predicate function that narrows the type
+ * of the elements in the array.
+ *
+ * @typeParam T The type of the elements in the array.
+ * @typeParam U The type of the elements that match the predicate.
+ *
+ * @param array The array to partition.
+ * @param predicate The type-guard predicate function to determine which array
+ * an element belongs to.
+ *
+ * @returns A tuple of two arrays. The first array contains all elements that
+ * match the predicate, the second contains all elements that do not.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { partition } from "@std/collections/partition";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [5, 6, 7, 8, 9];
+ * const [even, odd] = partition(numbers, (it) => it % 2 === 0);
+ *
+ * assertEquals(even, [6, 8]);
+ * assertEquals(odd, [5, 7, 9]);
+ * ```
+ */
+export declare function partition<T, U extends T>(array: Iterable<T>, predicate: (el: T) => el is U): [U[], Exclude<T, U>[]];
+//# sourceMappingURL=partition.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"partition.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/partition.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAClB,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,OAAO,GAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;AACd;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACtC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAClB,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,GAC5B,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,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.d.ts

@@ -0,0 +1,39 @@
+/**
+ * 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 declare function partitionEntries<T>(record: Readonly<Record<string, T>>, predicate: (entry: [string, T]) => boolean): [match: Record<string, T>, rest: Record<string, T>];
+//# sourceMappingURL=partition_entries.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"partition_entries.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/partition_entries.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAChC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EACnC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,OAAO,GACzC,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAcrD"}

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"}

package/esm/deps/jsr.io/@std/collections/1.0.9/permutations.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Builds all possible orders of all elements in the given array
+ * Ignores equality of elements, meaning this will always return the same
+ * number of permutations for a given length of input.
+ *
+ * @typeParam T The type of the elements in the array.
+ *
+ * @param inputArray The array to build permutations from.
+ *
+ * @returns An array of all possible permutations of the given array.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { permutations } from "@std/collections/permutations";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [ 1, 2 ];
+ * const windows = permutations(numbers);
+ *
+ * assertEquals(windows, [
+ *   [ 1, 2 ],
+ *   [ 2, 1 ],
+ * ]);
+ * ```
+ */
+export declare function permutations<T>(inputArray: Iterable<T>): T[][];
+//# sourceMappingURL=permutations.d.ts.map

package/esm/deps/jsr.io/@std/collections/1.0.9/permutations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"permutations.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/permutations.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAqC9D"}

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

@@ -0,0 +1,58 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Builds all possible orders of all elements in the given array
+ * Ignores equality of elements, meaning this will always return the same
+ * number of permutations for a given length of input.
+ *
+ * @typeParam T The type of the elements in the array.
+ *
+ * @param inputArray The array to build permutations from.
+ *
+ * @returns An array of all possible permutations of the given array.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { permutations } from "@std/collections/permutations";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [ 1, 2 ];
+ * const windows = permutations(numbers);
+ *
+ * assertEquals(windows, [
+ *   [ 1, 2 ],
+ *   [ 2, 1 ],
+ * ]);
+ * ```
+ */
+export function permutations(inputArray) {
+    const result = [];
+    const array = [...inputArray];
+    const k = array.length;
+    if (k === 0) {
+        return result;
+    }
+    // Heap's Algorithm
+    const c = new Array(k).fill(0);
+    result.push([...array]);
+    let i = 1;
+    while (i < k) {
+        if (c[i] < i) {
+            if (i % 2 === 0) {
+                [array[0], array[i]] = [array[i], array[0]];
+            }
+            else {
+                [array[c[i]], array[i]] = [array[i], array[c[i]]];
+            }
+            result.push([...array]);
+            c[i] += 1;
+            i = 1;
+        }
+        else {
+            c[i] = 0;
+            i += 1;
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=permutations.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"permutations.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/permutations.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,YAAY,CAAI,UAAuB;IACrD,MAAM,MAAM,GAAU,EAAE,CAAC;IAEzB,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;IAE9B,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,mBAAmB;IACnB,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEvC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAExB,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,CAAC;YACd,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChB,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAW,CAAC;YACxD,CAAC;iBAAM,CAAC;gBACN,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAW,CAAC;YAChE,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YAExB,CAAC,CAAC,CAAC,CAAE,IAAI,CAAC,CAAC;YACX,CAAC,GAAG,CAAC,CAAC;QACR,CAAC;aAAM,CAAC;YACN,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/pick.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Creates a new object by including the specified keys from the provided
+ * object.
+ *
+ * @typeParam T The type of the object.
+ * @typeParam K The type of the keys.
+ *
+ * @param obj The object to pick keys from.
+ * @param keys The keys to include in the new object.
+ *
+ * @returns A new object with the specified keys from the provided object.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { pick } from "@std/collections/pick";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const obj = { a: 5, b: 6, c: 7, d: 8 };
+ * const picked = pick(obj, ["a", "c"]);
+ *
+ * assertEquals(picked, { a: 5, c: 7 });
+ * ```
+ */
+export declare function pick<T extends object, K extends keyof T>(obj: Readonly<T>, keys: readonly K[]): Pick<T, K>;
+//# sourceMappingURL=pick.d.ts.map

package/esm/deps/jsr.io/@std/collections/1.0.9/pick.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pick.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/pick.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,MAAM,CAAC,EACtD,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,EAChB,IAAI,EAAE,SAAS,CAAC,EAAE,GACjB,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAIZ"}

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

@@ -0,0 +1,33 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Creates a new object by including the specified keys from the provided
+ * object.
+ *
+ * @typeParam T The type of the object.
+ * @typeParam K The type of the keys.
+ *
+ * @param obj The object to pick keys from.
+ * @param keys The keys to include in the new object.
+ *
+ * @returns A new object with the specified keys from the provided object.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { pick } from "@std/collections/pick";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const obj = { a: 5, b: 6, c: 7, d: 8 };
+ * const picked = pick(obj, ["a", "c"]);
+ *
+ * assertEquals(picked, { a: 5, c: 7 });
+ * ```
+ */
+export function pick(obj, keys) {
+    const result = {};
+    for (const key of keys)
+        if (key in obj)
+            result[key] = obj[key];
+    return result;
+}
+//# sourceMappingURL=pick.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pick.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/pick.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,IAAI,CAClB,GAAgB,EAChB,IAAkB;IAElB,MAAM,MAAM,GAAG,EAAgB,CAAC;IAChC,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,IAAI,GAAG,IAAI,GAAG;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/D,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/reduce_groups.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Applies the given reducer to each group in the given grouping, returning the
+ * results together with the respective group keys.
+ *
+ * @typeParam T input type of an item in a group in the given grouping.
+ * @typeParam A type of the accumulator value, which will match the returned
+ * record's values.
+ *
+ * @param record The grouping to reduce.
+ * @param reducer The reducer function to apply to each group.
+ * @param initialValue The initial value of the accumulator.
+ *
+ * @returns A record with the same keys as the input grouping, where each value
+ * is the result of applying the reducer to the respective group.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { reduceGroups } from "@std/collections/reduce-groups";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const votes = {
+ *   Woody: [2, 3, 1, 4],
+ *   Buzz: [5, 9],
+ * };
+ *
+ * const totalVotes = reduceGroups(votes, (sum, vote) => sum + vote, 0);
+ *
+ * assertEquals(totalVotes, {
+ *   Woody: 10,
+ *   Buzz: 14,
+ * });
+ * ```
+ */
+export declare function reduceGroups<T, A>(record: Readonly<Record<string, ReadonlyArray<T>>>, reducer: (accumulator: A, current: T) => A, initialValue: A): Record<string, A>;
+//# sourceMappingURL=reduce_groups.d.ts.map

package/esm/deps/jsr.io/@std/collections/1.0.9/reduce_groups.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce_groups.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/reduce_groups.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAC/B,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,EAClD,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,EAC1C,YAAY,EAAE,CAAC,GACd,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAEnB"}