matrix-js-sdk 41.5.0 → 41.6.0

package/lib/timeline-window.js

@@ -68,16 +68,13 @@ export class TimelineWindow {
   constructor(client, timelineSet) {
     var _timelineSet$room;
     var opts = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
-    this.client = client;
-    this.timelineSet = timelineSet;
-    _defineProperty(this, "windowLimit", void 0);
     // these will be TimelineIndex objects; they delineate the 'start' and
     // 'end' of the window.
     //
     // start.index is inclusive; end.index is exclusive.
-    _defineProperty(this, "start", void 0);
-    _defineProperty(this, "end", void 0);
     _defineProperty(this, "eventCount", 0);
+    this.client = client;
+    this.timelineSet = timelineSet;
     this.windowLimit = opts.windowLimit || 1000;
     (_timelineSet$room = timelineSet.room) === null || _timelineSet$room === void 0 || _timelineSet$room.on(RoomEvent.Timeline, this.onTimelineEvent.bind(this));
   }
@@ -404,7 +401,6 @@ export class TimelineIndex {
   constructor(timeline, index) {
     this.timeline = timeline;
     this.index = index;
-    _defineProperty(this, "pendingPaginate", void 0);
   }
 
   /**

package/lib/timeline-window.js.map

@@ -1 +1 @@
-{"version":3,"file":"timeline-window.js","names":["EventTimeline","logger","RoomEvent","DEBUG","debuglog","log","bind","DEFAULT_PAGINATE_LOOP_LIMIT","TimelineWindow","constructor","client","timelineSet","_timelineSet$room","opts","arguments","length","undefined","_defineProperty","windowLimit","room","on","Timeline","onTimelineEvent","load","initialEventId","initialWindowSize","initFields","timeline","Error","eventIndex","events","getEvents","findIndex","e","getId","endIndex","Math","min","ceil","startIndex","max","start","TimelineIndex","getBaseIndex","end","eventCount","getTimelineForEvent","Promise","resolve","getEventTimeline","then","getLiveTimeline","getTimelineIndex","direction","BACKWARDS","_this$start","FORWARDS","_this$end","extend","size","tl","count","retreat","advance","excess","unpaginate","_event","_room","_atStart","removed","onEventRemoved","index","canPaginate","minIndex","maxIndex","hasNeighbouringTimeline","getNeighbouringTimeline","paginationToken","getPaginationToken","Boolean","paginate","_arguments","_this","_asyncToGenerator","makeRequest","requestLimit","pendingPaginate","token","prom","paginateEventTimeline","backwards","limit","finally","r","delta","startOfTimeline","concat","result","_this$end2","_this$end3","i","push","cappedDelta","neighbour"],"sources":["../src/timeline-window.ts"],"sourcesContent":["/*\nCopyright 2016 - 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 Direction, EventTimeline } from \"./models/event-timeline.ts\";\nimport { logger } from \"./logger.ts\";\nimport { type MatrixClient } from \"./client.ts\";\nimport { type EventTimelineSet } from \"./models/event-timeline-set.ts\";\nimport { type MatrixEvent } from \"./models/event.ts\";\nimport { type Room, RoomEvent } from \"./models/room.ts\";\n\n/**\n * @internal\n */\nconst DEBUG = false;\n\n/**\n * @internal\n */\n/* istanbul ignore next */\nconst debuglog = DEBUG ? logger.log.bind(logger) : function (): void {};\n\n/**\n * the number of times we ask the server for more events before giving up\n * this is currently higher than it needs to be to workaround lack of a filter\n * for excluding thread responses from main timeline pagination which can cause\n * giving up incorrectly - https://github.com/matrix-org/matrix-spec-proposals/pull/3874\n *\n * @internal\n */\nconst DEFAULT_PAGINATE_LOOP_LIMIT = 10;\n\ninterface IOpts {\n    /**\n     * Maximum number of events to keep in the window. If more events are retrieved via pagination requests,\n     * excess events will be dropped from the other end of the window.\n     */\n    windowLimit?: number;\n}\n\nexport class TimelineWindow {\n    private readonly windowLimit: number;\n    // these will be TimelineIndex objects; they delineate the 'start' and\n    // 'end' of the window.\n    //\n    // start.index is inclusive; end.index is exclusive.\n    private start?: TimelineIndex;\n    private end?: TimelineIndex;\n    private eventCount = 0;\n\n    /**\n     * Construct a TimelineWindow.\n     *\n     * <p>This abstracts the separate timelines in a Matrix {@link Room} into a single iterable thing.\n     * It keeps track of the start and endpoints of the window, which can be advanced with the help\n     * of pagination requests.\n     *\n     * <p>Before the window is useful, it must be initialised by calling {@link TimelineWindow#load}.\n     *\n     * <p>Note that the window will not automatically extend itself when new events\n     * are received from /sync; you should arrange to call {@link TimelineWindow#paginate}\n     * on {@link RoomEvent.Timeline} events.\n     *\n     * <p>Note that constructing an instance of this class for a room adds a\n     * listener for RoomEvent.Timeline events which is never removed. In theory\n     * this should not cause a leak since the EventEmitter uses weak mappings.\n     *\n     * @param client -   MatrixClient to be used for context/pagination\n     *   requests.\n     *\n     * @param timelineSet -  The timelineSet to track\n     *\n     * @param opts - Configuration options for this window\n     */\n    public constructor(\n        private readonly client: MatrixClient,\n        private readonly timelineSet: EventTimelineSet,\n        opts: IOpts = {},\n    ) {\n        this.windowLimit = opts.windowLimit || 1000;\n        timelineSet.room?.on(RoomEvent.Timeline, this.onTimelineEvent.bind(this));\n    }\n\n    /**\n     * Initialise the window to point at a given event, or the live timeline\n     *\n     * @param initialEventId -   If given, the window will contain the\n     *    given event\n     * @param initialWindowSize -   Size of the initial window\n     */\n    public load(initialEventId?: string, initialWindowSize = 20): Promise<void> {\n        // given an EventTimeline, find the event we were looking for, and initialise our\n        // fields so that the event in question is in the middle of the window.\n        const initFields = (timeline: EventTimeline | null): void => {\n            if (!timeline) {\n                throw new Error(\"No timeline given to initFields\");\n            }\n\n            let eventIndex: number;\n\n            const events = timeline.getEvents();\n\n            if (!initialEventId) {\n                // we were looking for the live timeline: initialise to the end\n                eventIndex = events.length;\n            } else {\n                eventIndex = events.findIndex((e) => e.getId() === initialEventId);\n\n                if (eventIndex < 0) {\n                    throw new Error(\"getEventTimeline result didn't include requested event\");\n                }\n            }\n\n            const endIndex = Math.min(events.length, eventIndex + Math.ceil(initialWindowSize / 2));\n            const startIndex = Math.max(0, endIndex - initialWindowSize);\n            this.start = new TimelineIndex(timeline, startIndex - timeline.getBaseIndex());\n            this.end = new TimelineIndex(timeline, endIndex - timeline.getBaseIndex());\n            this.eventCount = endIndex - startIndex;\n        };\n\n        // We avoid delaying the resolution of the promise by a reactor tick if we already have the data we need,\n        // which is important to keep room-switching feeling snappy.\n        if (this.timelineSet.getTimelineForEvent(initialEventId)) {\n            initFields(this.timelineSet.getTimelineForEvent(initialEventId));\n            return Promise.resolve();\n        } else if (initialEventId) {\n            return this.client.getEventTimeline(this.timelineSet, initialEventId).then(initFields);\n        } else {\n            initFields(this.timelineSet.getLiveTimeline());\n            return Promise.resolve();\n        }\n    }\n\n    /**\n     * Get the TimelineIndex of the window in the given direction.\n     *\n     * @param direction -   EventTimeline.BACKWARDS to get the TimelineIndex\n     * at the start of the window; EventTimeline.FORWARDS to get the TimelineIndex at\n     * the end.\n     *\n     * @returns The requested timeline index if one exists, null\n     * otherwise.\n     */\n    public getTimelineIndex(direction: Direction): TimelineIndex | null {\n        if (direction == EventTimeline.BACKWARDS) {\n            return this.start ?? null;\n        } else if (direction == EventTimeline.FORWARDS) {\n            return this.end ?? null;\n        } else {\n            throw new Error(\"Invalid direction '\" + direction + \"'\");\n        }\n    }\n\n    /**\n     * Try to extend the window using events that are already in the underlying\n     * TimelineIndex.\n     *\n     * @param direction -   EventTimeline.BACKWARDS to try extending it\n     *   backwards; EventTimeline.FORWARDS to try extending it forwards.\n     * @param size -   number of events to try to extend by.\n     *\n     * @returns true if the window was extended, false otherwise.\n     */\n    public extend(direction: Direction, size: number): boolean {\n        const tl = this.getTimelineIndex(direction);\n\n        if (!tl) {\n            debuglog(\"TimelineWindow: no timeline yet\");\n            return false;\n        }\n\n        const count = direction == EventTimeline.BACKWARDS ? tl.retreat(size) : tl.advance(size);\n\n        if (count) {\n            this.eventCount += count;\n            debuglog(\"TimelineWindow: increased cap by \" + count + \" (now \" + this.eventCount + \")\");\n            // remove some events from the other end, if necessary\n            const excess = this.eventCount - this.windowLimit;\n            if (excess > 0) {\n                this.unpaginate(excess, direction != EventTimeline.BACKWARDS);\n            }\n            return true;\n        }\n\n        return false;\n    }\n\n    private onTimelineEvent(_event?: MatrixEvent, _room?: Room, _atStart?: boolean, removed?: boolean): void {\n        if (removed) {\n            this.onEventRemoved();\n        }\n    }\n\n    /**\n     * If an event was removed, meaning this window is longer than the timeline,\n     * shorten the window.\n     */\n    private onEventRemoved(): void {\n        const events = this.getEvents();\n        if (events.length > 0 && events[events.length - 1] === undefined && this.end) {\n            this.end.index--;\n        }\n    }\n\n    /**\n     * Check if this window can be extended\n     *\n     * <p>This returns true if we either have more events, or if we have a\n     * pagination token which means we can paginate in that direction. It does not\n     * necessarily mean that there are more events available in that direction at\n     * this time.\n     *\n     * @param direction -   EventTimeline.BACKWARDS to check if we can\n     *   paginate backwards; EventTimeline.FORWARDS to check if we can go forwards\n     *\n     * @returns true if we can paginate in the given direction\n     */\n    public canPaginate(direction: Direction): boolean {\n        const tl = this.getTimelineIndex(direction);\n\n        if (!tl) {\n            debuglog(\"TimelineWindow: no timeline yet\");\n            return false;\n        }\n\n        if (direction == EventTimeline.BACKWARDS) {\n            if (tl.index > tl.minIndex()) {\n                return true;\n            }\n        } else {\n            if (tl.index < tl.maxIndex()) {\n                return true;\n            }\n        }\n\n        const hasNeighbouringTimeline = tl.timeline.getNeighbouringTimeline(direction);\n        const paginationToken = tl.timeline.getPaginationToken(direction);\n        return Boolean(hasNeighbouringTimeline) || Boolean(paginationToken);\n    }\n\n    /**\n     * Attempt to extend the window\n     *\n     * @param direction -   EventTimeline.BACKWARDS to extend the window\n     *    backwards (towards older events); EventTimeline.FORWARDS to go forwards.\n     *\n     * @param size -   number of events to try to extend by. If fewer than this\n     *    number are immediately available, then we return immediately rather than\n     *    making an API call.\n     *\n     * @param makeRequest - whether we should make API calls to\n     *    fetch further events if we don't have any at all. (This has no effect if\n     *    the room already knows about additional events in the relevant direction,\n     *    even if there are fewer than 'size' of them, as we will just return those\n     *    we already know about.)\n     *\n     * @param requestLimit - limit for the number of API requests we\n     *    should make.\n     *\n     * @returns Promise which resolves to a boolean which is true if more events\n     *    were successfully retrieved.\n     */\n    public async paginate(\n        direction: Direction,\n        size: number,\n        makeRequest = true,\n        requestLimit = DEFAULT_PAGINATE_LOOP_LIMIT,\n    ): Promise<boolean> {\n        // Either wind back the message cap (if there are enough events in the\n        // timeline to do so), or fire off a pagination request.\n        const tl = this.getTimelineIndex(direction);\n\n        if (!tl) {\n            debuglog(\"TimelineWindow: no timeline yet\");\n            return false;\n        }\n\n        if (tl.pendingPaginate) {\n            return tl.pendingPaginate;\n        }\n\n        // try moving the cap\n        if (this.extend(direction, size)) {\n            return true;\n        }\n\n        if (!makeRequest || requestLimit === 0) {\n            // todo: should we return something different to indicate that there\n            // might be more events out there, but we haven't found them yet?\n            return false;\n        }\n\n        // try making a pagination request\n        const token = tl.timeline.getPaginationToken(direction);\n        if (!token) {\n            debuglog(\"TimelineWindow: no token\");\n            return false;\n        }\n\n        debuglog(\"TimelineWindow: starting request\");\n\n        const prom = this.client\n            .paginateEventTimeline(tl.timeline, {\n                backwards: direction == EventTimeline.BACKWARDS,\n                limit: size,\n            })\n            .finally(function () {\n                tl.pendingPaginate = undefined;\n            })\n            .then((r) => {\n                debuglog(\"TimelineWindow: request completed with result \" + r);\n                if (!r) {\n                    return this.paginate(direction, size, false, 0);\n                }\n\n                // recurse to advance the index into the results.\n                //\n                // If we don't get any new events, we want to make sure we keep asking\n                // the server for events for as long as we have a valid pagination\n                // token. In particular, we want to know if we've actually hit the\n                // start of the timeline, or if we just happened to know about all of\n                // the events thanks to https://matrix.org/jira/browse/SYN-645.\n                //\n                // On the other hand, we necessarily want to wait forever for the\n                // server to make its mind up about whether there are other events,\n                // because it gives a bad user experience\n                // (https://github.com/vector-im/vector-web/issues/1204).\n                return this.paginate(direction, size, true, requestLimit - 1);\n            });\n        tl.pendingPaginate = prom;\n        return prom;\n    }\n\n    /**\n     * Remove `delta` events from the start or end of the timeline.\n     *\n     * @param delta - number of events to remove from the timeline\n     * @param startOfTimeline - if events should be removed from the start\n     *     of the timeline.\n     */\n    public unpaginate(delta: number, startOfTimeline: boolean): void {\n        const tl = startOfTimeline ? this.start : this.end;\n        if (!tl) {\n            throw new Error(\n                `Attempting to unpaginate startOfTimeline=${startOfTimeline} but don't have this direction`,\n            );\n        }\n\n        // sanity-check the delta\n        if (delta > this.eventCount || delta < 0) {\n            throw new Error(\n                `Attemting to unpaginate ${delta} events, but only have ${this.eventCount} in the timeline`,\n            );\n        }\n\n        while (delta > 0) {\n            const count = startOfTimeline ? tl.advance(delta) : tl.retreat(delta);\n            if (count <= 0) {\n                // sadness. This shouldn't be possible.\n                throw new Error(\"Unable to unpaginate any further, but still have \" + this.eventCount + \" events\");\n            }\n\n            delta -= count;\n            this.eventCount -= count;\n            debuglog(\"TimelineWindow.unpaginate: dropped \" + count + \" (now \" + this.eventCount + \")\");\n        }\n    }\n\n    /**\n     * Get a list of the events currently in the window\n     *\n     * @returns the events in the window\n     */\n    public getEvents(): MatrixEvent[] {\n        if (!this.start) {\n            // not yet loaded\n            return [];\n        }\n\n        const result: MatrixEvent[] = [];\n\n        // iterate through each timeline between this.start and this.end\n        // (inclusive).\n        let timeline: EventTimeline | null = this.start.timeline;\n        // eslint-disable-next-line no-constant-condition\n        while (timeline) {\n            const events = timeline.getEvents();\n\n            // For the first timeline in the chain, we want to start at\n            // this.start.index. For the last timeline in the chain, we want to\n            // stop before this.end.index. Otherwise, we want to copy all of the\n            // events in the timeline.\n            //\n            // (Note that both this.start.index and this.end.index are relative\n            // to their respective timelines' BaseIndex).\n            //\n            let startIndex = 0;\n            let endIndex = events.length;\n            if (timeline === this.start.timeline) {\n                startIndex = this.start.index + timeline.getBaseIndex();\n            }\n            if (timeline === this.end?.timeline) {\n                endIndex = this.end.index + timeline.getBaseIndex();\n            }\n\n            for (let i = startIndex; i < endIndex; i++) {\n                result.push(events[i]);\n            }\n\n            // if we're not done, iterate to the next timeline.\n            if (timeline === this.end?.timeline) {\n                break;\n            } else {\n                timeline = timeline.getNeighbouringTimeline(EventTimeline.FORWARDS);\n            }\n        }\n\n        return result;\n    }\n}\n\n/**\n * A thing which contains a timeline reference, and an index into it.\n * @internal\n */\nexport class TimelineIndex {\n    public pendingPaginate?: Promise<boolean>;\n\n    // index: the indexes are relative to BaseIndex, so could well be negative.\n    public constructor(\n        public timeline: EventTimeline,\n        public index: number,\n    ) {}\n\n    /**\n     * @returns the minimum possible value for the index in the current\n     *    timeline\n     */\n    public minIndex(): number {\n        return this.timeline.getBaseIndex() * -1;\n    }\n\n    /**\n     * @returns the maximum possible value for the index in the current\n     *    timeline (exclusive - ie, it actually returns one more than the index\n     *    of the last element).\n     */\n    public maxIndex(): number {\n        return this.timeline.getEvents().length - this.timeline.getBaseIndex();\n    }\n\n    /**\n     * Try move the index forward, or into the neighbouring timeline\n     *\n     * @param delta -  number of events to advance by\n     * @returns number of events successfully advanced by\n     */\n    public advance(delta: number): number {\n        if (!delta) {\n            return 0;\n        }\n\n        // first try moving the index in the current timeline. See if there is room\n        // to do so.\n        let cappedDelta;\n        if (delta < 0) {\n            // we want to wind the index backwards.\n            //\n            // (this.minIndex() - this.index) is a negative number whose magnitude\n            // is the amount of room we have to wind back the index in the current\n            // timeline. We cap delta to this quantity.\n            cappedDelta = Math.max(delta, this.minIndex() - this.index);\n            if (cappedDelta < 0) {\n                this.index += cappedDelta;\n                return cappedDelta;\n            }\n        } else {\n            // we want to wind the index forwards.\n            //\n            // (this.maxIndex() - this.index) is a (positive) number whose magnitude\n            // is the amount of room we have to wind forward the index in the current\n            // timeline. We cap delta to this quantity.\n            cappedDelta = Math.min(delta, this.maxIndex() - this.index);\n            if (cappedDelta > 0) {\n                this.index += cappedDelta;\n                return cappedDelta;\n            }\n        }\n\n        // the index is already at the start/end of the current timeline.\n        //\n        // next see if there is a neighbouring timeline to switch to.\n        const neighbour = this.timeline.getNeighbouringTimeline(\n            delta < 0 ? EventTimeline.BACKWARDS : EventTimeline.FORWARDS,\n        );\n        if (neighbour) {\n            this.timeline = neighbour;\n            if (delta < 0) {\n                this.index = this.maxIndex();\n            } else {\n                this.index = this.minIndex();\n            }\n\n            debuglog(\"paginate: switched to new neighbour\");\n\n            // recurse, using the next timeline\n            return this.advance(delta);\n        }\n\n        return 0;\n    }\n\n    /**\n     * Try move the index backwards, or into the neighbouring timeline\n     *\n     * @param delta -  number of events to retreat by\n     * @returns number of events successfully retreated by\n     */\n    public retreat(delta: number): number {\n        return this.advance(delta * -1) * -1;\n    }\n}\n"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAyBA,aAAa,QAAQ,4BAA4B;AAC1E,SAASC,MAAM,QAAQ,aAAa;AAIpC,SAAoBC,SAAS,QAAQ,kBAAkB;;AAEvD;AACA;AACA;AACA,IAAMC,KAAK,GAAG,KAAK;;AAEnB;AACA;AACA;AACA;AACA,IAAMC,QAAQ,GAAGD,KAAK,GAAGF,MAAM,CAACI,GAAG,CAACC,IAAI,CAACL,MAAM,CAAC,GAAG,YAAkB,CAAC,CAAC;;AAEvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAMM,2BAA2B,GAAG,EAAE;AAUtC,OAAO,MAAMC,cAAc,CAAC;EAUxB;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWC,WAAWA,CACGC,MAAoB,EACpBC,WAA6B,EAEhD;IAAA,IAAAC,iBAAA;IAAA,IADEC,IAAW,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC,CAAC;IAAA,KAFCJ,MAAoB,GAApBA,MAAoB;IAAA,KACpBC,WAA6B,GAA7BA,WAA6B;IAAAM,eAAA;IAlClD;IACA;IACA;IACA;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA,qBAGqB,CAAC;IA+BlB,IAAI,CAACC,WAAW,GAAGL,IAAI,CAACK,WAAW,IAAI,IAAI;IAC3C,CAAAN,iBAAA,GAAAD,WAAW,CAACQ,IAAI,cAAAP,iBAAA,eAAhBA,iBAAA,CAAkBQ,EAAE,CAAClB,SAAS,CAACmB,QAAQ,EAAE,IAAI,CAACC,eAAe,CAAChB,IAAI,CAAC,IAAI,CAAC,CAAC;EAC7E;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACWiB,IAAIA,CAACC,cAAuB,EAAyC;IAAA,IAAvCC,iBAAiB,GAAAX,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,EAAE;IACvD;IACA;IACA,IAAMY,UAAU,GAAIC,QAA8B,IAAW;MACzD,IAAI,CAACA,QAAQ,EAAE;QACX,MAAM,IAAIC,KAAK,CAAC,iCAAiC,CAAC;MACtD;MAEA,IAAIC,UAAkB;MAEtB,IAAMC,MAAM,GAAGH,QAAQ,CAACI,SAAS,CAAC,CAAC;MAEnC,IAAI,CAACP,cAAc,EAAE;QACjB;QACAK,UAAU,GAAGC,MAAM,CAACf,MAAM;MAC9B,CAAC,MAAM;QACHc,UAAU,GAAGC,MAAM,CAACE,SAAS,CAAEC,CAAC,IAAKA,CAAC,CAACC,KAAK,CAAC,CAAC,KAAKV,cAAc,CAAC;QAElE,IAAIK,UAAU,GAAG,CAAC,EAAE;UAChB,MAAM,IAAID,KAAK,CAAC,wDAAwD,CAAC;QAC7E;MACJ;MAEA,IAAMO,QAAQ,GAAGC,IAAI,CAACC,GAAG,CAACP,MAAM,CAACf,MAAM,EAAEc,UAAU,GAAGO,IAAI,CAACE,IAAI,CAACb,iBAAiB,GAAG,CAAC,CAAC,CAAC;MACvF,IAAMc,UAAU,GAAGH,IAAI,CAACI,GAAG,CAAC,CAAC,EAAEL,QAAQ,GAAGV,iBAAiB,CAAC;MAC5D,IAAI,CAACgB,KAAK,GAAG,IAAIC,aAAa,CAACf,QAAQ,EAAEY,UAAU,GAAGZ,QAAQ,CAACgB,YAAY,CAAC,CAAC,CAAC;MAC9E,IAAI,CAACC,GAAG,GAAG,IAAIF,aAAa,CAACf,QAAQ,EAAEQ,QAAQ,GAAGR,QAAQ,CAACgB,YAAY,CAAC,CAAC,CAAC;MAC1E,IAAI,CAACE,UAAU,GAAGV,QAAQ,GAAGI,UAAU;IAC3C,CAAC;;IAED;IACA;IACA,IAAI,IAAI,CAAC5B,WAAW,CAACmC,mBAAmB,CAACtB,cAAc,CAAC,EAAE;MACtDE,UAAU,CAAC,IAAI,CAACf,WAAW,CAACmC,mBAAmB,CAACtB,cAAc,CAAC,CAAC;MAChE,OAAOuB,OAAO,CAACC,OAAO,CAAC,CAAC;IAC5B,CAAC,MAAM,IAAIxB,cAAc,EAAE;MACvB,OAAO,IAAI,CAACd,MAAM,CAACuC,gBAAgB,CAAC,IAAI,CAACtC,WAAW,EAAEa,cAAc,CAAC,CAAC0B,IAAI,CAACxB,UAAU,CAAC;IAC1F,CAAC,MAAM;MACHA,UAAU,CAAC,IAAI,CAACf,WAAW,CAACwC,eAAe,CAAC,CAAC,CAAC;MAC9C,OAAOJ,OAAO,CAACC,OAAO,CAAC,CAAC;IAC5B;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWI,gBAAgBA,CAACC,SAAoB,EAAwB;IAChE,IAAIA,SAAS,IAAIrD,aAAa,CAACsD,SAAS,EAAE;MAAA,IAAAC,WAAA;MACtC,QAAAA,WAAA,GAAO,IAAI,CAACd,KAAK,cAAAc,WAAA,cAAAA,WAAA,GAAI,IAAI;IAC7B,CAAC,MAAM,IAAIF,SAAS,IAAIrD,aAAa,CAACwD,QAAQ,EAAE;MAAA,IAAAC,SAAA;MAC5C,QAAAA,SAAA,GAAO,IAAI,CAACb,GAAG,cAAAa,SAAA,cAAAA,SAAA,GAAI,IAAI;IAC3B,CAAC,MAAM;MACH,MAAM,IAAI7B,KAAK,CAAC,qBAAqB,GAAGyB,SAAS,GAAG,GAAG,CAAC;IAC5D;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWK,MAAMA,CAACL,SAAoB,EAAEM,IAAY,EAAW;IACvD,IAAMC,EAAE,GAAG,IAAI,CAACR,gBAAgB,CAACC,SAAS,CAAC;IAE3C,IAAI,CAACO,EAAE,EAAE;MACLxD,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,IAAMyD,KAAK,GAAGR,SAAS,IAAIrD,aAAa,CAACsD,SAAS,GAAGM,EAAE,CAACE,OAAO,CAACH,IAAI,CAAC,GAAGC,EAAE,CAACG,OAAO,CAACJ,IAAI,CAAC;IAExF,IAAIE,KAAK,EAAE;MACP,IAAI,CAAChB,UAAU,IAAIgB,KAAK;MACxBzD,QAAQ,CAAC,mCAAmC,GAAGyD,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAChB,UAAU,GAAG,GAAG,CAAC;MACxF;MACA,IAAMmB,MAAM,GAAG,IAAI,CAACnB,UAAU,GAAG,IAAI,CAAC3B,WAAW;MACjD,IAAI8C,MAAM,GAAG,CAAC,EAAE;QACZ,IAAI,CAACC,UAAU,CAACD,MAAM,EAAEX,SAAS,IAAIrD,aAAa,CAACsD,SAAS,CAAC;MACjE;MACA,OAAO,IAAI;IACf;IAEA,OAAO,KAAK;EAChB;EAEQhC,eAAeA,CAAC4C,MAAoB,EAAEC,KAAY,EAAEC,QAAkB,EAAEC,OAAiB,EAAQ;IACrG,IAAIA,OAAO,EAAE;MACT,IAAI,CAACC,cAAc,CAAC,CAAC;IACzB;EACJ;;EAEA;AACJ;AACA;AACA;EACYA,cAAcA,CAAA,EAAS;IAC3B,IAAMxC,MAAM,GAAG,IAAI,CAACC,SAAS,CAAC,CAAC;IAC/B,IAAID,MAAM,CAACf,MAAM,GAAG,CAAC,IAAIe,MAAM,CAACA,MAAM,CAACf,MAAM,GAAG,CAAC,CAAC,KAAKC,SAAS,IAAI,IAAI,CAAC4B,GAAG,EAAE;MAC1E,IAAI,CAACA,GAAG,CAAC2B,KAAK,EAAE;IACpB;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWC,WAAWA,CAACnB,SAAoB,EAAW;IAC9C,IAAMO,EAAE,GAAG,IAAI,CAACR,gBAAgB,CAACC,SAAS,CAAC;IAE3C,IAAI,CAACO,EAAE,EAAE;MACLxD,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,IAAIiD,SAAS,IAAIrD,aAAa,CAACsD,SAAS,EAAE;MACtC,IAAIM,EAAE,CAACW,KAAK,GAAGX,EAAE,CAACa,QAAQ,CAAC,CAAC,EAAE;QAC1B,OAAO,IAAI;MACf;IACJ,CAAC,MAAM;MACH,IAAIb,EAAE,CAACW,KAAK,GAAGX,EAAE,CAACc,QAAQ,CAAC,CAAC,EAAE;QAC1B,OAAO,IAAI;MACf;IACJ;IAEA,IAAMC,uBAAuB,GAAGf,EAAE,CAACjC,QAAQ,CAACiD,uBAAuB,CAACvB,SAAS,CAAC;IAC9E,IAAMwB,eAAe,GAAGjB,EAAE,CAACjC,QAAQ,CAACmD,kBAAkB,CAACzB,SAAS,CAAC;IACjE,OAAO0B,OAAO,CAACJ,uBAAuB,CAAC,IAAII,OAAO,CAACF,eAAe,CAAC;EACvE;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACiBG,QAAQA,CACjB3B,SAAoB,EACpBM,IAAY,EAGI;IAAA,IAAAsB,UAAA,GAAAnE,SAAA;MAAAoE,KAAA;IAAA,OAAAC,iBAAA;MAAA,IAFhBC,WAAW,GAAAH,UAAA,CAAAlE,MAAA,QAAAkE,UAAA,QAAAjE,SAAA,GAAAiE,UAAA,MAAG,IAAI;MAAA,IAClBI,YAAY,GAAAJ,UAAA,CAAAlE,MAAA,QAAAkE,UAAA,QAAAjE,SAAA,GAAAiE,UAAA,MAAG1E,2BAA2B;MAE1C;MACA;MACA,IAAMqD,EAAE,GAAGsB,KAAI,CAAC9B,gBAAgB,CAACC,SAAS,CAAC;MAE3C,IAAI,CAACO,EAAE,EAAE;QACLxD,QAAQ,CAAC,iCAAiC,CAAC;QAC3C,OAAO,KAAK;MAChB;MAEA,IAAIwD,EAAE,CAAC0B,eAAe,EAAE;QACpB,OAAO1B,EAAE,CAAC0B,eAAe;MAC7B;;MAEA;MACA,IAAIJ,KAAI,CAACxB,MAAM,CAACL,SAAS,EAAEM,IAAI,CAAC,EAAE;QAC9B,OAAO,IAAI;MACf;MAEA,IAAI,CAACyB,WAAW,IAAIC,YAAY,KAAK,CAAC,EAAE;QACpC;QACA;QACA,OAAO,KAAK;MAChB;;MAEA;MACA,IAAME,KAAK,GAAG3B,EAAE,CAACjC,QAAQ,CAACmD,kBAAkB,CAACzB,SAAS,CAAC;MACvD,IAAI,CAACkC,KAAK,EAAE;QACRnF,QAAQ,CAAC,0BAA0B,CAAC;QACpC,OAAO,KAAK;MAChB;MAEAA,QAAQ,CAAC,kCAAkC,CAAC;MAE5C,IAAMoF,IAAI,GAAGN,KAAI,CAACxE,MAAM,CACnB+E,qBAAqB,CAAC7B,EAAE,CAACjC,QAAQ,EAAE;QAChC+D,SAAS,EAAErC,SAAS,IAAIrD,aAAa,CAACsD,SAAS;QAC/CqC,KAAK,EAAEhC;MACX,CAAC,CAAC,CACDiC,OAAO,CAAC,YAAY;QACjBhC,EAAE,CAAC0B,eAAe,GAAGtE,SAAS;MAClC,CAAC,CAAC,CACDkC,IAAI,CAAE2C,CAAC,IAAK;QACTzF,QAAQ,CAAC,gDAAgD,GAAGyF,CAAC,CAAC;QAC9D,IAAI,CAACA,CAAC,EAAE;UACJ,OAAOX,KAAI,CAACF,QAAQ,CAAC3B,SAAS,EAAEM,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QACnD;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA,OAAOuB,KAAI,CAACF,QAAQ,CAAC3B,SAAS,EAAEM,IAAI,EAAE,IAAI,EAAE0B,YAAY,GAAG,CAAC,CAAC;MACjE,CAAC,CAAC;MACNzB,EAAE,CAAC0B,eAAe,GAAGE,IAAI;MACzB,OAAOA,IAAI;IAAC;EAChB;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACWvB,UAAUA,CAAC6B,KAAa,EAAEC,eAAwB,EAAQ;IAC7D,IAAMnC,EAAE,GAAGmC,eAAe,GAAG,IAAI,CAACtD,KAAK,GAAG,IAAI,CAACG,GAAG;IAClD,IAAI,CAACgB,EAAE,EAAE;MACL,MAAM,IAAIhC,KAAK,6CAAAoE,MAAA,CACiCD,eAAe,mCAC/D,CAAC;IACL;;IAEA;IACA,IAAID,KAAK,GAAG,IAAI,CAACjD,UAAU,IAAIiD,KAAK,GAAG,CAAC,EAAE;MACtC,MAAM,IAAIlE,KAAK,4BAAAoE,MAAA,CACgBF,KAAK,6BAAAE,MAAA,CAA0B,IAAI,CAACnD,UAAU,qBAC7E,CAAC;IACL;IAEA,OAAOiD,KAAK,GAAG,CAAC,EAAE;MACd,IAAMjC,KAAK,GAAGkC,eAAe,GAAGnC,EAAE,CAACG,OAAO,CAAC+B,KAAK,CAAC,GAAGlC,EAAE,CAACE,OAAO,CAACgC,KAAK,CAAC;MACrE,IAAIjC,KAAK,IAAI,CAAC,EAAE;QACZ;QACA,MAAM,IAAIjC,KAAK,CAAC,mDAAmD,GAAG,IAAI,CAACiB,UAAU,GAAG,SAAS,CAAC;MACtG;MAEAiD,KAAK,IAAIjC,KAAK;MACd,IAAI,CAAChB,UAAU,IAAIgB,KAAK;MACxBzD,QAAQ,CAAC,qCAAqC,GAAGyD,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAChB,UAAU,GAAG,GAAG,CAAC;IAC9F;EACJ;;EAEA;AACJ;AACA;AACA;AACA;EACWd,SAASA,CAAA,EAAkB;IAC9B,IAAI,CAAC,IAAI,CAACU,KAAK,EAAE;MACb;MACA,OAAO,EAAE;IACb;IAEA,IAAMwD,MAAqB,GAAG,EAAE;;IAEhC;IACA;IACA,IAAItE,QAA8B,GAAG,IAAI,CAACc,KAAK,CAACd,QAAQ;IACxD;IACA,OAAOA,QAAQ,EAAE;MAAA,IAAAuE,UAAA,EAAAC,UAAA;MACb,IAAMrE,MAAM,GAAGH,QAAQ,CAACI,SAAS,CAAC,CAAC;;MAEnC;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA,IAAIQ,UAAU,GAAG,CAAC;MAClB,IAAIJ,QAAQ,GAAGL,MAAM,CAACf,MAAM;MAC5B,IAAIY,QAAQ,KAAK,IAAI,CAACc,KAAK,CAACd,QAAQ,EAAE;QAClCY,UAAU,GAAG,IAAI,CAACE,KAAK,CAAC8B,KAAK,GAAG5C,QAAQ,CAACgB,YAAY,CAAC,CAAC;MAC3D;MACA,IAAIhB,QAAQ,OAAAuE,UAAA,GAAK,IAAI,CAACtD,GAAG,cAAAsD,UAAA,uBAARA,UAAA,CAAUvE,QAAQ,GAAE;QACjCQ,QAAQ,GAAG,IAAI,CAACS,GAAG,CAAC2B,KAAK,GAAG5C,QAAQ,CAACgB,YAAY,CAAC,CAAC;MACvD;MAEA,KAAK,IAAIyD,CAAC,GAAG7D,UAAU,EAAE6D,CAAC,GAAGjE,QAAQ,EAAEiE,CAAC,EAAE,EAAE;QACxCH,MAAM,CAACI,IAAI,CAACvE,MAAM,CAACsE,CAAC,CAAC,CAAC;MAC1B;;MAEA;MACA,IAAIzE,QAAQ,OAAAwE,UAAA,GAAK,IAAI,CAACvD,GAAG,cAAAuD,UAAA,uBAARA,UAAA,CAAUxE,QAAQ,GAAE;QACjC;MACJ,CAAC,MAAM;QACHA,QAAQ,GAAGA,QAAQ,CAACiD,uBAAuB,CAAC5E,aAAa,CAACwD,QAAQ,CAAC;MACvE;IACJ;IAEA,OAAOyC,MAAM;EACjB;AACJ;;AAEA;AACA;AACA;AACA;AACA,OAAO,MAAMvD,aAAa,CAAC;EAGvB;EACOjC,WAAWA,CACPkB,QAAuB,EACvB4C,KAAa,EACtB;IAAA,KAFS5C,QAAuB,GAAvBA,QAAuB;IAAA,KACvB4C,KAAa,GAAbA,KAAa;IAAAtD,eAAA;EACrB;;EAEH;AACJ;AACA;AACA;EACWwD,QAAQA,CAAA,EAAW;IACtB,OAAO,IAAI,CAAC9C,QAAQ,CAACgB,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;EAC5C;;EAEA;AACJ;AACA;AACA;AACA;EACW+B,QAAQA,CAAA,EAAW;IACtB,OAAO,IAAI,CAAC/C,QAAQ,CAACI,SAAS,CAAC,CAAC,CAAChB,MAAM,GAAG,IAAI,CAACY,QAAQ,CAACgB,YAAY,CAAC,CAAC;EAC1E;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWoB,OAAOA,CAAC+B,KAAa,EAAU;IAClC,IAAI,CAACA,KAAK,EAAE;MACR,OAAO,CAAC;IACZ;;IAEA;IACA;IACA,IAAIQ,WAAW;IACf,IAAIR,KAAK,GAAG,CAAC,EAAE;MACX;MACA;MACA;MACA;MACA;MACAQ,WAAW,GAAGlE,IAAI,CAACI,GAAG,CAACsD,KAAK,EAAE,IAAI,CAACrB,QAAQ,CAAC,CAAC,GAAG,IAAI,CAACF,KAAK,CAAC;MAC3D,IAAI+B,WAAW,GAAG,CAAC,EAAE;QACjB,IAAI,CAAC/B,KAAK,IAAI+B,WAAW;QACzB,OAAOA,WAAW;MACtB;IACJ,CAAC,MAAM;MACH;MACA;MACA;MACA;MACA;MACAA,WAAW,GAAGlE,IAAI,CAACC,GAAG,CAACyD,KAAK,EAAE,IAAI,CAACpB,QAAQ,CAAC,CAAC,GAAG,IAAI,CAACH,KAAK,CAAC;MAC3D,IAAI+B,WAAW,GAAG,CAAC,EAAE;QACjB,IAAI,CAAC/B,KAAK,IAAI+B,WAAW;QACzB,OAAOA,WAAW;MACtB;IACJ;;IAEA;IACA;IACA;IACA,IAAMC,SAAS,GAAG,IAAI,CAAC5E,QAAQ,CAACiD,uBAAuB,CACnDkB,KAAK,GAAG,CAAC,GAAG9F,aAAa,CAACsD,SAAS,GAAGtD,aAAa,CAACwD,QACxD,CAAC;IACD,IAAI+C,SAAS,EAAE;MACX,IAAI,CAAC5E,QAAQ,GAAG4E,SAAS;MACzB,IAAIT,KAAK,GAAG,CAAC,EAAE;QACX,IAAI,CAACvB,KAAK,GAAG,IAAI,CAACG,QAAQ,CAAC,CAAC;MAChC,CAAC,MAAM;QACH,IAAI,CAACH,KAAK,GAAG,IAAI,CAACE,QAAQ,CAAC,CAAC;MAChC;MAEArE,QAAQ,CAAC,qCAAqC,CAAC;;MAE/C;MACA,OAAO,IAAI,CAAC2D,OAAO,CAAC+B,KAAK,CAAC;IAC9B;IAEA,OAAO,CAAC;EACZ;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWhC,OAAOA,CAACgC,KAAa,EAAU;IAClC,OAAO,IAAI,CAAC/B,OAAO,CAAC+B,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;EACxC;AACJ","ignoreList":[]}
+{"version":3,"file":"timeline-window.js","names":["EventTimeline","logger","RoomEvent","DEBUG","debuglog","log","bind","DEFAULT_PAGINATE_LOOP_LIMIT","TimelineWindow","constructor","client","timelineSet","_timelineSet$room","opts","arguments","length","undefined","_defineProperty","windowLimit","room","on","Timeline","onTimelineEvent","load","initialEventId","initialWindowSize","initFields","timeline","Error","eventIndex","events","getEvents","findIndex","e","getId","endIndex","Math","min","ceil","startIndex","max","start","TimelineIndex","getBaseIndex","end","eventCount","getTimelineForEvent","Promise","resolve","getEventTimeline","then","getLiveTimeline","getTimelineIndex","direction","BACKWARDS","_this$start","FORWARDS","_this$end","extend","size","tl","count","retreat","advance","excess","unpaginate","_event","_room","_atStart","removed","onEventRemoved","index","canPaginate","minIndex","maxIndex","hasNeighbouringTimeline","getNeighbouringTimeline","paginationToken","getPaginationToken","Boolean","paginate","_arguments","_this","_asyncToGenerator","makeRequest","requestLimit","pendingPaginate","token","prom","paginateEventTimeline","backwards","limit","finally","r","delta","startOfTimeline","concat","result","_this$end2","_this$end3","i","push","cappedDelta","neighbour"],"sources":["../src/timeline-window.ts"],"sourcesContent":["/*\nCopyright 2016 - 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 Direction, EventTimeline } from \"./models/event-timeline.ts\";\nimport { logger } from \"./logger.ts\";\nimport { type MatrixClient } from \"./client.ts\";\nimport { type EventTimelineSet } from \"./models/event-timeline-set.ts\";\nimport { type MatrixEvent } from \"./models/event.ts\";\nimport { type Room, RoomEvent } from \"./models/room.ts\";\n\n/**\n * @internal\n */\nconst DEBUG = false;\n\n/**\n * @internal\n */\n/* istanbul ignore next */\nconst debuglog = DEBUG ? logger.log.bind(logger) : function (): void {};\n\n/**\n * the number of times we ask the server for more events before giving up\n * this is currently higher than it needs to be to workaround lack of a filter\n * for excluding thread responses from main timeline pagination which can cause\n * giving up incorrectly - https://github.com/matrix-org/matrix-spec-proposals/pull/3874\n *\n * @internal\n */\nconst DEFAULT_PAGINATE_LOOP_LIMIT = 10;\n\ninterface IOpts {\n    /**\n     * Maximum number of events to keep in the window. If more events are retrieved via pagination requests,\n     * excess events will be dropped from the other end of the window.\n     */\n    windowLimit?: number;\n}\n\nexport class TimelineWindow {\n    private readonly windowLimit: number;\n    // these will be TimelineIndex objects; they delineate the 'start' and\n    // 'end' of the window.\n    //\n    // start.index is inclusive; end.index is exclusive.\n    private start?: TimelineIndex;\n    private end?: TimelineIndex;\n    private eventCount = 0;\n\n    /**\n     * Construct a TimelineWindow.\n     *\n     * <p>This abstracts the separate timelines in a Matrix {@link Room} into a single iterable thing.\n     * It keeps track of the start and endpoints of the window, which can be advanced with the help\n     * of pagination requests.\n     *\n     * <p>Before the window is useful, it must be initialised by calling {@link TimelineWindow#load}.\n     *\n     * <p>Note that the window will not automatically extend itself when new events\n     * are received from /sync; you should arrange to call {@link TimelineWindow#paginate}\n     * on {@link RoomEvent.Timeline} events.\n     *\n     * <p>Note that constructing an instance of this class for a room adds a\n     * listener for RoomEvent.Timeline events which is never removed. In theory\n     * this should not cause a leak since the EventEmitter uses weak mappings.\n     *\n     * @param client -   MatrixClient to be used for context/pagination\n     *   requests.\n     *\n     * @param timelineSet -  The timelineSet to track\n     *\n     * @param opts - Configuration options for this window\n     */\n    public constructor(\n        private readonly client: MatrixClient,\n        private readonly timelineSet: EventTimelineSet,\n        opts: IOpts = {},\n    ) {\n        this.windowLimit = opts.windowLimit || 1000;\n        timelineSet.room?.on(RoomEvent.Timeline, this.onTimelineEvent.bind(this));\n    }\n\n    /**\n     * Initialise the window to point at a given event, or the live timeline\n     *\n     * @param initialEventId -   If given, the window will contain the\n     *    given event\n     * @param initialWindowSize -   Size of the initial window\n     */\n    public load(initialEventId?: string, initialWindowSize = 20): Promise<void> {\n        // given an EventTimeline, find the event we were looking for, and initialise our\n        // fields so that the event in question is in the middle of the window.\n        const initFields = (timeline: EventTimeline | null): void => {\n            if (!timeline) {\n                throw new Error(\"No timeline given to initFields\");\n            }\n\n            let eventIndex: number;\n\n            const events = timeline.getEvents();\n\n            if (!initialEventId) {\n                // we were looking for the live timeline: initialise to the end\n                eventIndex = events.length;\n            } else {\n                eventIndex = events.findIndex((e) => e.getId() === initialEventId);\n\n                if (eventIndex < 0) {\n                    throw new Error(\"getEventTimeline result didn't include requested event\");\n                }\n            }\n\n            const endIndex = Math.min(events.length, eventIndex + Math.ceil(initialWindowSize / 2));\n            const startIndex = Math.max(0, endIndex - initialWindowSize);\n            this.start = new TimelineIndex(timeline, startIndex - timeline.getBaseIndex());\n            this.end = new TimelineIndex(timeline, endIndex - timeline.getBaseIndex());\n            this.eventCount = endIndex - startIndex;\n        };\n\n        // We avoid delaying the resolution of the promise by a reactor tick if we already have the data we need,\n        // which is important to keep room-switching feeling snappy.\n        if (this.timelineSet.getTimelineForEvent(initialEventId)) {\n            initFields(this.timelineSet.getTimelineForEvent(initialEventId));\n            return Promise.resolve();\n        } else if (initialEventId) {\n            return this.client.getEventTimeline(this.timelineSet, initialEventId).then(initFields);\n        } else {\n            initFields(this.timelineSet.getLiveTimeline());\n            return Promise.resolve();\n        }\n    }\n\n    /**\n     * Get the TimelineIndex of the window in the given direction.\n     *\n     * @param direction -   EventTimeline.BACKWARDS to get the TimelineIndex\n     * at the start of the window; EventTimeline.FORWARDS to get the TimelineIndex at\n     * the end.\n     *\n     * @returns The requested timeline index if one exists, null\n     * otherwise.\n     */\n    public getTimelineIndex(direction: Direction): TimelineIndex | null {\n        if (direction == EventTimeline.BACKWARDS) {\n            return this.start ?? null;\n        } else if (direction == EventTimeline.FORWARDS) {\n            return this.end ?? null;\n        } else {\n            throw new Error(\"Invalid direction '\" + direction + \"'\");\n        }\n    }\n\n    /**\n     * Try to extend the window using events that are already in the underlying\n     * TimelineIndex.\n     *\n     * @param direction -   EventTimeline.BACKWARDS to try extending it\n     *   backwards; EventTimeline.FORWARDS to try extending it forwards.\n     * @param size -   number of events to try to extend by.\n     *\n     * @returns true if the window was extended, false otherwise.\n     */\n    public extend(direction: Direction, size: number): boolean {\n        const tl = this.getTimelineIndex(direction);\n\n        if (!tl) {\n            debuglog(\"TimelineWindow: no timeline yet\");\n            return false;\n        }\n\n        const count = direction == EventTimeline.BACKWARDS ? tl.retreat(size) : tl.advance(size);\n\n        if (count) {\n            this.eventCount += count;\n            debuglog(\"TimelineWindow: increased cap by \" + count + \" (now \" + this.eventCount + \")\");\n            // remove some events from the other end, if necessary\n            const excess = this.eventCount - this.windowLimit;\n            if (excess > 0) {\n                this.unpaginate(excess, direction != EventTimeline.BACKWARDS);\n            }\n            return true;\n        }\n\n        return false;\n    }\n\n    private onTimelineEvent(_event?: MatrixEvent, _room?: Room, _atStart?: boolean, removed?: boolean): void {\n        if (removed) {\n            this.onEventRemoved();\n        }\n    }\n\n    /**\n     * If an event was removed, meaning this window is longer than the timeline,\n     * shorten the window.\n     */\n    private onEventRemoved(): void {\n        const events = this.getEvents();\n        if (events.length > 0 && events[events.length - 1] === undefined && this.end) {\n            this.end.index--;\n        }\n    }\n\n    /**\n     * Check if this window can be extended\n     *\n     * <p>This returns true if we either have more events, or if we have a\n     * pagination token which means we can paginate in that direction. It does not\n     * necessarily mean that there are more events available in that direction at\n     * this time.\n     *\n     * @param direction -   EventTimeline.BACKWARDS to check if we can\n     *   paginate backwards; EventTimeline.FORWARDS to check if we can go forwards\n     *\n     * @returns true if we can paginate in the given direction\n     */\n    public canPaginate(direction: Direction): boolean {\n        const tl = this.getTimelineIndex(direction);\n\n        if (!tl) {\n            debuglog(\"TimelineWindow: no timeline yet\");\n            return false;\n        }\n\n        if (direction == EventTimeline.BACKWARDS) {\n            if (tl.index > tl.minIndex()) {\n                return true;\n            }\n        } else {\n            if (tl.index < tl.maxIndex()) {\n                return true;\n            }\n        }\n\n        const hasNeighbouringTimeline = tl.timeline.getNeighbouringTimeline(direction);\n        const paginationToken = tl.timeline.getPaginationToken(direction);\n        return Boolean(hasNeighbouringTimeline) || Boolean(paginationToken);\n    }\n\n    /**\n     * Attempt to extend the window\n     *\n     * @param direction -   EventTimeline.BACKWARDS to extend the window\n     *    backwards (towards older events); EventTimeline.FORWARDS to go forwards.\n     *\n     * @param size -   number of events to try to extend by. If fewer than this\n     *    number are immediately available, then we return immediately rather than\n     *    making an API call.\n     *\n     * @param makeRequest - whether we should make API calls to\n     *    fetch further events if we don't have any at all. (This has no effect if\n     *    the room already knows about additional events in the relevant direction,\n     *    even if there are fewer than 'size' of them, as we will just return those\n     *    we already know about.)\n     *\n     * @param requestLimit - limit for the number of API requests we\n     *    should make.\n     *\n     * @returns Promise which resolves to a boolean which is true if more events\n     *    were successfully retrieved.\n     */\n    public async paginate(\n        direction: Direction,\n        size: number,\n        makeRequest = true,\n        requestLimit = DEFAULT_PAGINATE_LOOP_LIMIT,\n    ): Promise<boolean> {\n        // Either wind back the message cap (if there are enough events in the\n        // timeline to do so), or fire off a pagination request.\n        const tl = this.getTimelineIndex(direction);\n\n        if (!tl) {\n            debuglog(\"TimelineWindow: no timeline yet\");\n            return false;\n        }\n\n        if (tl.pendingPaginate) {\n            return tl.pendingPaginate;\n        }\n\n        // try moving the cap\n        if (this.extend(direction, size)) {\n            return true;\n        }\n\n        if (!makeRequest || requestLimit === 0) {\n            // todo: should we return something different to indicate that there\n            // might be more events out there, but we haven't found them yet?\n            return false;\n        }\n\n        // try making a pagination request\n        const token = tl.timeline.getPaginationToken(direction);\n        if (!token) {\n            debuglog(\"TimelineWindow: no token\");\n            return false;\n        }\n\n        debuglog(\"TimelineWindow: starting request\");\n\n        const prom = this.client\n            .paginateEventTimeline(tl.timeline, {\n                backwards: direction == EventTimeline.BACKWARDS,\n                limit: size,\n            })\n            .finally(function () {\n                tl.pendingPaginate = undefined;\n            })\n            .then((r) => {\n                debuglog(\"TimelineWindow: request completed with result \" + r);\n                if (!r) {\n                    return this.paginate(direction, size, false, 0);\n                }\n\n                // recurse to advance the index into the results.\n                //\n                // If we don't get any new events, we want to make sure we keep asking\n                // the server for events for as long as we have a valid pagination\n                // token. In particular, we want to know if we've actually hit the\n                // start of the timeline, or if we just happened to know about all of\n                // the events thanks to https://matrix.org/jira/browse/SYN-645.\n                //\n                // On the other hand, we necessarily want to wait forever for the\n                // server to make its mind up about whether there are other events,\n                // because it gives a bad user experience\n                // (https://github.com/vector-im/vector-web/issues/1204).\n                return this.paginate(direction, size, true, requestLimit - 1);\n            });\n        tl.pendingPaginate = prom;\n        return prom;\n    }\n\n    /**\n     * Remove `delta` events from the start or end of the timeline.\n     *\n     * @param delta - number of events to remove from the timeline\n     * @param startOfTimeline - if events should be removed from the start\n     *     of the timeline.\n     */\n    public unpaginate(delta: number, startOfTimeline: boolean): void {\n        const tl = startOfTimeline ? this.start : this.end;\n        if (!tl) {\n            throw new Error(\n                `Attempting to unpaginate startOfTimeline=${startOfTimeline} but don't have this direction`,\n            );\n        }\n\n        // sanity-check the delta\n        if (delta > this.eventCount || delta < 0) {\n            throw new Error(\n                `Attemting to unpaginate ${delta} events, but only have ${this.eventCount} in the timeline`,\n            );\n        }\n\n        while (delta > 0) {\n            const count = startOfTimeline ? tl.advance(delta) : tl.retreat(delta);\n            if (count <= 0) {\n                // sadness. This shouldn't be possible.\n                throw new Error(\"Unable to unpaginate any further, but still have \" + this.eventCount + \" events\");\n            }\n\n            delta -= count;\n            this.eventCount -= count;\n            debuglog(\"TimelineWindow.unpaginate: dropped \" + count + \" (now \" + this.eventCount + \")\");\n        }\n    }\n\n    /**\n     * Get a list of the events currently in the window\n     *\n     * @returns the events in the window\n     */\n    public getEvents(): MatrixEvent[] {\n        if (!this.start) {\n            // not yet loaded\n            return [];\n        }\n\n        const result: MatrixEvent[] = [];\n\n        // iterate through each timeline between this.start and this.end\n        // (inclusive).\n        let timeline: EventTimeline | null = this.start.timeline;\n        // eslint-disable-next-line no-constant-condition\n        while (timeline) {\n            const events = timeline.getEvents();\n\n            // For the first timeline in the chain, we want to start at\n            // this.start.index. For the last timeline in the chain, we want to\n            // stop before this.end.index. Otherwise, we want to copy all of the\n            // events in the timeline.\n            //\n            // (Note that both this.start.index and this.end.index are relative\n            // to their respective timelines' BaseIndex).\n            //\n            let startIndex = 0;\n            let endIndex = events.length;\n            if (timeline === this.start.timeline) {\n                startIndex = this.start.index + timeline.getBaseIndex();\n            }\n            if (timeline === this.end?.timeline) {\n                endIndex = this.end.index + timeline.getBaseIndex();\n            }\n\n            for (let i = startIndex; i < endIndex; i++) {\n                result.push(events[i]);\n            }\n\n            // if we're not done, iterate to the next timeline.\n            if (timeline === this.end?.timeline) {\n                break;\n            } else {\n                timeline = timeline.getNeighbouringTimeline(EventTimeline.FORWARDS);\n            }\n        }\n\n        return result;\n    }\n}\n\n/**\n * A thing which contains a timeline reference, and an index into it.\n * @internal\n */\nexport class TimelineIndex {\n    public pendingPaginate?: Promise<boolean>;\n\n    // index: the indexes are relative to BaseIndex, so could well be negative.\n    public constructor(\n        public timeline: EventTimeline,\n        public index: number,\n    ) {}\n\n    /**\n     * @returns the minimum possible value for the index in the current\n     *    timeline\n     */\n    public minIndex(): number {\n        return this.timeline.getBaseIndex() * -1;\n    }\n\n    /**\n     * @returns the maximum possible value for the index in the current\n     *    timeline (exclusive - ie, it actually returns one more than the index\n     *    of the last element).\n     */\n    public maxIndex(): number {\n        return this.timeline.getEvents().length - this.timeline.getBaseIndex();\n    }\n\n    /**\n     * Try move the index forward, or into the neighbouring timeline\n     *\n     * @param delta -  number of events to advance by\n     * @returns number of events successfully advanced by\n     */\n    public advance(delta: number): number {\n        if (!delta) {\n            return 0;\n        }\n\n        // first try moving the index in the current timeline. See if there is room\n        // to do so.\n        let cappedDelta;\n        if (delta < 0) {\n            // we want to wind the index backwards.\n            //\n            // (this.minIndex() - this.index) is a negative number whose magnitude\n            // is the amount of room we have to wind back the index in the current\n            // timeline. We cap delta to this quantity.\n            cappedDelta = Math.max(delta, this.minIndex() - this.index);\n            if (cappedDelta < 0) {\n                this.index += cappedDelta;\n                return cappedDelta;\n            }\n        } else {\n            // we want to wind the index forwards.\n            //\n            // (this.maxIndex() - this.index) is a (positive) number whose magnitude\n            // is the amount of room we have to wind forward the index in the current\n            // timeline. We cap delta to this quantity.\n            cappedDelta = Math.min(delta, this.maxIndex() - this.index);\n            if (cappedDelta > 0) {\n                this.index += cappedDelta;\n                return cappedDelta;\n            }\n        }\n\n        // the index is already at the start/end of the current timeline.\n        //\n        // next see if there is a neighbouring timeline to switch to.\n        const neighbour = this.timeline.getNeighbouringTimeline(\n            delta < 0 ? EventTimeline.BACKWARDS : EventTimeline.FORWARDS,\n        );\n        if (neighbour) {\n            this.timeline = neighbour;\n            if (delta < 0) {\n                this.index = this.maxIndex();\n            } else {\n                this.index = this.minIndex();\n            }\n\n            debuglog(\"paginate: switched to new neighbour\");\n\n            // recurse, using the next timeline\n            return this.advance(delta);\n        }\n\n        return 0;\n    }\n\n    /**\n     * Try move the index backwards, or into the neighbouring timeline\n     *\n     * @param delta -  number of events to retreat by\n     * @returns number of events successfully retreated by\n     */\n    public retreat(delta: number): number {\n        return this.advance(delta * -1) * -1;\n    }\n}\n"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAyBA,aAAa,QAAQ,4BAA4B;AAC1E,SAASC,MAAM,QAAQ,aAAa;AAIpC,SAAoBC,SAAS,QAAQ,kBAAkB;;AAEvD;AACA;AACA;AACA,IAAMC,KAAK,GAAG,KAAK;;AAEnB;AACA;AACA;AACA;AACA,IAAMC,QAAQ,GAAGD,KAAK,GAAGF,MAAM,CAACI,GAAG,CAACC,IAAI,CAACL,MAAM,CAAC,GAAG,YAAkB,CAAC,CAAC;;AAEvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAMM,2BAA2B,GAAG,EAAE;AAUtC,OAAO,MAAMC,cAAc,CAAC;EAUxB;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWC,WAAWA,CACGC,MAAoB,EACpBC,WAA6B,EAEhD;IAAA,IAAAC,iBAAA;IAAA,IADEC,IAAW,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC,CAAC;IAnCpB;IACA;IACA;IACA;IAAAG,eAAA,qBAGqB,CAAC;IAAA,KA2BDP,MAAoB,GAApBA,MAAoB;IAAA,KACpBC,WAA6B,GAA7BA,WAA6B;IAG9C,IAAI,CAACO,WAAW,GAAGL,IAAI,CAACK,WAAW,IAAI,IAAI;IAC3C,CAAAN,iBAAA,GAAAD,WAAW,CAACQ,IAAI,cAAAP,iBAAA,eAAhBA,iBAAA,CAAkBQ,EAAE,CAAClB,SAAS,CAACmB,QAAQ,EAAE,IAAI,CAACC,eAAe,CAAChB,IAAI,CAAC,IAAI,CAAC,CAAC;EAC7E;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACWiB,IAAIA,CAACC,cAAuB,EAAyC;IAAA,IAAvCC,iBAAiB,GAAAX,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,EAAE;IACvD;IACA;IACA,IAAMY,UAAU,GAAIC,QAA8B,IAAW;MACzD,IAAI,CAACA,QAAQ,EAAE;QACX,MAAM,IAAIC,KAAK,CAAC,iCAAiC,CAAC;MACtD;MAEA,IAAIC,UAAkB;MAEtB,IAAMC,MAAM,GAAGH,QAAQ,CAACI,SAAS,CAAC,CAAC;MAEnC,IAAI,CAACP,cAAc,EAAE;QACjB;QACAK,UAAU,GAAGC,MAAM,CAACf,MAAM;MAC9B,CAAC,MAAM;QACHc,UAAU,GAAGC,MAAM,CAACE,SAAS,CAAEC,CAAC,IAAKA,CAAC,CAACC,KAAK,CAAC,CAAC,KAAKV,cAAc,CAAC;QAElE,IAAIK,UAAU,GAAG,CAAC,EAAE;UAChB,MAAM,IAAID,KAAK,CAAC,wDAAwD,CAAC;QAC7E;MACJ;MAEA,IAAMO,QAAQ,GAAGC,IAAI,CAACC,GAAG,CAACP,MAAM,CAACf,MAAM,EAAEc,UAAU,GAAGO,IAAI,CAACE,IAAI,CAACb,iBAAiB,GAAG,CAAC,CAAC,CAAC;MACvF,IAAMc,UAAU,GAAGH,IAAI,CAACI,GAAG,CAAC,CAAC,EAAEL,QAAQ,GAAGV,iBAAiB,CAAC;MAC5D,IAAI,CAACgB,KAAK,GAAG,IAAIC,aAAa,CAACf,QAAQ,EAAEY,UAAU,GAAGZ,QAAQ,CAACgB,YAAY,CAAC,CAAC,CAAC;MAC9E,IAAI,CAACC,GAAG,GAAG,IAAIF,aAAa,CAACf,QAAQ,EAAEQ,QAAQ,GAAGR,QAAQ,CAACgB,YAAY,CAAC,CAAC,CAAC;MAC1E,IAAI,CAACE,UAAU,GAAGV,QAAQ,GAAGI,UAAU;IAC3C,CAAC;;IAED;IACA;IACA,IAAI,IAAI,CAAC5B,WAAW,CAACmC,mBAAmB,CAACtB,cAAc,CAAC,EAAE;MACtDE,UAAU,CAAC,IAAI,CAACf,WAAW,CAACmC,mBAAmB,CAACtB,cAAc,CAAC,CAAC;MAChE,OAAOuB,OAAO,CAACC,OAAO,CAAC,CAAC;IAC5B,CAAC,MAAM,IAAIxB,cAAc,EAAE;MACvB,OAAO,IAAI,CAACd,MAAM,CAACuC,gBAAgB,CAAC,IAAI,CAACtC,WAAW,EAAEa,cAAc,CAAC,CAAC0B,IAAI,CAACxB,UAAU,CAAC;IAC1F,CAAC,MAAM;MACHA,UAAU,CAAC,IAAI,CAACf,WAAW,CAACwC,eAAe,CAAC,CAAC,CAAC;MAC9C,OAAOJ,OAAO,CAACC,OAAO,CAAC,CAAC;IAC5B;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWI,gBAAgBA,CAACC,SAAoB,EAAwB;IAChE,IAAIA,SAAS,IAAIrD,aAAa,CAACsD,SAAS,EAAE;MAAA,IAAAC,WAAA;MACtC,QAAAA,WAAA,GAAO,IAAI,CAACd,KAAK,cAAAc,WAAA,cAAAA,WAAA,GAAI,IAAI;IAC7B,CAAC,MAAM,IAAIF,SAAS,IAAIrD,aAAa,CAACwD,QAAQ,EAAE;MAAA,IAAAC,SAAA;MAC5C,QAAAA,SAAA,GAAO,IAAI,CAACb,GAAG,cAAAa,SAAA,cAAAA,SAAA,GAAI,IAAI;IAC3B,CAAC,MAAM;MACH,MAAM,IAAI7B,KAAK,CAAC,qBAAqB,GAAGyB,SAAS,GAAG,GAAG,CAAC;IAC5D;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWK,MAAMA,CAACL,SAAoB,EAAEM,IAAY,EAAW;IACvD,IAAMC,EAAE,GAAG,IAAI,CAACR,gBAAgB,CAACC,SAAS,CAAC;IAE3C,IAAI,CAACO,EAAE,EAAE;MACLxD,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,IAAMyD,KAAK,GAAGR,SAAS,IAAIrD,aAAa,CAACsD,SAAS,GAAGM,EAAE,CAACE,OAAO,CAACH,IAAI,CAAC,GAAGC,EAAE,CAACG,OAAO,CAACJ,IAAI,CAAC;IAExF,IAAIE,KAAK,EAAE;MACP,IAAI,CAAChB,UAAU,IAAIgB,KAAK;MACxBzD,QAAQ,CAAC,mCAAmC,GAAGyD,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAChB,UAAU,GAAG,GAAG,CAAC;MACxF;MACA,IAAMmB,MAAM,GAAG,IAAI,CAACnB,UAAU,GAAG,IAAI,CAAC3B,WAAW;MACjD,IAAI8C,MAAM,GAAG,CAAC,EAAE;QACZ,IAAI,CAACC,UAAU,CAACD,MAAM,EAAEX,SAAS,IAAIrD,aAAa,CAACsD,SAAS,CAAC;MACjE;MACA,OAAO,IAAI;IACf;IAEA,OAAO,KAAK;EAChB;EAEQhC,eAAeA,CAAC4C,MAAoB,EAAEC,KAAY,EAAEC,QAAkB,EAAEC,OAAiB,EAAQ;IACrG,IAAIA,OAAO,EAAE;MACT,IAAI,CAACC,cAAc,CAAC,CAAC;IACzB;EACJ;;EAEA;AACJ;AACA;AACA;EACYA,cAAcA,CAAA,EAAS;IAC3B,IAAMxC,MAAM,GAAG,IAAI,CAACC,SAAS,CAAC,CAAC;IAC/B,IAAID,MAAM,CAACf,MAAM,GAAG,CAAC,IAAIe,MAAM,CAACA,MAAM,CAACf,MAAM,GAAG,CAAC,CAAC,KAAKC,SAAS,IAAI,IAAI,CAAC4B,GAAG,EAAE;MAC1E,IAAI,CAACA,GAAG,CAAC2B,KAAK,EAAE;IACpB;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWC,WAAWA,CAACnB,SAAoB,EAAW;IAC9C,IAAMO,EAAE,GAAG,IAAI,CAACR,gBAAgB,CAACC,SAAS,CAAC;IAE3C,IAAI,CAACO,EAAE,EAAE;MACLxD,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,IAAIiD,SAAS,IAAIrD,aAAa,CAACsD,SAAS,EAAE;MACtC,IAAIM,EAAE,CAACW,KAAK,GAAGX,EAAE,CAACa,QAAQ,CAAC,CAAC,EAAE;QAC1B,OAAO,IAAI;MACf;IACJ,CAAC,MAAM;MACH,IAAIb,EAAE,CAACW,KAAK,GAAGX,EAAE,CAACc,QAAQ,CAAC,CAAC,EAAE;QAC1B,OAAO,IAAI;MACf;IACJ;IAEA,IAAMC,uBAAuB,GAAGf,EAAE,CAACjC,QAAQ,CAACiD,uBAAuB,CAACvB,SAAS,CAAC;IAC9E,IAAMwB,eAAe,GAAGjB,EAAE,CAACjC,QAAQ,CAACmD,kBAAkB,CAACzB,SAAS,CAAC;IACjE,OAAO0B,OAAO,CAACJ,uBAAuB,CAAC,IAAII,OAAO,CAACF,eAAe,CAAC;EACvE;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACiBG,QAAQA,CACjB3B,SAAoB,EACpBM,IAAY,EAGI;IAAA,IAAAsB,UAAA,GAAAnE,SAAA;MAAAoE,KAAA;IAAA,OAAAC,iBAAA;MAAA,IAFhBC,WAAW,GAAAH,UAAA,CAAAlE,MAAA,QAAAkE,UAAA,QAAAjE,SAAA,GAAAiE,UAAA,MAAG,IAAI;MAAA,IAClBI,YAAY,GAAAJ,UAAA,CAAAlE,MAAA,QAAAkE,UAAA,QAAAjE,SAAA,GAAAiE,UAAA,MAAG1E,2BAA2B;MAE1C;MACA;MACA,IAAMqD,EAAE,GAAGsB,KAAI,CAAC9B,gBAAgB,CAACC,SAAS,CAAC;MAE3C,IAAI,CAACO,EAAE,EAAE;QACLxD,QAAQ,CAAC,iCAAiC,CAAC;QAC3C,OAAO,KAAK;MAChB;MAEA,IAAIwD,EAAE,CAAC0B,eAAe,EAAE;QACpB,OAAO1B,EAAE,CAAC0B,eAAe;MAC7B;;MAEA;MACA,IAAIJ,KAAI,CAACxB,MAAM,CAACL,SAAS,EAAEM,IAAI,CAAC,EAAE;QAC9B,OAAO,IAAI;MACf;MAEA,IAAI,CAACyB,WAAW,IAAIC,YAAY,KAAK,CAAC,EAAE;QACpC;QACA;QACA,OAAO,KAAK;MAChB;;MAEA;MACA,IAAME,KAAK,GAAG3B,EAAE,CAACjC,QAAQ,CAACmD,kBAAkB,CAACzB,SAAS,CAAC;MACvD,IAAI,CAACkC,KAAK,EAAE;QACRnF,QAAQ,CAAC,0BAA0B,CAAC;QACpC,OAAO,KAAK;MAChB;MAEAA,QAAQ,CAAC,kCAAkC,CAAC;MAE5C,IAAMoF,IAAI,GAAGN,KAAI,CAACxE,MAAM,CACnB+E,qBAAqB,CAAC7B,EAAE,CAACjC,QAAQ,EAAE;QAChC+D,SAAS,EAAErC,SAAS,IAAIrD,aAAa,CAACsD,SAAS;QAC/CqC,KAAK,EAAEhC;MACX,CAAC,CAAC,CACDiC,OAAO,CAAC,YAAY;QACjBhC,EAAE,CAAC0B,eAAe,GAAGtE,SAAS;MAClC,CAAC,CAAC,CACDkC,IAAI,CAAE2C,CAAC,IAAK;QACTzF,QAAQ,CAAC,gDAAgD,GAAGyF,CAAC,CAAC;QAC9D,IAAI,CAACA,CAAC,EAAE;UACJ,OAAOX,KAAI,CAACF,QAAQ,CAAC3B,SAAS,EAAEM,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QACnD;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA,OAAOuB,KAAI,CAACF,QAAQ,CAAC3B,SAAS,EAAEM,IAAI,EAAE,IAAI,EAAE0B,YAAY,GAAG,CAAC,CAAC;MACjE,CAAC,CAAC;MACNzB,EAAE,CAAC0B,eAAe,GAAGE,IAAI;MACzB,OAAOA,IAAI;IAAC;EAChB;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACWvB,UAAUA,CAAC6B,KAAa,EAAEC,eAAwB,EAAQ;IAC7D,IAAMnC,EAAE,GAAGmC,eAAe,GAAG,IAAI,CAACtD,KAAK,GAAG,IAAI,CAACG,GAAG;IAClD,IAAI,CAACgB,EAAE,EAAE;MACL,MAAM,IAAIhC,KAAK,6CAAAoE,MAAA,CACiCD,eAAe,mCAC/D,CAAC;IACL;;IAEA;IACA,IAAID,KAAK,GAAG,IAAI,CAACjD,UAAU,IAAIiD,KAAK,GAAG,CAAC,EAAE;MACtC,MAAM,IAAIlE,KAAK,4BAAAoE,MAAA,CACgBF,KAAK,6BAAAE,MAAA,CAA0B,IAAI,CAACnD,UAAU,qBAC7E,CAAC;IACL;IAEA,OAAOiD,KAAK,GAAG,CAAC,EAAE;MACd,IAAMjC,KAAK,GAAGkC,eAAe,GAAGnC,EAAE,CAACG,OAAO,CAAC+B,KAAK,CAAC,GAAGlC,EAAE,CAACE,OAAO,CAACgC,KAAK,CAAC;MACrE,IAAIjC,KAAK,IAAI,CAAC,EAAE;QACZ;QACA,MAAM,IAAIjC,KAAK,CAAC,mDAAmD,GAAG,IAAI,CAACiB,UAAU,GAAG,SAAS,CAAC;MACtG;MAEAiD,KAAK,IAAIjC,KAAK;MACd,IAAI,CAAChB,UAAU,IAAIgB,KAAK;MACxBzD,QAAQ,CAAC,qCAAqC,GAAGyD,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAChB,UAAU,GAAG,GAAG,CAAC;IAC9F;EACJ;;EAEA;AACJ;AACA;AACA;AACA;EACWd,SAASA,CAAA,EAAkB;IAC9B,IAAI,CAAC,IAAI,CAACU,KAAK,EAAE;MACb;MACA,OAAO,EAAE;IACb;IAEA,IAAMwD,MAAqB,GAAG,EAAE;;IAEhC;IACA;IACA,IAAItE,QAA8B,GAAG,IAAI,CAACc,KAAK,CAACd,QAAQ;IACxD;IACA,OAAOA,QAAQ,EAAE;MAAA,IAAAuE,UAAA,EAAAC,UAAA;MACb,IAAMrE,MAAM,GAAGH,QAAQ,CAACI,SAAS,CAAC,CAAC;;MAEnC;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA,IAAIQ,UAAU,GAAG,CAAC;MAClB,IAAIJ,QAAQ,GAAGL,MAAM,CAACf,MAAM;MAC5B,IAAIY,QAAQ,KAAK,IAAI,CAACc,KAAK,CAACd,QAAQ,EAAE;QAClCY,UAAU,GAAG,IAAI,CAACE,KAAK,CAAC8B,KAAK,GAAG5C,QAAQ,CAACgB,YAAY,CAAC,CAAC;MAC3D;MACA,IAAIhB,QAAQ,OAAAuE,UAAA,GAAK,IAAI,CAACtD,GAAG,cAAAsD,UAAA,uBAARA,UAAA,CAAUvE,QAAQ,GAAE;QACjCQ,QAAQ,GAAG,IAAI,CAACS,GAAG,CAAC2B,KAAK,GAAG5C,QAAQ,CAACgB,YAAY,CAAC,CAAC;MACvD;MAEA,KAAK,IAAIyD,CAAC,GAAG7D,UAAU,EAAE6D,CAAC,GAAGjE,QAAQ,EAAEiE,CAAC,EAAE,EAAE;QACxCH,MAAM,CAACI,IAAI,CAACvE,MAAM,CAACsE,CAAC,CAAC,CAAC;MAC1B;;MAEA;MACA,IAAIzE,QAAQ,OAAAwE,UAAA,GAAK,IAAI,CAACvD,GAAG,cAAAuD,UAAA,uBAARA,UAAA,CAAUxE,QAAQ,GAAE;QACjC;MACJ,CAAC,MAAM;QACHA,QAAQ,GAAGA,QAAQ,CAACiD,uBAAuB,CAAC5E,aAAa,CAACwD,QAAQ,CAAC;MACvE;IACJ;IAEA,OAAOyC,MAAM;EACjB;AACJ;;AAEA;AACA;AACA;AACA;AACA,OAAO,MAAMvD,aAAa,CAAC;EAGvB;EACOjC,WAAWA,CACPkB,QAAuB,EACvB4C,KAAa,EACtB;IAAA,KAFS5C,QAAuB,GAAvBA,QAAuB;IAAA,KACvB4C,KAAa,GAAbA,KAAa;EACrB;;EAEH;AACJ;AACA;AACA;EACWE,QAAQA,CAAA,EAAW;IACtB,OAAO,IAAI,CAAC9C,QAAQ,CAACgB,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;EAC5C;;EAEA;AACJ;AACA;AACA;AACA;EACW+B,QAAQA,CAAA,EAAW;IACtB,OAAO,IAAI,CAAC/C,QAAQ,CAACI,SAAS,CAAC,CAAC,CAAChB,MAAM,GAAG,IAAI,CAACY,QAAQ,CAACgB,YAAY,CAAC,CAAC;EAC1E;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWoB,OAAOA,CAAC+B,KAAa,EAAU;IAClC,IAAI,CAACA,KAAK,EAAE;MACR,OAAO,CAAC;IACZ;;IAEA;IACA;IACA,IAAIQ,WAAW;IACf,IAAIR,KAAK,GAAG,CAAC,EAAE;MACX;MACA;MACA;MACA;MACA;MACAQ,WAAW,GAAGlE,IAAI,CAACI,GAAG,CAACsD,KAAK,EAAE,IAAI,CAACrB,QAAQ,CAAC,CAAC,GAAG,IAAI,CAACF,KAAK,CAAC;MAC3D,IAAI+B,WAAW,GAAG,CAAC,EAAE;QACjB,IAAI,CAAC/B,KAAK,IAAI+B,WAAW;QACzB,OAAOA,WAAW;MACtB;IACJ,CAAC,MAAM;MACH;MACA;MACA;MACA;MACA;MACAA,WAAW,GAAGlE,IAAI,CAACC,GAAG,CAACyD,KAAK,EAAE,IAAI,CAACpB,QAAQ,CAAC,CAAC,GAAG,IAAI,CAACH,KAAK,CAAC;MAC3D,IAAI+B,WAAW,GAAG,CAAC,EAAE;QACjB,IAAI,CAAC/B,KAAK,IAAI+B,WAAW;QACzB,OAAOA,WAAW;MACtB;IACJ;;IAEA;IACA;IACA;IACA,IAAMC,SAAS,GAAG,IAAI,CAAC5E,QAAQ,CAACiD,uBAAuB,CACnDkB,KAAK,GAAG,CAAC,GAAG9F,aAAa,CAACsD,SAAS,GAAGtD,aAAa,CAACwD,QACxD,CAAC;IACD,IAAI+C,SAAS,EAAE;MACX,IAAI,CAAC5E,QAAQ,GAAG4E,SAAS;MACzB,IAAIT,KAAK,GAAG,CAAC,EAAE;QACX,IAAI,CAACvB,KAAK,GAAG,IAAI,CAACG,QAAQ,CAAC,CAAC;MAChC,CAAC,MAAM;QACH,IAAI,CAACH,KAAK,GAAG,IAAI,CAACE,QAAQ,CAAC,CAAC;MAChC;MAEArE,QAAQ,CAAC,qCAAqC,CAAC;;MAE/C;MACA,OAAO,IAAI,CAAC2D,OAAO,CAAC+B,KAAK,CAAC;IAC9B;IAEA,OAAO,CAAC;EACZ;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWhC,OAAOA,CAACgC,KAAa,EAAU;IAClC,OAAO,IAAI,CAAC/B,OAAO,CAAC+B,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;EACxC;AACJ","ignoreList":[]}

package/lib/utils/decryptAESSecretStorageItem.js

@@ -1,3 +1,4 @@
+import _slicedToArray from "@babel/runtime/helpers/slicedToArray";
 import _asyncToGenerator from "@babel/runtime/helpers/asyncToGenerator";
 /*
  * Copyright 2024 The Matrix.org Foundation C.I.C.
@@ -31,7 +32,10 @@ export default function decryptAESSecretStorageItem(_x, _x2, _x3) {
 }
 function _decryptAESSecretStorageItem() {
   _decryptAESSecretStorageItem = _asyncToGenerator(function* (data, key, name) {
-    var [aesKey, hmacKey] = yield deriveKeys(key, name);
+    var _yield$deriveKeys = yield deriveKeys(key, name),
+      _yield$deriveKeys2 = _slicedToArray(_yield$deriveKeys, 2),
+      aesKey = _yield$deriveKeys2[0],
+      hmacKey = _yield$deriveKeys2[1];
     var ciphertext = decodeBase64(data.ciphertext);
     if (!(yield globalThis.crypto.subtle.verify({
       name: "HMAC"

package/lib/utils/decryptAESSecretStorageItem.js.map

@@ -1 +1 @@
-{"version":3,"file":"decryptAESSecretStorageItem.js","names":["decodeBase64","deriveKeys","decryptAESSecretStorageItem","_x","_x2","_x3","_decryptAESSecretStorageItem","apply","arguments","_asyncToGenerator","data","key","name","aesKey","hmacKey","ciphertext","globalThis","crypto","subtle","verify","mac","Error","concat","plaintext","decrypt","counter","iv","length","TextDecoder","decode","Uint8Array"],"sources":["../../src/utils/decryptAESSecretStorageItem.ts"],"sourcesContent":["/*\n * Copyright 2024 The Matrix.org Foundation C.I.C.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { decodeBase64 } from \"../base64.ts\";\nimport { deriveKeys } from \"./internal/deriveKeys.ts\";\nimport { type AESEncryptedSecretStoragePayload } from \"../@types/AESEncryptedSecretStoragePayload.ts\";\n\n/**\n * Decrypt an AES-encrypted Secret Storage item.\n *\n * @param data - the encrypted data, returned by {@link utils/encryptAESSecretStorageItem.default | encryptAESSecretStorageItem}.\n * @param key - the encryption key to use as an input to the HKDF function which is used to derive the AES key. Must\n *    be the same as provided to {@link utils/encryptAESSecretStorageItem.default | encryptAESSecretStorageItem}.\n * @param name - the name of the secret. Also used as an input to the HKDF operation which is used to derive the AES\n *    key, so again must be the same as provided to {@link utils/encryptAESSecretStorageItem.default | encryptAESSecretStorageItem}.\n */\nexport default async function decryptAESSecretStorageItem(\n    data: AESEncryptedSecretStoragePayload,\n    key: Uint8Array<ArrayBuffer>,\n    name: string,\n): Promise<string> {\n    const [aesKey, hmacKey] = await deriveKeys(key, name);\n\n    const ciphertext = decodeBase64(data.ciphertext);\n\n    if (!(await globalThis.crypto.subtle.verify({ name: \"HMAC\" }, hmacKey, decodeBase64(data.mac), ciphertext))) {\n        throw new Error(`Error decrypting secret ${name}: bad MAC`);\n    }\n\n    const plaintext = await globalThis.crypto.subtle.decrypt(\n        {\n            name: \"AES-CTR\",\n            counter: decodeBase64(data.iv),\n            length: 64,\n        },\n        aesKey,\n        ciphertext,\n    );\n\n    return new TextDecoder().decode(new Uint8Array(plaintext));\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASA,YAAY,QAAQ,cAAc;AAC3C,SAASC,UAAU,QAAQ,0BAA0B;AAGrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAA8BC,2BAA2BA,CAAAC,EAAA,EAAAC,GAAA,EAAAC,GAAA;EAAA,OAAAC,4BAAA,CAAAC,KAAA,OAAAC,SAAA;AAAA;AAwBxD,SAAAF,6BAAA;EAAAA,4BAAA,GAAAG,iBAAA,CAxBc,WACXC,IAAsC,EACtCC,GAA4B,EAC5BC,IAAY,EACG;IACf,IAAM,CAACC,MAAM,EAAEC,OAAO,CAAC,SAASb,UAAU,CAACU,GAAG,EAAEC,IAAI,CAAC;IAErD,IAAMG,UAAU,GAAGf,YAAY,CAACU,IAAI,CAACK,UAAU,CAAC;IAEhD,IAAI,QAAQC,UAAU,CAACC,MAAM,CAACC,MAAM,CAACC,MAAM,CAAC;MAAEP,IAAI,EAAE;IAAO,CAAC,EAAEE,OAAO,EAAEd,YAAY,CAACU,IAAI,CAACU,GAAG,CAAC,EAAEL,UAAU,CAAC,CAAC,EAAE;MACzG,MAAM,IAAIM,KAAK,4BAAAC,MAAA,CAA4BV,IAAI,cAAW,CAAC;IAC/D;IAEA,IAAMW,SAAS,SAASP,UAAU,CAACC,MAAM,CAACC,MAAM,CAACM,OAAO,CACpD;MACIZ,IAAI,EAAE,SAAS;MACfa,OAAO,EAAEzB,YAAY,CAACU,IAAI,CAACgB,EAAE,CAAC;MAC9BC,MAAM,EAAE;IACZ,CAAC,EACDd,MAAM,EACNE,UACJ,CAAC;IAED,OAAO,IAAIa,WAAW,CAAC,CAAC,CAACC,MAAM,CAAC,IAAIC,UAAU,CAACP,SAAS,CAAC,CAAC;EAC9D,CAAC;EAAA,OAAAjB,4BAAA,CAAAC,KAAA,OAAAC,SAAA;AAAA","ignoreList":[]}
+{"version":3,"file":"decryptAESSecretStorageItem.js","names":["decodeBase64","deriveKeys","decryptAESSecretStorageItem","_x","_x2","_x3","_decryptAESSecretStorageItem","apply","arguments","_asyncToGenerator","data","key","name","_yield$deriveKeys","_yield$deriveKeys2","_slicedToArray","aesKey","hmacKey","ciphertext","globalThis","crypto","subtle","verify","mac","Error","concat","plaintext","decrypt","counter","iv","length","TextDecoder","decode","Uint8Array"],"sources":["../../src/utils/decryptAESSecretStorageItem.ts"],"sourcesContent":["/*\n * Copyright 2024 The Matrix.org Foundation C.I.C.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { decodeBase64 } from \"../base64.ts\";\nimport { deriveKeys } from \"./internal/deriveKeys.ts\";\nimport { type AESEncryptedSecretStoragePayload } from \"../@types/AESEncryptedSecretStoragePayload.ts\";\n\n/**\n * Decrypt an AES-encrypted Secret Storage item.\n *\n * @param data - the encrypted data, returned by {@link utils/encryptAESSecretStorageItem.default | encryptAESSecretStorageItem}.\n * @param key - the encryption key to use as an input to the HKDF function which is used to derive the AES key. Must\n *    be the same as provided to {@link utils/encryptAESSecretStorageItem.default | encryptAESSecretStorageItem}.\n * @param name - the name of the secret. Also used as an input to the HKDF operation which is used to derive the AES\n *    key, so again must be the same as provided to {@link utils/encryptAESSecretStorageItem.default | encryptAESSecretStorageItem}.\n */\nexport default async function decryptAESSecretStorageItem(\n    data: AESEncryptedSecretStoragePayload,\n    key: Uint8Array<ArrayBuffer>,\n    name: string,\n): Promise<string> {\n    const [aesKey, hmacKey] = await deriveKeys(key, name);\n\n    const ciphertext = decodeBase64(data.ciphertext);\n\n    if (!(await globalThis.crypto.subtle.verify({ name: \"HMAC\" }, hmacKey, decodeBase64(data.mac), ciphertext))) {\n        throw new Error(`Error decrypting secret ${name}: bad MAC`);\n    }\n\n    const plaintext = await globalThis.crypto.subtle.decrypt(\n        {\n            name: \"AES-CTR\",\n            counter: decodeBase64(data.iv),\n            length: 64,\n        },\n        aesKey,\n        ciphertext,\n    );\n\n    return new TextDecoder().decode(new Uint8Array(plaintext));\n}\n"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASA,YAAY,QAAQ,cAAc;AAC3C,SAASC,UAAU,QAAQ,0BAA0B;AAGrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAA8BC,2BAA2BA,CAAAC,EAAA,EAAAC,GAAA,EAAAC,GAAA;EAAA,OAAAC,4BAAA,CAAAC,KAAA,OAAAC,SAAA;AAAA;AAwBxD,SAAAF,6BAAA;EAAAA,4BAAA,GAAAG,iBAAA,CAxBc,WACXC,IAAsC,EACtCC,GAA4B,EAC5BC,IAAY,EACG;IACf,IAAAC,iBAAA,SAAgCZ,UAAU,CAACU,GAAG,EAAEC,IAAI,CAAC;MAAAE,kBAAA,GAAAC,cAAA,CAAAF,iBAAA;MAA9CG,MAAM,GAAAF,kBAAA;MAAEG,OAAO,GAAAH,kBAAA;IAEtB,IAAMI,UAAU,GAAGlB,YAAY,CAACU,IAAI,CAACQ,UAAU,CAAC;IAEhD,IAAI,QAAQC,UAAU,CAACC,MAAM,CAACC,MAAM,CAACC,MAAM,CAAC;MAAEV,IAAI,EAAE;IAAO,CAAC,EAAEK,OAAO,EAAEjB,YAAY,CAACU,IAAI,CAACa,GAAG,CAAC,EAAEL,UAAU,CAAC,CAAC,EAAE;MACzG,MAAM,IAAIM,KAAK,4BAAAC,MAAA,CAA4Bb,IAAI,cAAW,CAAC;IAC/D;IAEA,IAAMc,SAAS,SAASP,UAAU,CAACC,MAAM,CAACC,MAAM,CAACM,OAAO,CACpD;MACIf,IAAI,EAAE,SAAS;MACfgB,OAAO,EAAE5B,YAAY,CAACU,IAAI,CAACmB,EAAE,CAAC;MAC9BC,MAAM,EAAE;IACZ,CAAC,EACDd,MAAM,EACNE,UACJ,CAAC;IAED,OAAO,IAAIa,WAAW,CAAC,CAAC,CAACC,MAAM,CAAC,IAAIC,UAAU,CAACP,SAAS,CAAC,CAAC;EAC9D,CAAC;EAAA,OAAApB,4BAAA,CAAAC,KAAA,OAAAC,SAAA;AAAA","ignoreList":[]}

package/lib/utils/encryptAESSecretStorageItem.js

@@ -1,3 +1,4 @@
+import _slicedToArray from "@babel/runtime/helpers/slicedToArray";
 import _asyncToGenerator from "@babel/runtime/helpers/asyncToGenerator";
 /*
  * Copyright 2024 The Matrix.org Foundation C.I.C.
@@ -47,7 +48,10 @@ function _encryptAESSecretStorageItem() {
       // of a single bit of iv is a price we have to pay.
       iv[8] &= 0x7f;
     }
-    var [aesKey, hmacKey] = yield deriveKeys(key, name);
+    var _yield$deriveKeys = yield deriveKeys(key, name),
+      _yield$deriveKeys2 = _slicedToArray(_yield$deriveKeys, 2),
+      aesKey = _yield$deriveKeys2[0],
+      hmacKey = _yield$deriveKeys2[1];
     var encodedData = new TextEncoder().encode(data);
     var ciphertext = yield globalThis.crypto.subtle.encrypt({
       name: "AES-CTR",

package/lib/utils/encryptAESSecretStorageItem.js.map

@@ -1 +1 @@
-{"version":3,"file":"encryptAESSecretStorageItem.js","names":["decodeBase64","encodeBase64","deriveKeys","encryptAESSecretStorageItem","_x","_x2","_x3","_x4","_encryptAESSecretStorageItem","apply","arguments","_asyncToGenerator","data","key","name","ivStr","iv","Uint8Array","globalThis","crypto","getRandomValues","aesKey","hmacKey","encodedData","TextEncoder","encode","ciphertext","subtle","encrypt","counter","length","hmac","sign","mac"],"sources":["../../src/utils/encryptAESSecretStorageItem.ts"],"sourcesContent":["/*\n * Copyright 2024 The Matrix.org Foundation C.I.C.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { decodeBase64, encodeBase64 } from \"../base64.ts\";\nimport { deriveKeys } from \"./internal/deriveKeys.ts\";\nimport { type AESEncryptedSecretStoragePayload } from \"../@types/AESEncryptedSecretStoragePayload.ts\";\n\n/**\n * Encrypt a string as a secret storage item, using AES-CTR.\n *\n * @param data - the plaintext to encrypt\n * @param key - the encryption key to use as an input to the HKDF function which is used to derive the AES key for\n *    encryption. Obviously, the same key must be provided when decrypting.\n * @param name - the name of the secret. Used as an input to the HKDF operation which is used to derive the AES key,\n *    so again the same value must be provided when decrypting.\n * @param ivStr - the base64-encoded initialization vector to use. If not supplied, a random one will be generated.\n *\n * @returns The encrypted result, including the ciphertext itself, the initialization vector (as supplied in `ivStr`,\n *   or generated), and an HMAC on the ciphertext — all base64-encoded.\n */\nexport default async function encryptAESSecretStorageItem(\n    data: string,\n    key: Uint8Array<ArrayBuffer>,\n    name: string,\n    ivStr?: string,\n): Promise<AESEncryptedSecretStoragePayload> {\n    let iv: Uint8Array<ArrayBuffer>;\n    if (ivStr) {\n        iv = decodeBase64(ivStr);\n    } else {\n        iv = new Uint8Array(16);\n        globalThis.crypto.getRandomValues(iv);\n\n        // clear bit 63 of the IV to stop us hitting the 64-bit counter boundary\n        // (which would mean we wouldn't be able to decrypt on Android). The loss\n        // of a single bit of iv is a price we have to pay.\n        iv[8] &= 0x7f;\n    }\n\n    const [aesKey, hmacKey] = await deriveKeys(key, name);\n    const encodedData = new TextEncoder().encode(data);\n\n    const ciphertext = await globalThis.crypto.subtle.encrypt(\n        {\n            name: \"AES-CTR\",\n            counter: iv,\n            length: 64,\n        },\n        aesKey,\n        encodedData,\n    );\n\n    const hmac = await globalThis.crypto.subtle.sign({ name: \"HMAC\" }, hmacKey, ciphertext);\n\n    return {\n        iv: encodeBase64(iv),\n        ciphertext: encodeBase64(new Uint8Array(ciphertext)),\n        mac: encodeBase64(new Uint8Array(hmac)),\n    };\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASA,YAAY,EAAEC,YAAY,QAAQ,cAAc;AACzD,SAASC,UAAU,QAAQ,0BAA0B;AAGrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAA8BC,2BAA2BA,CAAAC,EAAA,EAAAC,GAAA,EAAAC,GAAA,EAAAC,GAAA;EAAA,OAAAC,4BAAA,CAAAC,KAAA,OAAAC,SAAA;AAAA;AAuCxD,SAAAF,6BAAA;EAAAA,4BAAA,GAAAG,iBAAA,CAvCc,WACXC,IAAY,EACZC,GAA4B,EAC5BC,IAAY,EACZC,KAAc,EAC2B;IACzC,IAAIC,EAA2B;IAC/B,IAAID,KAAK,EAAE;MACPC,EAAE,GAAGhB,YAAY,CAACe,KAAK,CAAC;IAC5B,CAAC,MAAM;MACHC,EAAE,GAAG,IAAIC,UAAU,CAAC,EAAE,CAAC;MACvBC,UAAU,CAACC,MAAM,CAACC,eAAe,CAACJ,EAAE,CAAC;;MAErC;MACA;MACA;MACAA,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI;IACjB;IAEA,IAAM,CAACK,MAAM,EAAEC,OAAO,CAAC,SAASpB,UAAU,CAACW,GAAG,EAAEC,IAAI,CAAC;IACrD,IAAMS,WAAW,GAAG,IAAIC,WAAW,CAAC,CAAC,CAACC,MAAM,CAACb,IAAI,CAAC;IAElD,IAAMc,UAAU,SAASR,UAAU,CAACC,MAAM,CAACQ,MAAM,CAACC,OAAO,CACrD;MACId,IAAI,EAAE,SAAS;MACfe,OAAO,EAAEb,EAAE;MACXc,MAAM,EAAE;IACZ,CAAC,EACDT,MAAM,EACNE,WACJ,CAAC;IAED,IAAMQ,IAAI,SAASb,UAAU,CAACC,MAAM,CAACQ,MAAM,CAACK,IAAI,CAAC;MAAElB,IAAI,EAAE;IAAO,CAAC,EAAEQ,OAAO,EAAEI,UAAU,CAAC;IAEvF,OAAO;MACHV,EAAE,EAAEf,YAAY,CAACe,EAAE,CAAC;MACpBU,UAAU,EAAEzB,YAAY,CAAC,IAAIgB,UAAU,CAACS,UAAU,CAAC,CAAC;MACpDO,GAAG,EAAEhC,YAAY,CAAC,IAAIgB,UAAU,CAACc,IAAI,CAAC;IAC1C,CAAC;EACL,CAAC;EAAA,OAAAvB,4BAAA,CAAAC,KAAA,OAAAC,SAAA;AAAA","ignoreList":[]}
+{"version":3,"file":"encryptAESSecretStorageItem.js","names":["decodeBase64","encodeBase64","deriveKeys","encryptAESSecretStorageItem","_x","_x2","_x3","_x4","_encryptAESSecretStorageItem","apply","arguments","_asyncToGenerator","data","key","name","ivStr","iv","Uint8Array","globalThis","crypto","getRandomValues","_yield$deriveKeys","_yield$deriveKeys2","_slicedToArray","aesKey","hmacKey","encodedData","TextEncoder","encode","ciphertext","subtle","encrypt","counter","length","hmac","sign","mac"],"sources":["../../src/utils/encryptAESSecretStorageItem.ts"],"sourcesContent":["/*\n * Copyright 2024 The Matrix.org Foundation C.I.C.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { decodeBase64, encodeBase64 } from \"../base64.ts\";\nimport { deriveKeys } from \"./internal/deriveKeys.ts\";\nimport { type AESEncryptedSecretStoragePayload } from \"../@types/AESEncryptedSecretStoragePayload.ts\";\n\n/**\n * Encrypt a string as a secret storage item, using AES-CTR.\n *\n * @param data - the plaintext to encrypt\n * @param key - the encryption key to use as an input to the HKDF function which is used to derive the AES key for\n *    encryption. Obviously, the same key must be provided when decrypting.\n * @param name - the name of the secret. Used as an input to the HKDF operation which is used to derive the AES key,\n *    so again the same value must be provided when decrypting.\n * @param ivStr - the base64-encoded initialization vector to use. If not supplied, a random one will be generated.\n *\n * @returns The encrypted result, including the ciphertext itself, the initialization vector (as supplied in `ivStr`,\n *   or generated), and an HMAC on the ciphertext — all base64-encoded.\n */\nexport default async function encryptAESSecretStorageItem(\n    data: string,\n    key: Uint8Array<ArrayBuffer>,\n    name: string,\n    ivStr?: string,\n): Promise<AESEncryptedSecretStoragePayload> {\n    let iv: Uint8Array<ArrayBuffer>;\n    if (ivStr) {\n        iv = decodeBase64(ivStr);\n    } else {\n        iv = new Uint8Array(16);\n        globalThis.crypto.getRandomValues(iv);\n\n        // clear bit 63 of the IV to stop us hitting the 64-bit counter boundary\n        // (which would mean we wouldn't be able to decrypt on Android). The loss\n        // of a single bit of iv is a price we have to pay.\n        iv[8] &= 0x7f;\n    }\n\n    const [aesKey, hmacKey] = await deriveKeys(key, name);\n    const encodedData = new TextEncoder().encode(data);\n\n    const ciphertext = await globalThis.crypto.subtle.encrypt(\n        {\n            name: \"AES-CTR\",\n            counter: iv,\n            length: 64,\n        },\n        aesKey,\n        encodedData,\n    );\n\n    const hmac = await globalThis.crypto.subtle.sign({ name: \"HMAC\" }, hmacKey, ciphertext);\n\n    return {\n        iv: encodeBase64(iv),\n        ciphertext: encodeBase64(new Uint8Array(ciphertext)),\n        mac: encodeBase64(new Uint8Array(hmac)),\n    };\n}\n"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASA,YAAY,EAAEC,YAAY,QAAQ,cAAc;AACzD,SAASC,UAAU,QAAQ,0BAA0B;AAGrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAA8BC,2BAA2BA,CAAAC,EAAA,EAAAC,GAAA,EAAAC,GAAA,EAAAC,GAAA;EAAA,OAAAC,4BAAA,CAAAC,KAAA,OAAAC,SAAA;AAAA;AAuCxD,SAAAF,6BAAA;EAAAA,4BAAA,GAAAG,iBAAA,CAvCc,WACXC,IAAY,EACZC,GAA4B,EAC5BC,IAAY,EACZC,KAAc,EAC2B;IACzC,IAAIC,EAA2B;IAC/B,IAAID,KAAK,EAAE;MACPC,EAAE,GAAGhB,YAAY,CAACe,KAAK,CAAC;IAC5B,CAAC,MAAM;MACHC,EAAE,GAAG,IAAIC,UAAU,CAAC,EAAE,CAAC;MACvBC,UAAU,CAACC,MAAM,CAACC,eAAe,CAACJ,EAAE,CAAC;;MAErC;MACA;MACA;MACAA,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI;IACjB;IAEA,IAAAK,iBAAA,SAAgCnB,UAAU,CAACW,GAAG,EAAEC,IAAI,CAAC;MAAAQ,kBAAA,GAAAC,cAAA,CAAAF,iBAAA;MAA9CG,MAAM,GAAAF,kBAAA;MAAEG,OAAO,GAAAH,kBAAA;IACtB,IAAMI,WAAW,GAAG,IAAIC,WAAW,CAAC,CAAC,CAACC,MAAM,CAAChB,IAAI,CAAC;IAElD,IAAMiB,UAAU,SAASX,UAAU,CAACC,MAAM,CAACW,MAAM,CAACC,OAAO,CACrD;MACIjB,IAAI,EAAE,SAAS;MACfkB,OAAO,EAAEhB,EAAE;MACXiB,MAAM,EAAE;IACZ,CAAC,EACDT,MAAM,EACNE,WACJ,CAAC;IAED,IAAMQ,IAAI,SAAShB,UAAU,CAACC,MAAM,CAACW,MAAM,CAACK,IAAI,CAAC;MAAErB,IAAI,EAAE;IAAO,CAAC,EAAEW,OAAO,EAAEI,UAAU,CAAC;IAEvF,OAAO;MACHb,EAAE,EAAEf,YAAY,CAACe,EAAE,CAAC;MACpBa,UAAU,EAAE5B,YAAY,CAAC,IAAIgB,UAAU,CAACY,UAAU,CAAC,CAAC;MACpDO,GAAG,EAAEnC,YAAY,CAAC,IAAIgB,UAAU,CAACiB,IAAI,CAAC;IAC1C,CAAC;EACL,CAAC;EAAA,OAAA1B,4BAAA,CAAAC,KAAA,OAAAC,SAAA;AAAA","ignoreList":[]}

package/lib/utils.js

@@ -1,5 +1,6 @@
 import _asyncToGenerator from "@babel/runtime/helpers/asyncToGenerator";
 import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import _slicedToArray from "@babel/runtime/helpers/slicedToArray";
 function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
 function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
 /*
@@ -59,19 +60,23 @@ export function internaliseString(str) {
  */
 export function encodeParams(params, urlSearchParams) {
   var searchParams = urlSearchParams !== null && urlSearchParams !== void 0 ? urlSearchParams : new URLSearchParams();
-  var _loop = function _loop(key) {
-    if (val !== undefined && val !== null) {
-      if (Array.isArray(val)) {
-        val.forEach(v => {
-          searchParams.append(key, String(v));
-        });
-      } else {
-        searchParams.append(key, String(val));
+  var _loop = function _loop() {
+      _ref2 = _slicedToArray(_ref3, 2);
+      var key = _ref2[0];
+      var val = _ref2[1];
+      if (val !== undefined && val !== null) {
+        if (Array.isArray(val)) {
+          val.forEach(v => {
+            searchParams.append(key, String(v));
+          });
+        } else {
+          searchParams.append(key, String(val));
+        }
       }
-    }
-  };
-  for (var [key, val] of Object.entries(params)) {
-    _loop(key);
+    },
+    _ref2;
+  for (var _ref3 of Object.entries(params)) {
+    _loop();
   }
   return searchParams;
 }
@@ -285,7 +290,10 @@ export function deepSortedObjectEntries(obj) {
   // Apparently these are object types...
   if (obj === null || obj === undefined || Array.isArray(obj)) return obj;
   var pairs = [];
-  for (var [k, v] of Object.entries(obj)) {
+  for (var _ref6 of Object.entries(obj)) {
+    var _ref5 = _slicedToArray(_ref6, 2);
+    var k = _ref5[0];
+    var v = _ref5[1];
     pairs.push([k, deepSortedObjectEntries(v)]);
   }
 
@@ -477,10 +485,8 @@ export function simpleRetryOperation(promiseFn, shouldRetry) {
     return promiseFn(attempt);
   }, {
     retries: Infinity,
-    shouldRetry: shouldRetry ? _ref => {
-      var {
-        error
-      } = _ref;
+    shouldRetry: shouldRetry ? _ref7 => {
+      var error = _ref7.error;
       return shouldRetry(error);
     } : undefined,
     factor: 2,
@@ -668,7 +674,10 @@ export function lexicographicCompare(a, b) {
  */
 export function recursivelyAssign(target, source) {
   var ignoreNullish = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
-  for (var [sourceKey, sourceValue] of Object.entries(source)) {
+  for (var _ref0 of Object.entries(source)) {
+    var _ref9 = _slicedToArray(_ref0, 2);
+    var sourceKey = _ref9[0];
+    var sourceValue = _ref9[1];
     if (target[sourceKey] instanceof Object && sourceValue) {
       recursivelyAssign(target[sourceKey], sourceValue);
       continue;
@@ -703,7 +712,10 @@ export function isSupportedReceiptType(receiptType) {
 export function mapsEqual(x, y) {
   var eq = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : (v1, v2) => v1 === v2;
   if (x.size !== y.size) return false;
-  for (var [k, v1] of x) {
+  for (var _ref11 of x) {
+    var _ref10 = _slicedToArray(_ref11, 2);
+    var k = _ref10[0];
+    var v1 = _ref10[1];
     var v2 = y.get(k);
     if (v2 === undefined || !eq(v1, v2)) return false;
   }
@@ -727,7 +739,10 @@ function processMapToObjectValue(value) {
  */
 export function recursiveMapToObject(map) {
   var targetMap = new Map();
-  for (var [key, value] of map) {
+  for (var _ref14 of map) {
+    var _ref13 = _slicedToArray(_ref14, 2);
+    var key = _ref13[0];
+    var value = _ref13[1];
     targetMap.set(key, processMapToObjectValue(value));
   }
   return Object.fromEntries(targetMap.entries());