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

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.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.js

@@ -0,0 +1,40 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+import { mapValues } from "./map_values.js";
+/**
+ * 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 function reduceGroups(record, reducer, initialValue) {
+    return mapValues(record, (value) => value.reduce(reducer, initialValue));
+}
+//# sourceMappingURL=reduce_groups.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"reduce_groups.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/reduce_groups.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAE5C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAkD,EAClD,OAA0C,EAC1C,YAAe;IAEf,OAAO,SAAS,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC;AAC3E,CAAC"}

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

@@ -0,0 +1,32 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Calls the given reducer on each element of the given collection, passing its
+ * result as the accumulator to the next respective call, starting with the
+ * given initialValue. Returns all intermediate accumulator results.
+ *
+ * @typeParam T The type of the elements in the array.
+ * @typeParam O The type of the accumulator.
+ *
+ * @param array The array to reduce.
+ * @param reducer The reducer function to apply to each element.
+ * @param initialValue The initial value of the accumulator.
+ *
+ * @returns An array of all intermediate accumulator results.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { runningReduce } from "@std/collections/running-reduce";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [1, 2, 3, 4, 5];
+ * const sumSteps = runningReduce(numbers, (sum, current) => sum + current, 0);
+ *
+ * assertEquals(sumSteps, [1, 3, 6, 10, 15]);
+ * ```
+ */
+export function runningReduce(array, reducer, initialValue) {
+    let currentResult = initialValue;
+    return array.map((el, currentIndex) => currentResult = reducer(currentResult, el, currentIndex));
+}
+//# sourceMappingURL=running_reduce.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"running_reduce.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/running_reduce.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAmB,EACnB,OAAgE,EAChE,YAAe;IAEf,IAAI,aAAa,GAAG,YAAY,CAAC;IACjC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY,EAAE,EAAE,CACpC,aAAa,GAAG,OAAO,CAAC,aAAa,EAAE,EAAE,EAAE,YAAY,CAAC,CACzD,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,35 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Produces a random number between the inclusive `lower` and `upper` bounds.
+ */
+function randomInteger(lower, upper) {
+    return lower + Math.floor(Math.random() * (upper - lower + 1));
+}
+/**
+ * Returns a random element from the given array.
+ *
+ * @typeParam T The type of the elements in the array.
+ * @typeParam O The type of the accumulator.
+ *
+ * @param array The array to sample from.
+ *
+ * @returns A random element from the given array, or `undefined` if the array
+ * is empty.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { sample } from "@std/collections/sample";
+ * import { assertArrayIncludes } from "@std/assert";
+ *
+ * const numbers = [1, 2, 3, 4];
+ * const random = sample(numbers);
+ *
+ * assertArrayIncludes(numbers, [random]);
+ * ```
+ */
+export function sample(array) {
+    const length = array.length;
+    return length ? array[randomInteger(0, length - 1)] : undefined;
+}
+//# sourceMappingURL=sample.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sample.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/sample.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;GAEG;AACH,SAAS,aAAa,CAAC,KAAa,EAAE,KAAa;IACjD,OAAO,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,MAAM,CAAI,KAAmB;IAC3C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAClE,CAAC"}

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

