@sundaeswap/math 0.3.0 → 0.5.0

package/dist/cjs/PoolMath/ConstantSumPool.js

@@ -3,10 +3,16 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.pinnedDepositFromAnchor = exports.getSwapOutput = exports.getSwapInput = exports.calculatePinnedDeposit = exports.calculateLiquidity = exports.calculateDepositN = void 0;
+exports.pinnedDepositFromAnchor = exports.getSwapOutput = exports.getSwapInput = exports.calculateZap = exports.calculatePinnedDeposit = exports.calculateLiquidity = exports.calculateDepositN = void 0;
 var _asset = require("@sundaeswap/asset");
 var _fraction = require("@sundaeswap/fraction");
 var _index = require("./index.js");
+function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
+function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 /**
  * Holds the calculated outcome of a constant-sum swap. Mirrors
  * {@link ConstantProductPool.TSwapOutcome} so both can flow through the same
@@ -281,4 +287,103 @@ var calculateDepositN = exports.calculateDepositN = function calculateDepositN(a
     shareAfterDeposit: _index.SharedPoolMath.getShare(generatedLp, nextTotalLp)
   };
 };
+
+/**
+ * Outcome of {@link calculateZap}. Every array is aligned to `offered`.
+ */
+
+/**
+ * A zap on a 2-asset constant-sum pool: a non-proportional `offered` basket
+ * is rebalanced by swapping part of the over-weighted asset, then deposited
+ * under the target-pinned rule ({@link calculatePinnedDeposit}). The swap
+ * amount `dx` is the one that leaves the post-swap basket proportional to
+ * the post-swap reserves, so the pin consumes the whole basket up to
+ * rounding. With `k = (1−fee)·p_X/p_Y`,
+ *
+ *   (a_X − dx)/(r_X + dx) = (a_Y + k·dx)/(r_Y − k·dx)
+ *   ⇒ dx = (a_X·r_Y − a_Y·r_X) / (k·(r_X + a_X) + (r_Y + a_Y))
+ *
+ * (the dx² terms cancel). `dx` is floored and the swap leg follows
+ * {@link getSwapOutput}; whatever imbalance rounding leaves comes back as
+ * `change`.
+ *
+ * `fee` is the pool's fee for the swap direction — v4 splits bid and ask, so
+ * the caller picks. Two assets only: with more, which assets to swap is an
+ * allocation problem this formula does not address.
+ */
+var calculateZap = exports.calculateZap = function calculateZap(offered, reserves, prices, totalLp, fee) {
+  if (offered.length !== 2 || reserves.length !== 2 || prices.length !== 2) throw new Error("calculateZap supports exactly two assets");
+  if (prices.some(function (p) {
+    return p <= 0n;
+  })) throw new Error("Prices must be positive");
+  if (reserves.some(function (r) {
+    return r <= 0n;
+  })) throw new Error("Reserves must be positive");
+  if (offered.some(function (a) {
+    return a < 0n;
+  }) || offered.every(function (a) {
+    return a === 0n;
+  })) throw new Error("Offered amounts must be non-negative, with at least one positive");
+  if (totalLp <= 0n) throw new Error("Not enough pool liquidity");
+  var feeFraction = _fraction.Fraction.asFraction(fee);
+  if (feeFraction.lt(_fraction.Fraction.ZERO) || feeFraction.gte(_fraction.Fraction.ONE)) throw new Error("fee must be [0,1)");
+  var feeNum = BigInt(feeFraction.numerator);
+  var feeDen = BigInt(feeFraction.denominator);
+
+  // Over-weighted side: compare a_0/r_0 against a_1/r_1 without division.
+  var lhs = offered[0] * reserves[1];
+  var rhs = offered[1] * reserves[0];
+  var swapIndex = lhs > rhs ? 0 : lhs < rhs ? 1 : undefined;
+  var swapInput = 0n;
+  var swapOutput = 0n;
+  var nextReserves = _toConsumableArray(reserves);
+  var depositBasket = _toConsumableArray(offered);
+  if (swapIndex !== undefined) {
+    var x = swapIndex;
+    var y = 1 - swapIndex;
+    var _ref = [offered[x], offered[y]],
+      aX = _ref[0],
+      aY = _ref[1];
+    var _ref2 = [reserves[x], reserves[y]],
+      rX = _ref2[0],
+      rY = _ref2[1];
+    var _ref3 = [prices[x], prices[y]],
+      pX = _ref3[0],
+      pY = _ref3[1];
+
+    // dx with k = (feeDen−feeNum)·pX / (feeDen·pY), cleared of denominators.
+    var numerator = (aX * rY - aY * rX) * feeDen * pY;
+    var denominator = (feeDen - feeNum) * pX * (rX + aX) + feeDen * pY * (rY + aY);
+    swapInput = numerator / denominator;
+    if (swapInput > 0n) {
+      var inputValue = swapInput * pX;
+      var feeValue = inputValue * feeNum / feeDen;
+      swapOutput = (inputValue - feeValue) / pY;
+      if (swapOutput >= rY) throw new Error("Pool too shallow: the rebalancing swap would drain it");
+      nextReserves[x] = rX + swapInput;
+      nextReserves[y] = rY - swapOutput;
+      depositBasket[x] = aX - swapInput;
+      depositBasket[y] = aY + swapOutput;
+    }
+  }
+  if (depositBasket.some(function (a) {
+    return a <= 0n;
+  })) throw new Error("Offered amount too small to zap into this pool");
+  var pinned = calculatePinnedDeposit(depositBasket, nextReserves, prices, totalLp);
+  return {
+    swapIndex: swapIndex,
+    swapInput: swapInput,
+    swapOutput: swapOutput,
+    nextReserves: nextReserves,
+    depositBasket: depositBasket,
+    deltas: pinned.deltas,
+    change: depositBasket.map(function (a, i) {
+      return a - pinned.deltas[i];
+    }),
+    targetDeltaV: pinned.targetDeltaV,
+    generatedLp: pinned.generatedLp,
+    nextTotalLp: pinned.nextTotalLp,
+    shareAfterDeposit: pinned.shareAfterDeposit
+  };
+};
 //# sourceMappingURL=ConstantSumPool.js.map

package/dist/cjs/PoolMath/ConstantSumPool.js.map

