@unwanted/matrix-sdk-mini 34.12.0-1

package/lib/models/MSC3089TreeSpace.js

@@ -0,0 +1,520 @@
+import _asyncToGenerator from "@babel/runtime/helpers/asyncToGenerator";
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+/*
+Copyright 2021 The Matrix.org Foundation C.I.C.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+import promiseRetry from "p-retry";
+import { EventType, MsgType, UNSTABLE_MSC3089_BRANCH, UNSTABLE_MSC3089_LEAF } from "../@types/event.js";
+import { logger } from "../logger.js";
+import { averageBetweenStrings, DEFAULT_ALPHABET, lexicographicCompare, nextString, prevString, simpleRetryOperation } from "../utils.js";
+import { MSC3089Branch } from "./MSC3089Branch.js";
+import { KnownMembership } from "../@types/membership.js";
+/**
+ * The recommended defaults for a tree space's power levels. Note that this
+ * is UNSTABLE and subject to breaking changes without notice.
+ */
+export var DEFAULT_TREE_POWER_LEVELS_TEMPLATE = {
+  // Owner
+  invite: 100,
+  kick: 100,
+  ban: 100,
+  // Editor
+  redact: 50,
+  state_default: 50,
+  events_default: 50,
+  // Viewer
+  users_default: 0,
+  // Mixed
+  events: {
+    [EventType.RoomPowerLevels]: 100,
+    [EventType.RoomHistoryVisibility]: 100,
+    [EventType.RoomTombstone]: 100,
+    [EventType.RoomEncryption]: 100,
+    [EventType.RoomName]: 50,
+    [EventType.RoomMessage]: 50,
+    [EventType.RoomMessageEncrypted]: 50,
+    [EventType.Sticker]: 50
+  },
+  users: {} // defined by calling code
+};
+
+/**
+ * Ease-of-use representation for power levels represented as simple roles.
+ * Note that this is UNSTABLE and subject to breaking changes without notice.
+ */
+export var TreePermissions = /*#__PURE__*/function (TreePermissions) {
+  TreePermissions["Viewer"] = "viewer";
+  TreePermissions["Editor"] = "editor";
+  TreePermissions["Owner"] = "owner";
+  return TreePermissions;
+}({}); // "Admin" or PL100
+/**
+ * Represents a [MSC3089](https://github.com/matrix-org/matrix-doc/pull/3089)
+ * file tree Space. Note that this is UNSTABLE and subject to breaking changes
+ * without notice.
+ */
+export class MSC3089TreeSpace {
+  constructor(client, roomId) {
+    this.client = client;
+    this.roomId = roomId;
+    _defineProperty(this, "room", void 0);
+    this.room = this.client.getRoom(this.roomId);
+    if (!this.room) throw new Error("Unknown room");
+  }
+
+  /**
+   * Syntactic sugar for room ID of the Space.
+   */
+  get id() {
+    return this.roomId;
+  }
+
+  /**
+   * Whether or not this is a top level space.
+   */
+  get isTopLevel() {
+    // XXX: This is absolutely not how you find out if the space is top level
+    // but is safe for a managed usecase like we offer in the SDK.
+    var parentEvents = this.room.currentState.getStateEvents(EventType.SpaceParent);
+    if (!(parentEvents !== null && parentEvents !== void 0 && parentEvents.length)) return true;
+    return parentEvents.every(e => {
+      var _e$getContent;
+      return !((_e$getContent = e.getContent()) !== null && _e$getContent !== void 0 && _e$getContent["via"]);
+    });
+  }
+
+  /**
+   * Sets the name of the tree space.
+   * @param name - The new name for the space.
+   * @returns Promise which resolves when complete.
+   */
+  setName(name) {
+    var _this = this;
+    return _asyncToGenerator(function* () {
+      yield _this.client.sendStateEvent(_this.roomId, EventType.RoomName, {
+        name
+      }, "");
+    })();
+  }
+
+  /**
+   * Invites a user to the tree space. They will be given the default Viewer
+   * permission level unless specified elsewhere.
+   * @param userId - The user ID to invite.
+   * @param andSubspaces - True (default) to invite the user to all
+   * directories/subspaces too, recursively.
+   * @returns Promise which resolves when complete.
+   */
+  invite(userId) {
+    var _arguments = arguments,
+      _this2 = this;
+    return _asyncToGenerator(function* () {
+      var andSubspaces = _arguments.length > 1 && _arguments[1] !== undefined ? _arguments[1] : true;
+      var promises = [_this2.retryInvite(userId)];
+      if (andSubspaces) {
+        promises.push(..._this2.getDirectories().map(d => d.invite(userId, andSubspaces)));
+      }
+      yield Promise.all(promises);
+    })();
+  }
+  retryInvite(userId) {
+    var _this3 = this;
+    return simpleRetryOperation(/*#__PURE__*/_asyncToGenerator(function* () {
+      yield _this3.client.invite(_this3.roomId, userId).catch(e => {
+        // We don't want to retry permission errors forever...
+        if ((e === null || e === void 0 ? void 0 : e.errcode) === "M_FORBIDDEN") {
+          throw new promiseRetry.AbortError(e);
+        }
+        throw e;
+      });
+    }));
+  }
+
+  /**
+   * Sets the permissions of a user to the given role. Note that if setting a user
+   * to Owner then they will NOT be able to be demoted. If the user does not have
+   * permission to change the power level of the target, an error will be thrown.
+   * @param userId - The user ID to change the role of.
+   * @param role - The role to assign.
+   * @returns Promise which resolves when complete.
+   */
+  setPermissions(userId, role) {
+    var _this4 = this;
+    return _asyncToGenerator(function* () {
+      var _pls$events;
+      var currentPls = _this4.room.currentState.getStateEvents(EventType.RoomPowerLevels, "");
+      if (Array.isArray(currentPls)) throw new Error("Unexpected return type for power levels");
+      var pls = (currentPls === null || currentPls === void 0 ? void 0 : currentPls.getContent()) || {};
+      var viewLevel = pls["users_default"] || 0;
+      var editLevel = pls["events_default"] || 50;
+      var adminLevel = ((_pls$events = pls["events"]) === null || _pls$events === void 0 ? void 0 : _pls$events[EventType.RoomPowerLevels]) || 100;
+      var users = pls["users"] || {};
+      switch (role) {
+        case TreePermissions.Viewer:
+          users[userId] = viewLevel;
+          break;
+        case TreePermissions.Editor:
+          users[userId] = editLevel;
+          break;
+        case TreePermissions.Owner:
+          users[userId] = adminLevel;
+          break;
+        default:
+          throw new Error("Invalid role: " + role);
+      }
+      pls["users"] = users;
+      yield _this4.client.sendStateEvent(_this4.roomId, EventType.RoomPowerLevels, pls, "");
+    })();
+  }
+
+  /**
+   * Gets the current permissions of a user. Note that any users missing explicit permissions (or not
+   * in the space) will be considered Viewers. Appropriate membership checks need to be performed
+   * elsewhere.
+   * @param userId - The user ID to check permissions of.
+   * @returns The permissions for the user, defaulting to Viewer.
+   */
+  getPermissions(userId) {
+    var _pls$events2, _pls$users;
+    var currentPls = this.room.currentState.getStateEvents(EventType.RoomPowerLevels, "");
+    if (Array.isArray(currentPls)) throw new Error("Unexpected return type for power levels");
+    var pls = (currentPls === null || currentPls === void 0 ? void 0 : currentPls.getContent()) || {};
+    var viewLevel = pls["users_default"] || 0;
+    var editLevel = pls["events_default"] || 50;
+    var adminLevel = ((_pls$events2 = pls["events"]) === null || _pls$events2 === void 0 ? void 0 : _pls$events2[EventType.RoomPowerLevels]) || 100;
+    var userLevel = ((_pls$users = pls["users"]) === null || _pls$users === void 0 ? void 0 : _pls$users[userId]) || viewLevel;
+    if (userLevel >= adminLevel) return TreePermissions.Owner;
+    if (userLevel >= editLevel) return TreePermissions.Editor;
+    return TreePermissions.Viewer;
+  }
+
+  /**
+   * Creates a directory under this tree space, represented as another tree space.
+   * @param name - The name for the directory.
+   * @returns Promise which resolves to the created directory.
+   */
+  createDirectory(name) {
+    var _this5 = this;
+    return _asyncToGenerator(function* () {
+      var directory = yield _this5.client.unstableCreateFileTree(name);
+      yield _this5.client.sendStateEvent(_this5.roomId, EventType.SpaceChild, {
+        via: [_this5.client.getDomain()]
+      }, directory.roomId);
+      yield _this5.client.sendStateEvent(directory.roomId, EventType.SpaceParent, {
+        via: [_this5.client.getDomain()]
+      }, _this5.roomId);
+      return directory;
+    })();
+  }
+
+  /**
+   * Gets a list of all known immediate subdirectories to this tree space.
+   * @returns The tree spaces (directories). May be empty, but not null.
+   */
+  getDirectories() {
+    var trees = [];
+    var children = this.room.currentState.getStateEvents(EventType.SpaceChild);
+    for (var child of children) {
+      try {
+        var stateKey = child.getStateKey();
+        if (stateKey) {
+          var tree = this.client.unstableGetFileTreeSpace(stateKey);
+          if (tree) trees.push(tree);
+        }
+      } catch (e) {
+        logger.warn("Unable to create tree space instance for listing. Are we joined?", e);
+      }
+    }
+    return trees;
+  }
+
+  /**
+   * Gets a subdirectory of a given ID under this tree space. Note that this will not recurse
+   * into children and instead only look one level deep.
+   * @param roomId - The room ID (directory ID) to find.
+   * @returns The directory, or undefined if not found.
+   */
+  getDirectory(roomId) {
+    return this.getDirectories().find(r => r.roomId === roomId);
+  }
+
+  /**
+   * Deletes the tree, kicking all members and deleting **all subdirectories**.
+   * @returns Promise which resolves when complete.
+   */
+  delete() {
+    var _this6 = this;
+    return _asyncToGenerator(function* () {
+      var subdirectories = _this6.getDirectories();
+      for (var dir of subdirectories) {
+        yield dir.delete();
+      }
+      var kickMemberships = [KnownMembership.Invite, KnownMembership.Knock, KnownMembership.Join];
+      var members = _this6.room.currentState.getStateEvents(EventType.RoomMember);
+      for (var member of members) {
+        var isNotUs = member.getStateKey() !== _this6.client.getUserId();
+        if (isNotUs && kickMemberships.includes(member.getContent().membership)) {
+          var stateKey = member.getStateKey();
+          if (!stateKey) {
+            throw new Error("State key not found for branch");
+          }
+          yield _this6.client.kick(_this6.roomId, stateKey, "Room deleted");
+        }
+      }
+      yield _this6.client.leave(_this6.roomId);
+    })();
+  }
+  getOrderedChildren(children) {
+    var ordered = children.map(c => ({
+      roomId: c.getStateKey(),
+      order: c.getContent()["order"]
+    })).filter(c => c.roomId);
+    ordered.sort((a, b) => {
+      if (a.order && !b.order) {
+        return -1;
+      } else if (!a.order && b.order) {
+        return 1;
+      } else if (!a.order && !b.order) {
+        var _roomA$currentState$g, _roomA$currentState$g2, _roomB$currentState$g, _roomB$currentState$g2;
+        var roomA = this.client.getRoom(a.roomId);
+        var roomB = this.client.getRoom(b.roomId);
+        if (!roomA || !roomB) {
+          // just don't bother trying to do more partial sorting
+          return lexicographicCompare(a.roomId, b.roomId);
+        }
+        var createTsA = (_roomA$currentState$g = (_roomA$currentState$g2 = roomA.currentState.getStateEvents(EventType.RoomCreate, "")) === null || _roomA$currentState$g2 === void 0 ? void 0 : _roomA$currentState$g2.getTs()) !== null && _roomA$currentState$g !== void 0 ? _roomA$currentState$g : 0;
+        var createTsB = (_roomB$currentState$g = (_roomB$currentState$g2 = roomB.currentState.getStateEvents(EventType.RoomCreate, "")) === null || _roomB$currentState$g2 === void 0 ? void 0 : _roomB$currentState$g2.getTs()) !== null && _roomB$currentState$g !== void 0 ? _roomB$currentState$g : 0;
+        if (createTsA === createTsB) {
+          return lexicographicCompare(a.roomId, b.roomId);
+        }
+        return createTsA - createTsB;
+      } else {
+        // both not-null orders
+        return lexicographicCompare(a.order, b.order);
+      }
+    });
+    return ordered;
+  }
+  getParentRoom() {
+    var parents = this.room.currentState.getStateEvents(EventType.SpaceParent);
+    var parent = parents[0]; // XXX: Wild assumption
+    if (!parent) throw new Error("Expected to have a parent in a non-top level space");
+
+    // XXX: We are assuming the parent is a valid tree space.
+    // We probably don't need to validate the parent room state for this usecase though.
+    var stateKey = parent.getStateKey();
+    if (!stateKey) throw new Error("No state key found for parent");
+    var parentRoom = this.client.getRoom(stateKey);
+    if (!parentRoom) throw new Error("Unable to locate room for parent");
+    return parentRoom;
+  }
+
+  /**
+   * Gets the current order index for this directory. Note that if this is the top level space
+   * then -1 will be returned.
+   * @returns The order index of this space.
+   */
+  getOrder() {
+    if (this.isTopLevel) return -1;
+    var parentRoom = this.getParentRoom();
+    var children = parentRoom.currentState.getStateEvents(EventType.SpaceChild);
+    var ordered = this.getOrderedChildren(children);
+    return ordered.findIndex(c => c.roomId === this.roomId);
+  }
+
+  /**
+   * Sets the order index for this directory within its parent. Note that if this is a top level
+   * space then an error will be thrown. -1 can be used to move the child to the start, and numbers
+   * larger than the number of children can be used to move the child to the end.
+   * @param index - The new order index for this space.
+   * @returns Promise which resolves when complete.
+   * @throws Throws if this is a top level space.
+   */
+  setOrder(index) {
+    var _this7 = this;
+    return _asyncToGenerator(function* () {
+      var _currentChild$getCont2;
+      if (_this7.isTopLevel) throw new Error("Cannot set order of top level spaces currently");
+      var parentRoom = _this7.getParentRoom();
+      var children = parentRoom.currentState.getStateEvents(EventType.SpaceChild);
+      var ordered = _this7.getOrderedChildren(children);
+      index = Math.max(Math.min(index, ordered.length - 1), 0);
+      var currentIndex = _this7.getOrder();
+      var movingUp = currentIndex < index;
+      if (movingUp && index === ordered.length - 1) {
+        index--;
+      } else if (!movingUp && index === 0) {
+        index++;
+      }
+      var prev = ordered[movingUp ? index : index - 1];
+      var next = ordered[movingUp ? index + 1 : index];
+      var newOrder = DEFAULT_ALPHABET[0];
+      var ensureBeforeIsSane = false;
+      if (!prev) {
+        // Move to front
+        if (next !== null && next !== void 0 && next.order) {
+          newOrder = prevString(next.order);
+        }
+      } else if (index === ordered.length - 1) {
+        // Move to back
+        if (next !== null && next !== void 0 && next.order) {
+          newOrder = nextString(next.order);
+        }
+      } else {
+        // Move somewhere in the middle
+        var startOrder = prev === null || prev === void 0 ? void 0 : prev.order;
+        var endOrder = next === null || next === void 0 ? void 0 : next.order;
+        if (startOrder && endOrder) {
+          if (startOrder === endOrder) {
+            // Error case: just move +1 to break out of awful math
+            newOrder = nextString(startOrder);
+          } else {
+            newOrder = averageBetweenStrings(startOrder, endOrder);
+          }
+        } else {
+          if (startOrder) {
+            // We're at the end (endOrder is null, so no explicit order)
+            newOrder = nextString(startOrder);
+          } else if (endOrder) {
+            // We're at the start (startOrder is null, so nothing before us)
+            newOrder = prevString(endOrder);
+          } else {
+            // Both points are unknown. We're likely in a range where all the children
+            // don't have particular order values, so we may need to update them too.
+            // The other possibility is there's only us as a child, but we should have
+            // shown up in the other states.
+            ensureBeforeIsSane = true;
+          }
+        }
+      }
+      if (ensureBeforeIsSane) {
+        // We were asked by the order algorithm to prepare the moving space for a landing
+        // in the undefined order part of the order array, which means we need to update the
+        // spaces that come before it with a stable order value.
+        var lastOrder;
+        for (var i = 0; i <= index; i++) {
+          var target = ordered[i];
+          if (i === 0) {
+            lastOrder = target.order;
+          }
+          if (!target.order) {
+            var _currentChild$getCont;
+            // XXX: We should be creating gaps to avoid conflicts
+            lastOrder = lastOrder ? nextString(lastOrder) : DEFAULT_ALPHABET[0];
+            var _currentChild = parentRoom.currentState.getStateEvents(EventType.SpaceChild, target.roomId);
+            var _content = (_currentChild$getCont = _currentChild === null || _currentChild === void 0 ? void 0 : _currentChild.getContent()) !== null && _currentChild$getCont !== void 0 ? _currentChild$getCont : {
+              via: [_this7.client.getDomain()]
+            };
+            yield _this7.client.sendStateEvent(parentRoom.roomId, EventType.SpaceChild, _objectSpread(_objectSpread({}, _content), {}, {
+              order: lastOrder
+            }), target.roomId);
+          } else {
+            lastOrder = target.order;
+          }
+        }
+        if (lastOrder) {
+          newOrder = nextString(lastOrder);
+        }
+      }
+
+      // TODO: Deal with order conflicts by reordering
+
+      // Now we can finally update our own order state
+      var currentChild = parentRoom.currentState.getStateEvents(EventType.SpaceChild, _this7.roomId);
+      var content = (_currentChild$getCont2 = currentChild === null || currentChild === void 0 ? void 0 : currentChild.getContent()) !== null && _currentChild$getCont2 !== void 0 ? _currentChild$getCont2 : {
+        via: [_this7.client.getDomain()]
+      };
+      yield _this7.client.sendStateEvent(parentRoom.roomId, EventType.SpaceChild, _objectSpread(_objectSpread({}, content), {}, {
+        // TODO: Safely constrain to 50 character limit required by spaces.
+        order: newOrder
+      }), _this7.roomId);
+    })();
+  }
+
+  /**
+   * Creates (uploads) a new file to this tree. The file must have already been encrypted for the room.
+   * The file contents are in a type that is compatible with MatrixClient.uploadContent().
+   * @param name - The name of the file.
+   * @param encryptedContents - The encrypted contents.
+   * @param info - The encrypted file information.
+   * @param additionalContent - Optional event content fields to include in the message.
+   * @returns Promise which resolves to the file event's sent response.
+   */
+  createFile(name, encryptedContents, info, additionalContent) {
+    var _this8 = this;
+    return _asyncToGenerator(function* () {
+      var _additionalContent;
+      var {
+        content_uri: mxc
+      } = yield _this8.client.uploadContent(encryptedContents, {
+        includeFilename: false
+      });
+      info.url = mxc;
+      var fileContent = {
+        msgtype: MsgType.File,
+        body: name,
+        url: mxc,
+        file: info
+      };
+      additionalContent = (_additionalContent = additionalContent) !== null && _additionalContent !== void 0 ? _additionalContent : {};
+      if (additionalContent["m.new_content"]) {
+        // We do the right thing according to the spec, but due to how relations are
+        // handled we also end up duplicating this information to the regular `content`
+        // as well.
+        additionalContent["m.new_content"] = fileContent;
+      }
+      var res = yield _this8.client.sendMessage(_this8.roomId, _objectSpread(_objectSpread(_objectSpread({}, additionalContent), fileContent), {}, {
+        [UNSTABLE_MSC3089_LEAF.name]: {}
+      }));
+      yield _this8.client.sendStateEvent(_this8.roomId, UNSTABLE_MSC3089_BRANCH.name, {
+        active: true,
+        name: name
+      }, res["event_id"]);
+      return res;
+    })();
+  }
+
+  /**
+   * Retrieves a file from the tree.
+   * @param fileEventId - The event ID of the file.
+   * @returns The file, or null if not found.
+   */
+  getFile(fileEventId) {
+    var branch = this.room.currentState.getStateEvents(UNSTABLE_MSC3089_BRANCH.name, fileEventId);
+    return branch ? new MSC3089Branch(this.client, branch, this) : null;
+  }
+
+  /**
+   * Gets an array of all known files for the tree.
+   * @returns The known files. May be empty, but not null.
+   */
+  listFiles() {
+    return this.listAllFiles().filter(b => b.isActive);
+  }
+
+  /**
+   * Gets an array of all known files for the tree, including inactive/invalid ones.
+   * @returns The known files. May be empty, but not null.
+   */
+  listAllFiles() {
+    var _this$room$currentSta;
+    var branches = (_this$room$currentSta = this.room.currentState.getStateEvents(UNSTABLE_MSC3089_BRANCH.name)) !== null && _this$room$currentSta !== void 0 ? _this$room$currentSta : [];
+    return branches.map(e => new MSC3089Branch(this.client, e, this));
+  }
+}
+//# sourceMappingURL=MSC3089TreeSpace.js.map