@@ -0,0 +1,57 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Generates sliding views of the given array of the given size and returns a
+ * new array containing all of them.
+ *
+ * If step is set, each window will start that many elements after the last
+ * window's start. (Default: 1)
+ *
+ * If partial is set, windows will be generated for the last elements of the
+ * collection, resulting in some undefined values if size is greater than 1.
+ *
+ * @typeParam T The type of the array elements.
+ *
+ * @param array The array to generate sliding windows from.
+ * @param size The size of the sliding windows.
+ * @param options The options for generating sliding windows.
+ *
+ * @returns A new array containing all sliding windows of the given size.
+ *
+ * @example Usage
+ * ```ts
+ * import { slidingWindows } from "@std/collections/sliding-windows";
+ * import { assertEquals } from "@std/assert";
+ * const numbers = [1, 2, 3, 4, 5];
+ *
+ * const windows = slidingWindows(numbers, 3);
+ * assertEquals(windows, [
+ *   [1, 2, 3],
+ *   [2, 3, 4],
+ *   [3, 4, 5],
+ * ]);
+ *
+ * const windowsWithStep = slidingWindows(numbers, 3, { step: 2 });
+ * assertEquals(windowsWithStep, [
+ *   [1, 2, 3],
+ *   [3, 4, 5],
+ * ]);
+ *
+ * const windowsWithPartial = slidingWindows(numbers, 3, { partial: true });
+ * assertEquals(windowsWithPartial, [
+ *   [1, 2, 3],
+ *   [2, 3, 4],
+ *   [3, 4, 5],
+ *   [4, 5],
+ *   [5],
+ * ]);
+ * ```
+ */
+export function slidingWindows(array, size, options = {}) {
+    const { step = 1, partial = false } = options;
+    if (!Number.isInteger(size) || !Number.isInteger(step) || size <= 0 || step <= 0) {
+        throw new RangeError("Both size and step must be positive integer.");
+    }
+    return Array.from({ length: Math.floor((array.length - (partial ? 1 : size)) / step + 1) }, (_, i) => array.slice(i * step, i * step + size));
+}
+//# sourceMappingURL=sliding_windows.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sliding_windows.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/sliding_windows.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAoBrC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAmB,EACnB,IAAY,EACZ,UAAiC,EAAE;IAEnC,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,OAAO,GAAG,KAAK,EAAE,GAAG,OAAO,CAAC;IAE9C,IACE,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAC5E,CAAC;QACD,MAAM,IAAI,UAAU,CAAC,8CAA8C,CAAC,CAAC;IACvE,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CACf,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,EACxE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CACjD,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,30 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+export function sortBy(array, selector, options) {
+    const len = array.length;
+    const indexes = new Array(len);
+    const selectors = new Array(len);
+    const order = options?.order ?? "asc";
+    array.forEach((element, index) => {
+        indexes[index] = index;
+        const selected = selector(element);
+        selectors[index] = Number.isNaN(selected) ? null : selected;
+    });
+    indexes.sort((ai, bi) => {
+        let a = selectors[ai];
+        let b = selectors[bi];
+        if (order === "desc") {
+            [a, b] = [b, a];
+        }
+        if (a === null)
+            return 1;
+        if (b === null)
+            return -1;
+        return a > b ? 1 : a < b ? -1 : 0;
+    });
+    for (let i = 0; i < len; i++) {
+        indexes[i] = array[indexes[i]];
+    }
+    return indexes;
+}
+//# sourceMappingURL=sort_by.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sort_by.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/sort_by.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAqLrC,MAAM,UAAU,MAAM,CACpB,KAAmB,EACnB,QAIqB,EACrB,OAAuB;IAEvB,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC;IACvC,MAAM,SAAS,GAAG,IAAI,KAAK,CAAqC,GAAG,CAAC,CAAC;IACrE,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,KAAK,CAAC;IAEtC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;QAC/B,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QACvB,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QACnC,SAAS,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;QACtB,IAAI,CAAC,GAAG,SAAS,CAAC,EAAE,CAAE,CAAC;QACvB,IAAI,CAAC,GAAG,SAAS,CAAC,EAAE,CAAE,CAAC;QACvB,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,OAA0B,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAE,CAAM,CAAC;IAC3D,CAAC;IAED,OAAO,OAAyB,CAAC;AACnC,CAAC"}

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