@@ -1 +1 @@
-{"version":3,"file":"ConstantSumPool.js","names":["_asset","require","_fraction","_index","getSwapOutput","exports","inputMetadata","input","inputReserve","outputReserve","priceIn","priceOut","fee","roundOutputUp","Error","feeFraction","Fraction","asFraction","lt","ZERO","gt","ONE","inputValue","feeValue","BigInt","numerator","denominator","quotient","outputValue","output","inputLpFee","nextInputReserve","nextOutputReserve","priceImpact","amountInLessFee","idealPrice","actualPrice","subtract","divide","lpFee","AssetAmount","getSwapInput","gte","feeNum","feeDen","feeDiff","targetValue","calculateLiquidity","a","b","aReserve","bReserve","totalLp","priceA","priceB","_calculatePinnedDepos","calculatePinnedDeposit","deltas","generatedLp","nextTotalLp","shareAfterDeposit","aChange","bChange","actualDepositedA","actualDepositedB","offered","reserves","prices","length","some","p","vB","i","t","cap","undefined","map","r","targetDeltaV","SharedPoolMath","getShare","pinnedDepositFromAnchor","anchorIndex","anchorAmount","calculateDepositN","amounts","every","totalValue","depositValue"],"sources":["../../../src/PoolMath/ConstantSumPool.ts"],"sourcesContent":["import { AssetAmount, IAssetAmountMetadata } from \"@sundaeswap/asset\";\nimport { Fraction, type TFractionLike } from \"@sundaeswap/fraction\";\nimport { SharedPoolMath } from \"./index.js\";\n\n/**\n * Holds the calculated outcome of a constant-sum swap. Mirrors\n * {@link ConstantProductPool.TSwapOutcome} so both can flow through the same\n * generic swap-outcome consumers.\n */\nexport type TSwapOutcome = {\n  input: bigint;\n  output: bigint;\n  lpFee: AssetAmount<IAssetAmountMetadata>;\n  nextInputReserve: bigint;\n  nextOutputReserve: bigint;\n  priceImpact: Fraction;\n};\n\n/**\n * Calculate the swap outcome for a constant-sum (fixed-price) pool — the\n * invariant used by Sundae v4 stable/pegged pools. Unlike constant product,\n * the exchange rate is fixed by the pool's per-asset `prices`: the input is\n * converted to \"value\" at `priceIn`, the fee is taken off that value, and the\n * remainder is converted to the output asset at `priceOut`. The result is\n * capped at the output reserve (you can't take more than the pool holds).\n *\n * Matches the scooper's `cs_swap_result`:\n *   output = floor((input·priceIn − floor(input·priceIn·fee)) / priceOut)\n *\n * @param inputMetadata Metadata for the supplied (input) asset — used for the fee AssetAmount.\n * @param input The amount of the input asset being swapped.\n * @param inputReserve The pool's reserve of the input asset.\n * @param outputReserve The pool's reserve of the output asset.\n * @param priceIn The pool's price for the input asset (from the constant-sum config).\n * @param priceOut The pool's price for the output asset.\n * @param fee The liquidity-provider fee (plus protocol fee) as a fraction.\n * @param roundOutputUp When true, round the output up instead of flooring.\n * @returns The swap details in the shared {@link TSwapOutcome} shape.\n */\nexport const getSwapOutput = (\n  inputMetadata: IAssetAmountMetadata,\n  input: bigint,\n  inputReserve: bigint,\n  outputReserve: bigint,\n  priceIn: bigint,\n  priceOut: bigint,\n  fee: TFractionLike,\n  roundOutputUp?: boolean,\n): TSwapOutcome => {\n  if (input <= 0n || inputReserve <= 0n || outputReserve <= 0n)\n    throw new Error(\"Input and reserves must be positive\");\n  if (priceIn <= 0n || priceOut <= 0n)\n    throw new Error(\"Prices must be positive\");\n\n  const feeFraction = Fraction.asFraction(fee);\n  if (feeFraction.lt(Fraction.ZERO) || feeFraction.gt(Fraction.ONE))\n    throw new Error(\"fee must be between 0 and 1\");\n\n  const inputValue = input * priceIn;\n  const feeValue = new Fraction(\n    inputValue * BigInt(feeFraction.numerator),\n    BigInt(feeFraction.denominator),\n  ).quotient;\n  const outputValue = inputValue - feeValue;\n\n  let output = roundOutputUp\n    ? (outputValue + priceOut - 1n) / priceOut\n    : outputValue / priceOut;\n\n  // Can't take more than the pool holds.\n  if (output > outputReserve) {\n    output = outputReserve;\n  }\n\n  // LP fee expressed in input-asset units (value scales linearly with input,\n  // so the input-denominated fee is input·feeRate) — matching ConstantProductPool.\n  const inputLpFee = new Fraction(\n    input * BigInt(feeFraction.numerator),\n    BigInt(feeFraction.denominator),\n  ).quotient;\n\n  const nextInputReserve = inputReserve + input;\n  const nextOutputReserve = outputReserve - output;\n\n  // Price impact vs the pool's par price (priceOut/priceIn input-per-output);\n  // ~0 for a constant-sum pool aside from the fee. See ConstantProductPool.\n  let priceImpact = Fraction.ZERO;\n  if (output > 0n) {\n    const amountInLessFee = input - inputLpFee;\n    const idealPrice = new Fraction(priceOut, priceIn);\n    const actualPrice = new Fraction(amountInLessFee, output);\n    priceImpact = Fraction.ONE.subtract(idealPrice.divide(actualPrice));\n  }\n\n  return {\n    input,\n    output,\n    lpFee: new AssetAmount(inputLpFee, inputMetadata),\n    nextInputReserve,\n    nextOutputReserve,\n    priceImpact,\n  };\n};\n\n/**\n * Calculate the minimal input required to receive a given output from a\n * constant-sum pool — the exact inverse of {@link getSwapOutput}.\n *\n * The forward math floors the fee off the input value, which makes the\n * post-fee value `ceil(input·priceIn·(1−fee))`; inverting that ceiling gives\n * the smallest input whose forward swap yields at least `output`.\n *\n * Unlike constant product there is no asymptote, so an output equal to the\n * full output reserve is attainable (the pool can be drained at par).\n *\n * @param inputMetadata Metadata for the supplied (input) asset — used for the fee AssetAmount.\n * @param output The desired amount of the output asset.\n * @param inputReserve The pool's reserve of the input asset.\n * @param outputReserve The pool's reserve of the output asset.\n * @param priceIn The pool's price for the input asset (from the constant-sum config).\n * @param priceOut The pool's price for the output asset.\n * @param fee The liquidity-provider fee (plus protocol fee) as a fraction.\n * @returns The swap details in the shared {@link TSwapOutcome} shape.\n */\nexport const getSwapInput = (\n  inputMetadata: IAssetAmountMetadata,\n  output: bigint,\n  inputReserve: bigint,\n  outputReserve: bigint,\n  priceIn: bigint,\n  priceOut: bigint,\n  fee: TFractionLike,\n): TSwapOutcome => {\n  if (output <= 0n || inputReserve <= 0n || outputReserve <= 0n)\n    throw new Error(\"Output and reserves must be positive\");\n  if (priceIn <= 0n || priceOut <= 0n)\n    throw new Error(\"Prices must be positive\");\n  if (output > outputReserve)\n    throw new Error(\"Output must not exceed the output reserve\");\n\n  const feeFraction = Fraction.asFraction(fee);\n  if (feeFraction.lt(Fraction.ZERO) || feeFraction.gte(Fraction.ONE))\n    throw new Error(\"fee must be [0,1)\");\n\n  const feeNum = BigInt(feeFraction.numerator);\n  const feeDen = BigInt(feeFraction.denominator);\n  const feeDiff = feeDen - feeNum;\n\n  // Forward: outputValue = ceil(input·priceIn·feeDiff/feeDen), and the swap\n  // yields ≥ output iff outputValue ≥ output·priceOut. ceil(x/d) ≥ T for\n  // integer x iff x ≥ d·(T−1)+1, so the minimal input is the ceiling of\n  // (feeDen·(output·priceOut − 1) + 1) / (feeDiff·priceIn).\n  const targetValue = output * priceOut;\n  const numerator = feeDen * (targetValue - 1n) + 1n;\n  const denominator = feeDiff * priceIn;\n  const input = (numerator + denominator - 1n) / denominator;\n\n  const inputLpFee = new Fraction(input * feeNum, feeDen).quotient;\n  const nextInputReserve = inputReserve + input;\n  const nextOutputReserve = outputReserve - output;\n\n  // Same par-price impact definition as getSwapOutput.\n  const amountInLessFee = input - inputLpFee;\n  const idealPrice = new Fraction(priceOut, priceIn);\n  const actualPrice = new Fraction(amountInLessFee, output);\n  const priceImpact = Fraction.ONE.subtract(idealPrice.divide(actualPrice));\n\n  return {\n    input,\n    output,\n    lpFee: new AssetAmount(inputLpFee, inputMetadata),\n    nextInputReserve,\n    nextOutputReserve,\n    priceImpact,\n  };\n};\n\n/**\n * Calculate the deposit parameters for a 2-asset constant-sum pool via the\n * TARGET-PINNED rule the deployed validator enforces (see\n * {@link calculatePinnedDeposit}): the mint is capped by the scarcest offered\n * asset, both assets must be offered, and anything above the pinned deltas is\n * refunded via aChange/bChange.\n *\n * @param {bigint} a - The amount of token A to deposit.\n * @param {bigint} b - The amount of token B to deposit.\n * @param {bigint} aReserve - The current reserve of token A in the pool.\n * @param {bigint} bReserve - The current reserve of token B in the pool.\n * @param {bigint} totalLp - The total lp tokens for the pool before the deposit.\n * @param {bigint} priceA - The pool's price for token A (from the constant-sum config).\n * @param {bigint} priceB - The pool's price for token B.\n * @throws {Error} If the pool has no value or minted lp.\n * @throws {Error} If both deposit amounts are zero, or either is negative.\n * @throws {Error} If either price is non-positive.\n */\nexport const calculateLiquidity = (\n  a: bigint,\n  b: bigint,\n  aReserve: bigint,\n  bReserve: bigint,\n  totalLp: bigint,\n  priceA: bigint,\n  priceB: bigint,\n) => {\n  // Target-pinned (what the deployed validator accepts): mint by the\n  // scarcest offered asset; anything above the pinned deltas is refunded\n  // (aChange/bChange).\n  const { deltas, generatedLp, nextTotalLp, shareAfterDeposit } =\n    calculatePinnedDeposit(\n      [a, b],\n      [aReserve, bReserve],\n      [priceA, priceB],\n      totalLp,\n    );\n\n  return {\n    nextTotalLp,\n    generatedLp,\n    shareAfterDeposit,\n    aChange: a - deltas[0],\n    bChange: b - deltas[1],\n    actualDepositedA: deltas[0],\n    actualDepositedB: deltas[1],\n  };\n};\n\n/**\n * The N-asset form of {@link calculateLiquidity}, mirroring the v4 contract's\n * `compute_deposit_n` exactly: a deposit of any mix of the pool's assets is\n * valued at the fixed prices against the value of ALL reserves —\n *\n *   generatedLp = Σ(amount_i·price_i) · totalLp / Σ(reserve_i·price_i)\n *\n * The three arrays must be aligned to the pool's canonical asset order (the\n * API's `assets`/`quantities`/`prices`). Estimating an N-asset pool's deposit\n * from just two of its reserves overstates the minted LP — the denominator is\n * the whole pool's value — which is exactly the mistake this exists to\n * prevent.\n */\n/**\n * The target-pinned deposit — what the deployed CS validator (cs_check tag 6)\n * actually accepts, and what the scooper builds. Asymmetric deposits are\n * disallowed on-chain: the fill declares a value delta `t` and every asset's\n * contribution is ceil-pinned to `ceil(r_i·t/V_b)`, with total LP\n * floor-pinned to `floor(lp_b·(V_b+t)/V_b)`. Given what the user offers, the\n * largest fillable t is capped by the SCARCEST asset —\n * `t = min_i floor(offered_i·V_b/r_i)` — and anything above the pinned\n * deltas is returned as surplus. Every pool asset must be offered (> 0) or\n * t is zero and the deposit can never fill.\n *\n * Contrast with `calculateDepositN`, which is the plain value formula:\n * it matches the pin only for exactly proportional offers and OVERSTATES the\n * mint otherwise — using it for `minReceived` makes non-proportional orders\n * unfillable.\n */\nexport const calculatePinnedDeposit = (\n  offered: bigint[],\n  reserves: bigint[],\n  prices: bigint[],\n  totalLp: bigint,\n): {\n  targetDeltaV: bigint;\n  deltas: bigint[];\n  generatedLp: bigint;\n  nextTotalLp: bigint;\n  shareAfterDeposit: Fraction;\n} => {\n  if (offered.length !== reserves.length || reserves.length !== prices.length)\n    throw new Error(\"offered, reserves and prices must be aligned\");\n  if (prices.some((p) => p <= 0n)) throw new Error(\"Prices must be positive\");\n  if (totalLp <= 0n) throw new Error(\"Not enough pool liquidity\");\n\n  let vB = 0n;\n  for (let i = 0; i < reserves.length; i++) {\n    vB += reserves[i] * prices[i];\n  }\n  if (vB <= 0n) throw new Error(\"Pool value is zero\");\n\n  let t: bigint | undefined;\n  for (let i = 0; i < offered.length; i++) {\n    if (reserves[i] === 0n) continue;\n    const cap = (offered[i] * vB) / reserves[i];\n    t = t === undefined || cap < t ? cap : t;\n  }\n  if (t === undefined || t <= 0n) {\n    throw new Error(\n      \"A constant-sum deposit must offer every pool asset in proportion (asymmetric deposits are disallowed on-chain)\",\n    );\n  }\n\n  const deltas = reserves.map((r) => (r * t! + vB - 1n) / vB); // ceil\n  const nextTotalLp = (totalLp * (vB + t)) / vB; // floor\n  const generatedLp = nextTotalLp - totalLp;\n  if (generatedLp <= 0n) throw new Error(\"Deposit mints zero LP\");\n\n  return {\n    targetDeltaV: t,\n    deltas,\n    generatedLp,\n    nextTotalLp,\n    shareAfterDeposit: SharedPoolMath.getShare(generatedLp, nextTotalLp),\n  };\n};\n\n/**\n * The per-asset amounts a pinned deposit needs when the user anchors on one\n * asset's amount: t from the anchor (`floor(anchor·V_b/r_anchor)`), every\n * delta ceil-pinned to it. Drives proportional auto-fill in deposit forms.\n */\nexport const pinnedDepositFromAnchor = (\n  anchorIndex: number,\n  anchorAmount: bigint,\n  reserves: bigint[],\n  prices: bigint[],\n): bigint[] => {\n  if (reserves.length !== prices.length)\n    throw new Error(\"reserves and prices must be aligned\");\n  if (\n    anchorIndex < 0 ||\n    anchorIndex >= reserves.length ||\n    reserves[anchorIndex] <= 0n\n  )\n    throw new Error(\"anchor asset has no reserve\");\n  if (anchorAmount <= 0n) return reserves.map(() => 0n);\n\n  let vB = 0n;\n  for (let i = 0; i < reserves.length; i++) {\n    vB += reserves[i] * prices[i];\n  }\n  if (vB <= 0n) throw new Error(\"Pool value is zero\");\n\n  const t = (anchorAmount * vB) / reserves[anchorIndex];\n  return reserves.map((r, i) =>\n    i === anchorIndex ? anchorAmount : (r * t + vB - 1n) / vB,\n  );\n};\n\nexport const calculateDepositN = (\n  amounts: bigint[],\n  reserves: bigint[],\n  prices: bigint[],\n  totalLp: bigint,\n) => {\n  if (amounts.length !== reserves.length || reserves.length !== prices.length)\n    throw new Error(\"amounts, reserves and prices must be aligned\");\n  if (prices.some((p) => p <= 0n)) throw new Error(\"Prices must be positive\");\n  // Zeros in a MIX are fine — offering a subset is the point of the N-asset\n  // form. What's rejected is a negative amount, or offering nothing at all.\n  if (amounts.some((a) => a < 0n) || amounts.every((a) => a === 0n))\n    throw new Error(\n      \"Deposit amounts must be non-negative, with at least one positive\",\n    );\n\n  let totalValue = 0n;\n  let depositValue = 0n;\n  for (let i = 0; i < amounts.length; i++) {\n    totalValue += reserves[i] * prices[i];\n    depositValue += amounts[i] * prices[i];\n  }\n  if (totalValue <= 0n || totalLp <= 0n)\n    throw new Error(\"Not enough pool liquidity\");\n\n  const generatedLp = (depositValue * totalLp) / totalValue;\n  const nextTotalLp = totalLp + generatedLp;\n\n  return {\n    nextTotalLp,\n    generatedLp,\n    shareAfterDeposit: SharedPoolMath.getShare(generatedLp, nextTotalLp),\n  };\n};\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AACA,IAAAC,SAAA,GAAAD,OAAA;AACA,IAAAE,MAAA,GAAAF,OAAA;AAEA;AACA;AACA;AACA;AACA;;AAUA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMG,aAAa,GAAAC,OAAA,CAAAD,aAAA,GAAG,SAAhBA,aAAaA,CACxBE,aAAmC,EACnCC,KAAa,EACbC,YAAoB,EACpBC,aAAqB,EACrBC,OAAe,EACfC,QAAgB,EAChBC,GAAkB,EAClBC,aAAuB,EACN;EACjB,IAAIN,KAAK,IAAI,EAAE,IAAIC,YAAY,IAAI,EAAE,IAAIC,aAAa,IAAI,EAAE,EAC1D,MAAM,IAAIK,KAAK,CAAC,qCAAqC,CAAC;EACxD,IAAIJ,OAAO,IAAI,EAAE,IAAIC,QAAQ,IAAI,EAAE,EACjC,MAAM,IAAIG,KAAK,CAAC,yBAAyB,CAAC;EAE5C,IAAMC,WAAW,GAAGC,kBAAQ,CAACC,UAAU,CAACL,GAAG,CAAC;EAC5C,IAAIG,WAAW,CAACG,EAAE,CAACF,kBAAQ,CAACG,IAAI,CAAC,IAAIJ,WAAW,CAACK,EAAE,CAACJ,kBAAQ,CAACK,GAAG,CAAC,EAC/D,MAAM,IAAIP,KAAK,CAAC,6BAA6B,CAAC;EAEhD,IAAMQ,UAAU,GAAGf,KAAK,GAAGG,OAAO;EAClC,IAAMa,QAAQ,GAAG,IAAIP,kBAAQ,CAC3BM,UAAU,GAAGE,MAAM,CAACT,WAAW,CAACU,SAAS,CAAC,EAC1CD,MAAM,CAACT,WAAW,CAACW,WAAW,CAChC,CAAC,CAACC,QAAQ;EACV,IAAMC,WAAW,GAAGN,UAAU,GAAGC,QAAQ;EAEzC,IAAIM,MAAM,GAAGhB,aAAa,GACtB,CAACe,WAAW,GAAGjB,QAAQ,GAAG,EAAE,IAAIA,QAAQ,GACxCiB,WAAW,GAAGjB,QAAQ;;EAE1B;EACA,IAAIkB,MAAM,GAAGpB,aAAa,EAAE;IAC1BoB,MAAM,GAAGpB,aAAa;EACxB;;EAEA;EACA;EACA,IAAMqB,UAAU,GAAG,IAAId,kBAAQ,CAC7BT,KAAK,GAAGiB,MAAM,CAACT,WAAW,CAACU,SAAS,CAAC,EACrCD,MAAM,CAACT,WAAW,CAACW,WAAW,CAChC,CAAC,CAACC,QAAQ;EAEV,IAAMI,gBAAgB,GAAGvB,YAAY,GAAGD,KAAK;EAC7C,IAAMyB,iBAAiB,GAAGvB,aAAa,GAAGoB,MAAM;;EAEhD;EACA;EACA,IAAII,WAAW,GAAGjB,kBAAQ,CAACG,IAAI;EAC/B,IAAIU,MAAM,GAAG,EAAE,EAAE;IACf,IAAMK,eAAe,GAAG3B,KAAK,GAAGuB,UAAU;IAC1C,IAAMK,UAAU,GAAG,IAAInB,kBAAQ,CAACL,QAAQ,EAAED,OAAO,CAAC;IAClD,IAAM0B,WAAW,GAAG,IAAIpB,kBAAQ,CAACkB,eAAe,EAAEL,MAAM,CAAC;IACzDI,WAAW,GAAGjB,kBAAQ,CAACK,GAAG,CAACgB,QAAQ,CAACF,UAAU,CAACG,MAAM,CAACF,WAAW,CAAC,CAAC;EACrE;EAEA,OAAO;IACL7B,KAAK,EAALA,KAAK;IACLsB,MAAM,EAANA,MAAM;IACNU,KAAK,EAAE,IAAIC,kBAAW,CAACV,UAAU,EAAExB,aAAa,CAAC;IACjDyB,gBAAgB,EAAhBA,gBAAgB;IAChBC,iBAAiB,EAAjBA,iBAAiB;IACjBC,WAAW,EAAXA;EACF,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMQ,YAAY,GAAApC,OAAA,CAAAoC,YAAA,GAAG,SAAfA,YAAYA,CACvBnC,aAAmC,EACnCuB,MAAc,EACdrB,YAAoB,EACpBC,aAAqB,EACrBC,OAAe,EACfC,QAAgB,EAChBC,GAAkB,EACD;EACjB,IAAIiB,MAAM,IAAI,EAAE,IAAIrB,YAAY,IAAI,EAAE,IAAIC,aAAa,IAAI,EAAE,EAC3D,MAAM,IAAIK,KAAK,CAAC,sCAAsC,CAAC;EACzD,IAAIJ,OAAO,IAAI,EAAE,IAAIC,QAAQ,IAAI,EAAE,EACjC,MAAM,IAAIG,KAAK,CAAC,yBAAyB,CAAC;EAC5C,IAAIe,MAAM,GAAGpB,aAAa,EACxB,MAAM,IAAIK,KAAK,CAAC,2CAA2C,CAAC;EAE9D,IAAMC,WAAW,GAAGC,kBAAQ,CAACC,UAAU,CAACL,GAAG,CAAC;EAC5C,IAAIG,WAAW,CAACG,EAAE,CAACF,kBAAQ,CAACG,IAAI,CAAC,IAAIJ,WAAW,CAAC2B,GAAG,CAAC1B,kBAAQ,CAACK,GAAG,CAAC,EAChE,MAAM,IAAIP,KAAK,CAAC,mBAAmB,CAAC;EAEtC,IAAM6B,MAAM,GAAGnB,MAAM,CAACT,WAAW,CAACU,SAAS,CAAC;EAC5C,IAAMmB,MAAM,GAAGpB,MAAM,CAACT,WAAW,CAACW,WAAW,CAAC;EAC9C,IAAMmB,OAAO,GAAGD,MAAM,GAAGD,MAAM;;EAE/B;EACA;EACA;EACA;EACA,IAAMG,WAAW,GAAGjB,MAAM,GAAGlB,QAAQ;EACrC,IAAMc,SAAS,GAAGmB,MAAM,IAAIE,WAAW,GAAG,EAAE,CAAC,GAAG,EAAE;EAClD,IAAMpB,WAAW,GAAGmB,OAAO,GAAGnC,OAAO;EACrC,IAAMH,KAAK,GAAG,CAACkB,SAAS,GAAGC,WAAW,GAAG,EAAE,IAAIA,WAAW;EAE1D,IAAMI,UAAU,GAAG,IAAId,kBAAQ,CAACT,KAAK,GAAGoC,MAAM,EAAEC,MAAM,CAAC,CAACjB,QAAQ;EAChE,IAAMI,gBAAgB,GAAGvB,YAAY,GAAGD,KAAK;EAC7C,IAAMyB,iBAAiB,GAAGvB,aAAa,GAAGoB,MAAM;;EAEhD;EACA,IAAMK,eAAe,GAAG3B,KAAK,GAAGuB,UAAU;EAC1C,IAAMK,UAAU,GAAG,IAAInB,kBAAQ,CAACL,QAAQ,EAAED,OAAO,CAAC;EAClD,IAAM0B,WAAW,GAAG,IAAIpB,kBAAQ,CAACkB,eAAe,EAAEL,MAAM,CAAC;EACzD,IAAMI,WAAW,GAAGjB,kBAAQ,CAACK,GAAG,CAACgB,QAAQ,CAACF,UAAU,CAACG,MAAM,CAACF,WAAW,CAAC,CAAC;EAEzE,OAAO;IACL7B,KAAK,EAALA,KAAK;IACLsB,MAAM,EAANA,MAAM;IACNU,KAAK,EAAE,IAAIC,kBAAW,CAACV,UAAU,EAAExB,aAAa,CAAC;IACjDyB,gBAAgB,EAAhBA,gBAAgB;IAChBC,iBAAiB,EAAjBA,iBAAiB;IACjBC,WAAW,EAAXA;EACF,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMc,kBAAkB,GAAA1C,OAAA,CAAA0C,kBAAA,GAAG,SAArBA,kBAAkBA,CAC7BC,CAAS,EACTC,CAAS,EACTC,QAAgB,EAChBC,QAAgB,EAChBC,OAAe,EACfC,MAAc,EACdC,MAAc,EACX;EACH;EACA;EACA;EACA,IAAAC,qBAAA,GACEC,sBAAsB,CACpB,CAACR,CAAC,EAAEC,CAAC,CAAC,EACN,CAACC,QAAQ,EAAEC,QAAQ,CAAC,EACpB,CAACE,MAAM,EAAEC,MAAM,CAAC,EAChBF,OACF,CAAC;IANKK,MAAM,GAAAF,qBAAA,CAANE,MAAM;IAAEC,WAAW,GAAAH,qBAAA,CAAXG,WAAW;IAAEC,WAAW,GAAAJ,qBAAA,CAAXI,WAAW;IAAEC,iBAAiB,GAAAL,qBAAA,CAAjBK,iBAAiB;EAQ3D,OAAO;IACLD,WAAW,EAAXA,WAAW;IACXD,WAAW,EAAXA,WAAW;IACXE,iBAAiB,EAAjBA,iBAAiB;IACjBC,OAAO,EAAEb,CAAC,GAAGS,MAAM,CAAC,CAAC,CAAC;IACtBK,OAAO,EAAEb,CAAC,GAAGQ,MAAM,CAAC,CAAC,CAAC;IACtBM,gBAAgB,EAAEN,MAAM,CAAC,CAAC,CAAC;IAC3BO,gBAAgB,EAAEP,MAAM,CAAC,CAAC;EAC5B,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMD,sBAAsB,GAAAnD,OAAA,CAAAmD,sBAAA,GAAG,SAAzBA,sBAAsBA,CACjCS,OAAiB,EACjBC,QAAkB,EAClBC,MAAgB,EAChBf,OAAe,EAOZ;EACH,IAAIa,OAAO,CAACG,MAAM,KAAKF,QAAQ,CAACE,MAAM,IAAIF,QAAQ,CAACE,MAAM,KAAKD,MAAM,CAACC,MAAM,EACzE,MAAM,IAAItD,KAAK,CAAC,8CAA8C,CAAC;EACjE,IAAIqD,MAAM,CAACE,IAAI,CAAC,UAACC,CAAC;IAAA,OAAKA,CAAC,IAAI,EAAE;EAAA,EAAC,EAAE,MAAM,IAAIxD,KAAK,CAAC,yBAAyB,CAAC;EAC3E,IAAIsC,OAAO,IAAI,EAAE,EAAE,MAAM,IAAItC,KAAK,CAAC,2BAA2B,CAAC;EAE/D,IAAIyD,EAAE,GAAG,EAAE;EACX,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGN,QAAQ,CAACE,MAAM,EAAEI,CAAC,EAAE,EAAE;IACxCD,EAAE,IAAIL,QAAQ,CAACM,CAAC,CAAC,GAAGL,MAAM,CAACK,CAAC,CAAC;EAC/B;EACA,IAAID,EAAE,IAAI,EAAE,EAAE,MAAM,IAAIzD,KAAK,CAAC,oBAAoB,CAAC;EAEnD,IAAI2D,CAAqB;EACzB,KAAK,IAAID,EAAC,GAAG,CAAC,EAAEA,EAAC,GAAGP,OAAO,CAACG,MAAM,EAAEI,EAAC,EAAE,EAAE;IACvC,IAAIN,QAAQ,CAACM,EAAC,CAAC,KAAK,EAAE,EAAE;IACxB,IAAME,GAAG,GAAIT,OAAO,CAACO,EAAC,CAAC,GAAGD,EAAE,GAAIL,QAAQ,CAACM,EAAC,CAAC;IAC3CC,CAAC,GAAGA,CAAC,KAAKE,SAAS,IAAID,GAAG,GAAGD,CAAC,GAAGC,GAAG,GAAGD,CAAC;EAC1C;EACA,IAAIA,CAAC,KAAKE,SAAS,IAAIF,CAAC,IAAI,EAAE,EAAE;IAC9B,MAAM,IAAI3D,KAAK,CACb,gHACF,CAAC;EACH;EAEA,IAAM2C,MAAM,GAAGS,QAAQ,CAACU,GAAG,CAAC,UAACC,CAAC;IAAA,OAAK,CAACA,CAAC,GAAGJ,CAAE,GAAGF,EAAE,GAAG,EAAE,IAAIA,EAAE;EAAA,EAAC,CAAC,CAAC;EAC7D,IAAMZ,WAAW,GAAIP,OAAO,IAAImB,EAAE,GAAGE,CAAC,CAAC,GAAIF,EAAE,CAAC,CAAC;EAC/C,IAAMb,WAAW,GAAGC,WAAW,GAAGP,OAAO;EACzC,IAAIM,WAAW,IAAI,EAAE,EAAE,MAAM,IAAI5C,KAAK,CAAC,uBAAuB,CAAC;EAE/D,OAAO;IACLgE,YAAY,EAAEL,CAAC;IACfhB,MAAM,EAANA,MAAM;IACNC,WAAW,EAAXA,WAAW;IACXC,WAAW,EAAXA,WAAW;IACXC,iBAAiB,EAAEmB,qBAAc,CAACC,QAAQ,CAACtB,WAAW,EAAEC,WAAW;EACrE,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACO,IAAMsB,uBAAuB,GAAA5E,OAAA,CAAA4E,uBAAA,GAAG,SAA1BA,uBAAuBA,CAClCC,WAAmB,EACnBC,YAAoB,EACpBjB,QAAkB,EAClBC,MAAgB,EACH;EACb,IAAID,QAAQ,CAACE,MAAM,KAAKD,MAAM,CAACC,MAAM,EACnC,MAAM,IAAItD,KAAK,CAAC,qCAAqC,CAAC;EACxD,IACEoE,WAAW,GAAG,CAAC,IACfA,WAAW,IAAIhB,QAAQ,CAACE,MAAM,IAC9BF,QAAQ,CAACgB,WAAW,CAAC,IAAI,EAAE,EAE3B,MAAM,IAAIpE,KAAK,CAAC,6BAA6B,CAAC;EAChD,IAAIqE,YAAY,IAAI,EAAE,EAAE,OAAOjB,QAAQ,CAACU,GAAG,CAAC;IAAA,OAAM,EAAE;EAAA,EAAC;EAErD,IAAIL,EAAE,GAAG,EAAE;EACX,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGN,QAAQ,CAACE,MAAM,EAAEI,CAAC,EAAE,EAAE;IACxCD,EAAE,IAAIL,QAAQ,CAACM,CAAC,CAAC,GAAGL,MAAM,CAACK,CAAC,CAAC;EAC/B;EACA,IAAID,EAAE,IAAI,EAAE,EAAE,MAAM,IAAIzD,KAAK,CAAC,oBAAoB,CAAC;EAEnD,IAAM2D,CAAC,GAAIU,YAAY,GAAGZ,EAAE,GAAIL,QAAQ,CAACgB,WAAW,CAAC;EACrD,OAAOhB,QAAQ,CAACU,GAAG,CAAC,UAACC,CAAC,EAAEL,CAAC;IAAA,OACvBA,CAAC,KAAKU,WAAW,GAAGC,YAAY,GAAG,CAACN,CAAC,GAAGJ,CAAC,GAAGF,EAAE,GAAG,EAAE,IAAIA,EAAE;EAAA,CAC3D,CAAC;AACH,CAAC;AAEM,IAAMa,iBAAiB,GAAA/E,OAAA,CAAA+E,iBAAA,GAAG,SAApBA,iBAAiBA,CAC5BC,OAAiB,EACjBnB,QAAkB,EAClBC,MAAgB,EAChBf,OAAe,EACZ;EACH,IAAIiC,OAAO,CAACjB,MAAM,KAAKF,QAAQ,CAACE,MAAM,IAAIF,QAAQ,CAACE,MAAM,KAAKD,MAAM,CAACC,MAAM,EACzE,MAAM,IAAItD,KAAK,CAAC,8CAA8C,CAAC;EACjE,IAAIqD,MAAM,CAACE,IAAI,CAAC,UAACC,CAAC;IAAA,OAAKA,CAAC,IAAI,EAAE;EAAA,EAAC,EAAE,MAAM,IAAIxD,KAAK,CAAC,yBAAyB,CAAC;EAC3E;EACA;EACA,IAAIuE,OAAO,CAAChB,IAAI,CAAC,UAACrB,CAAC;IAAA,OAAKA,CAAC,GAAG,EAAE;EAAA,EAAC,IAAIqC,OAAO,CAACC,KAAK,CAAC,UAACtC,CAAC;IAAA,OAAKA,CAAC,KAAK,EAAE;EAAA,EAAC,EAC/D,MAAM,IAAIlC,KAAK,CACb,kEACF,CAAC;EAEH,IAAIyE,UAAU,GAAG,EAAE;EACnB,IAAIC,YAAY,GAAG,EAAE;EACrB,KAAK,IAAIhB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGa,OAAO,CAACjB,MAAM,EAAEI,CAAC,EAAE,EAAE;IACvCe,UAAU,IAAIrB,QAAQ,CAACM,CAAC,CAAC,GAAGL,MAAM,CAACK,CAAC,CAAC;IACrCgB,YAAY,IAAIH,OAAO,CAACb,CAAC,CAAC,GAAGL,MAAM,CAACK,CAAC,CAAC;EACxC;EACA,IAAIe,UAAU,IAAI,EAAE,IAAInC,OAAO,IAAI,EAAE,EACnC,MAAM,IAAItC,KAAK,CAAC,2BAA2B,CAAC;EAE9C,IAAM4C,WAAW,GAAI8B,YAAY,GAAGpC,OAAO,GAAImC,UAAU;EACzD,IAAM5B,WAAW,GAAGP,OAAO,GAAGM,WAAW;EAEzC,OAAO;IACLC,WAAW,EAAXA,WAAW;IACXD,WAAW,EAAXA,WAAW;IACXE,iBAAiB,EAAEmB,qBAAc,CAACC,QAAQ,CAACtB,WAAW,EAAEC,WAAW;EACrE,CAAC;AACH,CAAC","ignoreList":[]}
+{"version":3,"file":"ConstantSumPool.js","names":["_asset","require","_fraction","_index","_toConsumableArray","r","_arrayWithoutHoles","_iterableToArray","_unsupportedIterableToArray","_nonIterableSpread","TypeError","a","_arrayLikeToArray","t","toString","call","slice","constructor","name","Array","from","test","Symbol","iterator","isArray","length","e","n","getSwapOutput","exports","inputMetadata","input","inputReserve","outputReserve","priceIn","priceOut","fee","roundOutputUp","Error","feeFraction","Fraction","asFraction","lt","ZERO","gt","ONE","inputValue","feeValue","BigInt","numerator","denominator","quotient","outputValue","output","inputLpFee","nextInputReserve","nextOutputReserve","priceImpact","amountInLessFee","idealPrice","actualPrice","subtract","divide","lpFee","AssetAmount","getSwapInput","gte","feeNum","feeDen","feeDiff","targetValue","calculateLiquidity","b","aReserve","bReserve","totalLp","priceA","priceB","_calculatePinnedDepos","calculatePinnedDeposit","deltas","generatedLp","nextTotalLp","shareAfterDeposit","aChange","bChange","actualDepositedA","actualDepositedB","offered","reserves","prices","some","p","vB","i","cap","undefined","map","targetDeltaV","SharedPoolMath","getShare","pinnedDepositFromAnchor","anchorIndex","anchorAmount","calculateDepositN","amounts","every","totalValue","depositValue","calculateZap","lhs","rhs","swapIndex","swapInput","swapOutput","nextReserves","depositBasket","x","y","_ref","aX","aY","_ref2","rX","rY","_ref3","pX","pY","pinned","change"],"sources":["../../../src/PoolMath/ConstantSumPool.ts"],"sourcesContent":["import { AssetAmount, IAssetAmountMetadata } from \"@sundaeswap/asset\";\nimport { Fraction, type TFractionLike } from \"@sundaeswap/fraction\";\nimport { SharedPoolMath } from \"./index.js\";\n\n/**\n * Holds the calculated outcome of a constant-sum swap. Mirrors\n * {@link ConstantProductPool.TSwapOutcome} so both can flow through the same\n * generic swap-outcome consumers.\n */\nexport type TSwapOutcome = {\n  input: bigint;\n  output: bigint;\n  lpFee: AssetAmount<IAssetAmountMetadata>;\n  nextInputReserve: bigint;\n  nextOutputReserve: bigint;\n  priceImpact: Fraction;\n};\n\n/**\n * Calculate the swap outcome for a constant-sum (fixed-price) pool — the\n * invariant used by Sundae v4 stable/pegged pools. Unlike constant product,\n * the exchange rate is fixed by the pool's per-asset `prices`: the input is\n * converted to \"value\" at `priceIn`, the fee is taken off that value, and the\n * remainder is converted to the output asset at `priceOut`. The result is\n * capped at the output reserve (you can't take more than the pool holds).\n *\n * Matches the scooper's `cs_swap_result`:\n *   output = floor((input·priceIn − floor(input·priceIn·fee)) / priceOut)\n *\n * @param inputMetadata Metadata for the supplied (input) asset — used for the fee AssetAmount.\n * @param input The amount of the input asset being swapped.\n * @param inputReserve The pool's reserve of the input asset.\n * @param outputReserve The pool's reserve of the output asset.\n * @param priceIn The pool's price for the input asset (from the constant-sum config).\n * @param priceOut The pool's price for the output asset.\n * @param fee The liquidity-provider fee (plus protocol fee) as a fraction.\n * @param roundOutputUp When true, round the output up instead of flooring.\n * @returns The swap details in the shared {@link TSwapOutcome} shape.\n */\nexport const getSwapOutput = (\n  inputMetadata: IAssetAmountMetadata,\n  input: bigint,\n  inputReserve: bigint,\n  outputReserve: bigint,\n  priceIn: bigint,\n  priceOut: bigint,\n  fee: TFractionLike,\n  roundOutputUp?: boolean,\n): TSwapOutcome => {\n  if (input <= 0n || inputReserve <= 0n || outputReserve <= 0n)\n    throw new Error(\"Input and reserves must be positive\");\n  if (priceIn <= 0n || priceOut <= 0n)\n    throw new Error(\"Prices must be positive\");\n\n  const feeFraction = Fraction.asFraction(fee);\n  if (feeFraction.lt(Fraction.ZERO) || feeFraction.gt(Fraction.ONE))\n    throw new Error(\"fee must be between 0 and 1\");\n\n  const inputValue = input * priceIn;\n  const feeValue = new Fraction(\n    inputValue * BigInt(feeFraction.numerator),\n    BigInt(feeFraction.denominator),\n  ).quotient;\n  const outputValue = inputValue - feeValue;\n\n  let output = roundOutputUp\n    ? (outputValue + priceOut - 1n) / priceOut\n    : outputValue / priceOut;\n\n  // Can't take more than the pool holds.\n  if (output > outputReserve) {\n    output = outputReserve;\n  }\n\n  // LP fee expressed in input-asset units (value scales linearly with input,\n  // so the input-denominated fee is input·feeRate) — matching ConstantProductPool.\n  const inputLpFee = new Fraction(\n    input * BigInt(feeFraction.numerator),\n    BigInt(feeFraction.denominator),\n  ).quotient;\n\n  const nextInputReserve = inputReserve + input;\n  const nextOutputReserve = outputReserve - output;\n\n  // Price impact vs the pool's par price (priceOut/priceIn input-per-output);\n  // ~0 for a constant-sum pool aside from the fee. See ConstantProductPool.\n  let priceImpact = Fraction.ZERO;\n  if (output > 0n) {\n    const amountInLessFee = input - inputLpFee;\n    const idealPrice = new Fraction(priceOut, priceIn);\n    const actualPrice = new Fraction(amountInLessFee, output);\n    priceImpact = Fraction.ONE.subtract(idealPrice.divide(actualPrice));\n  }\n\n  return {\n    input,\n    output,\n    lpFee: new AssetAmount(inputLpFee, inputMetadata),\n    nextInputReserve,\n    nextOutputReserve,\n    priceImpact,\n  };\n};\n\n/**\n * Calculate the minimal input required to receive a given output from a\n * constant-sum pool — the exact inverse of {@link getSwapOutput}.\n *\n * The forward math floors the fee off the input value, which makes the\n * post-fee value `ceil(input·priceIn·(1−fee))`; inverting that ceiling gives\n * the smallest input whose forward swap yields at least `output`.\n *\n * Unlike constant product there is no asymptote, so an output equal to the\n * full output reserve is attainable (the pool can be drained at par).\n *\n * @param inputMetadata Metadata for the supplied (input) asset — used for the fee AssetAmount.\n * @param output The desired amount of the output asset.\n * @param inputReserve The pool's reserve of the input asset.\n * @param outputReserve The pool's reserve of the output asset.\n * @param priceIn The pool's price for the input asset (from the constant-sum config).\n * @param priceOut The pool's price for the output asset.\n * @param fee The liquidity-provider fee (plus protocol fee) as a fraction.\n * @returns The swap details in the shared {@link TSwapOutcome} shape.\n */\nexport const getSwapInput = (\n  inputMetadata: IAssetAmountMetadata,\n  output: bigint,\n  inputReserve: bigint,\n  outputReserve: bigint,\n  priceIn: bigint,\n  priceOut: bigint,\n  fee: TFractionLike,\n): TSwapOutcome => {\n  if (output <= 0n || inputReserve <= 0n || outputReserve <= 0n)\n    throw new Error(\"Output and reserves must be positive\");\n  if (priceIn <= 0n || priceOut <= 0n)\n    throw new Error(\"Prices must be positive\");\n  if (output > outputReserve)\n    throw new Error(\"Output must not exceed the output reserve\");\n\n  const feeFraction = Fraction.asFraction(fee);\n  if (feeFraction.lt(Fraction.ZERO) || feeFraction.gte(Fraction.ONE))\n    throw new Error(\"fee must be [0,1)\");\n\n  const feeNum = BigInt(feeFraction.numerator);\n  const feeDen = BigInt(feeFraction.denominator);\n  const feeDiff = feeDen - feeNum;\n\n  // Forward: outputValue = ceil(input·priceIn·feeDiff/feeDen), and the swap\n  // yields ≥ output iff outputValue ≥ output·priceOut. ceil(x/d) ≥ T for\n  // integer x iff x ≥ d·(T−1)+1, so the minimal input is the ceiling of\n  // (feeDen·(output·priceOut − 1) + 1) / (feeDiff·priceIn).\n  const targetValue = output * priceOut;\n  const numerator = feeDen * (targetValue - 1n) + 1n;\n  const denominator = feeDiff * priceIn;\n  const input = (numerator + denominator - 1n) / denominator;\n\n  const inputLpFee = new Fraction(input * feeNum, feeDen).quotient;\n  const nextInputReserve = inputReserve + input;\n  const nextOutputReserve = outputReserve - output;\n\n  // Same par-price impact definition as getSwapOutput.\n  const amountInLessFee = input - inputLpFee;\n  const idealPrice = new Fraction(priceOut, priceIn);\n  const actualPrice = new Fraction(amountInLessFee, output);\n  const priceImpact = Fraction.ONE.subtract(idealPrice.divide(actualPrice));\n\n  return {\n    input,\n    output,\n    lpFee: new AssetAmount(inputLpFee, inputMetadata),\n    nextInputReserve,\n    nextOutputReserve,\n    priceImpact,\n  };\n};\n\n/**\n * Calculate the deposit parameters for a 2-asset constant-sum pool via the\n * TARGET-PINNED rule the deployed validator enforces (see\n * {@link calculatePinnedDeposit}): the mint is capped by the scarcest offered\n * asset, both assets must be offered, and anything above the pinned deltas is\n * refunded via aChange/bChange.\n *\n * @param {bigint} a - The amount of token A to deposit.\n * @param {bigint} b - The amount of token B to deposit.\n * @param {bigint} aReserve - The current reserve of token A in the pool.\n * @param {bigint} bReserve - The current reserve of token B in the pool.\n * @param {bigint} totalLp - The total lp tokens for the pool before the deposit.\n * @param {bigint} priceA - The pool's price for token A (from the constant-sum config).\n * @param {bigint} priceB - The pool's price for token B.\n * @throws {Error} If the pool has no value or minted lp.\n * @throws {Error} If both deposit amounts are zero, or either is negative.\n * @throws {Error} If either price is non-positive.\n */\nexport const calculateLiquidity = (\n  a: bigint,\n  b: bigint,\n  aReserve: bigint,\n  bReserve: bigint,\n  totalLp: bigint,\n  priceA: bigint,\n  priceB: bigint,\n) => {\n  // Target-pinned (what the deployed validator accepts): mint by the\n  // scarcest offered asset; anything above the pinned deltas is refunded\n  // (aChange/bChange).\n  const { deltas, generatedLp, nextTotalLp, shareAfterDeposit } =\n    calculatePinnedDeposit(\n      [a, b],\n      [aReserve, bReserve],\n      [priceA, priceB],\n      totalLp,\n    );\n\n  return {\n    nextTotalLp,\n    generatedLp,\n    shareAfterDeposit,\n    aChange: a - deltas[0],\n    bChange: b - deltas[1],\n    actualDepositedA: deltas[0],\n    actualDepositedB: deltas[1],\n  };\n};\n\n/**\n * The N-asset form of {@link calculateLiquidity}, mirroring the v4 contract's\n * `compute_deposit_n` exactly: a deposit of any mix of the pool's assets is\n * valued at the fixed prices against the value of ALL reserves —\n *\n *   generatedLp = Σ(amount_i·price_i) · totalLp / Σ(reserve_i·price_i)\n *\n * The three arrays must be aligned to the pool's canonical asset order (the\n * API's `assets`/`quantities`/`prices`). Estimating an N-asset pool's deposit\n * from just two of its reserves overstates the minted LP — the denominator is\n * the whole pool's value — which is exactly the mistake this exists to\n * prevent.\n */\n/**\n * The target-pinned deposit — what the deployed CS validator (cs_check tag 6)\n * actually accepts, and what the scooper builds. Asymmetric deposits are\n * disallowed on-chain: the fill declares a value delta `t` and every asset's\n * contribution is ceil-pinned to `ceil(r_i·t/V_b)`, with total LP\n * floor-pinned to `floor(lp_b·(V_b+t)/V_b)`. Given what the user offers, the\n * largest fillable t is capped by the SCARCEST asset —\n * `t = min_i floor(offered_i·V_b/r_i)` — and anything above the pinned\n * deltas is returned as surplus. Every pool asset must be offered (> 0) or\n * t is zero and the deposit can never fill.\n *\n * Contrast with `calculateDepositN`, which is the plain value formula:\n * it matches the pin only for exactly proportional offers and OVERSTATES the\n * mint otherwise — using it for `minReceived` makes non-proportional orders\n * unfillable.\n */\nexport const calculatePinnedDeposit = (\n  offered: bigint[],\n  reserves: bigint[],\n  prices: bigint[],\n  totalLp: bigint,\n): {\n  targetDeltaV: bigint;\n  deltas: bigint[];\n  generatedLp: bigint;\n  nextTotalLp: bigint;\n  shareAfterDeposit: Fraction;\n} => {\n  if (offered.length !== reserves.length || reserves.length !== prices.length)\n    throw new Error(\"offered, reserves and prices must be aligned\");\n  if (prices.some((p) => p <= 0n)) throw new Error(\"Prices must be positive\");\n  if (totalLp <= 0n) throw new Error(\"Not enough pool liquidity\");\n\n  let vB = 0n;\n  for (let i = 0; i < reserves.length; i++) {\n    vB += reserves[i] * prices[i];\n  }\n  if (vB <= 0n) throw new Error(\"Pool value is zero\");\n\n  let t: bigint | undefined;\n  for (let i = 0; i < offered.length; i++) {\n    if (reserves[i] === 0n) continue;\n    const cap = (offered[i] * vB) / reserves[i];\n    t = t === undefined || cap < t ? cap : t;\n  }\n  if (t === undefined || t <= 0n) {\n    throw new Error(\n      \"A constant-sum deposit must offer every pool asset in proportion (asymmetric deposits are disallowed on-chain)\",\n    );\n  }\n\n  const deltas = reserves.map((r) => (r * t! + vB - 1n) / vB); // ceil\n  const nextTotalLp = (totalLp * (vB + t)) / vB; // floor\n  const generatedLp = nextTotalLp - totalLp;\n  if (generatedLp <= 0n) throw new Error(\"Deposit mints zero LP\");\n\n  return {\n    targetDeltaV: t,\n    deltas,\n    generatedLp,\n    nextTotalLp,\n    shareAfterDeposit: SharedPoolMath.getShare(generatedLp, nextTotalLp),\n  };\n};\n\n/**\n * The per-asset amounts a pinned deposit needs when the user anchors on one\n * asset's amount: t from the anchor (`floor(anchor·V_b/r_anchor)`), every\n * delta ceil-pinned to it. Drives proportional auto-fill in deposit forms.\n */\nexport const pinnedDepositFromAnchor = (\n  anchorIndex: number,\n  anchorAmount: bigint,\n  reserves: bigint[],\n  prices: bigint[],\n): bigint[] => {\n  if (reserves.length !== prices.length)\n    throw new Error(\"reserves and prices must be aligned\");\n  if (\n    anchorIndex < 0 ||\n    anchorIndex >= reserves.length ||\n    reserves[anchorIndex] <= 0n\n  )\n    throw new Error(\"anchor asset has no reserve\");\n  if (anchorAmount <= 0n) return reserves.map(() => 0n);\n\n  let vB = 0n;\n  for (let i = 0; i < reserves.length; i++) {\n    vB += reserves[i] * prices[i];\n  }\n  if (vB <= 0n) throw new Error(\"Pool value is zero\");\n\n  const t = (anchorAmount * vB) / reserves[anchorIndex];\n  return reserves.map((r, i) =>\n    i === anchorIndex ? anchorAmount : (r * t + vB - 1n) / vB,\n  );\n};\n\nexport const calculateDepositN = (\n  amounts: bigint[],\n  reserves: bigint[],\n  prices: bigint[],\n  totalLp: bigint,\n) => {\n  if (amounts.length !== reserves.length || reserves.length !== prices.length)\n    throw new Error(\"amounts, reserves and prices must be aligned\");\n  if (prices.some((p) => p <= 0n)) throw new Error(\"Prices must be positive\");\n  // Zeros in a MIX are fine — offering a subset is the point of the N-asset\n  // form. What's rejected is a negative amount, or offering nothing at all.\n  if (amounts.some((a) => a < 0n) || amounts.every((a) => a === 0n))\n    throw new Error(\n      \"Deposit amounts must be non-negative, with at least one positive\",\n    );\n\n  let totalValue = 0n;\n  let depositValue = 0n;\n  for (let i = 0; i < amounts.length; i++) {\n    totalValue += reserves[i] * prices[i];\n    depositValue += amounts[i] * prices[i];\n  }\n  if (totalValue <= 0n || totalLp <= 0n)\n    throw new Error(\"Not enough pool liquidity\");\n\n  const generatedLp = (depositValue * totalLp) / totalValue;\n  const nextTotalLp = totalLp + generatedLp;\n\n  return {\n    nextTotalLp,\n    generatedLp,\n    shareAfterDeposit: SharedPoolMath.getShare(generatedLp, nextTotalLp),\n  };\n};\n\n/**\n * Outcome of {@link calculateZap}. Every array is aligned to `offered`.\n */\nexport type TZapOutcome = {\n  /** Index of the offered asset swapped away; `undefined` when the basket already matches the reserves. */\n  swapIndex: number | undefined;\n  /** Amount of `offered[swapIndex]` swapped away. */\n  swapInput: bigint;\n  /** Amount of the other asset the swap yields. */\n  swapOutput: bigint;\n  /** Reserves after the swap — what the deposit pins against. */\n  nextReserves: bigint[];\n  /** `offered` after the swap: what is actually deposited. */\n  depositBasket: bigint[];\n  /** Per-asset ceil-pinned deposit. */\n  deltas: bigint[];\n  /** `depositBasket − deltas`: surplus returned to the user. */\n  change: bigint[];\n  targetDeltaV: bigint;\n  generatedLp: bigint;\n  nextTotalLp: bigint;\n  shareAfterDeposit: Fraction;\n};\n\n/**\n * A zap on a 2-asset constant-sum pool: a non-proportional `offered` basket\n * is rebalanced by swapping part of the over-weighted asset, then deposited\n * under the target-pinned rule ({@link calculatePinnedDeposit}). The swap\n * amount `dx` is the one that leaves the post-swap basket proportional to\n * the post-swap reserves, so the pin consumes the whole basket up to\n * rounding. With `k = (1−fee)·p_X/p_Y`,\n *\n *   (a_X − dx)/(r_X + dx) = (a_Y + k·dx)/(r_Y − k·dx)\n *   ⇒ dx = (a_X·r_Y − a_Y·r_X) / (k·(r_X + a_X) + (r_Y + a_Y))\n *\n * (the dx² terms cancel). `dx` is floored and the swap leg follows\n * {@link getSwapOutput}; whatever imbalance rounding leaves comes back as\n * `change`.\n *\n * `fee` is the pool's fee for the swap direction — v4 splits bid and ask, so\n * the caller picks. Two assets only: with more, which assets to swap is an\n * allocation problem this formula does not address.\n */\nexport const calculateZap = (\n  offered: bigint[],\n  reserves: bigint[],\n  prices: bigint[],\n  totalLp: bigint,\n  fee: TFractionLike,\n): TZapOutcome => {\n  if (offered.length !== 2 || reserves.length !== 2 || prices.length !== 2)\n    throw new Error(\"calculateZap supports exactly two assets\");\n  if (prices.some((p) => p <= 0n)) throw new Error(\"Prices must be positive\");\n  if (reserves.some((r) => r <= 0n))\n    throw new Error(\"Reserves must be positive\");\n  if (offered.some((a) => a < 0n) || offered.every((a) => a === 0n))\n    throw new Error(\n      \"Offered amounts must be non-negative, with at least one positive\",\n    );\n  if (totalLp <= 0n) throw new Error(\"Not enough pool liquidity\");\n\n  const feeFraction = Fraction.asFraction(fee);\n  if (feeFraction.lt(Fraction.ZERO) || feeFraction.gte(Fraction.ONE))\n    throw new Error(\"fee must be [0,1)\");\n  const feeNum = BigInt(feeFraction.numerator);\n  const feeDen = BigInt(feeFraction.denominator);\n\n  // Over-weighted side: compare a_0/r_0 against a_1/r_1 without division.\n  const lhs = offered[0] * reserves[1];\n  const rhs = offered[1] * reserves[0];\n  const swapIndex = lhs > rhs ? 0 : lhs < rhs ? 1 : undefined;\n\n  let swapInput = 0n;\n  let swapOutput = 0n;\n  const nextReserves = [...reserves];\n  const depositBasket = [...offered];\n\n  if (swapIndex !== undefined) {\n    const x = swapIndex;\n    const y = 1 - swapIndex;\n    const [aX, aY] = [offered[x], offered[y]];\n    const [rX, rY] = [reserves[x], reserves[y]];\n    const [pX, pY] = [prices[x], prices[y]];\n\n    // dx with k = (feeDen−feeNum)·pX / (feeDen·pY), cleared of denominators.\n    const numerator = (aX * rY - aY * rX) * feeDen * pY;\n    const denominator =\n      (feeDen - feeNum) * pX * (rX + aX) + feeDen * pY * (rY + aY);\n    swapInput = numerator / denominator;\n\n    if (swapInput > 0n) {\n      const inputValue = swapInput * pX;\n      const feeValue = (inputValue * feeNum) / feeDen;\n      swapOutput = (inputValue - feeValue) / pY;\n      if (swapOutput >= rY)\n        throw new Error(\n          \"Pool too shallow: the rebalancing swap would drain it\",\n        );\n\n      nextReserves[x] = rX + swapInput;\n      nextReserves[y] = rY - swapOutput;\n      depositBasket[x] = aX - swapInput;\n      depositBasket[y] = aY + swapOutput;\n    }\n  }\n\n  if (depositBasket.some((a) => a <= 0n))\n    throw new Error(\"Offered amount too small to zap into this pool\");\n\n  const pinned = calculatePinnedDeposit(\n    depositBasket,\n    nextReserves,\n    prices,\n    totalLp,\n  );\n\n  return {\n    swapIndex,\n    swapInput,\n    swapOutput,\n    nextReserves,\n    depositBasket,\n    deltas: pinned.deltas,\n    change: depositBasket.map((a, i) => a - pinned.deltas[i]),\n    targetDeltaV: pinned.targetDeltaV,\n    generatedLp: pinned.generatedLp,\n    nextTotalLp: pinned.nextTotalLp,\n    shareAfterDeposit: pinned.shareAfterDeposit,\n  };\n};\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AACA,IAAAC,SAAA,GAAAD,OAAA;AACA,IAAAE,MAAA,GAAAF,OAAA;AAA4C,SAAAG,mBAAAC,CAAA,WAAAC,kBAAA,CAAAD,CAAA,KAAAE,gBAAA,CAAAF,CAAA,KAAAG,2BAAA,CAAAH,CAAA,KAAAI,kBAAA;AAAA,SAAAA,mBAAA,cAAAC,SAAA;AAAA,SAAAF,4BAAAH,CAAA,EAAAM,CAAA,QAAAN,CAAA,2BAAAA,CAAA,SAAAO,iBAAA,CAAAP,CAAA,EAAAM,CAAA,OAAAE,CAAA,MAAAC,QAAA,CAAAC,IAAA,CAAAV,CAAA,EAAAW,KAAA,6BAAAH,CAAA,IAAAR,CAAA,CAAAY,WAAA,KAAAJ,CAAA,GAAAR,CAAA,CAAAY,WAAA,CAAAC,IAAA,aAAAL,CAAA,cAAAA,CAAA,GAAAM,KAAA,CAAAC,IAAA,CAAAf,CAAA,oBAAAQ,CAAA,+CAAAQ,IAAA,CAAAR,CAAA,IAAAD,iBAAA,CAAAP,CAAA,EAAAM,CAAA;AAAA,SAAAJ,iBAAAF,CAAA,8BAAAiB,MAAA,YAAAjB,CAAA,CAAAiB,MAAA,CAAAC,QAAA,aAAAlB,CAAA,uBAAAc,KAAA,CAAAC,IAAA,CAAAf,CAAA;AAAA,SAAAC,mBAAAD,CAAA,QAAAc,KAAA,CAAAK,OAAA,CAAAnB,CAAA,UAAAO,iBAAA,CAAAP,CAAA;AAAA,SAAAO,kBAAAP,CAAA,EAAAM,CAAA,aAAAA,CAAA,IAAAA,CAAA,GAAAN,CAAA,CAAAoB,MAAA,MAAAd,CAAA,GAAAN,CAAA,CAAAoB,MAAA,YAAAC,CAAA,MAAAC,CAAA,GAAAR,KAAA,CAAAR,CAAA,GAAAe,CAAA,GAAAf,CAAA,EAAAe,CAAA,IAAAC,CAAA,CAAAD,CAAA,IAAArB,CAAA,CAAAqB,CAAA,UAAAC,CAAA;AAE5C;AACA;AACA;AACA;AACA;;AAUA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMC,aAAa,GAAAC,OAAA,CAAAD,aAAA,GAAG,SAAhBA,aAAaA,CACxBE,aAAmC,EACnCC,KAAa,EACbC,YAAoB,EACpBC,aAAqB,EACrBC,OAAe,EACfC,QAAgB,EAChBC,GAAkB,EAClBC,aAAuB,EACN;EACjB,IAAIN,KAAK,IAAI,EAAE,IAAIC,YAAY,IAAI,EAAE,IAAIC,aAAa,IAAI,EAAE,EAC1D,MAAM,IAAIK,KAAK,CAAC,qCAAqC,CAAC;EACxD,IAAIJ,OAAO,IAAI,EAAE,IAAIC,QAAQ,IAAI,EAAE,EACjC,MAAM,IAAIG,KAAK,CAAC,yBAAyB,CAAC;EAE5C,IAAMC,WAAW,GAAGC,kBAAQ,CAACC,UAAU,CAACL,GAAG,CAAC;EAC5C,IAAIG,WAAW,CAACG,EAAE,CAACF,kBAAQ,CAACG,IAAI,CAAC,IAAIJ,WAAW,CAACK,EAAE,CAACJ,kBAAQ,CAACK,GAAG,CAAC,EAC/D,MAAM,IAAIP,KAAK,CAAC,6BAA6B,CAAC;EAEhD,IAAMQ,UAAU,GAAGf,KAAK,GAAGG,OAAO;EAClC,IAAMa,QAAQ,GAAG,IAAIP,kBAAQ,CAC3BM,UAAU,GAAGE,MAAM,CAACT,WAAW,CAACU,SAAS,CAAC,EAC1CD,MAAM,CAACT,WAAW,CAACW,WAAW,CAChC,CAAC,CAACC,QAAQ;EACV,IAAMC,WAAW,GAAGN,UAAU,GAAGC,QAAQ;EAEzC,IAAIM,MAAM,GAAGhB,aAAa,GACtB,CAACe,WAAW,GAAGjB,QAAQ,GAAG,EAAE,IAAIA,QAAQ,GACxCiB,WAAW,GAAGjB,QAAQ;;EAE1B;EACA,IAAIkB,MAAM,GAAGpB,aAAa,EAAE;IAC1BoB,MAAM,GAAGpB,aAAa;EACxB;;EAEA;EACA;EACA,IAAMqB,UAAU,GAAG,IAAId,kBAAQ,CAC7BT,KAAK,GAAGiB,MAAM,CAACT,WAAW,CAACU,SAAS,CAAC,EACrCD,MAAM,CAACT,WAAW,CAACW,WAAW,CAChC,CAAC,CAACC,QAAQ;EAEV,IAAMI,gBAAgB,GAAGvB,YAAY,GAAGD,KAAK;EAC7C,IAAMyB,iBAAiB,GAAGvB,aAAa,GAAGoB,MAAM;;EAEhD;EACA;EACA,IAAII,WAAW,GAAGjB,kBAAQ,CAACG,IAAI;EAC/B,IAAIU,MAAM,GAAG,EAAE,EAAE;IACf,IAAMK,eAAe,GAAG3B,KAAK,GAAGuB,UAAU;IAC1C,IAAMK,UAAU,GAAG,IAAInB,kBAAQ,CAACL,QAAQ,EAAED,OAAO,CAAC;IAClD,IAAM0B,WAAW,GAAG,IAAIpB,kBAAQ,CAACkB,eAAe,EAAEL,MAAM,CAAC;IACzDI,WAAW,GAAGjB,kBAAQ,CAACK,GAAG,CAACgB,QAAQ,CAACF,UAAU,CAACG,MAAM,CAACF,WAAW,CAAC,CAAC;EACrE;EAEA,OAAO;IACL7B,KAAK,EAALA,KAAK;IACLsB,MAAM,EAANA,MAAM;IACNU,KAAK,EAAE,IAAIC,kBAAW,CAACV,UAAU,EAAExB,aAAa,CAAC;IACjDyB,gBAAgB,EAAhBA,gBAAgB;IAChBC,iBAAiB,EAAjBA,iBAAiB;IACjBC,WAAW,EAAXA;EACF,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMQ,YAAY,GAAApC,OAAA,CAAAoC,YAAA,GAAG,SAAfA,YAAYA,CACvBnC,aAAmC,EACnCuB,MAAc,EACdrB,YAAoB,EACpBC,aAAqB,EACrBC,OAAe,EACfC,QAAgB,EAChBC,GAAkB,EACD;EACjB,IAAIiB,MAAM,IAAI,EAAE,IAAIrB,YAAY,IAAI,EAAE,IAAIC,aAAa,IAAI,EAAE,EAC3D,MAAM,IAAIK,KAAK,CAAC,sCAAsC,CAAC;EACzD,IAAIJ,OAAO,IAAI,EAAE,IAAIC,QAAQ,IAAI,EAAE,EACjC,MAAM,IAAIG,KAAK,CAAC,yBAAyB,CAAC;EAC5C,IAAIe,MAAM,GAAGpB,aAAa,EACxB,MAAM,IAAIK,KAAK,CAAC,2CAA2C,CAAC;EAE9D,IAAMC,WAAW,GAAGC,kBAAQ,CAACC,UAAU,CAACL,GAAG,CAAC;EAC5C,IAAIG,WAAW,CAACG,EAAE,CAACF,kBAAQ,CAACG,IAAI,CAAC,IAAIJ,WAAW,CAAC2B,GAAG,CAAC1B,kBAAQ,CAACK,GAAG,CAAC,EAChE,MAAM,IAAIP,KAAK,CAAC,mBAAmB,CAAC;EAEtC,IAAM6B,MAAM,GAAGnB,MAAM,CAACT,WAAW,CAACU,SAAS,CAAC;EAC5C,IAAMmB,MAAM,GAAGpB,MAAM,CAACT,WAAW,CAACW,WAAW,CAAC;EAC9C,IAAMmB,OAAO,GAAGD,MAAM,GAAGD,MAAM;;EAE/B;EACA;EACA;EACA;EACA,IAAMG,WAAW,GAAGjB,MAAM,GAAGlB,QAAQ;EACrC,IAAMc,SAAS,GAAGmB,MAAM,IAAIE,WAAW,GAAG,EAAE,CAAC,GAAG,EAAE;EAClD,IAAMpB,WAAW,GAAGmB,OAAO,GAAGnC,OAAO;EACrC,IAAMH,KAAK,GAAG,CAACkB,SAAS,GAAGC,WAAW,GAAG,EAAE,IAAIA,WAAW;EAE1D,IAAMI,UAAU,GAAG,IAAId,kBAAQ,CAACT,KAAK,GAAGoC,MAAM,EAAEC,MAAM,CAAC,CAACjB,QAAQ;EAChE,IAAMI,gBAAgB,GAAGvB,YAAY,GAAGD,KAAK;EAC7C,IAAMyB,iBAAiB,GAAGvB,aAAa,GAAGoB,MAAM;;EAEhD;EACA,IAAMK,eAAe,GAAG3B,KAAK,GAAGuB,UAAU;EAC1C,IAAMK,UAAU,GAAG,IAAInB,kBAAQ,CAACL,QAAQ,EAAED,OAAO,CAAC;EAClD,IAAM0B,WAAW,GAAG,IAAIpB,kBAAQ,CAACkB,eAAe,EAAEL,MAAM,CAAC;EACzD,IAAMI,WAAW,GAAGjB,kBAAQ,CAACK,GAAG,CAACgB,QAAQ,CAACF,UAAU,CAACG,MAAM,CAACF,WAAW,CAAC,CAAC;EAEzE,OAAO;IACL7B,KAAK,EAALA,KAAK;IACLsB,MAAM,EAANA,MAAM;IACNU,KAAK,EAAE,IAAIC,kBAAW,CAACV,UAAU,EAAExB,aAAa,CAAC;IACjDyB,gBAAgB,EAAhBA,gBAAgB;IAChBC,iBAAiB,EAAjBA,iBAAiB;IACjBC,WAAW,EAAXA;EACF,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMc,kBAAkB,GAAA1C,OAAA,CAAA0C,kBAAA,GAAG,SAArBA,kBAAkBA,CAC7B5D,CAAS,EACT6D,CAAS,EACTC,QAAgB,EAChBC,QAAgB,EAChBC,OAAe,EACfC,MAAc,EACdC,MAAc,EACX;EACH;EACA;EACA;EACA,IAAAC,qBAAA,GACEC,sBAAsB,CACpB,CAACpE,CAAC,EAAE6D,CAAC,CAAC,EACN,CAACC,QAAQ,EAAEC,QAAQ,CAAC,EACpB,CAACE,MAAM,EAAEC,MAAM,CAAC,EAChBF,OACF,CAAC;IANKK,MAAM,GAAAF,qBAAA,CAANE,MAAM;IAAEC,WAAW,GAAAH,qBAAA,CAAXG,WAAW;IAAEC,WAAW,GAAAJ,qBAAA,CAAXI,WAAW;IAAEC,iBAAiB,GAAAL,qBAAA,CAAjBK,iBAAiB;EAQ3D,OAAO;IACLD,WAAW,EAAXA,WAAW;IACXD,WAAW,EAAXA,WAAW;IACXE,iBAAiB,EAAjBA,iBAAiB;IACjBC,OAAO,EAAEzE,CAAC,GAAGqE,MAAM,CAAC,CAAC,CAAC;IACtBK,OAAO,EAAEb,CAAC,GAAGQ,MAAM,CAAC,CAAC,CAAC;IACtBM,gBAAgB,EAAEN,MAAM,CAAC,CAAC,CAAC;IAC3BO,gBAAgB,EAAEP,MAAM,CAAC,CAAC;EAC5B,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMD,sBAAsB,GAAAlD,OAAA,CAAAkD,sBAAA,GAAG,SAAzBA,sBAAsBA,CACjCS,OAAiB,EACjBC,QAAkB,EAClBC,MAAgB,EAChBf,OAAe,EAOZ;EACH,IAAIa,OAAO,CAAC/D,MAAM,KAAKgE,QAAQ,CAAChE,MAAM,IAAIgE,QAAQ,CAAChE,MAAM,KAAKiE,MAAM,CAACjE,MAAM,EACzE,MAAM,IAAIa,KAAK,CAAC,8CAA8C,CAAC;EACjE,IAAIoD,MAAM,CAACC,IAAI,CAAC,UAACC,CAAC;IAAA,OAAKA,CAAC,IAAI,EAAE;EAAA,EAAC,EAAE,MAAM,IAAItD,KAAK,CAAC,yBAAyB,CAAC;EAC3E,IAAIqC,OAAO,IAAI,EAAE,EAAE,MAAM,IAAIrC,KAAK,CAAC,2BAA2B,CAAC;EAE/D,IAAIuD,EAAE,GAAG,EAAE;EACX,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGL,QAAQ,CAAChE,MAAM,EAAEqE,CAAC,EAAE,EAAE;IACxCD,EAAE,IAAIJ,QAAQ,CAACK,CAAC,CAAC,GAAGJ,MAAM,CAACI,CAAC,CAAC;EAC/B;EACA,IAAID,EAAE,IAAI,EAAE,EAAE,MAAM,IAAIvD,KAAK,CAAC,oBAAoB,CAAC;EAEnD,IAAIzB,CAAqB;EACzB,KAAK,IAAIiF,EAAC,GAAG,CAAC,EAAEA,EAAC,GAAGN,OAAO,CAAC/D,MAAM,EAAEqE,EAAC,EAAE,EAAE;IACvC,IAAIL,QAAQ,CAACK,EAAC,CAAC,KAAK,EAAE,EAAE;IACxB,IAAMC,GAAG,GAAIP,OAAO,CAACM,EAAC,CAAC,GAAGD,EAAE,GAAIJ,QAAQ,CAACK,EAAC,CAAC;IAC3CjF,CAAC,GAAGA,CAAC,KAAKmF,SAAS,IAAID,GAAG,GAAGlF,CAAC,GAAGkF,GAAG,GAAGlF,CAAC;EAC1C;EACA,IAAIA,CAAC,KAAKmF,SAAS,IAAInF,CAAC,IAAI,EAAE,EAAE;IAC9B,MAAM,IAAIyB,KAAK,CACb,gHACF,CAAC;EACH;EAEA,IAAM0C,MAAM,GAAGS,QAAQ,CAACQ,GAAG,CAAC,UAAC5F,CAAC;IAAA,OAAK,CAACA,CAAC,GAAGQ,CAAE,GAAGgF,EAAE,GAAG,EAAE,IAAIA,EAAE;EAAA,EAAC,CAAC,CAAC;EAC7D,IAAMX,WAAW,GAAIP,OAAO,IAAIkB,EAAE,GAAGhF,CAAC,CAAC,GAAIgF,EAAE,CAAC,CAAC;EAC/C,IAAMZ,WAAW,GAAGC,WAAW,GAAGP,OAAO;EACzC,IAAIM,WAAW,IAAI,EAAE,EAAE,MAAM,IAAI3C,KAAK,CAAC,uBAAuB,CAAC;EAE/D,OAAO;IACL4D,YAAY,EAAErF,CAAC;IACfmE,MAAM,EAANA,MAAM;IACNC,WAAW,EAAXA,WAAW;IACXC,WAAW,EAAXA,WAAW;IACXC,iBAAiB,EAAEgB,qBAAc,CAACC,QAAQ,CAACnB,WAAW,EAAEC,WAAW;EACrE,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACO,IAAMmB,uBAAuB,GAAAxE,OAAA,CAAAwE,uBAAA,GAAG,SAA1BA,uBAAuBA,CAClCC,WAAmB,EACnBC,YAAoB,EACpBd,QAAkB,EAClBC,MAAgB,EACH;EACb,IAAID,QAAQ,CAAChE,MAAM,KAAKiE,MAAM,CAACjE,MAAM,EACnC,MAAM,IAAIa,KAAK,CAAC,qCAAqC,CAAC;EACxD,IACEgE,WAAW,GAAG,CAAC,IACfA,WAAW,IAAIb,QAAQ,CAAChE,MAAM,IAC9BgE,QAAQ,CAACa,WAAW,CAAC,IAAI,EAAE,EAE3B,MAAM,IAAIhE,KAAK,CAAC,6BAA6B,CAAC;EAChD,IAAIiE,YAAY,IAAI,EAAE,EAAE,OAAOd,QAAQ,CAACQ,GAAG,CAAC;IAAA,OAAM,EAAE;EAAA,EAAC;EAErD,IAAIJ,EAAE,GAAG,EAAE;EACX,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGL,QAAQ,CAAChE,MAAM,EAAEqE,CAAC,EAAE,EAAE;IACxCD,EAAE,IAAIJ,QAAQ,CAACK,CAAC,CAAC,GAAGJ,MAAM,CAACI,CAAC,CAAC;EAC/B;EACA,IAAID,EAAE,IAAI,EAAE,EAAE,MAAM,IAAIvD,KAAK,CAAC,oBAAoB,CAAC;EAEnD,IAAMzB,CAAC,GAAI0F,YAAY,GAAGV,EAAE,GAAIJ,QAAQ,CAACa,WAAW,CAAC;EACrD,OAAOb,QAAQ,CAACQ,GAAG,CAAC,UAAC5F,CAAC,EAAEyF,CAAC;IAAA,OACvBA,CAAC,KAAKQ,WAAW,GAAGC,YAAY,GAAG,CAAClG,CAAC,GAAGQ,CAAC,GAAGgF,EAAE,GAAG,EAAE,IAAIA,EAAE;EAAA,CAC3D,CAAC;AACH,CAAC;AAEM,IAAMW,iBAAiB,GAAA3E,OAAA,CAAA2E,iBAAA,GAAG,SAApBA,iBAAiBA,CAC5BC,OAAiB,EACjBhB,QAAkB,EAClBC,MAAgB,EAChBf,OAAe,EACZ;EACH,IAAI8B,OAAO,CAAChF,MAAM,KAAKgE,QAAQ,CAAChE,MAAM,IAAIgE,QAAQ,CAAChE,MAAM,KAAKiE,MAAM,CAACjE,MAAM,EACzE,MAAM,IAAIa,KAAK,CAAC,8CAA8C,CAAC;EACjE,IAAIoD,MAAM,CAACC,IAAI,CAAC,UAACC,CAAC;IAAA,OAAKA,CAAC,IAAI,EAAE;EAAA,EAAC,EAAE,MAAM,IAAItD,KAAK,CAAC,yBAAyB,CAAC;EAC3E;EACA;EACA,IAAImE,OAAO,CAACd,IAAI,CAAC,UAAChF,CAAC;IAAA,OAAKA,CAAC,GAAG,EAAE;EAAA,EAAC,IAAI8F,OAAO,CAACC,KAAK,CAAC,UAAC/F,CAAC;IAAA,OAAKA,CAAC,KAAK,EAAE;EAAA,EAAC,EAC/D,MAAM,IAAI2B,KAAK,CACb,kEACF,CAAC;EAEH,IAAIqE,UAAU,GAAG,EAAE;EACnB,IAAIC,YAAY,GAAG,EAAE;EACrB,KAAK,IAAId,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGW,OAAO,CAAChF,MAAM,EAAEqE,CAAC,EAAE,EAAE;IACvCa,UAAU,IAAIlB,QAAQ,CAACK,CAAC,CAAC,GAAGJ,MAAM,CAACI,CAAC,CAAC;IACrCc,YAAY,IAAIH,OAAO,CAACX,CAAC,CAAC,GAAGJ,MAAM,CAACI,CAAC,CAAC;EACxC;EACA,IAAIa,UAAU,IAAI,EAAE,IAAIhC,OAAO,IAAI,EAAE,EACnC,MAAM,IAAIrC,KAAK,CAAC,2BAA2B,CAAC;EAE9C,IAAM2C,WAAW,GAAI2B,YAAY,GAAGjC,OAAO,GAAIgC,UAAU;EACzD,IAAMzB,WAAW,GAAGP,OAAO,GAAGM,WAAW;EAEzC,OAAO;IACLC,WAAW,EAAXA,WAAW;IACXD,WAAW,EAAXA,WAAW;IACXE,iBAAiB,EAAEgB,qBAAc,CAACC,QAAQ,CAACnB,WAAW,EAAEC,WAAW;EACrE,CAAC;AACH,CAAC;;AAED;AACA;AACA;;AAsBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAM2B,YAAY,GAAAhF,OAAA,CAAAgF,YAAA,GAAG,SAAfA,YAAYA,CACvBrB,OAAiB,EACjBC,QAAkB,EAClBC,MAAgB,EAChBf,OAAe,EACfvC,GAAkB,EACF;EAChB,IAAIoD,OAAO,CAAC/D,MAAM,KAAK,CAAC,IAAIgE,QAAQ,CAAChE,MAAM,KAAK,CAAC,IAAIiE,MAAM,CAACjE,MAAM,KAAK,CAAC,EACtE,MAAM,IAAIa,KAAK,CAAC,0CAA0C,CAAC;EAC7D,IAAIoD,MAAM,CAACC,IAAI,CAAC,UAACC,CAAC;IAAA,OAAKA,CAAC,IAAI,EAAE;EAAA,EAAC,EAAE,MAAM,IAAItD,KAAK,CAAC,yBAAyB,CAAC;EAC3E,IAAImD,QAAQ,CAACE,IAAI,CAAC,UAACtF,CAAC;IAAA,OAAKA,CAAC,IAAI,EAAE;EAAA,EAAC,EAC/B,MAAM,IAAIiC,KAAK,CAAC,2BAA2B,CAAC;EAC9C,IAAIkD,OAAO,CAACG,IAAI,CAAC,UAAChF,CAAC;IAAA,OAAKA,CAAC,GAAG,EAAE;EAAA,EAAC,IAAI6E,OAAO,CAACkB,KAAK,CAAC,UAAC/F,CAAC;IAAA,OAAKA,CAAC,KAAK,EAAE;EAAA,EAAC,EAC/D,MAAM,IAAI2B,KAAK,CACb,kEACF,CAAC;EACH,IAAIqC,OAAO,IAAI,EAAE,EAAE,MAAM,IAAIrC,KAAK,CAAC,2BAA2B,CAAC;EAE/D,IAAMC,WAAW,GAAGC,kBAAQ,CAACC,UAAU,CAACL,GAAG,CAAC;EAC5C,IAAIG,WAAW,CAACG,EAAE,CAACF,kBAAQ,CAACG,IAAI,CAAC,IAAIJ,WAAW,CAAC2B,GAAG,CAAC1B,kBAAQ,CAACK,GAAG,CAAC,EAChE,MAAM,IAAIP,KAAK,CAAC,mBAAmB,CAAC;EACtC,IAAM6B,MAAM,GAAGnB,MAAM,CAACT,WAAW,CAACU,SAAS,CAAC;EAC5C,IAAMmB,MAAM,GAAGpB,MAAM,CAACT,WAAW,CAACW,WAAW,CAAC;;EAE9C;EACA,IAAM4D,GAAG,GAAGtB,OAAO,CAAC,CAAC,CAAC,GAAGC,QAAQ,CAAC,CAAC,CAAC;EACpC,IAAMsB,GAAG,GAAGvB,OAAO,CAAC,CAAC,CAAC,GAAGC,QAAQ,CAAC,CAAC,CAAC;EACpC,IAAMuB,SAAS,GAAGF,GAAG,GAAGC,GAAG,GAAG,CAAC,GAAGD,GAAG,GAAGC,GAAG,GAAG,CAAC,GAAGf,SAAS;EAE3D,IAAIiB,SAAS,GAAG,EAAE;EAClB,IAAIC,UAAU,GAAG,EAAE;EACnB,IAAMC,YAAY,GAAA/G,kBAAA,CAAOqF,QAAQ,CAAC;EAClC,IAAM2B,aAAa,GAAAhH,kBAAA,CAAOoF,OAAO,CAAC;EAElC,IAAIwB,SAAS,KAAKhB,SAAS,EAAE;IAC3B,IAAMqB,CAAC,GAAGL,SAAS;IACnB,IAAMM,CAAC,GAAG,CAAC,GAAGN,SAAS;IACvB,IAAAO,IAAA,GAAiB,CAAC/B,OAAO,CAAC6B,CAAC,CAAC,EAAE7B,OAAO,CAAC8B,CAAC,CAAC,CAAC;MAAlCE,EAAE,GAAAD,IAAA;MAAEE,EAAE,GAAAF,IAAA;IACb,IAAAG,KAAA,GAAiB,CAACjC,QAAQ,CAAC4B,CAAC,CAAC,EAAE5B,QAAQ,CAAC6B,CAAC,CAAC,CAAC;MAApCK,EAAE,GAAAD,KAAA;MAAEE,EAAE,GAAAF,KAAA;IACb,IAAAG,KAAA,GAAiB,CAACnC,MAAM,CAAC2B,CAAC,CAAC,EAAE3B,MAAM,CAAC4B,CAAC,CAAC,CAAC;MAAhCQ,EAAE,GAAAD,KAAA;MAAEE,EAAE,GAAAF,KAAA;;IAEb;IACA,IAAM5E,SAAS,GAAG,CAACuE,EAAE,GAAGI,EAAE,GAAGH,EAAE,GAAGE,EAAE,IAAIvD,MAAM,GAAG2D,EAAE;IACnD,IAAM7E,WAAW,GACf,CAACkB,MAAM,GAAGD,MAAM,IAAI2D,EAAE,IAAIH,EAAE,GAAGH,EAAE,CAAC,GAAGpD,MAAM,GAAG2D,EAAE,IAAIH,EAAE,GAAGH,EAAE,CAAC;IAC9DR,SAAS,GAAGhE,SAAS,GAAGC,WAAW;IAEnC,IAAI+D,SAAS,GAAG,EAAE,EAAE;MAClB,IAAMnE,UAAU,GAAGmE,SAAS,GAAGa,EAAE;MACjC,IAAM/E,QAAQ,GAAID,UAAU,GAAGqB,MAAM,GAAIC,MAAM;MAC/C8C,UAAU,GAAG,CAACpE,UAAU,GAAGC,QAAQ,IAAIgF,EAAE;MACzC,IAAIb,UAAU,IAAIU,EAAE,EAClB,MAAM,IAAItF,KAAK,CACb,uDACF,CAAC;MAEH6E,YAAY,CAACE,CAAC,CAAC,GAAGM,EAAE,GAAGV,SAAS;MAChCE,YAAY,CAACG,CAAC,CAAC,GAAGM,EAAE,GAAGV,UAAU;MACjCE,aAAa,CAACC,CAAC,CAAC,GAAGG,EAAE,GAAGP,SAAS;MACjCG,aAAa,CAACE,CAAC,CAAC,GAAGG,EAAE,GAAGP,UAAU;IACpC;EACF;EAEA,IAAIE,aAAa,CAACzB,IAAI,CAAC,UAAChF,CAAC;IAAA,OAAKA,CAAC,IAAI,EAAE;EAAA,EAAC,EACpC,MAAM,IAAI2B,KAAK,CAAC,gDAAgD,CAAC;EAEnE,IAAM0F,MAAM,GAAGjD,sBAAsB,CACnCqC,aAAa,EACbD,YAAY,EACZzB,MAAM,EACNf,OACF,CAAC;EAED,OAAO;IACLqC,SAAS,EAATA,SAAS;IACTC,SAAS,EAATA,SAAS;IACTC,UAAU,EAAVA,UAAU;IACVC,YAAY,EAAZA,YAAY;IACZC,aAAa,EAAbA,aAAa;IACbpC,MAAM,EAAEgD,MAAM,CAAChD,MAAM;IACrBiD,MAAM,EAAEb,aAAa,CAACnB,GAAG,CAAC,UAACtF,CAAC,EAAEmF,CAAC;MAAA,OAAKnF,CAAC,GAAGqH,MAAM,CAAChD,MAAM,CAACc,CAAC,CAAC;IAAA,EAAC;IACzDI,YAAY,EAAE8B,MAAM,CAAC9B,YAAY;IACjCjB,WAAW,EAAE+C,MAAM,CAAC/C,WAAW;IAC/BC,WAAW,EAAE8C,MAAM,CAAC9C,WAAW;IAC/BC,iBAAiB,EAAE6C,MAAM,CAAC7C;EAC5B,CAAC;AACH,CAAC","ignoreList":[]}