@getodk/xpath 0.1.2 → 0.2.1

package/dist/index.js

@@ -1,4 +1,4 @@
-import { c as commonjsGlobal, U as UpsertableMap, e as expressionParser, g as getAugmentedNamespace, a as getDefaultExportFromCjs } from './expressionParser-BbqMYp75.js';
+import { c as commonjsGlobal, U as UpsertableMap, e as expressionParser, g as getAugmentedNamespace, a as getDefaultExportFromCjs } from './expressionParser-BVz9yCmv.js';
 
 function _mergeNamespaces(n, m) {
 	for (var i = 0; i < m.length; i++) {
@@ -387,13 +387,13 @@ function ParseTemporalYearMonthString(e) {
     if (void 0 !== n && "iso8601" !== n) throw new RangeError("YYYY-MM format is only valid with iso8601 calendar");
   } else {
     let t;
-    if (({
+    if ({
       year: r,
       month: o,
       calendar: n,
       day: a,
       z: t
-    } = ParseISODateTime(e)), t) throw new RangeError("Z designator not supported for PlainYearMonth");
+    } = ParseISODateTime(e), t) throw new RangeError("Z designator not supported for PlainYearMonth");
   }
   return {
     year: r,
@@ -412,13 +412,13 @@ function ParseTemporalMonthDayString(e) {
     if (void 0 !== n && "iso8601" !== n) throw new RangeError("MM-DD format is only valid with iso8601 calendar");
   } else {
     let t;
-    if (({
+    if ({
       month: r,
       day: o,
       calendar: n,
       year: a,
       z: t
-    } = ParseISODateTime(e)), t) throw new RangeError("Z designator not supported for PlainMonthDay");
+    } = ParseISODateTime(e), t) throw new RangeError("Z designator not supported for PlainMonthDay");
   }
   return {
     month: r,
@@ -799,7 +799,7 @@ function ToRelativeTemporalObject(e) {
     e.push("timeZone", "offset");
     const p = PrepareTemporalFields(t, e, []),
       f = Te(null);
-    f.overflow = "constrain", ({
+    f.overflow = "constrain", {
       year: r,
       month: o,
       day: n,
@@ -809,10 +809,10 @@ function ToRelativeTemporalObject(e) {
       millisecond: l,
       microsecond: d,
       nanosecond: m
-    } = InterpretTemporalDateTimeFields(c, p, f)), u = p.offset, void 0 === u && (T = "wall"), h = p.timeZone, void 0 !== h && (h = ToTemporalTimeZoneSlotValue(h));
+    } = InterpretTemporalDateTimeFields(c, p, f), u = p.offset, void 0 === u && (T = "wall"), h = p.timeZone, void 0 !== h && (h = ToTemporalTimeZoneSlotValue(h));
   } else {
     let e, f;
-    if (({
+    if ({
       year: r,
       month: o,
       day: n,
@@ -826,7 +826,7 @@ function ToRelativeTemporalObject(e) {
       ianaName: e,
       offset: u,
       z: f
-    } = ParseISODateTime(ToString(t))), e) h = ToTemporalTimeZoneSlotValue(e), f ? T = "exact" : u || (T = "wall"), p = !0;else if (f) throw new RangeError("Z designator not supported for PlainDate relativeTo; either remove the Z or add a bracketed time zone");
+    } = ParseISODateTime(ToString(t)), e) h = ToTemporalTimeZoneSlotValue(e), f ? T = "exact" : u || (T = "wall"), p = !0;else if (f) throw new RangeError("Z designator not supported for PlainDate relativeTo; either remove the Z or add a bracketed time zone");
     if (c || (c = "iso8601"), !IsBuiltinCalendar(c)) throw new RangeError(`invalid calendar identifier ${c}`);
     c = ASCIILowercase(c);
   }
@@ -906,14 +906,14 @@ function InterpretTemporalDateTimeFields(e, t, r) {
     T = GetSlot(u, i),
     p = GetSlot(u, s),
     f = GetSlot(u, l);
-  return ({
+  return {
     hour: o,
     minute: n,
     second: a,
     millisecond: d,
     microsecond: m,
     nanosecond: c
-  } = RegulateTime(o, n, a, d, m, c, h)), {
+  } = RegulateTime(o, n, a, d, m, c, h), {
     year: T,
     month: p,
     day: f,
@@ -946,7 +946,7 @@ function ToTemporalDateTime(e, t) {
     } = InterpretTemporalDateTimeFields(T, f, t));
   } else {
     let i;
-    if (ToTemporalOverflow(t), ({
+    if (ToTemporalOverflow(t), {
       year: r,
       month: o,
       day: n,
@@ -960,7 +960,7 @@ function ToTemporalDateTime(e, t) {
       z: i
     } = function ParseTemporalDateTimeString(e) {
       return ParseISODateTime(e);
-    }(ToString(e))), i) throw new RangeError("Z designator not supported for PlainDateTime");
+    }(ToString(e)), i) throw new RangeError("Z designator not supported for PlainDateTime");
     if (RejectDateTime(r, o, n, a, d, m, c, h, u), T || (T = "iso8601"), !IsBuiltinCalendar(T)) throw new RangeError(`invalid calendar identifier ${T}`);
     T = ASCIILowercase(T);
   }
@@ -1033,14 +1033,14 @@ function ToTemporalTime(e, t = "constrain") {
       millisecond: a,
       microsecond: i,
       nanosecond: s
-    } = ToTemporalTimeRecord(l))), ({
+    } = ToTemporalTimeRecord(l))), {
       hour: r,
       minute: o,
       second: n,
       millisecond: a,
       microsecond: i,
       nanosecond: s
-    } = RegulateTime(r, o, n, a, i, s, t));
+    } = RegulateTime(r, o, n, a, i, s, t);
   } else (({
     hour: r,
     minute: o,
@@ -1059,7 +1059,7 @@ function ToTemporalTime(e, t = "constrain") {
       if (t[8]) throw new RangeError("Z designator not supported for PlainTime");
     } else {
       let t, l;
-      if (({
+      if ({
         hasTime: l,
         hour: r,
         minute: o,
@@ -1068,7 +1068,7 @@ function ToTemporalTime(e, t = "constrain") {
         microsecond: i,
         nanosecond: s,
         z: t
-      } = ParseISODateTime(e)), !l) throw new RangeError(`time is missing in string: ${e}`);
+      } = ParseISODateTime(e), !l) throw new RangeError(`time is missing in string: ${e}`);
       if (t) throw new RangeError("Z designator not supported for PlainTime");
     }
     if (/[tT ][0-9][0-9]/.test(e)) return {
@@ -1170,7 +1170,7 @@ function ToTemporalZonedDateTime(e, t) {
     const f = CalendarFields(u, ["day", "hour", "microsecond", "millisecond", "minute", "month", "monthCode", "nanosecond", "second", "year"]);
     f.push("timeZone", "offset");
     const I = PrepareTemporalFields(e, f, ["timeZone"]);
-    c = ToTemporalTimeZoneSlotValue(I.timeZone), h = I.offset, void 0 === h && (y = "wall"), T = ToTemporalDisambiguation(t), p = ToTemporalOffset(t, "reject"), ({
+    c = ToTemporalTimeZoneSlotValue(I.timeZone), h = I.offset, void 0 === h && (y = "wall"), T = ToTemporalDisambiguation(t), p = ToTemporalOffset(t, "reject"), {
       year: r,
       month: o,
       day: n,
@@ -1180,10 +1180,10 @@ function ToTemporalZonedDateTime(e, t) {
       millisecond: l,
       microsecond: d,
       nanosecond: m
-    } = InterpretTemporalDateTimeFields(u, I, t));
+    } = InterpretTemporalDateTimeFields(u, I, t);
   } else {
     let I, S;
-    if (({
+    if ({
       year: r,
       month: o,
       day: n,
@@ -1201,7 +1201,7 @@ function ToTemporalZonedDateTime(e, t) {
       const t = ParseISODateTime(e);
       if (!t.ianaName) throw new RangeError("Temporal.ZonedDateTime requires a time zone ID in brackets");
       return t;
-    }(ToString(e))), c = ToTemporalTimeZoneSlotValue(I), S ? y = "exact" : h || (y = "wall"), u || (u = "iso8601"), !IsBuiltinCalendar(u)) throw new RangeError(`invalid calendar identifier ${u}`);
+    }(ToString(e)), c = ToTemporalTimeZoneSlotValue(I), S ? y = "exact" : h || (y = "wall"), u || (u = "iso8601"), !IsBuiltinCalendar(u)) throw new RangeError(`invalid calendar identifier ${u}`);
     u = ASCIILowercase(u), f = !0, T = ToTemporalDisambiguation(t), p = ToTemporalOffset(t, "reject"), ToTemporalOverflow(t);
   }
   let I = 0;
@@ -1593,7 +1593,7 @@ function GetPlainDateTimeFor(e, t, r) {
     microsecond: u,
     nanosecond: T
   } = GetISOPartsFromEpoch(o);
-  return ({
+  return {
     year: i,
     month: s,
     day: l,
@@ -1603,7 +1603,7 @@ function GetPlainDateTimeFor(e, t, r) {
     millisecond: h,
     microsecond: u,
     nanosecond: T
-  } = BalanceISODateTime(i, s, l, d, m, c, h, u, T + a)), CreateTemporalDateTime(i, s, l, d, m, c, h, u, T, r);
+  } = BalanceISODateTime(i, s, l, d, m, c, h, u, T + a), CreateTemporalDateTime(i, s, l, d, m, c, h, u, T, r);
 }
 function GetInstantFor(e, t, r) {
   return DisambiguatePossibleInstants(GetPossibleInstantsFor(e, t), e, t, r);
@@ -1751,13 +1751,13 @@ function TemporalDurationToString(t, r = "auto", o) {
   (({
     quotient: Y,
     remainder: I
-  } = divmod(Y, De))), ({
+  } = divmod(Y, De))), {
     quotient: Y,
     remainder: S
-  } = divmod(Y, De)), ({
+  } = divmod(Y, De), {
     quotient: F,
     remainder: g
-  } = divmod(Y, De));
+  } = divmod(Y, De);
   const P = 1e6 * ae(Number(g)) + 1e3 * ae(Number(S)) + ae(Number(I));
   let Z;
   if ("auto" === r) {
@@ -2092,10 +2092,10 @@ function BalanceISODate(e, t, r) {
     year: o,
     month: n
   } = BalanceISOYearMonth(o, n - 1))), a += ISODaysInMonth(o, n);
-  for (; a > ISODaysInMonth(o, n);) a -= ISODaysInMonth(o, n), ({
+  for (; a > ISODaysInMonth(o, n);) a -= ISODaysInMonth(o, n), {
     year: o,
     month: n
-  } = BalanceISOYearMonth(o, n + 1));
+  } = BalanceISOYearMonth(o, n + 1);
   return {
     year: o,
     month: n,
@@ -2137,25 +2137,25 @@ function BalanceTime(t, r, o, n, a, i) {
     c = BigInt(n),
     h = BigInt(a),
     u = BigInt(i);
-  return ({
+  return {
     quotient: s,
     remainder: u
-  } = NonNegativeBigIntDivmod(u, De)), h = h + s, ({
+  } = NonNegativeBigIntDivmod(u, De), h = h + s, {
     quotient: s,
     remainder: h
-  } = NonNegativeBigIntDivmod(h, De)), c = c + s, ({
+  } = NonNegativeBigIntDivmod(h, De), c = c + s, {
     quotient: s,
     remainder: c
-  } = NonNegativeBigIntDivmod(c, De)), m = m + s, ({
+  } = NonNegativeBigIntDivmod(c, De), m = m + s, {
     quotient: s,
     remainder: m
-  } = NonNegativeBigIntDivmod(m, ge)), d = d + s, ({
+  } = NonNegativeBigIntDivmod(m, ge), d = d + s, {
     quotient: s,
     remainder: d
-  } = NonNegativeBigIntDivmod(d, ge)), l = l + s, ({
+  } = NonNegativeBigIntDivmod(d, ge), l = l + s, {
     quotient: s,
     remainder: l
-  } = NonNegativeBigIntDivmod(l, we)), {
+  } = NonNegativeBigIntDivmod(l, we), {
     deltaDays: Number(s),
     hour: Number(l),
     minute: Number(d),
@@ -2188,10 +2188,10 @@ function NanosecondsToDays(t, r) {
   };
   if (!IsTemporalZonedDateTime(r)) {
     let t;
-    return ({
+    return {
       quotient: t,
       remainder: f
-    } = divmod(f, BigInt(y))), {
+    } = divmod(f, BigInt(y)), {
       days: Number(t),
       nanoseconds: f,
       dayLengthNs: y
@@ -2249,10 +2249,10 @@ function BalancePossiblyInfiniteDuration(t, r, o, a, i, s, l, d, m) {
       d = GetSlot(m, n);
     c = t - d;
   } else c = TotalDurationNanoseconds(I, r, o, a, i, s, l, 0);
-  "year" === d || "month" === d || "week" === d || "day" === d ? ({
+  "year" === d || "month" === d || "week" === d || "day" === d ? {
     days: I,
     nanoseconds: c
-  } = NanosecondsToDays(c, m)) : I = 0;
+  } = NanosecondsToDays(c, m) : I = 0;
   const w = c < Ie ? -1 : 1;
   switch (c = abs$1(c), h = u = T = f = y = Ie, d) {
     case "year":
@@ -2263,55 +2263,55 @@ function BalancePossiblyInfiniteDuration(t, r, o, a, i, s, l, d, m) {
       (({
         quotient: h,
         remainder: c
-      } = divmod(c, De))), ({
+      } = divmod(c, De))), {
         quotient: u,
         remainder: h
-      } = divmod(h, De)), ({
+      } = divmod(h, De), {
         quotient: T,
         remainder: u
-      } = divmod(u, De)), ({
+      } = divmod(u, De), {
         quotient: f,
         remainder: T
-      } = divmod(T, ge)), ({
+      } = divmod(T, ge), {
         quotient: y,
         remainder: f
-      } = divmod(f, ge));
+      } = divmod(f, ge);
       break;
     case "minute":
       (({
         quotient: h,
         remainder: c
-      } = divmod(c, De))), ({
+      } = divmod(c, De))), {
         quotient: u,
         remainder: h
-      } = divmod(h, De)), ({
+      } = divmod(h, De), {
         quotient: T,
         remainder: u
-      } = divmod(u, De)), ({
+      } = divmod(u, De), {
         quotient: f,
         remainder: T
-      } = divmod(T, ge));
+      } = divmod(T, ge);
       break;
     case "second":
       (({
         quotient: h,
         remainder: c
-      } = divmod(c, De))), ({
+      } = divmod(c, De))), {
         quotient: u,
         remainder: h
-      } = divmod(h, De)), ({
+      } = divmod(h, De), {
         quotient: T,
         remainder: u
-      } = divmod(u, De));
+      } = divmod(u, De);
       break;
     case "millisecond":
       (({
         quotient: h,
         remainder: c
-      } = divmod(c, De))), ({
+      } = divmod(c, De))), {
         quotient: u,
         remainder: h
-      } = divmod(h, De));
+      } = divmod(h, De);
       break;
     case "microsecond":
       ({
@@ -2590,7 +2590,7 @@ function DifferenceTime(e, t, r, o, n, a, i, s, l, d, m, c) {
   const I = DurationSign(0, 0, 0, 0, h, u, T, p, f, y);
   h *= I, u *= I, T *= I, p *= I, f *= I, y *= I;
   let S = 0;
-  if (({
+  if ({
     deltaDays: S,
     hour: h,
     minute: u,
@@ -2598,7 +2598,7 @@ function DifferenceTime(e, t, r, o, n, a, i, s, l, d, m, c) {
     millisecond: p,
     microsecond: f,
     nanosecond: y
-  } = BalanceTime(h, u, T, p, f, y)), 0 != S) throw new Error("assertion failure in DifferenceTime: _bt_.[[Days]] should be 0");
+  } = BalanceTime(h, u, T, p, f, y), 0 != S) throw new Error("assertion failure in DifferenceTime: _bt_.[[Days]] should be 0");
   return h *= I, u *= I, T *= I, p *= I, f *= I, y *= I, {
     hours: h,
     minutes: u,
@@ -2616,14 +2616,14 @@ function DifferenceInstant(t, r, o, n, a, i) {
     c = Number(s / De % De),
     h = Number(s / Ge % De),
     u = Number(s / ve);
-  return ({
+  return {
     hours: l,
     minutes: d,
     seconds: u,
     milliseconds: h,
     microseconds: c,
     nanoseconds: m
-  } = RoundDuration(0, 0, 0, 0, 0, 0, u, h, c, m, o, n, i)), BalanceDuration(0, l, d, u, h, c, m, a);
+  } = RoundDuration(0, 0, 0, 0, 0, 0, u, h, c, m, o, n, i), BalanceDuration(0, l, d, u, h, c, m, a);
 }
 function DifferenceISODateTime(e, t, r, o, n, a, i, s, l, d, m, c, h, u, T, p, f, y, I, S, g) {
   let w = e,
@@ -2638,18 +2638,18 @@ function DifferenceISODateTime(e, t, r, o, n, a, i, s, l, d, m, c, h, u, T, p, f
       nanoseconds: M
     } = DifferenceTime(o, n, a, i, s, l, h, u, T, p, f, y);
   const R = DurationSign(0, 0, 0, 0, v, C, O, b, E, M);
-  CompareISODate(d, m, c, w, D, G) === -R && (({
+  CompareISODate(d, m, c, w, D, G) === -R && ({
     year: w,
     month: D,
     day: G
-  } = BalanceISODate(w, D, G - R)), ({
+  } = BalanceISODate(w, D, G - R), {
     hours: v,
     minutes: C,
     seconds: O,
     milliseconds: b,
     microseconds: E,
     nanoseconds: M
-  } = BalanceDuration(-R, v, C, O, b, E, M, S)));
+  } = BalanceDuration(-R, v, C, O, b, E, M, S));
   const F = CreateTemporalDate(w, D, G, I),
     Y = CreateTemporalDate(d, m, c, I),
     P = LargerOfTwoTemporalUnits("day", S),
@@ -2661,7 +2661,7 @@ function DifferenceISODateTime(e, t, r, o, n, a, i, s, l, d, m, c, h, u, T, p, f
     weeks: j,
     days: $
   } = CalendarDateUntil(I, F, Y, Z);
-  return ({
+  return {
     days: $,
     hours: v,
     minutes: C,
@@ -2669,7 +2669,7 @@ function DifferenceISODateTime(e, t, r, o, n, a, i, s, l, d, m, c, h, u, T, p, f
     milliseconds: b,
     microseconds: E,
     nanoseconds: M
-  } = BalanceDuration($, v, C, O, b, E, M, S)), {
+  } = BalanceDuration($, v, C, O, b, E, M, S), {
     years: B,
     months: N,
     weeks: j,
@@ -2848,7 +2848,7 @@ function DifferenceTemporalPlainDateTime(e, t, r, o) {
     milliseconds: O,
     microseconds: b,
     nanoseconds: E
-  } = RoundDuration(S, g, w, D, G, v, C, O, b, E, I.roundingIncrement, I.smallestUnit, I.roundingMode, M))), ({
+  } = RoundDuration(S, g, w, D, G, v, C, O, b, E, I.roundingIncrement, I.smallestUnit, I.roundingMode, M))), {
     days: D,
     hours: G,
     minutes: v,
@@ -2856,7 +2856,7 @@ function DifferenceTemporalPlainDateTime(e, t, r, o) {
     milliseconds: O,
     microseconds: b,
     nanoseconds: E
-  } = BalanceDuration(D, G, v, C, O, b, E, I.largestUnit));
+  } = BalanceDuration(D, G, v, C, O, b, E, I.largestUnit);
   return new (GetIntrinsic("%Temporal.Duration%"))(n * S, n * g, n * w, n * D, n * G, n * v, n * C, n * O, n * b, n * E);
 }
 function DifferenceTemporalPlainTime(e, t, r, o) {
@@ -2878,14 +2878,14 @@ function DifferenceTemporalPlainTime(e, t, r, o) {
     milliseconds: f,
     microseconds: y,
     nanoseconds: I
-  } = RoundDuration(0, 0, 0, 0, s, l, p, f, y, I, i.roundingIncrement, i.smallestUnit, i.roundingMode))), ({
+  } = RoundDuration(0, 0, 0, 0, s, l, p, f, y, I, i.roundingIncrement, i.smallestUnit, i.roundingMode))), {
     hours: s,
     minutes: l,
     seconds: p,
     milliseconds: f,
     microseconds: y,
     nanoseconds: I
-  } = BalanceDuration(0, s, l, p, f, y, I, i.largestUnit));
+  } = BalanceDuration(0, s, l, p, f, y, I, i.largestUnit);
   return new (GetIntrinsic("%Temporal.Duration%"))(0, 0, 0, 0, n * s, n * l, n * p, n * f, n * y, n * I);
 }
 function DifferenceTemporalPlainYearMonth(e, t, r, o) {
@@ -2924,14 +2924,14 @@ function DifferenceTemporalZonedDateTime(e, t, r, o) {
   const m = GetSlot(t, n),
     c = GetSlot(i, n);
   let h, u, T, f, y, I, S, w, D, G;
-  if ("year" !== d.largestUnit && "month" !== d.largestUnit && "week" !== d.largestUnit && "day" !== d.largestUnit) h = 0, u = 0, T = 0, f = 0, ({
+  if ("year" !== d.largestUnit && "month" !== d.largestUnit && "week" !== d.largestUnit && "day" !== d.largestUnit) h = 0, u = 0, T = 0, f = 0, {
     hours: y,
     minutes: I,
     seconds: S,
     milliseconds: w,
     microseconds: D,
     nanoseconds: G
-  } = DifferenceInstant(m, c, d.roundingIncrement, d.smallestUnit, d.largestUnit, d.roundingMode));else {
+  } = DifferenceInstant(m, c, d.roundingIncrement, d.smallestUnit, d.largestUnit, d.roundingMode);else {
     const e = GetSlot(t, g);
     if (!TimeZoneEquals(e, GetSlot(i, g))) throw new RangeError("When calculating difference between time zones, largestUnit must be 'hours' or smaller because day lengths can vary between time zones due to DST or time zone offset changes.");
     (({
@@ -2945,7 +2945,7 @@ function DifferenceTemporalZonedDateTime(e, t, r, o) {
       milliseconds: w,
       microseconds: D,
       nanoseconds: G
-    } = DifferenceZonedDateTime(m, c, e, s, d.largestUnit, l))), ({
+    } = DifferenceZonedDateTime(m, c, e, s, d.largestUnit, l))), {
       years: h,
       months: u,
       weeks: T,
@@ -2956,7 +2956,7 @@ function DifferenceTemporalZonedDateTime(e, t, r, o) {
       milliseconds: w,
       microseconds: D,
       nanoseconds: G
-    } = RoundDuration(h, u, T, f, y, I, S, w, D, G, d.roundingIncrement, d.smallestUnit, d.roundingMode, t)), ({
+    } = RoundDuration(h, u, T, f, y, I, S, w, D, G, d.roundingIncrement, d.smallestUnit, d.roundingMode, t), {
       years: h,
       months: u,
       weeks: T,
@@ -2967,7 +2967,7 @@ function DifferenceTemporalZonedDateTime(e, t, r, o) {
       milliseconds: w,
       microseconds: D,
       nanoseconds: G
-    } = AdjustRoundedDurationDays(h, u, T, f, y, I, S, w, D, G, d.roundingIncrement, d.smallestUnit, d.roundingMode, t));
+    } = AdjustRoundedDurationDays(h, u, T, f, y, I, S, w, D, G, d.roundingIncrement, d.smallestUnit, d.roundingMode, t);
   }
   return new (GetIntrinsic("%Temporal.Duration%"))(a * h, a * u, a * T, a * f, a * y, a * I, a * S, a * w, a * D, a * G);
 }
@@ -2977,18 +2977,18 @@ function AddISODate(e, t, r, o, n, a, i, s) {
     m = r,
     c = a,
     h = i;
-  return l += o, d += n, ({
+  return l += o, d += n, {
     year: l,
     month: d
-  } = BalanceISOYearMonth(l, d)), ({
+  } = BalanceISOYearMonth(l, d), {
     year: l,
     month: d,
     day: m
-  } = RegulateISODate(l, d, m, s)), h += 7 * c, m += h, ({
+  } = RegulateISODate(l, d, m, s), h += 7 * c, m += h, {
     year: l,
     month: d,
     day: m
-  } = BalanceISODate(l, d, m)), {
+  } = BalanceISODate(l, d, m), {
     year: l,
     month: d,
     day: m
@@ -3003,7 +3003,7 @@ function AddTime(e, t, r, o, n, a, i, s, l, d, m, c) {
     y = a;
   h += i, u += s, T += l, p += d, f += m, y += c;
   let I = 0;
-  return ({
+  return {
     deltaDays: I,
     hour: h,
     minute: u,
@@ -3011,7 +3011,7 @@ function AddTime(e, t, r, o, n, a, i, s, l, d, m, c) {
     millisecond: p,
     microsecond: f,
     nanosecond: y
-  } = BalanceTime(h, u, T, p, f, y)), {
+  } = BalanceTime(h, u, T, p, f, y), {
     deltaDays: I,
     hour: h,
     minute: u,
@@ -3035,12 +3035,12 @@ function AddDuration(t, r, o, a, i, s, l, d, m, c, h, u, T, f, y, I, w, D, G, v,
         U = CalendarDateAdd(S, k, j, void 0, $),
         A = LargerOfTwoTemporalUnits("day", O),
         L = Te(null);
-      L.largestUnit = A, ({
+      L.largestUnit = A, {
         years: b,
         months: E,
         weeks: M,
         days: R
-      } = CalendarDateUntil(S, C, U, L)), ({
+      } = CalendarDateUntil(S, C, U, L), {
         days: R,
         hours: F,
         minutes: Y,
@@ -3048,21 +3048,21 @@ function AddDuration(t, r, o, a, i, s, l, d, m, c, h, u, T, f, y, I, w, D, G, v,
         milliseconds: Z,
         microseconds: B,
         nanoseconds: N
-      } = BalanceDuration(R, BigInt(i) + BigInt(y), BigInt(s) + BigInt(I), BigInt(l) + BigInt(w), BigInt(d) + BigInt(D), BigInt(m) + BigInt(G), BigInt(c) + BigInt(v), O));
+      } = BalanceDuration(R, BigInt(i) + BigInt(y), BigInt(s) + BigInt(I), BigInt(l) + BigInt(w), BigInt(d) + BigInt(D), BigInt(m) + BigInt(G), BigInt(c) + BigInt(v), O);
     } else {
       const e = GetIntrinsic("%Temporal.Instant%"),
         j = GetSlot(C, g),
         $ = GetSlot(C, p),
         k = AddZonedDateTime(GetSlot(C, S), j, $, t, r, o, a, i, s, l, d, m, c),
         U = AddZonedDateTime(new e(k), j, $, h, u, T, f, y, I, w, D, G, v);
-      "year" !== O && "month" !== O && "week" !== O && "day" !== O ? (b = 0, E = 0, M = 0, R = 0, ({
+      "year" !== O && "month" !== O && "week" !== O && "day" !== O ? (b = 0, E = 0, M = 0, R = 0, {
         hours: F,
         minutes: Y,
         seconds: P,
         milliseconds: Z,
         microseconds: B,
         nanoseconds: N
-      } = DifferenceInstant(GetSlot(C, n), U, 1, "nanosecond", O, "halfExpand"))) : ({
+      } = DifferenceInstant(GetSlot(C, n), U, 1, "nanosecond", O, "halfExpand")) : {
         years: b,
         months: E,
         weeks: M,
@@ -3073,11 +3073,11 @@ function AddDuration(t, r, o, a, i, s, l, d, m, c, h, u, T, f, y, I, w, D, G, v,
         milliseconds: Z,
         microseconds: B,
         nanoseconds: N
-      } = DifferenceZonedDateTime(GetSlot(C, n), U, j, $, O, Te(null)));
+      } = DifferenceZonedDateTime(GetSlot(C, n), U, j, $, O, Te(null));
     }
   } else {
     if ("year" === O || "month" === O || "week" === O) throw new RangeError("relativeTo is required for years, months, or weeks arithmetic");
-    b = E = M = 0, ({
+    b = E = M = 0, {
       days: R,
       hours: F,
       minutes: Y,
@@ -3085,7 +3085,7 @@ function AddDuration(t, r, o, a, i, s, l, d, m, c, h, u, T, f, y, I, w, D, G, v,
       milliseconds: Z,
       microseconds: B,
       nanoseconds: N
-    } = BalanceDuration(a + f, BigInt(i) + BigInt(y), BigInt(s) + BigInt(I), BigInt(l) + BigInt(w), BigInt(d) + BigInt(D), BigInt(m) + BigInt(G), BigInt(c) + BigInt(v), O));
+    } = BalanceDuration(a + f, BigInt(i) + BigInt(y), BigInt(s) + BigInt(I), BigInt(l) + BigInt(w), BigInt(d) + BigInt(D), BigInt(m) + BigInt(G), BigInt(c) + BigInt(v), O);
   }
   return RejectDuration(b, E, M, R, F, Y, P, Z, B, N), {
     years: b,
@@ -3477,19 +3477,19 @@ function AdjustRoundedDurationDays(t, r, o, n, a, i, s, l, d, m, c, h, u, T) {
     Y = AddZonedDateTime(GetSlot(T, S), R, F, f, y, I, w, 0, 0, 0, 0, 0, 0),
     P = AddZonedDateTime(new (GetIntrinsic("%Temporal.Instant%"))(Y), R, F, 0, 0, 0, M, 0, 0, 0, 0, 0, 0),
     Z = P - Y;
-  return (E - Z) * BigInt(M) >= Ie && (({
+  return (E - Z) * BigInt(M) >= Ie && ({
     years: f,
     months: y,
     weeks: I,
     days: w
-  } = AddDuration(f, y, I, w, 0, 0, 0, 0, 0, 0, 0, 0, 0, M, 0, 0, 0, 0, 0, 0, T)), E = RoundInstant(E - Z, c, h, u), ({
+  } = AddDuration(f, y, I, w, 0, 0, 0, 0, 0, 0, 0, 0, 0, M, 0, 0, 0, 0, 0, 0, T), E = RoundInstant(E - Z, c, h, u), {
     hours: D,
     minutes: G,
     seconds: v,
     milliseconds: C,
     microseconds: O,
     nanoseconds: b
-  } = BalanceDuration(0, 0, 0, 0, 0, 0, Number(E), "hour"))), {
+  } = BalanceDuration(0, 0, 0, 0, 0, 0, Number(E), "hour")), {
     years: f,
     months: y,
     weeks: I,
@@ -3525,11 +3525,11 @@ function RoundDuration(t, r, o, n, a, i, s, l, d, m, c, h, u, T) {
   }
   if ("year" === h || "month" === h || "week" === h || "day" === h) {
     let t, r, o;
-    C = TotalDurationNanoseconds(0, g, w, D, G, v, m, 0), E && (t = MoveRelativeZonedDateTime(E, f, y, I, S)), ({
+    C = TotalDurationNanoseconds(0, g, w, D, G, v, m, 0), E && (t = MoveRelativeZonedDateTime(E, f, y, I, S)), {
       days: r,
       nanoseconds: C,
       dayLengthNs: o
-    } = NanosecondsToDays(C, t)), M = BigInt(o), S += r, g = w = D = G = v = 0;
+    } = NanosecondsToDays(C, t), M = BigInt(o), S += r, g = w = D = G = v = 0;
   }
   switch (h) {
     case "year":
@@ -3570,13 +3570,13 @@ function RoundDuration(t, r, o, n, a, i, s, l, d, m, c, h, u, T) {
         const a = se(S),
           i = new O(0, S < 0 ? -1 : 1);
         let s;
-        for (({
+        for ({
           relativeTo: F,
           days: s
-        } = MoveRelativeDate(b, F, i, r)); ae(S) >= ae(s);) y += a, S -= s, ({
+        } = MoveRelativeDate(b, F, i, r); ae(S) >= ae(s);) y += a, S -= s, {
           relativeTo: F,
           days: s
-        } = MoveRelativeDate(b, F, i, r));
+        } = MoveRelativeDate(b, F, i, r);
         s = ae(s);
         const l = BigInt(s) * M;
         C = l * BigInt(y) + BigInt(S) * M + C;
@@ -3591,13 +3591,13 @@ function RoundDuration(t, r, o, n, a, i, s, l, d, m, c, h, u, T) {
           r = new O(0, 0, S < 0 ? -1 : 1),
           o = "string" != typeof b ? GetMethod(b, "dateAdd") : void 0;
         let n;
-        for (({
+        for ({
           relativeTo: F,
           days: n
-        } = MoveRelativeDate(b, F, r, o)); ae(S) >= ae(n);) I += t, S -= n, ({
+        } = MoveRelativeDate(b, F, r, o); ae(S) >= ae(n);) I += t, S -= n, {
           relativeTo: F,
           days: n
-        } = MoveRelativeDate(b, F, r, o));
+        } = MoveRelativeDate(b, F, r, o);
         n = ae(n);
         const a = BigInt(n) * M;
         C = a * BigInt(I) + BigInt(S) * M + C;
@@ -4423,11 +4423,11 @@ MakeIntrinsicClass(Calendar, "Temporal.Calendar"), DefineIntrinsic("Temporal.Cal
       month: i,
       day: s
     } = o;
-    return ({
+    return {
       year: a,
       month: i,
       day: s
-    } = RegulateISODate(a, i, s, n)), CreateTemporalDate(a, i, s, r);
+    } = RegulateISODate(a, i, s, n), CreateTemporalDate(a, i, s, r);
   },
   yearMonthFromFields(e, t, r) {
     let o = PrepareTemporalFields(e, ["month", "monthCode", "year"], ["year"]);
@@ -4437,7 +4437,7 @@ MakeIntrinsicClass(Calendar, "Temporal.Calendar"), DefineIntrinsic("Temporal.Cal
       year: a,
       month: i
     } = o;
-    return ({
+    return {
       year: a,
       month: i
     } = function RegulateISOYearMonth(e, t, r) {
@@ -4457,7 +4457,7 @@ MakeIntrinsicClass(Calendar, "Temporal.Calendar"), DefineIntrinsic("Temporal.Cal
         year: o,
         month: n
       };
-    }(a, i, n)), CreateTemporalYearMonth(a, i, r, 1);
+    }(a, i, n), CreateTemporalYearMonth(a, i, r, 1);
   },
   monthDayFromFields(e, t, r) {
     let o = PrepareTemporalFields(e, ["day", "month", "monthCode", "year"], ["day"]);
@@ -4470,10 +4470,10 @@ MakeIntrinsicClass(Calendar, "Temporal.Calendar"), DefineIntrinsic("Temporal.Cal
       day: s,
       year: l
     } = o;
-    return ({
+    return {
       month: i,
       day: s
-    } = RegulateISODate(a ? l : 1972, i, s, n)), CreateTemporalMonthDay(i, s, r, 1972);
+    } = RegulateISODate(a ? l : 1972, i, s, n), CreateTemporalMonthDay(i, s, r, 1972);
   },
   fields: e => e,
   fieldKeysToIgnore(e) {
@@ -4488,11 +4488,11 @@ MakeIntrinsicClass(Calendar, "Temporal.Calendar"), DefineIntrinsic("Temporal.Cal
     let m = GetSlot(e, i),
       c = GetSlot(e, s),
       h = GetSlot(e, l);
-    return ({
+    return {
       year: m,
       month: c,
       day: h
-    } = AddISODate(m, c, h, t, r, o, n, a)), CreateTemporalDate(m, c, h, d);
+    } = AddISODate(m, c, h, t, r, o, n, a), CreateTemporalDate(m, c, h, d);
   },
   dateUntil: (e, t, r) => DifferenceISODate(GetSlot(e, i), GetSlot(e, s), GetSlot(e, l), GetSlot(t, i), GetSlot(t, s), GetSlot(t, l), r),
   year: e => GetSlot(e, i),
@@ -4685,10 +4685,10 @@ class HelperBase {
       month: i,
       monthCode: s
     } = n;
-    return ({
+    return {
       month: i,
       monthCode: s
-    } = resolveNonLunisolarMonth(n, r, a)), {
+    } = resolveNonLunisolarMonth(n, r, a), {
       ...n,
       month: i,
       monthCode: s
@@ -4996,11 +4996,11 @@ class HelperBase {
         }, r),
         h = this.calendarToIsoDate(m, "constrain", r),
         u = this.isoToCalendarDate(h, r);
-      if (({
+      if ({
         year: o,
         month: n,
         day: a
-      } = h), u.monthCode === l && u.day === d) return {
+      } = h, u.monthCode === l && u.day === d) return {
         month: n,
         day: a,
         year: o
@@ -5527,10 +5527,10 @@ class GregorianBaseHelper extends HelperBase {
         const e = void 0 === o ? void 0 : this.eras.find(e => e.name === o || e.genericName === o);
         if (!e) throw new RangeError(`Era ${o} (ISO year ${r}) was not matched by any era`);
         if (r < 1 && e.reverseOf) throw new RangeError(`Years in ${o} era must be positive, not ${t}`);
-        t = e.reverseOf ? e.anchorEpoch.year - r : r + e.anchorEpoch.year - (e.hasYearZero ? 0 : 1), checkField("year", t), ({
+        t = e.reverseOf ? e.anchorEpoch.year - r : r + e.anchorEpoch.year - (e.hasYearZero ? 0 : 1), checkField("year", t), {
           eraYear: r,
           era: o
-        } = eraFromYear(t));
+        } = eraFromYear(t);
       }
     }
     return {
@@ -5840,10 +5840,10 @@ class ChineseBaseHelper extends HelperBase {
         calendarDay: s,
         calendarYearToVerify: l
       } = getCalendarDate(e, a);
-    "1" !== i && (a += 29, ({
+    "1" !== i && (a += 29, {
       calendarMonthString: i,
       calendarDay: s
-    } = getCalendarDate(e, a))), a -= s - 5;
+    } = getCalendarDate(e, a)), a -= s - 5;
     const d = {};
     let m,
       c,
@@ -6498,7 +6498,7 @@ class PlainDateTime {
       D = GetSlot(this, h),
       G = GetSlot(this, u),
       v = GetSlot(this, T);
-    return ({
+    return {
       year: f,
       month: y,
       day: I,
@@ -6508,7 +6508,7 @@ class PlainDateTime {
       millisecond: D,
       microsecond: G,
       nanosecond: v
-    } = RoundISODateTime(f, y, I, S, g, w, D, G, v, r, n, o)), CreateTemporalDateTime(f, y, I, S, g, w, D, G, v, GetSlot(this, p));
+    } = RoundISODateTime(f, y, I, S, g, w, D, G, v, r, n, o), CreateTemporalDateTime(f, y, I, S, g, w, D, G, v, GetSlot(this, p));
   }
   equals(e) {
     if (!IsTemporalDateTime(this)) throw new TypeError("invalid receiver");
@@ -6734,12 +6734,12 @@ class Duration {
       microsecond: 1e3,
       nanosecond: 1e3
     }[S];
-    return void 0 !== Y && ValidateTemporalRoundingIncrement(y, Y, !1), ({
+    return void 0 !== Y && ValidateTemporalRoundingIncrement(y, Y, !1), {
       years: r,
       months: o,
       weeks: n,
       days: a
-    } = UnbalanceDurationRelative(r, o, n, a, T, f)), ({
+    } = UnbalanceDurationRelative(r, o, n, a, T, f), {
       years: r,
       months: o,
       weeks: n,
@@ -6750,7 +6750,7 @@ class Duration {
       milliseconds: d,
       microseconds: m,
       nanoseconds: c
-    } = RoundDuration(r, o, n, a, i, s, l, d, m, c, y, S, I, f)), ({
+    } = RoundDuration(r, o, n, a, i, s, l, d, m, c, y, S, I, f), {
       years: r,
       months: o,
       weeks: n,
@@ -6761,7 +6761,7 @@ class Duration {
       milliseconds: d,
       microseconds: m,
       nanoseconds: c
-    } = AdjustRoundedDurationDays(r, o, n, a, i, s, l, d, m, c, y, S, I, f)), ({
+    } = AdjustRoundedDurationDays(r, o, n, a, i, s, l, d, m, c, y, S, I, f), {
       days: a,
       hours: i,
       minutes: s,
@@ -6769,7 +6769,7 @@ class Duration {
       milliseconds: d,
       microseconds: m,
       nanoseconds: c
-    } = BalanceDuration(a, i, s, l, d, m, c, T, f)), ({
+    } = BalanceDuration(a, i, s, l, d, m, c, T, f), {
       years: r,
       months: o,
       weeks: n,
@@ -6800,20 +6800,20 @@ class Duration {
             if (!m) throw new RangeError("a starting point is required for years balancing");
             const t = "string" != typeof m ? GetMethod(m, "dateAdd") : void 0;
             let r, o, n;
-            for (({
+            for ({
               relativeTo: r,
               days: o
-            } = MoveRelativeDate(m, c, y, t)); abs$1(f) >= BigInt(ae(o));) f = f - BigInt(o), h = h + d, c = r, ({
+            } = MoveRelativeDate(m, c, y, t); abs$1(f) >= BigInt(ae(o));) f = f - BigInt(o), h = h + d, c = r, {
               relativeTo: r,
               days: o
-            } = MoveRelativeDate(m, c, y, t));
-            for (({
+            } = MoveRelativeDate(m, c, y, t);
+            for ({
               relativeTo: r,
               days: n
-            } = MoveRelativeDate(m, c, I, t)); abs$1(f) >= BigInt(ae(n));) f = f - BigInt(n), u = u + d, c = r, ({
+            } = MoveRelativeDate(m, c, I, t); abs$1(f) >= BigInt(ae(n));) f = f - BigInt(n), u = u + d, c = r, {
               relativeTo: r,
               days: n
-            } = MoveRelativeDate(m, c, I, t));
+            } = MoveRelativeDate(m, c, I, t);
             r = CalendarDateAdd(m, c, y, void 0, t);
             const a = "string" != typeof m ? GetMethod(m, "dateUntil") : void 0,
               i = Te(null);
@@ -6832,13 +6832,13 @@ class Duration {
             if (!m) throw new RangeError("a starting point is required for months balancing");
             const t = "string" != typeof m ? GetMethod(m, "dateAdd") : void 0;
             let r, o;
-            for (({
+            for ({
               relativeTo: r,
               days: o
-            } = MoveRelativeDate(m, c, I, t)); abs$1(f) >= BigInt(ae(o));) f = f - BigInt(o), u = u + d, c = r, ({
+            } = MoveRelativeDate(m, c, I, t); abs$1(f) >= BigInt(ae(o));) f = f - BigInt(o), u = u + d, c = r, {
               relativeTo: r,
               days: o
-            } = MoveRelativeDate(m, c, I, t));
+            } = MoveRelativeDate(m, c, I, t);
             break;
           }
         case "week":
@@ -6846,13 +6846,13 @@ class Duration {
             if (!m) throw new RangeError("a starting point is required for weeks balancing");
             const t = "string" != typeof m ? GetMethod(m, "dateAdd") : void 0;
             let r, o;
-            for (({
+            for ({
               relativeTo: r,
               days: o
-            } = MoveRelativeDate(m, c, S, t)); abs$1(f) >= BigInt(ae(o));) f = f - BigInt(o), T = T + d, c = r, ({
+            } = MoveRelativeDate(m, c, S, t); abs$1(f) >= BigInt(ae(o));) f = f - BigInt(o), T = T + d, c = r, {
               relativeTo: r,
               days: o
-            } = MoveRelativeDate(m, c, S, t));
+            } = MoveRelativeDate(m, c, S, t);
             break;
           }
       }
@@ -6862,7 +6862,7 @@ class Duration {
         weeks: Number(T),
         days: Number(f)
       };
-    }(r, o, n, a, T, f)), new Duration(r, o, n, a, i, s, l, d, m, c);
+    }(r, o, n, a, T, f), new Duration(r, o, n, a, i, s, l, d, m, c);
   }
   total(e) {
     if (!IsTemporalDuration(this)) throw new TypeError("invalid receiver");
@@ -6962,11 +6962,11 @@ class Duration {
     let N = GetSlot(a, R);
     const j = CalculateOffsetShift(i, s, l, d, m),
       $ = CalculateOffsetShift(i, y, I, S, g);
-    0 === s && 0 === y && 0 === l && 0 === I && 0 === d && 0 === S || (({
+    0 === s && 0 === y && 0 === l && 0 === I && 0 === d && 0 === S || ({
       days: m
-    } = UnbalanceDurationRelative(s, l, d, m, "day", i)), ({
+    } = UnbalanceDurationRelative(s, l, d, m, "day", i), {
       days: g
-    } = UnbalanceDurationRelative(y, I, S, g, "day", i)));
+    } = UnbalanceDurationRelative(y, I, S, g, "day", i));
     const k = TotalDurationNanoseconds(m, c, h, u, T, p, f, j),
       U = TotalDurationNanoseconds(g, F, Y, P, Z, B, N, $);
     return ComparisonResult(Number(k - U));
@@ -7158,14 +7158,14 @@ class PlainTime {
       microsecond: d,
       nanosecond: m
     } = Mt(n, o);
-    return ({
+    return {
       hour: a,
       minute: i,
       second: s,
       millisecond: l,
       microsecond: d,
       nanosecond: m
-    } = RegulateTime(a, i, s, l, d, m, r)), new PlainTime(a, i, s, l, d, m);
+    } = RegulateTime(a, i, s, l, d, m, r), new PlainTime(a, i, s, l, d, m);
   }
   add(e) {
     if (!IsTemporalTime(this)) throw new TypeError("invalid receiver");
@@ -7204,14 +7204,14 @@ class PlainTime {
       l = GetSlot(this, h),
       p = GetSlot(this, u),
       f = GetSlot(this, T);
-    return ({
+    return {
       hour: a,
       minute: i,
       second: s,
       millisecond: l,
       microsecond: p,
       nanosecond: f
-    } = RoundTime(a, i, s, l, p, f, r, n, o)), new PlainTime(a, i, s, l, p, f);
+    } = RoundTime(a, i, s, l, p, f, r, n, o), new PlainTime(a, i, s, l, p, f);
   }
   equals(e) {
     if (!IsTemporalTime(this)) throw new TypeError("invalid receiver");
@@ -8044,6 +8044,33 @@ function requireSet () {
 	if (hasRequiredSet) return set;
 	hasRequiredSet = 1;
 
+	var __awaiter = commonjsGlobal && commonjsGlobal.__awaiter || function (thisArg, _arguments, P, generator) {
+	  function adopt(value) {
+	    return value instanceof P ? value : new P(function (resolve) {
+	      resolve(value);
+	    });
+	  }
+	  return new (P || (P = Promise))(function (resolve, reject) {
+	    function fulfilled(value) {
+	      try {
+	        step(generator.next(value));
+	      } catch (e) {
+	        reject(e);
+	      }
+	    }
+	    function rejected(value) {
+	      try {
+	        step(generator["throw"](value));
+	      } catch (e) {
+	        reject(e);
+	      }
+	    }
+	    function step(result) {
+	      result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected);
+	    }
+	    step((generator = generator.apply(thisArg, _arguments || [])).next());
+	  });
+	};
 	var __generator = commonjsGlobal && commonjsGlobal.__generator || function (thisArg, body) {
 	  var _ = {
 	      label: 0,
@@ -8259,7 +8286,7 @@ function requireSet () {
 	Object.defineProperty(set, "__esModule", {
 	  value: true
 	});
-	set.unionAsync = set.union = set.symmetricDifferenceAsync = set.symmetricDifference = set.partialIntersectionAsync = set.partialIntersection = set.intersectionAsync = set.intersection = set.distinctAsync = set.distinct = void 0;
+	set.cartesianProductAsync = set.cartesianProduct = set.unionAsync = set.union = set.symmetricDifferenceAsync = set.symmetricDifference = set.partialIntersectionAsync = set.partialIntersection = set.intersectionAsync = set.intersection = set.distinctAsync = set.distinct = void 0;
 	var transform_1 = requireTransform();
 	var tools_1 = requireTools();
 	var single_1 = requireSingle();
@@ -9074,6 +9101,241 @@ function requireSet () {
 	  });
 	}
 	set.unionAsync = unionAsync;
+	/**
+	 * Iterates cartesian product of given iterables.
+	 *
+	 * @param iterables
+	 */
+	function cartesianProduct() {
+	  var _i, _a, _b, item, e_17_1, arrays, toIterate, toIterate_1, toIterate_1_1, item, e_18_1;
+	  var e_17, _c, e_18, _d;
+	  var iterables = [];
+	  for (_i = 0; _i < arguments.length; _i++) {
+	    iterables[_i] = arguments[_i];
+	  }
+	  return __generator(this, function (_e) {
+	    switch (_e.label) {
+	      case 0:
+	        if (iterables.length === 0) {
+	          return [2 /*return*/];
+	        }
+	        if (!(iterables.length === 1)) return [3 /*break*/, 9];
+	        _e.label = 1;
+	      case 1:
+	        _e.trys.push([1, 6, 7, 8]);
+	        _a = __values((0, transform_1.toIterable)(iterables[0])), _b = _a.next();
+	        _e.label = 2;
+	      case 2:
+	        if (!!_b.done) return [3 /*break*/, 5];
+	        item = _b.value;
+	        return [4 /*yield*/, [item]];
+	      case 3:
+	        _e.sent();
+	        _e.label = 4;
+	      case 4:
+	        _b = _a.next();
+	        return [3 /*break*/, 2];
+	      case 5:
+	        return [3 /*break*/, 8];
+	      case 6:
+	        e_17_1 = _e.sent();
+	        e_17 = {
+	          error: e_17_1
+	        };
+	        return [3 /*break*/, 8];
+	      case 7:
+	        try {
+	          if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
+	        } finally {
+	          if (e_17) throw e_17.error;
+	        }
+	        return [7 /*endfinally*/];
+	      case 8:
+	        return [2 /*return*/];
+	      case 9:
+	        arrays = (0, transform_1.toArray)((0, single_1.map)(iterables, function (iterable) {
+	          return (0, transform_1.toArray)(iterable);
+	        }));
+	        toIterate = arrays.reduce(function (acc, set) {
+	          return acc.flatMap(function (x) {
+	            return set.map(function (y) {
+	              return __spreadArray(__spreadArray([], __read(x), false), [y], false);
+	            });
+	          });
+	        }, [[]]);
+	        _e.label = 10;
+	      case 10:
+	        _e.trys.push([10, 15, 16, 17]);
+	        toIterate_1 = __values(toIterate), toIterate_1_1 = toIterate_1.next();
+	        _e.label = 11;
+	      case 11:
+	        if (!!toIterate_1_1.done) return [3 /*break*/, 14];
+	        item = toIterate_1_1.value;
+	        return [4 /*yield*/, item];
+	      case 12:
+	        _e.sent();
+	        _e.label = 13;
+	      case 13:
+	        toIterate_1_1 = toIterate_1.next();
+	        return [3 /*break*/, 11];
+	      case 14:
+	        return [3 /*break*/, 17];
+	      case 15:
+	        e_18_1 = _e.sent();
+	        e_18 = {
+	          error: e_18_1
+	        };
+	        return [3 /*break*/, 17];
+	      case 16:
+	        try {
+	          if (toIterate_1_1 && !toIterate_1_1.done && (_d = toIterate_1.return)) _d.call(toIterate_1);
+	        } finally {
+	          if (e_18) throw e_18.error;
+	        }
+	        return [7 /*endfinally*/];
+	      case 17:
+	        return [2 /*return*/];
+	    }
+	  });
+	}
+	set.cartesianProduct = cartesianProduct;
+	/**
+	 * Iterates cartesian product of given async iterables.
+	 *
+	 * @param iterables
+	 */
+	function cartesianProductAsync() {
+	  var iterables = [];
+	  for (var _i = 0; _i < arguments.length; _i++) {
+	    iterables[_i] = arguments[_i];
+	  }
+	  return __asyncGenerator(this, arguments, function cartesianProductAsync_1() {
+	    var _a, _b, _c, item, e_19_1, arrays, toIterate, toIterate_2, toIterate_2_1, item, e_20_1;
+	    var e_20, _d;
+	    var _this = this;
+	    var _e, e_19, _f, _g;
+	    return __generator(this, function (_h) {
+	      switch (_h.label) {
+	        case 0:
+	          if (!(iterables.length === 0)) return [3 /*break*/, 2];
+	          return [4 /*yield*/, __await(void 0)];
+	        case 1:
+	          return [2 /*return*/, _h.sent()];
+	        case 2:
+	          if (!(iterables.length === 1)) return [3 /*break*/, 20];
+	          _h.label = 3;
+	        case 3:
+	          _h.trys.push([3, 12, 13, 18]);
+	          _a = true, _b = __asyncValues((0, transform_1.toAsyncIterable)(iterables[0]));
+	          _h.label = 4;
+	        case 4:
+	          return [4 /*yield*/, __await(_b.next())];
+	        case 5:
+	          if (!(_c = _h.sent(), _e = _c.done, !_e)) return [3 /*break*/, 11];
+	          _g = _c.value;
+	          _a = false;
+	          _h.label = 6;
+	        case 6:
+	          _h.trys.push([6,, 9, 10]);
+	          item = _g;
+	          return [4 /*yield*/, __await([item])];
+	        case 7:
+	          return [4 /*yield*/, _h.sent()];
+	        case 8:
+	          _h.sent();
+	          return [3 /*break*/, 10];
+	        case 9:
+	          _a = true;
+	          return [7 /*endfinally*/];
+	        case 10:
+	          return [3 /*break*/, 4];
+	        case 11:
+	          return [3 /*break*/, 18];
+	        case 12:
+	          e_19_1 = _h.sent();
+	          e_19 = {
+	            error: e_19_1
+	          };
+	          return [3 /*break*/, 18];
+	        case 13:
+	          _h.trys.push([13,, 16, 17]);
+	          if (!(!_a && !_e && (_f = _b.return))) return [3 /*break*/, 15];
+	          return [4 /*yield*/, __await(_f.call(_b))];
+	        case 14:
+	          _h.sent();
+	          _h.label = 15;
+	        case 15:
+	          return [3 /*break*/, 17];
+	        case 16:
+	          if (e_19) throw e_19.error;
+	          return [7 /*endfinally*/];
+	        case 17:
+	          return [7 /*endfinally*/];
+	        case 18:
+	          return [4 /*yield*/, __await(void 0)];
+	        case 19:
+	          return [2 /*return*/, _h.sent()];
+	        case 20:
+	          return [4 /*yield*/, __await((0, transform_1.toArrayAsync)((0, single_1.mapAsync)(iterables, function (iterable) {
+	            return __awaiter(_this, void 0, void 0, function () {
+	              return __generator(this, function (_a) {
+	                switch (_a.label) {
+	                  case 0:
+	                    return [4 /*yield*/, (0, transform_1.toArrayAsync)(iterable)];
+	                  case 1:
+	                    return [2 /*return*/, _a.sent()];
+	                }
+	              });
+	            });
+	          })))];
+	        case 21:
+	          arrays = _h.sent();
+	          toIterate = arrays.reduce(function (acc, set) {
+	            return acc.flatMap(function (x) {
+	              return set.map(function (y) {
+	                return __spreadArray(__spreadArray([], __read(x), false), [y], false);
+	              });
+	            });
+	          }, [[]]);
+	          _h.label = 22;
+	        case 22:
+	          _h.trys.push([22, 28, 29, 30]);
+	          toIterate_2 = __values(toIterate), toIterate_2_1 = toIterate_2.next();
+	          _h.label = 23;
+	        case 23:
+	          if (!!toIterate_2_1.done) return [3 /*break*/, 27];
+	          item = toIterate_2_1.value;
+	          return [4 /*yield*/, __await(item)];
+	        case 24:
+	          return [4 /*yield*/, _h.sent()];
+	        case 25:
+	          _h.sent();
+	          _h.label = 26;
+	        case 26:
+	          toIterate_2_1 = toIterate_2.next();
+	          return [3 /*break*/, 23];
+	        case 27:
+	          return [3 /*break*/, 30];
+	        case 28:
+	          e_20_1 = _h.sent();
+	          e_20 = {
+	            error: e_20_1
+	          };
+	          return [3 /*break*/, 30];
+	        case 29:
+	          try {
+	            if (toIterate_2_1 && !toIterate_2_1.done && (_d = toIterate_2.return)) _d.call(toIterate_2);
+	          } finally {
+	            if (e_20) throw e_20.error;
+	          }
+	          return [7 /*endfinally*/];
+	        case 30:
+	          return [2 /*return*/];
+	      }
+	    });
+	  });
+	}
+	set.cartesianProductAsync = cartesianProductAsync;
 	return set;
 }
 
@@ -12117,13 +12379,13 @@ function requireSingle () {
 	return single;
 }
 
-var math = {};
+var infinite = {};
 
-var hasRequiredMath;
+var hasRequiredInfinite;
 
-function requireMath () {
-	if (hasRequiredMath) return math;
-	hasRequiredMath = 1;
+function requireInfinite () {
+	if (hasRequiredInfinite) return infinite;
+	hasRequiredInfinite = 1;
 
 	var __generator = commonjsGlobal && commonjsGlobal.__generator || function (thisArg, body) {
 	  var _ = {
@@ -12239,6 +12501,22 @@ function requireMath () {
 	var __await = commonjsGlobal && commonjsGlobal.__await || function (v) {
 	  return this instanceof __await ? (this.v = v, this) : new __await(v);
 	};
+	var __asyncDelegator = commonjsGlobal && commonjsGlobal.__asyncDelegator || function (o) {
+	  var i, p;
+	  return i = {}, verb("next"), verb("throw", function (e) {
+	    throw e;
+	  }), verb("return"), i[Symbol.iterator] = function () {
+	    return this;
+	  }, i;
+	  function verb(n, f) {
+	    i[n] = o[n] ? function (v) {
+	      return (p = !p) ? {
+	        value: __await(o[n](v)),
+	        done: n === "return"
+	      } : f ? f(v) : v;
+	    } : f;
+	  }
+	};
 	var __asyncGenerator = commonjsGlobal && commonjsGlobal.__asyncGenerator || function (thisArg, _arguments, generator) {
 	  if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
 	  var g = generator.apply(thisArg, _arguments || []),
@@ -12274,32 +12552,425 @@ function requireMath () {
 	    if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]);
 	  }
 	};
-	var __values = commonjsGlobal && commonjsGlobal.__values || function (o) {
-	  var s = typeof Symbol === "function" && Symbol.iterator,
-	    m = s && o[s],
-	    i = 0;
-	  if (m) return m.call(o);
-	  if (o && typeof o.length === "number") return {
-	    next: function () {
-	      if (o && i >= o.length) o = void 0;
-	      return {
-	        value: o && o[i++],
-	        done: !o
-	      };
-	    }
-	  };
-	  throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-	};
-	Object.defineProperty(math, "__esModule", {
-	  value: true
-	});
-	math.runningTotalAsync = math.runningTotal = math.runningProductAsync = math.runningProduct = math.runningMinAsync = math.runningMin = math.runningMaxAsync = math.runningMax = math.runningDifferenceAsync = math.runningDifference = math.runningAverageAsync = math.runningAverage = void 0;
-	var transform_1 = requireTransform();
-	/**
-	 * Accumulate the running average (mean) over a list of numbers
-	 *
-	 * @param numbers
-	 * @param initialValue (Optional) If provided, the running average leads off with the initial value.
+	var __read = commonjsGlobal && commonjsGlobal.__read || function (o, n) {
+	  var m = typeof Symbol === "function" && o[Symbol.iterator];
+	  if (!m) return o;
+	  var i = m.call(o),
+	    r,
+	    ar = [],
+	    e;
+	  try {
+	    while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+	  } catch (error) {
+	    e = {
+	      error: error
+	    };
+	  } finally {
+	    try {
+	      if (r && !r.done && (m = i["return"])) m.call(i);
+	    } finally {
+	      if (e) throw e.error;
+	    }
+	  }
+	  return ar;
+	};
+	var __spreadArray = commonjsGlobal && commonjsGlobal.__spreadArray || function (to, from, pack) {
+	  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+	    if (ar || !(i in from)) {
+	      if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+	      ar[i] = from[i];
+	    }
+	  }
+	  return to.concat(ar || Array.prototype.slice.call(from));
+	};
+	var __values = commonjsGlobal && commonjsGlobal.__values || function (o) {
+	  var s = typeof Symbol === "function" && Symbol.iterator,
+	    m = s && o[s],
+	    i = 0;
+	  if (m) return m.call(o);
+	  if (o && typeof o.length === "number") return {
+	    next: function () {
+	      if (o && i >= o.length) o = void 0;
+	      return {
+	        value: o && o[i++],
+	        done: !o
+	      };
+	    }
+	  };
+	  throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+	};
+	Object.defineProperty(infinite, "__esModule", {
+	  value: true
+	});
+	infinite.repeat = infinite.cycleAsync = infinite.cycle = infinite.count = void 0;
+	var transform_1 = requireTransform();
+	/**
+	 * Count sequentially forever
+	 *
+	 * @param start (optional, default 1)
+	 * @param step (optional, default 1)
+	 */
+	function count(start, step) {
+	  var i;
+	  if (start === void 0) {
+	    start = 1;
+	  }
+	  if (step === void 0) {
+	    step = 1;
+	  }
+	  return __generator(this, function (_a) {
+	    switch (_a.label) {
+	      case 0:
+	        i = start;
+	        _a.label = 1;
+	      case 1:
+	        return [4 /*yield*/, i];
+	      case 2:
+	        _a.sent();
+	        _a.label = 3;
+	      case 3:
+	        i += step;
+	        return [3 /*break*/, 1];
+	      case 4:
+	        return [2 /*return*/];
+	    }
+	  });
+	}
+	infinite.count = count;
+	/**
+	 * Cycle through the elements of a collection sequentially forever
+	 *
+	 * @param iterable
+	 */
+	function cycle(iterable) {
+	  var data, data_1, data_1_1, datum, e_1_1;
+	  var e_1, _a;
+	  return __generator(this, function (_b) {
+	    switch (_b.label) {
+	      case 0:
+	        data = __spreadArray([], __read((0, transform_1.toIterable)(iterable)), false);
+	        if (data.length === 0) {
+	          return [2 /*return*/];
+	        }
+	        _b.label = 1;
+	      case 1:
+	        _b.label = 2;
+	      case 2:
+	        _b.trys.push([2, 7, 8, 9]);
+	        data_1 = (e_1 = void 0, __values(data)), data_1_1 = data_1.next();
+	        _b.label = 3;
+	      case 3:
+	        if (!!data_1_1.done) return [3 /*break*/, 6];
+	        datum = data_1_1.value;
+	        return [4 /*yield*/, datum];
+	      case 4:
+	        _b.sent();
+	        _b.label = 5;
+	      case 5:
+	        data_1_1 = data_1.next();
+	        return [3 /*break*/, 3];
+	      case 6:
+	        return [3 /*break*/, 9];
+	      case 7:
+	        e_1_1 = _b.sent();
+	        e_1 = {
+	          error: e_1_1
+	        };
+	        return [3 /*break*/, 9];
+	      case 8:
+	        try {
+	          if (data_1_1 && !data_1_1.done && (_a = data_1.return)) _a.call(data_1);
+	        } finally {
+	          if (e_1) throw e_1.error;
+	        }
+	        return [7 /*endfinally*/];
+	      case 9:
+	        return [3 /*break*/, 1];
+	      case 10:
+	        return [2 /*return*/];
+	    }
+	  });
+	}
+	infinite.cycle = cycle;
+	/**
+	 * Cycle through the elements of a async iterable sequentially forever
+	 *
+	 * @param iterable
+	 */
+	function cycleAsync(iterable) {
+	  return __asyncGenerator(this, arguments, function cycleAsync_1() {
+	    var data, _a, _b, _c, datum, e_2_1;
+	    var _d, e_2, _e, _f;
+	    return __generator(this, function (_g) {
+	      switch (_g.label) {
+	        case 0:
+	          data = [];
+	          _g.label = 1;
+	        case 1:
+	          _g.trys.push([1, 10, 11, 16]);
+	          _a = true, _b = __asyncValues((0, transform_1.toAsyncIterable)(iterable));
+	          _g.label = 2;
+	        case 2:
+	          return [4 /*yield*/, __await(_b.next())];
+	        case 3:
+	          if (!(_c = _g.sent(), _d = _c.done, !_d)) return [3 /*break*/, 9];
+	          _f = _c.value;
+	          _a = false;
+	          _g.label = 4;
+	        case 4:
+	          _g.trys.push([4,, 7, 8]);
+	          datum = _f;
+	          data.push(datum);
+	          return [4 /*yield*/, __await(datum)];
+	        case 5:
+	          return [4 /*yield*/, _g.sent()];
+	        case 6:
+	          _g.sent();
+	          return [3 /*break*/, 8];
+	        case 7:
+	          _a = true;
+	          return [7 /*endfinally*/];
+	        case 8:
+	          return [3 /*break*/, 2];
+	        case 9:
+	          return [3 /*break*/, 16];
+	        case 10:
+	          e_2_1 = _g.sent();
+	          e_2 = {
+	            error: e_2_1
+	          };
+	          return [3 /*break*/, 16];
+	        case 11:
+	          _g.trys.push([11,, 14, 15]);
+	          if (!(!_a && !_d && (_e = _b.return))) return [3 /*break*/, 13];
+	          return [4 /*yield*/, __await(_e.call(_b))];
+	        case 12:
+	          _g.sent();
+	          _g.label = 13;
+	        case 13:
+	          return [3 /*break*/, 15];
+	        case 14:
+	          if (e_2) throw e_2.error;
+	          return [7 /*endfinally*/];
+	        case 15:
+	          return [7 /*endfinally*/];
+	        case 16:
+	          return [5 /*yield**/, __values(__asyncDelegator(__asyncValues(cycle(data))))];
+	        case 17:
+	          return [4 /*yield*/, __await.apply(void 0, [_g.sent()])];
+	        case 18:
+	          _g.sent();
+	          return [2 /*return*/];
+	      }
+	    });
+	  });
+	}
+	infinite.cycleAsync = cycleAsync;
+	/**
+	 * Repeat an item forever
+	 *
+	 * @param item
+	 */
+	function repeat(item) {
+	  return __generator(this, function (_a) {
+	    switch (_a.label) {
+	      case 0:
+	        return [4 /*yield*/, item];
+	      case 1:
+	        _a.sent();
+	        return [3 /*break*/, 0];
+	      case 2:
+	        return [2 /*return*/];
+	    }
+	  });
+	}
+	infinite.repeat = repeat;
+	return infinite;
+}
+
+var math = {};
+
+var hasRequiredMath;
+
+function requireMath () {
+	if (hasRequiredMath) return math;
+	hasRequiredMath = 1;
+
+	var __generator = commonjsGlobal && commonjsGlobal.__generator || function (thisArg, body) {
+	  var _ = {
+	      label: 0,
+	      sent: function () {
+	        if (t[0] & 1) throw t[1];
+	        return t[1];
+	      },
+	      trys: [],
+	      ops: []
+	    },
+	    f,
+	    y,
+	    t,
+	    g;
+	  return g = {
+	    next: verb(0),
+	    "throw": verb(1),
+	    "return": verb(2)
+	  }, typeof Symbol === "function" && (g[Symbol.iterator] = function () {
+	    return this;
+	  }), g;
+	  function verb(n) {
+	    return function (v) {
+	      return step([n, v]);
+	    };
+	  }
+	  function step(op) {
+	    if (f) throw new TypeError("Generator is already executing.");
+	    while (g && (g = 0, op[0] && (_ = 0)), _) try {
+	      if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+	      if (y = 0, t) op = [op[0] & 2, t.value];
+	      switch (op[0]) {
+	        case 0:
+	        case 1:
+	          t = op;
+	          break;
+	        case 4:
+	          _.label++;
+	          return {
+	            value: op[1],
+	            done: false
+	          };
+	        case 5:
+	          _.label++;
+	          y = op[1];
+	          op = [0];
+	          continue;
+	        case 7:
+	          op = _.ops.pop();
+	          _.trys.pop();
+	          continue;
+	        default:
+	          if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+	            _ = 0;
+	            continue;
+	          }
+	          if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
+	            _.label = op[1];
+	            break;
+	          }
+	          if (op[0] === 6 && _.label < t[1]) {
+	            _.label = t[1];
+	            t = op;
+	            break;
+	          }
+	          if (t && _.label < t[2]) {
+	            _.label = t[2];
+	            _.ops.push(op);
+	            break;
+	          }
+	          if (t[2]) _.ops.pop();
+	          _.trys.pop();
+	          continue;
+	      }
+	      op = body.call(thisArg, _);
+	    } catch (e) {
+	      op = [6, e];
+	      y = 0;
+	    } finally {
+	      f = t = 0;
+	    }
+	    if (op[0] & 5) throw op[1];
+	    return {
+	      value: op[0] ? op[1] : void 0,
+	      done: true
+	    };
+	  }
+	};
+	var __asyncValues = commonjsGlobal && commonjsGlobal.__asyncValues || function (o) {
+	  if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+	  var m = o[Symbol.asyncIterator],
+	    i;
+	  return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () {
+	    return this;
+	  }, i);
+	  function verb(n) {
+	    i[n] = o[n] && function (v) {
+	      return new Promise(function (resolve, reject) {
+	        v = o[n](v), settle(resolve, reject, v.done, v.value);
+	      });
+	    };
+	  }
+	  function settle(resolve, reject, d, v) {
+	    Promise.resolve(v).then(function (v) {
+	      resolve({
+	        value: v,
+	        done: d
+	      });
+	    }, reject);
+	  }
+	};
+	var __await = commonjsGlobal && commonjsGlobal.__await || function (v) {
+	  return this instanceof __await ? (this.v = v, this) : new __await(v);
+	};
+	var __asyncGenerator = commonjsGlobal && commonjsGlobal.__asyncGenerator || function (thisArg, _arguments, generator) {
+	  if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+	  var g = generator.apply(thisArg, _arguments || []),
+	    i,
+	    q = [];
+	  return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () {
+	    return this;
+	  }, i;
+	  function verb(n) {
+	    if (g[n]) i[n] = function (v) {
+	      return new Promise(function (a, b) {
+	        q.push([n, v, a, b]) > 1 || resume(n, v);
+	      });
+	    };
+	  }
+	  function resume(n, v) {
+	    try {
+	      step(g[n](v));
+	    } catch (e) {
+	      settle(q[0][3], e);
+	    }
+	  }
+	  function step(r) {
+	    r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r);
+	  }
+	  function fulfill(value) {
+	    resume("next", value);
+	  }
+	  function reject(value) {
+	    resume("throw", value);
+	  }
+	  function settle(f, v) {
+	    if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]);
+	  }
+	};
+	var __values = commonjsGlobal && commonjsGlobal.__values || function (o) {
+	  var s = typeof Symbol === "function" && Symbol.iterator,
+	    m = s && o[s],
+	    i = 0;
+	  if (m) return m.call(o);
+	  if (o && typeof o.length === "number") return {
+	    next: function () {
+	      if (o && i >= o.length) o = void 0;
+	      return {
+	        value: o && o[i++],
+	        done: !o
+	      };
+	    }
+	  };
+	  throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+	};
+	Object.defineProperty(math, "__esModule", {
+	  value: true
+	});
+	math.runningTotalAsync = math.runningTotal = math.runningProductAsync = math.runningProduct = math.runningMinAsync = math.runningMin = math.runningMaxAsync = math.runningMax = math.runningDifferenceAsync = math.runningDifference = math.runningAverageAsync = math.runningAverage = void 0;
+	var transform_1 = requireTransform();
+	/**
+	 * Accumulate the running average (mean) over a list of numbers
+	 *
+	 * @param numbers
+	 * @param initialValue (Optional) If provided, the running average leads off with the initial value.
 	 */
 	function runningAverage(numbers, initialValue) {
 	  var n, _a, _b, total, e_1_1;
@@ -13275,11 +13946,12 @@ function requireReduce () {
 	Object.defineProperty(reduce$1, "__esModule", {
 	  value: true
 	});
-	reduce$1.toFirstAndLastAsync = reduce$1.toFirstAndLast = reduce$1.toLastAsync = reduce$1.toLast = reduce$1.toFirstAsync = reduce$1.toFirst = reduce$1.toCountAsync = reduce$1.toCount = reduce$1.toProductAsync = reduce$1.toProduct = reduce$1.toSumAsync = reduce$1.toSum = reduce$1.toMinMaxAsync = reduce$1.toMinMax = reduce$1.toMinAsync = reduce$1.toMin = reduce$1.toMaxAsync = reduce$1.toMax = reduce$1.toAverageAsync = reduce$1.toAverage = reduce$1.toValueAsync = reduce$1.toValue = void 0;
+	reduce$1.toFirstAndLastAsync = reduce$1.toFirstAndLast = reduce$1.toLastAsync = reduce$1.toLast = reduce$1.toFirstAsync = reduce$1.toFirst = reduce$1.toCountAsync = reduce$1.toCount = reduce$1.toProductAsync = reduce$1.toProduct = reduce$1.toSumAsync = reduce$1.toSum = reduce$1.toRangeAsync = reduce$1.toRange = reduce$1.toMinMaxAsync = reduce$1.toMinMax = reduce$1.toMinAsync = reduce$1.toMin = reduce$1.toMaxAsync = reduce$1.toMax = reduce$1.toAverageAsync = reduce$1.toAverage = reduce$1.toValueAsync = reduce$1.toValue = void 0;
 	var transform_1 = requireTransform();
 	var exceptions_1 = exceptions;
 	var summary_1 = requireSummary();
 	var tools_1 = requireTools();
+	var single_1 = requireSingle();
 	/**
 	 * Reduces iterable source like `array.reduce()` function.
 	 *
@@ -13645,6 +14317,46 @@ function requireReduce () {
 	  });
 	}
 	reduce$1.toMinMaxAsync = toMinMaxAsync;
+	/**
+	 * Reduces given collection to its range.
+	 *
+	 * Returns 0 if given collection is empty.
+	 *
+	 * @param numbers
+	 */
+	function toRange(numbers) {
+	  var _a = __read(toMinMax((0, single_1.map)(numbers, function (n) {
+	      return Number(n);
+	    })), 2),
+	    min = _a[0],
+	    max = _a[1];
+	  return (max !== null && max !== void 0 ? max : 0) - (min !== null && min !== void 0 ? min : 0);
+	}
+	reduce$1.toRange = toRange;
+	/**
+	 * Reduces given async collection to its range.
+	 *
+	 * Returns 0 if given async collection is empty.
+	 *
+	 * @param numbers
+	 */
+	function toRangeAsync(numbers) {
+	  return __awaiter(this, void 0, void 0, function () {
+	    var _a, min, max;
+	    return __generator(this, function (_b) {
+	      switch (_b.label) {
+	        case 0:
+	          return [4 /*yield*/, toMinMaxAsync((0, single_1.mapAsync)(numbers, function (n) {
+	            return Number(n);
+	          }))];
+	        case 1:
+	          _a = __read.apply(void 0, [_b.sent(), 2]), min = _a[0], max = _a[1];
+	          return [2 /*return*/, (max !== null && max !== void 0 ? max : 0) - (min !== null && min !== void 0 ? min : 0)];
+	      }
+	    });
+	  });
+	}
+	reduce$1.toRangeAsync = toRangeAsync;
 	/**
 	 * Reduces given collection to the sum of its items.
 	 *
@@ -14214,6 +14926,7 @@ function requireStream () {
 	var set_1 = requireSet();
 	var reduce_1 = requireReduce();
 	var summary_1 = requireSummary();
+	var index_1 = requireLib();
 	/**
 	 * Provides fluent interface for working with iterables.
 	 */
@@ -14240,6 +14953,43 @@ function requireStream () {
 	  Stream.ofEmpty = function () {
 	    return new Stream([]);
 	  };
+	  /**
+	   * Creates iterable instance with fluent interface from infinite count iterable.
+	   *
+	   * @param start (optional, default 1)
+	   * @param step (optional, default 1)
+	   *
+	   * @see infinite.count
+	   */
+	  Stream.ofCount = function (start, step) {
+	    if (start === void 0) {
+	      start = 1;
+	    }
+	    if (step === void 0) {
+	      step = 1;
+	    }
+	    return new Stream(index_1.infinite.count(start, step));
+	  };
+	  /**
+	   * Creates iterable instance with fluent interface from infinite collection items repeating.
+	   *
+	   * @param iterable
+	   *
+	   * @see infinite.cycle
+	   */
+	  Stream.ofCycle = function (iterable) {
+	    return new Stream(index_1.infinite.cycle(iterable));
+	  };
+	  /**
+	   * Creates iterable instance with fluent interface from infinite item repeating.
+	   *
+	   * @param item
+	   *
+	   * @see infinite.repeat
+	   */
+	  Stream.ofRepeat = function (item) {
+	    return new Stream(index_1.infinite.repeat(item));
+	  };
 	  /**
 	   * Iterate stream collection with another iterable collections simultaneously.
 	   *
@@ -14718,6 +15468,21 @@ function requireStream () {
 	    this.data = set_1.union.apply(void 0, __spreadArray([this.data], __read(iterables), false));
 	    return this;
 	  };
+	  /**
+	   * Iterates cartesian product of iterable source and given iterables.
+	   *
+	   * @param iterables
+	   *
+	   * @see set.cartesianProduct
+	   */
+	  Stream.prototype.cartesianProductWith = function () {
+	    var iterables = [];
+	    for (var _i = 0; _i < arguments.length; _i++) {
+	      iterables[_i] = arguments[_i];
+	    }
+	    this.data = set_1.cartesianProduct.apply(void 0, __spreadArray([this.data], __read(iterables), false));
+	    return this;
+	  };
 	  /**
 	   * Peek at each element between other Stream operations to do some action without modifying the stream.
 	   *
@@ -14887,6 +15652,16 @@ function requireStream () {
 	  Stream.prototype.toProduct = function () {
 	    return (0, reduce_1.toProduct)(this);
 	  };
+	  /**
+	   * Reduces given collection to its range.
+	   *
+	   * Returns 0 if given collection is empty.
+	   *
+	   * @see reduce.toRange
+	   */
+	  Stream.prototype.toRange = function () {
+	    return (0, reduce_1.toRange)(this);
+	  };
 	  /**
 	   * Returns true if all elements of stream match the predicate function.
 	   *
@@ -15323,6 +16098,7 @@ function requireAsyncStream () {
 	var set_1 = requireSet();
 	var reduce_1 = requireReduce();
 	var summary_1 = requireSummary();
+	var index_1 = requireLib();
 	/**
 	 * Provides fluent interface for working with async iterables.
 	 */
@@ -15349,6 +16125,37 @@ function requireAsyncStream () {
 	  AsyncStream.ofEmpty = function () {
 	    return new AsyncStream((0, transform_1.toAsyncIterable)([]));
 	  };
+	  /**
+	   * Creates iterable instance with fluent interface from infinite count iterable.
+	   *
+	   * @param start (optional, default 1)
+	   * @param step (optional, default 1)
+	   */
+	  AsyncStream.ofCount = function (start, step) {
+	    if (start === void 0) {
+	      start = 1;
+	    }
+	    if (step === void 0) {
+	      step = 1;
+	    }
+	    return new AsyncStream((0, transform_1.toAsyncIterable)(index_1.infinite.count(start, step)));
+	  };
+	  /**
+	   * Creates iterable instance with fluent interface from infinite collection items repeating.
+	   *
+	   * @param iterable
+	   */
+	  AsyncStream.ofCycle = function (iterable) {
+	    return new AsyncStream(index_1.infinite.cycleAsync(iterable));
+	  };
+	  /**
+	   * Creates iterable instance with fluent interface from infinite item repeating.
+	   *
+	   * @param item
+	   */
+	  AsyncStream.ofRepeat = function (item) {
+	    return new AsyncStream((0, transform_1.toAsyncIterable)(index_1.infinite.repeat(item)));
+	  };
 	  /**
 	   * Iterate stream collection with another iterable collections simultaneously.
 	   *
@@ -15827,6 +16634,21 @@ function requireAsyncStream () {
 	    this.data = set_1.unionAsync.apply(void 0, __spreadArray([this.data], __read(iterables), false));
 	    return this;
 	  };
+	  /**
+	   * Iterates cartesian product of iterable source and given iterables.
+	   *
+	   * @param iterables
+	   *
+	   * @see set.cartesianProductAsync
+	   */
+	  AsyncStream.prototype.cartesianProductWith = function () {
+	    var iterables = [];
+	    for (var _i = 0; _i < arguments.length; _i++) {
+	      iterables[_i] = arguments[_i];
+	    }
+	    this.data = set_1.cartesianProductAsync.apply(void 0, __spreadArray([this.data], __read(iterables), false));
+	    return this;
+	  };
 	  /**
 	   * Peek at each element between other Stream operations to do some action without modifying the stream.
 	   *
@@ -16134,6 +16956,25 @@ function requireAsyncStream () {
 	      });
 	    });
 	  };
+	  /**
+	   * Reduces given collection to its range.
+	   *
+	   * Returns 0 if given collection is empty.
+	   *
+	   * @see reduce.toRangeAsync
+	   */
+	  AsyncStream.prototype.toRange = function () {
+	    return __awaiter(this, void 0, void 0, function () {
+	      return __generator(this, function (_a) {
+	        switch (_a.label) {
+	          case 0:
+	            return [4 /*yield*/, (0, reduce_1.toRangeAsync)(this)];
+	          case 1:
+	            return [2 /*return*/, _a.sent()];
+	        }
+	      });
+	    });
+	  };
 	  /**
 	   * Returns true if all elements of stream match the predicate function.
 	   *
@@ -16207,7 +17048,7 @@ function requireAsyncStream () {
 	   *
 	   * @see summary.exactlyNAsync
 	   */
-	  AsyncStream.prototype.exactlyNAsync = function (n, predicate) {
+	  AsyncStream.prototype.exactlyN = function (n, predicate) {
 	    return __awaiter(this, void 0, void 0, function () {
 	      return __generator(this, function (_a) {
 	        return [2 /*return*/, (0, summary_1.exactlyNAsync)(this, n, predicate)];
@@ -16477,8 +17318,9 @@ function requireLib () {
 		Object.defineProperty(exports, "__esModule", {
 		  value: true
 		});
-		exports.LengthError = exports.InvalidArgumentError = exports.AsyncStream = exports.Stream = exports.transform = exports.summary = exports.reduce = exports.set = exports.multi = exports.math = exports.single = void 0;
+		exports.LengthError = exports.InvalidArgumentError = exports.AsyncStream = exports.Stream = exports.transform = exports.summary = exports.reduce = exports.set = exports.multi = exports.math = exports.infinite = exports.single = void 0;
 		var single_1 = requireSingle();
+		var infinite_1 = requireInfinite();
 		var math_1 = requireMath();
 		var multi_1 = requireMulti();
 		var set_1 = requireSet();
@@ -16552,6 +17394,12 @@ function requireLib () {
 		  takeWhileAsync: single_1.takeWhileAsync,
 		  valuesAsync: single_1.valuesAsync
 		};
+		exports.infinite = {
+		  count: infinite_1.count,
+		  cycle: infinite_1.cycle,
+		  cycleAsync: infinite_1.cycleAsync,
+		  repeat: infinite_1.repeat
+		};
 		exports.math = {
 		  runningAverage: math_1.runningAverage,
 		  runningDifference: math_1.runningDifference,
@@ -16584,11 +17432,13 @@ function requireLib () {
 		  partialIntersection: set_1.partialIntersection,
 		  symmetricDifference: set_1.symmetricDifference,
 		  union: set_1.union,
+		  cartesianProduct: set_1.cartesianProduct,
 		  distinctAsync: set_1.distinctAsync,
 		  intersectionAsync: set_1.intersectionAsync,
 		  partialIntersectionAsync: set_1.partialIntersectionAsync,
 		  symmetricDifferenceAsync: set_1.symmetricDifferenceAsync,
-		  unionAsync: set_1.unionAsync
+		  unionAsync: set_1.unionAsync,
+		  cartesianProductAsync: set_1.cartesianProductAsync
 		};
 		exports.reduce = {
 		  toAverage: reduce_1.toAverage,
@@ -16600,6 +17450,7 @@ function requireLib () {
 		  toMin: reduce_1.toMin,
 		  toMinMax: reduce_1.toMinMax,
 		  toProduct: reduce_1.toProduct,
+		  toRange: reduce_1.toRange,
 		  toSum: reduce_1.toSum,
 		  toValue: reduce_1.toValue,
 		  toAverageAsync: reduce_1.toAverageAsync,
@@ -16611,6 +17462,7 @@ function requireLib () {
 		  toMinAsync: reduce_1.toMinAsync,
 		  toMinMaxAsync: reduce_1.toMinMaxAsync,
 		  toProductAsync: reduce_1.toProductAsync,
+		  toRangeAsync: reduce_1.toRangeAsync,
 		  toSumAsync: reduce_1.toSumAsync,
 		  toValueAsync: reduce_1.toValueAsync
 		};
@@ -20588,7 +21440,7 @@ function* toIterableIterator(iter) {
     }
   }
 }
-const map = (fn) => (
+const map$1 = (fn) => (
   // eslint-disable-next-line @typescript-eslint/no-shadow -- naming the function is helpful in stack traces/debugging
   function* map2(iterable) {
     for (const item of toIterableIterator(iterable)) {
@@ -21170,7 +22022,7 @@ class LocationPathEvaluation {
     }
   }
   *following(step) {
-    const contextNodes = map((node) => node.ownerElement ?? node)(
+    const contextNodes = map$1((node) => node.ownerElement ?? node)(
       this.contextNodes
     );
     const treeWalker = this.getTreeWalker(step);
@@ -21763,8 +22615,8 @@ undefined && undefined.__awaiter || function (thisArg, _arguments, P, generator)
     step((generator = generator.apply(thisArg, _arguments || [])).next());
   });
 };
-var __await$1 = undefined && undefined.__await || function (v) {
-  return this instanceof __await$1 ? (this.v = v, this) : new __await$1(v);
+var __await$2 = undefined && undefined.__await || function (v) {
+  return this instanceof __await$2 ? (this.v = v, this) : new __await$2(v);
 };
 undefined && undefined.__asyncGenerator || function (thisArg, _arguments, generator) {
   if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
@@ -21789,7 +22641,7 @@ undefined && undefined.__asyncGenerator || function (thisArg, _arguments, genera
     }
   }
   function step(r) {
-    r.value instanceof __await$1 ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r);
+    r.value instanceof __await$2 ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r);
   }
   function fulfill(value) {
     resume("next", value);
@@ -21839,7 +22691,7 @@ var __awaiter = undefined && undefined.__awaiter || function (thisArg, _argument
     step((generator = generator.apply(thisArg, _arguments || [])).next());
   });
 };
-var __asyncValues = undefined && undefined.__asyncValues || function (o) {
+var __asyncValues$1 = undefined && undefined.__asyncValues || function (o) {
   if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
   var m = o[Symbol.asyncIterator],
     i;
@@ -21888,7 +22740,7 @@ function toValueAsync(data, reducer, initialValue) {
   return __awaiter(this, void 0, void 0, function* () {
     let carry = initialValue;
     try {
-      for (var _d = true, _e = __asyncValues(toAsyncIterable(data)), _f; _f = yield _e.next(), _a = _f.done, !_a;) {
+      for (var _d = true, _e = __asyncValues$1(toAsyncIterable(data)), _f; _f = yield _e.next(), _a = _f.done, !_a;) {
         _c = _f.value;
         _d = false;
         try {
@@ -22076,6 +22928,30 @@ function toMinMaxAsync(data, compareBy) {
     }), [undefined, undefined]);
   });
 }
+/**
+ * Reduces given collection to its range.
+ *
+ * Returns 0 if given collection is empty.
+ *
+ * @param numbers
+ */
+function toRange(numbers) {
+  const [min, max] = toMinMax(map(numbers, n => Number(n)));
+  return (max !== null && max !== void 0 ? max : 0) - (min !== null && min !== void 0 ? min : 0);
+}
+/**
+ * Reduces given async collection to its range.
+ *
+ * Returns 0 if given async collection is empty.
+ *
+ * @param numbers
+ */
+function toRangeAsync(numbers) {
+  return __awaiter(this, void 0, void 0, function* () {
+    const [min, max] = yield toMinMaxAsync(mapAsync(numbers, n => Number(n)));
+    return (max !== null && max !== void 0 ? max : 0) - (min !== null && min !== void 0 ? min : 0);
+  });
+}
 /**
  * Reduces given collection to the sum of its items.
  *
@@ -22175,7 +23051,7 @@ function toFirstAsync(data) {
   var _a, e_2, _b, _c;
   return __awaiter(this, void 0, void 0, function* () {
     try {
-      for (var _d = true, _e = __asyncValues(toAsyncIterable(data)), _f; _f = yield _e.next(), _a = _f.done, !_a;) {
+      for (var _d = true, _e = __asyncValues$1(toAsyncIterable(data)), _f; _f = yield _e.next(), _a = _f.done, !_a;) {
         _c = _f.value;
         _d = false;
         try {
@@ -22231,7 +23107,7 @@ function toLastAsync(data) {
     let isEmpty = true;
     let result;
     try {
-      for (var _d = true, _e = __asyncValues(toAsyncIterable(data)), _f; _f = yield _e.next(), _a = _f.done, !_a;) {
+      for (var _d = true, _e = __asyncValues$1(toAsyncIterable(data)), _f; _f = yield _e.next(), _a = _f.done, !_a;) {
         _c = _f.value;
         _d = false;
         try {
@@ -22293,7 +23169,7 @@ function toFirstAndLastAsync(data) {
     let first = NoValueMonad;
     let last = NoValueMonad;
     try {
-      for (var _d = true, _e = __asyncValues(toAsyncIterable(data)), _f; _f = yield _e.next(), _a = _f.done, !_a;) {
+      for (var _d = true, _e = __asyncValues$1(toAsyncIterable(data)), _f; _f = yield _e.next(), _a = _f.done, !_a;) {
         _c = _f.value;
         _d = false;
         try {
@@ -22443,10 +23319,10 @@ undefined && undefined.__awaiter || function (thisArg, _arguments, P, generator)
     step((generator = generator.apply(thisArg, _arguments || [])).next());
   });
 };
-var __await = undefined && undefined.__await || function (v) {
-  return this instanceof __await ? (this.v = v, this) : new __await(v);
+var __await$1 = undefined && undefined.__await || function (v) {
+  return this instanceof __await$1 ? (this.v = v, this) : new __await$1(v);
 };
-var __asyncGenerator = undefined && undefined.__asyncGenerator || function (thisArg, _arguments, generator) {
+var __asyncGenerator$1 = undefined && undefined.__asyncGenerator || function (thisArg, _arguments, generator) {
   if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
   var g = generator.apply(thisArg, _arguments || []),
     i,
@@ -22469,7 +23345,7 @@ var __asyncGenerator = undefined && undefined.__asyncGenerator || function (this
     }
   }
   function step(r) {
-    r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r);
+    r.value instanceof __await$1 ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r);
   }
   function fulfill(value) {
     resume("next", value);
@@ -22495,85 +23371,193 @@ undefined && undefined.__asyncValues || function (o) {
       });
     };
   }
-  function settle(resolve, reject, d, v) {
-    Promise.resolve(v).then(function (v) {
-      resolve({
-        value: v,
-        done: d
-      });
-    }, reject);
+  function settle(resolve, reject, d, v) {
+    Promise.resolve(v).then(function (v) {
+      resolve({
+        value: v,
+        done: d
+      });
+    }, reject);
+  }
+};
+/**
+ * Converts collection or record to Iterable instance.
+ *
+ * If instance is already an iterable then just return it.
+ *
+ * @param collection
+ */
+function toIterable(collection) {
+  if (isIterable(collection)) {
+    return collection;
+  }
+  if (isIterator(collection)) {
+    return {
+      [Symbol.iterator]() {
+        return collection;
+      }
+    };
+  }
+  if (typeof collection === "object" && collection !== null) {
+    return function* () {
+      for (const key in collection) {
+        if (Object.prototype.hasOwnProperty.call(collection, key)) {
+          yield [key, collection[key]];
+        }
+      }
+    }();
+  }
+  throw new InvalidArgumentError("Given collection is not iterable or iterator.");
+}
+/**
+ * Converts collection or record to AsyncIterable instance.
+ *
+ * If instance is already an async iterable then just return it.
+ *
+ * @param collection
+ */
+function toAsyncIterable(collection) {
+  if (isAsyncIterable(collection)) {
+    return collection;
+  }
+  if (isIterator(collection)) {
+    return {
+      [Symbol.asyncIterator]() {
+        return __asyncGenerator$1(this, arguments, function* _a() {
+          while (true) {
+            const res = yield __await$1(collection.next());
+            if (res.done) {
+              return yield __await$1(void 0);
+            }
+            yield yield __await$1(res.value);
+          }
+        });
+      }
+    };
+  }
+  if (typeof collection === "object" && collection !== null) {
+    collection = toIterable(collection);
+  }
+  if (isIterable(collection)) {
+    return {
+      [Symbol.asyncIterator]() {
+        return __asyncGenerator$1(this, arguments, function* _a() {
+          for (const value of collection) {
+            yield yield __await$1(value);
+          }
+        });
+      }
+    };
+  }
+  throw new InvalidArgumentError("Given collection is not async iterable or iterator.");
+}
+
+var __asyncValues = undefined && undefined.__asyncValues || function (o) {
+  if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+  var m = o[Symbol.asyncIterator],
+    i;
+  return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () {
+    return this;
+  }, i);
+  function verb(n) {
+    i[n] = o[n] && function (v) {
+      return new Promise(function (resolve, reject) {
+        v = o[n](v), settle(resolve, reject, v.done, v.value);
+      });
+    };
+  }
+  function settle(resolve, reject, d, v) {
+    Promise.resolve(v).then(function (v) {
+      resolve({
+        value: v,
+        done: d
+      });
+    }, reject);
+  }
+};
+var __await = undefined && undefined.__await || function (v) {
+  return this instanceof __await ? (this.v = v, this) : new __await(v);
+};
+var __asyncGenerator = undefined && undefined.__asyncGenerator || function (thisArg, _arguments, generator) {
+  if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+  var g = generator.apply(thisArg, _arguments || []),
+    i,
+    q = [];
+  return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () {
+    return this;
+  }, i;
+  function verb(n) {
+    if (g[n]) i[n] = function (v) {
+      return new Promise(function (a, b) {
+        q.push([n, v, a, b]) > 1 || resume(n, v);
+      });
+    };
+  }
+  function resume(n, v) {
+    try {
+      step(g[n](v));
+    } catch (e) {
+      settle(q[0][3], e);
+    }
+  }
+  function step(r) {
+    r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r);
+  }
+  function fulfill(value) {
+    resume("next", value);
+  }
+  function reject(value) {
+    resume("throw", value);
+  }
+  function settle(f, v) {
+    if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]);
   }
 };
 /**
- * Converts collection or record to Iterable instance.
- *
- * If instance is already an iterable then just return it.
+ * Map a function onto every element of the iteration.
  *
- * @param collection
+ * @param data
+ * @param mapper
  */
-function toIterable(collection) {
-  if (isIterable(collection)) {
-    return collection;
-  }
-  if (isIterator(collection)) {
-    return {
-      [Symbol.iterator]() {
-        return collection;
-      }
-    };
-  }
-  if (typeof collection === "object" && collection !== null) {
-    return function* () {
-      for (const key in collection) {
-        if (Object.prototype.hasOwnProperty.call(collection, key)) {
-          yield [key, collection[key]];
-        }
-      }
-    }();
+function* map(data, mapper) {
+  for (const datum of toIterable(data)) {
+    yield mapper(datum);
   }
-  throw new InvalidArgumentError("Given collection is not iterable or iterator.");
 }
 /**
- * Converts collection or record to AsyncIterable instance.
+ * Map a function onto every element of the iteration for async collections.
  *
- * If instance is already an async iterable then just return it.
+ * Mapper may be also async.
  *
- * @param collection
+ * @param data
+ * @param mapper
  */
-function toAsyncIterable(collection) {
-  if (isAsyncIterable(collection)) {
-    return collection;
-  }
-  if (isIterator(collection)) {
-    return {
-      [Symbol.asyncIterator]() {
-        return __asyncGenerator(this, arguments, function* _a() {
-          while (true) {
-            const res = yield __await(collection.next());
-            if (res.done) {
-              return yield __await(void 0);
-            }
-            yield yield __await(res.value);
-          }
-        });
+function mapAsync(data, mapper) {
+  return __asyncGenerator(this, arguments, function* mapAsync_1() {
+    var _a, e_1, _b, _c;
+    try {
+      for (var _d = true, _e = __asyncValues(toAsyncIterable(data)), _f; _f = yield __await(_e.next()), _a = _f.done, !_a;) {
+        _c = _f.value;
+        _d = false;
+        try {
+          const datum = _c;
+          yield yield __await(yield __await(mapper(datum)));
+        } finally {
+          _d = true;
+        }
       }
-    };
-  }
-  if (typeof collection === "object" && collection !== null) {
-    collection = toIterable(collection);
-  }
-  if (isIterable(collection)) {
-    return {
-      [Symbol.asyncIterator]() {
-        return __asyncGenerator(this, arguments, function* _a() {
-          for (const value of collection) {
-            yield yield __await(value);
-          }
-        });
+    } catch (e_1_1) {
+      e_1 = {
+        error: e_1_1
+      };
+    } finally {
+      try {
+        if (!_d && !_a && (_b = _e.return)) yield __await(_b.call(_e));
+      } finally {
+        if (e_1) throw e_1.error;
       }
-    };
-  }
-  throw new InvalidArgumentError("Given collection is not async iterable or iterator.");
+    }
+  });
 }
 
 const reduce = {
@@ -22586,6 +23570,7 @@ const reduce = {
   toMin,
   toMinMax,
   toProduct,
+  toRange,
   toSum,
   toValue,
   toAverageAsync,
@@ -22597,6 +23582,7 @@ const reduce = {
   toMinAsync,
   toMinMaxAsync,
   toProductAsync,
+  toRangeAsync,
   toSumAsync,
   toValueAsync
 };
@@ -24466,7 +25452,7 @@ const date = new FunctionImplementation(
           return new StringEvaluation(context, string);
         }
         if (!DATE_OR_DATE_TIME_PATTERN.test(string)) {
-          const unpaddedMatches = string.match(UNPADDED_MONTH_DAY_PATTERN);
+          const unpaddedMatches = UNPADDED_MONTH_DAY_PATTERN.exec(string);
           if (unpaddedMatches == null) {
             return new DateTimeLikeEvaluation(context, null);
           }
@@ -25060,6 +26046,100 @@ const countNonEmpty = new NumberFunction(
     return result;
   }
 );
+const assertArgument = (index, arg) => {
+  if (arg == null) {
+    throw new Error(`Argument ${index + 1} expected`);
+  }
+};
+const assertIsLocationPathEvaluation = (evaluation) => {
+  if (!(evaluation instanceof LocationPathEvaluation)) {
+    throw new Error("Expected a node-set result");
+  }
+};
+const evaluateArgumentToFilterableNodes = (context, arg) => {
+  const evaluation = arg.evaluate(context);
+  assertIsLocationPathEvaluation(evaluation);
+  return Array.from(evaluation.contextNodes);
+};
+const compareContainmentDepth = ({ repeats: a }, { repeats: b }) => {
+  for (const repeatA of a) {
+    for (const repeatB of b) {
+      if (repeatA.contains(repeatB)) {
+        return -1;
+      }
+      if (repeatB.contains(repeatA)) {
+        return 1;
+      }
+    }
+  }
+  if (a.length === 0 || b.length === 0) {
+    return 0;
+  }
+  return 0;
+};
+const indexedRepeat = new NodeSetFunction(
+  "indexed-repeat",
+  [
+    // spec: arg
+    { arityType: "required", typeHint: "node" },
+    // spec: repeat1
+    { arityType: "required", typeHint: "node" },
+    // spec: index1
+    { arityType: "required", typeHint: "number" },
+    // spec: repeatN=0 -> repeat2
+    { arityType: "optional", typeHint: "node" },
+    // spec: indexN=0 -> index2
+    { arityType: "optional", typeHint: "number" },
+    // spec: repeatN=1 -> repeat3
+    { arityType: "optional", typeHint: "node" },
+    // spec: indexN=1 -> index3
+    { arityType: "optional", typeHint: "number" },
+    // Go beyond spec? Why the heck not! It's clearly a variadic design.
+    { arityType: "variadic", typeHint: "any" }
+  ],
+  (context, args) => {
+    const target = args[0];
+    let pairs = [];
+    for (let i = 1; i < args.length; i += 2) {
+      const repeatsArg = args[i];
+      const positionArg = args[i + 1];
+      assertArgument(i, repeatsArg);
+      assertArgument(i + 1, positionArg);
+      const position2 = positionArg.evaluate(context).toNumber();
+      if (Number.isNaN(position2)) {
+        return [];
+      }
+      const repeats = evaluateArgumentToFilterableNodes(context, repeatsArg);
+      if (repeats.length === 0) {
+        return [];
+      }
+      pairs.push({
+        repeats,
+        position: position2
+      });
+    }
+    pairs = pairs.sort(compareContainmentDepth);
+    let repeatContextNode;
+    for (const [index, pair] of pairs.entries()) {
+      const { position: position2 } = pair;
+      let { repeats } = pair;
+      if (index > 0) {
+        repeats = pair.repeats.filter((repeat) => {
+          return repeatContextNode.contains(repeat);
+        });
+      }
+      const positionedRepeat = repeats[position2 - 1];
+      if (positionedRepeat == null) {
+        return [];
+      }
+      repeatContextNode = positionedRepeat;
+    }
+    const targetNodes = evaluateArgumentToFilterableNodes(context, target);
+    return targetNodes.filter((targetNode) => {
+      return repeatContextNode.contains(targetNode);
+    });
+  }
+);
 const identifiedInstanceLookup = new ScopedElementLookup(":scope > instance[id]", "instance[id]");
 const instancesCache = new UpsertableWeakMap();
 const getInstanceElementByID = (modelElement, id) => {
@@ -25158,6 +26238,7 @@ const randomize = new NodeSetFunction(
 const nodeset = /*#__PURE__*/Object.freeze(/*#__PURE__*/Object.defineProperty({
 	__proto__: null,
 	countNonEmpty,
+	indexedRepeat,
 	instance,
 	once,
 	position,
@@ -26594,131 +27675,132 @@ function requireEncUtf16 () {
 
 var encBase64$1 = {exports: {}};
 
-var hasRequiredEncBase64;
-
-function requireEncBase64 () {
-	if (hasRequiredEncBase64) return encBase64$1.exports;
-	hasRequiredEncBase64 = 1;
-	(function (module, exports) {
-		(function (root, factory) {
-		  {
-		    // CommonJS
-		    module.exports = factory(requireCore());
-		  }
-		})(commonjsGlobal, function (CryptoJS) {
-		  (function () {
-		    // Shortcuts
-		    var C = CryptoJS;
-		    var C_lib = C.lib;
-		    var WordArray = C_lib.WordArray;
-		    var C_enc = C.enc;
-
-		    /**
-		     * Base64 encoding strategy.
-		     */
-		    C_enc.Base64 = {
-		      /**
-		       * Converts a word array to a Base64 string.
-		       *
-		       * @param {WordArray} wordArray The word array.
-		       *
-		       * @return {string} The Base64 string.
-		       *
-		       * @static
-		       *
-		       * @example
-		       *
-		       *     var base64String = CryptoJS.enc.Base64.stringify(wordArray);
-		       */
-		      stringify: function (wordArray) {
-		        // Shortcuts
-		        var words = wordArray.words;
-		        var sigBytes = wordArray.sigBytes;
-		        var map = this._map;
+(function (module, exports) {
+	(function (root, factory) {
+	  {
+	    // CommonJS
+	    module.exports = factory(requireCore());
+	  }
+	})(commonjsGlobal, function (CryptoJS) {
+	  (function () {
+	    // Shortcuts
+	    var C = CryptoJS;
+	    var C_lib = C.lib;
+	    var WordArray = C_lib.WordArray;
+	    var C_enc = C.enc;
+
+	    /**
+	     * Base64 encoding strategy.
+	     */
+	    C_enc.Base64 = {
+	      /**
+	       * Converts a word array to a Base64 string.
+	       *
+	       * @param {WordArray} wordArray The word array.
+	       *
+	       * @return {string} The Base64 string.
+	       *
+	       * @static
+	       *
+	       * @example
+	       *
+	       *     var base64String = CryptoJS.enc.Base64.stringify(wordArray);
+	       */
+	      stringify: function (wordArray) {
+	        // Shortcuts
+	        var words = wordArray.words;
+	        var sigBytes = wordArray.sigBytes;
+	        var map = this._map;
+
+	        // Clamp excess bits
+	        wordArray.clamp();
+
+	        // Convert
+	        var base64Chars = [];
+	        for (var i = 0; i < sigBytes; i += 3) {
+	          var byte1 = words[i >>> 2] >>> 24 - i % 4 * 8 & 0xff;
+	          var byte2 = words[i + 1 >>> 2] >>> 24 - (i + 1) % 4 * 8 & 0xff;
+	          var byte3 = words[i + 2 >>> 2] >>> 24 - (i + 2) % 4 * 8 & 0xff;
+	          var triplet = byte1 << 16 | byte2 << 8 | byte3;
+	          for (var j = 0; j < 4 && i + j * 0.75 < sigBytes; j++) {
+	            base64Chars.push(map.charAt(triplet >>> 6 * (3 - j) & 0x3f));
+	          }
+	        }
 
-		        // Clamp excess bits
-		        wordArray.clamp();
+	        // Add padding
+	        var paddingChar = map.charAt(64);
+	        if (paddingChar) {
+	          while (base64Chars.length % 4) {
+	            base64Chars.push(paddingChar);
+	          }
+	        }
+	        return base64Chars.join('');
+	      },
+	      /**
+	       * Converts a Base64 string to a word array.
+	       *
+	       * @param {string} base64Str The Base64 string.
+	       *
+	       * @return {WordArray} The word array.
+	       *
+	       * @static
+	       *
+	       * @example
+	       *
+	       *     var wordArray = CryptoJS.enc.Base64.parse(base64String);
+	       */
+	      parse: function (base64Str) {
+	        // Shortcuts
+	        var base64StrLength = base64Str.length;
+	        var map = this._map;
+	        var reverseMap = this._reverseMap;
+	        if (!reverseMap) {
+	          reverseMap = this._reverseMap = [];
+	          for (var j = 0; j < map.length; j++) {
+	            reverseMap[map.charCodeAt(j)] = j;
+	          }
+	        }
 
-		        // Convert
-		        var base64Chars = [];
-		        for (var i = 0; i < sigBytes; i += 3) {
-		          var byte1 = words[i >>> 2] >>> 24 - i % 4 * 8 & 0xff;
-		          var byte2 = words[i + 1 >>> 2] >>> 24 - (i + 1) % 4 * 8 & 0xff;
-		          var byte3 = words[i + 2 >>> 2] >>> 24 - (i + 2) % 4 * 8 & 0xff;
-		          var triplet = byte1 << 16 | byte2 << 8 | byte3;
-		          for (var j = 0; j < 4 && i + j * 0.75 < sigBytes; j++) {
-		            base64Chars.push(map.charAt(triplet >>> 6 * (3 - j) & 0x3f));
-		          }
-		        }
+	        // Ignore padding
+	        var paddingChar = map.charAt(64);
+	        if (paddingChar) {
+	          var paddingIndex = base64Str.indexOf(paddingChar);
+	          if (paddingIndex !== -1) {
+	            base64StrLength = paddingIndex;
+	          }
+	        }
 
-		        // Add padding
-		        var paddingChar = map.charAt(64);
-		        if (paddingChar) {
-		          while (base64Chars.length % 4) {
-		            base64Chars.push(paddingChar);
-		          }
-		        }
-		        return base64Chars.join('');
-		      },
-		      /**
-		       * Converts a Base64 string to a word array.
-		       *
-		       * @param {string} base64Str The Base64 string.
-		       *
-		       * @return {WordArray} The word array.
-		       *
-		       * @static
-		       *
-		       * @example
-		       *
-		       *     var wordArray = CryptoJS.enc.Base64.parse(base64String);
-		       */
-		      parse: function (base64Str) {
-		        // Shortcuts
-		        var base64StrLength = base64Str.length;
-		        var map = this._map;
-		        var reverseMap = this._reverseMap;
-		        if (!reverseMap) {
-		          reverseMap = this._reverseMap = [];
-		          for (var j = 0; j < map.length; j++) {
-		            reverseMap[map.charCodeAt(j)] = j;
-		          }
-		        }
+	        // Convert
+	        return parseLoop(base64Str, base64StrLength, reverseMap);
+	      },
+	      _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='
+	    };
+	    function parseLoop(base64Str, base64StrLength, reverseMap) {
+	      var words = [];
+	      var nBytes = 0;
+	      for (var i = 0; i < base64StrLength; i++) {
+	        if (i % 4) {
+	          var bits1 = reverseMap[base64Str.charCodeAt(i - 1)] << i % 4 * 2;
+	          var bits2 = reverseMap[base64Str.charCodeAt(i)] >>> 6 - i % 4 * 2;
+	          var bitsCombined = bits1 | bits2;
+	          words[nBytes >>> 2] |= bitsCombined << 24 - nBytes % 4 * 8;
+	          nBytes++;
+	        }
+	      }
+	      return WordArray.create(words, nBytes);
+	    }
+	  })();
+	  return CryptoJS.enc.Base64;
+	}); 
+} (encBase64$1));
 
-		        // Ignore padding
-		        var paddingChar = map.charAt(64);
-		        if (paddingChar) {
-		          var paddingIndex = base64Str.indexOf(paddingChar);
-		          if (paddingIndex !== -1) {
-		            base64StrLength = paddingIndex;
-		          }
-		        }
+var encBase64Exports = encBase64$1.exports;
+const encBase64 = /*@__PURE__*/getDefaultExportFromCjs(encBase64Exports);
 
-		        // Convert
-		        return parseLoop(base64Str, base64StrLength, reverseMap);
-		      },
-		      _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='
-		    };
-		    function parseLoop(base64Str, base64StrLength, reverseMap) {
-		      var words = [];
-		      var nBytes = 0;
-		      for (var i = 0; i < base64StrLength; i++) {
-		        if (i % 4) {
-		          var bits1 = reverseMap[base64Str.charCodeAt(i - 1)] << i % 4 * 2;
-		          var bits2 = reverseMap[base64Str.charCodeAt(i)] >>> 6 - i % 4 * 2;
-		          var bitsCombined = bits1 | bits2;
-		          words[nBytes >>> 2] |= bitsCombined << 24 - nBytes % 4 * 8;
-		          nBytes++;
-		        }
-		      }
-		      return WordArray.create(words, nBytes);
-		    }
-		  })();
-		  return CryptoJS.enc.Base64;
-		}); 
-	} (encBase64$1));
-	return encBase64$1.exports;
-}
+const base64 = /*#__PURE__*/_mergeNamespaces({
+	__proto__: null,
+	default: encBase64
+}, [encBase64Exports]);
 
 var encBase64url = {exports: {}};
 
@@ -30225,7 +31307,7 @@ function requireAes () {
 		(function (root, factory, undef) {
 		  {
 		    // CommonJS
-		    module.exports = factory(requireCore(), requireEncBase64(), requireMd5(), requireEvpkdf(), requireCipherCore());
+		    module.exports = factory(requireCore(), encBase64Exports, requireMd5(), requireEvpkdf(), requireCipherCore());
 		  }
 		})(commonjsGlobal, function (CryptoJS) {
 		  (function () {
@@ -30449,7 +31531,7 @@ function requireTripledes () {
 		(function (root, factory, undef) {
 		  {
 		    // CommonJS
-		    module.exports = factory(requireCore(), requireEncBase64(), requireMd5(), requireEvpkdf(), requireCipherCore());
+		    module.exports = factory(requireCore(), encBase64Exports, requireMd5(), requireEvpkdf(), requireCipherCore());
 		  }
 		})(commonjsGlobal, function (CryptoJS) {
 		  (function () {
@@ -31187,7 +32269,7 @@ function requireRc4 () {
 		(function (root, factory, undef) {
 		  {
 		    // CommonJS
-		    module.exports = factory(requireCore(), requireEncBase64(), requireMd5(), requireEvpkdf(), requireCipherCore());
+		    module.exports = factory(requireCore(), encBase64Exports, requireMd5(), requireEvpkdf(), requireCipherCore());
 		  }
 		})(commonjsGlobal, function (CryptoJS) {
 		  (function () {
@@ -31318,7 +32400,7 @@ function requireRabbit () {
 		(function (root, factory, undef) {
 		  {
 		    // CommonJS
-		    module.exports = factory(requireCore(), requireEncBase64(), requireMd5(), requireEvpkdf(), requireCipherCore());
+		    module.exports = factory(requireCore(), encBase64Exports, requireMd5(), requireEvpkdf(), requireCipherCore());
 		  }
 		})(commonjsGlobal, function (CryptoJS) {
 		  (function () {
@@ -31493,7 +32575,7 @@ function requireRabbitLegacy () {
 		(function (root, factory, undef) {
 		  {
 		    // CommonJS
-		    module.exports = factory(requireCore(), requireEncBase64(), requireMd5(), requireEvpkdf(), requireCipherCore());
+		    module.exports = factory(requireCore(), encBase64Exports, requireMd5(), requireEvpkdf(), requireCipherCore());
 		  }
 		})(commonjsGlobal, function (CryptoJS) {
 		  (function () {
@@ -31667,7 +32749,7 @@ function requireBlowfish () {
 		(function (root, factory, undef) {
 		  {
 		    // CommonJS
-		    module.exports = factory(requireCore(), requireEncBase64(), requireMd5(), requireEvpkdf(), requireCipherCore());
+		    module.exports = factory(requireCore(), encBase64Exports, requireMd5(), requireEvpkdf(), requireCipherCore());
 		  }
 		})(commonjsGlobal, function (CryptoJS) {
 		  (function () {
@@ -31839,7 +32921,7 @@ function requireBlowfish () {
 	(function (root, factory, undef) {
 	  {
 	    // CommonJS
-	    module.exports = factory(requireCore(), requireX64Core(), requireLibTypedarrays(), requireEncUtf16(), requireEncBase64(), requireEncBase64url(), requireMd5(), requireSha1(), requireSha256(), requireSha224(), requireSha512(), requireSha384(), requireSha3(), requireRipemd160(), requireHmac(), requirePbkdf2(), requireEvpkdf(), requireCipherCore(), requireModeCfb(), requireModeCtr(), requireModeCtrGladman(), requireModeOfb(), requireModeEcb(), requirePadAnsix923(), requirePadIso10126(), requirePadIso97971(), requirePadZeropadding(), requirePadNopadding(), requireFormatHex(), requireAes(), requireTripledes(), requireRc4(), requireRabbit(), requireRabbitLegacy(), requireBlowfish());
+	    module.exports = factory(requireCore(), requireX64Core(), requireLibTypedarrays(), requireEncUtf16(), encBase64Exports, requireEncBase64url(), requireMd5(), requireSha1(), requireSha256(), requireSha224(), requireSha512(), requireSha384(), requireSha3(), requireRipemd160(), requireHmac(), requirePbkdf2(), requireEvpkdf(), requireCipherCore(), requireModeCfb(), requireModeCtr(), requireModeCtrGladman(), requireModeOfb(), requireModeEcb(), requirePadAnsix923(), requirePadIso10126(), requirePadIso97971(), requirePadZeropadding(), requirePadNopadding(), requireFormatHex(), requireAes(), requireTripledes(), requireRc4(), requireRabbit(), requireRabbitLegacy(), requireBlowfish());
 	  }
 	})(commonjsGlobal, function (CryptoJS) {
 	  return CryptoJS;
@@ -31848,14 +32930,6 @@ function requireBlowfish () {
 
 var cryptoJsExports = cryptoJs.exports;
 
-var encBase64Exports = requireEncBase64();
-const encBase64 = /*@__PURE__*/getDefaultExportFromCjs(encBase64Exports);
-
-const base64 = /*#__PURE__*/_mergeNamespaces({
-	__proto__: null,
-	default: encBase64
-}, [encBase64Exports]);
-
 var encHex$1 = {exports: {}};
 
 (function (module, exports) {