@@ -0,0 +1,37 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Applies the given selector to all elements in the given collection and
+ * calculates the sum of the results.
+ *
+ * @typeParam T The type of the array elements.
+ *
+ * @param array The array to calculate the sum of.
+ * @param selector The selector function to get the value to sum.
+ *
+ * @returns The sum of all elements in the collection.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { sumOf } from "@std/collections/sum-of";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const people = [
+ *   { name: "Anna", age: 34 },
+ *   { name: "Kim", age: 42 },
+ *   { name: "John", age: 23 },
+ * ];
+ *
+ * const totalAge = sumOf(people, (person) => person.age);
+ *
+ * assertEquals(totalAge, 99);
+ * ```
+ */
+export function sumOf(array, selector) {
+    let sum = 0;
+    for (const i of array) {
+        sum += selector(i);
+    }
+    return sum;
+}
+//# sourceMappingURL=sum_of.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sum_of.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/sum_of.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,UAAU,KAAK,CACnB,KAAkB,EAClB,QAA2B;IAE3B,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

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

@@ -0,0 +1,34 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns all elements in the given array after the last element that does not
+ * match the given predicate.
+ *
+ * @typeParam T The type of the array elements.
+ *
+ * @param array The array to take elements from.
+ * @param predicate The predicate function to determine if an element should be
+ * included.
+ *
+ * @returns A new array containing all elements after the last element that does
+ * not match the predicate.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { takeLastWhile } from "@std/collections/take-last-while";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [1, 2, 3, 4, 5, 6];
+ *
+ * const result = takeLastWhile(numbers, (number) => number > 4);
+ *
+ * assertEquals(result, [5, 6]);
+ * ```
+ */
+export function takeLastWhile(array, predicate) {
+    let offset = array.length;
+    while (0 < offset && predicate(array[offset - 1]))
+        offset--;
+    return array.slice(offset, array.length);
+}
+//# sourceMappingURL=take_last_while.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"take_last_while.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/take_last_while.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;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,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;AAC3C,CAAC"}

package/esm/deps/jsr.io/@std/collections/1.0.9/take_while.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 collection until the first element that
+ * does not match the given predicate.
+ *
+ * Note: If you want to process any iterable, use the new version of
+ * `takeWhile` from `@std/collections/unstable-take-while`.
+ *
+ * @typeParam T The type of the array elements.
+ *
+ * @param array The array to take elements from.
+ * @param predicate The predicate function to determine if an element should be
+ * included.
+ *
+ * @returns A new array containing all elements until the first element that
+ * does not match the predicate.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { takeWhile } from "@std/collections/take-while";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [1, 2, 3, 4, 5, 6];
+ *
+ * const result = takeWhile(numbers, (number) => number < 4);
+ *
+ * assertEquals(result, [1, 2, 3]);
+ * ```
+ */
+export function takeWhile(array, predicate) {
+    let offset = 0;
+    const length = array.length;
+    while (length > offset && predicate(array[offset])) {
+        offset++;
+    }
+    return array.slice(0, offset);
+}
+//# sourceMappingURL=take_while.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"take_while.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/take_while.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;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,CAAC,EAAE,MAAM,CAAC,CAAC;AAChC,CAAC"}

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

@@ -0,0 +1,34 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns all distinct elements that appear in any of the given arrays.
+ *
+ * @typeParam T The type of the array elements.
+ *
+ * @param arrays The arrays to get the union of.
+ *
+ * @returns A new array containing all distinct elements from the given arrays.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { union } from "@std/collections/union";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const soupIngredients = ["Pepper", "Carrots", "Leek"];
+ * const saladIngredients = ["Carrots", "Radicchio", "Pepper"];
+ *
+ * const shoppingList = union(soupIngredients, saladIngredients);
+ *
+ * assertEquals(shoppingList, ["Pepper", "Carrots", "Leek", "Radicchio"]);
+ * ```
+ */
+export function union(...arrays) {
+    const set = new Set();
+    for (const array of arrays) {
+        for (const element of array) {
+            set.add(element);
+        }
+    }
+    return Array.from(set);
+}
+//# sourceMappingURL=union.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"union.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/union.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,KAAK,CAAI,GAAG,MAAqB;IAC/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAK,CAAC;IAEzB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC"}

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

