@openclaw/matrix 2026.8.1-beta.3 → 2026.8.2

package/node_modules/matrix-js-sdk/lib/testing.d.ts

@@ -8,7 +8,7 @@
 import { type IContent, type IUnsigned, MatrixEvent } from "./models/event.ts";
 import { EventType } from "./@types/event.ts";
 import { type DecryptionFailureCode } from "./crypto-api/index.ts";
-import { type OidcClientConfig, type ValidatedAuthMetadata } from "./oidc/index.ts";
+import { type ValidatedAuthMetadata } from "./oauth/index.ts";
 /**
  * Create a {@link MatrixEvent}.
  *
@@ -86,13 +86,5 @@ export declare function decryptExistingEvent(mxEvent: MatrixEvent, opts: {
  * @returns OidcClientConfig
  * @experimental
  */
-export declare const makeDelegatedAuthConfig: (issuer?: string, additionalGrantTypes?: string[]) => OidcClientConfig;
-/**
- * Useful for mocking <issuer>/.well-known/openid-configuration
- * @param issuer used as the base for all other urls
- * @param additionalGrantTypes to add to the default grant types
- * @returns ValidatedAuthMetadata
- * @experimental
- */
-export declare const mockOpenIdConfiguration: (issuer?: string, additionalGrantTypes?: string[]) => ValidatedAuthMetadata;
+export declare const makeDelegatedAuthMetadata: (issuer?: string, additionalGrantTypes?: string[]) => ValidatedAuthMetadata;
 //# sourceMappingURL=testing.d.ts.map

package/node_modules/matrix-js-sdk/lib/testing.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"testing.d.ts","sourceRoot":"","sources":["../src/testing.ts"],"names":[],"mappings":"AAgBA;;;;;;GAMG;AAEH,OAAO,EAAE,KAAK,QAAQ,EAAe,KAAK,SAAS,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAE5F,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,KAAK,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAEnE,OAAO,EAAkB,KAAK,gBAAgB,EAAE,KAAK,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AAEpG;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE;IAChC,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAC;IAEf,+BAA+B;IAC/B,MAAM,EAAE,MAAM,CAAC;IAEf,6BAA6B;IAC7B,IAAI,EAAE,SAAS,GAAG,MAAM,CAAC;IAEzB,wFAAwF;IACxF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB,iGAAiG;IACjG,EAAE,CAAC,EAAE,MAAM,CAAC;IAEZ,wGAAwG;IACxG,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB,4BAA4B;IAC5B,OAAO,EAAE,QAAQ,CAAC;IAElB,8CAA8C;IAC9C,QAAQ,CAAC,EAAE,SAAS,CAAC;CACxB,GAAG,WAAW,CAyBd;AAED;;;;GAIG;AACH,wBAAsB,sBAAsB,CAAC,IAAI,EAAE;IAC/C,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAC;IAEf,+BAA+B;IAC/B,MAAM,EAAE,MAAM,CAAC;IAEf,gEAAgE;IAChE,SAAS,EAAE,SAAS,GAAG,MAAM,CAAC;IAE9B,mEAAmE;IACnE,YAAY,EAAE,QAAQ,CAAC;IAEvB,wGAAwG;IACxG,OAAO,CAAC,EAAE,MAAM,CAAC;CACpB,GAAG,OAAO,CAAC,WAAW,CAAC,CAWvB;AAED;;;;GAIG;AACH,wBAAsB,8BAA8B,CAAC,IAAI,EAAE;IACvD,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAC;IAEf,+BAA+B;IAC/B,MAAM,EAAE,MAAM,CAAC;IAEf,sCAAsC;IACtC,IAAI,EAAE,qBAAqB,CAAC;IAE5B,uCAAuC;IACvC,GAAG,EAAE,MAAM,CAAC;IAEZ,wGAAwG;IACxG,OAAO,CAAC,EAAE,MAAM,CAAC;CACpB,GAAG,OAAO,CAAC,WAAW,CAAC,CAgBvB;AAED;;;;;;GAMG;AACH,wBAAsB,oBAAoB,CACtC,OAAO,EAAE,WAAW,EACpB,IAAI,EAAE;IACF,gEAAgE;IAChE,SAAS,EAAE,SAAS,GAAG,MAAM,CAAC;IAE9B,mEAAmE;IACnE,YAAY,EAAE,QAAQ,CAAC;CAC1B,GACF,OAAO,CAAC,IAAI,CAAC,CAcf;AAED;;;;;;GAMG;AACH,eAAO,MAAM,uBAAuB,GAChC,eAA4B,EAC5B,uBAAsB,MAAM,EAAO,KACpC,gBAOF,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,uBAAuB,GAChC,eAA4B,EAC5B,uBAAsB,MAAM,EAAO,KACpC,qBAWD,CAAC"}
+{"version":3,"file":"testing.d.ts","sourceRoot":"","sources":["../src/testing.ts"],"names":[],"mappings":"AAgBA;;;;;;GAMG;AAEH,OAAO,EAAE,KAAK,QAAQ,EAAe,KAAK,SAAS,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAE5F,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,KAAK,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAEnE,OAAO,EAAkB,KAAK,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AAE9E;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE;IAChC,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAC;IAEf,+BAA+B;IAC/B,MAAM,EAAE,MAAM,CAAC;IAEf,6BAA6B;IAC7B,IAAI,EAAE,SAAS,GAAG,MAAM,CAAC;IAEzB,wFAAwF;IACxF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB,iGAAiG;IACjG,EAAE,CAAC,EAAE,MAAM,CAAC;IAEZ,wGAAwG;IACxG,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB,4BAA4B;IAC5B,OAAO,EAAE,QAAQ,CAAC;IAElB,8CAA8C;IAC9C,QAAQ,CAAC,EAAE,SAAS,CAAC;CACxB,GAAG,WAAW,CAyBd;AAED;;;;GAIG;AACH,wBAAsB,sBAAsB,CAAC,IAAI,EAAE;IAC/C,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAC;IAEf,+BAA+B;IAC/B,MAAM,EAAE,MAAM,CAAC;IAEf,gEAAgE;IAChE,SAAS,EAAE,SAAS,GAAG,MAAM,CAAC;IAE9B,mEAAmE;IACnE,YAAY,EAAE,QAAQ,CAAC;IAEvB,wGAAwG;IACxG,OAAO,CAAC,EAAE,MAAM,CAAC;CACpB,GAAG,OAAO,CAAC,WAAW,CAAC,CAWvB;AAED;;;;GAIG;AACH,wBAAsB,8BAA8B,CAAC,IAAI,EAAE;IACvD,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAC;IAEf,+BAA+B;IAC/B,MAAM,EAAE,MAAM,CAAC;IAEf,sCAAsC;IACtC,IAAI,EAAE,qBAAqB,CAAC;IAE5B,uCAAuC;IACvC,GAAG,EAAE,MAAM,CAAC;IAEZ,wGAAwG;IACxG,OAAO,CAAC,EAAE,MAAM,CAAC;CACpB,GAAG,OAAO,CAAC,WAAW,CAAC,CAgBvB;AAED;;;;;;GAMG;AACH,wBAAsB,oBAAoB,CACtC,OAAO,EAAE,WAAW,EACpB,IAAI,EAAE;IACF,gEAAgE;IAChE,SAAS,EAAE,SAAS,GAAG,MAAM,CAAC;IAE9B,mEAAmE;IACnE,YAAY,EAAE,QAAQ,CAAC;CAC1B,GACF,OAAO,CAAC,IAAI,CAAC,CAcf;AAED;;;;;;GAMG;AACH,eAAO,MAAM,yBAAyB,2CAEZ,MAAM,EAAE,KAC/B,qBAWD,CAAC"}

package/node_modules/matrix-js-sdk/lib/testing.js

@@ -1,4 +1,3 @@
-import _objectSpread from "@babel/runtime/helpers/objectSpread2";
 /*
 Copyright 2024 The Matrix.org Foundation C.I.C.
 
@@ -26,7 +25,7 @@ limitations under the License.
 import { MatrixEvent } from "./models/event.js";
 import { EventType } from "./@types/event.js";
 import { DecryptionError } from "./common-crypto/CryptoBackend.js";
-import { OAuthGrantType } from "./oidc/index.js";
+import { OAuthGrantType } from "./oauth/index.js";
 
 /**
  * Create a {@link MatrixEvent}.
@@ -134,30 +133,16 @@ export async function decryptExistingEvent(mxEvent, opts) {
  * @returns OidcClientConfig
  * @experimental
  */
