effect 4.0.0-beta.4 → 4.0.0-beta.41

package/dist/TxPriorityQueue.js

@@ -0,0 +1,416 @@
+/**
+ * A transactional priority queue. Elements are dequeued in order determined by the
+ * provided `Order` instance. All operations participate in the STM transaction system.
+ *
+ * @since 4.0.0
+ */
+import * as C from "./Chunk.js";
+import * as Effect from "./Effect.js";
+import { dual } from "./Function.js";
+import { NodeInspectSymbol, toJson } from "./Inspectable.js";
+import * as O from "./Option.js";
+import { pipeArguments } from "./Pipeable.js";
+import { hasProperty } from "./Predicate.js";
+import * as TxRef from "./TxRef.js";
+const TypeId = "~effect/transactions/TxPriorityQueue";
+const TxPriorityQueueProto = {
+  [NodeInspectSymbol]() {
+    return toJson(this);
+  },
+  toJSON() {
+    return {
+      _id: "TxPriorityQueue"
+    };
+  },
+  pipe() {
+    return pipeArguments(this, arguments);
+  }
+};
+const makeTxPriorityQueue = (ref, ord) => {
+  const self = Object.create(TxPriorityQueueProto);
+  self[TypeId] = TypeId;
+  self.ref = ref;
+  self.ord = ord;
+  return self;
+};
+const insertSorted = (chunk, value, ord) => {
+  const arr = C.toArray(chunk);
+  let lo = 0;
+  let hi = arr.length;
+  while (lo < hi) {
+    const mid = lo + hi >>> 1;
+    if (ord(arr[mid], value) <= 0) {
+      lo = mid + 1;
+    } else {
+      hi = mid;
+    }
+  }
+  const out = Array(arr.length + 1);
+  for (let i = 0; i < lo; i++) out[i] = arr[i];
+  out[lo] = value;
+  for (let i = lo; i < arr.length; i++) out[i + 1] = arr[i];
+  return C.fromIterable(out);
+};
+/**
+ * Creates an empty `TxPriorityQueue` with the given ordering.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.empty<number>(Order.Number)
+ *   const empty = yield* TxPriorityQueue.isEmpty(pq)
+ *   console.log(empty) // true
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category constructors
+ */
+export const empty = order => Effect.map(TxRef.make(C.empty()), ref => makeTxPriorityQueue(ref, order));
+/**
+ * Creates a `TxPriorityQueue` from an iterable of elements.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [3, 1, 2])
+ *   const first = yield* TxPriorityQueue.take(pq)
+ *   console.log(first) // 1
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category constructors
+ */
+export const fromIterable = /*#__PURE__*/dual(2, (order, iterable) => {
+  const arr = Array.from(iterable).sort((a, b) => order(a, b));
+  return Effect.map(TxRef.make(C.fromIterable(arr)), ref => makeTxPriorityQueue(ref, order));
+});
+/**
+ * Creates a `TxPriorityQueue` from variadic elements.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.make(Order.Number)(3, 1, 2)
+ *   const first = yield* TxPriorityQueue.take(pq)
+ *   console.log(first) // 1
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category constructors
+ */
+export const make = order => (...elements) => fromIterable(order, elements);
+/**
+ * Returns the number of elements in the queue.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [1, 2, 3])
+ *   const s = yield* TxPriorityQueue.size(pq)
+ *   console.log(s) // 3
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category getters
+ */
+export const size = self => Effect.map(TxRef.get(self.ref), C.size);
+/**
+ * Returns `true` if the queue is empty.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.empty<number>(Order.Number)
+ *   const empty = yield* TxPriorityQueue.isEmpty(pq)
+ *   console.log(empty) // true
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category getters
+ */
+export const isEmpty = self => Effect.map(size(self), n => n === 0);
+/**
+ * Returns `true` if the queue has at least one element.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [1])
+ *   const nonEmpty = yield* TxPriorityQueue.isNonEmpty(pq)
+ *   console.log(nonEmpty) // true
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category getters
+ */
+export const isNonEmpty = self => Effect.map(size(self), n => n > 0);
+/**
+ * Observes the smallest element without removing it. Retries if the queue is
+ * empty.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [3, 1, 2])
+ *   const top = yield* TxPriorityQueue.peek(pq)
+ *   console.log(top) // 1
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category getters
+ */
+export const peek = self => Effect.gen(function* () {
+  const chunk = yield* TxRef.get(self.ref);
+  const head = C.head(chunk);
+  if (O.isNone(head)) {
+    return yield* Effect.retryTransaction;
+  }
+  return head.value;
+});
+/**
+ * Observes the smallest element without removing it. Returns `None` if the
+ * queue is empty.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Option, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.empty<number>(Order.Number)
+ *   const result = yield* TxPriorityQueue.peekOption(pq)
+ *   console.log(Option.isNone(result)) // true
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category getters
+ */
+export const peekOption = self => Effect.map(TxRef.get(self.ref), C.head);
+/**
+ * Inserts an element into the queue in sorted position.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.empty<number>(Order.Number)
+ *   yield* TxPriorityQueue.offer(pq, 2)
+ *   yield* TxPriorityQueue.offer(pq, 1)
+ *   const first = yield* TxPriorityQueue.take(pq)
+ *   console.log(first) // 1
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category mutations
+ */
+export const offer = /*#__PURE__*/dual(2, (self, value) => TxRef.update(self.ref, chunk => insertSorted(chunk, value, self.ord)));
+/**
+ * Inserts all elements from an iterable into the queue.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.empty<number>(Order.Number)
+ *   yield* TxPriorityQueue.offerAll(pq, [3, 1, 2])
+ *   const first = yield* TxPriorityQueue.take(pq)
+ *   console.log(first) // 1
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category mutations
+ */
+export const offerAll = /*#__PURE__*/dual(2, (self, values) => TxRef.update(self.ref, chunk => {
+  const arr = [...C.toArray(chunk), ...values].sort((a, b) => self.ord(a, b));
+  return C.fromIterable(arr);
+}));
+/**
+ * Takes the smallest element from the queue. Retries if the queue is empty.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [3, 1, 2])
+ *   const first = yield* TxPriorityQueue.take(pq)
+ *   console.log(first) // 1
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category mutations
+ */
+export const take = self => Effect.gen(function* () {
+  const chunk = yield* TxRef.get(self.ref);
+  const head = C.head(chunk);
+  if (O.isNone(head)) {
+    return yield* Effect.retryTransaction;
+  }
+  yield* TxRef.set(self.ref, C.drop(chunk, 1));
+  return head.value;
+});
+/**
+ * Takes all elements from the queue, returning them in priority order.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [3, 1, 2])
+ *   const all = yield* TxPriorityQueue.takeAll(pq)
+ *   console.log(all) // [1, 2, 3]
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category mutations
+ */
+export const takeAll = self => Effect.map(TxRef.modify(self.ref, chunk => [chunk, C.empty()]), C.toArray);
+/**
+ * Tries to take the smallest element. Returns `None` if the queue is empty.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Option, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.empty<number>(Order.Number)
+ *   const result = yield* TxPriorityQueue.takeOption(pq)
+ *   console.log(Option.isNone(result)) // true
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category mutations
+ */
+export const takeOption = self => TxRef.modify(self.ref, chunk => {
+  const head = C.head(chunk);
+  if (O.isNone(head)) {
+    return [O.none(), chunk];
+  }
+  return [O.some(head.value), C.drop(chunk, 1)];
+});
+/**
+ * Takes up to `n` elements from the queue in priority order.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [5, 3, 1, 4, 2])
+ *   const top2 = yield* TxPriorityQueue.takeUpTo(pq, 2)
+ *   console.log(top2) // [1, 2]
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category mutations
+ */
+export const takeUpTo = /*#__PURE__*/dual(2, (self, n) => Effect.map(TxRef.modify(self.ref, chunk => {
+  const taken = C.take(chunk, n);
+  const rest = C.drop(chunk, n);
+  return [taken, rest];
+}), C.toArray));
+/**
+ * Removes elements matching the predicate.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [1, 2, 3, 4, 5])
+ *   yield* TxPriorityQueue.removeIf(pq, (n) => n % 2 === 0)
+ *   const all = yield* TxPriorityQueue.takeAll(pq)
+ *   console.log(all) // [1, 3, 5]
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category filtering
+ */
+export const removeIf = /*#__PURE__*/dual(2, (self, predicate) => TxRef.update(self.ref, chunk => C.filter(chunk, a => !predicate(a))));
+/**
+ * Retains only elements matching the predicate.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [1, 2, 3, 4, 5])
+ *   yield* TxPriorityQueue.retainIf(pq, (n) => n % 2 === 0)
+ *   const all = yield* TxPriorityQueue.takeAll(pq)
+ *   console.log(all) // [2, 4]
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category filtering
+ */
+export const retainIf = /*#__PURE__*/dual(2, (self, predicate) => TxRef.update(self.ref, chunk => C.filter(chunk, predicate)));
+/**
+ * Returns all elements in priority order without removing them.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.fromIterable(Order.Number, [3, 1, 2])
+ *   const all = yield* TxPriorityQueue.toArray(pq)
+ *   console.log(all) // [1, 2, 3]
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category conversions
+ */
+export const toArray = self => Effect.map(TxRef.get(self.ref), C.toArray);
+/**
+ * Determines if the provided value is a `TxPriorityQueue`.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Order, TxPriorityQueue } from "effect"
+ *
+ * const program = Effect.gen(function*() {
+ *   const pq = yield* TxPriorityQueue.empty<number>(Order.Number)
+ *   console.log(TxPriorityQueue.isTxPriorityQueue(pq)) // true
+ *   console.log(TxPriorityQueue.isTxPriorityQueue("nope")) // false
+ * })
+ * ```
+ *
+ * @since 4.0.0
+ * @category guards
+ */
+export const isTxPriorityQueue = u => hasProperty(u, TypeId);
+//# sourceMappingURL=TxPriorityQueue.js.map