package/lib/models/MSC3089TreeSpace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MSC3089TreeSpace.js","names":["promiseRetry","EventType","MsgType","UNSTABLE_MSC3089_BRANCH","UNSTABLE_MSC3089_LEAF","logger","averageBetweenStrings","DEFAULT_ALPHABET","lexicographicCompare","nextString","prevString","simpleRetryOperation","MSC3089Branch","KnownMembership","DEFAULT_TREE_POWER_LEVELS_TEMPLATE","invite","kick","ban","redact","state_default","events_default","users_default","events","RoomPowerLevels","RoomHistoryVisibility","RoomTombstone","RoomEncryption","RoomName","RoomMessage","RoomMessageEncrypted","Sticker","users","TreePermissions","MSC3089TreeSpace","constructor","client","roomId","_defineProperty","room","getRoom","Error","id","isTopLevel","parentEvents","currentState","getStateEvents","SpaceParent","length","every","e","_e$getContent","getContent","setName","name","_this","_asyncToGenerator","sendStateEvent","userId","_arguments","arguments","_this2","andSubspaces","undefined","promises","retryInvite","push","getDirectories","map","d","Promise","all","_this3","catch","errcode","AbortError","setPermissions","role","_this4","_pls$events","currentPls","Array","isArray","pls","viewLevel","editLevel","adminLevel","Viewer","Editor","Owner","getPermissions","_pls$events2","_pls$users","userLevel","createDirectory","_this5","directory","unstableCreateFileTree","SpaceChild","via","getDomain","trees","children","child","stateKey","getStateKey","tree","unstableGetFileTreeSpace","warn","getDirectory","find","r","delete","_this6","subdirectories","dir","kickMemberships","Invite","Knock","Join","members","RoomMember","member","isNotUs","getUserId","includes","membership","leave","getOrderedChildren","ordered","c","order","filter","sort","a","b","_roomA$currentState$g","_roomA$currentState$g2","_roomB$currentState$g","_roomB$currentState$g2","roomA","roomB","createTsA","RoomCreate","getTs","createTsB","getParentRoom","parents","parent","parentRoom","getOrder","findIndex","setOrder","index","_this7","_currentChild$getCont2","Math","max","min","currentIndex","movingUp","prev","next","newOrder","ensureBeforeIsSane","startOrder","endOrder","lastOrder","i","target","_currentChild$getCont","currentChild","content","_objectSpread","createFile","encryptedContents","info","additionalContent","_this8","_additionalContent","content_uri","mxc","uploadContent","includeFilename","url","fileContent","msgtype","File","body","file","res","sendMessage","active","getFile","fileEventId","branch","listFiles","listAllFiles","isActive","_this$room$currentSta","branches"],"sources":["../../src/models/MSC3089TreeSpace.ts"],"sourcesContent":["/*\nCopyright 2021 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nimport promiseRetry from \"p-retry\";\n\nimport { MatrixClient } from \"../client.ts\";\nimport { EventType, MsgType, UNSTABLE_MSC3089_BRANCH, UNSTABLE_MSC3089_LEAF } from \"../@types/event.ts\";\nimport { Room } from \"./room.ts\";\nimport { logger } from \"../logger.ts\";\nimport { IContent, MatrixEvent } from \"./event.ts\";\nimport {\n    averageBetweenStrings,\n    DEFAULT_ALPHABET,\n    lexicographicCompare,\n    nextString,\n    prevString,\n    simpleRetryOperation,\n} from \"../utils.ts\";\nimport { MSC3089Branch } from \"./MSC3089Branch.ts\";\nimport { ISendEventResponse } from \"../@types/requests.ts\";\nimport { FileType } from \"../http-api/index.ts\";\nimport { KnownMembership } from \"../@types/membership.ts\";\nimport { RoomPowerLevelsEventContent, SpaceChildEventContent } from \"../@types/state_events.ts\";\nimport type { EncryptedFile, FileContent } from \"../@types/media.ts\";\n\n/**\n * The recommended defaults for a tree space's power levels. Note that this\n * is UNSTABLE and subject to breaking changes without notice.\n */\nexport const DEFAULT_TREE_POWER_LEVELS_TEMPLATE = {\n    // Owner\n    invite: 100,\n    kick: 100,\n    ban: 100,\n\n    // Editor\n    redact: 50,\n    state_default: 50,\n    events_default: 50,\n\n    // Viewer\n    users_default: 0,\n\n    // Mixed\n    events: {\n        [EventType.RoomPowerLevels]: 100,\n        [EventType.RoomHistoryVisibility]: 100,\n        [EventType.RoomTombstone]: 100,\n        [EventType.RoomEncryption]: 100,\n        [EventType.RoomName]: 50,\n        [EventType.RoomMessage]: 50,\n        [EventType.RoomMessageEncrypted]: 50,\n        [EventType.Sticker]: 50,\n    },\n\n    users: {}, // defined by calling code\n};\n\n/**\n * Ease-of-use representation for power levels represented as simple roles.\n * Note that this is UNSTABLE and subject to breaking changes without notice.\n */\nexport enum TreePermissions {\n    Viewer = \"viewer\", // Default\n    Editor = \"editor\", // \"Moderator\" or ~PL50\n    Owner = \"owner\", // \"Admin\" or PL100\n}\n\ndeclare module \"../@types/media\" {\n    interface FileContent {\n        [UNSTABLE_MSC3089_LEAF.name]?: {};\n    }\n}\n\n/**\n * Represents a [MSC3089](https://github.com/matrix-org/matrix-doc/pull/3089)\n * file tree Space. Note that this is UNSTABLE and subject to breaking changes\n * without notice.\n */\nexport class MSC3089TreeSpace {\n    public readonly room: Room;\n\n    public constructor(\n        private client: MatrixClient,\n        public readonly roomId: string,\n    ) {\n        this.room = this.client.getRoom(this.roomId)!;\n\n        if (!this.room) throw new Error(\"Unknown room\");\n    }\n\n    /**\n     * Syntactic sugar for room ID of the Space.\n     */\n    public get id(): string {\n        return this.roomId;\n    }\n\n    /**\n     * Whether or not this is a top level space.\n     */\n    public get isTopLevel(): boolean {\n        // XXX: This is absolutely not how you find out if the space is top level\n        // but is safe for a managed usecase like we offer in the SDK.\n        const parentEvents = this.room.currentState.getStateEvents(EventType.SpaceParent);\n        if (!parentEvents?.length) return true;\n        return parentEvents.every((e) => !e.getContent()?.[\"via\"]);\n    }\n\n    /**\n     * Sets the name of the tree space.\n     * @param name - The new name for the space.\n     * @returns Promise which resolves when complete.\n     */\n    public async setName(name: string): Promise<void> {\n        await this.client.sendStateEvent(this.roomId, EventType.RoomName, { name }, \"\");\n    }\n\n    /**\n     * Invites a user to the tree space. They will be given the default Viewer\n     * permission level unless specified elsewhere.\n     * @param userId - The user ID to invite.\n     * @param andSubspaces - True (default) to invite the user to all\n     * directories/subspaces too, recursively.\n     * @returns Promise which resolves when complete.\n     */\n    public async invite(userId: string, andSubspaces = true): Promise<void> {\n        const promises: Promise<void>[] = [this.retryInvite(userId)];\n        if (andSubspaces) {\n            promises.push(...this.getDirectories().map((d) => d.invite(userId, andSubspaces)));\n        }\n        await Promise.all(promises);\n    }\n\n    private retryInvite(userId: string): Promise<void> {\n        return simpleRetryOperation(async () => {\n            await this.client.invite(this.roomId, userId).catch((e) => {\n                // We don't want to retry permission errors forever...\n                if (e?.errcode === \"M_FORBIDDEN\") {\n                    throw new promiseRetry.AbortError(e);\n                }\n                throw e;\n            });\n        });\n    }\n\n    /**\n     * Sets the permissions of a user to the given role. Note that if setting a user\n     * to Owner then they will NOT be able to be demoted. If the user does not have\n     * permission to change the power level of the target, an error will be thrown.\n     * @param userId - The user ID to change the role of.\n     * @param role - The role to assign.\n     * @returns Promise which resolves when complete.\n     */\n    public async setPermissions(userId: string, role: TreePermissions): Promise<void> {\n        const currentPls = this.room.currentState.getStateEvents(EventType.RoomPowerLevels, \"\");\n        if (Array.isArray(currentPls)) throw new Error(\"Unexpected return type for power levels\");\n\n        const pls = currentPls?.getContent<RoomPowerLevelsEventContent>() || {};\n        const viewLevel = pls[\"users_default\"] || 0;\n        const editLevel = pls[\"events_default\"] || 50;\n        const adminLevel = pls[\"events\"]?.[EventType.RoomPowerLevels] || 100;\n\n        const users = pls[\"users\"] || {};\n        switch (role) {\n            case TreePermissions.Viewer:\n                users[userId] = viewLevel;\n                break;\n            case TreePermissions.Editor:\n                users[userId] = editLevel;\n                break;\n            case TreePermissions.Owner:\n                users[userId] = adminLevel;\n                break;\n            default:\n                throw new Error(\"Invalid role: \" + role);\n        }\n        pls[\"users\"] = users;\n\n        await this.client.sendStateEvent(this.roomId, EventType.RoomPowerLevels, pls, \"\");\n    }\n\n    /**\n     * Gets the current permissions of a user. Note that any users missing explicit permissions (or not\n     * in the space) will be considered Viewers. Appropriate membership checks need to be performed\n     * elsewhere.\n     * @param userId - The user ID to check permissions of.\n     * @returns The permissions for the user, defaulting to Viewer.\n     */\n    public getPermissions(userId: string): TreePermissions {\n        const currentPls = this.room.currentState.getStateEvents(EventType.RoomPowerLevels, \"\");\n        if (Array.isArray(currentPls)) throw new Error(\"Unexpected return type for power levels\");\n\n        const pls = currentPls?.getContent() || {};\n        const viewLevel = pls[\"users_default\"] || 0;\n        const editLevel = pls[\"events_default\"] || 50;\n        const adminLevel = pls[\"events\"]?.[EventType.RoomPowerLevels] || 100;\n\n        const userLevel = pls[\"users\"]?.[userId] || viewLevel;\n        if (userLevel >= adminLevel) return TreePermissions.Owner;\n        if (userLevel >= editLevel) return TreePermissions.Editor;\n        return TreePermissions.Viewer;\n    }\n\n    /**\n     * Creates a directory under this tree space, represented as another tree space.\n     * @param name - The name for the directory.\n     * @returns Promise which resolves to the created directory.\n     */\n    public async createDirectory(name: string): Promise<MSC3089TreeSpace> {\n        const directory = await this.client.unstableCreateFileTree(name);\n\n        await this.client.sendStateEvent(\n            this.roomId,\n            EventType.SpaceChild,\n            {\n                via: [this.client.getDomain()!],\n            },\n            directory.roomId,\n        );\n\n        await this.client.sendStateEvent(\n            directory.roomId,\n            EventType.SpaceParent,\n            {\n                via: [this.client.getDomain()!],\n            },\n            this.roomId,\n        );\n\n        return directory;\n    }\n\n    /**\n     * Gets a list of all known immediate subdirectories to this tree space.\n     * @returns The tree spaces (directories). May be empty, but not null.\n     */\n    public getDirectories(): MSC3089TreeSpace[] {\n        const trees: MSC3089TreeSpace[] = [];\n        const children = this.room.currentState.getStateEvents(EventType.SpaceChild);\n        for (const child of children) {\n            try {\n                const stateKey = child.getStateKey();\n                if (stateKey) {\n                    const tree = this.client.unstableGetFileTreeSpace(stateKey);\n                    if (tree) trees.push(tree);\n                }\n            } catch (e) {\n                logger.warn(\"Unable to create tree space instance for listing. Are we joined?\", e);\n            }\n        }\n        return trees;\n    }\n\n    /**\n     * Gets a subdirectory of a given ID under this tree space. Note that this will not recurse\n     * into children and instead only look one level deep.\n     * @param roomId - The room ID (directory ID) to find.\n     * @returns The directory, or undefined if not found.\n     */\n    public getDirectory(roomId: string): MSC3089TreeSpace | undefined {\n        return this.getDirectories().find((r) => r.roomId === roomId);\n    }\n\n    /**\n     * Deletes the tree, kicking all members and deleting **all subdirectories**.\n     * @returns Promise which resolves when complete.\n     */\n    public async delete(): Promise<void> {\n        const subdirectories = this.getDirectories();\n        for (const dir of subdirectories) {\n            await dir.delete();\n        }\n\n        const kickMemberships = [KnownMembership.Invite, KnownMembership.Knock, KnownMembership.Join];\n        const members = this.room.currentState.getStateEvents(EventType.RoomMember);\n        for (const member of members) {\n            const isNotUs = member.getStateKey() !== this.client.getUserId();\n            if (isNotUs && kickMemberships.includes(member.getContent().membership! as KnownMembership)) {\n                const stateKey = member.getStateKey();\n                if (!stateKey) {\n                    throw new Error(\"State key not found for branch\");\n                }\n                await this.client.kick(this.roomId, stateKey, \"Room deleted\");\n            }\n        }\n\n        await this.client.leave(this.roomId);\n    }\n\n    private getOrderedChildren(children: MatrixEvent[]): { roomId: string; order: string }[] {\n        const ordered: { roomId: string; order: string }[] = children\n            .map((c) => ({ roomId: c.getStateKey(), order: c.getContent()[\"order\"] }))\n            .filter((c) => c.roomId) as { roomId: string; order: string }[];\n        ordered.sort((a, b) => {\n            if (a.order && !b.order) {\n                return -1;\n            } else if (!a.order && b.order) {\n                return 1;\n            } else if (!a.order && !b.order) {\n                const roomA = this.client.getRoom(a.roomId);\n                const roomB = this.client.getRoom(b.roomId);\n                if (!roomA || !roomB) {\n                    // just don't bother trying to do more partial sorting\n                    return lexicographicCompare(a.roomId, b.roomId);\n                }\n\n                const createTsA = roomA.currentState.getStateEvents(EventType.RoomCreate, \"\")?.getTs() ?? 0;\n                const createTsB = roomB.currentState.getStateEvents(EventType.RoomCreate, \"\")?.getTs() ?? 0;\n                if (createTsA === createTsB) {\n                    return lexicographicCompare(a.roomId, b.roomId);\n                }\n                return createTsA - createTsB;\n            } else {\n                // both not-null orders\n                return lexicographicCompare(a.order, b.order);\n            }\n        });\n        return ordered;\n    }\n\n    private getParentRoom(): Room {\n        const parents = this.room.currentState.getStateEvents(EventType.SpaceParent);\n        const parent = parents[0]; // XXX: Wild assumption\n        if (!parent) throw new Error(\"Expected to have a parent in a non-top level space\");\n\n        // XXX: We are assuming the parent is a valid tree space.\n        // We probably don't need to validate the parent room state for this usecase though.\n        const stateKey = parent.getStateKey();\n        if (!stateKey) throw new Error(\"No state key found for parent\");\n        const parentRoom = this.client.getRoom(stateKey);\n        if (!parentRoom) throw new Error(\"Unable to locate room for parent\");\n\n        return parentRoom;\n    }\n\n    /**\n     * Gets the current order index for this directory. Note that if this is the top level space\n     * then -1 will be returned.\n     * @returns The order index of this space.\n     */\n    public getOrder(): number {\n        if (this.isTopLevel) return -1;\n\n        const parentRoom = this.getParentRoom();\n        const children = parentRoom.currentState.getStateEvents(EventType.SpaceChild);\n        const ordered = this.getOrderedChildren(children);\n\n        return ordered.findIndex((c) => c.roomId === this.roomId);\n    }\n\n    /**\n     * Sets the order index for this directory within its parent. Note that if this is a top level\n     * space then an error will be thrown. -1 can be used to move the child to the start, and numbers\n     * larger than the number of children can be used to move the child to the end.\n     * @param index - The new order index for this space.\n     * @returns Promise which resolves when complete.\n     * @throws Throws if this is a top level space.\n     */\n    public async setOrder(index: number): Promise<void> {\n        if (this.isTopLevel) throw new Error(\"Cannot set order of top level spaces currently\");\n\n        const parentRoom = this.getParentRoom();\n        const children = parentRoom.currentState.getStateEvents(EventType.SpaceChild);\n        const ordered = this.getOrderedChildren(children);\n        index = Math.max(Math.min(index, ordered.length - 1), 0);\n\n        const currentIndex = this.getOrder();\n        const movingUp = currentIndex < index;\n        if (movingUp && index === ordered.length - 1) {\n            index--;\n        } else if (!movingUp && index === 0) {\n            index++;\n        }\n\n        const prev = ordered[movingUp ? index : index - 1];\n        const next = ordered[movingUp ? index + 1 : index];\n\n        let newOrder = DEFAULT_ALPHABET[0];\n        let ensureBeforeIsSane = false;\n        if (!prev) {\n            // Move to front\n            if (next?.order) {\n                newOrder = prevString(next.order);\n            }\n        } else if (index === ordered.length - 1) {\n            // Move to back\n            if (next?.order) {\n                newOrder = nextString(next.order);\n            }\n        } else {\n            // Move somewhere in the middle\n            const startOrder = prev?.order;\n            const endOrder = next?.order;\n            if (startOrder && endOrder) {\n                if (startOrder === endOrder) {\n                    // Error case: just move +1 to break out of awful math\n                    newOrder = nextString(startOrder);\n                } else {\n                    newOrder = averageBetweenStrings(startOrder, endOrder);\n                }\n            } else {\n                if (startOrder) {\n                    // We're at the end (endOrder is null, so no explicit order)\n                    newOrder = nextString(startOrder);\n                } else if (endOrder) {\n                    // We're at the start (startOrder is null, so nothing before us)\n                    newOrder = prevString(endOrder);\n                } else {\n                    // Both points are unknown. We're likely in a range where all the children\n                    // don't have particular order values, so we may need to update them too.\n                    // The other possibility is there's only us as a child, but we should have\n                    // shown up in the other states.\n                    ensureBeforeIsSane = true;\n                }\n            }\n        }\n\n        if (ensureBeforeIsSane) {\n            // We were asked by the order algorithm to prepare the moving space for a landing\n            // in the undefined order part of the order array, which means we need to update the\n            // spaces that come before it with a stable order value.\n            let lastOrder: string | undefined;\n            for (let i = 0; i <= index; i++) {\n                const target = ordered[i];\n                if (i === 0) {\n                    lastOrder = target.order;\n                }\n                if (!target.order) {\n                    // XXX: We should be creating gaps to avoid conflicts\n                    lastOrder = lastOrder ? nextString(lastOrder) : DEFAULT_ALPHABET[0];\n                    const currentChild = parentRoom.currentState.getStateEvents(EventType.SpaceChild, target.roomId);\n                    const content = currentChild?.getContent<SpaceChildEventContent>() ?? {\n                        via: [this.client.getDomain()!],\n                    };\n                    await this.client.sendStateEvent(\n                        parentRoom.roomId,\n                        EventType.SpaceChild,\n                        {\n                            ...content,\n                            order: lastOrder,\n                        },\n                        target.roomId,\n                    );\n                } else {\n                    lastOrder = target.order;\n                }\n            }\n            if (lastOrder) {\n                newOrder = nextString(lastOrder);\n            }\n        }\n\n        // TODO: Deal with order conflicts by reordering\n\n        // Now we can finally update our own order state\n        const currentChild = parentRoom.currentState.getStateEvents(EventType.SpaceChild, this.roomId);\n        const content = currentChild?.getContent<SpaceChildEventContent>() ?? { via: [this.client.getDomain()!] };\n        await this.client.sendStateEvent(\n            parentRoom.roomId,\n            EventType.SpaceChild,\n            {\n                ...content,\n\n                // TODO: Safely constrain to 50 character limit required by spaces.\n                order: newOrder,\n            },\n            this.roomId,\n        );\n    }\n\n    /**\n     * Creates (uploads) a new file to this tree. The file must have already been encrypted for the room.\n     * The file contents are in a type that is compatible with MatrixClient.uploadContent().\n     * @param name - The name of the file.\n     * @param encryptedContents - The encrypted contents.\n     * @param info - The encrypted file information.\n     * @param additionalContent - Optional event content fields to include in the message.\n     * @returns Promise which resolves to the file event's sent response.\n     */\n    public async createFile(\n        name: string,\n        encryptedContents: FileType,\n        info: EncryptedFile,\n        additionalContent?: IContent,\n    ): Promise<ISendEventResponse> {\n        const { content_uri: mxc } = await this.client.uploadContent(encryptedContents, {\n            includeFilename: false,\n        });\n        info.url = mxc;\n\n        const fileContent: FileContent = {\n            msgtype: MsgType.File,\n            body: name,\n            url: mxc,\n            file: info,\n        };\n\n        additionalContent = additionalContent ?? {};\n        if (additionalContent[\"m.new_content\"]) {\n            // We do the right thing according to the spec, but due to how relations are\n            // handled we also end up duplicating this information to the regular `content`\n            // as well.\n            additionalContent[\"m.new_content\"] = fileContent;\n        }\n\n        const res = await this.client.sendMessage(this.roomId, {\n            ...additionalContent,\n            ...fileContent,\n            [UNSTABLE_MSC3089_LEAF.name]: {},\n        } as FileContent);\n\n        await this.client.sendStateEvent(\n            this.roomId,\n            UNSTABLE_MSC3089_BRANCH.name,\n            {\n                active: true,\n                name: name,\n            },\n            res[\"event_id\"],\n        );\n\n        return res;\n    }\n\n    /**\n     * Retrieves a file from the tree.\n     * @param fileEventId - The event ID of the file.\n     * @returns The file, or null if not found.\n     */\n    public getFile(fileEventId: string): MSC3089Branch | null {\n        const branch = this.room.currentState.getStateEvents(UNSTABLE_MSC3089_BRANCH.name, fileEventId);\n        return branch ? new MSC3089Branch(this.client, branch, this) : null;\n    }\n\n    /**\n     * Gets an array of all known files for the tree.\n     * @returns The known files. May be empty, but not null.\n     */\n    public listFiles(): MSC3089Branch[] {\n        return this.listAllFiles().filter((b) => b.isActive);\n    }\n\n    /**\n     * Gets an array of all known files for the tree, including inactive/invalid ones.\n     * @returns The known files. May be empty, but not null.\n     */\n    public listAllFiles(): MSC3089Branch[] {\n        const branches = this.room.currentState.getStateEvents(UNSTABLE_MSC3089_BRANCH.name) ?? [];\n        return branches.map((e) => new MSC3089Branch(this.client, e, this));\n    }\n}\n"],"mappings":";;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAOA,YAAY,MAAM,SAAS;AAGlC,SAASC,SAAS,EAAEC,OAAO,EAAEC,uBAAuB,EAAEC,qBAAqB,QAAQ,oBAAoB;AAEvG,SAASC,MAAM,QAAQ,cAAc;AAErC,SACIC,qBAAqB,EACrBC,gBAAgB,EAChBC,oBAAoB,EACpBC,UAAU,EACVC,UAAU,EACVC,oBAAoB,QACjB,aAAa;AACpB,SAASC,aAAa,QAAQ,oBAAoB;AAGlD,SAASC,eAAe,QAAQ,yBAAyB;AAIzD;AACA;AACA;AACA;AACA,OAAO,IAAMC,kCAAkC,GAAG;EAC9C;EACAC,MAAM,EAAE,GAAG;EACXC,IAAI,EAAE,GAAG;EACTC,GAAG,EAAE,GAAG;EAER;EACAC,MAAM,EAAE,EAAE;EACVC,aAAa,EAAE,EAAE;EACjBC,cAAc,EAAE,EAAE;EAElB;EACAC,aAAa,EAAE,CAAC;EAEhB;EACAC,MAAM,EAAE;IACJ,CAACrB,SAAS,CAACsB,eAAe,GAAG,GAAG;IAChC,CAACtB,SAAS,CAACuB,qBAAqB,GAAG,GAAG;IACtC,CAACvB,SAAS,CAACwB,aAAa,GAAG,GAAG;IAC9B,CAACxB,SAAS,CAACyB,cAAc,GAAG,GAAG;IAC/B,CAACzB,SAAS,CAAC0B,QAAQ,GAAG,EAAE;IACxB,CAAC1B,SAAS,CAAC2B,WAAW,GAAG,EAAE;IAC3B,CAAC3B,SAAS,CAAC4B,oBAAoB,GAAG,EAAE;IACpC,CAAC5B,SAAS,CAAC6B,OAAO,GAAG;EACzB,CAAC;EAEDC,KAAK,EAAE,CAAC,CAAC,CAAE;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA,WAAYC,eAAe,0BAAfA,eAAe;EAAfA,eAAe;EAAfA,eAAe;EAAfA,eAAe;EAAA,OAAfA,eAAe;AAAA,OAGN;AASrB;AACA;AACA;AACA;AACA;AACA,OAAO,MAAMC,gBAAgB,CAAC;EAGnBC,WAAWA,CACNC,MAAoB,EACZC,MAAc,EAChC;IAAA,KAFUD,MAAoB,GAApBA,MAAoB;IAAA,KACZC,MAAc,GAAdA,MAAc;IAAAC,eAAA;IAE9B,IAAI,CAACC,IAAI,GAAG,IAAI,CAACH,MAAM,CAACI,OAAO,CAAC,IAAI,CAACH,MAAM,CAAE;IAE7C,IAAI,CAAC,IAAI,CAACE,IAAI,EAAE,MAAM,IAAIE,KAAK,CAAC,cAAc,CAAC;EACnD;;EAEA;AACJ;AACA;EACI,IAAWC,EAAEA,CAAA,EAAW;IACpB,OAAO,IAAI,CAACL,MAAM;EACtB;;EAEA;AACJ;AACA;EACI,IAAWM,UAAUA,CAAA,EAAY;IAC7B;IACA;IACA,IAAMC,YAAY,GAAG,IAAI,CAACL,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAAC6C,WAAW,CAAC;IACjF,IAAI,EAACH,YAAY,aAAZA,YAAY,eAAZA,YAAY,CAAEI,MAAM,GAAE,OAAO,IAAI;IACtC,OAAOJ,YAAY,CAACK,KAAK,CAAEC,CAAC;MAAA,IAAAC,aAAA;MAAA,OAAK,GAAAA,aAAA,GAACD,CAAC,CAACE,UAAU,CAAC,CAAC,cAAAD,aAAA,eAAdA,aAAA,CAAiB,KAAK,CAAC;IAAA,EAAC;EAC9D;;EAEA;AACJ;AACA;AACA;AACA;EACiBE,OAAOA,CAACC,IAAY,EAAiB;IAAA,IAAAC,KAAA;IAAA,OAAAC,iBAAA;MAC9C,MAAMD,KAAI,CAACnB,MAAM,CAACqB,cAAc,CAACF,KAAI,CAAClB,MAAM,EAAEnC,SAAS,CAAC0B,QAAQ,EAAE;QAAE0B;MAAK,CAAC,EAAE,EAAE,CAAC;IAAC;EACpF;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACiBtC,MAAMA,CAAC0C,MAAc,EAAsC;IAAA,IAAAC,UAAA,GAAAC,SAAA;MAAAC,MAAA;IAAA,OAAAL,iBAAA;MAAA,IAApCM,YAAY,GAAAH,UAAA,CAAAX,MAAA,QAAAW,UAAA,QAAAI,SAAA,GAAAJ,UAAA,MAAG,IAAI;MACnD,IAAMK,QAAyB,GAAG,CAACH,MAAI,CAACI,WAAW,CAACP,MAAM,CAAC,CAAC;MAC5D,IAAII,YAAY,EAAE;QACdE,QAAQ,CAACE,IAAI,CAAC,GAAGL,MAAI,CAACM,cAAc,CAAC,CAAC,CAACC,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAACrD,MAAM,CAAC0C,MAAM,EAAEI,YAAY,CAAC,CAAC,CAAC;MACtF;MACA,MAAMQ,OAAO,CAACC,GAAG,CAACP,QAAQ,CAAC;IAAC;EAChC;EAEQC,WAAWA,CAACP,MAAc,EAAiB;IAAA,IAAAc,MAAA;IAC/C,OAAO5D,oBAAoB,cAAA4C,iBAAA,CAAC,aAAY;MACpC,MAAMgB,MAAI,CAACpC,MAAM,CAACpB,MAAM,CAACwD,MAAI,CAACnC,MAAM,EAAEqB,MAAM,CAAC,CAACe,KAAK,CAAEvB,CAAC,IAAK;QACvD;QACA,IAAI,CAAAA,CAAC,aAADA,CAAC,uBAADA,CAAC,CAAEwB,OAAO,MAAK,aAAa,EAAE;UAC9B,MAAM,IAAIzE,YAAY,CAAC0E,UAAU,CAACzB,CAAC,CAAC;QACxC;QACA,MAAMA,CAAC;MACX,CAAC,CAAC;IACN,CAAC,EAAC;EACN;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACiB0B,cAAcA,CAAClB,MAAc,EAAEmB,IAAqB,EAAiB;IAAA,IAAAC,MAAA;IAAA,OAAAtB,iBAAA;MAAA,IAAAuB,WAAA;MAC9E,IAAMC,UAAU,GAAGF,MAAI,CAACvC,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAACsB,eAAe,EAAE,EAAE,CAAC;MACvF,IAAIyD,KAAK,CAACC,OAAO,CAACF,UAAU,CAAC,EAAE,MAAM,IAAIvC,KAAK,CAAC,yCAAyC,CAAC;MAEzF,IAAM0C,GAAG,GAAG,CAAAH,UAAU,aAAVA,UAAU,uBAAVA,UAAU,CAAE5B,UAAU,CAA8B,CAAC,KAAI,CAAC,CAAC;MACvE,IAAMgC,SAAS,GAAGD,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC;MAC3C,IAAME,SAAS,GAAGF,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;MAC7C,IAAMG,UAAU,GAAG,EAAAP,WAAA,GAAAI,GAAG,CAAC,QAAQ,CAAC,cAAAJ,WAAA,uBAAbA,WAAA,CAAgB7E,SAAS,CAACsB,eAAe,CAAC,KAAI,GAAG;MAEpE,IAAMQ,KAAK,GAAGmD,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;MAChC,QAAQN,IAAI;QACR,KAAK5C,eAAe,CAACsD,MAAM;UACvBvD,KAAK,CAAC0B,MAAM,CAAC,GAAG0B,SAAS;UACzB;QACJ,KAAKnD,eAAe,CAACuD,MAAM;UACvBxD,KAAK,CAAC0B,MAAM,CAAC,GAAG2B,SAAS;UACzB;QACJ,KAAKpD,eAAe,CAACwD,KAAK;UACtBzD,KAAK,CAAC0B,MAAM,CAAC,GAAG4B,UAAU;UAC1B;QACJ;UACI,MAAM,IAAI7C,KAAK,CAAC,gBAAgB,GAAGoC,IAAI,CAAC;MAChD;MACAM,GAAG,CAAC,OAAO,CAAC,GAAGnD,KAAK;MAEpB,MAAM8C,MAAI,CAAC1C,MAAM,CAACqB,cAAc,CAACqB,MAAI,CAACzC,MAAM,EAAEnC,SAAS,CAACsB,eAAe,EAAE2D,GAAG,EAAE,EAAE,CAAC;IAAC;EACtF;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACWO,cAAcA,CAAChC,MAAc,EAAmB;IAAA,IAAAiC,YAAA,EAAAC,UAAA;IACnD,IAAMZ,UAAU,GAAG,IAAI,CAACzC,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAACsB,eAAe,EAAE,EAAE,CAAC;IACvF,IAAIyD,KAAK,CAACC,OAAO,CAACF,UAAU,CAAC,EAAE,MAAM,IAAIvC,KAAK,CAAC,yCAAyC,CAAC;IAEzF,IAAM0C,GAAG,GAAG,CAAAH,UAAU,aAAVA,UAAU,uBAAVA,UAAU,CAAE5B,UAAU,CAAC,CAAC,KAAI,CAAC,CAAC;IAC1C,IAAMgC,SAAS,GAAGD,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC;IAC3C,IAAME,SAAS,GAAGF,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;IAC7C,IAAMG,UAAU,GAAG,EAAAK,YAAA,GAAAR,GAAG,CAAC,QAAQ,CAAC,cAAAQ,YAAA,uBAAbA,YAAA,CAAgBzF,SAAS,CAACsB,eAAe,CAAC,KAAI,GAAG;IAEpE,IAAMqE,SAAS,GAAG,EAAAD,UAAA,GAAAT,GAAG,CAAC,OAAO,CAAC,cAAAS,UAAA,uBAAZA,UAAA,CAAelC,MAAM,CAAC,KAAI0B,SAAS;IACrD,IAAIS,SAAS,IAAIP,UAAU,EAAE,OAAOrD,eAAe,CAACwD,KAAK;IACzD,IAAII,SAAS,IAAIR,SAAS,EAAE,OAAOpD,eAAe,CAACuD,MAAM;IACzD,OAAOvD,eAAe,CAACsD,MAAM;EACjC;;EAEA;AACJ;AACA;AACA;AACA;EACiBO,eAAeA,CAACxC,IAAY,EAA6B;IAAA,IAAAyC,MAAA;IAAA,OAAAvC,iBAAA;MAClE,IAAMwC,SAAS,SAASD,MAAI,CAAC3D,MAAM,CAAC6D,sBAAsB,CAAC3C,IAAI,CAAC;MAEhE,MAAMyC,MAAI,CAAC3D,MAAM,CAACqB,cAAc,CAC5BsC,MAAI,CAAC1D,MAAM,EACXnC,SAAS,CAACgG,UAAU,EACpB;QACIC,GAAG,EAAE,CAACJ,MAAI,CAAC3D,MAAM,CAACgE,SAAS,CAAC,CAAC;MACjC,CAAC,EACDJ,SAAS,CAAC3D,MACd,CAAC;MAED,MAAM0D,MAAI,CAAC3D,MAAM,CAACqB,cAAc,CAC5BuC,SAAS,CAAC3D,MAAM,EAChBnC,SAAS,CAAC6C,WAAW,EACrB;QACIoD,GAAG,EAAE,CAACJ,MAAI,CAAC3D,MAAM,CAACgE,SAAS,CAAC,CAAC;MACjC,CAAC,EACDL,MAAI,CAAC1D,MACT,CAAC;MAED,OAAO2D,SAAS;IAAC;EACrB;;EAEA;AACJ;AACA;AACA;EACW7B,cAAcA,CAAA,EAAuB;IACxC,IAAMkC,KAAyB,GAAG,EAAE;IACpC,IAAMC,QAAQ,GAAG,IAAI,CAAC/D,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAACgG,UAAU,CAAC;IAC5E,KAAK,IAAMK,KAAK,IAAID,QAAQ,EAAE;MAC1B,IAAI;QACA,IAAME,QAAQ,GAAGD,KAAK,CAACE,WAAW,CAAC,CAAC;QACpC,IAAID,QAAQ,EAAE;UACV,IAAME,IAAI,GAAG,IAAI,CAACtE,MAAM,CAACuE,wBAAwB,CAACH,QAAQ,CAAC;UAC3D,IAAIE,IAAI,EAAEL,KAAK,CAACnC,IAAI,CAACwC,IAAI,CAAC;QAC9B;MACJ,CAAC,CAAC,OAAOxD,CAAC,EAAE;QACR5C,MAAM,CAACsG,IAAI,CAAC,kEAAkE,EAAE1D,CAAC,CAAC;MACtF;IACJ;IACA,OAAOmD,KAAK;EAChB;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWQ,YAAYA,CAACxE,MAAc,EAAgC;IAC9D,OAAO,IAAI,CAAC8B,cAAc,CAAC,CAAC,CAAC2C,IAAI,CAAEC,CAAC,IAAKA,CAAC,CAAC1E,MAAM,KAAKA,MAAM,CAAC;EACjE;;EAEA;AACJ;AACA;AACA;EACiB2E,MAAMA,CAAA,EAAkB;IAAA,IAAAC,MAAA;IAAA,OAAAzD,iBAAA;MACjC,IAAM0D,cAAc,GAAGD,MAAI,CAAC9C,cAAc,CAAC,CAAC;MAC5C,KAAK,IAAMgD,GAAG,IAAID,cAAc,EAAE;QAC9B,MAAMC,GAAG,CAACH,MAAM,CAAC,CAAC;MACtB;MAEA,IAAMI,eAAe,GAAG,CAACtG,eAAe,CAACuG,MAAM,EAAEvG,eAAe,CAACwG,KAAK,EAAExG,eAAe,CAACyG,IAAI,CAAC;MAC7F,IAAMC,OAAO,GAAGP,MAAI,CAAC1E,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAACuH,UAAU,CAAC;MAC3E,KAAK,IAAMC,MAAM,IAAIF,OAAO,EAAE;QAC1B,IAAMG,OAAO,GAAGD,MAAM,CAACjB,WAAW,CAAC,CAAC,KAAKQ,MAAI,CAAC7E,MAAM,CAACwF,SAAS,CAAC,CAAC;QAChE,IAAID,OAAO,IAAIP,eAAe,CAACS,QAAQ,CAACH,MAAM,CAACtE,UAAU,CAAC,CAAC,CAAC0E,UAA8B,CAAC,EAAE;UACzF,IAAMtB,QAAQ,GAAGkB,MAAM,CAACjB,WAAW,CAAC,CAAC;UACrC,IAAI,CAACD,QAAQ,EAAE;YACX,MAAM,IAAI/D,KAAK,CAAC,gCAAgC,CAAC;UACrD;UACA,MAAMwE,MAAI,CAAC7E,MAAM,CAACnB,IAAI,CAACgG,MAAI,CAAC5E,MAAM,EAAEmE,QAAQ,EAAE,cAAc,CAAC;QACjE;MACJ;MAEA,MAAMS,MAAI,CAAC7E,MAAM,CAAC2F,KAAK,CAACd,MAAI,CAAC5E,MAAM,CAAC;IAAC;EACzC;EAEQ2F,kBAAkBA,CAAC1B,QAAuB,EAAuC;IACrF,IAAM2B,OAA4C,GAAG3B,QAAQ,CACxDlC,GAAG,CAAE8D,CAAC,KAAM;MAAE7F,MAAM,EAAE6F,CAAC,CAACzB,WAAW,CAAC,CAAC;MAAE0B,KAAK,EAAED,CAAC,CAAC9E,UAAU,CAAC,CAAC,CAAC,OAAO;IAAE,CAAC,CAAC,CAAC,CACzEgF,MAAM,CAAEF,CAAC,IAAKA,CAAC,CAAC7F,MAAM,CAAwC;IACnE4F,OAAO,CAACI,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAK;MACnB,IAAID,CAAC,CAACH,KAAK,IAAI,CAACI,CAAC,CAACJ,KAAK,EAAE;QACrB,OAAO,CAAC,CAAC;MACb,CAAC,MAAM,IAAI,CAACG,CAAC,CAACH,KAAK,IAAII,CAAC,CAACJ,KAAK,EAAE;QAC5B,OAAO,CAAC;MACZ,CAAC,MAAM,IAAI,CAACG,CAAC,CAACH,KAAK,IAAI,CAACI,CAAC,CAACJ,KAAK,EAAE;QAAA,IAAAK,qBAAA,EAAAC,sBAAA,EAAAC,qBAAA,EAAAC,sBAAA;QAC7B,IAAMC,KAAK,GAAG,IAAI,CAACxG,MAAM,CAACI,OAAO,CAAC8F,CAAC,CAACjG,MAAM,CAAC;QAC3C,IAAMwG,KAAK,GAAG,IAAI,CAACzG,MAAM,CAACI,OAAO,CAAC+F,CAAC,CAAClG,MAAM,CAAC;QAC3C,IAAI,CAACuG,KAAK,IAAI,CAACC,KAAK,EAAE;UAClB;UACA,OAAOpI,oBAAoB,CAAC6H,CAAC,CAACjG,MAAM,EAAEkG,CAAC,CAAClG,MAAM,CAAC;QACnD;QAEA,IAAMyG,SAAS,IAAAN,qBAAA,IAAAC,sBAAA,GAAGG,KAAK,CAAC/F,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAAC6I,UAAU,EAAE,EAAE,CAAC,cAAAN,sBAAA,uBAA3DA,sBAAA,CAA6DO,KAAK,CAAC,CAAC,cAAAR,qBAAA,cAAAA,qBAAA,GAAI,CAAC;QAC3F,IAAMS,SAAS,IAAAP,qBAAA,IAAAC,sBAAA,GAAGE,KAAK,CAAChG,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAAC6I,UAAU,EAAE,EAAE,CAAC,cAAAJ,sBAAA,uBAA3DA,sBAAA,CAA6DK,KAAK,CAAC,CAAC,cAAAN,qBAAA,cAAAA,qBAAA,GAAI,CAAC;QAC3F,IAAII,SAAS,KAAKG,SAAS,EAAE;UACzB,OAAOxI,oBAAoB,CAAC6H,CAAC,CAACjG,MAAM,EAAEkG,CAAC,CAAClG,MAAM,CAAC;QACnD;QACA,OAAOyG,SAAS,GAAGG,SAAS;MAChC,CAAC,MAAM;QACH;QACA,OAAOxI,oBAAoB,CAAC6H,CAAC,CAACH,KAAK,EAAEI,CAAC,CAACJ,KAAK,CAAC;MACjD;IACJ,CAAC,CAAC;IACF,OAAOF,OAAO;EAClB;EAEQiB,aAAaA,CAAA,EAAS;IAC1B,IAAMC,OAAO,GAAG,IAAI,CAAC5G,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAAC6C,WAAW,CAAC;IAC5E,IAAMqG,MAAM,GAAGD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAACC,MAAM,EAAE,MAAM,IAAI3G,KAAK,CAAC,oDAAoD,CAAC;;IAElF;IACA;IACA,IAAM+D,QAAQ,GAAG4C,MAAM,CAAC3C,WAAW,CAAC,CAAC;IACrC,IAAI,CAACD,QAAQ,EAAE,MAAM,IAAI/D,KAAK,CAAC,+BAA+B,CAAC;IAC/D,IAAM4G,UAAU,GAAG,IAAI,CAACjH,MAAM,CAACI,OAAO,CAACgE,QAAQ,CAAC;IAChD,IAAI,CAAC6C,UAAU,EAAE,MAAM,IAAI5G,KAAK,CAAC,kCAAkC,CAAC;IAEpE,OAAO4G,UAAU;EACrB;;EAEA;AACJ;AACA;AACA;AACA;EACWC,QAAQA,CAAA,EAAW;IACtB,IAAI,IAAI,CAAC3G,UAAU,EAAE,OAAO,CAAC,CAAC;IAE9B,IAAM0G,UAAU,GAAG,IAAI,CAACH,aAAa,CAAC,CAAC;IACvC,IAAM5C,QAAQ,GAAG+C,UAAU,CAACxG,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAACgG,UAAU,CAAC;IAC7E,IAAM+B,OAAO,GAAG,IAAI,CAACD,kBAAkB,CAAC1B,QAAQ,CAAC;IAEjD,OAAO2B,OAAO,CAACsB,SAAS,CAAErB,CAAC,IAAKA,CAAC,CAAC7F,MAAM,KAAK,IAAI,CAACA,MAAM,CAAC;EAC7D;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACiBmH,QAAQA,CAACC,KAAa,EAAiB;IAAA,IAAAC,MAAA;IAAA,OAAAlG,iBAAA;MAAA,IAAAmG,sBAAA;MAChD,IAAID,MAAI,CAAC/G,UAAU,EAAE,MAAM,IAAIF,KAAK,CAAC,gDAAgD,CAAC;MAEtF,IAAM4G,UAAU,GAAGK,MAAI,CAACR,aAAa,CAAC,CAAC;MACvC,IAAM5C,QAAQ,GAAG+C,UAAU,CAACxG,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAACgG,UAAU,CAAC;MAC7E,IAAM+B,OAAO,GAAGyB,MAAI,CAAC1B,kBAAkB,CAAC1B,QAAQ,CAAC;MACjDmD,KAAK,GAAGG,IAAI,CAACC,GAAG,CAACD,IAAI,CAACE,GAAG,CAACL,KAAK,EAAExB,OAAO,CAACjF,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;MAExD,IAAM+G,YAAY,GAAGL,MAAI,CAACJ,QAAQ,CAAC,CAAC;MACpC,IAAMU,QAAQ,GAAGD,YAAY,GAAGN,KAAK;MACrC,IAAIO,QAAQ,IAAIP,KAAK,KAAKxB,OAAO,CAACjF,MAAM,GAAG,CAAC,EAAE;QAC1CyG,KAAK,EAAE;MACX,CAAC,MAAM,IAAI,CAACO,QAAQ,IAAIP,KAAK,KAAK,CAAC,EAAE;QACjCA,KAAK,EAAE;MACX;MAEA,IAAMQ,IAAI,GAAGhC,OAAO,CAAC+B,QAAQ,GAAGP,KAAK,GAAGA,KAAK,GAAG,CAAC,CAAC;MAClD,IAAMS,IAAI,GAAGjC,OAAO,CAAC+B,QAAQ,GAAGP,KAAK,GAAG,CAAC,GAAGA,KAAK,CAAC;MAElD,IAAIU,QAAQ,GAAG3J,gBAAgB,CAAC,CAAC,CAAC;MAClC,IAAI4J,kBAAkB,GAAG,KAAK;MAC9B,IAAI,CAACH,IAAI,EAAE;QACP;QACA,IAAIC,IAAI,aAAJA,IAAI,eAAJA,IAAI,CAAE/B,KAAK,EAAE;UACbgC,QAAQ,GAAGxJ,UAAU,CAACuJ,IAAI,CAAC/B,KAAK,CAAC;QACrC;MACJ,CAAC,MAAM,IAAIsB,KAAK,KAAKxB,OAAO,CAACjF,MAAM,GAAG,CAAC,EAAE;QACrC;QACA,IAAIkH,IAAI,aAAJA,IAAI,eAAJA,IAAI,CAAE/B,KAAK,EAAE;UACbgC,QAAQ,GAAGzJ,UAAU,CAACwJ,IAAI,CAAC/B,KAAK,CAAC;QACrC;MACJ,CAAC,MAAM;QACH;QACA,IAAMkC,UAAU,GAAGJ,IAAI,aAAJA,IAAI,uBAAJA,IAAI,CAAE9B,KAAK;QAC9B,IAAMmC,QAAQ,GAAGJ,IAAI,aAAJA,IAAI,uBAAJA,IAAI,CAAE/B,KAAK;QAC5B,IAAIkC,UAAU,IAAIC,QAAQ,EAAE;UACxB,IAAID,UAAU,KAAKC,QAAQ,EAAE;YACzB;YACAH,QAAQ,GAAGzJ,UAAU,CAAC2J,UAAU,CAAC;UACrC,CAAC,MAAM;YACHF,QAAQ,GAAG5J,qBAAqB,CAAC8J,UAAU,EAAEC,QAAQ,CAAC;UAC1D;QACJ,CAAC,MAAM;UACH,IAAID,UAAU,EAAE;YACZ;YACAF,QAAQ,GAAGzJ,UAAU,CAAC2J,UAAU,CAAC;UACrC,CAAC,MAAM,IAAIC,QAAQ,EAAE;YACjB;YACAH,QAAQ,GAAGxJ,UAAU,CAAC2J,QAAQ,CAAC;UACnC,CAAC,MAAM;YACH;YACA;YACA;YACA;YACAF,kBAAkB,GAAG,IAAI;UAC7B;QACJ;MACJ;MAEA,IAAIA,kBAAkB,EAAE;QACpB;QACA;QACA;QACA,IAAIG,SAA6B;QACjC,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIf,KAAK,EAAEe,CAAC,EAAE,EAAE;UAC7B,IAAMC,MAAM,GAAGxC,OAAO,CAACuC,CAAC,CAAC;UACzB,IAAIA,CAAC,KAAK,CAAC,EAAE;YACTD,SAAS,GAAGE,MAAM,CAACtC,KAAK;UAC5B;UACA,IAAI,CAACsC,MAAM,CAACtC,KAAK,EAAE;YAAA,IAAAuC,qBAAA;YACf;YACAH,SAAS,GAAGA,SAAS,GAAG7J,UAAU,CAAC6J,SAAS,CAAC,GAAG/J,gBAAgB,CAAC,CAAC,CAAC;YACnE,IAAMmK,aAAY,GAAGtB,UAAU,CAACxG,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAACgG,UAAU,EAAEuE,MAAM,CAACpI,MAAM,CAAC;YAChG,IAAMuI,QAAO,IAAAF,qBAAA,GAAGC,aAAY,aAAZA,aAAY,uBAAZA,aAAY,CAAEvH,UAAU,CAAyB,CAAC,cAAAsH,qBAAA,cAAAA,qBAAA,GAAI;cAClEvE,GAAG,EAAE,CAACuD,MAAI,CAACtH,MAAM,CAACgE,SAAS,CAAC,CAAC;YACjC,CAAC;YACD,MAAMsD,MAAI,CAACtH,MAAM,CAACqB,cAAc,CAC5B4F,UAAU,CAAChH,MAAM,EACjBnC,SAAS,CAACgG,UAAU,EAAA2E,aAAA,CAAAA,aAAA,KAEbD,QAAO;cACVzC,KAAK,EAAEoC;YAAS,IAEpBE,MAAM,CAACpI,MACX,CAAC;UACL,CAAC,MAAM;YACHkI,SAAS,GAAGE,MAAM,CAACtC,KAAK;UAC5B;QACJ;QACA,IAAIoC,SAAS,EAAE;UACXJ,QAAQ,GAAGzJ,UAAU,CAAC6J,SAAS,CAAC;QACpC;MACJ;;MAEA;;MAEA;MACA,IAAMI,YAAY,GAAGtB,UAAU,CAACxG,YAAY,CAACC,cAAc,CAAC5C,SAAS,CAACgG,UAAU,EAAEwD,MAAI,CAACrH,MAAM,CAAC;MAC9F,IAAMuI,OAAO,IAAAjB,sBAAA,GAAGgB,YAAY,aAAZA,YAAY,uBAAZA,YAAY,CAAEvH,UAAU,CAAyB,CAAC,cAAAuG,sBAAA,cAAAA,sBAAA,GAAI;QAAExD,GAAG,EAAE,CAACuD,MAAI,CAACtH,MAAM,CAACgE,SAAS,CAAC,CAAC;MAAG,CAAC;MACzG,MAAMsD,MAAI,CAACtH,MAAM,CAACqB,cAAc,CAC5B4F,UAAU,CAAChH,MAAM,EACjBnC,SAAS,CAACgG,UAAU,EAAA2E,aAAA,CAAAA,aAAA,KAEbD,OAAO;QAEV;QACAzC,KAAK,EAAEgC;MAAQ,IAEnBT,MAAI,CAACrH,MACT,CAAC;IAAC;EACN;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACiByI,UAAUA,CACnBxH,IAAY,EACZyH,iBAA2B,EAC3BC,IAAmB,EACnBC,iBAA4B,EACD;IAAA,IAAAC,MAAA;IAAA,OAAA1H,iBAAA;MAAA,IAAA2H,kBAAA;MAC3B,IAAM;QAAEC,WAAW,EAAEC;MAAI,CAAC,SAASH,MAAI,CAAC9I,MAAM,CAACkJ,aAAa,CAACP,iBAAiB,EAAE;QAC5EQ,eAAe,EAAE;MACrB,CAAC,CAAC;MACFP,IAAI,CAACQ,GAAG,GAAGH,GAAG;MAEd,IAAMI,WAAwB,GAAG;QAC7BC,OAAO,EAAEvL,OAAO,CAACwL,IAAI;QACrBC,IAAI,EAAEtI,IAAI;QACVkI,GAAG,EAAEH,GAAG;QACRQ,IAAI,EAAEb;MACV,CAAC;MAEDC,iBAAiB,IAAAE,kBAAA,GAAGF,iBAAiB,cAAAE,kBAAA,cAAAA,kBAAA,GAAI,CAAC,CAAC;MAC3C,IAAIF,iBAAiB,CAAC,eAAe,CAAC,EAAE;QACpC;QACA;QACA;QACAA,iBAAiB,CAAC,eAAe,CAAC,GAAGQ,WAAW;MACpD;MAEA,IAAMK,GAAG,SAASZ,MAAI,CAAC9I,MAAM,CAAC2J,WAAW,CAACb,MAAI,CAAC7I,MAAM,EAAAwI,aAAA,CAAAA,aAAA,CAAAA,aAAA,KAC9CI,iBAAiB,GACjBQ,WAAW;QACd,CAACpL,qBAAqB,CAACiD,IAAI,GAAG,CAAC;MAAC,EACpB,CAAC;MAEjB,MAAM4H,MAAI,CAAC9I,MAAM,CAACqB,cAAc,CAC5ByH,MAAI,CAAC7I,MAAM,EACXjC,uBAAuB,CAACkD,IAAI,EAC5B;QACI0I,MAAM,EAAE,IAAI;QACZ1I,IAAI,EAAEA;MACV,CAAC,EACDwI,GAAG,CAAC,UAAU,CAClB,CAAC;MAED,OAAOA,GAAG;IAAC;EACf;;EAEA;AACJ;AACA;AACA;AACA;EACWG,OAAOA,CAACC,WAAmB,EAAwB;IACtD,IAAMC,MAAM,GAAG,IAAI,CAAC5J,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC1C,uBAAuB,CAACkD,IAAI,EAAE4I,WAAW,CAAC;IAC/F,OAAOC,MAAM,GAAG,IAAItL,aAAa,CAAC,IAAI,CAACuB,MAAM,EAAE+J,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI;EACvE;;EAEA;AACJ;AACA;AACA;EACWC,SAASA,CAAA,EAAoB;IAChC,OAAO,IAAI,CAACC,YAAY,CAAC,CAAC,CAACjE,MAAM,CAAEG,CAAC,IAAKA,CAAC,CAAC+D,QAAQ,CAAC;EACxD;;EAEA;AACJ;AACA;AACA;EACWD,YAAYA,CAAA,EAAoB;IAAA,IAAAE,qBAAA;IACnC,IAAMC,QAAQ,IAAAD,qBAAA,GAAG,IAAI,CAAChK,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC1C,uBAAuB,CAACkD,IAAI,CAAC,cAAAiJ,qBAAA,cAAAA,qBAAA,GAAI,EAAE;IAC1F,OAAOC,QAAQ,CAACpI,GAAG,CAAElB,CAAC,IAAK,IAAIrC,aAAa,CAAC,IAAI,CAACuB,MAAM,EAAEc,CAAC,EAAE,IAAI,CAAC,CAAC;EACvE;AACJ","ignoreList":[]}

package/lib/models/ToDeviceMessage.d.ts

@@ -0,0 +1,17 @@
+export type ToDevicePayload = Record<string, any>;
+export interface ToDeviceMessage {
+    userId: string;
+    deviceId: string;
+    payload: ToDevicePayload;
+}
+export interface ToDeviceBatch {
+    eventType: string;
+    batch: ToDeviceMessage[];
+}
+export interface ToDeviceBatchWithTxnId extends ToDeviceBatch {
+    txnId: string;
+}
+export interface IndexedToDeviceBatch extends ToDeviceBatchWithTxnId {
+    id: number;
+}
+//# sourceMappingURL=ToDeviceMessage.d.ts.map

package/lib/models/ToDeviceMessage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ToDeviceMessage.d.ts","sourceRoot":"","sources":["../../src/models/ToDeviceMessage.ts"],"names":[],"mappings":"AAgBA,MAAM,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAElD,MAAM,WAAW,eAAe;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,eAAe,CAAC;CAC5B;AAED,MAAM,WAAW,aAAa;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,eAAe,EAAE,CAAC;CAC5B;AAGD,MAAM,WAAW,sBAAuB,SAAQ,aAAa;IACzD,KAAK,EAAE,MAAM,CAAC;CACjB;AAGD,MAAM,WAAW,oBAAqB,SAAQ,sBAAsB;IAChE,EAAE,EAAE,MAAM,CAAC;CACd"}

package/lib/models/ToDeviceMessage.js

@@ -0,0 +1 @@
+export {};

package/lib/models/ToDeviceMessage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ToDeviceMessage.js","names":[],"sources":["../../src/models/ToDeviceMessage.ts"],"sourcesContent":["/*\nCopyright 2022 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nexport type ToDevicePayload = Record<string, any>;\n\nexport interface ToDeviceMessage {\n    userId: string;\n    deviceId: string;\n    payload: ToDevicePayload;\n}\n\nexport interface ToDeviceBatch {\n    eventType: string;\n    batch: ToDeviceMessage[];\n}\n\n// Only used internally\nexport interface ToDeviceBatchWithTxnId extends ToDeviceBatch {\n    txnId: string;\n}\n\n// Only used internally\nexport interface IndexedToDeviceBatch extends ToDeviceBatchWithTxnId {\n    id: number;\n}\n"],"mappings":"","ignoreList":[]}