@@ -0,0 +1,46 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Builds two separate arrays from the given array of 2-tuples, with the first
+ * returned array holding all first tuple elements and the second one holding
+ * all the second elements.
+ *
+ * @typeParam T The type of the first tuple elements.
+ * @typeParam U The type of the second tuple elements.
+ *
+ * @param pairs The array of 2-tuples to unzip.
+ *
+ * @returns A tuple containing two arrays, the first one holding all first tuple
+ * elements and the second one holding all second elements.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { unzip } from "@std/collections/unzip";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const parents = [
+ *   ["Maria", "Jeff"],
+ *   ["Anna", "Kim"],
+ *   ["John", "Leroy"],
+ * ] as [string, string][];
+ *
+ * const [moms, dads] = unzip(parents);
+ *
+ * assertEquals(moms, ["Maria", "Anna", "John"]);
+ * assertEquals(dads, ["Jeff", "Kim", "Leroy"]);
+ * ```
+ */
+export function unzip(pairs) {
+    const { length } = pairs;
+    const result = [
+        new Array(length),
+        new Array(length),
+    ];
+    for (let i = 0; i < length; ++i) {
+        const pair = pairs[i];
+        result[0][i] = pair[0];
+        result[1][i] = pair[1];
+    }
+    return result;
+}
+//# sourceMappingURL=unzip.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"unzip.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/unzip.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,UAAU,KAAK,CAAO,KAAwB;IAClD,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IAEzB,MAAM,MAAM,GAAe;QACzB,IAAI,KAAK,CAAI,MAAM,CAAC;QACpB,IAAI,KAAK,CAAI,MAAM,CAAC;KACrB,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAEhC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,28 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Returns an array excluding all given values.
+ *
+ * @typeParam T The type of the array elements.
+ *
+ * @param array The array to exclude values from.
+ * @param values The values to exclude from the array.
+ *
+ * @returns A new array containing all elements from the given array except the
+ * ones that are in the values array.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { withoutAll } from "@std/collections/without-all";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const withoutList = withoutAll([2, 1, 2, 3], [1, 2]);
+ *
+ * assertEquals(withoutList, [3]);
+ * ```
+ */
+export function withoutAll(array, values) {
+    const toExclude = new Set(values);
+    return array.filter((it) => !toExclude.has(it));
+}
+//# sourceMappingURL=without_all.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"without_all.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/without_all.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,UAAU,CAAI,KAAmB,EAAE,MAAoB;IACrE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAClC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAClD,CAAC"}

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

@@ -0,0 +1,43 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+import { minOf } from "./min_of.js";
+/**
+ * Builds N-tuples of elements from the given N arrays with matching indices,
+ * stopping when the smallest array's end is reached.
+ *
+ * @typeParam T the type of the tuples produced by this function.
+ *
+ * @param arrays The arrays to zip.
+ *
+ * @returns A new array containing N-tuples of elements from the given arrays.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { zip } from "@std/collections/zip";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const numbers = [1, 2, 3, 4];
+ * const letters = ["a", "b", "c", "d"];
+ * const pairs = zip(numbers, letters);
+ *
+ * assertEquals(
+ *   pairs,
+ *   [
+ *     [1, "a"],
+ *     [2, "b"],
+ *     [3, "c"],
+ *     [4, "d"],
+ *   ],
+ * );
+ * ```
+ */
+export function zip(...arrays) {
+    const minLength = minOf(arrays, (element) => element.length) ?? 0;
+    const result = new Array(minLength);
+    for (let i = 0; i < minLength; i += 1) {
+        const arr = arrays.map((it) => it[i]);
+        result[i] = arr;
+    }
+    return result;
+}
+//# sourceMappingURL=zip.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"zip.js","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/collections/1.0.9/zip.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,qCAAqC;AAErC,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAEpC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,UAAU,GAAG,CACjB,GAAG,MAA+C;IAElD,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAElE,MAAM,MAAM,GAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;IAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAQ,CAAC;IACvB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}