package/dist/TxPriorityQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TxPriorityQueue.js","names":["C","Effect","dual","NodeInspectSymbol","toJson","O","pipeArguments","hasProperty","TxRef","TypeId","TxPriorityQueueProto","toJSON","_id","pipe","arguments","makeTxPriorityQueue","ref","ord","self","Object","create","insertSorted","chunk","value","arr","toArray","lo","hi","length","mid","out","Array","i","fromIterable","empty","order","map","make","iterable","from","sort","a","b","elements","size","get","isEmpty","n","isNonEmpty","peek","gen","head","isNone","retryTransaction","peekOption","offer","update","offerAll","values","take","set","drop","takeAll","modify","takeOption","none","some","takeUpTo","taken","rest","removeIf","predicate","filter","retainIf","isTxPriorityQueue","u"],"sources":["../src/TxPriorityQueue.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;AAQA,OAAO,KAAKA,CAAC,MAAM,YAAY;AAC/B,OAAO,KAAKC,MAAM,MAAM,aAAa;AACrC,SAASC,IAAI,QAAQ,eAAe;AAEpC,SAASC,iBAAiB,EAAEC,MAAM,QAAQ,kBAAkB;AAE5D,OAAO,KAAKC,CAAC,MAAM,aAAa;AAGhC,SAASC,aAAa,QAAQ,eAAe;AAC7C,SAASC,WAAW,QAAwB,gBAAgB;AAC5D,OAAO,KAAKC,KAAK,MAAM,YAAY;AAEnC,MAAMC,MAAM,GAAG,sCAAsC;AAgCrD,MAAMC,oBAAoB,GAAkE;EAC1F,CAACP,iBAAiB,IAAC;IACjB,OAAOC,MAAM,CAAC,IAAI,CAAC;EACrB,CAAC;EACDO,MAAMA,CAAA;IACJ,OAAO;MACLC,GAAG,EAAE;KACN;EACH,CAAC;EACDC,IAAIA,CAAA;IACF,OAAOP,aAAa,CAAC,IAAI,EAAEQ,SAAS,CAAC;EACvC;CACD;AAED,MAAMC,mBAAmB,GAAGA,CAAIC,GAA0B,EAAEC,GAAa,KAAwB;EAC/F,MAAMC,IAAI,GAAGC,MAAM,CAACC,MAAM,CAACV,oBAAoB,CAAC;EAChDQ,IAAI,CAACT,MAAM,CAAC,GAAGA,MAAM;EACrBS,IAAI,CAACF,GAAG,GAAGA,GAAG;EACdE,IAAI,CAACD,GAAG,GAAGA,GAAG;EACd,OAAOC,IAAI;AACb,CAAC;AAED,MAAMG,YAAY,GAAGA,CAAIC,KAAe,EAAEC,KAAQ,EAAEN,GAAa,KAAc;EAC7E,MAAMO,GAAG,GAAGxB,CAAC,CAACyB,OAAO,CAACH,KAAK,CAAa;EACxC,IAAII,EAAE,GAAG,CAAC;EACV,IAAIC,EAAE,GAAGH,GAAG,CAACI,MAAM;EACnB,OAAOF,EAAE,GAAGC,EAAE,EAAE;IACd,MAAME,GAAG,GAAIH,EAAE,GAAGC,EAAE,KAAM,CAAC;IAC3B,IAAIV,GAAG,CAACO,GAAG,CAACK,GAAG,CAAC,EAAEN,KAAK,CAAC,IAAI,CAAC,EAAE;MAC7BG,EAAE,GAAGG,GAAG,GAAG,CAAC;IACd,CAAC,MAAM;MACLF,EAAE,GAAGE,GAAG;IACV;EACF;EACA,MAAMC,GAAG,GAAGC,KAAK,CAACP,GAAG,CAACI,MAAM,GAAG,CAAC,CAAa;EAC7C,KAAK,IAAII,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGN,EAAE,EAAEM,CAAC,EAAE,EAAEF,GAAG,CAACE,CAAC,CAAC,GAAGR,GAAG,CAACQ,CAAC,CAAC;EAC5CF,GAAG,CAACJ,EAAE,CAAC,GAAGH,KAAK;EACf,KAAK,IAAIS,CAAC,GAAGN,EAAE,EAAEM,CAAC,GAAGR,GAAG,CAACI,MAAM,EAAEI,CAAC,EAAE,EAAEF,GAAG,CAACE,CAAC,GAAG,CAAC,CAAC,GAAGR,GAAG,CAACQ,CAAC,CAAC;EACzD,OAAOhC,CAAC,CAACiC,YAAY,CAACH,GAAG,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMI,KAAK,GAAOC,KAAe,IACtClC,MAAM,CAACmC,GAAG,CAAC5B,KAAK,CAAC6B,IAAI,CAAWrC,CAAC,CAACkC,KAAK,EAAE,CAAC,EAAGlB,GAAG,IAAKD,mBAAmB,CAACC,GAAG,EAAEmB,KAAK,CAAC,CAAC;AAEvF;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMF,YAAY,gBAqCrB/B,IAAI,CACN,CAAC,EACD,CAAIiC,KAAe,EAAEG,QAAqB,KAAkE;EAC1G,MAAMd,GAAG,GAAGO,KAAK,CAACQ,IAAI,CAACD,QAAQ,CAAC,CAACE,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKP,KAAK,CAACM,CAAC,EAAEC,CAAC,CAAC,CAAC;EAC5D,OAAOzC,MAAM,CAACmC,GAAG,CACf5B,KAAK,CAAC6B,IAAI,CAiBArC,CAAC,CAACiC,YAAY,CAACT,GAAG,CAAC,CAAC,EAC7BR,GAAG,IAAKD,mBAAmB,CAACC,GAAG,EAAEmB,KAAK,CAAC,CACzC;AACH,CAAC,CACF;AAED;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAME,IAAI,GACXF,KAAe,IAAK,CAAC,GAAGQ,QAAkB,KAC5CV,YAAY,CAACE,KAAK,EAAEQ,QAAQ,CAAC;AAEjC;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMC,IAAI,GAAO1B,IAAwB,IAC9CjB,MAAM,CAACmC,GAAG,CAAC5B,KAAK,CAACqC,GAAG,CAAC3B,IAAI,CAACF,GAAG,CAAC,EAAEhB,CAAC,CAAC4C,IAAI,CAAC;AAEzC;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAME,OAAO,GAAO5B,IAAwB,IACjDjB,MAAM,CAACmC,GAAG,CAACQ,IAAI,CAAC1B,IAAI,CAAC,EAAG6B,CAAC,IAAKA,CAAC,KAAK,CAAC,CAAC;AAExC;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMC,UAAU,GAAO9B,IAAwB,IACpDjB,MAAM,CAACmC,GAAG,CAACQ,IAAI,CAAC1B,IAAI,CAAC,EAAG6B,CAAC,IAAKA,CAAC,GAAG,CAAC,CAAC;AAEtC;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAME,IAAI,GAAO/B,IAAwB,IAC9CjB,MAAM,CAACiD,GAAG,CAAC,aAAS;EAClB,MAAM5B,KAAK,GAAG,OAAOd,KAAK,CAACqC,GAAG,CAAC3B,IAAI,CAACF,GAAG,CAAC;EACxC,MAAMmC,IAAI,GAAGnD,CAAC,CAACmD,IAAI,CAAC7B,KAAK,CAAC;EAC1B,IAAIjB,CAAC,CAAC+C,MAAM,CAACD,IAAI,CAAC,EAAE;IAClB,OAAO,OAAOlD,MAAM,CAACoD,gBAAgB;EACvC;EACA,OAAOF,IAAI,CAAC5B,KAAK;AACnB,CAAC,CAAC;AAEJ;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAM+B,UAAU,GAAOpC,IAAwB,IACpDjB,MAAM,CAACmC,GAAG,CAAC5B,KAAK,CAACqC,GAAG,CAAC3B,IAAI,CAACF,GAAG,CAAC,EAAEhB,CAAC,CAACmD,IAAI,CAAC;AAEzC;;;;;;;;;;;;;;;;;;;AAmBA,OAAO,MAAMI,KAAK,gBAyCdrD,IAAI,CACN,CAAC,EACD,CAAIgB,IAAwB,EAAEK,KAAQ,KACpCf,KAAK,CAACgD,MAAM,CAACtC,IAAI,CAACF,GAAG,EAAGM,KAAK,IAAKD,YAAY,CAACC,KAAK,EAAEC,KAAK,EAAEL,IAAI,CAACD,GAAG,CAAC,CAAC,CAC1E;AAED;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAMwC,QAAQ,gBAuCjBvD,IAAI,CACN,CAAC,EACD,CAAIgB,IAAwB,EAAEwC,MAAmB,KAC/ClD,KAAK,CAACgD,MAAM,CAACtC,IAAI,CAACF,GAAG,EAAGM,KAAK,IAAI;EAC/B,MAAME,GAAG,GAAG,CAAC,GAAGxB,CAAC,CAACyB,OAAO,CAACH,KAAK,CAAC,EAAE,GAAGoC,MAAM,CAAC,CAAClB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKxB,IAAI,CAACD,GAAG,CAACwB,CAAC,EAAEC,CAAC,CAAC,CAAC;EAC3E,OAAO1C,CAAC,CAACiC,YAAY,CAACT,GAAG,CAAC;AAC5B,CAAC,CAAC,CACL;AAED;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMmC,IAAI,GAAOzC,IAAwB,IAC9CjB,MAAM,CAACiD,GAAG,CAAC,aAAS;EAClB,MAAM5B,KAAK,GAAG,OAAOd,KAAK,CAACqC,GAAG,CAAC3B,IAAI,CAACF,GAAG,CAAC;EACxC,MAAMmC,IAAI,GAAGnD,CAAC,CAACmD,IAAI,CAAC7B,KAAK,CAAC;EAC1B,IAAIjB,CAAC,CAAC+C,MAAM,CAACD,IAAI,CAAC,EAAE;IAClB,OAAO,OAAOlD,MAAM,CAACoD,gBAAgB;EACvC;EACA,OAAO7C,KAAK,CAACoD,GAAG,CAAC1C,IAAI,CAACF,GAAG,EAAEhB,CAAC,CAAC6D,IAAI,CAACvC,KAAK,EAAE,CAAC,CAAC,CAAC;EAC5C,OAAO6B,IAAI,CAAC5B,KAAK;AACnB,CAAC,CAAC;AAEJ;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMuC,OAAO,GAAO5C,IAAwB,IACjDjB,MAAM,CAACmC,GAAG,CACR5B,KAAK,CAACuD,MAAM,CAAC7C,IAAI,CAACF,GAAG,EAAGM,KAAK,IAAK,CAACA,KAAK,EAAEtB,CAAC,CAACkC,KAAK,EAAE,CAAC,CAAC,EACrDlC,CAAC,CAACyB,OAAO,CACV;AAEH;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMuC,UAAU,GAAO9C,IAAwB,IACpDV,KAAK,CAACuD,MAAM,CAAC7C,IAAI,CAACF,GAAG,EAAGM,KAAK,IAAI;EAC/B,MAAM6B,IAAI,GAAGnD,CAAC,CAACmD,IAAI,CAAC7B,KAAK,CAAC;EAC1B,IAAIjB,CAAC,CAAC+C,MAAM,CAACD,IAAI,CAAC,EAAE;IAClB,OAAO,CAAC9C,CAAC,CAAC4D,IAAI,EAAK,EAAE3C,KAAK,CAAC;EAC7B;EACA,OAAO,CAACjB,CAAC,CAAC6D,IAAI,CAACf,IAAI,CAAC5B,KAAK,CAAC,EAAEvB,CAAC,CAAC6D,IAAI,CAACvC,KAAK,EAAE,CAAC,CAAC,CAAC;AAC/C,CAAC,CAAC;AAEJ;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAM6C,QAAQ,gBAqCjBjE,IAAI,CACN,CAAC,EACD,CAAIgB,IAAwB,EAAE6B,CAAS,KACrC9C,MAAM,CAACmC,GAAG,CACR5B,KAAK,CAACuD,MAAM,CAAC7C,IAAI,CAACF,GAAG,EAAGM,KAAK,IAAI;EAC/B,MAAM8C,KAAK,GAAGpE,CAAC,CAAC2D,IAAI,CAACrC,KAAK,EAAEyB,CAAC,CAAC;EAC9B,MAAMsB,IAAI,GAAGrE,CAAC,CAAC6D,IAAI,CAACvC,KAAK,EAAEyB,CAAC,CAAC;EAC7B,OAAO,CAACqB,KAAK,EAAEC,IAAI,CAAC;AACtB,CAAC,CAAC,EACFrE,CAAC,CAACyB,OAAO,CACV,CACJ;AAED;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAM6C,QAAQ,gBAuCjBpE,IAAI,CACN,CAAC,EACD,CAAIgB,IAAwB,EAAEqD,SAAuB,KACnD/D,KAAK,CAACgD,MAAM,CAACtC,IAAI,CAACF,GAAG,EAAGM,KAAK,IAAKtB,CAAC,CAACwE,MAAM,CAAClD,KAAK,EAAGmB,CAAC,IAAK,CAAC8B,SAAS,CAAC9B,CAAC,CAAC,CAAC,CAAC,CAC3E;AAED;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAMgC,QAAQ,gBAuCjBvE,IAAI,CACN,CAAC,EACD,CAAIgB,IAAwB,EAAEqD,SAAuB,KACnD/D,KAAK,CAACgD,MAAM,CAACtC,IAAI,CAACF,GAAG,EAAGM,KAAK,IAAKtB,CAAC,CAACwE,MAAM,CAAClD,KAAK,EAAEiD,SAAS,CAAC,CAAC,CAChE;AAED;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAM9C,OAAO,GAAOP,IAAwB,IACjDjB,MAAM,CAACmC,GAAG,CAAC5B,KAAK,CAACqC,GAAG,CAAC3B,IAAI,CAACF,GAAG,CAAC,EAAEhB,CAAC,CAACyB,OAAO,CAAC;AAE5C;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMiD,iBAAiB,GAAIC,CAAU,IAAoCpE,WAAW,CAACoE,CAAC,EAAElE,MAAM,CAAC","ignoreList":[]}