matrix-js-sdk 41.8.0 → 41.9.0

package/lib/models/MSC3089TreeSpace.js.map

@@ -1 +1 @@
-{"version":3,"file":"MSC3089TreeSpace.js","names":["EventType","MsgType","UNSTABLE_MSC3089_BRANCH","UNSTABLE_MSC3089_LEAF","logger","averageBetweenStrings","DEFAULT_ALPHABET","lexicographicCompare","nextString","prevString","simpleRetryOperation","MSC3089Branch","MatrixError","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","errcode","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","_yield$_this8$client$","uploadContent","includeFilename","mxc","content_uri","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 { type MatrixClient } from \"../client.ts\";\nimport { EventType, MsgType, UNSTABLE_MSC3089_BRANCH, UNSTABLE_MSC3089_LEAF } from \"../@types/event.ts\";\nimport { type Room } from \"./room.ts\";\nimport { logger } from \"../logger.ts\";\nimport { type IContent, type 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 { type ISendEventResponse } from \"../@types/requests.ts\";\nimport { type FileType, MatrixError } from \"../http-api/index.ts\";\nimport { KnownMembership } from \"../@types/membership.ts\";\nimport { type RoomPowerLevelsEventContent, type SpaceChildEventContent } from \"../@types/state_events.ts\";\nimport type { EncryptedFile, FileContent } from \"../@types/media.ts\";\nimport { type EmptyObject } from \"../@types/common.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]?: EmptyObject;\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 async retryInvite(userId: string): Promise<void> {\n        await simpleRetryOperation(\n            () => this.client.invite(this.roomId, userId),\n            (e) => {\n                // We don't want to retry permission errors forever...\n                if (e instanceof MatrixError && e.errcode === \"M_FORBIDDEN\") {\n                    return false;\n                }\n                return true;\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;;AAGA,SAASA,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;AAElD,SAAwBC,WAAW,QAAQ,sBAAsB;AACjE,SAASC,eAAe,QAAQ,yBAAyB;AAKzD;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,CAACtB,SAAS,CAACuB,eAAe,GAAG,GAAG;IAChC,CAACvB,SAAS,CAACwB,qBAAqB,GAAG,GAAG;IACtC,CAACxB,SAAS,CAACyB,aAAa,GAAG,GAAG;IAC9B,CAACzB,SAAS,CAAC0B,cAAc,GAAG,GAAG;IAC/B,CAAC1B,SAAS,CAAC2B,QAAQ,GAAG,EAAE;IACxB,CAAC3B,SAAS,CAAC4B,WAAW,GAAG,EAAE;IAC3B,CAAC5B,SAAS,CAAC6B,oBAAoB,GAAG,EAAE;IACpC,CAAC7B,SAAS,CAAC8B,OAAO,GAAG;EACzB,CAAC;EAEDC,KAAK,EAAE,CAAC,CAAC,CAAE;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA,WAAYC,eAAe,0BAAfA,eAAe;EAAfA,eAAe;EACJ;EADXA,eAAe;EAEJ;EAFXA,eAAe,qBAGN;EAAA,OAHTA,eAAe;AAAA;AAY3B;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,CAAC7C,SAAS,CAAC8C,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,EAAEpC,SAAS,CAAC2B,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;EAEcC,WAAWA,CAACP,MAAc,EAAiB;IAAA,IAAAc,MAAA;IAAA,OAAAhB,iBAAA;MACrD,MAAM7C,oBAAoB,CACtB,MAAM6D,MAAI,CAACpC,MAAM,CAACpB,MAAM,CAACwD,MAAI,CAACnC,MAAM,EAAEqB,MAAM,CAAC,EAC5CR,CAAC,IAAK;QACH;QACA,IAAIA,CAAC,YAAYrC,WAAW,IAAIqC,CAAC,CAACuB,OAAO,KAAK,aAAa,EAAE;UACzD,OAAO,KAAK;QAChB;QACA,OAAO,IAAI;MACf,CACJ,CAAC;IAAC;EACN;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACiBC,cAAcA,CAAChB,MAAc,EAAEiB,IAAqB,EAAiB;IAAA,IAAAC,MAAA;IAAA,OAAApB,iBAAA;MAAA,IAAAqB,WAAA;MAC9E,IAAMC,UAAU,GAAGF,MAAI,CAACrC,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAACuB,eAAe,EAAE,EAAE,CAAC;MACvF,IAAIuD,KAAK,CAACC,OAAO,CAACF,UAAU,CAAC,EAAE,MAAM,IAAIrC,KAAK,CAAC,yCAAyC,CAAC;MAEzF,IAAMwC,GAAG,GAAG,CAAAH,UAAU,aAAVA,UAAU,uBAAVA,UAAU,CAAE1B,UAAU,CAA8B,CAAC,KAAI,CAAC,CAAC;MACvE,IAAM8B,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,CAAgB5E,SAAS,CAACuB,eAAe,CAAC,KAAI,GAAG;MAEpE,IAAMQ,KAAK,GAAGiD,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;MAChC,QAAQN,IAAI;QACR,KAAK1C,eAAe,CAACoD,MAAM;UACvBrD,KAAK,CAAC0B,MAAM,CAAC,GAAGwB,SAAS;UACzB;QACJ,KAAKjD,eAAe,CAACqD,MAAM;UACvBtD,KAAK,CAAC0B,MAAM,CAAC,GAAGyB,SAAS;UACzB;QACJ,KAAKlD,eAAe,CAACsD,KAAK;UACtBvD,KAAK,CAAC0B,MAAM,CAAC,GAAG0B,UAAU;UAC1B;QACJ;UACI,MAAM,IAAI3C,KAAK,CAAC,gBAAgB,GAAGkC,IAAI,CAAC;MAChD;MACAM,GAAG,CAAC,OAAO,CAAC,GAAGjD,KAAK;MAEpB,MAAM4C,MAAI,CAACxC,MAAM,CAACqB,cAAc,CAACmB,MAAI,CAACvC,MAAM,EAAEpC,SAAS,CAACuB,eAAe,EAAEyD,GAAG,EAAE,EAAE,CAAC;IAAC;EACtF;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACWO,cAAcA,CAAC9B,MAAc,EAAmB;IAAA,IAAA+B,YAAA,EAAAC,UAAA;IACnD,IAAMZ,UAAU,GAAG,IAAI,CAACvC,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAACuB,eAAe,EAAE,EAAE,CAAC;IACvF,IAAIuD,KAAK,CAACC,OAAO,CAACF,UAAU,CAAC,EAAE,MAAM,IAAIrC,KAAK,CAAC,yCAAyC,CAAC;IAEzF,IAAMwC,GAAG,GAAG,CAAAH,UAAU,aAAVA,UAAU,uBAAVA,UAAU,CAAE1B,UAAU,CAAC,CAAC,KAAI,CAAC,CAAC;IAC1C,IAAM8B,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,CAAgBxF,SAAS,CAACuB,eAAe,CAAC,KAAI,GAAG;IAEpE,IAAMmE,SAAS,GAAG,EAAAD,UAAA,GAAAT,GAAG,CAAC,OAAO,CAAC,cAAAS,UAAA,uBAAZA,UAAA,CAAehC,MAAM,CAAC,KAAIwB,SAAS;IACrD,IAAIS,SAAS,IAAIP,UAAU,EAAE,OAAOnD,eAAe,CAACsD,KAAK;IACzD,IAAII,SAAS,IAAIR,SAAS,EAAE,OAAOlD,eAAe,CAACqD,MAAM;IACzD,OAAOrD,eAAe,CAACoD,MAAM;EACjC;;EAEA;AACJ;AACA;AACA;AACA;EACiBO,eAAeA,CAACtC,IAAY,EAA6B;IAAA,IAAAuC,MAAA;IAAA,OAAArC,iBAAA;MAClE,IAAMsC,SAAS,SAASD,MAAI,CAACzD,MAAM,CAAC2D,sBAAsB,CAACzC,IAAI,CAAC;MAEhE,MAAMuC,MAAI,CAACzD,MAAM,CAACqB,cAAc,CAC5BoC,MAAI,CAACxD,MAAM,EACXpC,SAAS,CAAC+F,UAAU,EACpB;QACIC,GAAG,EAAE,CAACJ,MAAI,CAACzD,MAAM,CAAC8D,SAAS,CAAC,CAAC;MACjC,CAAC,EACDJ,SAAS,CAACzD,MACd,CAAC;MAED,MAAMwD,MAAI,CAACzD,MAAM,CAACqB,cAAc,CAC5BqC,SAAS,CAACzD,MAAM,EAChBpC,SAAS,CAAC8C,WAAW,EACrB;QACIkD,GAAG,EAAE,CAACJ,MAAI,CAACzD,MAAM,CAAC8D,SAAS,CAAC,CAAC;MACjC,CAAC,EACDL,MAAI,CAACxD,MACT,CAAC;MAED,OAAOyD,SAAS;IAAC;EACrB;;EAEA;AACJ;AACA;AACA;EACW3B,cAAcA,CAAA,EAAuB;IACxC,IAAMgC,KAAyB,GAAG,EAAE;IACpC,IAAMC,QAAQ,GAAG,IAAI,CAAC7D,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAAC+F,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,CAACpE,MAAM,CAACqE,wBAAwB,CAACH,QAAQ,CAAC;UAC3D,IAAIE,IAAI,EAAEL,KAAK,CAACjC,IAAI,CAACsC,IAAI,CAAC;QAC9B;MACJ,CAAC,CAAC,OAAOtD,CAAC,EAAE;QACR7C,MAAM,CAACqG,IAAI,CAAC,kEAAkE,EAAExD,CAAC,CAAC;MACtF;IACJ;IACA,OAAOiD,KAAK;EAChB;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWQ,YAAYA,CAACtE,MAAc,EAAgC;IAC9D,OAAO,IAAI,CAAC8B,cAAc,CAAC,CAAC,CAACyC,IAAI,CAAEC,CAAC,IAAKA,CAAC,CAACxE,MAAM,KAAKA,MAAM,CAAC;EACjE;;EAEA;AACJ;AACA;AACA;EACiByE,MAAMA,CAAA,EAAkB;IAAA,IAAAC,MAAA;IAAA,OAAAvD,iBAAA;MACjC,IAAMwD,cAAc,GAAGD,MAAI,CAAC5C,cAAc,CAAC,CAAC;MAC5C,KAAK,IAAM8C,GAAG,IAAID,cAAc,EAAE;QAC9B,MAAMC,GAAG,CAACH,MAAM,CAAC,CAAC;MACtB;MAEA,IAAMI,eAAe,GAAG,CAACpG,eAAe,CAACqG,MAAM,EAAErG,eAAe,CAACsG,KAAK,EAAEtG,eAAe,CAACuG,IAAI,CAAC;MAC7F,IAAMC,OAAO,GAAGP,MAAI,CAACxE,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAACsH,UAAU,CAAC;MAC3E,KAAK,IAAMC,MAAM,IAAIF,OAAO,EAAE;QAC1B,IAAMG,OAAO,GAAGD,MAAM,CAACjB,WAAW,CAAC,CAAC,KAAKQ,MAAI,CAAC3E,MAAM,CAACsF,SAAS,CAAC,CAAC;QAChE,IAAID,OAAO,IAAIP,eAAe,CAACS,QAAQ,CAACH,MAAM,CAACpE,UAAU,CAAC,CAAC,CAACwE,UAA8B,CAAC,EAAE;UACzF,IAAMtB,QAAQ,GAAGkB,MAAM,CAACjB,WAAW,CAAC,CAAC;UACrC,IAAI,CAACD,QAAQ,EAAE;YACX,MAAM,IAAI7D,KAAK,CAAC,gCAAgC,CAAC;UACrD;UACA,MAAMsE,MAAI,CAAC3E,MAAM,CAACnB,IAAI,CAAC8F,MAAI,CAAC1E,MAAM,EAAEiE,QAAQ,EAAE,cAAc,CAAC;QACjE;MACJ;MAEA,MAAMS,MAAI,CAAC3E,MAAM,CAACyF,KAAK,CAACd,MAAI,CAAC1E,MAAM,CAAC;IAAC;EACzC;EAEQyF,kBAAkBA,CAAC1B,QAAuB,EAAuC;IACrF,IAAM2B,OAA4C,GAAG3B,QAAQ,CACxDhC,GAAG,CAAE4D,CAAC,KAAM;MAAE3F,MAAM,EAAE2F,CAAC,CAACzB,WAAW,CAAC,CAAC;MAAE0B,KAAK,EAAED,CAAC,CAAC5E,UAAU,CAAC,CAAC,CAAC,OAAO;IAAE,CAAC,CAAC,CAAC,CACzE8E,MAAM,CAAEF,CAAC,IAAKA,CAAC,CAAC3F,MAAM,CAAwC;IACnE0F,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,CAACtG,MAAM,CAACI,OAAO,CAAC4F,CAAC,CAAC/F,MAAM,CAAC;QAC3C,IAAMsG,KAAK,GAAG,IAAI,CAACvG,MAAM,CAACI,OAAO,CAAC6F,CAAC,CAAChG,MAAM,CAAC;QAC3C,IAAI,CAACqG,KAAK,IAAI,CAACC,KAAK,EAAE;UAClB;UACA,OAAOnI,oBAAoB,CAAC4H,CAAC,CAAC/F,MAAM,EAAEgG,CAAC,CAAChG,MAAM,CAAC;QACnD;QAEA,IAAMuG,SAAS,IAAAN,qBAAA,IAAAC,sBAAA,GAAGG,KAAK,CAAC7F,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAAC4I,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,CAAC9F,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAAC4I,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,OAAOvI,oBAAoB,CAAC4H,CAAC,CAAC/F,MAAM,EAAEgG,CAAC,CAAChG,MAAM,CAAC;QACnD;QACA,OAAOuG,SAAS,GAAGG,SAAS;MAChC,CAAC,MAAM;QACH;QACA,OAAOvI,oBAAoB,CAAC4H,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,CAAC1G,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAAC8C,WAAW,CAAC;IAC5E,IAAMmG,MAAM,GAAGD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAACC,MAAM,EAAE,MAAM,IAAIzG,KAAK,CAAC,oDAAoD,CAAC;;IAElF;IACA;IACA,IAAM6D,QAAQ,GAAG4C,MAAM,CAAC3C,WAAW,CAAC,CAAC;IACrC,IAAI,CAACD,QAAQ,EAAE,MAAM,IAAI7D,KAAK,CAAC,+BAA+B,CAAC;IAC/D,IAAM0G,UAAU,GAAG,IAAI,CAAC/G,MAAM,CAACI,OAAO,CAAC8D,QAAQ,CAAC;IAChD,IAAI,CAAC6C,UAAU,EAAE,MAAM,IAAI1G,KAAK,CAAC,kCAAkC,CAAC;IAEpE,OAAO0G,UAAU;EACrB;;EAEA;AACJ;AACA;AACA;AACA;EACWC,QAAQA,CAAA,EAAW;IACtB,IAAI,IAAI,CAACzG,UAAU,EAAE,OAAO,CAAC,CAAC;IAE9B,IAAMwG,UAAU,GAAG,IAAI,CAACH,aAAa,CAAC,CAAC;IACvC,IAAM5C,QAAQ,GAAG+C,UAAU,CAACtG,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAAC+F,UAAU,CAAC;IAC7E,IAAM+B,OAAO,GAAG,IAAI,CAACD,kBAAkB,CAAC1B,QAAQ,CAAC;IAEjD,OAAO2B,OAAO,CAACsB,SAAS,CAAErB,CAAC,IAAKA,CAAC,CAAC3F,MAAM,KAAK,IAAI,CAACA,MAAM,CAAC;EAC7D;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACiBiH,QAAQA,CAACC,KAAa,EAAiB;IAAA,IAAAC,MAAA;IAAA,OAAAhG,iBAAA;MAAA,IAAAiG,sBAAA;MAChD,IAAID,MAAI,CAAC7G,UAAU,EAAE,MAAM,IAAIF,KAAK,CAAC,gDAAgD,CAAC;MAEtF,IAAM0G,UAAU,GAAGK,MAAI,CAACR,aAAa,CAAC,CAAC;MACvC,IAAM5C,QAAQ,GAAG+C,UAAU,CAACtG,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAAC+F,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,CAAC/E,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;MAExD,IAAM6G,YAAY,GAAGL,MAAI,CAACJ,QAAQ,CAAC,CAAC;MACpC,IAAMU,QAAQ,GAAGD,YAAY,GAAGN,KAAK;MACrC,IAAIO,QAAQ,IAAIP,KAAK,KAAKxB,OAAO,CAAC/E,MAAM,GAAG,CAAC,EAAE;QAC1CuG,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,GAAG1J,gBAAgB,CAAC,CAAC,CAAC;MAClC,IAAI2J,kBAAkB,GAAG,KAAK;MAC9B,IAAI,CAACH,IAAI,EAAE;QACP;QACA,IAAIC,IAAI,aAAJA,IAAI,eAAJA,IAAI,CAAE/B,KAAK,EAAE;UACbgC,QAAQ,GAAGvJ,UAAU,CAACsJ,IAAI,CAAC/B,KAAK,CAAC;QACrC;MACJ,CAAC,MAAM,IAAIsB,KAAK,KAAKxB,OAAO,CAAC/E,MAAM,GAAG,CAAC,EAAE;QACrC;QACA,IAAIgH,IAAI,aAAJA,IAAI,eAAJA,IAAI,CAAE/B,KAAK,EAAE;UACbgC,QAAQ,GAAGxJ,UAAU,CAACuJ,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,GAAGxJ,UAAU,CAAC0J,UAAU,CAAC;UACrC,CAAC,MAAM;YACHF,QAAQ,GAAG3J,qBAAqB,CAAC6J,UAAU,EAAEC,QAAQ,CAAC;UAC1D;QACJ,CAAC,MAAM;UACH,IAAID,UAAU,EAAE;YACZ;YACAF,QAAQ,GAAGxJ,UAAU,CAAC0J,UAAU,CAAC;UACrC,CAAC,MAAM,IAAIC,QAAQ,EAAE;YACjB;YACAH,QAAQ,GAAGvJ,UAAU,CAAC0J,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,GAAG5J,UAAU,CAAC4J,SAAS,CAAC,GAAG9J,gBAAgB,CAAC,CAAC,CAAC;YACnE,IAAMkK,aAAY,GAAGtB,UAAU,CAACtG,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAAC+F,UAAU,EAAEuE,MAAM,CAAClI,MAAM,CAAC;YAChG,IAAMqI,QAAO,IAAAF,qBAAA,GAAGC,aAAY,aAAZA,aAAY,uBAAZA,aAAY,CAAErH,UAAU,CAAyB,CAAC,cAAAoH,qBAAA,cAAAA,qBAAA,GAAI;cAClEvE,GAAG,EAAE,CAACuD,MAAI,CAACpH,MAAM,CAAC8D,SAAS,CAAC,CAAC;YACjC,CAAC;YACD,MAAMsD,MAAI,CAACpH,MAAM,CAACqB,cAAc,CAC5B0F,UAAU,CAAC9G,MAAM,EACjBpC,SAAS,CAAC+F,UAAU,EAAA2E,aAAA,CAAAA,aAAA,KAEbD,QAAO;cACVzC,KAAK,EAAEoC;YAAS,IAEpBE,MAAM,CAAClI,MACX,CAAC;UACL,CAAC,MAAM;YACHgI,SAAS,GAAGE,MAAM,CAACtC,KAAK;UAC5B;QACJ;QACA,IAAIoC,SAAS,EAAE;UACXJ,QAAQ,GAAGxJ,UAAU,CAAC4J,SAAS,CAAC;QACpC;MACJ;;MAEA;;MAEA;MACA,IAAMI,YAAY,GAAGtB,UAAU,CAACtG,YAAY,CAACC,cAAc,CAAC7C,SAAS,CAAC+F,UAAU,EAAEwD,MAAI,CAACnH,MAAM,CAAC;MAC9F,IAAMqI,OAAO,IAAAjB,sBAAA,GAAGgB,YAAY,aAAZA,YAAY,uBAAZA,YAAY,CAAErH,UAAU,CAAyB,CAAC,cAAAqG,sBAAA,cAAAA,sBAAA,GAAI;QAAExD,GAAG,EAAE,CAACuD,MAAI,CAACpH,MAAM,CAAC8D,SAAS,CAAC,CAAC;MAAG,CAAC;MACzG,MAAMsD,MAAI,CAACpH,MAAM,CAACqB,cAAc,CAC5B0F,UAAU,CAAC9G,MAAM,EACjBpC,SAAS,CAAC+F,UAAU,EAAA2E,aAAA,CAAAA,aAAA,KAEbD,OAAO;QAEV;QACAzC,KAAK,EAAEgC;MAAQ,IAEnBT,MAAI,CAACnH,MACT,CAAC;IAAC;EACN;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACiBuI,UAAUA,CACnBtH,IAAY,EACZuH,iBAA2B,EAC3BC,IAAmB,EACnBC,iBAA4B,EACD;IAAA,IAAAC,MAAA;IAAA,OAAAxH,iBAAA;MAC3B,IAAAyH,qBAAA,SAAmCD,MAAI,CAAC5I,MAAM,CAAC8I,aAAa,CAACL,iBAAiB,EAAE;UAC5EM,eAAe,EAAE;QACrB,CAAC,CAAC;QAFmBC,GAAG,GAAAH,qBAAA,CAAhBI,WAAW;MAGnBP,IAAI,CAACQ,GAAG,GAAGF,GAAG;MAEd,IAAMG,WAAwB,GAAG;QAC7BC,OAAO,EAAEtL,OAAO,CAACuL,IAAI;QACrBC,IAAI,EAAEpI,IAAI;QACVgI,GAAG,EAAEF,GAAG;QACRO,IAAI,EAAEb;MACV,CAAC;MAEDC,iBAAiB,GAAGA,iBAAiB,aAAjBA,iBAAiB,cAAjBA,iBAAiB,GAAI,CAAC,CAAC;MAC3C,IAAIA,iBAAiB,CAAC,eAAe,CAAC,EAAE;QACpC;QACA;QACA;QACAA,iBAAiB,CAAC,eAAe,CAAC,GAAGQ,WAAW;MACpD;MAEA,IAAMK,GAAG,SAASZ,MAAI,CAAC5I,MAAM,CAACyJ,WAAW,CAACb,MAAI,CAAC3I,MAAM,EAAAsI,aAAA,CAAAA,aAAA,CAAAA,aAAA,KAC9CI,iBAAiB,GACjBQ,WAAW;QACd,CAACnL,qBAAqB,CAACkD,IAAI,GAAG,CAAC;MAAC,EACpB,CAAC;MAEjB,MAAM0H,MAAI,CAAC5I,MAAM,CAACqB,cAAc,CAC5BuH,MAAI,CAAC3I,MAAM,EACXlC,uBAAuB,CAACmD,IAAI,EAC5B;QACIwI,MAAM,EAAE,IAAI;QACZxI,IAAI,EAAEA;MACV,CAAC,EACDsI,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,CAAC1J,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC3C,uBAAuB,CAACmD,IAAI,EAAE0I,WAAW,CAAC;IAC/F,OAAOC,MAAM,GAAG,IAAIrL,aAAa,CAAC,IAAI,CAACwB,MAAM,EAAE6J,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,CAAC9J,IAAI,CAACM,YAAY,CAACC,cAAc,CAAC3C,uBAAuB,CAACmD,IAAI,CAAC,cAAA+I,qBAAA,cAAAA,qBAAA,GAAI,EAAE;IAC1F,OAAOC,QAAQ,CAAClI,GAAG,CAAElB,CAAC,IAAK,IAAItC,aAAa,CAAC,IAAI,CAACwB,MAAM,EAAEc,CAAC,EAAE,IAAI,CAAC,CAAC;EACvE;AACJ","ignoreList":[]}
+{"version":3,"file":"MSC3089TreeSpace.js","names":[],"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 { type MatrixClient } from \"../client.ts\";\nimport { EventType, MsgType, UNSTABLE_MSC3089_BRANCH, UNSTABLE_MSC3089_LEAF } from \"../@types/event.ts\";\nimport { type Room } from \"./room.ts\";\nimport { logger } from \"../logger.ts\";\nimport { type IContent, type 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 { type ISendEventResponse } from \"../@types/requests.ts\";\nimport { type FileType, MatrixError } from \"../http-api/index.ts\";\nimport { KnownMembership } from \"../@types/membership.ts\";\nimport { type RoomPowerLevelsEventContent, type SpaceChildEventContent } from \"../@types/state_events.ts\";\nimport type { EncryptedFile, FileContent } from \"../@types/media.ts\";\nimport { type EmptyObject } from \"../@types/common.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]?: EmptyObject;\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 async retryInvite(userId: string): Promise<void> {\n        await simpleRetryOperation(\n            () => this.client.invite(this.roomId, userId),\n            (e) => {\n                // We don't want to retry permission errors forever...\n                if (e instanceof MatrixError && e.errcode === \"M_FORBIDDEN\") {\n                    return false;\n                }\n                return true;\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;;AAGA,SAAS,SAAS,EAAE,OAAO,EAAE,uBAAuB,EAAE,qBAAqB,QAAQ,oBAAoB;AAEvG,SAAS,MAAM,QAAQ,cAAc;AAErC,SACI,qBAAqB,EACrB,gBAAgB,EAChB,oBAAoB,EACpB,UAAU,EACV,UAAU,EACV,oBAAoB,QACjB,aAAa;AACpB,SAAS,aAAa,QAAQ,oBAAoB;AAElD,SAAwB,WAAW,QAAQ,sBAAsB;AACjE,SAAS,eAAe,QAAQ,yBAAyB;AAKzD;AACA;AACA;AACA;AACA,OAAO,MAAM,kCAAkC,GAAG;EAC9C;EACA,MAAM,EAAE,GAAG;EACX,IAAI,EAAE,GAAG;EACT,GAAG,EAAE,GAAG;EAER;EACA,MAAM,EAAE,EAAE;EACV,aAAa,EAAE,EAAE;EACjB,cAAc,EAAE,EAAE;EAElB;EACA,aAAa,EAAE,CAAC;EAEhB;EACA,MAAM,EAAE;IACJ,CAAC,SAAS,CAAC,eAAe,GAAG,GAAG;IAChC,CAAC,SAAS,CAAC,qBAAqB,GAAG,GAAG;IACtC,CAAC,SAAS,CAAC,aAAa,GAAG,GAAG;IAC9B,CAAC,SAAS,CAAC,cAAc,GAAG,GAAG;IAC/B,CAAC,SAAS,CAAC,QAAQ,GAAG,EAAE;IACxB,CAAC,SAAS,CAAC,WAAW,GAAG,EAAE;IAC3B,CAAC,SAAS,CAAC,oBAAoB,GAAG,EAAE;IACpC,CAAC,SAAS,CAAC,OAAO,GAAG;EACzB,CAAC;EAED,KAAK,EAAE,CAAC,CAAC,CAAE;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA,WAAY,eAAe,0BAAf,eAAe;EAAf,eAAe;EACJ;EADX,eAAe;EAEJ;EAFX,eAAe,qBAGN;EAAA,OAHT,eAAe;AAAA;AAY3B;AACA;AACA;AACA;AACA;AACA,OAAO,MAAM,gBAAgB,CAAC;EAGnB,WAAW,CACN,MAAoB,EACZ,MAAc,EAChC;IAAA;IAAA,KAFU,MAAoB,GAApB,MAAoB;IAAA,KACZ,MAAc,GAAd,MAAc;IAE9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAE;IAE7C,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC;EACnD;;EAEA;AACJ;AACA;EACI,IAAW,EAAE,GAAW;IACpB,OAAO,IAAI,CAAC,MAAM;EACtB;;EAEA;AACJ;AACA;EACI,IAAW,UAAU,GAAY;IAC7B;IACA;IACA,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,WAAW,CAAC;IACjF,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,IAAI;IACtC,OAAO,YAAY,CAAC,KAAK,CAAE,CAAC,IAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;EAC9D;;EAEA;AACJ;AACA;AACA;AACA;EACI,MAAa,OAAO,CAAC,IAAY,EAAiB;IAC9C,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,EAAE;MAAE;IAAK,CAAC,EAAE,EAAE,CAAC;EACnF;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACI,MAAa,MAAM,CAAC,MAAc,EAAE,YAAY,GAAG,IAAI,EAAiB;IACpE,MAAM,QAAyB,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAC5D,IAAI,YAAY,EAAE;MACd,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAE,CAAC,IAAK,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC;IACtF;IACA,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;EAC/B;EAEA,MAAc,WAAW,CAAC,MAAc,EAAiB;IACrD,MAAM,oBAAoB,CACtB,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAC5C,CAAC,IAAK;MACH;MACA,IAAI,CAAC,YAAY,WAAW,IAAI,CAAC,CAAC,OAAO,KAAK,aAAa,EAAE;QACzD,OAAO,KAAK;MAChB;MACA,OAAO,IAAI;IACf,CACJ,CAAC;EACL;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACI,MAAa,cAAc,CAAC,MAAc,EAAE,IAAqB,EAAiB;IAC9E,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,eAAe,EAAE,EAAE,CAAC;IACvF,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC;IAEzF,MAAM,GAAG,GAAG,UAAU,EAAE,UAAU,CAA8B,CAAC,IAAI,CAAC,CAAC;IACvE,MAAM,SAAS,GAAG,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC;IAC3C,MAAM,SAAS,GAAG,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;IAC7C,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC,eAAe,CAAC,IAAI,GAAG;IAEpE,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAChC,QAAQ,IAAI;MACR,KAAK,eAAe,CAAC,MAAM;QACvB,KAAK,CAAC,MAAM,CAAC,GAAG,SAAS;QACzB;MACJ,KAAK,eAAe,CAAC,MAAM;QACvB,KAAK,CAAC,MAAM,CAAC,GAAG,SAAS;QACzB;MACJ,KAAK,eAAe,CAAC,KAAK;QACtB,KAAK,CAAC,MAAM,CAAC,GAAG,UAAU;QAC1B;MACJ;QACI,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC;IAChD;IACA,GAAG,CAAC,OAAO,CAAC,GAAG,KAAK;IAEpB,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,eAAe,EAAE,GAAG,EAAE,EAAE,CAAC;EACrF;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACW,cAAc,CAAC,MAAc,EAAmB;IACnD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,eAAe,EAAE,EAAE,CAAC;IACvF,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC;IAEzF,MAAM,GAAG,GAAG,UAAU,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC;IAC3C,MAAM,SAAS,GAAG,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;IAC7C,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC,eAAe,CAAC,IAAI,GAAG;IAEpE,MAAM,SAAS,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,IAAI,SAAS;IACrD,IAAI,SAAS,IAAI,UAAU,EAAE,OAAO,eAAe,CAAC,KAAK;IACzD,IAAI,SAAS,IAAI,SAAS,EAAE,OAAO,eAAe,CAAC,MAAM;IACzD,OAAO,eAAe,CAAC,MAAM;EACjC;;EAEA;AACJ;AACA;AACA;AACA;EACI,MAAa,eAAe,CAAC,IAAY,EAA6B;IAClE,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,sBAAsB,CAAC,IAAI,CAAC;IAEhE,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAC5B,IAAI,CAAC,MAAM,EACX,SAAS,CAAC,UAAU,EACpB;MACI,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC,EACD,SAAS,CAAC,MACd,CAAC;IAED,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAC5B,SAAS,CAAC,MAAM,EAChB,SAAS,CAAC,WAAW,EACrB;MACI,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC,EACD,IAAI,CAAC,MACT,CAAC;IAED,OAAO,SAAS;EACpB;;EAEA;AACJ;AACA;AACA;EACW,cAAc,GAAuB;IACxC,MAAM,KAAyB,GAAG,EAAE;IACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,UAAU,CAAC;IAC5E,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;MAC1B,IAAI;QACA,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,QAAQ,EAAE;UACV,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,wBAAwB,CAAC,QAAQ,CAAC;UAC3D,IAAI,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QAC9B;MACJ,CAAC,CAAC,OAAO,CAAC,EAAE;QACR,MAAM,CAAC,IAAI,CAAC,kEAAkE,EAAE,CAAC,CAAC;MACtF;IACJ;IACA,OAAO,KAAK;EAChB;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACW,YAAY,CAAC,MAAc,EAAgC;IAC9D,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,IAAK,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC;EACjE;;EAEA;AACJ;AACA;AACA;EACI,MAAa,MAAM,GAAkB;IACjC,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE;MAC9B,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC;IACtB;IAEA,MAAM,eAAe,GAAG,CAAC,eAAe,CAAC,MAAM,EAAE,eAAe,CAAC,KAAK,EAAE,eAAe,CAAC,IAAI,CAAC;IAC7F,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,UAAU,CAAC;IAC3E,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;MAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;MAChE,IAAI,OAAO,IAAI,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,UAA8B,CAAC,EAAE;QACzF,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,EAAE;UACX,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC;QACrD;QACA,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,cAAc,CAAC;MACjE;IACJ;IAEA,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;EACxC;EAEQ,kBAAkB,CAAC,QAAuB,EAAuC;IACrF,MAAM,OAA4C,GAAG,QAAQ,CACxD,GAAG,CAAE,CAAC,KAAM;MAAE,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;MAAE,KAAK,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO;IAAE,CAAC,CAAC,CAAC,CACzE,MAAM,CAAE,CAAC,IAAK,CAAC,CAAC,MAAM,CAAwC;IACnE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK;MACnB,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE;QACrB,OAAO,CAAC,CAAC;MACb,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE;QAC5B,OAAO,CAAC;MACZ,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;QAC3C,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE;UAClB;UACA,OAAO,oBAAoB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;QACnD;QAEA,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,UAAU,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC;QAC3F,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,UAAU,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC;QAC3F,IAAI,SAAS,KAAK,SAAS,EAAE;UACzB,OAAO,oBAAoB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;QACnD;QACA,OAAO,SAAS,GAAG,SAAS;MAChC,CAAC,MAAM;QACH;QACA,OAAO,oBAAoB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC;MACjD;IACJ,CAAC,CAAC;IACF,OAAO,OAAO;EAClB;EAEQ,aAAa,GAAS;IAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,WAAW,CAAC;IAC5E,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC;;IAElF;IACA;IACA,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;IACrC,IAAI,CAAC,QAAQ,EAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC;IAC/D,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC;IAChD,IAAI,CAAC,UAAU,EAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC;IAEpE,OAAO,UAAU;EACrB;;EAEA;AACJ;AACA;AACA;AACA;EACW,QAAQ,GAAW;IACtB,IAAI,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAE9B,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,UAAU,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,UAAU,CAAC;IAC7E,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC;IAEjD,OAAO,OAAO,CAAC,SAAS,CAAE,CAAC,IAAK,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC;EAC7D;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACI,MAAa,QAAQ,CAAC,KAAa,EAAiB;IAChD,IAAI,IAAI,CAAC,UAAU,EAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC;IAEtF,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,UAAU,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,UAAU,CAAC;IAC7E,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC;IACjD,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAExD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,YAAY,GAAG,KAAK;IACrC,IAAI,QAAQ,IAAI,KAAK,KAAK,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;MAC1C,KAAK,EAAE;IACX,CAAC,MAAM,IAAI,CAAC,QAAQ,IAAI,KAAK,KAAK,CAAC,EAAE;MACjC,KAAK,EAAE;IACX;IAEA,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,GAAG,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,GAAG,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC;IAElD,IAAI,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC;IAClC,IAAI,kBAAkB,GAAG,KAAK;IAC9B,IAAI,CAAC,IAAI,EAAE;MACP;MACA,IAAI,IAAI,EAAE,KAAK,EAAE;QACb,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC;MACrC;IACJ,CAAC,MAAM,IAAI,KAAK,KAAK,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;MACrC;MACA,IAAI,IAAI,EAAE,KAAK,EAAE;QACb,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC;MACrC;IACJ,CAAC,MAAM;MACH;MACA,MAAM,UAAU,GAAG,IAAI,EAAE,KAAK;MAC9B,MAAM,QAAQ,GAAG,IAAI,EAAE,KAAK;MAC5B,IAAI,UAAU,IAAI,QAAQ,EAAE;QACxB,IAAI,UAAU,KAAK,QAAQ,EAAE;UACzB;UACA,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC;QACrC,CAAC,MAAM;UACH,QAAQ,GAAG,qBAAqB,CAAC,UAAU,EAAE,QAAQ,CAAC;QAC1D;MACJ,CAAC,MAAM;QACH,IAAI,UAAU,EAAE;UACZ;UACA,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC;QACrC,CAAC,MAAM,IAAI,QAAQ,EAAE;UACjB;UACA,QAAQ,GAAG,UAAU,CAAC,QAAQ,CAAC;QACnC,CAAC,MAAM;UACH;UACA;UACA;UACA;UACA,kBAAkB,GAAG,IAAI;QAC7B;MACJ;IACJ;IAEA,IAAI,kBAAkB,EAAE;MACpB;MACA;MACA;MACA,IAAI,SAA6B;MACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,EAAE;UACT,SAAS,GAAG,MAAM,CAAC,KAAK;QAC5B;QACA,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE;UACf;UACA,SAAS,GAAG,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC;UACnE,MAAM,YAAY,GAAG,UAAU,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC;UAChG,MAAM,OAAO,GAAG,YAAY,EAAE,UAAU,CAAyB,CAAC,IAAI;YAClE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;UACjC,CAAC;UACD,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAC5B,UAAU,CAAC,MAAM,EACjB,SAAS,CAAC,UAAU,kCAEb,OAAO;YACV,KAAK,EAAE;UAAS,IAEpB,MAAM,CAAC,MACX,CAAC;QACL,CAAC,MAAM;UACH,SAAS,GAAG,MAAM,CAAC,KAAK;QAC5B;MACJ;MACA,IAAI,SAAS,EAAE;QACX,QAAQ,GAAG,UAAU,CAAC,SAAS,CAAC;MACpC;IACJ;;IAEA;;IAEA;IACA,MAAM,YAAY,GAAG,UAAU,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC;IAC9F,MAAM,OAAO,GAAG,YAAY,EAAE,UAAU,CAAyB,CAAC,IAAI;MAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAAG,CAAC;IACzG,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAC5B,UAAU,CAAC,MAAM,EACjB,SAAS,CAAC,UAAU,kCAEb,OAAO;MAEV;MACA,KAAK,EAAE;IAAQ,IAEnB,IAAI,CAAC,MACT,CAAC;EACL;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACI,MAAa,UAAU,CACnB,IAAY,EACZ,iBAA2B,EAC3B,IAAmB,EACnB,iBAA4B,EACD;IAC3B,MAAM;MAAE,WAAW,EAAE;IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,iBAAiB,EAAE;MAC5E,eAAe,EAAE;IACrB,CAAC,CAAC;IACF,IAAI,CAAC,GAAG,GAAG,GAAG;IAEd,MAAM,WAAwB,GAAG;MAC7B,OAAO,EAAE,OAAO,CAAC,IAAI;MACrB,IAAI,EAAE,IAAI;MACV,GAAG,EAAE,GAAG;MACR,IAAI,EAAE;IACV,CAAC;IAED,iBAAiB,GAAG,iBAAiB,IAAI,CAAC,CAAC;IAC3C,IAAI,iBAAiB,CAAC,eAAe,CAAC,EAAE;MACpC;MACA;MACA;MACA,iBAAiB,CAAC,eAAe,CAAC,GAAG,WAAW;IACpD;IAEA,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,gDAC9C,iBAAiB,GACjB,WAAW;MACd,CAAC,qBAAqB,CAAC,IAAI,GAAG,CAAC;IAAC,EACpB,CAAC;IAEjB,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAC5B,IAAI,CAAC,MAAM,EACX,uBAAuB,CAAC,IAAI,EAC5B;MACI,MAAM,EAAE,IAAI;MACZ,IAAI,EAAE;IACV,CAAC,EACD,GAAG,CAAC,UAAU,CAClB,CAAC;IAED,OAAO,GAAG;EACd;;EAEA;AACJ;AACA;AACA;AACA;EACW,OAAO,CAAC,WAAmB,EAAwB;IACtD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,uBAAuB,CAAC,IAAI,EAAE,WAAW,CAAC;IAC/F,OAAO,MAAM,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI;EACvE;;EAEA;AACJ;AACA;AACA;EACW,SAAS,GAAoB;IAChC,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,IAAK,CAAC,CAAC,QAAQ,CAAC;EACxD;;EAEA;AACJ;AACA;AACA;EACW,YAAY,GAAoB;IACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,EAAE;IAC1F,OAAO,QAAQ,CAAC,GAAG,CAAE,CAAC,IAAK,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;EACvE;AACJ","ignoreList":[]}

package/lib/models/ToDeviceMessage.js

@@ -1 +1,3 @@
-export {};
+export {};
+export {};
+//# sourceMappingURL=ToDeviceMessage.js.map

package/lib/models/beacon.js

@@ -18,7 +18,7 @@ limitations under the License.
 import { parseBeaconContent, parseBeaconInfoContent } from "../content-helpers.js";
 import { sortEventsByLatestContentTimestamp } from "../utils.js";
 import { TypedEventEmitter } from "./typed-event-emitter.js";
-export var BeaconEvent = /*#__PURE__*/function (BeaconEvent) {
+export let BeaconEvent = /*#__PURE__*/function (BeaconEvent) {
   BeaconEvent["New"] = "Beacon.new";
   BeaconEvent["Update"] = "Beacon.update";
   BeaconEvent["LivenessChange"] = "Beacon.LivenessChange";
@@ -26,18 +26,17 @@ export var BeaconEvent = /*#__PURE__*/function (BeaconEvent) {
   BeaconEvent["LocationUpdate"] = "Beacon.LocationUpdate";
   return BeaconEvent;
 }({});
-export var isTimestampInDuration = (startTimestamp, durationMs, timestamp) => timestamp >= startTimestamp && startTimestamp + durationMs >= timestamp;
+export const isTimestampInDuration = (startTimestamp, durationMs, timestamp) => timestamp >= startTimestamp && startTimestamp + durationMs >= timestamp;
 
 // beacon info events are uniquely identified by
 // `<roomId>_<state_key>`
 
-export var getBeaconInfoIdentifier = event => "".concat(event.getRoomId(), "_").concat(event.getStateKey());
+export const getBeaconInfoIdentifier = event => `${event.getRoomId()}_${event.getStateKey()}`;
 
 // https://github.com/matrix-org/matrix-spec-proposals/pull/3672
 export class Beacon extends TypedEventEmitter {
   constructor(rootEvent) {
     super();
-    this.rootEvent = rootEvent;
     _defineProperty(this, "roomId", void 0);
     // beaconInfo is assigned by setBeaconInfo in the constructor
     // ! to make tsc believe it is definitely assigned
@@ -49,6 +48,7 @@ export class Beacon extends TypedEventEmitter {
       this._latestLocationEvent = undefined;
       this.emit(BeaconEvent.LocationUpdate, this.latestLocationState);
     });
+    this.rootEvent = rootEvent;
     this.roomId = this.rootEvent.getRoomId();
     this.setBeaconInfo(this.rootEvent);
   }
@@ -108,7 +108,7 @@ export class Beacon extends TypedEventEmitter {
     this.checkLiveness();
     if (!this.beaconInfo) return;
     if (this.isLive) {
-      var expiryInMs = this.beaconInfo.timestamp + this.beaconInfo.timeout - Date.now();
+      const expiryInMs = this.beaconInfo.timestamp + this.beaconInfo.timeout - Date.now();
       if (expiryInMs > 1) {
         this.livenessWatchTimeout = setTimeout(() => {
           this.monitorLiveness();
@@ -128,23 +128,24 @@ export class Beacon extends TypedEventEmitter {
    * Emits BeaconEvent.LocationUpdate
    */
   addLocations(beaconLocationEvents) {
-    var _validLocationEvents$;
     // discard locations for beacons that are not live
     if (!this.isLive) {
       return;
     }
-    var validLocationEvents = beaconLocationEvents.filter(event => {
-      var content = event.getContent();
-      var parsed = parseBeaconContent(content);
+    const validLocationEvents = beaconLocationEvents.filter(event => {
+      const content = event.getContent();
+      const parsed = parseBeaconContent(content);
       if (!parsed.uri || !parsed.timestamp) return false; // we won't be able to process these
-      var timestamp = parsed.timestamp;
+      const {
+        timestamp
+      } = parsed;
       return this._beaconInfo.timestamp &&
       // only include positions that were taken inside the beacon's live period
       isTimestampInDuration(this._beaconInfo.timestamp, this._beaconInfo.timeout, timestamp) && (
       // ignore positions older than our current latest location
       !this.latestLocationState || timestamp > this.latestLocationState.timestamp);
     });
-    var latestLocationEvent = (_validLocationEvents$ = validLocationEvents.sort(sortEventsByLatestContentTimestamp)) === null || _validLocationEvents$ === void 0 ? void 0 : _validLocationEvents$[0];
+    const latestLocationEvent = validLocationEvents.sort(sortEventsByLatestContentTimestamp)?.[0];
     if (latestLocationEvent) {
       this._latestLocationEvent = latestLocationEvent;
       this.emit(BeaconEvent.LocationUpdate, this.latestLocationState);
@@ -155,14 +156,14 @@ export class Beacon extends TypedEventEmitter {
     this.checkLiveness();
   }
   checkLiveness() {
-    var prevLiveness = this.isLive;
+    const prevLiveness = this.isLive;
 
     // element web sets a beacon's start timestamp to the senders local current time
     // when Alice's system clock deviates slightly from Bob's a beacon Alice intended to be live
     // may have a start timestamp in the future from Bob's POV
     // handle this by adding 6min of leniency to the start timestamp when it is in the future
     if (!this.beaconInfo) return;
-    var startTimestamp = this.beaconInfo.timestamp > Date.now() ? this.beaconInfo.timestamp - 360000 /* 6min */ : this.beaconInfo.timestamp;
+    const startTimestamp = this.beaconInfo.timestamp > Date.now() ? this.beaconInfo.timestamp - 360000 /* 6min */ : this.beaconInfo.timestamp;
     this._isLive = !!this._beaconInfo.live && !!startTimestamp && isTimestampInDuration(startTimestamp, this._beaconInfo.timeout, Date.now());
     if (prevLiveness !== this.isLive) {
       this.emit(BeaconEvent.LivenessChange, this.isLive, this);

package/lib/models/beacon.js.map

@@ -1 +1 @@
-{"version":3,"file":"beacon.js","names":["parseBeaconContent","parseBeaconInfoContent","sortEventsByLatestContentTimestamp","TypedEventEmitter","BeaconEvent","isTimestampInDuration","startTimestamp","durationMs","timestamp","getBeaconInfoIdentifier","event","concat","getRoomId","getStateKey","Beacon","constructor","rootEvent","_defineProperty","_latestLocationEvent","undefined","emit","LocationUpdate","latestLocationState","roomId","setBeaconInfo","isLive","_isLive","identifier","beaconInfoId","getId","beaconInfoOwner","beaconInfoEventType","getType","beaconInfo","_beaconInfo","getContent","latestLocationEvent","update","beaconInfoEvent","Error","getTs","Update","clearLatestLocation","destroy","livenessWatchTimeout","clearTimeout","Destroy","monitorLiveness","checkLiveness","expiryInMs","timeout","Date","now","setTimeout","addLocations","beaconLocationEvents","_validLocationEvents$","validLocationEvents","filter","content","parsed","uri","sort","prevLiveness","live","LivenessChange"],"sources":["../../src/models/beacon.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\nimport { type MBeaconEventContent } from \"../@types/beacon.ts\";\nimport {\n    type BeaconInfoState,\n    type BeaconLocationState,\n    parseBeaconContent,\n    parseBeaconInfoContent,\n} from \"../content-helpers.ts\";\nimport { type MatrixEvent } from \"./event.ts\";\nimport { sortEventsByLatestContentTimestamp } from \"../utils.ts\";\nimport { TypedEventEmitter } from \"./typed-event-emitter.ts\";\n\nexport enum BeaconEvent {\n    New = \"Beacon.new\",\n    Update = \"Beacon.update\",\n    LivenessChange = \"Beacon.LivenessChange\",\n    Destroy = \"Beacon.Destroy\",\n    LocationUpdate = \"Beacon.LocationUpdate\",\n}\n\nexport type BeaconEventHandlerMap = {\n    [BeaconEvent.Update]: (event: MatrixEvent, beacon: Beacon) => void;\n    [BeaconEvent.LivenessChange]: (isLive: boolean, beacon: Beacon) => void;\n    [BeaconEvent.Destroy]: (beaconIdentifier: string) => void;\n    [BeaconEvent.LocationUpdate]: (locationState: BeaconLocationState) => void;\n};\n\nexport const isTimestampInDuration = (startTimestamp: number, durationMs: number, timestamp: number): boolean =>\n    timestamp >= startTimestamp && startTimestamp + durationMs >= timestamp;\n\n// beacon info events are uniquely identified by\n// `<roomId>_<state_key>`\nexport type BeaconIdentifier = string;\nexport const getBeaconInfoIdentifier = (event: MatrixEvent): BeaconIdentifier =>\n    `${event.getRoomId()}_${event.getStateKey()}`;\n\n// https://github.com/matrix-org/matrix-spec-proposals/pull/3672\nexport class Beacon extends TypedEventEmitter<Exclude<BeaconEvent, BeaconEvent.New>, BeaconEventHandlerMap> {\n    public readonly roomId: string;\n    // beaconInfo is assigned by setBeaconInfo in the constructor\n    // ! to make tsc believe it is definitely assigned\n    private _beaconInfo!: BeaconInfoState;\n    private _isLive?: boolean;\n    private livenessWatchTimeout?: ReturnType<typeof setTimeout>;\n    private _latestLocationEvent?: MatrixEvent;\n\n    public constructor(private rootEvent: MatrixEvent) {\n        super();\n        this.roomId = this.rootEvent.getRoomId()!;\n        this.setBeaconInfo(this.rootEvent);\n    }\n\n    public get isLive(): boolean {\n        return !!this._isLive;\n    }\n\n    public get identifier(): BeaconIdentifier {\n        return getBeaconInfoIdentifier(this.rootEvent);\n    }\n\n    public get beaconInfoId(): string {\n        return this.rootEvent.getId()!;\n    }\n\n    public get beaconInfoOwner(): string {\n        return this.rootEvent.getStateKey()!;\n    }\n\n    public get beaconInfoEventType(): string {\n        return this.rootEvent.getType();\n    }\n\n    public get beaconInfo(): BeaconInfoState {\n        return this._beaconInfo;\n    }\n\n    public get latestLocationState(): BeaconLocationState | undefined {\n        return this._latestLocationEvent && parseBeaconContent(this._latestLocationEvent.getContent());\n    }\n\n    public get latestLocationEvent(): MatrixEvent | undefined {\n        return this._latestLocationEvent;\n    }\n\n    public update(beaconInfoEvent: MatrixEvent): void {\n        if (getBeaconInfoIdentifier(beaconInfoEvent) !== this.identifier) {\n            throw new Error(\"Invalid updating event\");\n        }\n        // don't update beacon with an older event\n        if (beaconInfoEvent.getTs() < this.rootEvent.getTs()) {\n            return;\n        }\n        this.rootEvent = beaconInfoEvent;\n        this.setBeaconInfo(this.rootEvent);\n\n        this.emit(BeaconEvent.Update, beaconInfoEvent, this);\n        this.clearLatestLocation();\n    }\n\n    public destroy(): void {\n        if (this.livenessWatchTimeout) {\n            clearTimeout(this.livenessWatchTimeout);\n        }\n\n        this._isLive = false;\n        this.emit(BeaconEvent.Destroy, this.identifier);\n    }\n\n    /**\n     * Monitor liveness of a beacon\n     * Emits BeaconEvent.LivenessChange when beacon expires\n     */\n    public monitorLiveness(): void {\n        if (this.livenessWatchTimeout) {\n            clearTimeout(this.livenessWatchTimeout);\n        }\n\n        this.checkLiveness();\n        if (!this.beaconInfo) return;\n        if (this.isLive) {\n            const expiryInMs = this.beaconInfo.timestamp! + this.beaconInfo.timeout - Date.now();\n            if (expiryInMs > 1) {\n                this.livenessWatchTimeout = setTimeout(() => {\n                    this.monitorLiveness();\n                }, expiryInMs);\n            }\n        } else if (this.beaconInfo.timestamp! > Date.now()) {\n            // beacon start timestamp is in the future\n            // check liveness again then\n            this.livenessWatchTimeout = setTimeout(() => {\n                this.monitorLiveness();\n            }, this.beaconInfo.timestamp! - Date.now());\n        }\n    }\n\n    /**\n     * Process Beacon locations\n     * Emits BeaconEvent.LocationUpdate\n     */\n    public addLocations(beaconLocationEvents: MatrixEvent[]): void {\n        // discard locations for beacons that are not live\n        if (!this.isLive) {\n            return;\n        }\n\n        const validLocationEvents = beaconLocationEvents.filter((event) => {\n            const content = event.getContent<MBeaconEventContent>();\n            const parsed = parseBeaconContent(content);\n            if (!parsed.uri || !parsed.timestamp) return false; // we won't be able to process these\n            const { timestamp } = parsed;\n            return (\n                this._beaconInfo.timestamp &&\n                // only include positions that were taken inside the beacon's live period\n                isTimestampInDuration(this._beaconInfo.timestamp, this._beaconInfo.timeout, timestamp) &&\n                // ignore positions older than our current latest location\n                (!this.latestLocationState || timestamp > this.latestLocationState.timestamp!)\n            );\n        });\n        const latestLocationEvent = validLocationEvents.sort(sortEventsByLatestContentTimestamp)?.[0];\n\n        if (latestLocationEvent) {\n            this._latestLocationEvent = latestLocationEvent;\n            this.emit(BeaconEvent.LocationUpdate, this.latestLocationState!);\n        }\n    }\n\n    private clearLatestLocation = (): void => {\n        this._latestLocationEvent = undefined;\n        this.emit(BeaconEvent.LocationUpdate, this.latestLocationState!);\n    };\n\n    private setBeaconInfo(event: MatrixEvent): void {\n        this._beaconInfo = parseBeaconInfoContent(event.getContent());\n        this.checkLiveness();\n    }\n\n    private checkLiveness(): void {\n        const prevLiveness = this.isLive;\n\n        // element web sets a beacon's start timestamp to the senders local current time\n        // when Alice's system clock deviates slightly from Bob's a beacon Alice intended to be live\n        // may have a start timestamp in the future from Bob's POV\n        // handle this by adding 6min of leniency to the start timestamp when it is in the future\n        if (!this.beaconInfo) return;\n        const startTimestamp =\n            this.beaconInfo.timestamp! > Date.now()\n                ? this.beaconInfo.timestamp! - 360000 /* 6min */\n                : this.beaconInfo.timestamp;\n        this._isLive =\n            !!this._beaconInfo.live &&\n            !!startTimestamp &&\n            isTimestampInDuration(startTimestamp, this._beaconInfo.timeout, Date.now());\n\n        if (prevLiveness !== this.isLive) {\n            this.emit(BeaconEvent.LivenessChange, this.isLive, this);\n        }\n    }\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAGA,SAGIA,kBAAkB,EAClBC,sBAAsB,QACnB,uBAAuB;AAE9B,SAASC,kCAAkC,QAAQ,aAAa;AAChE,SAASC,iBAAiB,QAAQ,0BAA0B;AAE5D,WAAYC,WAAW,0BAAXA,WAAW;EAAXA,WAAW;EAAXA,WAAW;EAAXA,WAAW;EAAXA,WAAW;EAAXA,WAAW;EAAA,OAAXA,WAAW;AAAA;AAevB,OAAO,IAAMC,qBAAqB,GAAGA,CAACC,cAAsB,EAAEC,UAAkB,EAAEC,SAAiB,KAC/FA,SAAS,IAAIF,cAAc,IAAIA,cAAc,GAAGC,UAAU,IAAIC,SAAS;;AAE3E;AACA;;AAEA,OAAO,IAAMC,uBAAuB,GAAIC,KAAkB,OAAAC,MAAA,CACnDD,KAAK,CAACE,SAAS,CAAC,CAAC,OAAAD,MAAA,CAAID,KAAK,CAACG,WAAW,CAAC,CAAC,CAAE;;AAEjD;AACA,OAAO,MAAMC,MAAM,SAASX,iBAAiB,CAA+D;EASjGY,WAAWA,CAASC,SAAsB,EAAE;IAC/C,KAAK,CAAC,CAAC;IAAC,KADeA,SAAsB,GAAtBA,SAAsB;IAAAC,eAAA;IAPjD;IACA;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA,8BA8H8B,MAAY;MACtC,IAAI,CAACC,oBAAoB,GAAGC,SAAS;MACrC,IAAI,CAACC,IAAI,CAAChB,WAAW,CAACiB,cAAc,EAAE,IAAI,CAACC,mBAAoB,CAAC;IACpE,CAAC;IAzHG,IAAI,CAACC,MAAM,GAAG,IAAI,CAACP,SAAS,CAACJ,SAAS,CAAC,CAAE;IACzC,IAAI,CAACY,aAAa,CAAC,IAAI,CAACR,SAAS,CAAC;EACtC;EAEA,IAAWS,MAAMA,CAAA,EAAY;IACzB,OAAO,CAAC,CAAC,IAAI,CAACC,OAAO;EACzB;EAEA,IAAWC,UAAUA,CAAA,EAAqB;IACtC,OAAOlB,uBAAuB,CAAC,IAAI,CAACO,SAAS,CAAC;EAClD;EAEA,IAAWY,YAAYA,CAAA,EAAW;IAC9B,OAAO,IAAI,CAACZ,SAAS,CAACa,KAAK,CAAC,CAAC;EACjC;EAEA,IAAWC,eAAeA,CAAA,EAAW;IACjC,OAAO,IAAI,CAACd,SAAS,CAACH,WAAW,CAAC,CAAC;EACvC;EAEA,IAAWkB,mBAAmBA,CAAA,EAAW;IACrC,OAAO,IAAI,CAACf,SAAS,CAACgB,OAAO,CAAC,CAAC;EACnC;EAEA,IAAWC,UAAUA,CAAA,EAAoB;IACrC,OAAO,IAAI,CAACC,WAAW;EAC3B;EAEA,IAAWZ,mBAAmBA,CAAA,EAAoC;IAC9D,OAAO,IAAI,CAACJ,oBAAoB,IAAIlB,kBAAkB,CAAC,IAAI,CAACkB,oBAAoB,CAACiB,UAAU,CAAC,CAAC,CAAC;EAClG;EAEA,IAAWC,mBAAmBA,CAAA,EAA4B;IACtD,OAAO,IAAI,CAAClB,oBAAoB;EACpC;EAEOmB,MAAMA,CAACC,eAA4B,EAAQ;IAC9C,IAAI7B,uBAAuB,CAAC6B,eAAe,CAAC,KAAK,IAAI,CAACX,UAAU,EAAE;MAC9D,MAAM,IAAIY,KAAK,CAAC,wBAAwB,CAAC;IAC7C;IACA;IACA,IAAID,eAAe,CAACE,KAAK,CAAC,CAAC,GAAG,IAAI,CAACxB,SAAS,CAACwB,KAAK,CAAC,CAAC,EAAE;MAClD;IACJ;IACA,IAAI,CAACxB,SAAS,GAAGsB,eAAe;IAChC,IAAI,CAACd,aAAa,CAAC,IAAI,CAACR,SAAS,CAAC;IAElC,IAAI,CAACI,IAAI,CAAChB,WAAW,CAACqC,MAAM,EAAEH,eAAe,EAAE,IAAI,CAAC;IACpD,IAAI,CAACI,mBAAmB,CAAC,CAAC;EAC9B;EAEOC,OAAOA,CAAA,EAAS;IACnB,IAAI,IAAI,CAACC,oBAAoB,EAAE;MAC3BC,YAAY,CAAC,IAAI,CAACD,oBAAoB,CAAC;IAC3C;IAEA,IAAI,CAAClB,OAAO,GAAG,KAAK;IACpB,IAAI,CAACN,IAAI,CAAChB,WAAW,CAAC0C,OAAO,EAAE,IAAI,CAACnB,UAAU,CAAC;EACnD;;EAEA;AACJ;AACA;AACA;EACWoB,eAAeA,CAAA,EAAS;IAC3B,IAAI,IAAI,CAACH,oBAAoB,EAAE;MAC3BC,YAAY,CAAC,IAAI,CAACD,oBAAoB,CAAC;IAC3C;IAEA,IAAI,CAACI,aAAa,CAAC,CAAC;IACpB,IAAI,CAAC,IAAI,CAACf,UAAU,EAAE;IACtB,IAAI,IAAI,CAACR,MAAM,EAAE;MACb,IAAMwB,UAAU,GAAG,IAAI,CAAChB,UAAU,CAACzB,SAAS,GAAI,IAAI,CAACyB,UAAU,CAACiB,OAAO,GAAGC,IAAI,CAACC,GAAG,CAAC,CAAC;MACpF,IAAIH,UAAU,GAAG,CAAC,EAAE;QAChB,IAAI,CAACL,oBAAoB,GAAGS,UAAU,CAAC,MAAM;UACzC,IAAI,CAACN,eAAe,CAAC,CAAC;QAC1B,CAAC,EAAEE,UAAU,CAAC;MAClB;IACJ,CAAC,MAAM,IAAI,IAAI,CAAChB,UAAU,CAACzB,SAAS,GAAI2C,IAAI,CAACC,GAAG,CAAC,CAAC,EAAE;MAChD;MACA;MACA,IAAI,CAACR,oBAAoB,GAAGS,UAAU,CAAC,MAAM;QACzC,IAAI,CAACN,eAAe,CAAC,CAAC;MAC1B,CAAC,EAAE,IAAI,CAACd,UAAU,CAACzB,SAAS,GAAI2C,IAAI,CAACC,GAAG,CAAC,CAAC,CAAC;IAC/C;EACJ;;EAEA;AACJ;AACA;AACA;EACWE,YAAYA,CAACC,oBAAmC,EAAQ;IAAA,IAAAC,qBAAA;IAC3D;IACA,IAAI,CAAC,IAAI,CAAC/B,MAAM,EAAE;MACd;IACJ;IAEA,IAAMgC,mBAAmB,GAAGF,oBAAoB,CAACG,MAAM,CAAEhD,KAAK,IAAK;MAC/D,IAAMiD,OAAO,GAAGjD,KAAK,CAACyB,UAAU,CAAsB,CAAC;MACvD,IAAMyB,MAAM,GAAG5D,kBAAkB,CAAC2D,OAAO,CAAC;MAC1C,IAAI,CAACC,MAAM,CAACC,GAAG,IAAI,CAACD,MAAM,CAACpD,SAAS,EAAE,OAAO,KAAK,CAAC,CAAC;MACpD,IAAQA,SAAS,GAAKoD,MAAM,CAApBpD,SAAS;MACjB,OACI,IAAI,CAAC0B,WAAW,CAAC1B,SAAS;MAC1B;MACAH,qBAAqB,CAAC,IAAI,CAAC6B,WAAW,CAAC1B,SAAS,EAAE,IAAI,CAAC0B,WAAW,CAACgB,OAAO,EAAE1C,SAAS,CAAC;MACtF;MACC,CAAC,IAAI,CAACc,mBAAmB,IAAId,SAAS,GAAG,IAAI,CAACc,mBAAmB,CAACd,SAAU,CAAC;IAEtF,CAAC,CAAC;IACF,IAAM4B,mBAAmB,IAAAoB,qBAAA,GAAGC,mBAAmB,CAACK,IAAI,CAAC5D,kCAAkC,CAAC,cAAAsD,qBAAA,uBAA5DA,qBAAA,CAA+D,CAAC,CAAC;IAE7F,IAAIpB,mBAAmB,EAAE;MACrB,IAAI,CAAClB,oBAAoB,GAAGkB,mBAAmB;MAC/C,IAAI,CAAChB,IAAI,CAAChB,WAAW,CAACiB,cAAc,EAAE,IAAI,CAACC,mBAAoB,CAAC;IACpE;EACJ;EAOQE,aAAaA,CAACd,KAAkB,EAAQ;IAC5C,IAAI,CAACwB,WAAW,GAAGjC,sBAAsB,CAACS,KAAK,CAACyB,UAAU,CAAC,CAAC,CAAC;IAC7D,IAAI,CAACa,aAAa,CAAC,CAAC;EACxB;EAEQA,aAAaA,CAAA,EAAS;IAC1B,IAAMe,YAAY,GAAG,IAAI,CAACtC,MAAM;;IAEhC;IACA;IACA;IACA;IACA,IAAI,CAAC,IAAI,CAACQ,UAAU,EAAE;IACtB,IAAM3B,cAAc,GAChB,IAAI,CAAC2B,UAAU,CAACzB,SAAS,GAAI2C,IAAI,CAACC,GAAG,CAAC,CAAC,GACjC,IAAI,CAACnB,UAAU,CAACzB,SAAS,GAAI,MAAM,CAAC,aACpC,IAAI,CAACyB,UAAU,CAACzB,SAAS;IACnC,IAAI,CAACkB,OAAO,GACR,CAAC,CAAC,IAAI,CAACQ,WAAW,CAAC8B,IAAI,IACvB,CAAC,CAAC1D,cAAc,IAChBD,qBAAqB,CAACC,cAAc,EAAE,IAAI,CAAC4B,WAAW,CAACgB,OAAO,EAAEC,IAAI,CAACC,GAAG,CAAC,CAAC,CAAC;IAE/E,IAAIW,YAAY,KAAK,IAAI,CAACtC,MAAM,EAAE;MAC9B,IAAI,CAACL,IAAI,CAAChB,WAAW,CAAC6D,cAAc,EAAE,IAAI,CAACxC,MAAM,EAAE,IAAI,CAAC;IAC5D;EACJ;AACJ","ignoreList":[]}
+{"version":3,"file":"beacon.js","names":[],"sources":["../../src/models/beacon.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\nimport { type MBeaconEventContent } from \"../@types/beacon.ts\";\nimport {\n    type BeaconInfoState,\n    type BeaconLocationState,\n    parseBeaconContent,\n    parseBeaconInfoContent,\n} from \"../content-helpers.ts\";\nimport { type MatrixEvent } from \"./event.ts\";\nimport { sortEventsByLatestContentTimestamp } from \"../utils.ts\";\nimport { TypedEventEmitter } from \"./typed-event-emitter.ts\";\n\nexport enum BeaconEvent {\n    New = \"Beacon.new\",\n    Update = \"Beacon.update\",\n    LivenessChange = \"Beacon.LivenessChange\",\n    Destroy = \"Beacon.Destroy\",\n    LocationUpdate = \"Beacon.LocationUpdate\",\n}\n\nexport type BeaconEventHandlerMap = {\n    [BeaconEvent.Update]: (event: MatrixEvent, beacon: Beacon) => void;\n    [BeaconEvent.LivenessChange]: (isLive: boolean, beacon: Beacon) => void;\n    [BeaconEvent.Destroy]: (beaconIdentifier: string) => void;\n    [BeaconEvent.LocationUpdate]: (locationState: BeaconLocationState) => void;\n};\n\nexport const isTimestampInDuration = (startTimestamp: number, durationMs: number, timestamp: number): boolean =>\n    timestamp >= startTimestamp && startTimestamp + durationMs >= timestamp;\n\n// beacon info events are uniquely identified by\n// `<roomId>_<state_key>`\nexport type BeaconIdentifier = string;\nexport const getBeaconInfoIdentifier = (event: MatrixEvent): BeaconIdentifier =>\n    `${event.getRoomId()}_${event.getStateKey()}`;\n\n// https://github.com/matrix-org/matrix-spec-proposals/pull/3672\nexport class Beacon extends TypedEventEmitter<Exclude<BeaconEvent, BeaconEvent.New>, BeaconEventHandlerMap> {\n    public readonly roomId: string;\n    // beaconInfo is assigned by setBeaconInfo in the constructor\n    // ! to make tsc believe it is definitely assigned\n    private _beaconInfo!: BeaconInfoState;\n    private _isLive?: boolean;\n    private livenessWatchTimeout?: ReturnType<typeof setTimeout>;\n    private _latestLocationEvent?: MatrixEvent;\n\n    public constructor(private rootEvent: MatrixEvent) {\n        super();\n        this.roomId = this.rootEvent.getRoomId()!;\n        this.setBeaconInfo(this.rootEvent);\n    }\n\n    public get isLive(): boolean {\n        return !!this._isLive;\n    }\n\n    public get identifier(): BeaconIdentifier {\n        return getBeaconInfoIdentifier(this.rootEvent);\n    }\n\n    public get beaconInfoId(): string {\n        return this.rootEvent.getId()!;\n    }\n\n    public get beaconInfoOwner(): string {\n        return this.rootEvent.getStateKey()!;\n    }\n\n    public get beaconInfoEventType(): string {\n        return this.rootEvent.getType();\n    }\n\n    public get beaconInfo(): BeaconInfoState {\n        return this._beaconInfo;\n    }\n\n    public get latestLocationState(): BeaconLocationState | undefined {\n        return this._latestLocationEvent && parseBeaconContent(this._latestLocationEvent.getContent());\n    }\n\n    public get latestLocationEvent(): MatrixEvent | undefined {\n        return this._latestLocationEvent;\n    }\n\n    public update(beaconInfoEvent: MatrixEvent): void {\n        if (getBeaconInfoIdentifier(beaconInfoEvent) !== this.identifier) {\n            throw new Error(\"Invalid updating event\");\n        }\n        // don't update beacon with an older event\n        if (beaconInfoEvent.getTs() < this.rootEvent.getTs()) {\n            return;\n        }\n        this.rootEvent = beaconInfoEvent;\n        this.setBeaconInfo(this.rootEvent);\n\n        this.emit(BeaconEvent.Update, beaconInfoEvent, this);\n        this.clearLatestLocation();\n    }\n\n    public destroy(): void {\n        if (this.livenessWatchTimeout) {\n            clearTimeout(this.livenessWatchTimeout);\n        }\n\n        this._isLive = false;\n        this.emit(BeaconEvent.Destroy, this.identifier);\n    }\n\n    /**\n     * Monitor liveness of a beacon\n     * Emits BeaconEvent.LivenessChange when beacon expires\n     */\n    public monitorLiveness(): void {\n        if (this.livenessWatchTimeout) {\n            clearTimeout(this.livenessWatchTimeout);\n        }\n\n        this.checkLiveness();\n        if (!this.beaconInfo) return;\n        if (this.isLive) {\n            const expiryInMs = this.beaconInfo.timestamp! + this.beaconInfo.timeout - Date.now();\n            if (expiryInMs > 1) {\n                this.livenessWatchTimeout = setTimeout(() => {\n                    this.monitorLiveness();\n                }, expiryInMs);\n            }\n        } else if (this.beaconInfo.timestamp! > Date.now()) {\n            // beacon start timestamp is in the future\n            // check liveness again then\n            this.livenessWatchTimeout = setTimeout(() => {\n                this.monitorLiveness();\n            }, this.beaconInfo.timestamp! - Date.now());\n        }\n    }\n\n    /**\n     * Process Beacon locations\n     * Emits BeaconEvent.LocationUpdate\n     */\n    public addLocations(beaconLocationEvents: MatrixEvent[]): void {\n        // discard locations for beacons that are not live\n        if (!this.isLive) {\n            return;\n        }\n\n        const validLocationEvents = beaconLocationEvents.filter((event) => {\n            const content = event.getContent<MBeaconEventContent>();\n            const parsed = parseBeaconContent(content);\n            if (!parsed.uri || !parsed.timestamp) return false; // we won't be able to process these\n            const { timestamp } = parsed;\n            return (\n                this._beaconInfo.timestamp &&\n                // only include positions that were taken inside the beacon's live period\n                isTimestampInDuration(this._beaconInfo.timestamp, this._beaconInfo.timeout, timestamp) &&\n                // ignore positions older than our current latest location\n                (!this.latestLocationState || timestamp > this.latestLocationState.timestamp!)\n            );\n        });\n        const latestLocationEvent = validLocationEvents.sort(sortEventsByLatestContentTimestamp)?.[0];\n\n        if (latestLocationEvent) {\n            this._latestLocationEvent = latestLocationEvent;\n            this.emit(BeaconEvent.LocationUpdate, this.latestLocationState!);\n        }\n    }\n\n    private clearLatestLocation = (): void => {\n        this._latestLocationEvent = undefined;\n        this.emit(BeaconEvent.LocationUpdate, this.latestLocationState!);\n    };\n\n    private setBeaconInfo(event: MatrixEvent): void {\n        this._beaconInfo = parseBeaconInfoContent(event.getContent());\n        this.checkLiveness();\n    }\n\n    private checkLiveness(): void {\n        const prevLiveness = this.isLive;\n\n        // element web sets a beacon's start timestamp to the senders local current time\n        // when Alice's system clock deviates slightly from Bob's a beacon Alice intended to be live\n        // may have a start timestamp in the future from Bob's POV\n        // handle this by adding 6min of leniency to the start timestamp when it is in the future\n        if (!this.beaconInfo) return;\n        const startTimestamp =\n            this.beaconInfo.timestamp! > Date.now()\n                ? this.beaconInfo.timestamp! - 360000 /* 6min */\n                : this.beaconInfo.timestamp;\n        this._isLive =\n            !!this._beaconInfo.live &&\n            !!startTimestamp &&\n            isTimestampInDuration(startTimestamp, this._beaconInfo.timeout, Date.now());\n\n        if (prevLiveness !== this.isLive) {\n            this.emit(BeaconEvent.LivenessChange, this.isLive, this);\n        }\n    }\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAGA,SAGI,kBAAkB,EAClB,sBAAsB,QACnB,uBAAuB;AAE9B,SAAS,kCAAkC,QAAQ,aAAa;AAChE,SAAS,iBAAiB,QAAQ,0BAA0B;AAE5D,WAAY,WAAW,0BAAX,WAAW;EAAX,WAAW;EAAX,WAAW;EAAX,WAAW;EAAX,WAAW;EAAX,WAAW;EAAA,OAAX,WAAW;AAAA;AAevB,OAAO,MAAM,qBAAqB,GAAG,CAAC,cAAsB,EAAE,UAAkB,EAAE,SAAiB,KAC/F,SAAS,IAAI,cAAc,IAAI,cAAc,GAAG,UAAU,IAAI,SAAS;;AAE3E;AACA;;AAEA,OAAO,MAAM,uBAAuB,GAAI,KAAkB,IACtD,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE;;AAEjD;AACA,OAAO,MAAM,MAAM,SAAS,iBAAiB,CAA+D;EASjG,WAAW,CAAS,SAAsB,EAAE;IAC/C,KAAK,CAAC,CAAC;IAAC;IARZ;IACA;IAAA;IAAA;IAAA;IAAA;IAAA,6CA8H8B,MAAY;MACtC,IAAI,CAAC,oBAAoB,GAAG,SAAS;MACrC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,mBAAoB,CAAC;IACpE,CAAC;IAAA,KA3H0B,SAAsB,GAAtB,SAAsB;IAE7C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAE;IACzC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC;EACtC;EAEA,IAAW,MAAM,GAAY;IACzB,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO;EACzB;EAEA,IAAW,UAAU,GAAqB;IACtC,OAAO,uBAAuB,CAAC,IAAI,CAAC,SAAS,CAAC;EAClD;EAEA,IAAW,YAAY,GAAW;IAC9B,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;EACjC;EAEA,IAAW,eAAe,GAAW;IACjC,OAAO,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;EACvC;EAEA,IAAW,mBAAmB,GAAW;IACrC,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;EACnC;EAEA,IAAW,UAAU,GAAoB;IACrC,OAAO,IAAI,CAAC,WAAW;EAC3B;EAEA,IAAW,mBAAmB,GAAoC;IAC9D,OAAO,IAAI,CAAC,oBAAoB,IAAI,kBAAkB,CAAC,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC,CAAC;EAClG;EAEA,IAAW,mBAAmB,GAA4B;IACtD,OAAO,IAAI,CAAC,oBAAoB;EACpC;EAEO,MAAM,CAAC,eAA4B,EAAQ;IAC9C,IAAI,uBAAuB,CAAC,eAAe,CAAC,KAAK,IAAI,CAAC,UAAU,EAAE;MAC9D,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC;IAC7C;IACA;IACA,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE;MAClD;IACJ;IACA,IAAI,CAAC,SAAS,GAAG,eAAe;IAChC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC;IAElC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC;IACpD,IAAI,CAAC,mBAAmB,CAAC,CAAC;EAC9B;EAEO,OAAO,GAAS;IACnB,IAAI,IAAI,CAAC,oBAAoB,EAAE;MAC3B,YAAY,CAAC,IAAI,CAAC,oBAAoB,CAAC;IAC3C;IAEA,IAAI,CAAC,OAAO,GAAG,KAAK;IACpB,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC;EACnD;;EAEA;AACJ;AACA;AACA;EACW,eAAe,GAAS;IAC3B,IAAI,IAAI,CAAC,oBAAoB,EAAE;MAC3B,YAAY,CAAC,IAAI,CAAC,oBAAoB,CAAC;IAC3C;IAEA,IAAI,CAAC,aAAa,CAAC,CAAC;IACpB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;IACtB,IAAI,IAAI,CAAC,MAAM,EAAE;MACb,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,GAAI,IAAI,CAAC,UAAU,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;MACpF,IAAI,UAAU,GAAG,CAAC,EAAE;QAChB,IAAI,CAAC,oBAAoB,GAAG,UAAU,CAAC,MAAM;UACzC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC1B,CAAC,EAAE,UAAU,CAAC;MAClB;IACJ,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,GAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;MAChD;MACA;MACA,IAAI,CAAC,oBAAoB,GAAG,UAAU,CAAC,MAAM;QACzC,IAAI,CAAC,eAAe,CAAC,CAAC;MAC1B,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,SAAS,GAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C;EACJ;;EAEA;AACJ;AACA;AACA;EACW,YAAY,CAAC,oBAAmC,EAAQ;IAC3D;IACA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;MACd;IACJ;IAEA,MAAM,mBAAmB,GAAG,oBAAoB,CAAC,MAAM,CAAE,KAAK,IAAK;MAC/D,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAsB,CAAC;MACvD,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC;MAC1C,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,KAAK,CAAC,CAAC;MACpD,MAAM;QAAE;MAAU,CAAC,GAAG,MAAM;MAC5B,OACI,IAAI,CAAC,WAAW,CAAC,SAAS;MAC1B;MACA,qBAAqB,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,CAAC;MACtF;MACC,CAAC,IAAI,CAAC,mBAAmB,IAAI,SAAS,GAAG,IAAI,CAAC,mBAAmB,CAAC,SAAU,CAAC;IAEtF,CAAC,CAAC;IACF,MAAM,mBAAmB,GAAG,mBAAmB,CAAC,IAAI,CAAC,kCAAkC,CAAC,GAAG,CAAC,CAAC;IAE7F,IAAI,mBAAmB,EAAE;MACrB,IAAI,CAAC,oBAAoB,GAAG,mBAAmB;MAC/C,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,mBAAoB,CAAC;IACpE;EACJ;EAOQ,aAAa,CAAC,KAAkB,EAAQ;IAC5C,IAAI,CAAC,WAAW,GAAG,sBAAsB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IAC7D,IAAI,CAAC,aAAa,CAAC,CAAC;EACxB;EAEQ,aAAa,GAAS;IAC1B,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM;;IAEhC;IACA;IACA;IACA;IACA,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;IACtB,MAAM,cAAc,GAChB,IAAI,CAAC,UAAU,CAAC,SAAS,GAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GACjC,IAAI,CAAC,UAAU,CAAC,SAAS,GAAI,MAAM,CAAC,aACpC,IAAI,CAAC,UAAU,CAAC,SAAS;IACnC,IAAI,CAAC,OAAO,GACR,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,IACvB,CAAC,CAAC,cAAc,IAChB,qBAAqB,CAAC,cAAc,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAE/E,IAAI,YAAY,KAAK,IAAI,CAAC,MAAM,EAAE;MAC9B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;IAC5D;EACJ;AACJ","ignoreList":[]}

package/lib/models/compare-event-ordering.js

@@ -38,8 +38,8 @@ import { inMainTimelineForReceipt, threadIdForReceipt } from "../client.js";
  *          we can't tell (because we can't find the events).
  */
 export function compareEventOrdering(room, leftEventId, rightEventId) {
-  var leftEvent = room.findEventById(leftEventId);
-  var rightEvent = room.findEventById(rightEventId);
+  const leftEvent = room.findEventById(leftEventId);
+  const rightEvent = room.findEventById(rightEventId);
   if (!leftEvent || !rightEvent) {
     // Without the events themselves, we can't find their thread or
     // timeline, or guess based on timestamp, so we just don't know.
@@ -47,8 +47,8 @@ export function compareEventOrdering(room, leftEventId, rightEventId) {
   }
 
   // Check whether the events are in the main timeline
-  var isLeftEventInMainTimeline = inMainTimelineForReceipt(leftEvent);
-  var isRightEventInMainTimeline = inMainTimelineForReceipt(rightEvent);
+  const isLeftEventInMainTimeline = inMainTimelineForReceipt(leftEvent);
+  const isRightEventInMainTimeline = inMainTimelineForReceipt(rightEvent);
   if (isLeftEventInMainTimeline && isRightEventInMainTimeline) {
     return compareEventsInMainTimeline(room, leftEventId, rightEventId, leftEvent, rightEvent);
   } else {
@@ -59,10 +59,10 @@ export function compareEventOrdering(room, leftEventId, rightEventId) {
 }
 function compareEventsInMainTimeline(room, leftEventId, rightEventId, leftEvent, rightEvent) {
   // Get the timeline set that contains all the events.
-  var timelineSet = room.getUnfilteredTimelineSet();
+  const timelineSet = room.getUnfilteredTimelineSet();
 
   // If they are in the same timeline, compareEventOrdering does what we need
-  var compareSameTimeline = timelineSet.compareEventOrdering(leftEventId, rightEventId);
+  const compareSameTimeline = timelineSet.compareEventOrdering(leftEventId, rightEventId);
   if (compareSameTimeline !== null) {
     return compareSameTimeline;
   }
@@ -70,14 +70,14 @@ function compareEventsInMainTimeline(room, leftEventId, rightEventId, leftEvent,
   // Find which timeline each event is in. Refuse to provide an ordering if we
   // can't find either of the events.
 
-  var leftTimeline = timelineSet.getTimelineForEvent(leftEventId);
+  const leftTimeline = timelineSet.getTimelineForEvent(leftEventId);
   if (leftTimeline === timelineSet.getLiveTimeline()) {
     // The left event is part of the live timeline, so it must be after the
     // right event (since they are not in the same timeline or we would have
     // returned after compareEventOrdering.
     return 1;
   }
-  var rightTimeline = timelineSet.getTimelineForEvent(rightEventId);
+  const rightTimeline = timelineSet.getTimelineForEvent(rightEventId);
   if (rightTimeline === timelineSet.getLiveTimeline()) {
     // The right event is part of the live timeline, so it must be after the
     // left event.
@@ -88,9 +88,9 @@ function compareEventsInMainTimeline(room, leftEventId, rightEventId, leftEvent,
   return guessOrderBasedOnTimestamp(leftEvent, rightEvent);
 }
 function compareEventsInThreads(leftEventId, rightEventId, leftEvent, rightEvent) {
-  var leftEventThreadId = threadIdForReceipt(leftEvent);
-  var rightEventThreadId = threadIdForReceipt(rightEvent);
-  var leftThread = leftEvent.getThread();
+  const leftEventThreadId = threadIdForReceipt(leftEvent);
+  const rightEventThreadId = threadIdForReceipt(rightEvent);
+  const leftThread = leftEvent.getThread();
   if (leftThread && leftEventThreadId === rightEventThreadId) {
     // They are in the same thread, so we can ask the thread's timeline to
     // figure it out for us
@@ -107,8 +107,8 @@ function compareEventsInThreads(leftEventId, rightEventId, leftEvent, rightEvent
  * See https://github.com/matrix-org/matrix-js-sdk/issues/3325
  */
 function guessOrderBasedOnTimestamp(leftEvent, rightEvent) {
-  var leftTs = leftEvent.getTs();
-  var rightTs = rightEvent.getTs();
+  const leftTs = leftEvent.getTs();
+  const rightTs = rightEvent.getTs();
   if (leftTs < rightTs) {
     return -1;
   } else if (leftTs > rightTs) {

package/lib/models/compare-event-ordering.js.map

@@ -1 +1 @@
-{"version":3,"file":"compare-event-ordering.js","names":["inMainTimelineForReceipt","threadIdForReceipt","compareEventOrdering","room","leftEventId","rightEventId","leftEvent","findEventById","rightEvent","isLeftEventInMainTimeline","isRightEventInMainTimeline","compareEventsInMainTimeline","compareEventsInThreads","timelineSet","getUnfilteredTimelineSet","compareSameTimeline","leftTimeline","getTimelineForEvent","getLiveTimeline","rightTimeline","guessOrderBasedOnTimestamp","leftEventThreadId","rightEventThreadId","leftThread","getThread","leftTs","getTs","rightTs"],"sources":["../../src/models/compare-event-ordering.ts"],"sourcesContent":["/*\nCopyright 2023 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 { type MatrixEvent } from \"./event.ts\";\nimport { type Room } from \"./room.ts\";\nimport { inMainTimelineForReceipt, threadIdForReceipt } from \"../client.ts\";\n\n/**\n * Determine the order of two events in a room.\n *\n * In principle this should use the same order as the server, but in practice\n * this is difficult for events that were not received over the Sync API. See\n * MSC4033 for details.\n *\n * This implementation leans on the order of events within their timelines, and\n * falls back to comparing event timestamps when they are in different\n * timelines.\n *\n * See https://github.com/matrix-org/matrix-js-sdk/issues/3325 for where we are\n * tracking the work to fix this.\n *\n * @param room - the room we are looking in\n * @param leftEventId - the id of the first event\n * @param rightEventId - the id of the second event\n\n * @returns -1 if left \\< right, 1 if left \\> right, 0 if left == right, null if\n *          we can't tell (because we can't find the events).\n */\nexport function compareEventOrdering(room: Room, leftEventId: string, rightEventId: string): number | null {\n    const leftEvent = room.findEventById(leftEventId);\n    const rightEvent = room.findEventById(rightEventId);\n\n    if (!leftEvent || !rightEvent) {\n        // Without the events themselves, we can't find their thread or\n        // timeline, or guess based on timestamp, so we just don't know.\n        return null;\n    }\n\n    // Check whether the events are in the main timeline\n    const isLeftEventInMainTimeline = inMainTimelineForReceipt(leftEvent);\n    const isRightEventInMainTimeline = inMainTimelineForReceipt(rightEvent);\n\n    if (isLeftEventInMainTimeline && isRightEventInMainTimeline) {\n        return compareEventsInMainTimeline(room, leftEventId, rightEventId, leftEvent, rightEvent);\n    } else {\n        // At least one event is not in the timeline, so we can't use the room's\n        // unfiltered timeline set.\n        return compareEventsInThreads(leftEventId, rightEventId, leftEvent, rightEvent);\n    }\n}\n\nfunction compareEventsInMainTimeline(\n    room: Room,\n    leftEventId: string,\n    rightEventId: string,\n    leftEvent: MatrixEvent,\n    rightEvent: MatrixEvent,\n): number | null {\n    // Get the timeline set that contains all the events.\n    const timelineSet = room.getUnfilteredTimelineSet();\n\n    // If they are in the same timeline, compareEventOrdering does what we need\n    const compareSameTimeline = timelineSet.compareEventOrdering(leftEventId, rightEventId);\n    if (compareSameTimeline !== null) {\n        return compareSameTimeline;\n    }\n\n    // Find which timeline each event is in. Refuse to provide an ordering if we\n    // can't find either of the events.\n\n    const leftTimeline = timelineSet.getTimelineForEvent(leftEventId);\n    if (leftTimeline === timelineSet.getLiveTimeline()) {\n        // The left event is part of the live timeline, so it must be after the\n        // right event (since they are not in the same timeline or we would have\n        // returned after compareEventOrdering.\n        return 1;\n    }\n\n    const rightTimeline = timelineSet.getTimelineForEvent(rightEventId);\n    if (rightTimeline === timelineSet.getLiveTimeline()) {\n        // The right event is part of the live timeline, so it must be after the\n        // left event.\n        return -1;\n    }\n\n    // They are in older timeline sets (because they were fetched by paging up).\n    return guessOrderBasedOnTimestamp(leftEvent, rightEvent);\n}\n\nfunction compareEventsInThreads(\n    leftEventId: string,\n    rightEventId: string,\n    leftEvent: MatrixEvent,\n    rightEvent: MatrixEvent,\n): number | null {\n    const leftEventThreadId = threadIdForReceipt(leftEvent);\n    const rightEventThreadId = threadIdForReceipt(rightEvent);\n\n    const leftThread = leftEvent.getThread();\n\n    if (leftThread && leftEventThreadId === rightEventThreadId) {\n        // They are in the same thread, so we can ask the thread's timeline to\n        // figure it out for us\n        return leftThread.timelineSet.compareEventOrdering(leftEventId, rightEventId);\n    } else {\n        return guessOrderBasedOnTimestamp(leftEvent, rightEvent);\n    }\n}\n\n/**\n * Guess the order of events based on server timestamp. This is not good, but\n * difficult to avoid without MSC4033.\n *\n * See https://github.com/matrix-org/matrix-js-sdk/issues/3325\n */\nfunction guessOrderBasedOnTimestamp(leftEvent: MatrixEvent, rightEvent: MatrixEvent): number {\n    const leftTs = leftEvent.getTs();\n    const rightTs = rightEvent.getTs();\n    if (leftTs < rightTs) {\n        return -1;\n    } else if (leftTs > rightTs) {\n        return 1;\n    } else {\n        return 0;\n    }\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAIA,SAASA,wBAAwB,EAAEC,kBAAkB,QAAQ,cAAc;;AAE3E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,oBAAoBA,CAACC,IAAU,EAAEC,WAAmB,EAAEC,YAAoB,EAAiB;EACvG,IAAMC,SAAS,GAAGH,IAAI,CAACI,aAAa,CAACH,WAAW,CAAC;EACjD,IAAMI,UAAU,GAAGL,IAAI,CAACI,aAAa,CAACF,YAAY,CAAC;EAEnD,IAAI,CAACC,SAAS,IAAI,CAACE,UAAU,EAAE;IAC3B;IACA;IACA,OAAO,IAAI;EACf;;EAEA;EACA,IAAMC,yBAAyB,GAAGT,wBAAwB,CAACM,SAAS,CAAC;EACrE,IAAMI,0BAA0B,GAAGV,wBAAwB,CAACQ,UAAU,CAAC;EAEvE,IAAIC,yBAAyB,IAAIC,0BAA0B,EAAE;IACzD,OAAOC,2BAA2B,CAACR,IAAI,EAAEC,WAAW,EAAEC,YAAY,EAAEC,SAAS,EAAEE,UAAU,CAAC;EAC9F,CAAC,MAAM;IACH;IACA;IACA,OAAOI,sBAAsB,CAACR,WAAW,EAAEC,YAAY,EAAEC,SAAS,EAAEE,UAAU,CAAC;EACnF;AACJ;AAEA,SAASG,2BAA2BA,CAChCR,IAAU,EACVC,WAAmB,EACnBC,YAAoB,EACpBC,SAAsB,EACtBE,UAAuB,EACV;EACb;EACA,IAAMK,WAAW,GAAGV,IAAI,CAACW,wBAAwB,CAAC,CAAC;;EAEnD;EACA,IAAMC,mBAAmB,GAAGF,WAAW,CAACX,oBAAoB,CAACE,WAAW,EAAEC,YAAY,CAAC;EACvF,IAAIU,mBAAmB,KAAK,IAAI,EAAE;IAC9B,OAAOA,mBAAmB;EAC9B;;EAEA;EACA;;EAEA,IAAMC,YAAY,GAAGH,WAAW,CAACI,mBAAmB,CAACb,WAAW,CAAC;EACjE,IAAIY,YAAY,KAAKH,WAAW,CAACK,eAAe,CAAC,CAAC,EAAE;IAChD;IACA;IACA;IACA,OAAO,CAAC;EACZ;EAEA,IAAMC,aAAa,GAAGN,WAAW,CAACI,mBAAmB,CAACZ,YAAY,CAAC;EACnE,IAAIc,aAAa,KAAKN,WAAW,CAACK,eAAe,CAAC,CAAC,EAAE;IACjD;IACA;IACA,OAAO,CAAC,CAAC;EACb;;EAEA;EACA,OAAOE,0BAA0B,CAACd,SAAS,EAAEE,UAAU,CAAC;AAC5D;AAEA,SAASI,sBAAsBA,CAC3BR,WAAmB,EACnBC,YAAoB,EACpBC,SAAsB,EACtBE,UAAuB,EACV;EACb,IAAMa,iBAAiB,GAAGpB,kBAAkB,CAACK,SAAS,CAAC;EACvD,IAAMgB,kBAAkB,GAAGrB,kBAAkB,CAACO,UAAU,CAAC;EAEzD,IAAMe,UAAU,GAAGjB,SAAS,CAACkB,SAAS,CAAC,CAAC;EAExC,IAAID,UAAU,IAAIF,iBAAiB,KAAKC,kBAAkB,EAAE;IACxD;IACA;IACA,OAAOC,UAAU,CAACV,WAAW,CAACX,oBAAoB,CAACE,WAAW,EAAEC,YAAY,CAAC;EACjF,CAAC,MAAM;IACH,OAAOe,0BAA0B,CAACd,SAAS,EAAEE,UAAU,CAAC;EAC5D;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASY,0BAA0BA,CAACd,SAAsB,EAAEE,UAAuB,EAAU;EACzF,IAAMiB,MAAM,GAAGnB,SAAS,CAACoB,KAAK,CAAC,CAAC;EAChC,IAAMC,OAAO,GAAGnB,UAAU,CAACkB,KAAK,CAAC,CAAC;EAClC,IAAID,MAAM,GAAGE,OAAO,EAAE;IAClB,OAAO,CAAC,CAAC;EACb,CAAC,MAAM,IAAIF,MAAM,GAAGE,OAAO,EAAE;IACzB,OAAO,CAAC;EACZ,CAAC,MAAM;IACH,OAAO,CAAC;EACZ;AACJ","ignoreList":[]}
+{"version":3,"file":"compare-event-ordering.js","names":[],"sources":["../../src/models/compare-event-ordering.ts"],"sourcesContent":["/*\nCopyright 2023 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 { type MatrixEvent } from \"./event.ts\";\nimport { type Room } from \"./room.ts\";\nimport { inMainTimelineForReceipt, threadIdForReceipt } from \"../client.ts\";\n\n/**\n * Determine the order of two events in a room.\n *\n * In principle this should use the same order as the server, but in practice\n * this is difficult for events that were not received over the Sync API. See\n * MSC4033 for details.\n *\n * This implementation leans on the order of events within their timelines, and\n * falls back to comparing event timestamps when they are in different\n * timelines.\n *\n * See https://github.com/matrix-org/matrix-js-sdk/issues/3325 for where we are\n * tracking the work to fix this.\n *\n * @param room - the room we are looking in\n * @param leftEventId - the id of the first event\n * @param rightEventId - the id of the second event\n\n * @returns -1 if left \\< right, 1 if left \\> right, 0 if left == right, null if\n *          we can't tell (because we can't find the events).\n */\nexport function compareEventOrdering(room: Room, leftEventId: string, rightEventId: string): number | null {\n    const leftEvent = room.findEventById(leftEventId);\n    const rightEvent = room.findEventById(rightEventId);\n\n    if (!leftEvent || !rightEvent) {\n        // Without the events themselves, we can't find their thread or\n        // timeline, or guess based on timestamp, so we just don't know.\n        return null;\n    }\n\n    // Check whether the events are in the main timeline\n    const isLeftEventInMainTimeline = inMainTimelineForReceipt(leftEvent);\n    const isRightEventInMainTimeline = inMainTimelineForReceipt(rightEvent);\n\n    if (isLeftEventInMainTimeline && isRightEventInMainTimeline) {\n        return compareEventsInMainTimeline(room, leftEventId, rightEventId, leftEvent, rightEvent);\n    } else {\n        // At least one event is not in the timeline, so we can't use the room's\n        // unfiltered timeline set.\n        return compareEventsInThreads(leftEventId, rightEventId, leftEvent, rightEvent);\n    }\n}\n\nfunction compareEventsInMainTimeline(\n    room: Room,\n    leftEventId: string,\n    rightEventId: string,\n    leftEvent: MatrixEvent,\n    rightEvent: MatrixEvent,\n): number | null {\n    // Get the timeline set that contains all the events.\n    const timelineSet = room.getUnfilteredTimelineSet();\n\n    // If they are in the same timeline, compareEventOrdering does what we need\n    const compareSameTimeline = timelineSet.compareEventOrdering(leftEventId, rightEventId);\n    if (compareSameTimeline !== null) {\n        return compareSameTimeline;\n    }\n\n    // Find which timeline each event is in. Refuse to provide an ordering if we\n    // can't find either of the events.\n\n    const leftTimeline = timelineSet.getTimelineForEvent(leftEventId);\n    if (leftTimeline === timelineSet.getLiveTimeline()) {\n        // The left event is part of the live timeline, so it must be after the\n        // right event (since they are not in the same timeline or we would have\n        // returned after compareEventOrdering.\n        return 1;\n    }\n\n    const rightTimeline = timelineSet.getTimelineForEvent(rightEventId);\n    if (rightTimeline === timelineSet.getLiveTimeline()) {\n        // The right event is part of the live timeline, so it must be after the\n        // left event.\n        return -1;\n    }\n\n    // They are in older timeline sets (because they were fetched by paging up).\n    return guessOrderBasedOnTimestamp(leftEvent, rightEvent);\n}\n\nfunction compareEventsInThreads(\n    leftEventId: string,\n    rightEventId: string,\n    leftEvent: MatrixEvent,\n    rightEvent: MatrixEvent,\n): number | null {\n    const leftEventThreadId = threadIdForReceipt(leftEvent);\n    const rightEventThreadId = threadIdForReceipt(rightEvent);\n\n    const leftThread = leftEvent.getThread();\n\n    if (leftThread && leftEventThreadId === rightEventThreadId) {\n        // They are in the same thread, so we can ask the thread's timeline to\n        // figure it out for us\n        return leftThread.timelineSet.compareEventOrdering(leftEventId, rightEventId);\n    } else {\n        return guessOrderBasedOnTimestamp(leftEvent, rightEvent);\n    }\n}\n\n/**\n * Guess the order of events based on server timestamp. This is not good, but\n * difficult to avoid without MSC4033.\n *\n * See https://github.com/matrix-org/matrix-js-sdk/issues/3325\n */\nfunction guessOrderBasedOnTimestamp(leftEvent: MatrixEvent, rightEvent: MatrixEvent): number {\n    const leftTs = leftEvent.getTs();\n    const rightTs = rightEvent.getTs();\n    if (leftTs < rightTs) {\n        return -1;\n    } else if (leftTs > rightTs) {\n        return 1;\n    } else {\n        return 0;\n    }\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAIA,SAAS,wBAAwB,EAAE,kBAAkB,QAAQ,cAAc;;AAE3E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,oBAAoB,CAAC,IAAU,EAAE,WAAmB,EAAE,YAAoB,EAAiB;EACvG,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC;EACjD,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC;EAEnD,IAAI,CAAC,SAAS,IAAI,CAAC,UAAU,EAAE;IAC3B;IACA;IACA,OAAO,IAAI;EACf;;EAEA;EACA,MAAM,yBAAyB,GAAG,wBAAwB,CAAC,SAAS,CAAC;EACrE,MAAM,0BAA0B,GAAG,wBAAwB,CAAC,UAAU,CAAC;EAEvE,IAAI,yBAAyB,IAAI,0BAA0B,EAAE;IACzD,OAAO,2BAA2B,CAAC,IAAI,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,CAAC;EAC9F,CAAC,MAAM;IACH;IACA;IACA,OAAO,sBAAsB,CAAC,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,CAAC;EACnF;AACJ;AAEA,SAAS,2BAA2B,CAChC,IAAU,EACV,WAAmB,EACnB,YAAoB,EACpB,SAAsB,EACtB,UAAuB,EACV;EACb;EACA,MAAM,WAAW,GAAG,IAAI,CAAC,wBAAwB,CAAC,CAAC;;EAEnD;EACA,MAAM,mBAAmB,GAAG,WAAW,CAAC,oBAAoB,CAAC,WAAW,EAAE,YAAY,CAAC;EACvF,IAAI,mBAAmB,KAAK,IAAI,EAAE;IAC9B,OAAO,mBAAmB;EAC9B;;EAEA;EACA;;EAEA,MAAM,YAAY,GAAG,WAAW,CAAC,mBAAmB,CAAC,WAAW,CAAC;EACjE,IAAI,YAAY,KAAK,WAAW,CAAC,eAAe,CAAC,CAAC,EAAE;IAChD;IACA;IACA;IACA,OAAO,CAAC;EACZ;EAEA,MAAM,aAAa,GAAG,WAAW,CAAC,mBAAmB,CAAC,YAAY,CAAC;EACnE,IAAI,aAAa,KAAK,WAAW,CAAC,eAAe,CAAC,CAAC,EAAE;IACjD;IACA;IACA,OAAO,CAAC,CAAC;EACb;;EAEA;EACA,OAAO,0BAA0B,CAAC,SAAS,EAAE,UAAU,CAAC;AAC5D;AAEA,SAAS,sBAAsB,CAC3B,WAAmB,EACnB,YAAoB,EACpB,SAAsB,EACtB,UAAuB,EACV;EACb,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,SAAS,CAAC;EACvD,MAAM,kBAAkB,GAAG,kBAAkB,CAAC,UAAU,CAAC;EAEzD,MAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;EAExC,IAAI,UAAU,IAAI,iBAAiB,KAAK,kBAAkB,EAAE;IACxD;IACA;IACA,OAAO,UAAU,CAAC,WAAW,CAAC,oBAAoB,CAAC,WAAW,EAAE,YAAY,CAAC;EACjF,CAAC,MAAM;IACH,OAAO,0BAA0B,CAAC,SAAS,EAAE,UAAU,CAAC;EAC5D;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,0BAA0B,CAAC,SAAsB,EAAE,UAAuB,EAAU;EACzF,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;EAChC,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;EAClC,IAAI,MAAM,GAAG,OAAO,EAAE;IAClB,OAAO,CAAC,CAAC;EACb,CAAC,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;IACzB,OAAO,CAAC;EACZ,CAAC,MAAM;IACH,OAAO,CAAC;EACZ;AACJ","ignoreList":[]}

package/lib/models/device.js

@@ -16,7 +16,7 @@ limitations under the License.
 */
 
 /** State of the verification of the device. */
-export var DeviceVerification = /*#__PURE__*/function (DeviceVerification) {
+export let DeviceVerification = /*#__PURE__*/function (DeviceVerification) {
   DeviceVerification[DeviceVerification["Blocked"] = -1] = "Blocked";
   DeviceVerification[DeviceVerification["Unverified"] = 0] = "Unverified";
   DeviceVerification[DeviceVerification["Verified"] = 1] = "Verified";
@@ -62,7 +62,7 @@ export class Device {
    * @returns base64-encoded fingerprint of this device
    */
   getFingerprint() {
-    return this.keys.get("ed25519:".concat(this.deviceId));
+    return this.keys.get(`ed25519:${this.deviceId}`);
   }
 
   /**
@@ -71,7 +71,7 @@ export class Device {
    * @returns base64-encoded identity key of this device
    */
   getIdentityKey() {
-    return this.keys.get("curve25519:".concat(this.deviceId));
+    return this.keys.get(`curve25519:${this.deviceId}`);
   }
 }
 //# sourceMappingURL=device.js.map

package/lib/models/device.js.map

@@ -1 +1 @@
-{"version":3,"file":"device.js","names":["DeviceVerification","Device","constructor","opts","_defineProperty","deviceId","userId","algorithms","keys","verified","Unverified","signatures","Map","displayName","dehydrated","getFingerprint","get","concat","getIdentityKey"],"sources":["../../src/models/device.ts"],"sourcesContent":["/*\nCopyright 2023 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\n/** State of the verification of the device. */\nexport enum DeviceVerification {\n    Blocked = -1,\n    Unverified = 0,\n    Verified = 1,\n}\n\n/** A map from user ID to device ID to Device */\nexport type DeviceMap = Map<string, Map<string, Device>>;\n\ntype DeviceParameters = Pick<Device, \"deviceId\" | \"userId\" | \"algorithms\" | \"keys\"> & Partial<Device>;\n\n/**\n *  Information on a user's device, as returned by {@link crypto-api!CryptoApi.getUserDeviceInfo}.\n */\nexport class Device {\n    /** id of the device */\n    public readonly deviceId: string;\n\n    /** id of the user that owns the device */\n    public readonly userId: string;\n\n    /** list of algorithms supported by this device */\n    public readonly algorithms: string[];\n\n    /** a map from `<key type>:<id> -> <base64-encoded key>` */\n    public readonly keys: Map<string, string>;\n\n    /** whether the device has been verified/blocked by the user */\n    public readonly verified: DeviceVerification;\n\n    /** a map `<userId, map<algorithm:device_id, signature>>` */\n    public readonly signatures: Map<string, Map<string, string>>;\n\n    /** display name of the device */\n    public readonly displayName?: string;\n\n    /** whether the device is a dehydrated device */\n    public readonly dehydrated: boolean = false;\n\n    public constructor(opts: DeviceParameters) {\n        this.deviceId = opts.deviceId;\n        this.userId = opts.userId;\n        this.algorithms = opts.algorithms;\n        this.keys = opts.keys;\n        this.verified = opts.verified || DeviceVerification.Unverified;\n        this.signatures = opts.signatures || new Map();\n        this.displayName = opts.displayName;\n        this.dehydrated = !!opts.dehydrated;\n    }\n\n    /**\n     * Get the fingerprint for this device (ie, the Ed25519 key)\n     *\n     * @returns base64-encoded fingerprint of this device\n     */\n    public getFingerprint(): string | undefined {\n        return this.keys.get(`ed25519:${this.deviceId}`);\n    }\n\n    /**\n     * Get the identity key for this device (ie, the Curve25519 key)\n     *\n     * @returns base64-encoded identity key of this device\n     */\n    public getIdentityKey(): string | undefined {\n        return this.keys.get(`curve25519:${this.deviceId}`);\n    }\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAYA,kBAAkB,0BAAlBA,kBAAkB;EAAlBA,kBAAkB,CAAlBA,kBAAkB;EAAlBA,kBAAkB,CAAlBA,kBAAkB;EAAlBA,kBAAkB,CAAlBA,kBAAkB;EAAA,OAAlBA,kBAAkB;AAAA;;AAM9B;;AAKA;AACA;AACA;AACA,OAAO,MAAMC,MAAM,CAAC;EAyBTC,WAAWA,CAACC,IAAsB,EAAE;IAxB3C;IAAAC,eAAA;IAGA;IAAAA,eAAA;IAGA;IAAAA,eAAA;IAGA;IAAAA,eAAA;IAGA;IAAAA,eAAA;IAGA;IAAAA,eAAA;IAGA;IAAAA,eAAA;IAGA;IAAAA,eAAA,qBACsC,KAAK;IAGvC,IAAI,CAACC,QAAQ,GAAGF,IAAI,CAACE,QAAQ;IAC7B,IAAI,CAACC,MAAM,GAAGH,IAAI,CAACG,MAAM;IACzB,IAAI,CAACC,UAAU,GAAGJ,IAAI,CAACI,UAAU;IACjC,IAAI,CAACC,IAAI,GAAGL,IAAI,CAACK,IAAI;IACrB,IAAI,CAACC,QAAQ,GAAGN,IAAI,CAACM,QAAQ,IAAIT,kBAAkB,CAACU,UAAU;IAC9D,IAAI,CAACC,UAAU,GAAGR,IAAI,CAACQ,UAAU,IAAI,IAAIC,GAAG,CAAC,CAAC;IAC9C,IAAI,CAACC,WAAW,GAAGV,IAAI,CAACU,WAAW;IACnC,IAAI,CAACC,UAAU,GAAG,CAAC,CAACX,IAAI,CAACW,UAAU;EACvC;;EAEA;AACJ;AACA;AACA;AACA;EACWC,cAAcA,CAAA,EAAuB;IACxC,OAAO,IAAI,CAACP,IAAI,CAACQ,GAAG,YAAAC,MAAA,CAAY,IAAI,CAACZ,QAAQ,CAAE,CAAC;EACpD;;EAEA;AACJ;AACA;AACA;AACA;EACWa,cAAcA,CAAA,EAAuB;IACxC,OAAO,IAAI,CAACV,IAAI,CAACQ,GAAG,eAAAC,MAAA,CAAe,IAAI,CAACZ,QAAQ,CAAE,CAAC;EACvD;AACJ","ignoreList":[]}
+{"version":3,"file":"device.js","names":[],"sources":["../../src/models/device.ts"],"sourcesContent":["/*\nCopyright 2023 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\n/** State of the verification of the device. */\nexport enum DeviceVerification {\n    Blocked = -1,\n    Unverified = 0,\n    Verified = 1,\n}\n\n/** A map from user ID to device ID to Device */\nexport type DeviceMap = Map<string, Map<string, Device>>;\n\ntype DeviceParameters = Pick<Device, \"deviceId\" | \"userId\" | \"algorithms\" | \"keys\"> & Partial<Device>;\n\n/**\n *  Information on a user's device, as returned by {@link crypto-api!CryptoApi.getUserDeviceInfo}.\n */\nexport class Device {\n    /** id of the device */\n    public readonly deviceId: string;\n\n    /** id of the user that owns the device */\n    public readonly userId: string;\n\n    /** list of algorithms supported by this device */\n    public readonly algorithms: string[];\n\n    /** a map from `<key type>:<id> -> <base64-encoded key>` */\n    public readonly keys: Map<string, string>;\n\n    /** whether the device has been verified/blocked by the user */\n    public readonly verified: DeviceVerification;\n\n    /** a map `<userId, map<algorithm:device_id, signature>>` */\n    public readonly signatures: Map<string, Map<string, string>>;\n\n    /** display name of the device */\n    public readonly displayName?: string;\n\n    /** whether the device is a dehydrated device */\n    public readonly dehydrated: boolean = false;\n\n    public constructor(opts: DeviceParameters) {\n        this.deviceId = opts.deviceId;\n        this.userId = opts.userId;\n        this.algorithms = opts.algorithms;\n        this.keys = opts.keys;\n        this.verified = opts.verified || DeviceVerification.Unverified;\n        this.signatures = opts.signatures || new Map();\n        this.displayName = opts.displayName;\n        this.dehydrated = !!opts.dehydrated;\n    }\n\n    /**\n     * Get the fingerprint for this device (ie, the Ed25519 key)\n     *\n     * @returns base64-encoded fingerprint of this device\n     */\n    public getFingerprint(): string | undefined {\n        return this.keys.get(`ed25519:${this.deviceId}`);\n    }\n\n    /**\n     * Get the identity key for this device (ie, the Curve25519 key)\n     *\n     * @returns base64-encoded identity key of this device\n     */\n    public getIdentityKey(): string | undefined {\n        return this.keys.get(`curve25519:${this.deviceId}`);\n    }\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAY,kBAAkB,0BAAlB,kBAAkB;EAAlB,kBAAkB,CAAlB,kBAAkB;EAAlB,kBAAkB,CAAlB,kBAAkB;EAAlB,kBAAkB,CAAlB,kBAAkB;EAAA,OAAlB,kBAAkB;AAAA;;AAM9B;;AAKA;AACA;AACA;AACA,OAAO,MAAM,MAAM,CAAC;EAyBT,WAAW,CAAC,IAAsB,EAAE;IAxB3C;IAAA;IAGA;IAAA;IAGA;IAAA;IAGA;IAAA;IAGA;IAAA;IAGA;IAAA;IAGA;IAAA;IAGA;IAAA,oCACsC,KAAK;IAGvC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ;IAC7B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM;IACzB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;IACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;IACrB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,UAAU;IAC9D,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,GAAG,CAAC,CAAC;IAC9C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW;IACnC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU;EACvC;;EAEA;AACJ;AACA;AACA;AACA;EACW,cAAc,GAAuB;IACxC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,IAAI,CAAC,QAAQ,EAAE,CAAC;EACpD;;EAEA;AACJ;AACA;AACA;AACA;EACW,cAAc,GAAuB;IACxC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,IAAI,CAAC,QAAQ,EAAE,CAAC;EACvD;AACJ","ignoreList":[]}

package/lib/models/event-context.js

@@ -30,13 +30,13 @@ export class EventContext {
    * @param ourEvent - the event at the centre of this context
    */
   constructor(ourEvent) {
-    this.ourEvent = ourEvent;
     _defineProperty(this, "timeline", void 0);
     _defineProperty(this, "ourEventIndex", 0);
     _defineProperty(this, "paginateTokens", {
       [Direction.Backward]: null,
       [Direction.Forward]: null
     });
+    this.ourEvent = ourEvent;
     this.timeline = [ourEvent];
   }
 
@@ -72,8 +72,7 @@ export class EventContext {
    *
    * @param backwards -   true to get the pagination token for going
    */
-  getPaginateToken() {
-    var backwards = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;
+  getPaginateToken(backwards = false) {
     return this.paginateTokens[backwards ? Direction.Backward : Direction.Forward];
   }
 
@@ -86,9 +85,8 @@ export class EventContext {
    * @param backwards -   true to set the pagination token for going
    *                                   backwards in time
    */
-  setPaginateToken(token) {
-    var backwards = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
-    this.paginateTokens[backwards ? Direction.Backward : Direction.Forward] = token !== null && token !== void 0 ? token : null;
+  setPaginateToken(token, backwards = false) {
+    this.paginateTokens[backwards ? Direction.Backward : Direction.Forward] = token ?? null;
   }
 
   /**
@@ -97,8 +95,7 @@ export class EventContext {
    * @param events -      new events, in timeline order
    * @param atStart -   true to insert new events at the start
    */
-  addEvents(events) {
-    var atStart = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+  addEvents(events, atStart = false) {
     // TODO: should we share logic with Room.addEventsToTimeline?
     // Should Room even use EventContext?