@webex/plugin-meetings 3.8.1-web-workers-keepalive.1 → 3.9.0-webinar5k.1

package/dist/hashTree/constants.js

@@ -0,0 +1,23 @@
+"use strict";
+
+var _Object$defineProperty = require("@babel/runtime-corejs2/core-js/object/define-property");
+_Object$defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.EMPTY_HASH = exports.DataSetNames = void 0;
+// TODO: Consider moving these to the main meetings constants file at some point
+// Only worth doing so if they are used outside of the hash tree
+
+var EMPTY_HASH = exports.EMPTY_HASH = '99aa06d3014798d86001c324468d497f';
+var DataSetNames = exports.DataSetNames = {
+  MAIN: 'main',
+  // sent to web client, contains also panelists, over LLM
+  ATTENDEES: 'attendees',
+  // NOT SENT to web client, all the attendees in the locus
+  ATD_ACTIVE: 'atd-active',
+  // only sent to panelists, over LLM; the attendees that have their hands raised or are allowed to unmute themselves
+  ATD_UNMUTED: 'atd-unmuted',
+  // sent to web client, over LLM, not sent to panelists; the attendees that are unmuted
+  SELF: 'self' // sent to web client, over Mercury
+};
+//# sourceMappingURL=constants.js.map

package/dist/hashTree/constants.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["EMPTY_HASH","exports","DataSetNames","MAIN","ATTENDEES","ATD_ACTIVE","ATD_UNMUTED","SELF"],"sources":["constants.ts"],"sourcesContent":["// TODO: Consider moving these to the main meetings constants file at some point\n// Only worth doing so if they are used outside of the hash tree\n\nexport const EMPTY_HASH = '99aa06d3014798d86001c324468d497f';\n\nexport const DataSetNames = {\n  MAIN: 'main', // sent to web client, contains also panelists, over LLM\n  ATTENDEES: 'attendees', // NOT SENT to web client, all the attendees in the locus\n  ATD_ACTIVE: 'atd-active', // only sent to panelists, over LLM; the attendees that have their hands raised or are allowed to unmute themselves\n  ATD_UNMUTED: 'atd-unmuted', // sent to web client, over LLM, not sent to panelists; the attendees that are unmuted\n  SELF: 'self', // sent to web client, over Mercury\n};\n"],"mappings":";;;;;;;AAAA;AACA;;AAEO,IAAMA,UAAU,GAAAC,OAAA,CAAAD,UAAA,GAAG,kCAAkC;AAErD,IAAME,YAAY,GAAAD,OAAA,CAAAC,YAAA,GAAG;EAC1BC,IAAI,EAAE,MAAM;EAAE;EACdC,SAAS,EAAE,WAAW;EAAE;EACxBC,UAAU,EAAE,YAAY;EAAE;EAC1BC,WAAW,EAAE,aAAa;EAAE;EAC5BC,IAAI,EAAE,MAAM,CAAE;AAChB,CAAC"}

package/dist/hashTree/hashTree.js