-export const makeDelegatedAuthConfig = (issuer = "https://auth.org/", additionalGrantTypes = []) => {
-  const metadata = mockOpenIdConfiguration(issuer, additionalGrantTypes);
-  return _objectSpread(_objectSpread({}, metadata), {}, {
-    signingKeys: null
-  });
-};
-
-/**
- * Useful for mocking <issuer>/.well-known/openid-configuration
- * @param issuer used as the base for all other urls
- * @param additionalGrantTypes to add to the default grant types
- * @returns ValidatedAuthMetadata
- * @experimental
- */
-export const mockOpenIdConfiguration = (issuer = "https://auth.org/", additionalGrantTypes = []) => ({
+export const makeDelegatedAuthMetadata = (issuer = "https://auth.org/", additionalGrantTypes = []) => ({
   issuer,
   revocation_endpoint: issuer + "revoke",
   token_endpoint: issuer + "token",
   authorization_endpoint: issuer + "auth",
   registration_endpoint: issuer + "registration",
   device_authorization_endpoint: issuer + "device",
-  jwks_uri: issuer + "jwks",
   response_types_supported: ["code"],
   grant_types_supported: [OAuthGrantType.AuthorizationCode, OAuthGrantType.RefreshToken, ...additionalGrantTypes],
-  code_challenge_methods_supported: ["S256"]
+  code_challenge_methods_supported: ["S256"],
+  response_modes_supported: ["query", "fragment"]
 });
 //# sourceMappingURL=testing.js.map

package/node_modules/matrix-js-sdk/lib/testing.js.map

@@ -1 +1 @@
-{"version":3,"file":"testing.js","names":[],"sources":["../src/testing.ts"],"sourcesContent":["/*\nCopyright 2024 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/**\n * This file is a secondary entrypoint for the js-sdk library, exposing utilities which might be useful for writing tests.\n *\n * In general, it should not be included in runtime applications.\n *\n * @packageDocumentation\n */\n\nimport { type IContent, type IEvent, type IUnsigned, MatrixEvent } from \"./models/event.ts\";\nimport { type RoomMember } from \"./models/room-member.ts\";\nimport { EventType } from \"./@types/event.ts\";\nimport { type DecryptionFailureCode } from \"./crypto-api/index.ts\";\nimport { DecryptionError, type EventDecryptionResult } from \"./common-crypto/CryptoBackend.ts\";\nimport { OAuthGrantType, type OidcClientConfig, type ValidatedAuthMetadata } from \"./oidc/index.ts\";\n\n/**\n * Create a {@link MatrixEvent}.\n *\n * @param opts - Values for the event.\n */\nexport function mkMatrixEvent(opts: {\n    /** Room ID of the event. */\n    roomId: string;\n\n    /** The sender of the event. */\n    sender: string;\n\n    /** The type of the event. */\n    type: EventType | string;\n\n    /** Optional `state_key` for the event. If unspecified, a non-state event is created. */\n    stateKey?: string;\n\n    /** Optional `origin_server_ts` for the event. If unspecified, the timestamp will be set to 0. */\n    ts?: number;\n\n    /** Optional `event_id` for the event. If provided will be used as event ID; else an ID is generated. */\n    eventId?: string;\n\n    /** Content of the event. */\n    content: IContent;\n\n    /** Optional `unsigned` data for the event. */\n    unsigned?: IUnsigned;\n}): MatrixEvent {\n    const event: Partial<IEvent> = {\n        type: opts.type,\n        room_id: opts.roomId,\n        sender: opts.sender,\n        content: opts.content,\n        event_id: opts.eventId ?? \"$\" + Math.random() + \"-\" + Math.random(),\n        origin_server_ts: opts.ts ?? 0,\n        unsigned: opts.unsigned,\n    };\n    if (opts.stateKey !== undefined) {\n        event.state_key = opts.stateKey;\n    }\n\n    const mxEvent = new MatrixEvent(event);\n    mxEvent.sender = {\n        userId: opts.sender,\n        membership: \"join\",\n        name: opts.sender,\n        rawDisplayName: opts.sender,\n        roomId: opts.sender,\n        getAvatarUrl: () => {},\n        getMxcAvatarUrl: () => {},\n    } as unknown as RoomMember;\n    return mxEvent;\n}\n\n/**\n * Create a `MatrixEvent` representing a successfully-decrypted `m.room.encrypted` event.\n *\n * @param opts - Values for the event.\n */\nexport async function mkEncryptedMatrixEvent(opts: {\n    /** Room ID of the event. */\n    roomId: string;\n\n    /** The sender of the event. */\n    sender: string;\n\n    /** The type the event will have, once it has been decrypted. */\n    plainType: EventType | string;\n\n    /** The content the event will have, once it has been decrypted. */\n    plainContent: IContent;\n\n    /** Optional `event_id` for the event. If provided will be used as event ID; else an ID is generated. */\n    eventId?: string;\n}): Promise<MatrixEvent> {\n    const mxEvent = mkMatrixEvent({\n        type: EventType.RoomMessageEncrypted,\n        roomId: opts.roomId,\n        sender: opts.sender,\n        content: { algorithm: \"m.megolm.v1.aes-sha2\" },\n        eventId: opts.eventId,\n    });\n\n    await decryptExistingEvent(mxEvent, { plainType: opts.plainType, plainContent: opts.plainContent });\n    return mxEvent;\n}\n\n/**\n * Create a `MatrixEvent` representing a `m.room.encrypted` event which could not be decrypted.\n *\n * @param opts - Values for the event.\n */\nexport async function mkDecryptionFailureMatrixEvent(opts: {\n    /** Room ID of the event. */\n    roomId: string;\n\n    /** The sender of the event. */\n    sender: string;\n\n    /** The reason code for the failure */\n    code: DecryptionFailureCode;\n\n    /** A textual reason for the failure */\n    msg: string;\n\n    /** Optional `event_id` for the event. If provided will be used as event ID; else an ID is generated. */\n    eventId?: string;\n}): Promise<MatrixEvent> {\n    const mxEvent = mkMatrixEvent({\n        type: EventType.RoomMessageEncrypted,\n        roomId: opts.roomId,\n        sender: opts.sender,\n        content: { algorithm: \"m.megolm.v1.aes-sha2\" },\n        eventId: opts.eventId,\n    });\n\n    const mockCrypto = {\n        decryptEvent: async (_ev): Promise<EventDecryptionResult> => {\n            throw new DecryptionError(opts.code, opts.msg);\n        },\n    } as Parameters<MatrixEvent[\"attemptDecryption\"]>[0];\n    await mxEvent.attemptDecryption(mockCrypto);\n    return mxEvent;\n}\n\n/**\n * Given an event previously returned by {@link mkDecryptionFailureMatrixEvent}, simulate a successful re-decryption\n * attempt.\n *\n * @param mxEvent - The event that will be decrypted.\n * @param opts - New data for the successful decryption.\n */\nexport async function decryptExistingEvent(\n    mxEvent: MatrixEvent,\n    opts: {\n        /** The type the event will have, once it has been decrypted. */\n        plainType: EventType | string;\n\n        /** The content the event will have, once it has been decrypted. */\n        plainContent: IContent;\n    },\n): Promise<void> {\n    const decryptionResult: EventDecryptionResult = {\n        claimedEd25519Key: \"\",\n        clearEvent: {\n            type: opts.plainType,\n            content: opts.plainContent,\n        },\n        senderCurve25519Key: \"\",\n    };\n\n    const mockCrypto = {\n        decryptEvent: async (_ev): Promise<EventDecryptionResult> => decryptionResult,\n    } as Parameters<MatrixEvent[\"attemptDecryption\"]>[0];\n    await mxEvent.attemptDecryption(mockCrypto);\n}\n\n/**\n * Makes a valid OidcClientConfig with minimum valid values\n * @param issuer used as the base for all other urls\n * @param additionalGrantTypes to add to the default grant types\n * @returns OidcClientConfig\n * @experimental\n */\nexport const makeDelegatedAuthConfig = (\n    issuer = \"https://auth.org/\",\n    additionalGrantTypes: string[] = [],\n): OidcClientConfig => {\n    const metadata = mockOpenIdConfiguration(issuer, additionalGrantTypes);\n\n    return {\n        ...metadata,\n        signingKeys: null,\n    };\n};\n\n/**\n * Useful for mocking <issuer>/.well-known/openid-configuration\n * @param issuer used as the base for all other urls\n * @param additionalGrantTypes to add to the default grant types\n * @returns ValidatedAuthMetadata\n * @experimental\n */\nexport const mockOpenIdConfiguration = (\n    issuer = \"https://auth.org/\",\n    additionalGrantTypes: string[] = [],\n): ValidatedAuthMetadata => ({\n    issuer,\n    revocation_endpoint: issuer + \"revoke\",\n    token_endpoint: issuer + \"token\",\n    authorization_endpoint: issuer + \"auth\",\n    registration_endpoint: issuer + \"registration\",\n    device_authorization_endpoint: issuer + \"device\",\n    jwks_uri: issuer + \"jwks\",\n    response_types_supported: [\"code\"],\n    grant_types_supported: [OAuthGrantType.AuthorizationCode, OAuthGrantType.RefreshToken, ...additionalGrantTypes],\n    code_challenge_methods_supported: [\"S256\"],\n});\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAqD,WAAW,QAAQ,mBAAmB;AAE3F,SAAS,SAAS,QAAQ,mBAAmB;AAE7C,SAAS,eAAe,QAAoC,kCAAkC;AAC9F,SAAS,cAAc,QAA2D,iBAAiB;;AAEnG;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,aAAa,CAAC,IAwB7B,EAAe;EACZ,MAAM,KAAsB,GAAG;IAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;IACf,OAAO,EAAE,IAAI,CAAC,MAAM;IACpB,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,OAAO,EAAE,IAAI,CAAC,OAAO;IACrB,QAAQ,EAAE,IAAI,CAAC,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACnE,gBAAgB,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;IAC9B,QAAQ,EAAE,IAAI,CAAC;EACnB,CAAC;EACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;IAC7B,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ;EACnC;EAEA,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC;EACtC,OAAO,CAAC,MAAM,GAAG;IACb,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,UAAU,EAAE,MAAM;IAClB,IAAI,EAAE,IAAI,CAAC,MAAM;IACjB,cAAc,EAAE,IAAI,CAAC,MAAM;IAC3B,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,YAAY,EAAE,MAAM,CAAC,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;EAC5B,CAA0B;EAC1B,OAAO,OAAO;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,sBAAsB,CAAC,IAe5C,EAAwB;EACrB,MAAM,OAAO,GAAG,aAAa,CAAC;IAC1B,IAAI,EAAE,SAAS,CAAC,oBAAoB;IACpC,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,OAAO,EAAE;MAAE,SAAS,EAAE;IAAuB,CAAC;IAC9C,OAAO,EAAE,IAAI,CAAC;EAClB,CAAC,CAAC;EAEF,MAAM,oBAAoB,CAAC,OAAO,EAAE;IAAE,SAAS,EAAE,IAAI,CAAC,SAAS;IAAE,YAAY,EAAE,IAAI,CAAC;EAAa,CAAC,CAAC;EACnG,OAAO,OAAO;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,8BAA8B,CAAC,IAepD,EAAwB;EACrB,MAAM,OAAO,GAAG,aAAa,CAAC;IAC1B,IAAI,EAAE,SAAS,CAAC,oBAAoB;IACpC,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,OAAO,EAAE;MAAE,SAAS,EAAE;IAAuB,CAAC;IAC9C,OAAO,EAAE,IAAI,CAAC;EAClB,CAAC,CAAC;EAEF,MAAM,UAAU,GAAG;IACf,YAAY,EAAE,MAAO,GAAG,IAAqC;MACzD,MAAM,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;IAClD;EACJ,CAAoD;EACpD,MAAM,OAAO,CAAC,iBAAiB,CAAC,UAAU,CAAC;EAC3C,OAAO,OAAO;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,oBAAoB,CACtC,OAAoB,EACpB,IAMC,EACY;EACb,MAAM,gBAAuC,GAAG;IAC5C,iBAAiB,EAAE,EAAE;IACrB,UAAU,EAAE;MACR,IAAI,EAAE,IAAI,CAAC,SAAS;MACpB,OAAO,EAAE,IAAI,CAAC;IAClB,CAAC;IACD,mBAAmB,EAAE;EACzB,CAAC;EAED,MAAM,UAAU,GAAG;IACf,YAAY,EAAE,MAAO,GAAG,IAAqC;EACjE,CAAoD;EACpD,MAAM,OAAO,CAAC,iBAAiB,CAAC,UAAU,CAAC;AAC/C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,MAAM,uBAAuB,GAAG,CACnC,MAAM,GAAG,mBAAmB,EAC5B,oBAA8B,GAAG,EAAE,KAChB;EACnB,MAAM,QAAQ,GAAG,uBAAuB,CAAC,MAAM,EAAE,oBAAoB,CAAC;EAEtE,uCACO,QAAQ;IACX,WAAW,EAAE;EAAI;AAEzB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,MAAM,uBAAuB,GAAG,CACnC,MAAM,GAAG,mBAAmB,EAC5B,oBAA8B,GAAG,EAAE,MACV;EACzB,MAAM;EACN,mBAAmB,EAAE,MAAM,GAAG,QAAQ;EACtC,cAAc,EAAE,MAAM,GAAG,OAAO;EAChC,sBAAsB,EAAE,MAAM,GAAG,MAAM;EACvC,qBAAqB,EAAE,MAAM,GAAG,cAAc;EAC9C,6BAA6B,EAAE,MAAM,GAAG,QAAQ;EAChD,QAAQ,EAAE,MAAM,GAAG,MAAM;EACzB,wBAAwB,EAAE,CAAC,MAAM,CAAC;EAClC,qBAAqB,EAAE,CAAC,cAAc,CAAC,iBAAiB,EAAE,cAAc,CAAC,YAAY,EAAE,GAAG,oBAAoB,CAAC;EAC/G,gCAAgC,EAAE,CAAC,MAAM;AAC7C,CAAC,CAAC","ignoreList":[]}
+{"version":3,"file":"testing.js","names":[],"sources":["../src/testing.ts"],"sourcesContent":["/*\nCopyright 2024 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/**\n * This file is a secondary entrypoint for the js-sdk library, exposing utilities which might be useful for writing tests.\n *\n * In general, it should not be included in runtime applications.\n *\n * @packageDocumentation\n */\n\nimport { type IContent, type IEvent, type IUnsigned, MatrixEvent } from \"./models/event.ts\";\nimport { type RoomMember } from \"./models/room-member.ts\";\nimport { EventType } from \"./@types/event.ts\";\nimport { type DecryptionFailureCode } from \"./crypto-api/index.ts\";\nimport { DecryptionError, type EventDecryptionResult } from \"./common-crypto/CryptoBackend.ts\";\nimport { OAuthGrantType, type ValidatedAuthMetadata } from \"./oauth/index.ts\";\n\n/**\n * Create a {@link MatrixEvent}.\n *\n * @param opts - Values for the event.\n */\nexport function mkMatrixEvent(opts: {\n    /** Room ID of the event. */\n    roomId: string;\n\n    /** The sender of the event. */\n    sender: string;\n\n    /** The type of the event. */\n    type: EventType | string;\n\n    /** Optional `state_key` for the event. If unspecified, a non-state event is created. */\n    stateKey?: string;\n\n    /** Optional `origin_server_ts` for the event. If unspecified, the timestamp will be set to 0. */\n    ts?: number;\n\n    /** Optional `event_id` for the event. If provided will be used as event ID; else an ID is generated. */\n    eventId?: string;\n\n    /** Content of the event. */\n    content: IContent;\n\n    /** Optional `unsigned` data for the event. */\n    unsigned?: IUnsigned;\n}): MatrixEvent {\n    const event: Partial<IEvent> = {\n        type: opts.type,\n        room_id: opts.roomId,\n        sender: opts.sender,\n        content: opts.content,\n        event_id: opts.eventId ?? \"$\" + Math.random() + \"-\" + Math.random(),\n        origin_server_ts: opts.ts ?? 0,\n        unsigned: opts.unsigned,\n    };\n    if (opts.stateKey !== undefined) {\n        event.state_key = opts.stateKey;\n    }\n\n    const mxEvent = new MatrixEvent(event);\n    mxEvent.sender = {\n        userId: opts.sender,\n        membership: \"join\",\n        name: opts.sender,\n        rawDisplayName: opts.sender,\n        roomId: opts.sender,\n        getAvatarUrl: () => {},\n        getMxcAvatarUrl: () => {},\n    } as unknown as RoomMember;\n    return mxEvent;\n}\n\n/**\n * Create a `MatrixEvent` representing a successfully-decrypted `m.room.encrypted` event.\n *\n * @param opts - Values for the event.\n */\nexport async function mkEncryptedMatrixEvent(opts: {\n    /** Room ID of the event. */\n    roomId: string;\n\n    /** The sender of the event. */\n    sender: string;\n\n    /** The type the event will have, once it has been decrypted. */\n    plainType: EventType | string;\n\n    /** The content the event will have, once it has been decrypted. */\n    plainContent: IContent;\n\n    /** Optional `event_id` for the event. If provided will be used as event ID; else an ID is generated. */\n    eventId?: string;\n}): Promise<MatrixEvent> {\n    const mxEvent = mkMatrixEvent({\n        type: EventType.RoomMessageEncrypted,\n        roomId: opts.roomId,\n        sender: opts.sender,\n        content: { algorithm: \"m.megolm.v1.aes-sha2\" },\n        eventId: opts.eventId,\n    });\n\n    await decryptExistingEvent(mxEvent, { plainType: opts.plainType, plainContent: opts.plainContent });\n    return mxEvent;\n}\n\n/**\n * Create a `MatrixEvent` representing a `m.room.encrypted` event which could not be decrypted.\n *\n * @param opts - Values for the event.\n */\nexport async function mkDecryptionFailureMatrixEvent(opts: {\n    /** Room ID of the event. */\n    roomId: string;\n\n    /** The sender of the event. */\n    sender: string;\n\n    /** The reason code for the failure */\n    code: DecryptionFailureCode;\n\n    /** A textual reason for the failure */\n    msg: string;\n\n    /** Optional `event_id` for the event. If provided will be used as event ID; else an ID is generated. */\n    eventId?: string;\n}): Promise<MatrixEvent> {\n    const mxEvent = mkMatrixEvent({\n        type: EventType.RoomMessageEncrypted,\n        roomId: opts.roomId,\n        sender: opts.sender,\n        content: { algorithm: \"m.megolm.v1.aes-sha2\" },\n        eventId: opts.eventId,\n    });\n\n    const mockCrypto = {\n        decryptEvent: async (_ev): Promise<EventDecryptionResult> => {\n            throw new DecryptionError(opts.code, opts.msg);\n        },\n    } as Parameters<MatrixEvent[\"attemptDecryption\"]>[0];\n    await mxEvent.attemptDecryption(mockCrypto);\n    return mxEvent;\n}\n\n/**\n * Given an event previously returned by {@link mkDecryptionFailureMatrixEvent}, simulate a successful re-decryption\n * attempt.\n *\n * @param mxEvent - The event that will be decrypted.\n * @param opts - New data for the successful decryption.\n */\nexport async function decryptExistingEvent(\n    mxEvent: MatrixEvent,\n    opts: {\n        /** The type the event will have, once it has been decrypted. */\n        plainType: EventType | string;\n\n        /** The content the event will have, once it has been decrypted. */\n        plainContent: IContent;\n    },\n): Promise<void> {\n    const decryptionResult: EventDecryptionResult = {\n        claimedEd25519Key: \"\",\n        clearEvent: {\n            type: opts.plainType,\n            content: opts.plainContent,\n        },\n        senderCurve25519Key: \"\",\n    };\n\n    const mockCrypto = {\n        decryptEvent: async (_ev): Promise<EventDecryptionResult> => decryptionResult,\n    } as Parameters<MatrixEvent[\"attemptDecryption\"]>[0];\n    await mxEvent.attemptDecryption(mockCrypto);\n}\n\n/**\n * Makes a valid OidcClientConfig with minimum valid values\n * @param issuer used as the base for all other urls\n * @param additionalGrantTypes to add to the default grant types\n * @returns OidcClientConfig\n * @experimental\n */\nexport const makeDelegatedAuthMetadata = (\n    issuer = \"https://auth.org/\",\n    additionalGrantTypes: string[] = [],\n): ValidatedAuthMetadata => ({\n    issuer,\n    revocation_endpoint: issuer + \"revoke\",\n    token_endpoint: issuer + \"token\",\n    authorization_endpoint: issuer + \"auth\",\n    registration_endpoint: issuer + \"registration\",\n    device_authorization_endpoint: issuer + \"device\",\n    response_types_supported: [\"code\"],\n    grant_types_supported: [OAuthGrantType.AuthorizationCode, OAuthGrantType.RefreshToken, ...additionalGrantTypes],\n    code_challenge_methods_supported: [\"S256\"],\n    response_modes_supported: [\"query\", \"fragment\"],\n});\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAqD,WAAW,QAAQ,mBAAmB;AAE3F,SAAS,SAAS,QAAQ,mBAAmB;AAE7C,SAAS,eAAe,QAAoC,kCAAkC;AAC9F,SAAS,cAAc,QAAoC,kBAAkB;;AAE7E;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,aAAa,CAAC,IAwB7B,EAAe;EACZ,MAAM,KAAsB,GAAG;IAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;IACf,OAAO,EAAE,IAAI,CAAC,MAAM;IACpB,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,OAAO,EAAE,IAAI,CAAC,OAAO;IACrB,QAAQ,EAAE,IAAI,CAAC,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACnE,gBAAgB,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;IAC9B,QAAQ,EAAE,IAAI,CAAC;EACnB,CAAC;EACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;IAC7B,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ;EACnC;EAEA,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC;EACtC,OAAO,CAAC,MAAM,GAAG;IACb,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,UAAU,EAAE,MAAM;IAClB,IAAI,EAAE,IAAI,CAAC,MAAM;IACjB,cAAc,EAAE,IAAI,CAAC,MAAM;IAC3B,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,YAAY,EAAE,MAAM,CAAC,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;EAC5B,CAA0B;EAC1B,OAAO,OAAO;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,sBAAsB,CAAC,IAe5C,EAAwB;EACrB,MAAM,OAAO,GAAG,aAAa,CAAC;IAC1B,IAAI,EAAE,SAAS,CAAC,oBAAoB;IACpC,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,OAAO,EAAE;MAAE,SAAS,EAAE;IAAuB,CAAC;IAC9C,OAAO,EAAE,IAAI,CAAC;EAClB,CAAC,CAAC;EAEF,MAAM,oBAAoB,CAAC,OAAO,EAAE;IAAE,SAAS,EAAE,IAAI,CAAC,SAAS;IAAE,YAAY,EAAE,IAAI,CAAC;EAAa,CAAC,CAAC;EACnG,OAAO,OAAO;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,8BAA8B,CAAC,IAepD,EAAwB;EACrB,MAAM,OAAO,GAAG,aAAa,CAAC;IAC1B,IAAI,EAAE,SAAS,CAAC,oBAAoB;IACpC,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,MAAM,EAAE,IAAI,CAAC,MAAM;IACnB,OAAO,EAAE;MAAE,SAAS,EAAE;IAAuB,CAAC;IAC9C,OAAO,EAAE,IAAI,CAAC;EAClB,CAAC,CAAC;EAEF,MAAM,UAAU,GAAG;IACf,YAAY,EAAE,MAAO,GAAG,IAAqC;MACzD,MAAM,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;IAClD;EACJ,CAAoD;EACpD,MAAM,OAAO,CAAC,iBAAiB,CAAC,UAAU,CAAC;EAC3C,OAAO,OAAO;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,oBAAoB,CACtC,OAAoB,EACpB,IAMC,EACY;EACb,MAAM,gBAAuC,GAAG;IAC5C,iBAAiB,EAAE,EAAE;IACrB,UAAU,EAAE;MACR,IAAI,EAAE,IAAI,CAAC,SAAS;MACpB,OAAO,EAAE,IAAI,CAAC;IAClB,CAAC;IACD,mBAAmB,EAAE;EACzB,CAAC;EAED,MAAM,UAAU,GAAG;IACf,YAAY,EAAE,MAAO,GAAG,IAAqC;EACjE,CAAoD;EACpD,MAAM,OAAO,CAAC,iBAAiB,CAAC,UAAU,CAAC;AAC/C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,MAAM,yBAAyB,GAAG,CACrC,MAAM,GAAG,mBAAmB,EAC5B,oBAA8B,GAAG,EAAE,MACV;EACzB,MAAM;EACN,mBAAmB,EAAE,MAAM,GAAG,QAAQ;EACtC,cAAc,EAAE,MAAM,GAAG,OAAO;EAChC,sBAAsB,EAAE,MAAM,GAAG,MAAM;EACvC,qBAAqB,EAAE,MAAM,GAAG,cAAc;EAC9C,6BAA6B,EAAE,MAAM,GAAG,QAAQ;EAChD,wBAAwB,EAAE,CAAC,MAAM,CAAC;EAClC,qBAAqB,EAAE,CAAC,cAAc,CAAC,iBAAiB,EAAE,cAAc,CAAC,YAAY,EAAE,GAAG,oBAAoB,CAAC;EAC/G,gCAAgC,EAAE,CAAC,MAAM,CAAC;EAC1C,wBAAwB,EAAE,CAAC,OAAO,EAAE,UAAU;AAClD,CAAC,CAAC","ignoreList":[]}

package/node_modules/matrix-js-sdk/lib/timeline-window.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"timeline-window.d.ts","sourceRoot":"","sources":["../src/timeline-window.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,KAAK,SAAS,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAE3E,OAAO,EAAE,KAAK,YAAY,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,KAAK,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AACvE,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAwBrD,UAAU,KAAK;IACX;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,qBAAa,cAAc;IAmCnB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAnChC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IAKrC,OAAO,CAAC,KAAK,CAAC,CAAgB;IAC9B,OAAO,CAAC,GAAG,CAAC,CAAgB;IAC5B,OAAO,CAAC,UAAU,CAAK;IAEvB;;;;;;;;;;;;;;;;;;;;;;;OAuBG;gBAEkB,MAAM,EAAE,YAAY,EACpB,WAAW,EAAE,gBAAgB,EAC9C,IAAI,GAAE,KAAU;IAMpB;;;;;;OAMG;IACI,IAAI,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,iBAAiB,SAAK,GAAG,OAAO,CAAC,IAAI,CAAC;IA2C3E;;;;;;;;;OASG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,aAAa,GAAG,IAAI;IAUnE;;;;;;;;;OASG;IACI,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO;IAwB1D,OAAO,CAAC,eAAe;IAMvB;;;OAGG;IACH,OAAO,CAAC,cAAc;IAOtB;;;;;;;;;;;;OAYG;IACI,WAAW,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAuBjD;;;;;;;;;;;;;;;;;;;;;OAqBG;IACU,QAAQ,CACjB,SAAS,EAAE,SAAS,EACpB,IAAI,EAAE,MAAM,EACZ,WAAW,UAAO,EAClB,YAAY,SAA8B,GAC3C,OAAO,CAAC,OAAO,CAAC;IAkEnB;;;;;;OAMG;IACI,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,OAAO,GAAG,IAAI;IA4BhE;;;;OAIG;IACI,SAAS,IAAI,WAAW,EAAE;CA8CpC;AAED;;;GAGG;AACH,qBAAa,aAAa;IAKX,QAAQ,EAAE,aAAa;IACvB,KAAK,EAAE,MAAM;IALjB,eAAe,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;gBAI/B,QAAQ,EAAE,aAAa,EACvB,KAAK,EAAE,MAAM;IAGxB;;;OAGG;IACI,QAAQ,IAAI,MAAM;IAIzB;;;;OAIG;IACI,QAAQ,IAAI,MAAM;IAIzB;;;;;OAKG;IACI,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAuDrC;;;;;OAKG;IACI,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;CAGxC"}
+{"version":3,"file":"timeline-window.d.ts","sourceRoot":"","sources":["../src/timeline-window.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,KAAK,SAAS,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAE3E,OAAO,EAAE,KAAK,YAAY,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,KAAK,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AACvE,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAwBrD,UAAU,KAAK;IACX;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,qBAAa,cAAc;IAmCnB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAnChC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IAKrC,OAAO,CAAC,KAAK,CAAC,CAAgB;IAC9B,OAAO,CAAC,GAAG,CAAC,CAAgB;IAC5B,OAAO,CAAC,UAAU,CAAK;IAEvB;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,YACqB,MAAM,EAAE,YAAY,EACpB,WAAW,EAAE,gBAAgB,EAC9C,IAAI,GAAE,KAAU,EAInB;IAED;;;;;;OAMG;IACI,IAAI,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,iBAAiB,SAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAyC1E;IAED;;;;;;;;;OASG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,aAAa,GAAG,IAAI,CAQlE;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAsBzD;IAED,OAAO,CAAC,eAAe;IAMvB;;;OAGG;IACH,OAAO,CAAC,cAAc;IAOtB;;;;;;;;;;;;OAYG;IACI,WAAW,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO,CAqBhD;IAED;;;;;;;;;;;;;;;;;;;;;OAqBG;IACU,QAAQ,CACjB,SAAS,EAAE,SAAS,EACpB,IAAI,EAAE,MAAM,EACZ,WAAW,UAAO,EAClB,YAAY,SAA8B,GAC3C,OAAO,CAAC,OAAO,CAAC,CAgElB;IAED;;;;;;OAMG;IACI,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,OAAO,GAAG,IAAI,CA0B/D;IAED;;;;OAIG;IACI,SAAS,IAAI,WAAW,EAAE,CA4ChC;CACJ;AAED;;;GAGG;AACH,qBAAa,aAAa;IAKX,QAAQ,EAAE,aAAa;IACvB,KAAK,EAAE,MAAM;IALjB,eAAe,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IAG1C,YACW,QAAQ,EAAE,aAAa,EACvB,KAAK,EAAE,MAAM,EACpB;IAEJ;;;OAGG;IACI,QAAQ,IAAI,MAAM,CAExB;IAED;;;;OAIG;IACI,QAAQ,IAAI,MAAM,CAExB;IAED;;;;;OAKG;IACI,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAqDpC;IAED;;;;;OAKG;IACI,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEpC;CACJ"}

package/node_modules/matrix-js-sdk/lib/timeline-window.js

@@ -347,7 +347,6 @@ export class TimelineWindow {
     // iterate through each timeline between this.start and this.end
     // (inclusive).
     let timeline = this.start.timeline;
-    // eslint-disable-next-line no-constant-condition
     while (timeline) {
       const events = timeline.getEvents();
 

package/node_modules/matrix-js-sdk/lib/timeline-window.js.map

@@ -1 +1 @@
-{"version":3,"file":"timeline-window.js","names":[],"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,SAAyB,aAAa,QAAQ,4BAA4B;AAC1E,SAAS,MAAM,QAAQ,aAAa;AAIpC,SAAoB,SAAS,QAAQ,kBAAkB;;AAEvD;AACA;AACA;AACA,MAAM,KAAK,GAAG,KAAK;;AAEnB;AACA;AACA;AACA;AACA,MAAM,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,YAAkB,CAAC,CAAC;;AAEvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,2BAA2B,GAAG,EAAE;AAUtC,OAAO,MAAM,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;EACW,WAAW,CACG,MAAoB,EACpB,WAA6B,EAC9C,IAAW,GAAG,CAAC,CAAC,EAClB;IAAA;IApCF;IACA;IACA;IACA;IAAA;IAAA;IAAA,oCAGqB,CAAC;IAAA,KA2BD,MAAoB,GAApB,MAAoB;IAAA,KACpB,WAA6B,GAA7B,WAA6B;IAG9C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,IAAI;IAC3C,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;EAC7E;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACW,IAAI,CAAC,cAAuB,EAAE,iBAAiB,GAAG,EAAE,EAAiB;IACxE;IACA;IACA,MAAM,UAAU,GAAI,QAA8B,IAAW;MACzD,IAAI,CAAC,QAAQ,EAAE;QACX,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC;MACtD;MAEA,IAAI,UAAkB;MAEtB,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;MAEnC,IAAI,CAAC,cAAc,EAAE;QACjB;QACA,UAAU,GAAG,MAAM,CAAC,MAAM;MAC9B,CAAC,MAAM;QACH,UAAU,GAAG,MAAM,CAAC,SAAS,CAAE,CAAC,IAAK,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,cAAc,CAAC;QAElE,IAAI,UAAU,GAAG,CAAC,EAAE;UAChB,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC;QAC7E;MACJ;MAEA,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC;MACvF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,iBAAiB,CAAC;MAC5D,IAAI,CAAC,KAAK,GAAG,IAAI,aAAa,CAAC,QAAQ,EAAE,UAAU,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;MAC9E,IAAI,CAAC,GAAG,GAAG,IAAI,aAAa,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;MAC1E,IAAI,CAAC,UAAU,GAAG,QAAQ,GAAG,UAAU;IAC3C,CAAC;;IAED;IACA;IACA,IAAI,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,cAAc,CAAC,EAAE;MACtD,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,cAAc,CAAC,CAAC;MAChE,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;IAC5B,CAAC,MAAM,IAAI,cAAc,EAAE;MACvB,OAAO,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;IAC1F,CAAC,MAAM;MACH,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC,CAAC;MAC9C,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;IAC5B;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACW,gBAAgB,CAAC,SAAoB,EAAwB;IAChE,IAAI,SAAS,IAAI,aAAa,CAAC,SAAS,EAAE;MACtC,OAAO,IAAI,CAAC,KAAK,IAAI,IAAI;IAC7B,CAAC,MAAM,IAAI,SAAS,IAAI,aAAa,CAAC,QAAQ,EAAE;MAC5C,OAAO,IAAI,CAAC,GAAG,IAAI,IAAI;IAC3B,CAAC,MAAM;MACH,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,SAAS,GAAG,GAAG,CAAC;IAC5D;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACW,MAAM,CAAC,SAAoB,EAAE,IAAY,EAAW;IACvD,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;IAE3C,IAAI,CAAC,EAAE,EAAE;MACL,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,MAAM,KAAK,GAAG,SAAS,IAAI,aAAa,CAAC,SAAS,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;IAExF,IAAI,KAAK,EAAE;MACP,IAAI,CAAC,UAAU,IAAI,KAAK;MACxB,QAAQ,CAAC,mCAAmC,GAAG,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;MACxF;MACA,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW;MACjD,IAAI,MAAM,GAAG,CAAC,EAAE;QACZ,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,IAAI,aAAa,CAAC,SAAS,CAAC;MACjE;MACA,OAAO,IAAI;IACf;IAEA,OAAO,KAAK;EAChB;EAEQ,eAAe,CAAC,MAAoB,EAAE,KAAY,EAAE,QAAkB,EAAE,OAAiB,EAAQ;IACrG,IAAI,OAAO,EAAE;MACT,IAAI,CAAC,cAAc,CAAC,CAAC;IACzB;EACJ;;EAEA;AACJ;AACA;AACA;EACY,cAAc,GAAS;IAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE;MAC1E,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE;IACpB;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACW,WAAW,CAAC,SAAoB,EAAW;IAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;IAE3C,IAAI,CAAC,EAAE,EAAE;MACL,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,IAAI,SAAS,IAAI,aAAa,CAAC,SAAS,EAAE;MACtC,IAAI,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE;QAC1B,OAAO,IAAI;MACf;IACJ,CAAC,MAAM;MACH,IAAI,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE;QAC1B,OAAO,IAAI;MACf;IACJ;IAEA,MAAM,uBAAuB,GAAG,EAAE,CAAC,QAAQ,CAAC,uBAAuB,CAAC,SAAS,CAAC;IAC9E,MAAM,eAAe,GAAG,EAAE,CAAC,QAAQ,CAAC,kBAAkB,CAAC,SAAS,CAAC;IACjE,OAAO,OAAO,CAAC,uBAAuB,CAAC,IAAI,OAAO,CAAC,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;EACI,MAAa,QAAQ,CACjB,SAAoB,EACpB,IAAY,EACZ,WAAW,GAAG,IAAI,EAClB,YAAY,GAAG,2BAA2B,EAC1B;IAChB;IACA;IACA,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;IAE3C,IAAI,CAAC,EAAE,EAAE;MACL,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,IAAI,EAAE,CAAC,eAAe,EAAE;MACpB,OAAO,EAAE,CAAC,eAAe;IAC7B;;IAEA;IACA,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE;MAC9B,OAAO,IAAI;IACf;IAEA,IAAI,CAAC,WAAW,IAAI,YAAY,KAAK,CAAC,EAAE;MACpC;MACA;MACA,OAAO,KAAK;IAChB;;IAEA;IACA,MAAM,KAAK,GAAG,EAAE,CAAC,QAAQ,CAAC,kBAAkB,CAAC,SAAS,CAAC;IACvD,IAAI,CAAC,KAAK,EAAE;MACR,QAAQ,CAAC,0BAA0B,CAAC;MACpC,OAAO,KAAK;IAChB;IAEA,QAAQ,CAAC,kCAAkC,CAAC;IAE5C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CACnB,qBAAqB,CAAC,EAAE,CAAC,QAAQ,EAAE;MAChC,SAAS,EAAE,SAAS,IAAI,aAAa,CAAC,SAAS;MAC/C,KAAK,EAAE;IACX,CAAC,CAAC,CACD,OAAO,CAAC,YAAY;MACjB,EAAE,CAAC,eAAe,GAAG,SAAS;IAClC,CAAC,CAAC,CACD,IAAI,CAAE,CAAC,IAAK;MACT,QAAQ,CAAC,gDAAgD,GAAG,CAAC,CAAC;MAC9D,IAAI,CAAC,CAAC,EAAE;QACJ,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;MACnD;;MAEA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC;IACjE,CAAC,CAAC;IACN,EAAE,CAAC,eAAe,GAAG,IAAI;IACzB,OAAO,IAAI;EACf;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACW,UAAU,CAAC,KAAa,EAAE,eAAwB,EAAQ;IAC7D,MAAM,EAAE,GAAG,eAAe,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG;IAClD,IAAI,CAAC,EAAE,EAAE;MACL,MAAM,IAAI,KAAK,CACX,4CAA4C,eAAe,gCAC/D,CAAC;IACL;;IAEA;IACA,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,IAAI,KAAK,GAAG,CAAC,EAAE;MACtC,MAAM,IAAI,KAAK,CACX,2BAA2B,KAAK,0BAA0B,IAAI,CAAC,UAAU,kBAC7E,CAAC;IACL;IAEA,OAAO,KAAK,GAAG,CAAC,EAAE;MACd,MAAM,KAAK,GAAG,eAAe,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC;MACrE,IAAI,KAAK,IAAI,CAAC,EAAE;QACZ;QACA,MAAM,IAAI,KAAK,CAAC,mDAAmD,GAAG,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;MACtG;MAEA,KAAK,IAAI,KAAK;MACd,IAAI,CAAC,UAAU,IAAI,KAAK;MACxB,QAAQ,CAAC,qCAAqC,GAAG,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IAC9F;EACJ;;EAEA;AACJ;AACA;AACA;AACA;EACW,SAAS,GAAkB;IAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;MACb;MACA,OAAO,EAAE;IACb;IAEA,MAAM,MAAqB,GAAG,EAAE;;IAEhC;IACA;IACA,IAAI,QAA8B,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ;IACxD;IACA,OAAO,QAAQ,EAAE;MACb,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;;MAEnC;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA,IAAI,UAAU,GAAG,CAAC;MAClB,IAAI,QAAQ,GAAG,MAAM,CAAC,MAAM;MAC5B,IAAI,QAAQ,KAAK,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;QAClC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;MAC3D;MACA,IAAI,QAAQ,KAAK,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE;QACjC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;MACvD;MAEA,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QACxC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;MAC1B;;MAEA;MACA,IAAI,QAAQ,KAAK,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE;QACjC;MACJ,CAAC,MAAM;QACH,QAAQ,GAAG,QAAQ,CAAC,uBAAuB,CAAC,aAAa,CAAC,QAAQ,CAAC;MACvE;IACJ;IAEA,OAAO,MAAM;EACjB;AACJ;;AAEA;AACA;AACA;AACA;AACA,OAAO,MAAM,aAAa,CAAC;EAGvB;EACO,WAAW,CACP,QAAuB,EACvB,KAAa,EACtB;IAAA;IAAA,KAFS,QAAuB,GAAvB,QAAuB;IAAA,KACvB,KAAa,GAAb,KAAa;EACrB;;EAEH;AACJ;AACA;AACA;EACW,QAAQ,GAAW;IACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;EAC5C;;EAEA;AACJ;AACA;AACA;AACA;EACW,QAAQ,GAAW;IACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;EAC1E;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACW,OAAO,CAAC,KAAa,EAAU;IAClC,IAAI,CAAC,KAAK,EAAE;MACR,OAAO,CAAC;IACZ;;IAEA;IACA;IACA,IAAI,WAAW;IACf,IAAI,KAAK,GAAG,CAAC,EAAE;MACX;MACA;MACA;MACA;MACA;MACA,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;MAC3D,IAAI,WAAW,GAAG,CAAC,EAAE;QACjB,IAAI,CAAC,KAAK,IAAI,WAAW;QACzB,OAAO,WAAW;MACtB;IACJ,CAAC,MAAM;MACH;MACA;MACA;MACA;MACA;MACA,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;MAC3D,IAAI,WAAW,GAAG,CAAC,EAAE;QACjB,IAAI,CAAC,KAAK,IAAI,WAAW;QACzB,OAAO,WAAW;MACtB;IACJ;;IAEA;IACA;IACA;IACA,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CACnD,KAAK,GAAG,CAAC,GAAG,aAAa,CAAC,SAAS,GAAG,aAAa,CAAC,QACxD,CAAC;IACD,IAAI,SAAS,EAAE;MACX,IAAI,CAAC,QAAQ,GAAG,SAAS;MACzB,IAAI,KAAK,GAAG,CAAC,EAAE;QACX,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;MAChC,CAAC,MAAM;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;MAChC;MAEA,QAAQ,CAAC,qCAAqC,CAAC;;MAE/C;MACA,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;IAC9B;IAEA,OAAO,CAAC;EACZ;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACW,OAAO,CAAC,KAAa,EAAU;IAClC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;EACxC;AACJ","ignoreList":[]}
+{"version":3,"file":"timeline-window.js","names":[],"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        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,SAAyB,aAAa,QAAQ,4BAA4B;AAC1E,SAAS,MAAM,QAAQ,aAAa;AAIpC,SAAoB,SAAS,QAAQ,kBAAkB;;AAEvD;AACA;AACA;AACA,MAAM,KAAK,GAAG,KAAK;;AAEnB;AACA;AACA;AACA;AACA,MAAM,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,YAAkB,CAAC,CAAC;;AAEvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,2BAA2B,GAAG,EAAE;AAUtC,OAAO,MAAM,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;EACW,WAAW,CACG,MAAoB,EACpB,WAA6B,EAC9C,IAAW,GAAG,CAAC,CAAC,EAClB;IAAA;IApCF;IACA;IACA;IACA;IAAA;IAAA;IAAA,oCAGqB,CAAC;IAAA,KA2BD,MAAoB,GAApB,MAAoB;IAAA,KACpB,WAA6B,GAA7B,WAA6B;IAG9C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,IAAI;IAC3C,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;EAC7E;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACW,IAAI,CAAC,cAAuB,EAAE,iBAAiB,GAAG,EAAE,EAAiB;IACxE;IACA;IACA,MAAM,UAAU,GAAI,QAA8B,IAAW;MACzD,IAAI,CAAC,QAAQ,EAAE;QACX,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC;MACtD;MAEA,IAAI,UAAkB;MAEtB,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;MAEnC,IAAI,CAAC,cAAc,EAAE;QACjB;QACA,UAAU,GAAG,MAAM,CAAC,MAAM;MAC9B,CAAC,MAAM;QACH,UAAU,GAAG,MAAM,CAAC,SAAS,CAAE,CAAC,IAAK,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,cAAc,CAAC;QAElE,IAAI,UAAU,GAAG,CAAC,EAAE;UAChB,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC;QAC7E;MACJ;MAEA,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC;MACvF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,iBAAiB,CAAC;MAC5D,IAAI,CAAC,KAAK,GAAG,IAAI,aAAa,CAAC,QAAQ,EAAE,UAAU,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;MAC9E,IAAI,CAAC,GAAG,GAAG,IAAI,aAAa,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;MAC1E,IAAI,CAAC,UAAU,GAAG,QAAQ,GAAG,UAAU;IAC3C,CAAC;;IAED;IACA;IACA,IAAI,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,cAAc,CAAC,EAAE;MACtD,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,cAAc,CAAC,CAAC;MAChE,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;IAC5B,CAAC,MAAM,IAAI,cAAc,EAAE;MACvB,OAAO,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;IAC1F,CAAC,MAAM;MACH,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC,CAAC;MAC9C,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;IAC5B;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACW,gBAAgB,CAAC,SAAoB,EAAwB;IAChE,IAAI,SAAS,IAAI,aAAa,CAAC,SAAS,EAAE;MACtC,OAAO,IAAI,CAAC,KAAK,IAAI,IAAI;IAC7B,CAAC,MAAM,IAAI,SAAS,IAAI,aAAa,CAAC,QAAQ,EAAE;MAC5C,OAAO,IAAI,CAAC,GAAG,IAAI,IAAI;IAC3B,CAAC,MAAM;MACH,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,SAAS,GAAG,GAAG,CAAC;IAC5D;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACW,MAAM,CAAC,SAAoB,EAAE,IAAY,EAAW;IACvD,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;IAE3C,IAAI,CAAC,EAAE,EAAE;MACL,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,MAAM,KAAK,GAAG,SAAS,IAAI,aAAa,CAAC,SAAS,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;IAExF,IAAI,KAAK,EAAE;MACP,IAAI,CAAC,UAAU,IAAI,KAAK;MACxB,QAAQ,CAAC,mCAAmC,GAAG,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;MACxF;MACA,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW;MACjD,IAAI,MAAM,GAAG,CAAC,EAAE;QACZ,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,IAAI,aAAa,CAAC,SAAS,CAAC;MACjE;MACA,OAAO,IAAI;IACf;IAEA,OAAO,KAAK;EAChB;EAEQ,eAAe,CAAC,MAAoB,EAAE,KAAY,EAAE,QAAkB,EAAE,OAAiB,EAAQ;IACrG,IAAI,OAAO,EAAE;MACT,IAAI,CAAC,cAAc,CAAC,CAAC;IACzB;EACJ;;EAEA;AACJ;AACA;AACA;EACY,cAAc,GAAS;IAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE;MAC1E,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE;IACpB;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACW,WAAW,CAAC,SAAoB,EAAW;IAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;IAE3C,IAAI,CAAC,EAAE,EAAE;MACL,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,IAAI,SAAS,IAAI,aAAa,CAAC,SAAS,EAAE;MACtC,IAAI,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE;QAC1B,OAAO,IAAI;MACf;IACJ,CAAC,MAAM;MACH,IAAI,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE;QAC1B,OAAO,IAAI;MACf;IACJ;IAEA,MAAM,uBAAuB,GAAG,EAAE,CAAC,QAAQ,CAAC,uBAAuB,CAAC,SAAS,CAAC;IAC9E,MAAM,eAAe,GAAG,EAAE,CAAC,QAAQ,CAAC,kBAAkB,CAAC,SAAS,CAAC;IACjE,OAAO,OAAO,CAAC,uBAAuB,CAAC,IAAI,OAAO,CAAC,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;EACI,MAAa,QAAQ,CACjB,SAAoB,EACpB,IAAY,EACZ,WAAW,GAAG,IAAI,EAClB,YAAY,GAAG,2BAA2B,EAC1B;IAChB;IACA;IACA,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;IAE3C,IAAI,CAAC,EAAE,EAAE;MACL,QAAQ,CAAC,iCAAiC,CAAC;MAC3C,OAAO,KAAK;IAChB;IAEA,IAAI,EAAE,CAAC,eAAe,EAAE;MACpB,OAAO,EAAE,CAAC,eAAe;IAC7B;;IAEA;IACA,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE;MAC9B,OAAO,IAAI;IACf;IAEA,IAAI,CAAC,WAAW,IAAI,YAAY,KAAK,CAAC,EAAE;MACpC;MACA;MACA,OAAO,KAAK;IAChB;;IAEA;IACA,MAAM,KAAK,GAAG,EAAE,CAAC,QAAQ,CAAC,kBAAkB,CAAC,SAAS,CAAC;IACvD,IAAI,CAAC,KAAK,EAAE;MACR,QAAQ,CAAC,0BAA0B,CAAC;MACpC,OAAO,KAAK;IAChB;IAEA,QAAQ,CAAC,kCAAkC,CAAC;IAE5C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CACnB,qBAAqB,CAAC,EAAE,CAAC,QAAQ,EAAE;MAChC,SAAS,EAAE,SAAS,IAAI,aAAa,CAAC,SAAS;MAC/C,KAAK,EAAE;IACX,CAAC,CAAC,CACD,OAAO,CAAC,YAAY;MACjB,EAAE,CAAC,eAAe,GAAG,SAAS;IAClC,CAAC,CAAC,CACD,IAAI,CAAE,CAAC,IAAK;MACT,QAAQ,CAAC,gDAAgD,GAAG,CAAC,CAAC;MAC9D,IAAI,CAAC,CAAC,EAAE;QACJ,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;MACnD;;MAEA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC;IACjE,CAAC,CAAC;IACN,EAAE,CAAC,eAAe,GAAG,IAAI;IACzB,OAAO,IAAI;EACf;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACW,UAAU,CAAC,KAAa,EAAE,eAAwB,EAAQ;IAC7D,MAAM,EAAE,GAAG,eAAe,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG;IAClD,IAAI,CAAC,EAAE,EAAE;MACL,MAAM,IAAI,KAAK,CACX,4CAA4C,eAAe,gCAC/D,CAAC;IACL;;IAEA;IACA,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,IAAI,KAAK,GAAG,CAAC,EAAE;MACtC,MAAM,IAAI,KAAK,CACX,2BAA2B,KAAK,0BAA0B,IAAI,CAAC,UAAU,kBAC7E,CAAC;IACL;IAEA,OAAO,KAAK,GAAG,CAAC,EAAE;MACd,MAAM,KAAK,GAAG,eAAe,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC;MACrE,IAAI,KAAK,IAAI,CAAC,EAAE;QACZ;QACA,MAAM,IAAI,KAAK,CAAC,mDAAmD,GAAG,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;MACtG;MAEA,KAAK,IAAI,KAAK;MACd,IAAI,CAAC,UAAU,IAAI,KAAK;MACxB,QAAQ,CAAC,qCAAqC,GAAG,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IAC9F;EACJ;;EAEA;AACJ;AACA;AACA;AACA;EACW,SAAS,GAAkB;IAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;MACb;MACA,OAAO,EAAE;IACb;IAEA,MAAM,MAAqB,GAAG,EAAE;;IAEhC;IACA;IACA,IAAI,QAA8B,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ;IACxD,OAAO,QAAQ,EAAE;MACb,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;;MAEnC;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA,IAAI,UAAU,GAAG,CAAC;MAClB,IAAI,QAAQ,GAAG,MAAM,CAAC,MAAM;MAC5B,IAAI,QAAQ,KAAK,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;QAClC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;MAC3D;MACA,IAAI,QAAQ,KAAK,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE;QACjC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;MACvD;MAEA,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QACxC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;MAC1B;;MAEA;MACA,IAAI,QAAQ,KAAK,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE;QACjC;MACJ,CAAC,MAAM;QACH,QAAQ,GAAG,QAAQ,CAAC,uBAAuB,CAAC,aAAa,CAAC,QAAQ,CAAC;MACvE;IACJ;IAEA,OAAO,MAAM;EACjB;AACJ;;AAEA;AACA;AACA;AACA;AACA,OAAO,MAAM,aAAa,CAAC;EAGvB;EACO,WAAW,CACP,QAAuB,EACvB,KAAa,EACtB;IAAA;IAAA,KAFS,QAAuB,GAAvB,QAAuB;IAAA,KACvB,KAAa,GAAb,KAAa;EACrB;;EAEH;AACJ;AACA;AACA;EACW,QAAQ,GAAW;IACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;EAC5C;;EAEA;AACJ;AACA;AACA;AACA;EACW,QAAQ,GAAW;IACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;EAC1E;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACW,OAAO,CAAC,KAAa,EAAU;IAClC,IAAI,CAAC,KAAK,EAAE;MACR,OAAO,CAAC;IACZ;;IAEA;IACA;IACA,IAAI,WAAW;IACf,IAAI,KAAK,GAAG,CAAC,EAAE;MACX;MACA;MACA;MACA;MACA;MACA,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;MAC3D,IAAI,WAAW,GAAG,CAAC,EAAE;QACjB,IAAI,CAAC,KAAK,IAAI,WAAW;QACzB,OAAO,WAAW;MACtB;IACJ,CAAC,MAAM;MACH;MACA;MACA;MACA;MACA;MACA,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;MAC3D,IAAI,WAAW,GAAG,CAAC,EAAE;QACjB,IAAI,CAAC,KAAK,IAAI,WAAW;QACzB,OAAO,WAAW;MACtB;IACJ;;IAEA;IACA;IACA;IACA,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CACnD,KAAK,GAAG,CAAC,GAAG,aAAa,CAAC,SAAS,GAAG,aAAa,CAAC,QACxD,CAAC;IACD,IAAI,SAAS,EAAE;MACX,IAAI,CAAC,QAAQ,GAAG,SAAS;MACzB,IAAI,KAAK,GAAG,CAAC,EAAE;QACX,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;MAChC,CAAC,MAAM;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;MAChC;MAEA,QAAQ,CAAC,qCAAqC,CAAC;;MAE/C;MACA,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;IAC9B;IAEA,OAAO,CAAC;EACZ;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACW,OAAO,CAAC,KAAa,EAAU;IAClC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;EACxC;AACJ","ignoreList":[]}

package/node_modules/matrix-js-sdk/lib/utils/internal/deriveKeys.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"deriveKeys.d.ts","sourceRoot":"","sources":["../../../src/utils/internal/deriveKeys.ts"],"names":[],"mappings":"AAmBA;;;;;;;GAOG;AACH,wBAAsB,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAmC5G"}
+{"version":3,"file":"deriveKeys.d.ts","sourceRoot":"","sources":["../../../src/utils/internal/deriveKeys.ts"],"names":[],"mappings":"AAmBA;;;;;;;GAOG;AACH,wBAAsB,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAkC5G"}

package/node_modules/matrix-js-sdk/lib/utils/internal/deriveKeys.js

@@ -32,7 +32,6 @@ export async function deriveKeys(key, name) {
   const keybits = await globalThis.crypto.subtle.deriveBits({
     name: "HKDF",
     salt: zeroSalt,
-    // eslint-disable-next-line @typescript-eslint/ban-ts-comment
     // @ts-ignore: https://github.com/microsoft/TypeScript-DOM-lib-generator/pull/879
     info: new TextEncoder().encode(name),
     hash: "SHA-256"

package/node_modules/matrix-js-sdk/lib/utils/internal/deriveKeys.js.map

@@ -1 +1 @@
-{"version":3,"file":"deriveKeys.js","names":[],"sources":["../../../src/utils/internal/deriveKeys.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\n// salt for HKDF, with 8 bytes of zeros\nconst zeroSalt = new Uint8Array(8);\n\n/**\n * Derive AES and HMAC keys from a master key.\n *\n * This is used for deriving secret storage keys: see https://spec.matrix.org/v1.11/client-server-api/#msecret_storagev1aes-hmac-sha2 (step 1).\n *\n * @param key\n * @param name\n */\nexport async function deriveKeys(key: Uint8Array<ArrayBuffer>, name: string): Promise<[CryptoKey, CryptoKey]> {\n    const hkdfkey = await globalThis.crypto.subtle.importKey(\"raw\", key, { name: \"HKDF\" }, false, [\"deriveBits\"]);\n    const keybits = await globalThis.crypto.subtle.deriveBits(\n        {\n            name: \"HKDF\",\n            salt: zeroSalt,\n            // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n            // @ts-ignore: https://github.com/microsoft/TypeScript-DOM-lib-generator/pull/879\n            info: new TextEncoder().encode(name),\n            hash: \"SHA-256\",\n        },\n        hkdfkey,\n        512,\n    );\n\n    const aesKey = keybits.slice(0, 32);\n    const hmacKey = keybits.slice(32);\n\n    const aesProm = globalThis.crypto.subtle.importKey(\"raw\", aesKey, { name: \"AES-CTR\" }, false, [\n        \"encrypt\",\n        \"decrypt\",\n    ]);\n\n    const hmacProm = globalThis.crypto.subtle.importKey(\n        \"raw\",\n        hmacKey,\n        {\n            name: \"HMAC\",\n            hash: { name: \"SHA-256\" },\n        },\n        false,\n        [\"sign\", \"verify\"],\n    );\n\n    return Promise.all([aesProm, hmacProm]);\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC;;AAElC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,UAAU,CAAC,GAA4B,EAAE,IAAY,EAAmC;EAC1G,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE;IAAE,IAAI,EAAE;EAAO,CAAC,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,CAAC;EAC7G,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CACrD;IACI,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE,QAAQ;IACd;IACA;IACA,IAAI,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;IACpC,IAAI,EAAE;EACV,CAAC,EACD,OAAO,EACP,GACJ,CAAC;EAED,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;EACnC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;EAEjC,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE;IAAE,IAAI,EAAE;EAAU,CAAC,EAAE,KAAK,EAAE,CAC1F,SAAS,EACT,SAAS,CACZ,CAAC;EAEF,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAC/C,KAAK,EACL,OAAO,EACP;IACI,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE;MAAE,IAAI,EAAE;IAAU;EAC5B,CAAC,EACD,KAAK,EACL,CAAC,MAAM,EAAE,QAAQ,CACrB,CAAC;EAED,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AAC3C","ignoreList":[]}
+{"version":3,"file":"deriveKeys.js","names":[],"sources":["../../../src/utils/internal/deriveKeys.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\n// salt for HKDF, with 8 bytes of zeros\nconst zeroSalt = new Uint8Array(8);\n\n/**\n * Derive AES and HMAC keys from a master key.\n *\n * This is used for deriving secret storage keys: see https://spec.matrix.org/v1.11/client-server-api/#msecret_storagev1aes-hmac-sha2 (step 1).\n *\n * @param key\n * @param name\n */\nexport async function deriveKeys(key: Uint8Array<ArrayBuffer>, name: string): Promise<[CryptoKey, CryptoKey]> {\n    const hkdfkey = await globalThis.crypto.subtle.importKey(\"raw\", key, { name: \"HKDF\" }, false, [\"deriveBits\"]);\n    const keybits = await globalThis.crypto.subtle.deriveBits(\n        {\n            name: \"HKDF\",\n            salt: zeroSalt,\n            // @ts-ignore: https://github.com/microsoft/TypeScript-DOM-lib-generator/pull/879\n            info: new TextEncoder().encode(name),\n            hash: \"SHA-256\",\n        },\n        hkdfkey,\n        512,\n    );\n\n    const aesKey = keybits.slice(0, 32);\n    const hmacKey = keybits.slice(32);\n\n    const aesProm = globalThis.crypto.subtle.importKey(\"raw\", aesKey, { name: \"AES-CTR\" }, false, [\n        \"encrypt\",\n        \"decrypt\",\n    ]);\n\n    const hmacProm = globalThis.crypto.subtle.importKey(\n        \"raw\",\n        hmacKey,\n        {\n            name: \"HMAC\",\n            hash: { name: \"SHA-256\" },\n        },\n        false,\n        [\"sign\", \"verify\"],\n    );\n\n    return Promise.all([aesProm, hmacProm]);\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC;;AAElC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,UAAU,CAAC,GAA4B,EAAE,IAAY,EAAmC;EAC1G,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE;IAAE,IAAI,EAAE;EAAO,CAAC,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,CAAC;EAC7G,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CACrD;IACI,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE,QAAQ;IACd;IACA,IAAI,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;IACpC,IAAI,EAAE;EACV,CAAC,EACD,OAAO,EACP,GACJ,CAAC;EAED,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;EACnC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;EAEjC,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE;IAAE,IAAI,EAAE;EAAU,CAAC,EAAE,KAAK,EAAE,CAC1F,SAAS,EACT,SAAS,CACZ,CAAC;EAEF,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAC/C,KAAK,EACL,OAAO,EACP;IACI,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE;MAAE,IAAI,EAAE;IAAU;EAC5B,CAAC,EACD,KAAK,EACL,CAAC,MAAM,EAAE,QAAQ,CACrB,CAAC;EAED,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AAC3C","ignoreList":[]}

package/node_modules/matrix-js-sdk/lib/utils.d.ts

@@ -255,7 +255,7 @@ export declare function mapsEqual<K, V>(x: Map<K, V>, y: Map<K, V>, eq?: (v1: V,
  * Also supports sub-lists of Maps.
  */
 export declare function recursiveMapToObject(map: Map<any, any>): Record<any, any>;
-export declare function unsafeProp<K extends keyof any | undefined>(prop: K): boolean;
+export declare function unsafeProp(prop: keyof any | undefined): boolean;
 export declare function safeSet<O extends Record<any, any>, K extends keyof O>(obj: O, prop: K, value: O[K]): void;
 export declare function noUnsafeEventProps(event: Partial<IEvent>): boolean;
 export declare class MapWithDefault<K, V> extends Map<K, V> {

package/node_modules/matrix-js-sdk/lib/utils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAuBA,OAAO,EAAE,KAAK,MAAM,EAAE,KAAK,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAGlE,OAAO,EAAE,KAAK,UAAU,EAAE,MAAM,aAAa,CAAC;AAI9C;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAcrD;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,SAAS,EAAE,eAAe,CAAC,EAAE,eAAe,GAAG,eAAe,CAclG;AAED,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS,CAAC,CAAC;AAEzF;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,GAAG,SAAS,CAOzF;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC,CAQ7E;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC,GAAG,MAAM,CAY5G;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,OAAO,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,CAkBnH;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO,CAE9C;AAED;;;;;GAKG;AAEH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAMpE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAErC;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,OAAO,CA4EnD;AAGD;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAejE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,GAAG,GAAG,KAAK,IAAI,MAAM,CAEpD;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAKrD;AAED;;;GAGG;AACH,wBAAgB,4BAA4B,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAKhE;AAED,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAU7C;AAcD,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEjD;AAED,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;AAC3D,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,SAAS,GAAG,SAAS,CAAC;AACjE,wBAAgB,qBAAqB,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;AASxE;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAI1D;AAED;;;;;;GAMG;AACH,wBAAsB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAQ1G;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAQtF;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC,CAEzC;AAED,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAEnD;AAED,wBAAsB,gBAAgB,CAAC,CAAC,EACpC,QAAQ,EAAE,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,EAC/B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,SAAS,GAC3C,OAAO,CAAC,IAAI,CAAC,CAIf;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAElE;AAGD,wBAAsB,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAMjG;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAClC,SAAS,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,EAC1C,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,OAAO,GACtC,OAAO,CAAC,CAAC,CAAC,CAaZ;AAOD;;;GAGG;AACH,eAAO,MAAM,gBAAgB,QAMzB,CAAC;AAEL;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAErF;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAwB3E;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAwB3E;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAa/F;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAEzE;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAEzE;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAUjE;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAC3E,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,EAAE,EACV,aAAa,UAAQ,GACtB,EAAE,GAAG,EAAE,CAYT;AAMD;;;GAGG;AACH,wBAAgB,kCAAkC,CAAC,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,GAAG,MAAM,CAEhG;AAED,wBAAgB,sBAAsB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAEnE;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,KAAG,OAAoB,GAAG,OAAO,CAO9G;AAcD;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAQzE;AAED,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,GAAG,GAAG,SAAS,EAAE,IAAI,EAAE,CAAC,GAAG,OAAO,CAE5E;AAED,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAMzG;AAED,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,CAElE;AAED,qBAAa,cAAc,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5B,OAAO,CAAC,aAAa;gBAAb,aAAa,EAAE,MAAM,CAAC;IAIjD;;;OAGG;IACI,WAAW,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;CAOhC"}
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAuBA,OAAO,EAAE,KAAK,MAAM,EAAE,KAAK,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAGlE,OAAO,EAAE,KAAK,UAAU,EAAE,MAAM,aAAa,CAAC;AAI9C;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAerD;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,SAAS,EAAE,eAAe,CAAC,EAAE,eAAe,GAAG,eAAe,CAclG;AAED,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS,CAAC,CAAC;AAEzF;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,GAAG,SAAS,CAOzF;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC,CAQ7E;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC,GAAG,MAAM,CAY5G;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,OAAO,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,CAkBnH;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO,CAE9C;AAED;;;;;GAKG;AAEH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAMpE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAErC;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,OAAO,CA4EnD;AAGD;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAejE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,GAAG,GAAG,KAAK,IAAI,MAAM,CAEpD;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAKrD;AAED;;;GAGG;AACH,wBAAgB,4BAA4B,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAKhE;AAED,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAU7C;AAcD,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEjD;AAED,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;AAC3D,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,SAAS,GAAG,SAAS,CAAC;AACjE,wBAAgB,qBAAqB,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;AASxE;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAI1D;AAED;;;;;;GAMG;AACH,wBAAsB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAQ1G;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAQtF;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC,CAEzC;AAED,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAEnD;AAED,wBAAsB,gBAAgB,CAAC,CAAC,EACpC,QAAQ,EAAE,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,EAC/B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,SAAS,GAC3C,OAAO,CAAC,IAAI,CAAC,CAIf;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAElE;AAGD,wBAAsB,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAMjG;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAClC,SAAS,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,EAC1C,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,OAAO,GACtC,OAAO,CAAC,CAAC,CAAC,CAaZ;AAOD;;;GAGG;AACH,eAAO,MAAM,gBAAgB,QAMzB,CAAC;AAEL;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAErF;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAwB3E;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAwB3E;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAa/F;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAEzE;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,SAAmB,GAAG,MAAM,CAEzE;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAUjE;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAC3E,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,EAAE,EACV,aAAa,UAAQ,GACtB,EAAE,GAAG,EAAE,CAYT;AAMD;;;GAGG;AACH,wBAAgB,kCAAkC,CAAC,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,GAAG,MAAM,CAEhG;AAED,wBAAgB,sBAAsB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAEnE;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAG,OAAoB,GAAG,OAAO,CAO9G;AAcD;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAQzE;AAED,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,SAAS,GAAG,OAAO,CAE/D;AAED,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAMzG;AAED,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,CAElE;AAED,qBAAa,cAAc,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5B,OAAO,CAAC,aAAa;IAAxC,YAA2B,aAAa,EAAE,MAAM,CAAC,EAEhD;IAED;;;OAGG;IACI,WAAW,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAM5B;CACJ"}

package/node_modules/matrix-js-sdk/lib/utils.js

@@ -34,6 +34,7 @@ const interns = new Map();
 export function internaliseString(str) {
   // Unwrap strings before entering the map, if we somehow got a wrapped
   // string as our input. This should only happen from tests.
+  // oxlint-disable-next-line unicorn/no-instanceof-builtins
   if (str instanceof String) {
     str = str.toString();
   }

package/node_modules/matrix-js-sdk/lib/utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils.js","names":[],"sources":["../src/utils.ts"],"sourcesContent":["/*\nCopyright 2015, 2016, 2019, 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/**\n * This is an internal module.\n */\n\nimport unhomoglyph from \"unhomoglyph\";\nimport promiseRetry from \"p-retry\";\n\nimport { type IEvent, type MatrixEvent } from \"./models/event.ts\";\nimport { M_TIMESTAMP } from \"./@types/location.ts\";\nimport { ReceiptType } from \"./@types/read_receipts.ts\";\nimport { type BaseLogger } from \"./logger.ts\";\n\nconst interns = new Map<string, string>();\n\n/**\n * Internalises a string, reusing a known pointer or storing the pointer\n * if needed for future strings.\n * @param str - The string to internalise.\n * @returns The internalised string.\n */\nexport function internaliseString(str: string): string {\n    // Unwrap strings before entering the map, if we somehow got a wrapped\n    // string as our input. This should only happen from tests.\n    if ((str as unknown) instanceof String) {\n        str = str.toString();\n    }\n\n    // Check the map to see if we can store the value\n    if (!interns.has(str)) {\n        interns.set(str, str);\n    }\n\n    // Return any cached string reference\n    return interns.get(str)!;\n}\n\n/**\n * Encode a dictionary of query parameters.\n * Omits any undefined/null values.\n * @param params - A dict of key/values to encode e.g.\n * `{\"foo\": \"bar\", \"baz\": \"taz\"}`\n * @returns The encoded string e.g. foo=bar&baz=taz\n */\nexport function encodeParams(params: QueryDict, urlSearchParams?: URLSearchParams): URLSearchParams {\n    const searchParams = urlSearchParams ?? new URLSearchParams();\n    for (const [key, val] of Object.entries(params)) {\n        if (val !== undefined && val !== null) {\n            if (Array.isArray(val)) {\n                val.forEach((v) => {\n                    searchParams.append(key, String(v));\n                });\n            } else {\n                searchParams.append(key, String(val));\n            }\n        }\n    }\n    return searchParams;\n}\n\nexport type QueryDict = Record<string, string[] | string | number | boolean | undefined>;\n\n/**\n * Replace a stable parameter with the unstable naming for params\n */\nexport function replaceParam(stable: string, unstable: string, dict: QueryDict): QueryDict {\n    const result = {\n        ...dict,\n        [unstable]: dict[stable],\n    };\n    delete result[stable];\n    return result;\n}\n\n/**\n * Decode a query string in `application/x-www-form-urlencoded` format.\n * @param query - A query string to decode e.g.\n * foo=bar&via=server1&server2\n * @returns The decoded object, if any keys occurred multiple times\n * then the value will be an array of strings, else it will be an array.\n * This behaviour matches Node's qs.parse but is built on URLSearchParams\n * for native web compatibility\n */\nexport function decodeParams(query: string): Record<string, string | string[]> {\n    const o: Record<string, string | string[]> = {};\n    const params = new URLSearchParams(query);\n    for (const key of params.keys()) {\n        const val = params.getAll(key);\n        o[key] = val.length === 1 ? val[0] : val;\n    }\n    return o;\n}\n\n/**\n * Encodes a URI according to a set of template variables. Variables will be\n * passed through encodeURIComponent.\n * @param pathTemplate - The path with template variables e.g. '/foo/$bar'.\n * @param variables - The key/value pairs to replace the template\n * variables with. E.g. `{ \"$bar\": \"baz\" }`.\n * @returns The result of replacing all template variables e.g. '/foo/baz'.\n */\nexport function encodeUri(pathTemplate: string, variables: Record<string, string | null | undefined>): string {\n    for (const key in variables) {\n        if (!variables.hasOwnProperty(key)) {\n            continue;\n        }\n        const value = variables[key];\n        if (value === undefined || value === null) {\n            continue;\n        }\n        pathTemplate = pathTemplate.replace(key, encodeURIComponent(value));\n    }\n    return pathTemplate;\n}\n\n/**\n * The removeElement() method removes the first element in the array that\n * satisfies (returns true) the provided testing function.\n * @param array - The array.\n * @param fn - Function to execute on each value in the array, with the\n * function signature `fn(element, index, array)`. Return true to\n * remove this element and break.\n * @param reverse - True to search in reverse order.\n * @returns True if an element was removed.\n */\nexport function removeElement<T>(array: T[], fn: (t: T, i?: number, a?: T[]) => boolean, reverse?: boolean): boolean {\n    let i: number;\n    if (reverse) {\n        for (i = array.length - 1; i >= 0; i--) {\n            if (fn(array[i], i, array)) {\n                array.splice(i, 1);\n                return true;\n            }\n        }\n    } else {\n        for (i = 0; i < array.length; i++) {\n            if (fn(array[i], i, array)) {\n                array.splice(i, 1);\n                return true;\n            }\n        }\n    }\n    return false;\n}\n\n/**\n * Checks if the given thing is a function.\n * @param value - The thing to check.\n * @returns True if it is a function.\n */\nexport function isFunction(value: any): boolean {\n    return Object.prototype.toString.call(value) === \"[object Function]\";\n}\n\n/**\n * Checks that the given object has the specified keys.\n * @param obj - The object to check.\n * @param keys - The list of keys that 'obj' must have.\n * @throws If the object is missing keys.\n */\n// note using 'keys' here would shadow the 'keys' function defined above\nexport function checkObjectHasKeys(obj: object, keys: string[]): void {\n    for (const key of keys) {\n        if (!obj.hasOwnProperty(key)) {\n            throw new Error(\"Missing required key: \" + key);\n        }\n    }\n}\n\n/**\n * Deep copy the given object. The object MUST NOT have circular references and\n * MUST NOT have functions.\n * @param obj - The object to deep copy.\n * @returns A copy of the object without any references to the original.\n */\nexport function deepCopy<T>(obj: T): T {\n    return JSON.parse(JSON.stringify(obj));\n}\n\n/**\n * Compare two objects for equality. The objects MUST NOT have circular references.\n *\n * @param x - The first object to compare.\n * @param y - The second object to compare.\n *\n * @returns true if the two objects are equal\n */\nexport function deepCompare(x: any, y: any): boolean {\n    // Inspired by\n    // http://stackoverflow.com/questions/1068834/object-comparison-in-javascript#1144249\n\n    // Compare primitives and functions.\n    // Also check if both arguments link to the same object.\n    if (x === y) {\n        return true;\n    }\n\n    if (typeof x !== typeof y) {\n        return false;\n    }\n\n    // special-case NaN (since NaN !== NaN)\n    if (typeof x === \"number\" && isNaN(x) && isNaN(y)) {\n        return true;\n    }\n\n    // special-case null (since typeof null == 'object', but null.constructor\n    // throws)\n    if (x === null || y === null) {\n        return x === y;\n    }\n\n    // everything else is either an unequal primitive, or an object\n    // XXX: this check has been temporarily tweaked due to issues in the jest test environment,\n    // this will be reverted as part of the migration to vitest\n    if (\n        x.constructor.name !== \"Object\" &&\n        x.constructor.name !== \"RegExp\" &&\n        x.constructor.name !== \"Date\" &&\n        x.constructor.name !== \"Array\"\n    ) {\n        return false;\n    }\n\n    // check they are the same type of object\n    // XXX: this check has been temporarily tweaked due to issues in the jest test environment,\n    // this will be reverted as part of the migration to vitest\n    if (x.prototype !== y.prototype) {\n        return false;\n    }\n\n    // special-casing for some special types of object\n    if (x instanceof RegExp || x instanceof Date) {\n        return x.toString() === y.toString();\n    }\n\n    // the object algorithm works for Array, but it's sub-optimal.\n    if (Array.isArray(x)) {\n        if (x.length !== y.length) {\n            return false;\n        }\n\n        for (let i = 0; i < x.length; i++) {\n            if (!deepCompare(x[i], y[i])) {\n                return false;\n            }\n        }\n    } else {\n        // check that all of y's direct keys are in x\n        for (const p in y) {\n            if (y.hasOwnProperty(p) !== x.hasOwnProperty(p)) {\n                return false;\n            }\n        }\n\n        // finally, compare each of x's keys with y\n        for (const p in x) {\n            if (y.hasOwnProperty(p) !== x.hasOwnProperty(p) || !deepCompare(x[p], y[p])) {\n                return false;\n            }\n        }\n    }\n    return true;\n}\n\n// Dev note: This returns an array of tuples, but jsdoc doesn't like that. https://github.com/jsdoc/jsdoc/issues/1703\n/**\n * Creates an array of object properties/values (entries) then\n * sorts the result by key, recursively. The input object must\n * ensure it does not have loops. If the input is not an object\n * then it will be returned as-is.\n * @param obj - The object to get entries of\n * @returns The entries, sorted by key.\n */\nexport function deepSortedObjectEntries(obj: any): [string, any][] {\n    if (typeof obj !== \"object\") return obj;\n\n    // Apparently these are object types...\n    if (obj === null || obj === undefined || Array.isArray(obj)) return obj;\n\n    const pairs: [string, any][] = [];\n    for (const [k, v] of Object.entries(obj)) {\n        pairs.push([k, deepSortedObjectEntries(v)]);\n    }\n\n    // lexicographicCompare is faster than localeCompare, so let's use that.\n    pairs.sort((a, b) => lexicographicCompare(a[0], b[0]));\n\n    return pairs;\n}\n\n/**\n * Returns whether the given value is a finite number without type-coercion\n *\n * @param value - the value to test\n * @returns whether or not value is a finite number without type-coercion\n */\nexport function isNumber(value: any): value is number {\n    return typeof value === \"number\" && isFinite(value);\n}\n\n/**\n * Removes zero width chars, diacritics and whitespace from the string\n * Also applies an unhomoglyph on the string, to prevent similar looking chars\n * @param str - the string to remove hidden characters from\n * @returns a string with the hidden characters removed\n */\nexport function removeHiddenChars(str: string): string {\n    if (typeof str === \"string\") {\n        return unhomoglyph(str.normalize(\"NFD\").replace(removeHiddenCharsRegex, \"\"));\n    }\n    return \"\";\n}\n\n/**\n * Removes the direction override characters from a string\n * @returns string with chars removed\n */\nexport function removeDirectionOverrideChars(str: string): string {\n    if (typeof str === \"string\") {\n        return str.replace(/[\\u202d-\\u202e]/g, \"\");\n    }\n    return \"\";\n}\n\nexport function normalize(str: string): string {\n    // Note: we have to match the filter with the removeHiddenChars() because the\n    // function strips spaces and other characters (M becomes RN for example, in lowercase).\n    return (\n        removeHiddenChars(str.toLowerCase())\n            // Strip all punctuation\n            .replace(/[\\\\'!\"#$%&()*+,\\-./:;<=>?@[\\]^_`{|}~\\u2000-\\u206f\\u2e00-\\u2e7f]/g, \"\")\n            // We also doubly convert to lowercase to work around oddities of the library.\n            .toLowerCase()\n    );\n}\n\n// Regex matching bunch of unicode control characters and otherwise misleading/invisible characters.\n// Includes:\n// various width spaces U+2000 - U+200D\n// LTR and RTL marks U+200E and U+200F\n// LTR/RTL and other directional formatting marks U+202A - U+202F\n// Arabic Letter RTL mark U+061C\n// Combining characters U+0300 - U+036F\n// Zero width no-break space (BOM) U+FEFF\n// Blank/invisible characters (U2800, U2062-U2063)\n// eslint-disable-next-line no-misleading-character-class\nconst removeHiddenCharsRegex = /[\\u2000-\\u200F\\u202A-\\u202F\\u0300-\\u036F\\uFEFF\\u061C\\u2800\\u2062-\\u2063\\s]/g;\n\nexport function escapeRegExp(string: string): string {\n    return string.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\n/**\n * Converts Matrix glob-style string to a regular expression\n * https://spec.matrix.org/v1.7/appendices/#glob-style-matching\n * @param glob - Matrix glob-style string\n * @returns regular expression\n */\nexport function globToRegexp(glob: string): string {\n    return escapeRegExp(glob).replace(/\\\\\\*/g, \".*\").replace(/\\?/g, \".\");\n}\n\nexport function ensureNoTrailingSlash(url: string): string;\nexport function ensureNoTrailingSlash(url: undefined): undefined;\nexport function ensureNoTrailingSlash(url?: string): string | undefined;\nexport function ensureNoTrailingSlash(url?: string): string | undefined {\n    if (url?.endsWith(\"/\")) {\n        return url.slice(0, -1);\n    } else {\n        return url;\n    }\n}\n\n/**\n * Returns a promise which resolves with a given value after the given number of ms\n */\nexport function sleep<T>(ms: number, value?: T): Promise<T> {\n    return new Promise((resolve) => {\n        setTimeout(resolve, ms, value);\n    });\n}\n\n/**\n * Utility to log the duration of a promise.\n *\n * @param logger - The logger to log to.\n * @param name - The name of the operation.\n * @param block - The block to execute.\n */\nexport async function logDuration<T>(logger: BaseLogger, name: string, block: () => Promise<T>): Promise<T> {\n    const start = Date.now();\n    try {\n        return await block();\n    } finally {\n        const end = Date.now();\n        logger.debug(`[Perf]: ${name} took ${end - start}ms`);\n    }\n}\n\n/**\n * Utility to log the duration of a synchronous block.\n *\n * @param logger - The logger to log to.\n * @param name - The name of the operation.\n * @param block - The block to execute.\n */\nexport function logDurationSync<T>(logger: BaseLogger, name: string, block: () => T): T {\n    const start = Date.now();\n    try {\n        return block();\n    } finally {\n        const end = Date.now();\n        logger.debug(`[Perf]: ${name} took ${end - start}ms`);\n    }\n}\n\n/**\n * Promise/async version of {@link setImmediate}.\n *\n * Implementation is based on `setTimeout` for wider compatibility.\n * @deprecated Use {@link sleep} instead.\n */\nexport function immediate(): Promise<void> {\n    return new Promise((resolve) => setTimeout(resolve));\n}\n\nexport function isNullOrUndefined(val: any): boolean {\n    return val === null || val === undefined;\n}\n\nexport async function promiseMapSeries<T>(\n    promises: Array<T | Promise<T>>,\n    fn: (t: T) => Promise<unknown> | undefined, // if async we don't care about the type as we only await resolution\n): Promise<void> {\n    for (const o of promises) {\n        await fn(await o);\n    }\n}\n\nexport function promiseTry<T>(fn: () => T | Promise<T>): Promise<T> {\n    return Promise.resolve(fn());\n}\n\n// Creates and awaits all promises, running no more than `chunkSize` at the same time\nexport async function chunkPromises<T>(fns: (() => Promise<T>)[], chunkSize: number): Promise<T[]> {\n    const results: T[] = [];\n    for (let i = 0; i < fns.length; i += chunkSize) {\n        results.push(...(await Promise.all(fns.slice(i, i + chunkSize).map((fn) => fn()))));\n    }\n    return results;\n}\n\n/**\n * Retries the function until it succeeds or is interrupted. The given function must return\n * a promise which throws/rejects on error, otherwise the retry will assume the request\n * succeeded. The promise chain returned will contain the successful promise. The given function\n * should always return a new promise.\n * @param promiseFn - The function to call to get a fresh promise instance. Takes an\n * attempt count as an argument, for logging/debugging purposes.\n * @param shouldRetry - Optional function which is called with the error the latest rejection from promiseFn,\n * retrying will ba aborted if this return false.\n * @returns The promise for the retried operation.\n */\nexport function simpleRetryOperation<T>(\n    promiseFn: (attempt: number) => Promise<T>,\n    shouldRetry?: (e: unknown) => boolean,\n): Promise<T> {\n    return promiseRetry(\n        (attempt: number) => {\n            return promiseFn(attempt);\n        },\n        {\n            retries: Infinity,\n            shouldRetry: shouldRetry ? ({ error }): boolean => shouldRetry(error) : undefined,\n            factor: 2,\n            minTimeout: 3000, // ms\n            maxTimeout: 15000, // ms\n        },\n    );\n}\n\n// String averaging inspired by https://stackoverflow.com/a/2510816\n// Dev note: We make the alphabet a string because it's easier to write syntactically\n// than arrays. Thankfully, strings implement the useful parts of the Array interface\n// anyhow.\n\n/**\n * The default alphabet used by string averaging in this SDK. This matches\n * all usefully printable ASCII characters (0x20-0x7E, inclusive).\n */\nexport const DEFAULT_ALPHABET = ((): string => {\n    let str = \"\";\n    for (let c = 0x20; c <= 0x7e; c++) {\n        str += String.fromCharCode(c);\n    }\n    return str;\n})();\n\n/**\n * Pads a string using the given alphabet as a base. The returned string will be\n * padded at the end with the first character in the alphabet.\n *\n * This is intended for use with string averaging.\n * @param s - The string to pad.\n * @param n - The length to pad to.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The padded string.\n */\nexport function alphabetPad(s: string, n: number, alphabet = DEFAULT_ALPHABET): string {\n    return s.padEnd(n, alphabet[0]);\n}\n\n/**\n * Converts a baseN number to a string, where N is the alphabet's length.\n *\n * This is intended for use with string averaging.\n * @param n - The baseN number.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The baseN number encoded as a string from the alphabet.\n */\nexport function baseToString(n: bigint, alphabet = DEFAULT_ALPHABET): string {\n    // Developer note: the stringToBase() function offsets the character set by 1 so that repeated\n    // characters (ie: \"aaaaaa\" in a..z) don't come out as zero. We have to reverse this here as\n    // otherwise we'll be wrong in our conversion. Undoing a +1 before an exponent isn't very fun\n    // though, so we rely on a lengthy amount of `x - 1` and integer division rules to reach a\n    // sane state. This also means we have to do rollover detection: see below.\n\n    const len = BigInt(alphabet.length);\n    if (n <= len) {\n        return alphabet[Number(n) - 1] ?? \"\";\n    }\n\n    let d = n / len;\n    let r = Number(n % len) - 1;\n\n    // Rollover detection: if the remainder is negative, it means that the string needs\n    // to roll over by 1 character downwards (ie: in a..z, the previous to \"aaa\" would be\n    // \"zz\").\n    if (r < 0) {\n        d -= BigInt(Math.abs(r)); // abs() is just to be clear what we're doing. Could also `+= r`.\n        r = Number(len) - 1;\n    }\n\n    return baseToString(d, alphabet) + alphabet[r];\n}\n\n/**\n * Converts a string to a baseN number, where N is the alphabet's length.\n *\n * This is intended for use with string averaging.\n * @param s - The string to convert to a number.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The baseN number.\n */\nexport function stringToBase(s: string, alphabet = DEFAULT_ALPHABET): bigint {\n    const len = BigInt(alphabet.length);\n\n    // In our conversion to baseN we do a couple performance optimizations to avoid using\n    // excess CPU and such. To create baseN numbers, the input string needs to be reversed\n    // so the exponents stack up appropriately, as the last character in the unreversed\n    // string has less impact than the first character (in \"abc\" the A is a lot more important\n    // for lexicographic sorts). We also do a trick with the character codes to optimize the\n    // alphabet lookup, avoiding an index scan of `alphabet.indexOf(reversedStr[i])` - we know\n    // that the alphabet and (theoretically) the input string are constrained on character sets\n    // and thus can do simple subtraction to end up with the same result.\n\n    // Developer caution: we carefully cast to BigInt here to avoid losing precision. We cannot\n    // rely on Math.pow() (for example) to be capable of handling our insane numbers.\n\n    let result = BigInt(0);\n    for (let i = s.length - 1, j = BigInt(0); i >= 0; i--, j++) {\n        const charIndex = s.charCodeAt(i) - alphabet.charCodeAt(0);\n\n        // We add 1 to the char index to offset the whole numbering scheme. We unpack this in\n        // the baseToString() function.\n        result += BigInt(1 + charIndex) * len ** j;\n    }\n    return result;\n}\n\n/**\n * Averages two strings, returning the midpoint between them. This is accomplished by\n * converting both to baseN numbers (where N is the alphabet's length) then averaging\n * those before re-encoding as a string.\n * @param a - The first string.\n * @param b - The second string.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The midpoint between the strings, as a string.\n */\nexport function averageBetweenStrings(a: string, b: string, alphabet = DEFAULT_ALPHABET): string {\n    const padN = Math.max(a.length, b.length);\n    const baseA = stringToBase(alphabetPad(a, padN, alphabet), alphabet);\n    const baseB = stringToBase(alphabetPad(b, padN, alphabet), alphabet);\n    const avg = (baseA + baseB) / BigInt(2);\n\n    // Detect integer division conflicts. This happens when two numbers are divided too close so\n    // we lose a .5 precision. We need to add a padding character in these cases.\n    if (avg === baseA || avg == baseB) {\n        return baseToString(avg, alphabet) + alphabet[0];\n    }\n\n    return baseToString(avg, alphabet);\n}\n\n/**\n * Finds the next string using the alphabet provided. This is done by converting the\n * string to a baseN number, where N is the alphabet's length, then adding 1 before\n * converting back to a string.\n * @param s - The string to start at.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The string which follows the input string.\n */\nexport function nextString(s: string, alphabet = DEFAULT_ALPHABET): string {\n    return baseToString(stringToBase(s, alphabet) + BigInt(1), alphabet);\n}\n\n/**\n * Finds the previous string using the alphabet provided. This is done by converting the\n * string to a baseN number, where N is the alphabet's length, then subtracting 1 before\n * converting back to a string.\n * @param s - The string to start at.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The string which precedes the input string.\n */\nexport function prevString(s: string, alphabet = DEFAULT_ALPHABET): string {\n    return baseToString(stringToBase(s, alphabet) - BigInt(1), alphabet);\n}\n\n/**\n * Compares strings lexicographically as a sort-safe function.\n * @param a - The first (reference) string.\n * @param b - The second (compare) string.\n * @returns Negative if the reference string is before the compare string;\n * positive if the reference string is after; and zero if equal.\n */\nexport function lexicographicCompare(a: string, b: string): number {\n    // Dev note: this exists because I'm sad that you can use math operators on strings, so I've\n    // hidden the operation in this function.\n    if (a < b) {\n        return -1;\n    } else if (a > b) {\n        return 1;\n    } else {\n        return 0;\n    }\n}\n\n/**\n * This function is similar to Object.assign() but it assigns recursively and\n * allows you to ignore nullish values from the source\n *\n * @returns the target object\n */\nexport function recursivelyAssign<T1 extends T2, T2 extends Record<string, any>>(\n    target: T1,\n    source: T2,\n    ignoreNullish = false,\n): T1 & T2 {\n    for (const [sourceKey, sourceValue] of Object.entries(source)) {\n        if (target[sourceKey] instanceof Object && sourceValue) {\n            recursivelyAssign(target[sourceKey], sourceValue);\n            continue;\n        }\n        if ((sourceValue !== null && sourceValue !== undefined) || !ignoreNullish) {\n            safeSet(target, sourceKey, sourceValue);\n            continue;\n        }\n    }\n    return target as T1 & T2;\n}\n\nfunction getContentTimestampWithFallback(event: MatrixEvent): number {\n    return M_TIMESTAMP.findIn<number>(event.getContent()) ?? -1;\n}\n\n/**\n * Sort events by their content m.ts property\n * Latest timestamp first\n */\nexport function sortEventsByLatestContentTimestamp(left: MatrixEvent, right: MatrixEvent): number {\n    return getContentTimestampWithFallback(right) - getContentTimestampWithFallback(left);\n}\n\nexport function isSupportedReceiptType(receiptType: string): boolean {\n    return [ReceiptType.Read, ReceiptType.ReadPrivate].includes(receiptType as ReceiptType);\n}\n\n/**\n * Determines whether two maps are equal.\n * @param eq - The equivalence relation to compare values by. Defaults to strict equality.\n */\nexport function mapsEqual<K, V>(x: Map<K, V>, y: Map<K, V>, eq = (v1: V, v2: V): boolean => v1 === v2): boolean {\n    if (x.size !== y.size) return false;\n    for (const [k, v1] of x) {\n        const v2 = y.get(k);\n        if (v2 === undefined || !eq(v1, v2)) return false;\n    }\n    return true;\n}\n\nfunction processMapToObjectValue(value: any): any {\n    if (value instanceof Map) {\n        // Value is a Map. Recursively map it to an object.\n        return recursiveMapToObject(value);\n    } else if (Array.isArray(value)) {\n        // Value is an Array. Recursively map the value (e.g. to cover Array of Arrays).\n        return value.map((v) => processMapToObjectValue(v));\n    } else {\n        return value;\n    }\n}\n\n/**\n * Recursively converts Maps to plain objects.\n * Also supports sub-lists of Maps.\n */\nexport function recursiveMapToObject(map: Map<any, any>): Record<any, any> {\n    const targetMap = new Map();\n\n    for (const [key, value] of map) {\n        targetMap.set(key, processMapToObjectValue(value));\n    }\n\n    return Object.fromEntries(targetMap.entries());\n}\n\nexport function unsafeProp<K extends keyof any | undefined>(prop: K): boolean {\n    return prop === \"__proto__\" || prop === \"prototype\" || prop === \"constructor\";\n}\n\nexport function safeSet<O extends Record<any, any>, K extends keyof O>(obj: O, prop: K, value: O[K]): void {\n    if (unsafeProp(prop)) {\n        throw new Error(\"Trying to modify prototype or constructor\");\n    }\n\n    obj[prop] = value;\n}\n\nexport function noUnsafeEventProps(event: Partial<IEvent>): boolean {\n    return !(unsafeProp(event.room_id) || unsafeProp(event.sender) || unsafeProp(event.event_id));\n}\n\nexport class MapWithDefault<K, V> extends Map<K, V> {\n    public constructor(private createDefault: () => V) {\n        super();\n    }\n\n    /**\n     * Returns the value if the key already exists.\n     * If not, it creates a new value under that key using the ctor callback and returns it.\n     */\n    public getOrCreate(key: K): V {\n        if (!this.has(key)) {\n            this.set(key, this.createDefault());\n        }\n\n        return this.get(key)!;\n    }\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,OAAO,WAAW,MAAM,aAAa;AACrC,OAAO,YAAY,MAAM,SAAS;AAGlC,SAAS,WAAW,QAAQ,sBAAsB;AAClD,SAAS,WAAW,QAAQ,2BAA2B;AAGvD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAiB,CAAC;;AAEzC;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,iBAAiB,CAAC,GAAW,EAAU;EACnD;EACA;EACA,IAAK,GAAG,YAAwB,MAAM,EAAE;IACpC,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;EACxB;;EAEA;EACA,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;IACnB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC;EACzB;;EAEA;EACA,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;AAC3B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,MAAiB,EAAE,eAAiC,EAAmB;EAChG,MAAM,YAAY,GAAG,eAAe,IAAI,IAAI,eAAe,CAAC,CAAC;EAC7D,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;IAC7C,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI,EAAE;MACnC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QACpB,GAAG,CAAC,OAAO,CAAE,CAAC,IAAK;UACf,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC;MACN,CAAC,MAAM;QACH,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;MACzC;IACJ;EACJ;EACA,OAAO,YAAY;AACvB;AAIA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,MAAc,EAAE,QAAgB,EAAE,IAAe,EAAa;EACvF,MAAM,MAAM,mCACL,IAAI;IACP,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM;EAAC,EAC3B;EACD,OAAO,MAAM,CAAC,MAAM,CAAC;EACrB,OAAO,MAAM;AACjB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,KAAa,EAAqC;EAC3E,MAAM,CAAoC,GAAG,CAAC,CAAC;EAC/C,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC,KAAK,CAAC;EACzC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE;IAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC;IAC9B,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG;EAC5C;EACA,OAAO,CAAC;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,SAAS,CAAC,YAAoB,EAAE,SAAoD,EAAU;EAC1G,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE;IACzB,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;MAChC;IACJ;IACA,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC;IAC5B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;MACvC;IACJ;IACA,YAAY,GAAG,YAAY,CAAC,OAAO,CAAC,GAAG,EAAE,kBAAkB,CAAC,KAAK,CAAC,CAAC;EACvE;EACA,OAAO,YAAY;AACvB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,aAAa,CAAI,KAAU,EAAE,EAA0C,EAAE,OAAiB,EAAW;EACjH,IAAI,CAAS;EACb,IAAI,OAAO,EAAE;IACT,KAAK,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;MACpC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE;QACxB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,OAAO,IAAI;MACf;IACJ;EACJ,CAAC,MAAM;IACH,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;MAC/B,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE;QACxB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,OAAO,IAAI;MACf;IACJ;EACJ;EACA,OAAO,KAAK;AAChB;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,UAAU,CAAC,KAAU,EAAW;EAC5C,OAAO,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,mBAAmB;AACxE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,kBAAkB,CAAC,GAAW,EAAE,IAAc,EAAQ;EAClE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;IACpB,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;MAC1B,MAAM,IAAI,KAAK,CAAC,wBAAwB,GAAG,GAAG,CAAC;IACnD;EACJ;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,QAAQ,CAAI,GAAM,EAAK;EACnC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,WAAW,CAAC,CAAM,EAAE,CAAM,EAAW;EACjD;EACA;;EAEA;EACA;EACA,IAAI,CAAC,KAAK,CAAC,EAAE;IACT,OAAO,IAAI;EACf;EAEA,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,EAAE;IACvB,OAAO,KAAK;EAChB;;EAEA;EACA,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE;IAC/C,OAAO,IAAI;EACf;;EAEA;EACA;EACA,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE;IAC1B,OAAO,CAAC,KAAK,CAAC;EAClB;;EAEA;EACA;EACA;EACA,IACI,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,QAAQ,IAC/B,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,QAAQ,IAC/B,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,MAAM,IAC7B,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,OAAO,EAChC;IACE,OAAO,KAAK;EAChB;;EAEA;EACA;EACA;EACA,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,EAAE;IAC7B,OAAO,KAAK;EAChB;;EAEA;EACA,IAAI,CAAC,YAAY,MAAM,IAAI,CAAC,YAAY,IAAI,EAAE;IAC1C,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;EACxC;;EAEA;EACA,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE;MACvB,OAAO,KAAK;IAChB;IAEA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;MAC/B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;QAC1B,OAAO,KAAK;MAChB;IACJ;EACJ,CAAC,MAAM;IACH;IACA,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE;MACf,IAAI,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE;QAC7C,OAAO,KAAK;MAChB;IACJ;;IAEA;IACA,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE;MACf,IAAI,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;QACzE,OAAO,KAAK;MAChB;IACJ;EACJ;EACA,OAAO,IAAI;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,uBAAuB,CAAC,GAAQ,EAAmB;EAC/D,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,OAAO,GAAG;;EAEvC;EACA,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,OAAO,GAAG;EAEvE,MAAM,KAAsB,GAAG,EAAE;EACjC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;IACtC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC;EAC/C;;EAEA;EACA,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;EAEtD,OAAO,KAAK;AAChB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,QAAQ,CAAC,KAAU,EAAmB;EAClD,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,QAAQ,CAAC,KAAK,CAAC;AACvD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,iBAAiB,CAAC,GAAW,EAAU;EACnD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;IACzB,OAAO,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC;EAChF;EACA,OAAO,EAAE;AACb;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAAS,4BAA4B,CAAC,GAAW,EAAU;EAC9D,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;IACzB,OAAO,GAAG,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;EAC9C;EACA,OAAO,EAAE;AACb;AAEA,OAAO,SAAS,SAAS,CAAC,GAAW,EAAU;EAC3C;EACA;EACA,OACI,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;EAC/B;EAAA,CACC,OAAO,CAAC,kEAAkE,EAAE,EAAE;EAC/E;EAAA,CACC,WAAW,CAAC,CAAC;AAE1B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,sBAAsB,GAAG,6EAA6E;AAE5G,OAAO,SAAS,YAAY,CAAC,MAAc,EAAU;EACjD,OAAO,MAAM,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC;AACxD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,IAAY,EAAU;EAC/C,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC;AACxE;AAKA,OAAO,SAAS,qBAAqB,CAAC,GAAY,EAAsB;EACpE,IAAI,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE;IACpB,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;EAC3B,CAAC,MAAM;IACH,OAAO,GAAG;EACd;AACJ;;AAEA;AACA;AACA;AACA,OAAO,SAAS,KAAK,CAAI,EAAU,EAAE,KAAS,EAAc;EACxD,OAAO,IAAI,OAAO,CAAE,OAAO,IAAK;IAC5B,UAAU,CAAC,OAAO,EAAE,EAAE,EAAE,KAAK,CAAC;EAClC,CAAC,CAAC;AACN;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,WAAW,CAAI,MAAkB,EAAE,IAAY,EAAE,KAAuB,EAAc;EACxG,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;EACxB,IAAI;IACA,OAAO,MAAM,KAAK,CAAC,CAAC;EACxB,CAAC,SAAS;IACN,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,CAAC,KAAK,CAAC,WAAW,IAAI,SAAS,GAAG,GAAG,KAAK,IAAI,CAAC;EACzD;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,eAAe,CAAI,MAAkB,EAAE,IAAY,EAAE,KAAc,EAAK;EACpF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;EACxB,IAAI;IACA,OAAO,KAAK,CAAC,CAAC;EAClB,CAAC,SAAS;IACN,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,CAAC,KAAK,CAAC,WAAW,IAAI,SAAS,GAAG,GAAG,KAAK,IAAI,CAAC;EACzD;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,SAAS,GAAkB;EACvC,OAAO,IAAI,OAAO,CAAE,OAAO,IAAK,UAAU,CAAC,OAAO,CAAC,CAAC;AACxD;AAEA,OAAO,SAAS,iBAAiB,CAAC,GAAQ,EAAW;EACjD,OAAO,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS;AAC5C;AAEA,OAAO,eAAe,gBAAgB,CAClC,QAA+B,EAC/B,EAA0C,CAAE;AAAA,EAC/B;EACb,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;IACtB,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC;EACrB;AACJ;AAEA,OAAO,SAAS,UAAU,CAAI,EAAwB,EAAc;EAChE,OAAO,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;AAChC;;AAEA;AACA,OAAO,eAAe,aAAa,CAAI,GAAyB,EAAE,SAAiB,EAAgB;EAC/F,MAAM,OAAY,GAAG,EAAE;EACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE;IAC5C,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAE,EAAE,IAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;EACvF;EACA,OAAO,OAAO;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,oBAAoB,CAChC,SAA0C,EAC1C,WAAqC,EAC3B;EACV,OAAO,YAAY,CACd,OAAe,IAAK;IACjB,OAAO,SAAS,CAAC,OAAO,CAAC;EAC7B,CAAC,EACD;IACI,OAAO,EAAE,QAAQ;IACjB,WAAW,EAAE,WAAW,GAAG,CAAC;MAAE;IAAM,CAAC,KAAc,WAAW,CAAC,KAAK,CAAC,GAAG,SAAS;IACjF,MAAM,EAAE,CAAC;IACT,UAAU,EAAE,IAAI;IAAE;IAClB,UAAU,EAAE,KAAK,CAAE;EACvB,CACJ,CAAC;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO,MAAM,gBAAgB,GAAG,CAAC,MAAc;EAC3C,IAAI,GAAG,GAAG,EAAE;EACZ,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE;IAC/B,GAAG,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;EACjC;EACA,OAAO,GAAG;AACd,CAAC,EAAE,CAAC;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACnF,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;AACnC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACzE;EACA;EACA;EACA;EACA;;EAEA,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;EACnC,IAAI,CAAC,IAAI,GAAG,EAAE;IACV,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE;EACxC;EAEA,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG;EACf,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC;;EAE3B;EACA;EACA;EACA,IAAI,CAAC,GAAG,CAAC,EAAE;IACP,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;EACvB;EAEA,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AAClD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACzE,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;;EAEnC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA;EACA;;EAEA,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;EACtB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;IACxD,MAAM,SAAS,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;;IAE1D;IACA;IACA,MAAM,IAAI,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,GAAG,IAAI,CAAC;EAC9C;EACA,OAAO,MAAM;AACjB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,qBAAqB,CAAC,CAAS,EAAE,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EAC7F,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;EACzC,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;EACpE,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;EACpE,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;;EAEvC;EACA;EACA,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,IAAI,KAAK,EAAE;IAC/B,OAAO,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;EACpD;EAEA,OAAO,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC;AACtC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,UAAU,CAAC,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACvE,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC;AACxE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,UAAU,CAAC,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACvE,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC;AACxE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,oBAAoB,CAAC,CAAS,EAAE,CAAS,EAAU;EAC/D;EACA;EACA,IAAI,CAAC,GAAG,CAAC,EAAE;IACP,OAAO,CAAC,CAAC;EACb,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,EAAE;IACd,OAAO,CAAC;EACZ,CAAC,MAAM;IACH,OAAO,CAAC;EACZ;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,iBAAiB,CAC7B,MAAU,EACV,MAAU,EACV,aAAa,GAAG,KAAK,EACd;EACP,KAAK,MAAM,CAAC,SAAS,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;IAC3D,IAAI,MAAM,CAAC,SAAS,CAAC,YAAY,MAAM,IAAI,WAAW,EAAE;MACpD,iBAAiB,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,WAAW,CAAC;MACjD;IACJ;IACA,IAAK,WAAW,KAAK,IAAI,IAAI,WAAW,KAAK,SAAS,IAAK,CAAC,aAAa,EAAE;MACvE,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,WAAW,CAAC;MACvC;IACJ;EACJ;EACA,OAAO,MAAM;AACjB;AAEA,SAAS,+BAA+B,CAAC,KAAkB,EAAU;EACjE,OAAO,WAAW,CAAC,MAAM,CAAS,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC/D;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAAS,kCAAkC,CAAC,IAAiB,EAAE,KAAkB,EAAU;EAC9F,OAAO,+BAA+B,CAAC,KAAK,CAAC,GAAG,+BAA+B,CAAC,IAAI,CAAC;AACzF;AAEA,OAAO,SAAS,sBAAsB,CAAC,WAAmB,EAAW;EACjE,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,WAA0B,CAAC;AAC3F;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAAS,SAAS,CAAO,CAAY,EAAE,CAAY,EAAE,EAAE,GAAG,CAAC,EAAK,EAAE,EAAK,KAAc,EAAE,KAAK,EAAE,EAAW;EAC5G,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,OAAO,KAAK;EACnC,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE;IACrB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,KAAK;EACrD;EACA,OAAO,IAAI;AACf;AAEA,SAAS,uBAAuB,CAAC,KAAU,EAAO;EAC9C,IAAI,KAAK,YAAY,GAAG,EAAE;IACtB;IACA,OAAO,oBAAoB,CAAC,KAAK,CAAC;EACtC,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;IAC7B;IACA,OAAO,KAAK,CAAC,GAAG,CAAE,CAAC,IAAK,uBAAuB,CAAC,CAAC,CAAC,CAAC;EACvD,CAAC,MAAM;IACH,OAAO,KAAK;EAChB;AACJ;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAAS,oBAAoB,CAAC,GAAkB,EAAoB;EACvE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC;EAE3B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,GAAG,EAAE;IAC5B,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,uBAAuB,CAAC,KAAK,CAAC,CAAC;EACtD;EAEA,OAAO,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;AAClD;AAEA,OAAO,SAAS,UAAU,CAAkC,IAAO,EAAW;EAC1E,OAAO,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,aAAa;AACjF;AAEA,OAAO,SAAS,OAAO,CAAgD,GAAM,EAAE,IAAO,EAAE,KAAW,EAAQ;EACvG,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE;IAClB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC;EAChE;EAEA,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK;AACrB;AAEA,OAAO,SAAS,kBAAkB,CAAC,KAAsB,EAAW;EAChE,OAAO,EAAE,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;AACjG;AAEA,OAAO,MAAM,cAAc,SAAe,GAAG,CAAO;EACzC,WAAW,CAAS,aAAsB,EAAE;IAC/C,KAAK,CAAC,CAAC;IAAC,KADe,aAAsB,GAAtB,aAAsB;EAEjD;;EAEA;AACJ;AACA;AACA;EACW,WAAW,CAAC,GAAM,EAAK;IAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;MAChB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACvC;IAEA,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;EACxB;AACJ","ignoreList":[]}
+{"version":3,"file":"utils.js","names":[],"sources":["../src/utils.ts"],"sourcesContent":["/*\nCopyright 2015, 2016, 2019, 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/**\n * This is an internal module.\n */\n\nimport unhomoglyph from \"unhomoglyph\";\nimport promiseRetry from \"p-retry\";\n\nimport { type IEvent, type MatrixEvent } from \"./models/event.ts\";\nimport { M_TIMESTAMP } from \"./@types/location.ts\";\nimport { ReceiptType } from \"./@types/read_receipts.ts\";\nimport { type BaseLogger } from \"./logger.ts\";\n\nconst interns = new Map<string, string>();\n\n/**\n * Internalises a string, reusing a known pointer or storing the pointer\n * if needed for future strings.\n * @param str - The string to internalise.\n * @returns The internalised string.\n */\nexport function internaliseString(str: string): string {\n    // Unwrap strings before entering the map, if we somehow got a wrapped\n    // string as our input. This should only happen from tests.\n    // oxlint-disable-next-line unicorn/no-instanceof-builtins\n    if ((str as unknown) instanceof String) {\n        str = str.toString();\n    }\n\n    // Check the map to see if we can store the value\n    if (!interns.has(str)) {\n        interns.set(str, str);\n    }\n\n    // Return any cached string reference\n    return interns.get(str)!;\n}\n\n/**\n * Encode a dictionary of query parameters.\n * Omits any undefined/null values.\n * @param params - A dict of key/values to encode e.g.\n * `{\"foo\": \"bar\", \"baz\": \"taz\"}`\n * @returns The encoded string e.g. foo=bar&baz=taz\n */\nexport function encodeParams(params: QueryDict, urlSearchParams?: URLSearchParams): URLSearchParams {\n    const searchParams = urlSearchParams ?? new URLSearchParams();\n    for (const [key, val] of Object.entries(params)) {\n        if (val !== undefined && val !== null) {\n            if (Array.isArray(val)) {\n                val.forEach((v) => {\n                    searchParams.append(key, String(v));\n                });\n            } else {\n                searchParams.append(key, String(val));\n            }\n        }\n    }\n    return searchParams;\n}\n\nexport type QueryDict = Record<string, string[] | string | number | boolean | undefined>;\n\n/**\n * Replace a stable parameter with the unstable naming for params\n */\nexport function replaceParam(stable: string, unstable: string, dict: QueryDict): QueryDict {\n    const result = {\n        ...dict,\n        [unstable]: dict[stable],\n    };\n    delete result[stable];\n    return result;\n}\n\n/**\n * Decode a query string in `application/x-www-form-urlencoded` format.\n * @param query - A query string to decode e.g.\n * foo=bar&via=server1&server2\n * @returns The decoded object, if any keys occurred multiple times\n * then the value will be an array of strings, else it will be an array.\n * This behaviour matches Node's qs.parse but is built on URLSearchParams\n * for native web compatibility\n */\nexport function decodeParams(query: string): Record<string, string | string[]> {\n    const o: Record<string, string | string[]> = {};\n    const params = new URLSearchParams(query);\n    for (const key of params.keys()) {\n        const val = params.getAll(key);\n        o[key] = val.length === 1 ? val[0] : val;\n    }\n    return o;\n}\n\n/**\n * Encodes a URI according to a set of template variables. Variables will be\n * passed through encodeURIComponent.\n * @param pathTemplate - The path with template variables e.g. '/foo/$bar'.\n * @param variables - The key/value pairs to replace the template\n * variables with. E.g. `{ \"$bar\": \"baz\" }`.\n * @returns The result of replacing all template variables e.g. '/foo/baz'.\n */\nexport function encodeUri(pathTemplate: string, variables: Record<string, string | null | undefined>): string {\n    for (const key in variables) {\n        if (!variables.hasOwnProperty(key)) {\n            continue;\n        }\n        const value = variables[key];\n        if (value === undefined || value === null) {\n            continue;\n        }\n        pathTemplate = pathTemplate.replace(key, encodeURIComponent(value));\n    }\n    return pathTemplate;\n}\n\n/**\n * The removeElement() method removes the first element in the array that\n * satisfies (returns true) the provided testing function.\n * @param array - The array.\n * @param fn - Function to execute on each value in the array, with the\n * function signature `fn(element, index, array)`. Return true to\n * remove this element and break.\n * @param reverse - True to search in reverse order.\n * @returns True if an element was removed.\n */\nexport function removeElement<T>(array: T[], fn: (t: T, i?: number, a?: T[]) => boolean, reverse?: boolean): boolean {\n    let i: number;\n    if (reverse) {\n        for (i = array.length - 1; i >= 0; i--) {\n            if (fn(array[i], i, array)) {\n                array.splice(i, 1);\n                return true;\n            }\n        }\n    } else {\n        for (i = 0; i < array.length; i++) {\n            if (fn(array[i], i, array)) {\n                array.splice(i, 1);\n                return true;\n            }\n        }\n    }\n    return false;\n}\n\n/**\n * Checks if the given thing is a function.\n * @param value - The thing to check.\n * @returns True if it is a function.\n */\nexport function isFunction(value: any): boolean {\n    return Object.prototype.toString.call(value) === \"[object Function]\";\n}\n\n/**\n * Checks that the given object has the specified keys.\n * @param obj - The object to check.\n * @param keys - The list of keys that 'obj' must have.\n * @throws If the object is missing keys.\n */\n// note using 'keys' here would shadow the 'keys' function defined above\nexport function checkObjectHasKeys(obj: object, keys: string[]): void {\n    for (const key of keys) {\n        if (!obj.hasOwnProperty(key)) {\n            throw new Error(\"Missing required key: \" + key);\n        }\n    }\n}\n\n/**\n * Deep copy the given object. The object MUST NOT have circular references and\n * MUST NOT have functions.\n * @param obj - The object to deep copy.\n * @returns A copy of the object without any references to the original.\n */\nexport function deepCopy<T>(obj: T): T {\n    return JSON.parse(JSON.stringify(obj));\n}\n\n/**\n * Compare two objects for equality. The objects MUST NOT have circular references.\n *\n * @param x - The first object to compare.\n * @param y - The second object to compare.\n *\n * @returns true if the two objects are equal\n */\nexport function deepCompare(x: any, y: any): boolean {\n    // Inspired by\n    // http://stackoverflow.com/questions/1068834/object-comparison-in-javascript#1144249\n\n    // Compare primitives and functions.\n    // Also check if both arguments link to the same object.\n    if (x === y) {\n        return true;\n    }\n\n    if (typeof x !== typeof y) {\n        return false;\n    }\n\n    // special-case NaN (since NaN !== NaN)\n    if (typeof x === \"number\" && isNaN(x) && isNaN(y)) {\n        return true;\n    }\n\n    // special-case null (since typeof null == 'object', but null.constructor\n    // throws)\n    if (x === null || y === null) {\n        return x === y;\n    }\n\n    // everything else is either an unequal primitive, or an object\n    // XXX: this check has been temporarily tweaked due to issues in the jest test environment,\n    // this will be reverted as part of the migration to vitest\n    if (\n        x.constructor.name !== \"Object\" &&\n        x.constructor.name !== \"RegExp\" &&\n        x.constructor.name !== \"Date\" &&\n        x.constructor.name !== \"Array\"\n    ) {\n        return false;\n    }\n\n    // check they are the same type of object\n    // XXX: this check has been temporarily tweaked due to issues in the jest test environment,\n    // this will be reverted as part of the migration to vitest\n    if (x.prototype !== y.prototype) {\n        return false;\n    }\n\n    // special-casing for some special types of object\n    if (x instanceof RegExp || x instanceof Date) {\n        return x.toString() === y.toString();\n    }\n\n    // the object algorithm works for Array, but it's sub-optimal.\n    if (Array.isArray(x)) {\n        if (x.length !== y.length) {\n            return false;\n        }\n\n        for (let i = 0; i < x.length; i++) {\n            if (!deepCompare(x[i], y[i])) {\n                return false;\n            }\n        }\n    } else {\n        // check that all of y's direct keys are in x\n        for (const p in y) {\n            if (y.hasOwnProperty(p) !== x.hasOwnProperty(p)) {\n                return false;\n            }\n        }\n\n        // finally, compare each of x's keys with y\n        for (const p in x) {\n            if (y.hasOwnProperty(p) !== x.hasOwnProperty(p) || !deepCompare(x[p], y[p])) {\n                return false;\n            }\n        }\n    }\n    return true;\n}\n\n// Dev note: This returns an array of tuples, but jsdoc doesn't like that. https://github.com/jsdoc/jsdoc/issues/1703\n/**\n * Creates an array of object properties/values (entries) then\n * sorts the result by key, recursively. The input object must\n * ensure it does not have loops. If the input is not an object\n * then it will be returned as-is.\n * @param obj - The object to get entries of\n * @returns The entries, sorted by key.\n */\nexport function deepSortedObjectEntries(obj: any): [string, any][] {\n    if (typeof obj !== \"object\") return obj;\n\n    // Apparently these are object types...\n    if (obj === null || obj === undefined || Array.isArray(obj)) return obj;\n\n    const pairs: [string, any][] = [];\n    for (const [k, v] of Object.entries(obj)) {\n        pairs.push([k, deepSortedObjectEntries(v)]);\n    }\n\n    // lexicographicCompare is faster than localeCompare, so let's use that.\n    pairs.sort((a, b) => lexicographicCompare(a[0], b[0]));\n\n    return pairs;\n}\n\n/**\n * Returns whether the given value is a finite number without type-coercion\n *\n * @param value - the value to test\n * @returns whether or not value is a finite number without type-coercion\n */\nexport function isNumber(value: any): value is number {\n    return typeof value === \"number\" && isFinite(value);\n}\n\n/**\n * Removes zero width chars, diacritics and whitespace from the string\n * Also applies an unhomoglyph on the string, to prevent similar looking chars\n * @param str - the string to remove hidden characters from\n * @returns a string with the hidden characters removed\n */\nexport function removeHiddenChars(str: string): string {\n    if (typeof str === \"string\") {\n        return unhomoglyph(str.normalize(\"NFD\").replace(removeHiddenCharsRegex, \"\"));\n    }\n    return \"\";\n}\n\n/**\n * Removes the direction override characters from a string\n * @returns string with chars removed\n */\nexport function removeDirectionOverrideChars(str: string): string {\n    if (typeof str === \"string\") {\n        return str.replace(/[\\u202d-\\u202e]/g, \"\");\n    }\n    return \"\";\n}\n\nexport function normalize(str: string): string {\n    // Note: we have to match the filter with the removeHiddenChars() because the\n    // function strips spaces and other characters (M becomes RN for example, in lowercase).\n    return (\n        removeHiddenChars(str.toLowerCase())\n            // Strip all punctuation\n            .replace(/[\\\\'!\"#$%&()*+,\\-./:;<=>?@[\\]^_`{|}~\\u2000-\\u206f\\u2e00-\\u2e7f]/g, \"\")\n            // We also doubly convert to lowercase to work around oddities of the library.\n            .toLowerCase()\n    );\n}\n\n// Regex matching bunch of unicode control characters and otherwise misleading/invisible characters.\n// Includes:\n// various width spaces U+2000 - U+200D\n// LTR and RTL marks U+200E and U+200F\n// LTR/RTL and other directional formatting marks U+202A - U+202F\n// Arabic Letter RTL mark U+061C\n// Combining characters U+0300 - U+036F\n// Zero width no-break space (BOM) U+FEFF\n// Blank/invisible characters (U2800, U2062-U2063)\n// eslint-disable-next-line no-misleading-character-class\nconst removeHiddenCharsRegex = /[\\u2000-\\u200F\\u202A-\\u202F\\u0300-\\u036F\\uFEFF\\u061C\\u2800\\u2062-\\u2063\\s]/g;\n\nexport function escapeRegExp(string: string): string {\n    return string.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\n/**\n * Converts Matrix glob-style string to a regular expression\n * https://spec.matrix.org/v1.7/appendices/#glob-style-matching\n * @param glob - Matrix glob-style string\n * @returns regular expression\n */\nexport function globToRegexp(glob: string): string {\n    return escapeRegExp(glob).replace(/\\\\\\*/g, \".*\").replace(/\\?/g, \".\");\n}\n\nexport function ensureNoTrailingSlash(url: string): string;\nexport function ensureNoTrailingSlash(url: undefined): undefined;\nexport function ensureNoTrailingSlash(url?: string): string | undefined;\nexport function ensureNoTrailingSlash(url?: string): string | undefined {\n    if (url?.endsWith(\"/\")) {\n        return url.slice(0, -1);\n    } else {\n        return url;\n    }\n}\n\n/**\n * Returns a promise which resolves with a given value after the given number of ms\n */\nexport function sleep<T>(ms: number, value?: T): Promise<T> {\n    return new Promise((resolve) => {\n        setTimeout(resolve, ms, value);\n    });\n}\n\n/**\n * Utility to log the duration of a promise.\n *\n * @param logger - The logger to log to.\n * @param name - The name of the operation.\n * @param block - The block to execute.\n */\nexport async function logDuration<T>(logger: BaseLogger, name: string, block: () => Promise<T>): Promise<T> {\n    const start = Date.now();\n    try {\n        return await block();\n    } finally {\n        const end = Date.now();\n        logger.debug(`[Perf]: ${name} took ${end - start}ms`);\n    }\n}\n\n/**\n * Utility to log the duration of a synchronous block.\n *\n * @param logger - The logger to log to.\n * @param name - The name of the operation.\n * @param block - The block to execute.\n */\nexport function logDurationSync<T>(logger: BaseLogger, name: string, block: () => T): T {\n    const start = Date.now();\n    try {\n        return block();\n    } finally {\n        const end = Date.now();\n        logger.debug(`[Perf]: ${name} took ${end - start}ms`);\n    }\n}\n\n/**\n * Promise/async version of {@link setImmediate}.\n *\n * Implementation is based on `setTimeout` for wider compatibility.\n * @deprecated Use {@link sleep} instead.\n */\nexport function immediate(): Promise<void> {\n    return new Promise((resolve) => setTimeout(resolve));\n}\n\nexport function isNullOrUndefined(val: any): boolean {\n    return val === null || val === undefined;\n}\n\nexport async function promiseMapSeries<T>(\n    promises: Array<T | Promise<T>>,\n    fn: (t: T) => Promise<unknown> | undefined, // if async we don't care about the type as we only await resolution\n): Promise<void> {\n    for (const o of promises) {\n        await fn(await o);\n    }\n}\n\nexport function promiseTry<T>(fn: () => T | Promise<T>): Promise<T> {\n    return Promise.resolve(fn());\n}\n\n// Creates and awaits all promises, running no more than `chunkSize` at the same time\nexport async function chunkPromises<T>(fns: (() => Promise<T>)[], chunkSize: number): Promise<T[]> {\n    const results: T[] = [];\n    for (let i = 0; i < fns.length; i += chunkSize) {\n        results.push(...(await Promise.all(fns.slice(i, i + chunkSize).map((fn) => fn()))));\n    }\n    return results;\n}\n\n/**\n * Retries the function until it succeeds or is interrupted. The given function must return\n * a promise which throws/rejects on error, otherwise the retry will assume the request\n * succeeded. The promise chain returned will contain the successful promise. The given function\n * should always return a new promise.\n * @param promiseFn - The function to call to get a fresh promise instance. Takes an\n * attempt count as an argument, for logging/debugging purposes.\n * @param shouldRetry - Optional function which is called with the error the latest rejection from promiseFn,\n * retrying will ba aborted if this return false.\n * @returns The promise for the retried operation.\n */\nexport function simpleRetryOperation<T>(\n    promiseFn: (attempt: number) => Promise<T>,\n    shouldRetry?: (e: unknown) => boolean,\n): Promise<T> {\n    return promiseRetry(\n        (attempt: number) => {\n            return promiseFn(attempt);\n        },\n        {\n            retries: Infinity,\n            shouldRetry: shouldRetry ? ({ error }): boolean => shouldRetry(error) : undefined,\n            factor: 2,\n            minTimeout: 3000, // ms\n            maxTimeout: 15000, // ms\n        },\n    );\n}\n\n// String averaging inspired by https://stackoverflow.com/a/2510816\n// Dev note: We make the alphabet a string because it's easier to write syntactically\n// than arrays. Thankfully, strings implement the useful parts of the Array interface\n// anyhow.\n\n/**\n * The default alphabet used by string averaging in this SDK. This matches\n * all usefully printable ASCII characters (0x20-0x7E, inclusive).\n */\nexport const DEFAULT_ALPHABET = ((): string => {\n    let str = \"\";\n    for (let c = 0x20; c <= 0x7e; c++) {\n        str += String.fromCharCode(c);\n    }\n    return str;\n})();\n\n/**\n * Pads a string using the given alphabet as a base. The returned string will be\n * padded at the end with the first character in the alphabet.\n *\n * This is intended for use with string averaging.\n * @param s - The string to pad.\n * @param n - The length to pad to.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The padded string.\n */\nexport function alphabetPad(s: string, n: number, alphabet = DEFAULT_ALPHABET): string {\n    return s.padEnd(n, alphabet[0]);\n}\n\n/**\n * Converts a baseN number to a string, where N is the alphabet's length.\n *\n * This is intended for use with string averaging.\n * @param n - The baseN number.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The baseN number encoded as a string from the alphabet.\n */\nexport function baseToString(n: bigint, alphabet = DEFAULT_ALPHABET): string {\n    // Developer note: the stringToBase() function offsets the character set by 1 so that repeated\n    // characters (ie: \"aaaaaa\" in a..z) don't come out as zero. We have to reverse this here as\n    // otherwise we'll be wrong in our conversion. Undoing a +1 before an exponent isn't very fun\n    // though, so we rely on a lengthy amount of `x - 1` and integer division rules to reach a\n    // sane state. This also means we have to do rollover detection: see below.\n\n    const len = BigInt(alphabet.length);\n    if (n <= len) {\n        return alphabet[Number(n) - 1] ?? \"\";\n    }\n\n    let d = n / len;\n    let r = Number(n % len) - 1;\n\n    // Rollover detection: if the remainder is negative, it means that the string needs\n    // to roll over by 1 character downwards (ie: in a..z, the previous to \"aaa\" would be\n    // \"zz\").\n    if (r < 0) {\n        d -= BigInt(Math.abs(r)); // abs() is just to be clear what we're doing. Could also `+= r`.\n        r = Number(len) - 1;\n    }\n\n    return baseToString(d, alphabet) + alphabet[r];\n}\n\n/**\n * Converts a string to a baseN number, where N is the alphabet's length.\n *\n * This is intended for use with string averaging.\n * @param s - The string to convert to a number.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The baseN number.\n */\nexport function stringToBase(s: string, alphabet = DEFAULT_ALPHABET): bigint {\n    const len = BigInt(alphabet.length);\n\n    // In our conversion to baseN we do a couple performance optimizations to avoid using\n    // excess CPU and such. To create baseN numbers, the input string needs to be reversed\n    // so the exponents stack up appropriately, as the last character in the unreversed\n    // string has less impact than the first character (in \"abc\" the A is a lot more important\n    // for lexicographic sorts). We also do a trick with the character codes to optimize the\n    // alphabet lookup, avoiding an index scan of `alphabet.indexOf(reversedStr[i])` - we know\n    // that the alphabet and (theoretically) the input string are constrained on character sets\n    // and thus can do simple subtraction to end up with the same result.\n\n    // Developer caution: we carefully cast to BigInt here to avoid losing precision. We cannot\n    // rely on Math.pow() (for example) to be capable of handling our insane numbers.\n\n    let result = BigInt(0);\n    for (let i = s.length - 1, j = BigInt(0); i >= 0; i--, j++) {\n        const charIndex = s.charCodeAt(i) - alphabet.charCodeAt(0);\n\n        // We add 1 to the char index to offset the whole numbering scheme. We unpack this in\n        // the baseToString() function.\n        result += BigInt(1 + charIndex) * len ** j;\n    }\n    return result;\n}\n\n/**\n * Averages two strings, returning the midpoint between them. This is accomplished by\n * converting both to baseN numbers (where N is the alphabet's length) then averaging\n * those before re-encoding as a string.\n * @param a - The first string.\n * @param b - The second string.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The midpoint between the strings, as a string.\n */\nexport function averageBetweenStrings(a: string, b: string, alphabet = DEFAULT_ALPHABET): string {\n    const padN = Math.max(a.length, b.length);\n    const baseA = stringToBase(alphabetPad(a, padN, alphabet), alphabet);\n    const baseB = stringToBase(alphabetPad(b, padN, alphabet), alphabet);\n    const avg = (baseA + baseB) / BigInt(2);\n\n    // Detect integer division conflicts. This happens when two numbers are divided too close so\n    // we lose a .5 precision. We need to add a padding character in these cases.\n    if (avg === baseA || avg == baseB) {\n        return baseToString(avg, alphabet) + alphabet[0];\n    }\n\n    return baseToString(avg, alphabet);\n}\n\n/**\n * Finds the next string using the alphabet provided. This is done by converting the\n * string to a baseN number, where N is the alphabet's length, then adding 1 before\n * converting back to a string.\n * @param s - The string to start at.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The string which follows the input string.\n */\nexport function nextString(s: string, alphabet = DEFAULT_ALPHABET): string {\n    return baseToString(stringToBase(s, alphabet) + BigInt(1), alphabet);\n}\n\n/**\n * Finds the previous string using the alphabet provided. This is done by converting the\n * string to a baseN number, where N is the alphabet's length, then subtracting 1 before\n * converting back to a string.\n * @param s - The string to start at.\n * @param alphabet - The alphabet to use as a single string.\n * @returns The string which precedes the input string.\n */\nexport function prevString(s: string, alphabet = DEFAULT_ALPHABET): string {\n    return baseToString(stringToBase(s, alphabet) - BigInt(1), alphabet);\n}\n\n/**\n * Compares strings lexicographically as a sort-safe function.\n * @param a - The first (reference) string.\n * @param b - The second (compare) string.\n * @returns Negative if the reference string is before the compare string;\n * positive if the reference string is after; and zero if equal.\n */\nexport function lexicographicCompare(a: string, b: string): number {\n    // Dev note: this exists because I'm sad that you can use math operators on strings, so I've\n    // hidden the operation in this function.\n    if (a < b) {\n        return -1;\n    } else if (a > b) {\n        return 1;\n    } else {\n        return 0;\n    }\n}\n\n/**\n * This function is similar to Object.assign() but it assigns recursively and\n * allows you to ignore nullish values from the source\n *\n * @returns the target object\n */\nexport function recursivelyAssign<T1 extends T2, T2 extends Record<string, any>>(\n    target: T1,\n    source: T2,\n    ignoreNullish = false,\n): T1 & T2 {\n    for (const [sourceKey, sourceValue] of Object.entries(source)) {\n        if (target[sourceKey] instanceof Object && sourceValue) {\n            recursivelyAssign(target[sourceKey], sourceValue);\n            continue;\n        }\n        if ((sourceValue !== null && sourceValue !== undefined) || !ignoreNullish) {\n            safeSet(target, sourceKey, sourceValue);\n            continue;\n        }\n    }\n    return target;\n}\n\nfunction getContentTimestampWithFallback(event: MatrixEvent): number {\n    return M_TIMESTAMP.findIn<number>(event.getContent()) ?? -1;\n}\n\n/**\n * Sort events by their content m.ts property\n * Latest timestamp first\n */\nexport function sortEventsByLatestContentTimestamp(left: MatrixEvent, right: MatrixEvent): number {\n    return getContentTimestampWithFallback(right) - getContentTimestampWithFallback(left);\n}\n\nexport function isSupportedReceiptType(receiptType: string): boolean {\n    return [ReceiptType.Read, ReceiptType.ReadPrivate].includes(receiptType as ReceiptType);\n}\n\n/**\n * Determines whether two maps are equal.\n * @param eq - The equivalence relation to compare values by. Defaults to strict equality.\n */\nexport function mapsEqual<K, V>(x: Map<K, V>, y: Map<K, V>, eq = (v1: V, v2: V): boolean => v1 === v2): boolean {\n    if (x.size !== y.size) return false;\n    for (const [k, v1] of x) {\n        const v2 = y.get(k);\n        if (v2 === undefined || !eq(v1, v2)) return false;\n    }\n    return true;\n}\n\nfunction processMapToObjectValue(value: any): any {\n    if (value instanceof Map) {\n        // Value is a Map. Recursively map it to an object.\n        return recursiveMapToObject(value);\n    } else if (Array.isArray(value)) {\n        // Value is an Array. Recursively map the value (e.g. to cover Array of Arrays).\n        return value.map((v) => processMapToObjectValue(v));\n    } else {\n        return value;\n    }\n}\n\n/**\n * Recursively converts Maps to plain objects.\n * Also supports sub-lists of Maps.\n */\nexport function recursiveMapToObject(map: Map<any, any>): Record<any, any> {\n    const targetMap = new Map();\n\n    for (const [key, value] of map) {\n        targetMap.set(key, processMapToObjectValue(value));\n    }\n\n    return Object.fromEntries(targetMap.entries());\n}\n\nexport function unsafeProp(prop: keyof any | undefined): boolean {\n    return prop === \"__proto__\" || prop === \"prototype\" || prop === \"constructor\";\n}\n\nexport function safeSet<O extends Record<any, any>, K extends keyof O>(obj: O, prop: K, value: O[K]): void {\n    if (unsafeProp(prop)) {\n        throw new Error(\"Trying to modify prototype or constructor\");\n    }\n\n    obj[prop] = value;\n}\n\nexport function noUnsafeEventProps(event: Partial<IEvent>): boolean {\n    return !(unsafeProp(event.room_id) || unsafeProp(event.sender) || unsafeProp(event.event_id));\n}\n\nexport class MapWithDefault<K, V> extends Map<K, V> {\n    public constructor(private createDefault: () => V) {\n        super();\n    }\n\n    /**\n     * Returns the value if the key already exists.\n     * If not, it creates a new value under that key using the ctor callback and returns it.\n     */\n    public getOrCreate(key: K): V {\n        if (!this.has(key)) {\n            this.set(key, this.createDefault());\n        }\n\n        return this.get(key)!;\n    }\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,OAAO,WAAW,MAAM,aAAa;AACrC,OAAO,YAAY,MAAM,SAAS;AAGlC,SAAS,WAAW,QAAQ,sBAAsB;AAClD,SAAS,WAAW,QAAQ,2BAA2B;AAGvD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAiB,CAAC;;AAEzC;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,iBAAiB,CAAC,GAAW,EAAU;EACnD;EACA;EACA;EACA,IAAK,GAAG,YAAwB,MAAM,EAAE;IACpC,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;EACxB;;EAEA;EACA,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;IACnB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC;EACzB;;EAEA;EACA,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;AAC3B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,MAAiB,EAAE,eAAiC,EAAmB;EAChG,MAAM,YAAY,GAAG,eAAe,IAAI,IAAI,eAAe,CAAC,CAAC;EAC7D,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;IAC7C,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI,EAAE;MACnC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QACpB,GAAG,CAAC,OAAO,CAAE,CAAC,IAAK;UACf,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC;MACN,CAAC,MAAM;QACH,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;MACzC;IACJ;EACJ;EACA,OAAO,YAAY;AACvB;AAIA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,MAAc,EAAE,QAAgB,EAAE,IAAe,EAAa;EACvF,MAAM,MAAM,mCACL,IAAI;IACP,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM;EAAC,EAC3B;EACD,OAAO,MAAM,CAAC,MAAM,CAAC;EACrB,OAAO,MAAM;AACjB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,KAAa,EAAqC;EAC3E,MAAM,CAAoC,GAAG,CAAC,CAAC;EAC/C,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC,KAAK,CAAC;EACzC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE;IAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC;IAC9B,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG;EAC5C;EACA,OAAO,CAAC;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,SAAS,CAAC,YAAoB,EAAE,SAAoD,EAAU;EAC1G,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE;IACzB,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;MAChC;IACJ;IACA,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC;IAC5B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;MACvC;IACJ;IACA,YAAY,GAAG,YAAY,CAAC,OAAO,CAAC,GAAG,EAAE,kBAAkB,CAAC,KAAK,CAAC,CAAC;EACvE;EACA,OAAO,YAAY;AACvB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,aAAa,CAAI,KAAU,EAAE,EAA0C,EAAE,OAAiB,EAAW;EACjH,IAAI,CAAS;EACb,IAAI,OAAO,EAAE;IACT,KAAK,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;MACpC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE;QACxB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,OAAO,IAAI;MACf;IACJ;EACJ,CAAC,MAAM;IACH,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;MAC/B,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE;QACxB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,OAAO,IAAI;MACf;IACJ;EACJ;EACA,OAAO,KAAK;AAChB;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,UAAU,CAAC,KAAU,EAAW;EAC5C,OAAO,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,mBAAmB;AACxE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,kBAAkB,CAAC,GAAW,EAAE,IAAc,EAAQ;EAClE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;IACpB,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;MAC1B,MAAM,IAAI,KAAK,CAAC,wBAAwB,GAAG,GAAG,CAAC;IACnD;EACJ;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,QAAQ,CAAI,GAAM,EAAK;EACnC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,WAAW,CAAC,CAAM,EAAE,CAAM,EAAW;EACjD;EACA;;EAEA;EACA;EACA,IAAI,CAAC,KAAK,CAAC,EAAE;IACT,OAAO,IAAI;EACf;EAEA,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,EAAE;IACvB,OAAO,KAAK;EAChB;;EAEA;EACA,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE;IAC/C,OAAO,IAAI;EACf;;EAEA;EACA;EACA,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE;IAC1B,OAAO,CAAC,KAAK,CAAC;EAClB;;EAEA;EACA;EACA;EACA,IACI,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,QAAQ,IAC/B,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,QAAQ,IAC/B,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,MAAM,IAC7B,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,OAAO,EAChC;IACE,OAAO,KAAK;EAChB;;EAEA;EACA;EACA;EACA,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,EAAE;IAC7B,OAAO,KAAK;EAChB;;EAEA;EACA,IAAI,CAAC,YAAY,MAAM,IAAI,CAAC,YAAY,IAAI,EAAE;IAC1C,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;EACxC;;EAEA;EACA,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE;MACvB,OAAO,KAAK;IAChB;IAEA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;MAC/B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;QAC1B,OAAO,KAAK;MAChB;IACJ;EACJ,CAAC,MAAM;IACH;IACA,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE;MACf,IAAI,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE;QAC7C,OAAO,KAAK;MAChB;IACJ;;IAEA;IACA,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE;MACf,IAAI,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;QACzE,OAAO,KAAK;MAChB;IACJ;EACJ;EACA,OAAO,IAAI;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,uBAAuB,CAAC,GAAQ,EAAmB;EAC/D,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,OAAO,GAAG;;EAEvC;EACA,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,OAAO,GAAG;EAEvE,MAAM,KAAsB,GAAG,EAAE;EACjC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;IACtC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC;EAC/C;;EAEA;EACA,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;EAEtD,OAAO,KAAK;AAChB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,QAAQ,CAAC,KAAU,EAAmB;EAClD,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,QAAQ,CAAC,KAAK,CAAC;AACvD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,iBAAiB,CAAC,GAAW,EAAU;EACnD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;IACzB,OAAO,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC;EAChF;EACA,OAAO,EAAE;AACb;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAAS,4BAA4B,CAAC,GAAW,EAAU;EAC9D,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;IACzB,OAAO,GAAG,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;EAC9C;EACA,OAAO,EAAE;AACb;AAEA,OAAO,SAAS,SAAS,CAAC,GAAW,EAAU;EAC3C;EACA;EACA,OACI,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;EAC/B;EAAA,CACC,OAAO,CAAC,kEAAkE,EAAE,EAAE;EAC/E;EAAA,CACC,WAAW,CAAC,CAAC;AAE1B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,sBAAsB,GAAG,6EAA6E;AAE5G,OAAO,SAAS,YAAY,CAAC,MAAc,EAAU;EACjD,OAAO,MAAM,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC;AACxD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,IAAY,EAAU;EAC/C,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC;AACxE;AAKA,OAAO,SAAS,qBAAqB,CAAC,GAAY,EAAsB;EACpE,IAAI,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE;IACpB,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;EAC3B,CAAC,MAAM;IACH,OAAO,GAAG;EACd;AACJ;;AAEA;AACA;AACA;AACA,OAAO,SAAS,KAAK,CAAI,EAAU,EAAE,KAAS,EAAc;EACxD,OAAO,IAAI,OAAO,CAAE,OAAO,IAAK;IAC5B,UAAU,CAAC,OAAO,EAAE,EAAE,EAAE,KAAK,CAAC;EAClC,CAAC,CAAC;AACN;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAe,WAAW,CAAI,MAAkB,EAAE,IAAY,EAAE,KAAuB,EAAc;EACxG,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;EACxB,IAAI;IACA,OAAO,MAAM,KAAK,CAAC,CAAC;EACxB,CAAC,SAAS;IACN,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,CAAC,KAAK,CAAC,WAAW,IAAI,SAAS,GAAG,GAAG,KAAK,IAAI,CAAC;EACzD;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,eAAe,CAAI,MAAkB,EAAE,IAAY,EAAE,KAAc,EAAK;EACpF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;EACxB,IAAI;IACA,OAAO,KAAK,CAAC,CAAC;EAClB,CAAC,SAAS;IACN,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,CAAC,KAAK,CAAC,WAAW,IAAI,SAAS,GAAG,GAAG,KAAK,IAAI,CAAC;EACzD;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,SAAS,GAAkB;EACvC,OAAO,IAAI,OAAO,CAAE,OAAO,IAAK,UAAU,CAAC,OAAO,CAAC,CAAC;AACxD;AAEA,OAAO,SAAS,iBAAiB,CAAC,GAAQ,EAAW;EACjD,OAAO,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS;AAC5C;AAEA,OAAO,eAAe,gBAAgB,CAClC,QAA+B,EAC/B,EAA0C,CAAE;AAAA,EAC/B;EACb,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;IACtB,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC;EACrB;AACJ;AAEA,OAAO,SAAS,UAAU,CAAI,EAAwB,EAAc;EAChE,OAAO,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;AAChC;;AAEA;AACA,OAAO,eAAe,aAAa,CAAI,GAAyB,EAAE,SAAiB,EAAgB;EAC/F,MAAM,OAAY,GAAG,EAAE;EACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE;IAC5C,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAE,EAAE,IAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;EACvF;EACA,OAAO,OAAO;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,oBAAoB,CAChC,SAA0C,EAC1C,WAAqC,EAC3B;EACV,OAAO,YAAY,CACd,OAAe,IAAK;IACjB,OAAO,SAAS,CAAC,OAAO,CAAC;EAC7B,CAAC,EACD;IACI,OAAO,EAAE,QAAQ;IACjB,WAAW,EAAE,WAAW,GAAG,CAAC;MAAE;IAAM,CAAC,KAAc,WAAW,CAAC,KAAK,CAAC,GAAG,SAAS;IACjF,MAAM,EAAE,CAAC;IACT,UAAU,EAAE,IAAI;IAAE;IAClB,UAAU,EAAE,KAAK,CAAE;EACvB,CACJ,CAAC;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO,MAAM,gBAAgB,GAAG,CAAC,MAAc;EAC3C,IAAI,GAAG,GAAG,EAAE;EACZ,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE;IAC/B,GAAG,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;EACjC;EACA,OAAO,GAAG;AACd,CAAC,EAAE,CAAC;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACnF,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;AACnC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACzE;EACA;EACA;EACA;EACA;;EAEA,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;EACnC,IAAI,CAAC,IAAI,GAAG,EAAE;IACV,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE;EACxC;EAEA,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG;EACf,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC;;EAE3B;EACA;EACA;EACA,IAAI,CAAC,GAAG,CAAC,EAAE;IACP,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;EACvB;EAEA,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AAClD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,YAAY,CAAC,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACzE,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;;EAEnC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA;EACA;;EAEA,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;EACtB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;IACxD,MAAM,SAAS,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;;IAE1D;IACA;IACA,MAAM,IAAI,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,GAAG,IAAI,CAAC;EAC9C;EACA,OAAO,MAAM;AACjB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,qBAAqB,CAAC,CAAS,EAAE,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EAC7F,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;EACzC,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;EACpE,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;EACpE,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;;EAEvC;EACA;EACA,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,IAAI,KAAK,EAAE;IAC/B,OAAO,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;EACpD;EAEA,OAAO,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC;AACtC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,UAAU,CAAC,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACvE,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC;AACxE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,UAAU,CAAC,CAAS,EAAE,QAAQ,GAAG,gBAAgB,EAAU;EACvE,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC;AACxE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,oBAAoB,CAAC,CAAS,EAAE,CAAS,EAAU;EAC/D;EACA;EACA,IAAI,CAAC,GAAG,CAAC,EAAE;IACP,OAAO,CAAC,CAAC;EACb,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,EAAE;IACd,OAAO,CAAC;EACZ,CAAC,MAAM;IACH,OAAO,CAAC;EACZ;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAAS,iBAAiB,CAC7B,MAAU,EACV,MAAU,EACV,aAAa,GAAG,KAAK,EACd;EACP,KAAK,MAAM,CAAC,SAAS,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;IAC3D,IAAI,MAAM,CAAC,SAAS,CAAC,YAAY,MAAM,IAAI,WAAW,EAAE;MACpD,iBAAiB,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,WAAW,CAAC;MACjD;IACJ;IACA,IAAK,WAAW,KAAK,IAAI,IAAI,WAAW,KAAK,SAAS,IAAK,CAAC,aAAa,EAAE;MACvE,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,WAAW,CAAC;MACvC;IACJ;EACJ;EACA,OAAO,MAAM;AACjB;AAEA,SAAS,+BAA+B,CAAC,KAAkB,EAAU;EACjE,OAAO,WAAW,CAAC,MAAM,CAAS,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC/D;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAAS,kCAAkC,CAAC,IAAiB,EAAE,KAAkB,EAAU;EAC9F,OAAO,+BAA+B,CAAC,KAAK,CAAC,GAAG,+BAA+B,CAAC,IAAI,CAAC;AACzF;AAEA,OAAO,SAAS,sBAAsB,CAAC,WAAmB,EAAW;EACjE,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,WAA0B,CAAC;AAC3F;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAAS,SAAS,CAAO,CAAY,EAAE,CAAY,EAAE,EAAE,GAAG,CAAC,EAAK,EAAE,EAAK,KAAc,EAAE,KAAK,EAAE,EAAW;EAC5G,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,OAAO,KAAK;EACnC,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE;IACrB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,KAAK;EACrD;EACA,OAAO,IAAI;AACf;AAEA,SAAS,uBAAuB,CAAC,KAAU,EAAO;EAC9C,IAAI,KAAK,YAAY,GAAG,EAAE;IACtB;IACA,OAAO,oBAAoB,CAAC,KAAK,CAAC;EACtC,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;IAC7B;IACA,OAAO,KAAK,CAAC,GAAG,CAAE,CAAC,IAAK,uBAAuB,CAAC,CAAC,CAAC,CAAC;EACvD,CAAC,MAAM;IACH,OAAO,KAAK;EAChB;AACJ;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAAS,oBAAoB,CAAC,GAAkB,EAAoB;EACvE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC;EAE3B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,GAAG,EAAE;IAC5B,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,uBAAuB,CAAC,KAAK,CAAC,CAAC;EACtD;EAEA,OAAO,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;AAClD;AAEA,OAAO,SAAS,UAAU,CAAC,IAA2B,EAAW;EAC7D,OAAO,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,aAAa;AACjF;AAEA,OAAO,SAAS,OAAO,CAAgD,GAAM,EAAE,IAAO,EAAE,KAAW,EAAQ;EACvG,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE;IAClB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC;EAChE;EAEA,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK;AACrB;AAEA,OAAO,SAAS,kBAAkB,CAAC,KAAsB,EAAW;EAChE,OAAO,EAAE,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;AACjG;AAEA,OAAO,MAAM,cAAc,SAAe,GAAG,CAAO;EACzC,WAAW,CAAS,aAAsB,EAAE;IAC/C,KAAK,CAAC,CAAC;IAAC,KADe,aAAsB,GAAtB,aAAsB;EAEjD;;EAEA;AACJ;AACA;AACA;EACW,WAAW,CAAC,GAAM,EAAK;IAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;MAChB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACvC;IAEA,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;EACxB;AACJ","ignoreList":[]}