@@ -0,0 +1,516 @@
+"use strict";
+
+var _Array$from = require("@babel/runtime-corejs2/core-js/array/from");
+var _Symbol = require("@babel/runtime-corejs2/core-js/symbol");
+var _Symbol$iterator = require("@babel/runtime-corejs2/core-js/symbol/iterator");
+var _Array$isArray = require("@babel/runtime-corejs2/core-js/array/is-array");
+var _Object$defineProperty = require("@babel/runtime-corejs2/core-js/object/define-property");
+var _interopRequireDefault = require("@babel/runtime-corejs2/helpers/interopRequireDefault");
+_Object$defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _set = _interopRequireDefault(require("@babel/runtime-corejs2/core-js/set"));
+var _keys = _interopRequireDefault(require("@babel/runtime-corejs2/core-js/object/keys"));
+var _values = _interopRequireDefault(require("@babel/runtime-corejs2/core-js/object/values"));
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime-corejs2/helpers/toConsumableArray"));
+var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime-corejs2/helpers/classCallCheck"));
+var _createClass2 = _interopRequireDefault(require("@babel/runtime-corejs2/helpers/createClass"));
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime-corejs2/helpers/defineProperty"));
+var _xxh3Ts = require("xxh3-ts");
+var _constants = require("./constants");
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof _Symbol !== "undefined" && o[_Symbol$iterator] || o["@@iterator"]; if (!it) { if (_Array$isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return _Array$from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+/**
+ * HashTree is a data structure that organizes items into leaves based on their IDs,
+ */
+var HashTree = /*#__PURE__*/function () {
+  /**
+   * Constructs a new HashTree.
+   * @param {LeafDataItem[]} leafData Initial data to populate the tree.
+   * @param {number} numLeaves The number of leaf nodes in the tree. Must be 0 or a power of 2.
+   * @throws {Error} If numLeaves is not 0 or a power of 2.
+   */
+  function HashTree(leafData, numLeaves) {
+    (0, _classCallCheck2.default)(this, HashTree);
+    (0, _defineProperty2.default)(this, "leaves", void 0);
+    (0, _defineProperty2.default)(this, "leafHashes", void 0);
+    (0, _defineProperty2.default)(this, "numLeaves", void 0);
+    // eslint-disable-next-line no-bitwise
+    if ((numLeaves & numLeaves - 1) !== 0) {
+      throw new Error("Number of leaves must be a power of 2, saw ".concat(numLeaves));
+    }
+    this.numLeaves = numLeaves;
+    this.leafHashes = new Array(numLeaves).fill(_constants.EMPTY_HASH);
+    this.leaves = new Array(numLeaves).fill(null).map(function () {
+      return {};
+    });
+    if (leafData) {
+      this.putItems(leafData);
+    }
+  }
+
+  /**
+   * Internal logic for adding or updating an item, without computing the leaf hash.
+   * @param {LeafDataItem} item The item to add or update.
+   * @returns {{put: boolean, index: (number|null)}} Object indicating if put and the leaf index.
+   * @private
+   */
+  (0, _createClass2.default)(HashTree, [{
+    key: "_putItemInternal",
+    value: function _putItemInternal(item) {
+      if (this.numLeaves === 0) {
+        return {
+          put: false,
+          index: null
+        }; // Cannot add to a tree with 0 leaves
+      }
+
+      var index = item.id % this.numLeaves;
+      if (!this.leaves[index][item.type]) {
+        this.leaves[index][item.type] = {};
+      }
+      var existingItem = this.leaves[index][item.type][item.id];
+      if (!existingItem || existingItem.version < item.version) {
+        this.leaves[index][item.type][item.id] = item;
+        return {
+          put: true,
+          index: index
+        };
+      }
+      return {
+        put: false,
+        index: null
+      };
+    }
+
+    /**
+     * Adds or updates a single item in the hash tree.
+     * @param {LeafDataItem} item The item to add or update.
+     * @returns {boolean} True if the item was added or updated, false otherwise (e.g., older version or tree has 0 leaves).
+     */
+  }, {
+    key: "putItem",
+    value: function putItem(item) {
+      var _this$_putItemInterna = this._putItemInternal(item),
+        put = _this$_putItemInterna.put,
+        index = _this$_putItemInterna.index;
+      if (put && index !== null) {
+        this.computeLeafHash(index);
+      }
+      return put;
+    }
+
+    /**
+     * Adds or updates multiple items in the hash tree.
+     * @param {LeafDataItem[]} items The array of items to add or update.
+     * @returns {boolean[]} An array of booleans indicating success for each item.
+     */
+  }, {
+    key: "putItems",
+    value: function putItems(items) {
+      var _this = this;
+      if (this.numLeaves === 0 && items.length > 0) {
+        // Cannot add items to a tree with 0 leaves.
+        return items.map(function () {
+          return false;
+        });
+      }
+      var results = [];
+      var changedLeafIndexes = new _set.default();
+      items.forEach(function (item) {
+        var _this$_putItemInterna2 = _this._putItemInternal(item),
+          put = _this$_putItemInterna2.put,
+          index = _this$_putItemInterna2.index;
+        results.push(put);
+        if (put && index !== null) {
+          changedLeafIndexes.add(index);
+        }
+      });
+      changedLeafIndexes.forEach(function (index) {
+        _this.computeLeafHash(index);
+      });
+      return results;
+    }
+
+    /**
+     * Internal logic for removing an item, without computing the leaf hash.
+     * @param {LeafDataItem} item The item to remove.
+     * @returns {{removed: boolean, index: (number|null)}} Object indicating if removed and the leaf index.
+     * @private
+     */
+  }, {
+    key: "_removeItemInternal",
+    value: function _removeItemInternal(item) {
+      if (this.numLeaves === 0) {
+        return {
+          removed: false,
+          index: null
+        };
+      }
+      var index = item.id % this.numLeaves;
+      if (this.leaves[index] && this.leaves[index][item.type] && this.leaves[index][item.type][item.id]) {
+        var existingItem = this.leaves[index][item.type][item.id];
+        if (existingItem.id === item.id && existingItem.type === item.type && existingItem.version <= item.version) {
+          delete this.leaves[index][item.type][item.id];
+          if ((0, _keys.default)(this.leaves[index][item.type]).length === 0) {
+            delete this.leaves[index][item.type];
+          }
+          return {
+            removed: true,
+            index: index
+          };
+        }
+      }
+      return {
+        removed: false,
+        index: null
+      };
+    }
+
+    /**
+     * Removes a single item from the hash tree.
+     * The removal is based on matching type, id, and the provided item's version
+     * being greater than or equal to the existing item's version.
+     * @param {LeafDataItem} item The item to remove.
+     * @returns {boolean} True if the item was removed, false otherwise.
+     */
+  }, {
+    key: "removeItem",
+    value: function removeItem(item) {
+      var _this$_removeItemInte = this._removeItemInternal(item),
+        removed = _this$_removeItemInte.removed,
+        index = _this$_removeItemInte.index;
+      if (removed && index !== null) {
+        this.computeLeafHash(index);
+      }
+      return removed;
+    }
+
+    /**
+     * Removes multiple items from the hash tree.
+     * @param {LeafDataItem[]} items The array of items to remove.
+     * @returns {boolean[]} An array of booleans indicating success for each item.
+     */
+  }, {
+    key: "removeItems",
+    value: function removeItems(items) {
+      var _this2 = this;
+      if (this.numLeaves === 0 && items.length > 0) {
+        return items.map(function () {
+          return false;
+        });
+      }
+      var results = [];
+      var changedLeafIndexes = new _set.default();
+      items.forEach(function (item) {
+        var _this2$_removeItemInt = _this2._removeItemInternal(item),
+          removed = _this2$_removeItemInt.removed,
+          index = _this2$_removeItemInt.index;
+        results.push(removed);
+        if (removed && index !== null) {
+          changedLeafIndexes.add(index);
+        }
+      });
+      changedLeafIndexes.forEach(function (index) {
+        _this2.computeLeafHash(index);
+      });
+      return results;
+    }
+
+    /**
+     * Updates multiple items in the hash tree.
+     * This method can handle both adding and removing items based on the `operation` flag.
+     *
+     * @param {object[]} itemUpdates An array of objects containing `operation` flag and the `item` to update.
+     * @returns {boolean[]} An array of booleans indicating success for each operation.
+     */
+  }, {
+    key: "updateItems",
+    value: function updateItems(itemUpdates) {
+      var _this3 = this;
+      if (this.numLeaves === 0 && itemUpdates.length > 0) {
+        return itemUpdates.map(function () {
+          return false;
+        });
+      }
+      var results = [];
+      var changedLeafIndexes = new _set.default();
+      itemUpdates.forEach(function (_ref) {
+        var operation = _ref.operation,
+          item = _ref.item;
+        if (operation === 'remove') {
+          var _this3$_removeItemInt = _this3._removeItemInternal(item),
+            removed = _this3$_removeItemInt.removed,
+            index = _this3$_removeItemInt.index;
+          results.push(removed);
+          if (removed && index !== null) {
+            changedLeafIndexes.add(index);
+          }
+        } else {
+          var _this3$_putItemIntern = _this3._putItemInternal(item),
+            put = _this3$_putItemIntern.put,
+            _index = _this3$_putItemIntern.index;
+          results.push(put);
+          if (put && _index !== null) {
+            changedLeafIndexes.add(_index);
+          }
+        }
+      });
+      changedLeafIndexes.forEach(function (index) {
+        _this3.computeLeafHash(index);
+      });
+      return results;
+    }
+
+    /**
+     * Computes the hash for a specific leaf.
+     * The hash is based on the sorted items within the leaf.
+     * @param {number} index The index of the leaf to compute the hash for.
+     * @returns {void}
+     */
+  }, {
+    key: "computeLeafHash",
+    value: function computeLeafHash(index) {
+      var leafContent = this.leaves[index];
+      var totalItemsCount = (0, _keys.default)(leafContent).reduce(function (count, type) {
+        return count + (0, _keys.default)(leafContent[type]).length;
+      }, 0);
+      var buffer = Buffer.alloc(totalItemsCount * 16);
+      var offset = 0;
+
+      // iterate through the item types lexicographically
+      var itemTypes = (0, _keys.default)(leafContent).sort();
+      itemTypes.forEach(function (type) {
+        // iterate through the items of this type in ascending order of ID
+        var items = (0, _values.default)(leafContent[type]).sort(function (a, b) {
+          return a.id - b.id;
+        });
+
+        // add all the items id and version to the hasher
+        items.forEach(function (item) {
+          buffer.writeBigInt64LE(BigInt(item.id), offset);
+          buffer.writeBigInt64LE(BigInt(item.version), offset + 8);
+          offset += 16;
+        });
+      });
+      this.leafHashes[index] = (0, _xxh3Ts.XXH3_128)(buffer, BigInt(0)).toString(16);
+    }
+
+    /**
+     * Computes all internal and leaf node hashes of the tree.
+     * Internal node hashes are computed bottom-up from the leaf hashes.
+     * @returns {string[]} An array of hash strings, with internal node hashes first, followed by leaf hashes.
+     * Returns `[EMPTY_HASH]` if the tree has 0 leaves.
+     */
+  }, {
+    key: "computeTreeHashes",
+    value: function computeTreeHashes() {
+      if (this.numLeaves === 0) {
+        return [_constants.EMPTY_HASH];
+      }
+      var currentLevelHashes = (0, _toConsumableArray2.default)(this.leafHashes);
+      var allHashes = [];
+      while (currentLevelHashes.length > 1) {
+        var nextLevelHashes = [];
+        for (var i = 0; i < currentLevelHashes.length; i += 2) {
+          var leftHash = currentLevelHashes[i];
+          var rightHash = i + 1 < currentLevelHashes.length ? currentLevelHashes[i + 1] : leftHash;
+          var input = Buffer.concat([Buffer.from(leftHash, 'hex').subarray(0, 8).reverse(), Buffer.from(leftHash, 'hex').subarray(8, 16).reverse(), Buffer.from(rightHash, 'hex').subarray(0, 8).reverse(), Buffer.from(rightHash, 'hex').subarray(8, 16).reverse()]);
+          nextLevelHashes.push((0, _xxh3Ts.XXH3_128)(input, BigInt(0)).toString(16));
+        }
+        currentLevelHashes = nextLevelHashes;
+        allHashes.unshift.apply(allHashes, (0, _toConsumableArray2.default)(currentLevelHashes));
+      }
+      return [].concat(allHashes, (0, _toConsumableArray2.default)(this.leafHashes));
+    }
+
+    /**
+     * Returns all hashes in the tree (internal nodes then leaf nodes).
+     * @returns {string[]} An array of hash strings.
+     */
+  }, {
+    key: "getHashes",
+    value: function getHashes() {
+      return this.computeTreeHashes();
+    }
+
+    /**
+     * Computes and returns the hash value of the root node.
+     * @returns {string} The root hash of the entire tree. Returns `EMPTY_HASH` if the tree has 0 leaves.
+     */
+  }, {
+    key: "getRootHash",
+    value: function getRootHash() {
+      if (this.numLeaves === 0) {
+        return _constants.EMPTY_HASH;
+      }
+      return this.computeTreeHashes()[0];
+    }
+
+    /**
+     * Gets the number of leaves in the tree.
+     * @returns {number} The number of leaves.
+     */
+  }, {
+    key: "getLeafCount",
+    value: function getLeafCount() {
+      return this.numLeaves;
+    }
+
+    /**
+     * Calculates the total number of items stored in the tree.
+     * @returns {number} The total number of items.
+     */
+  }, {
+    key: "getTotalItemCount",
+    value: function getTotalItemCount() {
+      var count = 0;
+      var _iterator = _createForOfIteratorHelper(this.leaves),
+        _step;
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var leaf = _step.value;
+          for (var _i = 0, _Object$keys2 = (0, _keys.default)(leaf); _i < _Object$keys2.length; _i++) {
+            var type = _Object$keys2[_i];
+            count += (0, _keys.default)(leaf[type]).length;
+          }
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+      return count;
+    }
+
+    /**
+     * Retrieves all data items from a specific leaf.
+     * @param {number} leafIndex The index of the leaf.
+     * @returns {LeafDataItem[]} An array of LeafDataItem in the specified leaf, sorted by ID,
+     * or an empty array if the index is invalid or leaf is empty.
+     */
+  }, {
+    key: "getLeafData",
+    value: function getLeafData(leafIndex) {
+      if (leafIndex < 0 || leafIndex >= this.numLeaves) {
+        return [];
+      }
+      var leafContent = this.leaves[leafIndex];
+      var items = [];
+      for (var _i2 = 0, _Object$keys3 = (0, _keys.default)(leafContent); _i2 < _Object$keys3.length; _i2++) {
+        var type = _Object$keys3[_i2];
+        items.push.apply(items, (0, _toConsumableArray2.default)((0, _values.default)(leafContent[type])));
+      }
+      // Optionally sort them if a specific order is required, e.g., by ID
+      items.sort(function (a, b) {
+        return a.id - b.id;
+      });
+      return items;
+    }
+
+    /**
+     * Resizes the HashTree to have a new number of leaf nodes, redistributing all existing items.
+     * @param {number} newNumLeaves The new number of leaf nodes (must be 0 or a power of 2).
+     * @returns {boolean} true if the tree was resized, false if the size didn't change.
+     * @throws {Error} if newNumLeaves is not 0 or a power of 2.
+     */
+  }, {
+    key: "resize",
+    value: function resize(newNumLeaves) {
+      // eslint-disable-next-line no-bitwise
+      if (newNumLeaves < 0 || newNumLeaves !== 0 && (newNumLeaves & newNumLeaves - 1) !== 0) {
+        throw new Error('New number of leaves must be 0 or a power of 2');
+      }
+      if (newNumLeaves === this.numLeaves) {
+        return false;
+      }
+      var allItems = [];
+      var _iterator2 = _createForOfIteratorHelper(this.leaves),
+        _step2;
+      try {
+        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+          var leaf = _step2.value;
+          for (var _i3 = 0, _Object$keys4 = (0, _keys.default)(leaf); _i3 < _Object$keys4.length; _i3++) {
+            var type = _Object$keys4[_i3];
+            allItems.push.apply(allItems, (0, _toConsumableArray2.default)((0, _values.default)(leaf[type])));
+          }
+        }
+
+        // Re-initialize
+        // eslint-disable-next-line no-extra-semi
+      } catch (err) {
+        _iterator2.e(err);
+      } finally {
+        _iterator2.f();
+      }
+      this.numLeaves = newNumLeaves; // Type assertion to update readonly property
+      this.leafHashes = new Array(newNumLeaves).fill(_constants.EMPTY_HASH);
+      this.leaves = new Array(newNumLeaves).fill(null).map(function () {
+        return {};
+      });
+      if (newNumLeaves > 0) {
+        this.putItems(allItems); // Re-add items which will be re-assigned to leaves and re-hashed
+      }
+
+      return true;
+    }
+
+    /**
+     * Compares the tree's leaf hashes with an external set of hashes and returns the indices of differing leaf nodes.
+     * The externalHashes array is expected to contain all node hashes (internal followed by leaves),
+     * similar to the output of getHashes().
+     * @param {string[]} externalHashes An array of hash strings (internal node hashes then leaf hashes).
+     * @returns {number[]} An array of indices of the leaf nodes that have different hashes.
+     */
+  }, {
+    key: "diffHashes",
+    value: function diffHashes(externalHashes) {
+      if (this.numLeaves === 0) {
+        // If this tree is empty, its hash is EMPTY_HASH.
+        // It differs if externalHashes is not a single EMPTY_HASH.
+        if (externalHashes && externalHashes.length === 1 && externalHashes[0] === _constants.EMPTY_HASH) {
+          return []; // No differences
+        }
+        // An empty tree has no leaves to differ, so return an empty array
+        // as no specific leaf indexes are different.
+
+        return [];
+      }
+
+      // todo: why is this not taking advantage of the tree structure and comparing from the root down?
+
+      // We are interested in comparing the leaf hashes part.
+      // The externalHashes array should also have its leaf hashes at the end.
+      var differingLeafIndexes = [];
+      // Calculate where the leaf hashes would start in the externalHashes array,
+      // assuming it has the same number of leaves as this tree.
+      var externalLeafHashesStart = externalHashes.length - this.numLeaves;
+      if (externalLeafHashesStart < 0) {
+        // externalHashes is too short to contain a complete set of leaf hashes
+        // corresponding to this tree's numLeaves.
+        // In this case, consider all of this tree's leaves as "different".
+        for (var i = 0; i < this.numLeaves; i += 1) {
+          differingLeafIndexes.push(i);
+        }
+        return differingLeafIndexes;
+      }
+
+      // Compare each leaf hash
+      for (var _i4 = 0; _i4 < this.numLeaves; _i4 += 1) {
+        var ownLeafHash = this.leafHashes[_i4];
+        // externalLeafHash might be undefined if externalHashes is shorter than expected
+        // but externalLeafHashesStart was non-negative, implying a structural mismatch.
+        var externalLeafHash = externalHashes[externalLeafHashesStart + _i4];
+        if (ownLeafHash !== externalLeafHash) {
+          differingLeafIndexes.push(_i4);
+        }
+      }
+      return differingLeafIndexes;
+    }
+  }]);
+  return HashTree;
+}();
+var _default = exports.default = HashTree;
+//# sourceMappingURL=hashTree.js.map

package/dist/hashTree/hashTree.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["_xxh3Ts","require","_constants","_createForOfIteratorHelper","o","allowArrayLike","it","_Symbol","_Symbol$iterator","_Array$isArray","_unsupportedIterableToArray","length","i","F","s","n","done","value","e","_e","f","TypeError","normalCompletion","didErr","err","call","step","next","_e2","return","minLen","_arrayLikeToArray","Object","prototype","toString","slice","constructor","name","_Array$from","test","arr","len","arr2","Array","HashTree","leafData","numLeaves","_classCallCheck2","default","_defineProperty2","Error","concat","leafHashes","fill","EMPTY_HASH","leaves","map","putItems","_createClass2","key","_putItemInternal","item","put","index","id","type","existingItem","version","putItem","_this$_putItemInterna","computeLeafHash","items","_this","results","changedLeafIndexes","_set","forEach","_this$_putItemInterna2","push","add","_removeItemInternal","removed","_keys","removeItem","_this$_removeItemInte","removeItems","_this2","_this2$_removeItemInt","updateItems","itemUpdates","_this3","_ref","operation","_this3$_removeItemInt","_this3$_putItemIntern","leafContent","totalItemsCount","reduce","count","buffer","Buffer","alloc","offset","itemTypes","sort","_values","a","b","writeBigInt64LE","BigInt","XXH3_128","computeTreeHashes","currentLevelHashes","_toConsumableArray2","allHashes","nextLevelHashes","leftHash","rightHash","input","from","subarray","reverse","unshift","apply","getHashes","getRootHash","getLeafCount","getTotalItemCount","_iterator","_step","leaf","_i","_Object$keys2","getLeafData","leafIndex","_i2","_Object$keys3","resize","newNumLeaves","allItems","_iterator2","_step2","_i3","_Object$keys4","diffHashes","externalHashes","differingLeafIndexes","externalLeafHashesStart","ownLeafHash","externalLeafHash","_default","exports"],"sources":["hashTree.ts"],"sourcesContent":["import {XXH3_128} from 'xxh3-ts';\nimport {EMPTY_HASH} from './constants';\n\nexport type LeafDataItem = {\n  type: string;\n  id: number;\n  version: number;\n};\n\n/**\n * HashTree is a data structure that organizes items into leaves based on their IDs,\n */\nclass HashTree {\n  leaves: Array<Record<string, Record<number, LeafDataItem>>>;\n\n  leafHashes: Array<string>;\n  readonly numLeaves: number;\n\n  /**\n   * Constructs a new HashTree.\n   * @param {LeafDataItem[]} leafData Initial data to populate the tree.\n   * @param {number} numLeaves The number of leaf nodes in the tree. Must be 0 or a power of 2.\n   * @throws {Error} If numLeaves is not 0 or a power of 2.\n   */\n  constructor(leafData: LeafDataItem[], numLeaves: number) {\n    // eslint-disable-next-line no-bitwise\n    if ((numLeaves & (numLeaves - 1)) !== 0) {\n      throw new Error(`Number of leaves must be a power of 2, saw ${numLeaves}`);\n    }\n\n    this.numLeaves = numLeaves;\n    this.leafHashes = new Array(numLeaves).fill(EMPTY_HASH);\n\n    this.leaves = new Array(numLeaves).fill(null).map(() => {\n      return {};\n    });\n\n    if (leafData) {\n      this.putItems(leafData);\n    }\n  }\n\n  /**\n   * Internal logic for adding or updating an item, without computing the leaf hash.\n   * @param {LeafDataItem} item The item to add or update.\n   * @returns {{put: boolean, index: (number|null)}} Object indicating if put and the leaf index.\n   * @private\n   */\n  private _putItemInternal(item: LeafDataItem): {put: boolean; index: number | null} {\n    if (this.numLeaves === 0) {\n      return {put: false, index: null}; // Cannot add to a tree with 0 leaves\n    }\n\n    const index = item.id % this.numLeaves;\n\n    if (!this.leaves[index][item.type]) {\n      this.leaves[index][item.type] = {};\n    }\n\n    const existingItem = this.leaves[index][item.type][item.id];\n\n    if (!existingItem || existingItem.version < item.version) {\n      this.leaves[index][item.type][item.id] = item;\n\n      return {put: true, index};\n    }\n\n    return {put: false, index: null};\n  }\n\n  /**\n   * Adds or updates a single item in the hash tree.\n   * @param {LeafDataItem} item The item to add or update.\n   * @returns {boolean} True if the item was added or updated, false otherwise (e.g., older version or tree has 0 leaves).\n   */\n  putItem(item: LeafDataItem): boolean {\n    const {put, index} = this._putItemInternal(item);\n\n    if (put && index !== null) {\n      this.computeLeafHash(index);\n    }\n\n    return put;\n  }\n\n  /**\n   * Adds or updates multiple items in the hash tree.\n   * @param {LeafDataItem[]} items The array of items to add or update.\n   * @returns {boolean[]} An array of booleans indicating success for each item.\n   */\n  putItems(items: LeafDataItem[]): boolean[] {\n    if (this.numLeaves === 0 && items.length > 0) {\n      // Cannot add items to a tree with 0 leaves.\n      return items.map(() => false);\n    }\n    const results: boolean[] = [];\n    const changedLeafIndexes = new Set<number>();\n\n    items.forEach((item) => {\n      const {put, index} = this._putItemInternal(item);\n      results.push(put);\n      if (put && index !== null) {\n        changedLeafIndexes.add(index);\n      }\n    });\n\n    changedLeafIndexes.forEach((index) => {\n      this.computeLeafHash(index);\n    });\n\n    return results;\n  }\n\n  /**\n   * Internal logic for removing an item, without computing the leaf hash.\n   * @param {LeafDataItem} item The item to remove.\n   * @returns {{removed: boolean, index: (number|null)}} Object indicating if removed and the leaf index.\n   * @private\n   */\n  private _removeItemInternal(item: LeafDataItem): {removed: boolean; index: number | null} {\n    if (this.numLeaves === 0) {\n      return {removed: false, index: null};\n    }\n\n    const index = item.id % this.numLeaves;\n\n    if (\n      this.leaves[index] &&\n      this.leaves[index][item.type] &&\n      this.leaves[index][item.type][item.id]\n    ) {\n      const existingItem = this.leaves[index][item.type][item.id];\n      if (\n        existingItem.id === item.id &&\n        existingItem.type === item.type &&\n        existingItem.version <= item.version\n      ) {\n        delete this.leaves[index][item.type][item.id];\n        if (Object.keys(this.leaves[index][item.type]).length === 0) {\n          delete this.leaves[index][item.type];\n        }\n\n        return {removed: true, index};\n      }\n    }\n\n    return {removed: false, index: null};\n  }\n\n  /**\n   * Removes a single item from the hash tree.\n   * The removal is based on matching type, id, and the provided item's version\n   * being greater than or equal to the existing item's version.\n   * @param {LeafDataItem} item The item to remove.\n   * @returns {boolean} True if the item was removed, false otherwise.\n   */\n  removeItem(item: LeafDataItem): boolean {\n    const {removed, index} = this._removeItemInternal(item);\n\n    if (removed && index !== null) {\n      this.computeLeafHash(index);\n    }\n\n    return removed;\n  }\n\n  /**\n   * Removes multiple items from the hash tree.\n   * @param {LeafDataItem[]} items The array of items to remove.\n   * @returns {boolean[]} An array of booleans indicating success for each item.\n   */\n  removeItems(items: LeafDataItem[]): boolean[] {\n    if (this.numLeaves === 0 && items.length > 0) {\n      return items.map(() => false);\n    }\n\n    const results: boolean[] = [];\n    const changedLeafIndexes = new Set<number>();\n\n    items.forEach((item) => {\n      const {removed, index} = this._removeItemInternal(item);\n      results.push(removed);\n      if (removed && index !== null) {\n        changedLeafIndexes.add(index);\n      }\n    });\n\n    changedLeafIndexes.forEach((index) => {\n      this.computeLeafHash(index);\n    });\n\n    return results;\n  }\n\n  /**\n   * Updates multiple items in the hash tree.\n   * This method can handle both adding and removing items based on the `operation` flag.\n   *\n   * @param {object[]} itemUpdates An array of objects containing `operation` flag and the `item` to update.\n   * @returns {boolean[]} An array of booleans indicating success for each operation.\n   */\n  updateItems(itemUpdates: {operation: 'update' | 'remove'; item: LeafDataItem}[]): boolean[] {\n    if (this.numLeaves === 0 && itemUpdates.length > 0) {\n      return itemUpdates.map(() => false);\n    }\n\n    const results: boolean[] = [];\n    const changedLeafIndexes = new Set<number>();\n\n    itemUpdates.forEach(({operation, item}) => {\n      if (operation === 'remove') {\n        const {removed, index} = this._removeItemInternal(item);\n        results.push(removed);\n        if (removed && index !== null) {\n          changedLeafIndexes.add(index);\n        }\n      } else {\n        const {put, index} = this._putItemInternal(item);\n        results.push(put);\n        if (put && index !== null) {\n          changedLeafIndexes.add(index);\n        }\n      }\n    });\n\n    changedLeafIndexes.forEach((index) => {\n      this.computeLeafHash(index);\n    });\n\n    return results;\n  }\n\n  /**\n   * Computes the hash for a specific leaf.\n   * The hash is based on the sorted items within the leaf.\n   * @param {number} index The index of the leaf to compute the hash for.\n   * @returns {void}\n   */\n  computeLeafHash(index: number) {\n    const leafContent = this.leaves[index];\n\n    const totalItemsCount = Object.keys(leafContent).reduce((count, type) => {\n      return count + Object.keys(leafContent[type]).length;\n    }, 0);\n    const buffer = Buffer.alloc(totalItemsCount * 16);\n\n    let offset = 0;\n\n    // iterate through the item types lexicographically\n    const itemTypes = Object.keys(leafContent).sort();\n    itemTypes.forEach((type) => {\n      // iterate through the items of this type in ascending order of ID\n      const items = Object.values(leafContent[type]).sort(\n        (a: LeafDataItem, b: LeafDataItem) => a.id - b.id\n      );\n\n      // add all the items id and version to the hasher\n      items.forEach((item: LeafDataItem) => {\n        buffer.writeBigInt64LE(BigInt(item.id), offset);\n        buffer.writeBigInt64LE(BigInt(item.version), offset + 8);\n\n        offset += 16;\n      });\n    });\n\n    this.leafHashes[index] = XXH3_128(buffer, BigInt(0)).toString(16);\n  }\n\n  /**\n   * Computes all internal and leaf node hashes of the tree.\n   * Internal node hashes are computed bottom-up from the leaf hashes.\n   * @returns {string[]} An array of hash strings, with internal node hashes first, followed by leaf hashes.\n   * Returns `[EMPTY_HASH]` if the tree has 0 leaves.\n   */\n  computeTreeHashes(): string[] {\n    if (this.numLeaves === 0) {\n      return [EMPTY_HASH];\n    }\n\n    let currentLevelHashes = [...this.leafHashes];\n    const allHashes = [];\n\n    while (currentLevelHashes.length > 1) {\n      const nextLevelHashes: string[] = [];\n      for (let i = 0; i < currentLevelHashes.length; i += 2) {\n        const leftHash = currentLevelHashes[i];\n        const rightHash = i + 1 < currentLevelHashes.length ? currentLevelHashes[i + 1] : leftHash;\n\n        const input = Buffer.concat([\n          Buffer.from(leftHash, 'hex').subarray(0, 8).reverse(),\n          Buffer.from(leftHash, 'hex').subarray(8, 16).reverse(),\n          Buffer.from(rightHash, 'hex').subarray(0, 8).reverse(),\n          Buffer.from(rightHash, 'hex').subarray(8, 16).reverse(),\n        ]);\n\n        nextLevelHashes.push(XXH3_128(input, BigInt(0)).toString(16));\n      }\n      currentLevelHashes = nextLevelHashes;\n      allHashes.unshift(...currentLevelHashes);\n    }\n\n    return [...allHashes, ...this.leafHashes];\n  }\n\n  /**\n   * Returns all hashes in the tree (internal nodes then leaf nodes).\n   * @returns {string[]} An array of hash strings.\n   */\n  getHashes(): string[] {\n    return this.computeTreeHashes();\n  }\n\n  /**\n   * Computes and returns the hash value of the root node.\n   * @returns {string} The root hash of the entire tree. Returns `EMPTY_HASH` if the tree has 0 leaves.\n   */\n  getRootHash(): string {\n    if (this.numLeaves === 0) {\n      return EMPTY_HASH;\n    }\n\n    return this.computeTreeHashes()[0];\n  }\n\n  /**\n   * Gets the number of leaves in the tree.\n   * @returns {number} The number of leaves.\n   */\n  getLeafCount(): number {\n    return this.numLeaves;\n  }\n\n  /**\n   * Calculates the total number of items stored in the tree.\n   * @returns {number} The total number of items.\n   */\n  getTotalItemCount(): number {\n    let count = 0;\n    for (const leaf of this.leaves) {\n      for (const type of Object.keys(leaf)) {\n        count += Object.keys(leaf[type]).length;\n      }\n    }\n\n    return count;\n  }\n\n  /**\n   * Retrieves all data items from a specific leaf.\n   * @param {number} leafIndex The index of the leaf.\n   * @returns {LeafDataItem[]} An array of LeafDataItem in the specified leaf, sorted by ID,\n   * or an empty array if the index is invalid or leaf is empty.\n   */\n  getLeafData(leafIndex: number): LeafDataItem[] {\n    if (leafIndex < 0 || leafIndex >= this.numLeaves) {\n      return [];\n    }\n    const leafContent = this.leaves[leafIndex];\n    const items: LeafDataItem[] = [];\n    for (const type of Object.keys(leafContent)) {\n      items.push(...Object.values(leafContent[type]));\n    }\n    // Optionally sort them if a specific order is required, e.g., by ID\n    items.sort((a, b) => a.id - b.id);\n\n    return items;\n  }\n\n  /**\n   * Resizes the HashTree to have a new number of leaf nodes, redistributing all existing items.\n   * @param {number} newNumLeaves The new number of leaf nodes (must be 0 or a power of 2).\n   * @returns {boolean} true if the tree was resized, false if the size didn't change.\n   * @throws {Error} if newNumLeaves is not 0 or a power of 2.\n   */\n  resize(newNumLeaves: number): boolean {\n    // eslint-disable-next-line no-bitwise\n    if (newNumLeaves < 0 || (newNumLeaves !== 0 && (newNumLeaves & (newNumLeaves - 1)) !== 0)) {\n      throw new Error('New number of leaves must be 0 or a power of 2');\n    }\n\n    if (newNumLeaves === this.numLeaves) {\n      return false;\n    }\n\n    const allItems: LeafDataItem[] = [];\n    for (const leaf of this.leaves) {\n      for (const type of Object.keys(leaf)) {\n        allItems.push(...Object.values(leaf[type]));\n      }\n    }\n\n    // Re-initialize\n    // eslint-disable-next-line no-extra-semi\n    (this as any).numLeaves = newNumLeaves; // Type assertion to update readonly property\n    this.leafHashes = new Array(newNumLeaves).fill(EMPTY_HASH);\n    this.leaves = new Array(newNumLeaves).fill(null).map(() => ({}));\n\n    if (newNumLeaves > 0) {\n      this.putItems(allItems); // Re-add items which will be re-assigned to leaves and re-hashed\n    }\n\n    return true;\n  }\n\n  /**\n   * Compares the tree's leaf hashes with an external set of hashes and returns the indices of differing leaf nodes.\n   * The externalHashes array is expected to contain all node hashes (internal followed by leaves),\n   * similar to the output of getHashes().\n   * @param {string[]} externalHashes An array of hash strings (internal node hashes then leaf hashes).\n   * @returns {number[]} An array of indices of the leaf nodes that have different hashes.\n   */\n  diffHashes(externalHashes: string[]): number[] {\n    if (this.numLeaves === 0) {\n      // If this tree is empty, its hash is EMPTY_HASH.\n      // It differs if externalHashes is not a single EMPTY_HASH.\n      if (externalHashes && externalHashes.length === 1 && externalHashes[0] === EMPTY_HASH) {\n        return []; // No differences\n      }\n      // An empty tree has no leaves to differ, so return an empty array\n      // as no specific leaf indexes are different.\n\n      return [];\n    }\n\n    // todo: why is this not taking advantage of the tree structure and comparing from the root down?\n\n    // We are interested in comparing the leaf hashes part.\n    // The externalHashes array should also have its leaf hashes at the end.\n    const differingLeafIndexes: number[] = [];\n    // Calculate where the leaf hashes would start in the externalHashes array,\n    // assuming it has the same number of leaves as this tree.\n    const externalLeafHashesStart = externalHashes.length - this.numLeaves;\n\n    if (externalLeafHashesStart < 0) {\n      // externalHashes is too short to contain a complete set of leaf hashes\n      // corresponding to this tree's numLeaves.\n      // In this case, consider all of this tree's leaves as \"different\".\n      for (let i = 0; i < this.numLeaves; i += 1) {\n        differingLeafIndexes.push(i);\n      }\n\n      return differingLeafIndexes;\n    }\n\n    // Compare each leaf hash\n    for (let i = 0; i < this.numLeaves; i += 1) {\n      const ownLeafHash = this.leafHashes[i];\n      // externalLeafHash might be undefined if externalHashes is shorter than expected\n      // but externalLeafHashesStart was non-negative, implying a structural mismatch.\n      const externalLeafHash = externalHashes[externalLeafHashesStart + i];\n      if (ownLeafHash !== externalLeafHash) {\n        differingLeafIndexes.push(i);\n      }\n    }\n\n    return differingLeafIndexes;\n  }\n}\n\nexport default HashTree;\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AACA,IAAAC,UAAA,GAAAD,OAAA;AAAuC,SAAAE,2BAAAC,CAAA,EAAAC,cAAA,QAAAC,EAAA,UAAAC,OAAA,oBAAAH,CAAA,CAAAI,gBAAA,KAAAJ,CAAA,qBAAAE,EAAA,QAAAG,cAAA,CAAAL,CAAA,MAAAE,EAAA,GAAAI,2BAAA,CAAAN,CAAA,MAAAC,cAAA,IAAAD,CAAA,WAAAA,CAAA,CAAAO,MAAA,qBAAAL,EAAA,EAAAF,CAAA,GAAAE,EAAA,MAAAM,CAAA,UAAAC,CAAA,YAAAA,EAAA,eAAAC,CAAA,EAAAD,CAAA,EAAAE,CAAA,WAAAA,EAAA,QAAAH,CAAA,IAAAR,CAAA,CAAAO,MAAA,WAAAK,IAAA,mBAAAA,IAAA,SAAAC,KAAA,EAAAb,CAAA,CAAAQ,CAAA,UAAAM,CAAA,WAAAA,EAAAC,EAAA,UAAAA,EAAA,KAAAC,CAAA,EAAAP,CAAA,gBAAAQ,SAAA,iJAAAC,gBAAA,SAAAC,MAAA,UAAAC,GAAA,WAAAV,CAAA,WAAAA,EAAA,IAAAR,EAAA,GAAAA,EAAA,CAAAmB,IAAA,CAAArB,CAAA,MAAAW,CAAA,WAAAA,EAAA,QAAAW,IAAA,GAAApB,EAAA,CAAAqB,IAAA,IAAAL,gBAAA,GAAAI,IAAA,CAAAV,IAAA,SAAAU,IAAA,KAAAR,CAAA,WAAAA,EAAAU,GAAA,IAAAL,MAAA,SAAAC,GAAA,GAAAI,GAAA,KAAAR,CAAA,WAAAA,EAAA,eAAAE,gBAAA,IAAAhB,EAAA,CAAAuB,MAAA,UAAAvB,EAAA,CAAAuB,MAAA,oBAAAN,MAAA,QAAAC,GAAA;AAAA,SAAAd,4BAAAN,CAAA,EAAA0B,MAAA,SAAA1B,CAAA,qBAAAA,CAAA,sBAAA2B,iBAAA,CAAA3B,CAAA,EAAA0B,MAAA,OAAAf,CAAA,GAAAiB,MAAA,CAAAC,SAAA,CAAAC,QAAA,CAAAT,IAAA,CAAArB,CAAA,EAAA+B,KAAA,aAAApB,CAAA,iBAAAX,CAAA,CAAAgC,WAAA,EAAArB,CAAA,GAAAX,CAAA,CAAAgC,WAAA,CAAAC,IAAA,MAAAtB,CAAA,cAAAA,CAAA,mBAAAuB,WAAA,CAAAlC,CAAA,OAAAW,CAAA,+DAAAwB,IAAA,CAAAxB,CAAA,UAAAgB,iBAAA,CAAA3B,CAAA,EAAA0B,MAAA;AAAA,SAAAC,kBAAAS,GAAA,EAAAC,GAAA,QAAAA,GAAA,YAAAA,GAAA,GAAAD,GAAA,CAAA7B,MAAA,EAAA8B,GAAA,GAAAD,GAAA,CAAA7B,MAAA,WAAAC,CAAA,MAAA8B,IAAA,OAAAC,KAAA,CAAAF,GAAA,GAAA7B,CAAA,GAAA6B,GAAA,EAAA7B,CAAA,IAAA8B,IAAA,CAAA9B,CAAA,IAAA4B,GAAA,CAAA5B,CAAA,UAAA8B,IAAA;AAQvC;AACA;AACA;AAFA,IAGME,QAAQ;EAMZ;AACF;AACA;AACA;AACA;AACA;EACE,SAAAA,SAAYC,QAAwB,EAAEC,SAAiB,EAAE;IAAA,IAAAC,gBAAA,CAAAC,OAAA,QAAAJ,QAAA;IAAA,IAAAK,gBAAA,CAAAD,OAAA;IAAA,IAAAC,gBAAA,CAAAD,OAAA;IAAA,IAAAC,gBAAA,CAAAD,OAAA;IACvD;IACA,IAAI,CAACF,SAAS,GAAIA,SAAS,GAAG,CAAE,MAAM,CAAC,EAAE;MACvC,MAAM,IAAII,KAAK,+CAAAC,MAAA,CAA+CL,SAAS,CAAE,CAAC;IAC5E;IAEA,IAAI,CAACA,SAAS,GAAGA,SAAS;IAC1B,IAAI,CAACM,UAAU,GAAG,IAAIT,KAAK,CAACG,SAAS,CAAC,CAACO,IAAI,CAACC,qBAAU,CAAC;IAEvD,IAAI,CAACC,MAAM,GAAG,IAAIZ,KAAK,CAACG,SAAS,CAAC,CAACO,IAAI,CAAC,IAAI,CAAC,CAACG,GAAG,CAAC,YAAM;MACtD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IAEF,IAAIX,QAAQ,EAAE;MACZ,IAAI,CAACY,QAAQ,CAACZ,QAAQ,CAAC;IACzB;EACF;;EAEA;AACF;AACA;AACA;AACA;AACA;EALE,IAAAa,aAAA,CAAAV,OAAA,EAAAJ,QAAA;IAAAe,GAAA;IAAA1C,KAAA,EAMA,SAAA2C,iBAAyBC,IAAkB,EAAwC;MACjF,IAAI,IAAI,CAACf,SAAS,KAAK,CAAC,EAAE;QACxB,OAAO;UAACgB,GAAG,EAAE,KAAK;UAAEC,KAAK,EAAE;QAAI,CAAC,CAAC,CAAC;MACpC;;MAEA,IAAMA,KAAK,GAAGF,IAAI,CAACG,EAAE,GAAG,IAAI,CAAClB,SAAS;MAEtC,IAAI,CAAC,IAAI,CAACS,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC,EAAE;QAClC,IAAI,CAACV,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC,GAAG,CAAC,CAAC;MACpC;MAEA,IAAMC,YAAY,GAAG,IAAI,CAACX,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC,CAACJ,IAAI,CAACG,EAAE,CAAC;MAE3D,IAAI,CAACE,YAAY,IAAIA,YAAY,CAACC,OAAO,GAAGN,IAAI,CAACM,OAAO,EAAE;QACxD,IAAI,CAACZ,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC,CAACJ,IAAI,CAACG,EAAE,CAAC,GAAGH,IAAI;QAE7C,OAAO;UAACC,GAAG,EAAE,IAAI;UAAEC,KAAK,EAALA;QAAK,CAAC;MAC3B;MAEA,OAAO;QAACD,GAAG,EAAE,KAAK;QAAEC,KAAK,EAAE;MAAI,CAAC;IAClC;;IAEA;AACF;AACA;AACA;AACA;EAJE;IAAAJ,GAAA;IAAA1C,KAAA,EAKA,SAAAmD,QAAQP,IAAkB,EAAW;MACnC,IAAAQ,qBAAA,GAAqB,IAAI,CAACT,gBAAgB,CAACC,IAAI,CAAC;QAAzCC,GAAG,GAAAO,qBAAA,CAAHP,GAAG;QAAEC,KAAK,GAAAM,qBAAA,CAALN,KAAK;MAEjB,IAAID,GAAG,IAAIC,KAAK,KAAK,IAAI,EAAE;QACzB,IAAI,CAACO,eAAe,CAACP,KAAK,CAAC;MAC7B;MAEA,OAAOD,GAAG;IACZ;;IAEA;AACF;AACA;AACA;AACA;EAJE;IAAAH,GAAA;IAAA1C,KAAA,EAKA,SAAAwC,SAASc,KAAqB,EAAa;MAAA,IAAAC,KAAA;MACzC,IAAI,IAAI,CAAC1B,SAAS,KAAK,CAAC,IAAIyB,KAAK,CAAC5D,MAAM,GAAG,CAAC,EAAE;QAC5C;QACA,OAAO4D,KAAK,CAACf,GAAG,CAAC;UAAA,OAAM,KAAK;QAAA,EAAC;MAC/B;MACA,IAAMiB,OAAkB,GAAG,EAAE;MAC7B,IAAMC,kBAAkB,GAAG,IAAAC,IAAA,CAAA3B,OAAA,CAAgB,CAAC;MAE5CuB,KAAK,CAACK,OAAO,CAAC,UAACf,IAAI,EAAK;QACtB,IAAAgB,sBAAA,GAAqBL,KAAI,CAACZ,gBAAgB,CAACC,IAAI,CAAC;UAAzCC,GAAG,GAAAe,sBAAA,CAAHf,GAAG;UAAEC,KAAK,GAAAc,sBAAA,CAALd,KAAK;QACjBU,OAAO,CAACK,IAAI,CAAChB,GAAG,CAAC;QACjB,IAAIA,GAAG,IAAIC,KAAK,KAAK,IAAI,EAAE;UACzBW,kBAAkB,CAACK,GAAG,CAAChB,KAAK,CAAC;QAC/B;MACF,CAAC,CAAC;MAEFW,kBAAkB,CAACE,OAAO,CAAC,UAACb,KAAK,EAAK;QACpCS,KAAI,CAACF,eAAe,CAACP,KAAK,CAAC;MAC7B,CAAC,CAAC;MAEF,OAAOU,OAAO;IAChB;;IAEA;AACF;AACA;AACA;AACA;AACA;EALE;IAAAd,GAAA;IAAA1C,KAAA,EAMA,SAAA+D,oBAA4BnB,IAAkB,EAA4C;MACxF,IAAI,IAAI,CAACf,SAAS,KAAK,CAAC,EAAE;QACxB,OAAO;UAACmC,OAAO,EAAE,KAAK;UAAElB,KAAK,EAAE;QAAI,CAAC;MACtC;MAEA,IAAMA,KAAK,GAAGF,IAAI,CAACG,EAAE,GAAG,IAAI,CAAClB,SAAS;MAEtC,IACE,IAAI,CAACS,MAAM,CAACQ,KAAK,CAAC,IAClB,IAAI,CAACR,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC,IAC7B,IAAI,CAACV,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC,CAACJ,IAAI,CAACG,EAAE,CAAC,EACtC;QACA,IAAME,YAAY,GAAG,IAAI,CAACX,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC,CAACJ,IAAI,CAACG,EAAE,CAAC;QAC3D,IACEE,YAAY,CAACF,EAAE,KAAKH,IAAI,CAACG,EAAE,IAC3BE,YAAY,CAACD,IAAI,KAAKJ,IAAI,CAACI,IAAI,IAC/BC,YAAY,CAACC,OAAO,IAAIN,IAAI,CAACM,OAAO,EACpC;UACA,OAAO,IAAI,CAACZ,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC,CAACJ,IAAI,CAACG,EAAE,CAAC;UAC7C,IAAI,IAAAkB,KAAA,CAAAlC,OAAA,EAAY,IAAI,CAACO,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC,CAAC,CAACtD,MAAM,KAAK,CAAC,EAAE;YAC3D,OAAO,IAAI,CAAC4C,MAAM,CAACQ,KAAK,CAAC,CAACF,IAAI,CAACI,IAAI,CAAC;UACtC;UAEA,OAAO;YAACgB,OAAO,EAAE,IAAI;YAAElB,KAAK,EAALA;UAAK,CAAC;QAC/B;MACF;MAEA,OAAO;QAACkB,OAAO,EAAE,KAAK;QAAElB,KAAK,EAAE;MAAI,CAAC;IACtC;;IAEA;AACF;AACA;AACA;AACA;AACA;AACA;EANE;IAAAJ,GAAA;IAAA1C,KAAA,EAOA,SAAAkE,WAAWtB,IAAkB,EAAW;MACtC,IAAAuB,qBAAA,GAAyB,IAAI,CAACJ,mBAAmB,CAACnB,IAAI,CAAC;QAAhDoB,OAAO,GAAAG,qBAAA,CAAPH,OAAO;QAAElB,KAAK,GAAAqB,qBAAA,CAALrB,KAAK;MAErB,IAAIkB,OAAO,IAAIlB,KAAK,KAAK,IAAI,EAAE;QAC7B,IAAI,CAACO,eAAe,CAACP,KAAK,CAAC;MAC7B;MAEA,OAAOkB,OAAO;IAChB;;IAEA;AACF;AACA;AACA;AACA;EAJE;IAAAtB,GAAA;IAAA1C,KAAA,EAKA,SAAAoE,YAAYd,KAAqB,EAAa;MAAA,IAAAe,MAAA;MAC5C,IAAI,IAAI,CAACxC,SAAS,KAAK,CAAC,IAAIyB,KAAK,CAAC5D,MAAM,GAAG,CAAC,EAAE;QAC5C,OAAO4D,KAAK,CAACf,GAAG,CAAC;UAAA,OAAM,KAAK;QAAA,EAAC;MAC/B;MAEA,IAAMiB,OAAkB,GAAG,EAAE;MAC7B,IAAMC,kBAAkB,GAAG,IAAAC,IAAA,CAAA3B,OAAA,CAAgB,CAAC;MAE5CuB,KAAK,CAACK,OAAO,CAAC,UAACf,IAAI,EAAK;QACtB,IAAA0B,qBAAA,GAAyBD,MAAI,CAACN,mBAAmB,CAACnB,IAAI,CAAC;UAAhDoB,OAAO,GAAAM,qBAAA,CAAPN,OAAO;UAAElB,KAAK,GAAAwB,qBAAA,CAALxB,KAAK;QACrBU,OAAO,CAACK,IAAI,CAACG,OAAO,CAAC;QACrB,IAAIA,OAAO,IAAIlB,KAAK,KAAK,IAAI,EAAE;UAC7BW,kBAAkB,CAACK,GAAG,CAAChB,KAAK,CAAC;QAC/B;MACF,CAAC,CAAC;MAEFW,kBAAkB,CAACE,OAAO,CAAC,UAACb,KAAK,EAAK;QACpCuB,MAAI,CAAChB,eAAe,CAACP,KAAK,CAAC;MAC7B,CAAC,CAAC;MAEF,OAAOU,OAAO;IAChB;;IAEA;AACF;AACA;AACA;AACA;AACA;AACA;EANE;IAAAd,GAAA;IAAA1C,KAAA,EAOA,SAAAuE,YAAYC,WAAmE,EAAa;MAAA,IAAAC,MAAA;MAC1F,IAAI,IAAI,CAAC5C,SAAS,KAAK,CAAC,IAAI2C,WAAW,CAAC9E,MAAM,GAAG,CAAC,EAAE;QAClD,OAAO8E,WAAW,CAACjC,GAAG,CAAC;UAAA,OAAM,KAAK;QAAA,EAAC;MACrC;MAEA,IAAMiB,OAAkB,GAAG,EAAE;MAC7B,IAAMC,kBAAkB,GAAG,IAAAC,IAAA,CAAA3B,OAAA,CAAgB,CAAC;MAE5CyC,WAAW,CAACb,OAAO,CAAC,UAAAe,IAAA,EAAuB;QAAA,IAArBC,SAAS,GAAAD,IAAA,CAATC,SAAS;UAAE/B,IAAI,GAAA8B,IAAA,CAAJ9B,IAAI;QACnC,IAAI+B,SAAS,KAAK,QAAQ,EAAE;UAC1B,IAAAC,qBAAA,GAAyBH,MAAI,CAACV,mBAAmB,CAACnB,IAAI,CAAC;YAAhDoB,OAAO,GAAAY,qBAAA,CAAPZ,OAAO;YAAElB,KAAK,GAAA8B,qBAAA,CAAL9B,KAAK;UACrBU,OAAO,CAACK,IAAI,CAACG,OAAO,CAAC;UACrB,IAAIA,OAAO,IAAIlB,KAAK,KAAK,IAAI,EAAE;YAC7BW,kBAAkB,CAACK,GAAG,CAAChB,KAAK,CAAC;UAC/B;QACF,CAAC,MAAM;UACL,IAAA+B,qBAAA,GAAqBJ,MAAI,CAAC9B,gBAAgB,CAACC,IAAI,CAAC;YAAzCC,GAAG,GAAAgC,qBAAA,CAAHhC,GAAG;YAAEC,MAAK,GAAA+B,qBAAA,CAAL/B,KAAK;UACjBU,OAAO,CAACK,IAAI,CAAChB,GAAG,CAAC;UACjB,IAAIA,GAAG,IAAIC,MAAK,KAAK,IAAI,EAAE;YACzBW,kBAAkB,CAACK,GAAG,CAAChB,MAAK,CAAC;UAC/B;QACF;MACF,CAAC,CAAC;MAEFW,kBAAkB,CAACE,OAAO,CAAC,UAACb,KAAK,EAAK;QACpC2B,MAAI,CAACpB,eAAe,CAACP,KAAK,CAAC;MAC7B,CAAC,CAAC;MAEF,OAAOU,OAAO;IAChB;;IAEA;AACF;AACA;AACA;AACA;AACA;EALE;IAAAd,GAAA;IAAA1C,KAAA,EAMA,SAAAqD,gBAAgBP,KAAa,EAAE;MAC7B,IAAMgC,WAAW,GAAG,IAAI,CAACxC,MAAM,CAACQ,KAAK,CAAC;MAEtC,IAAMiC,eAAe,GAAG,IAAAd,KAAA,CAAAlC,OAAA,EAAY+C,WAAW,CAAC,CAACE,MAAM,CAAC,UAACC,KAAK,EAAEjC,IAAI,EAAK;QACvE,OAAOiC,KAAK,GAAG,IAAAhB,KAAA,CAAAlC,OAAA,EAAY+C,WAAW,CAAC9B,IAAI,CAAC,CAAC,CAACtD,MAAM;MACtD,CAAC,EAAE,CAAC,CAAC;MACL,IAAMwF,MAAM,GAAGC,MAAM,CAACC,KAAK,CAACL,eAAe,GAAG,EAAE,CAAC;MAEjD,IAAIM,MAAM,GAAG,CAAC;;MAEd;MACA,IAAMC,SAAS,GAAG,IAAArB,KAAA,CAAAlC,OAAA,EAAY+C,WAAW,CAAC,CAACS,IAAI,CAAC,CAAC;MACjDD,SAAS,CAAC3B,OAAO,CAAC,UAACX,IAAI,EAAK;QAC1B;QACA,IAAMM,KAAK,GAAG,IAAAkC,OAAA,CAAAzD,OAAA,EAAc+C,WAAW,CAAC9B,IAAI,CAAC,CAAC,CAACuC,IAAI,CACjD,UAACE,CAAe,EAAEC,CAAe;UAAA,OAAKD,CAAC,CAAC1C,EAAE,GAAG2C,CAAC,CAAC3C,EAAE;QAAA,CACnD,CAAC;;QAED;QACAO,KAAK,CAACK,OAAO,CAAC,UAACf,IAAkB,EAAK;UACpCsC,MAAM,CAACS,eAAe,CAACC,MAAM,CAAChD,IAAI,CAACG,EAAE,CAAC,EAAEsC,MAAM,CAAC;UAC/CH,MAAM,CAACS,eAAe,CAACC,MAAM,CAAChD,IAAI,CAACM,OAAO,CAAC,EAAEmC,MAAM,GAAG,CAAC,CAAC;UAExDA,MAAM,IAAI,EAAE;QACd,CAAC,CAAC;MACJ,CAAC,CAAC;MAEF,IAAI,CAAClD,UAAU,CAACW,KAAK,CAAC,GAAG,IAAA+C,gBAAQ,EAACX,MAAM,EAAEU,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC3E,QAAQ,CAAC,EAAE,CAAC;IACnE;;IAEA;AACF;AACA;AACA;AACA;AACA;EALE;IAAAyB,GAAA;IAAA1C,KAAA,EAMA,SAAA8F,kBAAA,EAA8B;MAC5B,IAAI,IAAI,CAACjE,SAAS,KAAK,CAAC,EAAE;QACxB,OAAO,CAACQ,qBAAU,CAAC;MACrB;MAEA,IAAI0D,kBAAkB,OAAAC,mBAAA,CAAAjE,OAAA,EAAO,IAAI,CAACI,UAAU,CAAC;MAC7C,IAAM8D,SAAS,GAAG,EAAE;MAEpB,OAAOF,kBAAkB,CAACrG,MAAM,GAAG,CAAC,EAAE;QACpC,IAAMwG,eAAyB,GAAG,EAAE;QACpC,KAAK,IAAIvG,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoG,kBAAkB,CAACrG,MAAM,EAAEC,CAAC,IAAI,CAAC,EAAE;UACrD,IAAMwG,QAAQ,GAAGJ,kBAAkB,CAACpG,CAAC,CAAC;UACtC,IAAMyG,SAAS,GAAGzG,CAAC,GAAG,CAAC,GAAGoG,kBAAkB,CAACrG,MAAM,GAAGqG,kBAAkB,CAACpG,CAAC,GAAG,CAAC,CAAC,GAAGwG,QAAQ;UAE1F,IAAME,KAAK,GAAGlB,MAAM,CAACjD,MAAM,CAAC,CAC1BiD,MAAM,CAACmB,IAAI,CAACH,QAAQ,EAAE,KAAK,CAAC,CAACI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAACC,OAAO,CAAC,CAAC,EACrDrB,MAAM,CAACmB,IAAI,CAACH,QAAQ,EAAE,KAAK,CAAC,CAACI,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAACC,OAAO,CAAC,CAAC,EACtDrB,MAAM,CAACmB,IAAI,CAACF,SAAS,EAAE,KAAK,CAAC,CAACG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAACC,OAAO,CAAC,CAAC,EACtDrB,MAAM,CAACmB,IAAI,CAACF,SAAS,EAAE,KAAK,CAAC,CAACG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAACC,OAAO,CAAC,CAAC,CACxD,CAAC;UAEFN,eAAe,CAACrC,IAAI,CAAC,IAAAgC,gBAAQ,EAACQ,KAAK,EAAET,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC3E,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC/D;QACA8E,kBAAkB,GAAGG,eAAe;QACpCD,SAAS,CAACQ,OAAO,CAAAC,KAAA,CAAjBT,SAAS,MAAAD,mBAAA,CAAAjE,OAAA,EAAYgE,kBAAkB,EAAC;MAC1C;MAEA,UAAA7D,MAAA,CAAW+D,SAAS,MAAAD,mBAAA,CAAAjE,OAAA,EAAK,IAAI,CAACI,UAAU;IAC1C;;IAEA;AACF;AACA;AACA;EAHE;IAAAO,GAAA;IAAA1C,KAAA,EAIA,SAAA2G,UAAA,EAAsB;MACpB,OAAO,IAAI,CAACb,iBAAiB,CAAC,CAAC;IACjC;;IAEA;AACF;AACA;AACA;EAHE;IAAApD,GAAA;IAAA1C,KAAA,EAIA,SAAA4G,YAAA,EAAsB;MACpB,IAAI,IAAI,CAAC/E,SAAS,KAAK,CAAC,EAAE;QACxB,OAAOQ,qBAAU;MACnB;MAEA,OAAO,IAAI,CAACyD,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC;;IAEA;AACF;AACA;AACA;EAHE;IAAApD,GAAA;IAAA1C,KAAA,EAIA,SAAA6G,aAAA,EAAuB;MACrB,OAAO,IAAI,CAAChF,SAAS;IACvB;;IAEA;AACF;AACA;AACA;EAHE;IAAAa,GAAA;IAAA1C,KAAA,EAIA,SAAA8G,kBAAA,EAA4B;MAC1B,IAAI7B,KAAK,GAAG,CAAC;MAAC,IAAA8B,SAAA,GAAA7H,0BAAA,CACK,IAAI,CAACoD,MAAM;QAAA0E,KAAA;MAAA;QAA9B,KAAAD,SAAA,CAAAlH,CAAA,MAAAmH,KAAA,GAAAD,SAAA,CAAAjH,CAAA,IAAAC,IAAA,GAAgC;UAAA,IAArBkH,IAAI,GAAAD,KAAA,CAAAhH,KAAA;UACb,SAAAkH,EAAA,MAAAC,aAAA,GAAmB,IAAAlD,KAAA,CAAAlC,OAAA,EAAYkF,IAAI,CAAC,EAAAC,EAAA,GAAAC,aAAA,CAAAzH,MAAA,EAAAwH,EAAA,IAAE;YAAjC,IAAMlE,IAAI,GAAAmE,aAAA,CAAAD,EAAA;YACbjC,KAAK,IAAI,IAAAhB,KAAA,CAAAlC,OAAA,EAAYkF,IAAI,CAACjE,IAAI,CAAC,CAAC,CAACtD,MAAM;UACzC;QACF;MAAC,SAAAa,GAAA;QAAAwG,SAAA,CAAA9G,CAAA,CAAAM,GAAA;MAAA;QAAAwG,SAAA,CAAA5G,CAAA;MAAA;MAED,OAAO8E,KAAK;IACd;;IAEA;AACF;AACA;AACA;AACA;AACA;EALE;IAAAvC,GAAA;IAAA1C,KAAA,EAMA,SAAAoH,YAAYC,SAAiB,EAAkB;MAC7C,IAAIA,SAAS,GAAG,CAAC,IAAIA,SAAS,IAAI,IAAI,CAACxF,SAAS,EAAE;QAChD,OAAO,EAAE;MACX;MACA,IAAMiD,WAAW,GAAG,IAAI,CAACxC,MAAM,CAAC+E,SAAS,CAAC;MAC1C,IAAM/D,KAAqB,GAAG,EAAE;MAChC,SAAAgE,GAAA,MAAAC,aAAA,GAAmB,IAAAtD,KAAA,CAAAlC,OAAA,EAAY+C,WAAW,CAAC,EAAAwC,GAAA,GAAAC,aAAA,CAAA7H,MAAA,EAAA4H,GAAA,IAAE;QAAxC,IAAMtE,IAAI,GAAAuE,aAAA,CAAAD,GAAA;QACbhE,KAAK,CAACO,IAAI,CAAA6C,KAAA,CAAVpD,KAAK,MAAA0C,mBAAA,CAAAjE,OAAA,EAAS,IAAAyD,OAAA,CAAAzD,OAAA,EAAc+C,WAAW,CAAC9B,IAAI,CAAC,CAAC,EAAC;MACjD;MACA;MACAM,KAAK,CAACiC,IAAI,CAAC,UAACE,CAAC,EAAEC,CAAC;QAAA,OAAKD,CAAC,CAAC1C,EAAE,GAAG2C,CAAC,CAAC3C,EAAE;MAAA,EAAC;MAEjC,OAAOO,KAAK;IACd;;IAEA;AACF;AACA;AACA;AACA;AACA;EALE;IAAAZ,GAAA;IAAA1C,KAAA,EAMA,SAAAwH,OAAOC,YAAoB,EAAW;MACpC;MACA,IAAIA,YAAY,GAAG,CAAC,IAAKA,YAAY,KAAK,CAAC,IAAI,CAACA,YAAY,GAAIA,YAAY,GAAG,CAAE,MAAM,CAAE,EAAE;QACzF,MAAM,IAAIxF,KAAK,CAAC,gDAAgD,CAAC;MACnE;MAEA,IAAIwF,YAAY,KAAK,IAAI,CAAC5F,SAAS,EAAE;QACnC,OAAO,KAAK;MACd;MAEA,IAAM6F,QAAwB,GAAG,EAAE;MAAC,IAAAC,UAAA,GAAAzI,0BAAA,CACjB,IAAI,CAACoD,MAAM;QAAAsF,MAAA;MAAA;QAA9B,KAAAD,UAAA,CAAA9H,CAAA,MAAA+H,MAAA,GAAAD,UAAA,CAAA7H,CAAA,IAAAC,IAAA,GAAgC;UAAA,IAArBkH,IAAI,GAAAW,MAAA,CAAA5H,KAAA;UACb,SAAA6H,GAAA,MAAAC,aAAA,GAAmB,IAAA7D,KAAA,CAAAlC,OAAA,EAAYkF,IAAI,CAAC,EAAAY,GAAA,GAAAC,aAAA,CAAApI,MAAA,EAAAmI,GAAA,IAAE;YAAjC,IAAM7E,IAAI,GAAA8E,aAAA,CAAAD,GAAA;YACbH,QAAQ,CAAC7D,IAAI,CAAA6C,KAAA,CAAbgB,QAAQ,MAAA1B,mBAAA,CAAAjE,OAAA,EAAS,IAAAyD,OAAA,CAAAzD,OAAA,EAAckF,IAAI,CAACjE,IAAI,CAAC,CAAC,EAAC;UAC7C;QACF;;QAEA;QACA;MAAA,SAAAzC,GAAA;QAAAoH,UAAA,CAAA1H,CAAA,CAAAM,GAAA;MAAA;QAAAoH,UAAA,CAAAxH,CAAA;MAAA;MACC,IAAI,CAAS0B,SAAS,GAAG4F,YAAY,CAAC,CAAC;MACxC,IAAI,CAACtF,UAAU,GAAG,IAAIT,KAAK,CAAC+F,YAAY,CAAC,CAACrF,IAAI,CAACC,qBAAU,CAAC;MAC1D,IAAI,CAACC,MAAM,GAAG,IAAIZ,KAAK,CAAC+F,YAAY,CAAC,CAACrF,IAAI,CAAC,IAAI,CAAC,CAACG,GAAG,CAAC;QAAA,OAAO,CAAC,CAAC;MAAA,CAAC,CAAC;MAEhE,IAAIkF,YAAY,GAAG,CAAC,EAAE;QACpB,IAAI,CAACjF,QAAQ,CAACkF,QAAQ,CAAC,CAAC,CAAC;MAC3B;;MAEA,OAAO,IAAI;IACb;;IAEA;AACF;AACA;AACA;AACA;AACA;AACA;EANE;IAAAhF,GAAA;IAAA1C,KAAA,EAOA,SAAA+H,WAAWC,cAAwB,EAAY;MAC7C,IAAI,IAAI,CAACnG,SAAS,KAAK,CAAC,EAAE;QACxB;QACA;QACA,IAAImG,cAAc,IAAIA,cAAc,CAACtI,MAAM,KAAK,CAAC,IAAIsI,cAAc,CAAC,CAAC,CAAC,KAAK3F,qBAAU,EAAE;UACrF,OAAO,EAAE,CAAC,CAAC;QACb;QACA;QACA;;QAEA,OAAO,EAAE;MACX;;MAEA;;MAEA;MACA;MACA,IAAM4F,oBAA8B,GAAG,EAAE;MACzC;MACA;MACA,IAAMC,uBAAuB,GAAGF,cAAc,CAACtI,MAAM,GAAG,IAAI,CAACmC,SAAS;MAEtE,IAAIqG,uBAAuB,GAAG,CAAC,EAAE;QAC/B;QACA;QACA;QACA,KAAK,IAAIvI,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACkC,SAAS,EAAElC,CAAC,IAAI,CAAC,EAAE;UAC1CsI,oBAAoB,CAACpE,IAAI,CAAClE,CAAC,CAAC;QAC9B;QAEA,OAAOsI,oBAAoB;MAC7B;;MAEA;MACA,KAAK,IAAItI,GAAC,GAAG,CAAC,EAAEA,GAAC,GAAG,IAAI,CAACkC,SAAS,EAAElC,GAAC,IAAI,CAAC,EAAE;QAC1C,IAAMwI,WAAW,GAAG,IAAI,CAAChG,UAAU,CAACxC,GAAC,CAAC;QACtC;QACA;QACA,IAAMyI,gBAAgB,GAAGJ,cAAc,CAACE,uBAAuB,GAAGvI,GAAC,CAAC;QACpE,IAAIwI,WAAW,KAAKC,gBAAgB,EAAE;UACpCH,oBAAoB,CAACpE,IAAI,CAAClE,GAAC,CAAC;QAC9B;MACF;MAEA,OAAOsI,oBAAoB;IAC7B;EAAC;EAAA,OAAAtG,QAAA;AAAA;AAAA,IAAA0G,QAAA,GAAAC,OAAA,CAAAvG,OAAA,GAGYJ,QAAQ"}