@unwanted/matrix-sdk-mini 34.12.0-1

package/lib/rust-crypto/verification.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"verification.js","names":["RustSdkCryptoJs","QrState","VerificationPhase","VerificationRequestEvent","VerifierEvent","TypedEventEmitter","TypedReEmitter","EventType","MsgType","defer","VerificationMethod","RustVerificationRequest","constructor","olmMachine","inner","outgoingRequestProcessor","supportedVerificationMethods","_defineProperty","reEmitter","weakThis","WeakRef","registerChangesCallback","_asyncToGenerator","_weakThis$deref","deref","onChange","verification","getVerification","Sas","_verifier","undefined","RustQrCodeVerifier","setVerifier","RustSASVerifier","replaceInner","Qr","emit","Change","verifier","stopReEmitting","reEmit","transactionId","flowId","roomId","_this$inner$roomId","toString","initiatedByMe","weStarted","otherUserId","otherDeviceId","_this$inner$otherDevi","getOtherDevice","_this","getDevice","isSelfVerification","phase","VerificationRequestPhase","Created","Requested","Ready","_accepting","Transitioned","Error","verificationPhase","Done","Cancelled","concat","pending","isPassive","accepting","declining","_cancelling","timeout","timeRemainingMillis","methods","chosenMethod","Started","Reciprocate","otherPartySupportsMethod","method","theirMethods","theirSupportedMethods","requiredMethod","verificationMethodsByIdentifier","some","m","accept","_this2","req","acceptWithMethods","map","verificationMethodIdentifierToMethod","makeOutgoingRequest","cancel","params","_this3","beginKeyVerification","targetDevice","startVerification","_this4","res","startSas","scanQRCode","uint8Array","_this5","scan","QrCodeScan","fromBytes","Uint8ClampedArray","scanQrCode","reciprocate","getQRCodeBytes","generateQRCode","_this6","innerVerifier","generateQrCode","Buffer","from","toBytes","cancellationCode","_this$inner$cancelInf","_this$inner$cancelInf2","cancelInfo","cancelCode","cancellingUserId","cancelledbyUs","userId","BaseRustVerifer","completionDeferred","_weakThis$deref2","promise","catch","isDone","resolve","isCancelled","reject","reason","hasBeenCancelled","e","getShowSasCallbacks","getReciprocateQrCodeCallbacks","callbacks","hasBeenScanned","confirm","confirmScanning","verify","_this7","ShowReciprocateQr","state","Scanned","Confirmed","Reciprocated","_this8","_verificationRequest","_this9","sendAccept","_this10","_this11","emoji","decimal","decimals","sas","symbol","description","_confirm","requests","apply","arguments","mismatch","request","cancelWithCode","ShowSas","_weakThis$deref3","SasV1","ScanQrCode","QrCodeScanV1","ShowQrCode","QrCodeShowV1","ReciprocateV1","meth","isVerificationEvent","event","getType","KeyVerificationCancel","KeyVerificationDone","KeyVerificationMac","KeyVerificationStart","KeyVerificationKey","KeyVerificationReady","KeyVerificationAccept","RoomMessage","getContent","msgtype","KeyVerificationRequest"],"sources":["../../src/rust-crypto/verification.ts"],"sourcesContent":["/*\nCopyright 2023 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nimport * as RustSdkCryptoJs from \"@matrix-org/matrix-sdk-crypto-wasm\";\nimport { QrState } from \"@matrix-org/matrix-sdk-crypto-wasm\";\n\nimport {\n    GeneratedSas,\n    ShowQrCodeCallbacks,\n    ShowSasCallbacks,\n    VerificationPhase,\n    VerificationRequest,\n    VerificationRequestEvent,\n    VerificationRequestEventHandlerMap,\n    Verifier,\n    VerifierEvent,\n    VerifierEventHandlerMap,\n} from \"../crypto-api/verification.ts\";\nimport { TypedEventEmitter } from \"../models/typed-event-emitter.ts\";\nimport { OutgoingRequest, OutgoingRequestProcessor } from \"./OutgoingRequestProcessor.ts\";\nimport { TypedReEmitter } from \"../ReEmitter.ts\";\nimport { MatrixEvent } from \"../models/event.ts\";\nimport { EventType, MsgType } from \"../@types/event.ts\";\nimport { defer, IDeferred } from \"../utils.ts\";\nimport { VerificationMethod } from \"../types.ts\";\n\n/**\n * An incoming, or outgoing, request to verify a user or a device via cross-signing.\n *\n * @internal\n */\nexport class RustVerificationRequest\n    extends TypedEventEmitter<VerificationRequestEvent, VerificationRequestEventHandlerMap>\n    implements VerificationRequest\n{\n    /** a reëmitter which relays VerificationRequestEvent.Changed events emitted by the verifier */\n    private readonly reEmitter: TypedReEmitter<VerificationRequestEvent, VerificationRequestEventHandlerMap>;\n\n    /** Are we in the process of sending an `m.key.verification.ready` event? */\n    private _accepting = false;\n\n    /** Are we in the process of sending an `m.key.verification.cancellation` event? */\n    private _cancelling = false;\n\n    private _verifier: undefined | RustSASVerifier | RustQrCodeVerifier;\n\n    /**\n     * Construct a new RustVerificationRequest to wrap the rust-level `VerificationRequest`.\n     *\n     * @param olmMachine - The `OlmMachine` from the underlying rust crypto sdk.\n     * @param inner - VerificationRequest from the Rust SDK.\n     * @param outgoingRequestProcessor - `OutgoingRequestProcessor` to use for making outgoing HTTP requests.\n     * @param supportedVerificationMethods - Verification methods to use when `accept()` is called.\n     */\n    public constructor(\n        private readonly olmMachine: RustSdkCryptoJs.OlmMachine,\n        private readonly inner: RustSdkCryptoJs.VerificationRequest,\n        private readonly outgoingRequestProcessor: OutgoingRequestProcessor,\n        private readonly supportedVerificationMethods: string[],\n    ) {\n        super();\n        this.reEmitter = new TypedReEmitter(this);\n\n        // Obviously, the Rust object maintains a reference to the callback function. If the callback function maintains\n        // a reference to the Rust object, then we have a reference cycle which means that `RustVerificationRequest`\n        // will never be garbage-collected, and hence the underlying rust object will never be freed.\n        //\n        // To avoid this reference cycle, use a weak reference in the callback function. If the `RustVerificationRequest`\n        // gets garbage-collected, then there is nothing to update!\n        const weakThis = new WeakRef(this);\n        inner.registerChangesCallback(async () => weakThis.deref()?.onChange());\n    }\n\n    /**\n     * Hook which is called when the underlying rust class notifies us that there has been a change.\n     */\n    private onChange(): void {\n        const verification: RustSdkCryptoJs.Qr | RustSdkCryptoJs.Sas | undefined = this.inner.getVerification();\n\n        // Set the _verifier object (wrapping the rust `Verification` as a js-sdk Verifier) if:\n        // - we now have a `Verification` where we lacked one before\n        // - we have transitioned from QR to SAS\n        // - we are verifying with SAS, but we need to replace our verifier with a new one because both parties\n        //   tried to start verification at the same time, and we lost the tie breaking\n        if (verification instanceof RustSdkCryptoJs.Sas) {\n            if (this._verifier === undefined || this._verifier instanceof RustQrCodeVerifier) {\n                this.setVerifier(new RustSASVerifier(verification, this, this.outgoingRequestProcessor));\n            } else if (this._verifier instanceof RustSASVerifier) {\n                this._verifier.replaceInner(verification);\n            }\n        } else if (verification instanceof RustSdkCryptoJs.Qr && this._verifier === undefined) {\n            this.setVerifier(new RustQrCodeVerifier(verification, this.outgoingRequestProcessor));\n        }\n\n        this.emit(VerificationRequestEvent.Change);\n    }\n\n    private setVerifier(verifier: RustSASVerifier | RustQrCodeVerifier): void {\n        // if we already have a verifier, unsubscribe from its events\n        if (this._verifier) {\n            this.reEmitter.stopReEmitting(this._verifier, [VerificationRequestEvent.Change]);\n        }\n        this._verifier = verifier;\n        this.reEmitter.reEmit(this._verifier, [VerificationRequestEvent.Change]);\n    }\n\n    /**\n     * Unique ID for this verification request.\n     *\n     * An ID isn't assigned until the first message is sent, so this may be `undefined` in the early phases.\n     */\n    public get transactionId(): string | undefined {\n        return this.inner.flowId;\n    }\n\n    /**\n     * For an in-room verification, the ID of the room.\n     *\n     * For to-device verifications, `undefined`.\n     */\n    public get roomId(): string | undefined {\n        return this.inner.roomId?.toString();\n    }\n\n    /**\n     * True if this request was initiated by the local client.\n     *\n     * For in-room verifications, the initiator is who sent the `m.key.verification.request` event.\n     * For to-device verifications, the initiator is who sent the `m.key.verification.start` event.\n     */\n    public get initiatedByMe(): boolean {\n        return this.inner.weStarted();\n    }\n\n    /** The user id of the other party in this request */\n    public get otherUserId(): string {\n        return this.inner.otherUserId.toString();\n    }\n\n    /** For verifications via to-device messages: the ID of the other device. Otherwise, undefined. */\n    public get otherDeviceId(): string | undefined {\n        return this.inner.otherDeviceId?.toString();\n    }\n\n    /** Get the other device involved in the verification, if it is known */\n    private async getOtherDevice(): Promise<undefined | RustSdkCryptoJs.Device> {\n        const otherDeviceId = this.inner.otherDeviceId;\n        if (!otherDeviceId) {\n            return undefined;\n        }\n        return await this.olmMachine.getDevice(this.inner.otherUserId, otherDeviceId, 5);\n    }\n\n    /** True if the other party in this request is one of this user's own devices. */\n    public get isSelfVerification(): boolean {\n        return this.inner.isSelfVerification();\n    }\n\n    /** current phase of the request. */\n    public get phase(): VerificationPhase {\n        const phase = this.inner.phase();\n\n        switch (phase) {\n            case RustSdkCryptoJs.VerificationRequestPhase.Created:\n            case RustSdkCryptoJs.VerificationRequestPhase.Requested:\n                return VerificationPhase.Requested;\n            case RustSdkCryptoJs.VerificationRequestPhase.Ready:\n                // if we're still sending the `m.key.verification.ready`, that counts as \"Requested\" in the js-sdk's\n                // parlance.\n                return this._accepting ? VerificationPhase.Requested : VerificationPhase.Ready;\n            case RustSdkCryptoJs.VerificationRequestPhase.Transitioned:\n                if (!this._verifier) {\n                    // this shouldn't happen, because the onChange handler should have created a _verifier.\n                    throw new Error(\"VerificationRequest: inner phase == Transitioned but no verifier!\");\n                }\n                return this._verifier.verificationPhase;\n            case RustSdkCryptoJs.VerificationRequestPhase.Done:\n                return VerificationPhase.Done;\n            case RustSdkCryptoJs.VerificationRequestPhase.Cancelled:\n                return VerificationPhase.Cancelled;\n        }\n\n        throw new Error(`Unknown verification phase ${phase}`);\n    }\n\n    /** True if the request has sent its initial event and needs more events to complete\n     * (ie it is in phase `Requested`, `Ready` or `Started`).\n     */\n    public get pending(): boolean {\n        if (this.inner.isPassive()) return false;\n        const phase = this.phase;\n        return phase !== VerificationPhase.Done && phase !== VerificationPhase.Cancelled;\n    }\n\n    /**\n     * True if we have started the process of sending an `m.key.verification.ready` (but have not necessarily received\n     * the remote echo which causes a transition to {@link VerificationPhase.Ready}.\n     */\n    public get accepting(): boolean {\n        return this._accepting;\n    }\n\n    /**\n     * True if we have started the process of sending an `m.key.verification.cancel` (but have not necessarily received\n     * the remote echo which causes a transition to {@link VerificationPhase.Cancelled}).\n     */\n    public get declining(): boolean {\n        return this._cancelling;\n    }\n\n    /**\n     * The remaining number of ms before the request will be automatically cancelled.\n     *\n     * `null` indicates that there is no timeout\n     */\n    public get timeout(): number | null {\n        return this.inner.timeRemainingMillis();\n    }\n\n    /** once the phase is Started (and !initiatedByMe) or Ready: common methods supported by both sides */\n    public get methods(): string[] {\n        throw new Error(\"not implemented\");\n    }\n\n    /** the method picked in the .start event */\n    public get chosenMethod(): string | null {\n        if (this.phase !== VerificationPhase.Started) return null;\n\n        const verification: RustSdkCryptoJs.Qr | RustSdkCryptoJs.Sas | undefined = this.inner.getVerification();\n        if (verification instanceof RustSdkCryptoJs.Sas) {\n            return VerificationMethod.Sas;\n        } else if (verification instanceof RustSdkCryptoJs.Qr) {\n            return VerificationMethod.Reciprocate;\n        } else {\n            return null;\n        }\n    }\n\n    /**\n     * Checks whether the other party supports a given verification method.\n     * This is useful when setting up the QR code UI, as it is somewhat asymmetrical:\n     * if the other party supports SCAN_QR, we should show a QR code in the UI, and vice versa.\n     * For methods that need to be supported by both ends, use the `methods` property.\n     *\n     * @param method - the method to check\n     * @returns true if the other party said they supported the method\n     */\n    public otherPartySupportsMethod(method: string): boolean {\n        const theirMethods: RustSdkCryptoJs.VerificationMethod[] | undefined = this.inner.theirSupportedMethods;\n        if (theirMethods === undefined) {\n            // no message from the other side yet\n            return false;\n        }\n\n        const requiredMethod = verificationMethodsByIdentifier[method];\n        return theirMethods.some((m) => m === requiredMethod);\n    }\n\n    /**\n     * Accepts the request, sending a .ready event to the other party\n     *\n     * @returns Promise which resolves when the event has been sent.\n     */\n    public async accept(): Promise<void> {\n        if (this.inner.phase() !== RustSdkCryptoJs.VerificationRequestPhase.Requested || this._accepting) {\n            throw new Error(`Cannot accept a verification request in phase ${this.phase}`);\n        }\n\n        this._accepting = true;\n        try {\n            const req: undefined | OutgoingRequest = this.inner.acceptWithMethods(\n                this.supportedVerificationMethods.map(verificationMethodIdentifierToMethod),\n            );\n            if (req) {\n                await this.outgoingRequestProcessor.makeOutgoingRequest(req);\n            }\n        } finally {\n            this._accepting = false;\n        }\n\n        // phase may have changed, so emit a 'change' event\n        this.emit(VerificationRequestEvent.Change);\n    }\n\n    /**\n     * Cancels the request, sending a cancellation to the other party\n     *\n     * @param params - Details for the cancellation, including `reason` (defaults to \"User declined\"), and `code`\n     *    (defaults to `m.user`).\n     *\n     * @returns Promise which resolves when the event has been sent.\n     */\n    public async cancel(params?: { reason?: string; code?: string }): Promise<void> {\n        if (this._cancelling) {\n            // already cancelling; do nothing\n            return;\n        }\n\n        this._cancelling = true;\n        try {\n            const req: undefined | OutgoingRequest = this.inner.cancel();\n            if (req) {\n                await this.outgoingRequestProcessor.makeOutgoingRequest(req);\n            }\n        } finally {\n            this._cancelling = false;\n        }\n    }\n\n    /**\n     * Create a {@link Verifier} to do this verification via a particular method.\n     *\n     * If a verifier has already been created for this request, returns that verifier.\n     *\n     * This does *not* send the `m.key.verification.start` event - to do so, call {@link Verifier#verifier} on the\n     * returned verifier.\n     *\n     * If no previous events have been sent, pass in `targetDevice` to set who to direct this request to.\n     *\n     * @param method - the name of the verification method to use.\n     * @param targetDevice - details of where to send the request to.\n     *\n     * @returns The verifier which will do the actual verification.\n     */\n    public beginKeyVerification(method: string, targetDevice?: { userId?: string; deviceId?: string }): Verifier {\n        throw new Error(\"not implemented\");\n    }\n\n    /**\n     * Send an `m.key.verification.start` event to start verification via a particular method.\n     *\n     * Implementation of {@link Crypto.VerificationRequest#startVerification}.\n     *\n     * @param method - the name of the verification method to use.\n     */\n    public async startVerification(method: string): Promise<Verifier> {\n        if (method !== VerificationMethod.Sas) {\n            throw new Error(`Unsupported verification method ${method}`);\n        }\n\n        // make sure that we have a list of the other user's devices (workaround https://github.com/matrix-org/matrix-rust-sdk/issues/2896)\n        if (!(await this.getOtherDevice())) {\n            throw new Error(\"startVerification(): other device is unknown\");\n        }\n\n        const res:\n            | [RustSdkCryptoJs.Sas, RustSdkCryptoJs.RoomMessageRequest | RustSdkCryptoJs.ToDeviceRequest]\n            | undefined = await this.inner.startSas();\n\n        if (res) {\n            const [, req] = res;\n            await this.outgoingRequestProcessor.makeOutgoingRequest(req);\n        }\n\n        // this should have triggered the onChange callback, and we should now have a verifier\n        if (!this._verifier) {\n            throw new Error(\"Still no verifier after startSas() call\");\n        }\n\n        return this._verifier;\n    }\n\n    /**\n     * Start a QR code verification by providing a scanned QR code for this verification flow.\n     *\n     * Implementation of {@link Crypto.VerificationRequest#scanQRCode}.\n     *\n     * @param qrCodeData - the decoded QR code.\n     * @returns A verifier; call `.verify()` on it to wait for the other side to complete the verification flow.\n     */\n    public async scanQRCode(uint8Array: Uint8Array): Promise<Verifier> {\n        const scan = RustSdkCryptoJs.QrCodeScan.fromBytes(new Uint8ClampedArray(uint8Array));\n        const verifier: RustSdkCryptoJs.Qr = await this.inner.scanQrCode(scan);\n\n        // this should have triggered the onChange callback, and we should now have a verifier\n        if (!this._verifier) {\n            throw new Error(\"Still no verifier after scanQrCode() call\");\n        }\n\n        // we can immediately trigger the reciprocate request\n        const req: undefined | OutgoingRequest = verifier.reciprocate();\n        if (req) {\n            await this.outgoingRequestProcessor.makeOutgoingRequest(req);\n        }\n\n        return this._verifier;\n    }\n\n    /**\n     * The verifier which is doing the actual verification, once the method has been established.\n     * Only defined when the `phase` is Started.\n     */\n    public get verifier(): Verifier | undefined {\n        // It's possible for us to have a Verifier before a method has been chosen (in particular,\n        // if we are showing a QR code which the other device has not yet scanned. At that point, we could\n        // still switch to SAS).\n        //\n        // In that case, we should not return it to the application yet, since the application will not expect the\n        // Verifier to be replaced during the lifetime of the VerificationRequest.\n        return this.phase === VerificationPhase.Started ? this._verifier : undefined;\n    }\n\n    /**\n     * Stub implementation of {@link Crypto.VerificationRequest#getQRCodeBytes}.\n     */\n    public getQRCodeBytes(): Buffer | undefined {\n        throw new Error(\"getQRCodeBytes() unsupported in Rust Crypto; use generateQRCode() instead.\");\n    }\n\n    /**\n     * Generate the data for a QR code allowing the other device to verify this one, if it supports it.\n     *\n     * Implementation of {@link Crypto.VerificationRequest#generateQRCode}.\n     */\n    public async generateQRCode(): Promise<Buffer | undefined> {\n        // make sure that we have a list of the other user's devices (workaround https://github.com/matrix-org/matrix-rust-sdk/issues/2896)\n        if (!(await this.getOtherDevice())) {\n            throw new Error(\"generateQRCode(): other device is unknown\");\n        }\n\n        const innerVerifier: RustSdkCryptoJs.Qr | undefined = await this.inner.generateQrCode();\n        // If we are unable to generate a QRCode, we return undefined\n        if (!innerVerifier) return;\n\n        return Buffer.from(innerVerifier.toBytes());\n    }\n\n    /**\n     * If this request has been cancelled, the cancellation code (e.g `m.user`) which is responsible for cancelling\n     * this verification.\n     */\n    public get cancellationCode(): string | null {\n        return this.inner.cancelInfo?.cancelCode() ?? null;\n    }\n\n    /**\n     * The id of the user that cancelled the request.\n     *\n     * Only defined when phase is Cancelled\n     */\n    public get cancellingUserId(): string | undefined {\n        const cancelInfo = this.inner.cancelInfo;\n        if (!cancelInfo) {\n            return undefined;\n        } else if (cancelInfo.cancelledbyUs()) {\n            return this.olmMachine.userId.toString();\n        } else {\n            return this.inner.otherUserId.toString();\n        }\n    }\n}\n\n/** Common base class for `Verifier` implementations which wrap rust classes.\n *\n * The generic parameter `InnerType` is the type of the rust Verification class which we wrap.\n *\n * @internal\n */\nabstract class BaseRustVerifer<InnerType extends RustSdkCryptoJs.Qr | RustSdkCryptoJs.Sas> extends TypedEventEmitter<\n    VerifierEvent | VerificationRequestEvent,\n    VerifierEventHandlerMap & VerificationRequestEventHandlerMap\n> {\n    /** A deferred which completes when the verification completes (or rejects when it is cancelled/fails) */\n    protected readonly completionDeferred: IDeferred<void>;\n\n    public constructor(\n        protected inner: InnerType,\n        protected readonly outgoingRequestProcessor: OutgoingRequestProcessor,\n    ) {\n        super();\n\n        this.completionDeferred = defer();\n\n        // As with RustVerificationRequest, we need to avoid a reference cycle.\n        // See the comments in RustVerificationRequest.\n        const weakThis = new WeakRef(this);\n        inner.registerChangesCallback(async () => weakThis.deref()?.onChange());\n\n        // stop the runtime complaining if nobody catches a failure\n        this.completionDeferred.promise.catch(() => null);\n    }\n\n    /**\n     * Hook which is called when the underlying rust class notifies us that there has been a change.\n     *\n     * Can be overridden by subclasses to see if we can notify the application about an update. The overriding method\n     * must call `super.onChange()`.\n     */\n    protected onChange(): void {\n        if (this.inner.isDone()) {\n            this.completionDeferred.resolve(undefined);\n        } else if (this.inner.isCancelled()) {\n            const cancelInfo = this.inner.cancelInfo()!;\n            this.completionDeferred.reject(\n                new Error(\n                    `Verification cancelled by ${\n                        cancelInfo.cancelledbyUs() ? \"us\" : \"them\"\n                    } with code ${cancelInfo.cancelCode()}: ${cancelInfo.reason()}`,\n                ),\n            );\n        }\n\n        this.emit(VerificationRequestEvent.Change);\n    }\n\n    /**\n     * Returns true if the verification has been cancelled, either by us or the other side.\n     */\n    public get hasBeenCancelled(): boolean {\n        return this.inner.isCancelled();\n    }\n\n    /**\n     * The ID of the other user in the verification process.\n     */\n    public get userId(): string {\n        return this.inner.otherUserId.toString();\n    }\n\n    /**\n     * Cancel a verification.\n     *\n     * We will send an `m.key.verification.cancel` if the verification is still in flight. The verification promise\n     * will reject, and a {@link Crypto.VerifierEvent#Cancel} will be emitted.\n     *\n     * @param e - the reason for the cancellation.\n     */\n    public cancel(e?: Error): void {\n        // TODO: something with `e`\n        const req: undefined | OutgoingRequest = this.inner.cancel();\n        if (req) {\n            this.outgoingRequestProcessor.makeOutgoingRequest(req);\n        }\n    }\n\n    /**\n     * Get the details for an SAS verification, if one is in progress\n     *\n     * Returns `null`, unless this verifier is for a SAS-based verification and we are waiting for the user to confirm\n     * the SAS matches.\n     */\n    public getShowSasCallbacks(): ShowSasCallbacks | null {\n        return null;\n    }\n\n    /**\n     * Get the details for reciprocating QR code verification, if one is in progress\n     *\n     * Returns `null`, unless this verifier is for reciprocating a QR-code-based verification (ie, the other user has\n     * already scanned our QR code), and we are waiting for the user to confirm.\n     */\n    public getReciprocateQrCodeCallbacks(): ShowQrCodeCallbacks | null {\n        return null;\n    }\n}\n\n/** A Verifier instance which is used to show and/or scan a QR code. */\nexport class RustQrCodeVerifier extends BaseRustVerifer<RustSdkCryptoJs.Qr> implements Verifier {\n    private callbacks: ShowQrCodeCallbacks | null = null;\n\n    public constructor(inner: RustSdkCryptoJs.Qr, outgoingRequestProcessor: OutgoingRequestProcessor) {\n        super(inner, outgoingRequestProcessor);\n    }\n\n    protected onChange(): void {\n        // if the other side has scanned our QR code and sent us a \"reciprocate\" message, it is now time for the\n        // application to prompt the user to confirm their side.\n        if (this.callbacks === null && this.inner.hasBeenScanned()) {\n            this.callbacks = {\n                confirm: (): void => {\n                    this.confirmScanning();\n                },\n                cancel: (): void => this.cancel(),\n            };\n        }\n\n        super.onChange();\n    }\n\n    /**\n     * Start the key verification, if it has not already been started.\n     *\n     * @returns Promise which resolves when the verification has completed, or rejects if the verification is cancelled\n     *    or times out.\n     */\n    public async verify(): Promise<void> {\n        // Some applications (hello, matrix-react-sdk) may not check if there is a `ShowQrCodeCallbacks` and instead\n        // register a `ShowReciprocateQr` listener which they expect to be called once `.verify` is called.\n        if (this.callbacks !== null) {\n            this.emit(VerifierEvent.ShowReciprocateQr, this.callbacks);\n        }\n        // Nothing to do here but wait.\n        await this.completionDeferred.promise;\n    }\n\n    /**\n     * Calculate an appropriate VerificationPhase for a VerificationRequest where this is the verifier.\n     *\n     * This is abnormally complicated because a rust-side QR Code verifier can span several verification phases.\n     */\n    public get verificationPhase(): VerificationPhase {\n        switch (this.inner.state()) {\n            case QrState.Created:\n                // we have created a QR for display; neither side has yet sent an `m.key.verification.start`.\n                return VerificationPhase.Ready;\n            case QrState.Scanned:\n                // other side has scanned our QR and sent an `m.key.verification.start` with `m.reciprocate.v1`\n                return VerificationPhase.Started;\n            case QrState.Confirmed:\n                // we have confirmed the other side's scan and sent an `m.key.verification.done`.\n                //\n                // However, the verification is not yet \"Done\", because we have to wait until we have received the\n                // `m.key.verification.done` from the other side (in particular, we don't mark the device/identity as\n                // verified until that happens). If we return \"Done\" too soon, we risk the user cancelling the flow.\n                return VerificationPhase.Started;\n            case QrState.Reciprocated:\n                // although the rust SDK doesn't immediately send the `m.key.verification.start` on transition into this\n                // state, `RustVerificationRequest.scanQrCode` immediately calls `reciprocate()` and does so, so in practice\n                // we can treat the two the same.\n                return VerificationPhase.Started;\n            case QrState.Done:\n                return VerificationPhase.Done;\n            case QrState.Cancelled:\n                return VerificationPhase.Cancelled;\n            default:\n                throw new Error(`Unknown qr code state ${this.inner.state()}`);\n        }\n    }\n\n    /**\n     * Get the details for reciprocating QR code verification, if one is in progress\n     *\n     * Returns `null`, unless this verifier is for reciprocating a QR-code-based verification (ie, the other user has\n     * already scanned our QR code), and we are waiting for the user to confirm.\n     */\n    public getReciprocateQrCodeCallbacks(): ShowQrCodeCallbacks | null {\n        return this.callbacks;\n    }\n\n    private async confirmScanning(): Promise<void> {\n        const req: undefined | OutgoingRequest = this.inner.confirmScanning();\n        if (req) {\n            await this.outgoingRequestProcessor.makeOutgoingRequest(req);\n        }\n    }\n}\n\n/** A Verifier instance which is used if we are exchanging emojis */\nexport class RustSASVerifier extends BaseRustVerifer<RustSdkCryptoJs.Sas> implements Verifier {\n    private callbacks: ShowSasCallbacks | null = null;\n\n    public constructor(\n        inner: RustSdkCryptoJs.Sas,\n        _verificationRequest: RustVerificationRequest,\n        outgoingRequestProcessor: OutgoingRequestProcessor,\n    ) {\n        super(inner, outgoingRequestProcessor);\n    }\n\n    /**\n     * Start the key verification, if it has not already been started.\n     *\n     * This means sending a `m.key.verification.start` if we are the first responder, or a `m.key.verification.accept`\n     * if the other side has already sent a start event.\n     *\n     * @returns Promise which resolves when the verification has completed, or rejects if the verification is cancelled\n     *    or times out.\n     */\n    public async verify(): Promise<void> {\n        await this.sendAccept();\n        await this.completionDeferred.promise;\n    }\n\n    /**\n     * Send the accept or start event, if it hasn't already been sent\n     */\n    private async sendAccept(): Promise<void> {\n        const req: undefined | OutgoingRequest = this.inner.accept();\n        if (req) {\n            await this.outgoingRequestProcessor.makeOutgoingRequest(req);\n        }\n    }\n\n    /** if we can now show the callbacks, do so */\n    protected onChange(): void {\n        super.onChange();\n\n        if (this.callbacks === null) {\n            const emoji = this.inner.emoji();\n            const decimal = this.inner.decimals();\n\n            if (emoji === undefined && decimal === undefined) {\n                return;\n            }\n\n            const sas: GeneratedSas = {};\n            if (emoji) {\n                sas.emoji = emoji.map((e) => [e.symbol, e.description]);\n            }\n            if (decimal) {\n                sas.decimal = [decimal[0], decimal[1], decimal[2]];\n            }\n\n            this.callbacks = {\n                sas,\n                confirm: async (): Promise<void> => {\n                    const requests: Array<OutgoingRequest> = await this.inner.confirm();\n                    for (const m of requests) {\n                        await this.outgoingRequestProcessor.makeOutgoingRequest(m);\n                    }\n                },\n                mismatch: (): void => {\n                    const request = this.inner.cancelWithCode(\"m.mismatched_sas\");\n                    if (request) {\n                        this.outgoingRequestProcessor.makeOutgoingRequest(request);\n                    }\n                },\n                cancel: (): void => {\n                    const request = this.inner.cancelWithCode(\"m.user\");\n                    if (request) {\n                        this.outgoingRequestProcessor.makeOutgoingRequest(request);\n                    }\n                },\n            };\n            this.emit(VerifierEvent.ShowSas, this.callbacks);\n        }\n    }\n\n    /**\n     * Calculate an appropriate VerificationPhase for a VerificationRequest where this is the verifier.\n     */\n    public get verificationPhase(): VerificationPhase {\n        return VerificationPhase.Started;\n    }\n\n    /**\n     * Get the details for an SAS verification, if one is in progress\n     *\n     * Returns `null`, unless this verifier is for a SAS-based verification and we are waiting for the user to confirm\n     * the SAS matches.\n     */\n    public getShowSasCallbacks(): ShowSasCallbacks | null {\n        return this.callbacks;\n    }\n\n    /**\n     * Replace the inner Rust verifier with a different one.\n     *\n     * @param inner - the new Rust verifier\n     * @internal\n     */\n    public replaceInner(inner: RustSdkCryptoJs.Sas): void {\n        if (this.inner != inner) {\n            this.inner = inner;\n\n            // As with RustVerificationRequest, we need to avoid a reference cycle.\n            // See the comments in RustVerificationRequest.\n            const weakThis = new WeakRef(this);\n            inner.registerChangesCallback(async () => weakThis.deref()?.onChange());\n\n            // replaceInner will only get called if we started the verification at the same time as the other side, and we lost\n            // the tie breaker.  So we need to re-accept their verification.\n            this.sendAccept();\n            this.onChange();\n        }\n    }\n}\n\n/** For each specced verification method, the rust-side `VerificationMethod` corresponding to it */\nconst verificationMethodsByIdentifier: Record<string, RustSdkCryptoJs.VerificationMethod> = {\n    [VerificationMethod.Sas]: RustSdkCryptoJs.VerificationMethod.SasV1,\n    [VerificationMethod.ScanQrCode]: RustSdkCryptoJs.VerificationMethod.QrCodeScanV1,\n    [VerificationMethod.ShowQrCode]: RustSdkCryptoJs.VerificationMethod.QrCodeShowV1,\n    [VerificationMethod.Reciprocate]: RustSdkCryptoJs.VerificationMethod.ReciprocateV1,\n};\n\n/**\n * Convert a specced verification method identifier into a rust-side `VerificationMethod`.\n *\n * @param method - specced method identifier, for example `m.sas.v1`.\n * @returns Rust-side `VerificationMethod` corresponding to `method`.\n * @throws An error if the method is unknown.\n *\n * @internal\n */\nexport function verificationMethodIdentifierToMethod(method: string): RustSdkCryptoJs.VerificationMethod {\n    const meth = verificationMethodsByIdentifier[method];\n    if (meth === undefined) {\n        throw new Error(`Unknown verification method ${method}`);\n    }\n    return meth;\n}\n\n/**\n * Return true if the event's type matches that of an in-room verification event\n *\n * @param event - MatrixEvent\n * @returns\n *\n * @internal\n */\nexport function isVerificationEvent(event: MatrixEvent): boolean {\n    switch (event.getType()) {\n        case EventType.KeyVerificationCancel:\n        case EventType.KeyVerificationDone:\n        case EventType.KeyVerificationMac:\n        case EventType.KeyVerificationStart:\n        case EventType.KeyVerificationKey:\n        case EventType.KeyVerificationReady:\n        case EventType.KeyVerificationAccept:\n            return true;\n        case EventType.RoomMessage:\n            return event.getContent().msgtype === MsgType.KeyVerificationRequest;\n        default:\n            return false;\n    }\n}\n"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAO,KAAKA,eAAe,MAAM,oCAAoC;AACrE,SAASC,OAAO,QAAQ,oCAAoC;AAE5D,SAIIC,iBAAiB,EAEjBC,wBAAwB,EAGxBC,aAAa,QAEV,+BAA+B;AACtC,SAASC,iBAAiB,QAAQ,kCAAkC;AAEpE,SAASC,cAAc,QAAQ,iBAAiB;AAEhD,SAASC,SAAS,EAAEC,OAAO,QAAQ,oBAAoB;AACvD,SAASC,KAAK,QAAmB,aAAa;AAC9C,SAASC,kBAAkB,QAAQ,aAAa;;AAEhD;AACA;AACA;AACA;AACA;AACA,OAAO,MAAMC,uBAAuB,SACxBN,iBAAiB,CAE7B;EAYI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACWO,WAAWA,CACGC,UAAsC,EACtCC,KAA0C,EAC1CC,wBAAkD,EAClDC,4BAAsC,EACzD;IACE,KAAK,CAAC,CAAC;IAAC,KALSH,UAAsC,GAAtCA,UAAsC;IAAA,KACtCC,KAA0C,GAA1CA,KAA0C;IAAA,KAC1CC,wBAAkD,GAAlDA,wBAAkD;IAAA,KAClDC,4BAAsC,GAAtCA,4BAAsC;IAvB3D;IAAAC,eAAA;IAGA;IAAAA,eAAA,qBACqB,KAAK;IAE1B;IAAAA,eAAA,sBACsB,KAAK;IAAAA,eAAA;IAmBvB,IAAI,CAACC,SAAS,GAAG,IAAIZ,cAAc,CAAC,IAAI,CAAC;;IAEzC;IACA;IACA;IACA;IACA;IACA;IACA,IAAMa,QAAQ,GAAG,IAAIC,OAAO,CAAC,IAAI,CAAC;IAClCN,KAAK,CAACO,uBAAuB,cAAAC,iBAAA,CAAC;MAAA,IAAAC,eAAA;MAAA,QAAAA,eAAA,GAAYJ,QAAQ,CAACK,KAAK,CAAC,CAAC,cAAAD,eAAA,uBAAhBA,eAAA,CAAkBE,QAAQ,CAAC,CAAC;IAAA,GAAC;EAC3E;;EAEA;AACJ;AACA;EACYA,QAAQA,CAAA,EAAS;IACrB,IAAMC,YAAkE,GAAG,IAAI,CAACZ,KAAK,CAACa,eAAe,CAAC,CAAC;;IAEvG;IACA;IACA;IACA;IACA;IACA,IAAID,YAAY,YAAY1B,eAAe,CAAC4B,GAAG,EAAE;MAC7C,IAAI,IAAI,CAACC,SAAS,KAAKC,SAAS,IAAI,IAAI,CAACD,SAAS,YAAYE,kBAAkB,EAAE;QAC9E,IAAI,CAACC,WAAW,CAAC,IAAIC,eAAe,CAACP,YAAY,EAAE,IAAI,EAAE,IAAI,CAACX,wBAAwB,CAAC,CAAC;MAC5F,CAAC,MAAM,IAAI,IAAI,CAACc,SAAS,YAAYI,eAAe,EAAE;QAClD,IAAI,CAACJ,SAAS,CAACK,YAAY,CAACR,YAAY,CAAC;MAC7C;IACJ,CAAC,MAAM,IAAIA,YAAY,YAAY1B,eAAe,CAACmC,EAAE,IAAI,IAAI,CAACN,SAAS,KAAKC,SAAS,EAAE;MACnF,IAAI,CAACE,WAAW,CAAC,IAAID,kBAAkB,CAACL,YAAY,EAAE,IAAI,CAACX,wBAAwB,CAAC,CAAC;IACzF;IAEA,IAAI,CAACqB,IAAI,CAACjC,wBAAwB,CAACkC,MAAM,CAAC;EAC9C;EAEQL,WAAWA,CAACM,QAA8C,EAAQ;IACtE;IACA,IAAI,IAAI,CAACT,SAAS,EAAE;MAChB,IAAI,CAACX,SAAS,CAACqB,cAAc,CAAC,IAAI,CAACV,SAAS,EAAE,CAAC1B,wBAAwB,CAACkC,MAAM,CAAC,CAAC;IACpF;IACA,IAAI,CAACR,SAAS,GAAGS,QAAQ;IACzB,IAAI,CAACpB,SAAS,CAACsB,MAAM,CAAC,IAAI,CAACX,SAAS,EAAE,CAAC1B,wBAAwB,CAACkC,MAAM,CAAC,CAAC;EAC5E;;EAEA;AACJ;AACA;AACA;AACA;EACI,IAAWI,aAAaA,CAAA,EAAuB;IAC3C,OAAO,IAAI,CAAC3B,KAAK,CAAC4B,MAAM;EAC5B;;EAEA;AACJ;AACA;AACA;AACA;EACI,IAAWC,MAAMA,CAAA,EAAuB;IAAA,IAAAC,kBAAA;IACpC,QAAAA,kBAAA,GAAO,IAAI,CAAC9B,KAAK,CAAC6B,MAAM,cAAAC,kBAAA,uBAAjBA,kBAAA,CAAmBC,QAAQ,CAAC,CAAC;EACxC;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACI,IAAWC,aAAaA,CAAA,EAAY;IAChC,OAAO,IAAI,CAAChC,KAAK,CAACiC,SAAS,CAAC,CAAC;EACjC;;EAEA;EACA,IAAWC,WAAWA,CAAA,EAAW;IAC7B,OAAO,IAAI,CAAClC,KAAK,CAACkC,WAAW,CAACH,QAAQ,CAAC,CAAC;EAC5C;;EAEA;EACA,IAAWI,aAAaA,CAAA,EAAuB;IAAA,IAAAC,qBAAA;IAC3C,QAAAA,qBAAA,GAAO,IAAI,CAACpC,KAAK,CAACmC,aAAa,cAAAC,qBAAA,uBAAxBA,qBAAA,CAA0BL,QAAQ,CAAC,CAAC;EAC/C;;EAEA;EACcM,cAAcA,CAAA,EAAgD;IAAA,IAAAC,KAAA;IAAA,OAAA9B,iBAAA;MACxE,IAAM2B,aAAa,GAAGG,KAAI,CAACtC,KAAK,CAACmC,aAAa;MAC9C,IAAI,CAACA,aAAa,EAAE;QAChB,OAAOnB,SAAS;MACpB;MACA,aAAasB,KAAI,CAACvC,UAAU,CAACwC,SAAS,CAACD,KAAI,CAACtC,KAAK,CAACkC,WAAW,EAAEC,aAAa,EAAE,CAAC,CAAC;IAAC;EACrF;;EAEA;EACA,IAAWK,kBAAkBA,CAAA,EAAY;IACrC,OAAO,IAAI,CAACxC,KAAK,CAACwC,kBAAkB,CAAC,CAAC;EAC1C;;EAEA;EACA,IAAWC,KAAKA,CAAA,EAAsB;IAClC,IAAMA,KAAK,GAAG,IAAI,CAACzC,KAAK,CAACyC,KAAK,CAAC,CAAC;IAEhC,QAAQA,KAAK;MACT,KAAKvD,eAAe,CAACwD,wBAAwB,CAACC,OAAO;MACrD,KAAKzD,eAAe,CAACwD,wBAAwB,CAACE,SAAS;QACnD,OAAOxD,iBAAiB,CAACwD,SAAS;MACtC,KAAK1D,eAAe,CAACwD,wBAAwB,CAACG,KAAK;QAC/C;QACA;QACA,OAAO,IAAI,CAACC,UAAU,GAAG1D,iBAAiB,CAACwD,SAAS,GAAGxD,iBAAiB,CAACyD,KAAK;MAClF,KAAK3D,eAAe,CAACwD,wBAAwB,CAACK,YAAY;QACtD,IAAI,CAAC,IAAI,CAAChC,SAAS,EAAE;UACjB;UACA,MAAM,IAAIiC,KAAK,CAAC,mEAAmE,CAAC;QACxF;QACA,OAAO,IAAI,CAACjC,SAAS,CAACkC,iBAAiB;MAC3C,KAAK/D,eAAe,CAACwD,wBAAwB,CAACQ,IAAI;QAC9C,OAAO9D,iBAAiB,CAAC8D,IAAI;MACjC,KAAKhE,eAAe,CAACwD,wBAAwB,CAACS,SAAS;QACnD,OAAO/D,iBAAiB,CAAC+D,SAAS;IAC1C;IAEA,MAAM,IAAIH,KAAK,+BAAAI,MAAA,CAA+BX,KAAK,CAAE,CAAC;EAC1D;;EAEA;AACJ;AACA;EACI,IAAWY,OAAOA,CAAA,EAAY;IAC1B,IAAI,IAAI,CAACrD,KAAK,CAACsD,SAAS,CAAC,CAAC,EAAE,OAAO,KAAK;IACxC,IAAMb,KAAK,GAAG,IAAI,CAACA,KAAK;IACxB,OAAOA,KAAK,KAAKrD,iBAAiB,CAAC8D,IAAI,IAAIT,KAAK,KAAKrD,iBAAiB,CAAC+D,SAAS;EACpF;;EAEA;AACJ;AACA;AACA;EACI,IAAWI,SAASA,CAAA,EAAY;IAC5B,OAAO,IAAI,CAACT,UAAU;EAC1B;;EAEA;AACJ;AACA;AACA;EACI,IAAWU,SAASA,CAAA,EAAY;IAC5B,OAAO,IAAI,CAACC,WAAW;EAC3B;;EAEA;AACJ;AACA;AACA;AACA;EACI,IAAWC,OAAOA,CAAA,EAAkB;IAChC,OAAO,IAAI,CAAC1D,KAAK,CAAC2D,mBAAmB,CAAC,CAAC;EAC3C;;EAEA;EACA,IAAWC,OAAOA,CAAA,EAAa;IAC3B,MAAM,IAAIZ,KAAK,CAAC,iBAAiB,CAAC;EACtC;;EAEA;EACA,IAAWa,YAAYA,CAAA,EAAkB;IACrC,IAAI,IAAI,CAACpB,KAAK,KAAKrD,iBAAiB,CAAC0E,OAAO,EAAE,OAAO,IAAI;IAEzD,IAAMlD,YAAkE,GAAG,IAAI,CAACZ,KAAK,CAACa,eAAe,CAAC,CAAC;IACvG,IAAID,YAAY,YAAY1B,eAAe,CAAC4B,GAAG,EAAE;MAC7C,OAAOlB,kBAAkB,CAACkB,GAAG;IACjC,CAAC,MAAM,IAAIF,YAAY,YAAY1B,eAAe,CAACmC,EAAE,EAAE;MACnD,OAAOzB,kBAAkB,CAACmE,WAAW;IACzC,CAAC,MAAM;MACH,OAAO,IAAI;IACf;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWC,wBAAwBA,CAACC,MAAc,EAAW;IACrD,IAAMC,YAA8D,GAAG,IAAI,CAAClE,KAAK,CAACmE,qBAAqB;IACvG,IAAID,YAAY,KAAKlD,SAAS,EAAE;MAC5B;MACA,OAAO,KAAK;IAChB;IAEA,IAAMoD,cAAc,GAAGC,+BAA+B,CAACJ,MAAM,CAAC;IAC9D,OAAOC,YAAY,CAACI,IAAI,CAAEC,CAAC,IAAKA,CAAC,KAAKH,cAAc,CAAC;EACzD;;EAEA;AACJ;AACA;AACA;AACA;EACiBI,MAAMA,CAAA,EAAkB;IAAA,IAAAC,MAAA;IAAA,OAAAjE,iBAAA;MACjC,IAAIiE,MAAI,CAACzE,KAAK,CAACyC,KAAK,CAAC,CAAC,KAAKvD,eAAe,CAACwD,wBAAwB,CAACE,SAAS,IAAI6B,MAAI,CAAC3B,UAAU,EAAE;QAC9F,MAAM,IAAIE,KAAK,kDAAAI,MAAA,CAAkDqB,MAAI,CAAChC,KAAK,CAAE,CAAC;MAClF;MAEAgC,MAAI,CAAC3B,UAAU,GAAG,IAAI;MACtB,IAAI;QACA,IAAM4B,GAAgC,GAAGD,MAAI,CAACzE,KAAK,CAAC2E,iBAAiB,CACjEF,MAAI,CAACvE,4BAA4B,CAAC0E,GAAG,CAACC,oCAAoC,CAC9E,CAAC;QACD,IAAIH,GAAG,EAAE;UACL,MAAMD,MAAI,CAACxE,wBAAwB,CAAC6E,mBAAmB,CAACJ,GAAG,CAAC;QAChE;MACJ,CAAC,SAAS;QACND,MAAI,CAAC3B,UAAU,GAAG,KAAK;MAC3B;;MAEA;MACA2B,MAAI,CAACnD,IAAI,CAACjC,wBAAwB,CAACkC,MAAM,CAAC;IAAC;EAC/C;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACiBwD,MAAMA,CAACC,MAA2C,EAAiB;IAAA,IAAAC,MAAA;IAAA,OAAAzE,iBAAA;MAC5E,IAAIyE,MAAI,CAACxB,WAAW,EAAE;QAClB;QACA;MACJ;MAEAwB,MAAI,CAACxB,WAAW,GAAG,IAAI;MACvB,IAAI;QACA,IAAMiB,GAAgC,GAAGO,MAAI,CAACjF,KAAK,CAAC+E,MAAM,CAAC,CAAC;QAC5D,IAAIL,GAAG,EAAE;UACL,MAAMO,MAAI,CAAChF,wBAAwB,CAAC6E,mBAAmB,CAACJ,GAAG,CAAC;QAChE;MACJ,CAAC,SAAS;QACNO,MAAI,CAACxB,WAAW,GAAG,KAAK;MAC5B;IAAC;EACL;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWyB,oBAAoBA,CAACjB,MAAc,EAAEkB,YAAqD,EAAY;IACzG,MAAM,IAAInC,KAAK,CAAC,iBAAiB,CAAC;EACtC;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACiBoC,iBAAiBA,CAACnB,MAAc,EAAqB;IAAA,IAAAoB,MAAA;IAAA,OAAA7E,iBAAA;MAC9D,IAAIyD,MAAM,KAAKrE,kBAAkB,CAACkB,GAAG,EAAE;QACnC,MAAM,IAAIkC,KAAK,oCAAAI,MAAA,CAAoCa,MAAM,CAAE,CAAC;MAChE;;MAEA;MACA,IAAI,QAAQoB,MAAI,CAAChD,cAAc,CAAC,CAAC,CAAC,EAAE;QAChC,MAAM,IAAIW,KAAK,CAAC,8CAA8C,CAAC;MACnE;MAEA,IAAMsC,GAES,SAASD,MAAI,CAACrF,KAAK,CAACuF,QAAQ,CAAC,CAAC;MAE7C,IAAID,GAAG,EAAE;QACL,IAAM,GAAGZ,GAAG,CAAC,GAAGY,GAAG;QACnB,MAAMD,MAAI,CAACpF,wBAAwB,CAAC6E,mBAAmB,CAACJ,GAAG,CAAC;MAChE;;MAEA;MACA,IAAI,CAACW,MAAI,CAACtE,SAAS,EAAE;QACjB,MAAM,IAAIiC,KAAK,CAAC,yCAAyC,CAAC;MAC9D;MAEA,OAAOqC,MAAI,CAACtE,SAAS;IAAC;EAC1B;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACiByE,UAAUA,CAACC,UAAsB,EAAqB;IAAA,IAAAC,MAAA;IAAA,OAAAlF,iBAAA;MAC/D,IAAMmF,IAAI,GAAGzG,eAAe,CAAC0G,UAAU,CAACC,SAAS,CAAC,IAAIC,iBAAiB,CAACL,UAAU,CAAC,CAAC;MACpF,IAAMjE,QAA4B,SAASkE,MAAI,CAAC1F,KAAK,CAAC+F,UAAU,CAACJ,IAAI,CAAC;;MAEtE;MACA,IAAI,CAACD,MAAI,CAAC3E,SAAS,EAAE;QACjB,MAAM,IAAIiC,KAAK,CAAC,2CAA2C,CAAC;MAChE;;MAEA;MACA,IAAM0B,GAAgC,GAAGlD,QAAQ,CAACwE,WAAW,CAAC,CAAC;MAC/D,IAAItB,GAAG,EAAE;QACL,MAAMgB,MAAI,CAACzF,wBAAwB,CAAC6E,mBAAmB,CAACJ,GAAG,CAAC;MAChE;MAEA,OAAOgB,MAAI,CAAC3E,SAAS;IAAC;EAC1B;;EAEA;AACJ;AACA;AACA;EACI,IAAWS,QAAQA,CAAA,EAAyB;IACxC;IACA;IACA;IACA;IACA;IACA;IACA,OAAO,IAAI,CAACiB,KAAK,KAAKrD,iBAAiB,CAAC0E,OAAO,GAAG,IAAI,CAAC/C,SAAS,GAAGC,SAAS;EAChF;;EAEA;AACJ;AACA;EACWiF,cAAcA,CAAA,EAAuB;IACxC,MAAM,IAAIjD,KAAK,CAAC,4EAA4E,CAAC;EACjG;;EAEA;AACJ;AACA;AACA;AACA;EACiBkD,cAAcA,CAAA,EAAgC;IAAA,IAAAC,MAAA;IAAA,OAAA3F,iBAAA;MACvD;MACA,IAAI,QAAQ2F,MAAI,CAAC9D,cAAc,CAAC,CAAC,CAAC,EAAE;QAChC,MAAM,IAAIW,KAAK,CAAC,2CAA2C,CAAC;MAChE;MAEA,IAAMoD,aAA6C,SAASD,MAAI,CAACnG,KAAK,CAACqG,cAAc,CAAC,CAAC;MACvF;MACA,IAAI,CAACD,aAAa,EAAE;MAEpB,OAAOE,MAAM,CAACC,IAAI,CAACH,aAAa,CAACI,OAAO,CAAC,CAAC,CAAC;IAAC;EAChD;;EAEA;AACJ;AACA;AACA;EACI,IAAWC,gBAAgBA,CAAA,EAAkB;IAAA,IAAAC,qBAAA,EAAAC,sBAAA;IACzC,QAAAD,qBAAA,IAAAC,sBAAA,GAAO,IAAI,CAAC3G,KAAK,CAAC4G,UAAU,cAAAD,sBAAA,uBAArBA,sBAAA,CAAuBE,UAAU,CAAC,CAAC,cAAAH,qBAAA,cAAAA,qBAAA,GAAI,IAAI;EACtD;;EAEA;AACJ;AACA;AACA;AACA;EACI,IAAWI,gBAAgBA,CAAA,EAAuB;IAC9C,IAAMF,UAAU,GAAG,IAAI,CAAC5G,KAAK,CAAC4G,UAAU;IACxC,IAAI,CAACA,UAAU,EAAE;MACb,OAAO5F,SAAS;IACpB,CAAC,MAAM,IAAI4F,UAAU,CAACG,aAAa,CAAC,CAAC,EAAE;MACnC,OAAO,IAAI,CAAChH,UAAU,CAACiH,MAAM,CAACjF,QAAQ,CAAC,CAAC;IAC5C,CAAC,MAAM;MACH,OAAO,IAAI,CAAC/B,KAAK,CAACkC,WAAW,CAACH,QAAQ,CAAC,CAAC;IAC5C;EACJ;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAekF,eAAe,SAAqE1H,iBAAiB,CAGlH;EAISO,WAAWA,CACJE,KAAgB,EACPC,wBAAkD,EACvE;IACE,KAAK,CAAC,CAAC;IAAC,KAHED,KAAgB,GAAhBA,KAAgB;IAAA,KACPC,wBAAkD,GAAlDA,wBAAkD;IALzE;IAAAE,eAAA;IASI,IAAI,CAAC+G,kBAAkB,GAAGvH,KAAK,CAAC,CAAC;;IAEjC;IACA;IACA,IAAMU,QAAQ,GAAG,IAAIC,OAAO,CAAC,IAAI,CAAC;IAClCN,KAAK,CAACO,uBAAuB,cAAAC,iBAAA,CAAC;MAAA,IAAA2G,gBAAA;MAAA,QAAAA,gBAAA,GAAY9G,QAAQ,CAACK,KAAK,CAAC,CAAC,cAAAyG,gBAAA,uBAAhBA,gBAAA,CAAkBxG,QAAQ,CAAC,CAAC;IAAA,GAAC;;IAEvE;IACA,IAAI,CAACuG,kBAAkB,CAACE,OAAO,CAACC,KAAK,CAAC,MAAM,IAAI,CAAC;EACrD;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACc1G,QAAQA,CAAA,EAAS;IACvB,IAAI,IAAI,CAACX,KAAK,CAACsH,MAAM,CAAC,CAAC,EAAE;MACrB,IAAI,CAACJ,kBAAkB,CAACK,OAAO,CAACvG,SAAS,CAAC;IAC9C,CAAC,MAAM,IAAI,IAAI,CAAChB,KAAK,CAACwH,WAAW,CAAC,CAAC,EAAE;MACjC,IAAMZ,UAAU,GAAG,IAAI,CAAC5G,KAAK,CAAC4G,UAAU,CAAC,CAAE;MAC3C,IAAI,CAACM,kBAAkB,CAACO,MAAM,CAC1B,IAAIzE,KAAK,8BAAAI,MAAA,CAEDwD,UAAU,CAACG,aAAa,CAAC,CAAC,GAAG,IAAI,GAAG,MAAM,iBAAA3D,MAAA,CAChCwD,UAAU,CAACC,UAAU,CAAC,CAAC,QAAAzD,MAAA,CAAKwD,UAAU,CAACc,MAAM,CAAC,CAAC,CACjE,CACJ,CAAC;IACL;IAEA,IAAI,CAACpG,IAAI,CAACjC,wBAAwB,CAACkC,MAAM,CAAC;EAC9C;;EAEA;AACJ;AACA;EACI,IAAWoG,gBAAgBA,CAAA,EAAY;IACnC,OAAO,IAAI,CAAC3H,KAAK,CAACwH,WAAW,CAAC,CAAC;EACnC;;EAEA;AACJ;AACA;EACI,IAAWR,MAAMA,CAAA,EAAW;IACxB,OAAO,IAAI,CAAChH,KAAK,CAACkC,WAAW,CAACH,QAAQ,CAAC,CAAC;EAC5C;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACWgD,MAAMA,CAAC6C,CAAS,EAAQ;IAC3B;IACA,IAAMlD,GAAgC,GAAG,IAAI,CAAC1E,KAAK,CAAC+E,MAAM,CAAC,CAAC;IAC5D,IAAIL,GAAG,EAAE;MACL,IAAI,CAACzE,wBAAwB,CAAC6E,mBAAmB,CAACJ,GAAG,CAAC;IAC1D;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWmD,mBAAmBA,CAAA,EAA4B;IAClD,OAAO,IAAI;EACf;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWC,6BAA6BA,CAAA,EAA+B;IAC/D,OAAO,IAAI;EACf;AACJ;;AAEA;AACA,OAAO,MAAM7G,kBAAkB,SAASgG,eAAe,CAAyC;EAGrFnH,WAAWA,CAACE,KAAyB,EAAEC,wBAAkD,EAAE;IAC9F,KAAK,CAACD,KAAK,EAAEC,wBAAwB,CAAC;IAACE,eAAA,oBAHK,IAAI;EAIpD;EAEUQ,QAAQA,CAAA,EAAS;IACvB;IACA;IACA,IAAI,IAAI,CAACoH,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC/H,KAAK,CAACgI,cAAc,CAAC,CAAC,EAAE;MACxD,IAAI,CAACD,SAAS,GAAG;QACbE,OAAO,EAAEA,CAAA,KAAY;UACjB,IAAI,CAACC,eAAe,CAAC,CAAC;QAC1B,CAAC;QACDnD,MAAM,EAAEA,CAAA,KAAY,IAAI,CAACA,MAAM,CAAC;MACpC,CAAC;IACL;IAEA,KAAK,CAACpE,QAAQ,CAAC,CAAC;EACpB;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACiBwH,MAAMA,CAAA,EAAkB;IAAA,IAAAC,MAAA;IAAA,OAAA5H,iBAAA;MACjC;MACA;MACA,IAAI4H,MAAI,CAACL,SAAS,KAAK,IAAI,EAAE;QACzBK,MAAI,CAAC9G,IAAI,CAAChC,aAAa,CAAC+I,iBAAiB,EAAED,MAAI,CAACL,SAAS,CAAC;MAC9D;MACA;MACA,MAAMK,MAAI,CAAClB,kBAAkB,CAACE,OAAO;IAAC;EAC1C;;EAEA;AACJ;AACA;AACA;AACA;EACI,IAAWnE,iBAAiBA,CAAA,EAAsB;IAC9C,QAAQ,IAAI,CAACjD,KAAK,CAACsI,KAAK,CAAC,CAAC;MACtB,KAAKnJ,OAAO,CAACwD,OAAO;QAChB;QACA,OAAOvD,iBAAiB,CAACyD,KAAK;MAClC,KAAK1D,OAAO,CAACoJ,OAAO;QAChB;QACA,OAAOnJ,iBAAiB,CAAC0E,OAAO;MACpC,KAAK3E,OAAO,CAACqJ,SAAS;QAClB;QACA;QACA;QACA;QACA;QACA,OAAOpJ,iBAAiB,CAAC0E,OAAO;MACpC,KAAK3E,OAAO,CAACsJ,YAAY;QACrB;QACA;QACA;QACA,OAAOrJ,iBAAiB,CAAC0E,OAAO;MACpC,KAAK3E,OAAO,CAAC+D,IAAI;QACb,OAAO9D,iBAAiB,CAAC8D,IAAI;MACjC,KAAK/D,OAAO,CAACgE,SAAS;QAClB,OAAO/D,iBAAiB,CAAC+D,SAAS;MACtC;QACI,MAAM,IAAIH,KAAK,0BAAAI,MAAA,CAA0B,IAAI,CAACpD,KAAK,CAACsI,KAAK,CAAC,CAAC,CAAE,CAAC;IACtE;EACJ;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWR,6BAA6BA,CAAA,EAA+B;IAC/D,OAAO,IAAI,CAACC,SAAS;EACzB;EAEcG,eAAeA,CAAA,EAAkB;IAAA,IAAAQ,MAAA;IAAA,OAAAlI,iBAAA;MAC3C,IAAMkE,GAAgC,GAAGgE,MAAI,CAAC1I,KAAK,CAACkI,eAAe,CAAC,CAAC;MACrE,IAAIxD,GAAG,EAAE;QACL,MAAMgE,MAAI,CAACzI,wBAAwB,CAAC6E,mBAAmB,CAACJ,GAAG,CAAC;MAChE;IAAC;EACL;AACJ;;AAEA;AACA,OAAO,MAAMvD,eAAe,SAAS8F,eAAe,CAA0C;EAGnFnH,WAAWA,CACdE,KAA0B,EAC1B2I,oBAA6C,EAC7C1I,wBAAkD,EACpD;IACE,KAAK,CAACD,KAAK,EAAEC,wBAAwB,CAAC;IAACE,eAAA,oBAPE,IAAI;EAQjD;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACiBgI,MAAMA,CAAA,EAAkB;IAAA,IAAAS,MAAA;IAAA,OAAApI,iBAAA;MACjC,MAAMoI,MAAI,CAACC,UAAU,CAAC,CAAC;MACvB,MAAMD,MAAI,CAAC1B,kBAAkB,CAACE,OAAO;IAAC;EAC1C;;EAEA;AACJ;AACA;EACkByB,UAAUA,CAAA,EAAkB;IAAA,IAAAC,OAAA;IAAA,OAAAtI,iBAAA;MACtC,IAAMkE,GAAgC,GAAGoE,OAAI,CAAC9I,KAAK,CAACwE,MAAM,CAAC,CAAC;MAC5D,IAAIE,GAAG,EAAE;QACL,MAAMoE,OAAI,CAAC7I,wBAAwB,CAAC6E,mBAAmB,CAACJ,GAAG,CAAC;MAChE;IAAC;EACL;;EAEA;EACU/D,QAAQA,CAAA,EAAS;IAAA,IAAAoI,OAAA;IACvB,KAAK,CAACpI,QAAQ,CAAC,CAAC;IAEhB,IAAI,IAAI,CAACoH,SAAS,KAAK,IAAI,EAAE;MACzB,IAAMiB,KAAK,GAAG,IAAI,CAAChJ,KAAK,CAACgJ,KAAK,CAAC,CAAC;MAChC,IAAMC,OAAO,GAAG,IAAI,CAACjJ,KAAK,CAACkJ,QAAQ,CAAC,CAAC;MAErC,IAAIF,KAAK,KAAKhI,SAAS,IAAIiI,OAAO,KAAKjI,SAAS,EAAE;QAC9C;MACJ;MAEA,IAAMmI,GAAiB,GAAG,CAAC,CAAC;MAC5B,IAAIH,KAAK,EAAE;QACPG,GAAG,CAACH,KAAK,GAAGA,KAAK,CAACpE,GAAG,CAAEgD,CAAC,IAAK,CAACA,CAAC,CAACwB,MAAM,EAAExB,CAAC,CAACyB,WAAW,CAAC,CAAC;MAC3D;MACA,IAAIJ,OAAO,EAAE;QACTE,GAAG,CAACF,OAAO,GAAG,CAACA,OAAO,CAAC,CAAC,CAAC,EAAEA,OAAO,CAAC,CAAC,CAAC,EAAEA,OAAO,CAAC,CAAC,CAAC,CAAC;MACtD;MAEA,IAAI,CAAClB,SAAS,GAAG;QACboB,GAAG;QACHlB,OAAO;UAAA,IAAAqB,QAAA,GAAA9I,iBAAA,CAAE,aAA2B;YAChC,IAAM+I,QAAgC,SAASR,OAAI,CAAC/I,KAAK,CAACiI,OAAO,CAAC,CAAC;YACnE,KAAK,IAAM1D,CAAC,IAAIgF,QAAQ,EAAE;cACtB,MAAMR,OAAI,CAAC9I,wBAAwB,CAAC6E,mBAAmB,CAACP,CAAC,CAAC;YAC9D;UACJ,CAAC;UAAA,SALD0D,OAAOA,CAAA;YAAA,OAAAqB,QAAA,CAAAE,KAAA,OAAAC,SAAA;UAAA;UAAA,OAAPxB,OAAO;QAAA,GAKN;QACDyB,QAAQ,EAAEA,CAAA,KAAY;UAClB,IAAMC,OAAO,GAAG,IAAI,CAAC3J,KAAK,CAAC4J,cAAc,CAAC,kBAAkB,CAAC;UAC7D,IAAID,OAAO,EAAE;YACT,IAAI,CAAC1J,wBAAwB,CAAC6E,mBAAmB,CAAC6E,OAAO,CAAC;UAC9D;QACJ,CAAC;QACD5E,MAAM,EAAEA,CAAA,KAAY;UAChB,IAAM4E,OAAO,GAAG,IAAI,CAAC3J,KAAK,CAAC4J,cAAc,CAAC,QAAQ,CAAC;UACnD,IAAID,OAAO,EAAE;YACT,IAAI,CAAC1J,wBAAwB,CAAC6E,mBAAmB,CAAC6E,OAAO,CAAC;UAC9D;QACJ;MACJ,CAAC;MACD,IAAI,CAACrI,IAAI,CAAChC,aAAa,CAACuK,OAAO,EAAE,IAAI,CAAC9B,SAAS,CAAC;IACpD;EACJ;;EAEA;AACJ;AACA;EACI,IAAW9E,iBAAiBA,CAAA,EAAsB;IAC9C,OAAO7D,iBAAiB,CAAC0E,OAAO;EACpC;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACW+D,mBAAmBA,CAAA,EAA4B;IAClD,OAAO,IAAI,CAACE,SAAS;EACzB;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACW3G,YAAYA,CAACpB,KAA0B,EAAQ;IAClD,IAAI,IAAI,CAACA,KAAK,IAAIA,KAAK,EAAE;MACrB,IAAI,CAACA,KAAK,GAAGA,KAAK;;MAElB;MACA;MACA,IAAMK,QAAQ,GAAG,IAAIC,OAAO,CAAC,IAAI,CAAC;MAClCN,KAAK,CAACO,uBAAuB,cAAAC,iBAAA,CAAC;QAAA,IAAAsJ,gBAAA;QAAA,QAAAA,gBAAA,GAAYzJ,QAAQ,CAACK,KAAK,CAAC,CAAC,cAAAoJ,gBAAA,uBAAhBA,gBAAA,CAAkBnJ,QAAQ,CAAC,CAAC;MAAA,GAAC;;MAEvE;MACA;MACA,IAAI,CAACkI,UAAU,CAAC,CAAC;MACjB,IAAI,CAAClI,QAAQ,CAAC,CAAC;IACnB;EACJ;AACJ;;AAEA;AACA,IAAM0D,+BAAmF,GAAG;EACxF,CAACzE,kBAAkB,CAACkB,GAAG,GAAG5B,eAAe,CAACU,kBAAkB,CAACmK,KAAK;EAClE,CAACnK,kBAAkB,CAACoK,UAAU,GAAG9K,eAAe,CAACU,kBAAkB,CAACqK,YAAY;EAChF,CAACrK,kBAAkB,CAACsK,UAAU,GAAGhL,eAAe,CAACU,kBAAkB,CAACuK,YAAY;EAChF,CAACvK,kBAAkB,CAACmE,WAAW,GAAG7E,eAAe,CAACU,kBAAkB,CAACwK;AACzE,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASvF,oCAAoCA,CAACZ,MAAc,EAAsC;EACrG,IAAMoG,IAAI,GAAGhG,+BAA+B,CAACJ,MAAM,CAAC;EACpD,IAAIoG,IAAI,KAAKrJ,SAAS,EAAE;IACpB,MAAM,IAAIgC,KAAK,gCAAAI,MAAA,CAAgCa,MAAM,CAAE,CAAC;EAC5D;EACA,OAAOoG,IAAI;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,mBAAmBA,CAACC,KAAkB,EAAW;EAC7D,QAAQA,KAAK,CAACC,OAAO,CAAC,CAAC;IACnB,KAAK/K,SAAS,CAACgL,qBAAqB;IACpC,KAAKhL,SAAS,CAACiL,mBAAmB;IAClC,KAAKjL,SAAS,CAACkL,kBAAkB;IACjC,KAAKlL,SAAS,CAACmL,oBAAoB;IACnC,KAAKnL,SAAS,CAACoL,kBAAkB;IACjC,KAAKpL,SAAS,CAACqL,oBAAoB;IACnC,KAAKrL,SAAS,CAACsL,qBAAqB;MAChC,OAAO,IAAI;IACf,KAAKtL,SAAS,CAACuL,WAAW;MACtB,OAAOT,KAAK,CAACU,UAAU,CAAC,CAAC,CAACC,OAAO,KAAKxL,OAAO,CAACyL,sBAAsB;IACxE;MACI,OAAO,KAAK;EACpB;AACJ","ignoreList":[]}

package/lib/scheduler.d.ts

@@ -0,0 +1,132 @@
+import { MatrixEvent } from "./models/event.ts";
+import { MatrixError } from "./http-api/index.ts";
+import { ISendEventResponse } from "./@types/requests.ts";
+/**
+ * The function to invoke to process (send) events in the queue.
+ * @param event - The event to send.
+ * @returns Resolved/rejected depending on the outcome of the request.
+ */
+type ProcessFunction<T> = (event: MatrixEvent) => Promise<T>;
+export declare class MatrixScheduler<T = ISendEventResponse> {
+    /**
+     * The retry algorithm to apply when retrying events. To stop retrying, return
+     * `-1`. If this event was part of a queue, it will be removed from
+     * the queue.
+     * @param event - The event being retried.
+     * @param attempts - The number of failed attempts. This will always be \>= 1.
+     * @param err - The most recent error message received when trying
+     * to send this event.
+     * @returns The number of milliseconds to wait before trying again. If
+     * this is 0, the request will be immediately retried. If this is
+     * `-1`, the event will be marked as
+     * {@link EventStatus.NOT_SENT} and will not be retried.
+     */
+    readonly retryAlgorithm: typeof MatrixScheduler.RETRY_BACKOFF_RATELIMIT;
+    /**
+     * The queuing algorithm to apply to events. This function must be idempotent as
+     * it may be called multiple times with the same event. All queues created are
+     * serviced in a FIFO manner. To send the event ASAP, return `null`
+     * which will not put this event in a queue. Events that fail to send that form
+     * part of a queue will be removed from the queue and the next event in the
+     * queue will be sent.
+     * @param event - The event to be sent.
+     * @returns The name of the queue to put the event into. If a queue with
+     * this name does not exist, it will be created. If this is `null`,
+     * the event is not put into a queue and will be sent concurrently.
+     */
+    readonly queueAlgorithm: typeof MatrixScheduler.QUEUE_MESSAGES;
+    /**
+     * Default retry algorithm for the matrix scheduler. Retries events up to 4 times with exponential backoff.
+     * @param attempts - Number of attempts that have been made, including the one that just failed (ie. starting at 1)
+     * @see retryAlgorithm
+     */
+    static RETRY_BACKOFF_RATELIMIT(event: MatrixEvent | null, attempts: number, err: MatrixError): number;
+    /**
+     * Queues `m.room.message` events and lets other events continue
+     * concurrently.
+     * @see queueAlgorithm
+     */
+    static QUEUE_MESSAGES(event: MatrixEvent): string | null;
+    private readonly queues;
+    private activeQueues;
+    private procFn;
+    /**
+     * Construct a scheduler for Matrix. Requires
+     * {@link MatrixScheduler#setProcessFunction} to be provided
+     * with a way of processing events.
+     * @param retryAlgorithm - Optional. The retry
+     * algorithm to apply when determining when to try to send an event again.
+     * Defaults to {@link MatrixScheduler.RETRY_BACKOFF_RATELIMIT}.
+     * @param queueAlgorithm - Optional. The queuing
+     * algorithm to apply when determining which events should be sent before the
+     * given event. Defaults to {@link MatrixScheduler.QUEUE_MESSAGES}.
+     */
+    constructor(
+    /**
+     * The retry algorithm to apply when retrying events. To stop retrying, return
+     * `-1`. If this event was part of a queue, it will be removed from
+     * the queue.
+     * @param event - The event being retried.
+     * @param attempts - The number of failed attempts. This will always be \>= 1.
+     * @param err - The most recent error message received when trying
+     * to send this event.
+     * @returns The number of milliseconds to wait before trying again. If
+     * this is 0, the request will be immediately retried. If this is
+     * `-1`, the event will be marked as
+     * {@link EventStatus.NOT_SENT} and will not be retried.
+     */
+    retryAlgorithm?: typeof MatrixScheduler.RETRY_BACKOFF_RATELIMIT, 
+    /**
+     * The queuing algorithm to apply to events. This function must be idempotent as
+     * it may be called multiple times with the same event. All queues created are
+     * serviced in a FIFO manner. To send the event ASAP, return `null`
+     * which will not put this event in a queue. Events that fail to send that form
+     * part of a queue will be removed from the queue and the next event in the
+     * queue will be sent.
+     * @param event - The event to be sent.
+     * @returns The name of the queue to put the event into. If a queue with
+     * this name does not exist, it will be created. If this is `null`,
+     * the event is not put into a queue and will be sent concurrently.
+     */
+    queueAlgorithm?: typeof MatrixScheduler.QUEUE_MESSAGES);
+    /**
+     * Retrieve a queue based on an event. The event provided does not need to be in
+     * the queue.
+     * @param event - An event to get the queue for.
+     * @returns A shallow copy of events in the queue or null.
+     * Modifying this array will not modify the list itself. Modifying events in
+     * this array <i>will</i> modify the underlying event in the queue.
+     * @see MatrixScheduler.removeEventFromQueue To remove an event from the queue.
+     */
+    getQueueForEvent(event: MatrixEvent): MatrixEvent[] | null;
+    /**
+     * Remove this event from the queue. The event is equal to another event if they
+     * have the same ID returned from event.getId().
+     * @param event - The event to remove.
+     * @returns True if this event was removed.
+     */
+    removeEventFromQueue(event: MatrixEvent): boolean;
+    /**
+     * Set the process function. Required for events in the queue to be processed.
+     * If set after events have been added to the queue, this will immediately start
+     * processing them.
+     * @param fn - The function that can process events
+     * in the queue.
+     */
+    setProcessFunction(fn: ProcessFunction<T>): void;
+    /**
+     * Queue an event if it is required and start processing queues.
+     * @param event - The event that may be queued.
+     * @returns A promise if the event was queued, which will be
+     * resolved or rejected in due time, else null.
+     */
+    queueEvent(event: MatrixEvent): Promise<T> | null;
+    private startProcessingQueues;
+    private processQueue;
+    private disableQueue;
+    private clearQueue;
+    private peekNextEvent;
+    private removeNextEvent;
+}
+export {};
+//# sourceMappingURL=scheduler.d.ts.map

package/lib/scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAqBA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,EAAyB,WAAW,EAAE,MAAM,qBAAqB,CAAC;AACzE,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAU1D;;;;GAIG;AACH,KAAK,eAAe,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC;AAG7D,qBAAa,eAAe,CAAC,CAAC,GAAG,kBAAkB;IAgD3C;;;;;;;;;;;;OAYG;aACa,cAAc;IAC9B;;;;;;;;;;;OAWG;aACa,cAAc;IAzElC;;;;OAIG;WAEW,uBAAuB,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,GAAG,MAAM;IAI5G;;;;OAIG;WAEW,cAAc,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,GAAG,IAAI;IAe/D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAwC;IAC/D,OAAO,CAAC,YAAY,CAAgB;IACpC,OAAO,CAAC,MAAM,CAAmC;IAEjD;;;;;;;;;;OAUG;;IAEC;;;;;;;;;;;;OAYG;IACa,cAAc,iDAA0C;IACxE;;;;;;;;;;;OAWG;IACa,cAAc,wCAAiC;IAGnE;;;;;;;;OAQG;IACI,gBAAgB,CAAC,KAAK,EAAE,WAAW,GAAG,WAAW,EAAE,GAAG,IAAI;IAUjE;;;;;OAKG;IACI,oBAAoB,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO;IAkBxD;;;;;;OAMG;IACI,kBAAkB,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,IAAI;IAKvD;;;;;OAKG;IACI,UAAU,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAoBxD,OAAO,CAAC,qBAAqB;IAgB7B,OAAO,CAAC,YAAY,CAiDlB;IAEF,OAAO,CAAC,YAAY;IASpB,OAAO,CAAC,UAAU;IASlB,OAAO,CAAC,aAAa;IAQrB,OAAO,CAAC,eAAe;CAO1B"}

package/lib/scheduler.js

@@ -0,0 +1,259 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+/*
+Copyright 2015 - 2021 The Matrix.org Foundation C.I.C.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+/**
+ * This is an internal module which manages queuing, scheduling and retrying
+ * of requests.
+ */
+import { logger } from "./logger.js";
+import { EventType } from "./@types/event.js";
+import { defer, removeElement } from "./utils.js";
+import { calculateRetryBackoff } from "./http-api/index.js";
+var DEBUG = false; // set true to enable console logging.
+
+/**
+ * The function to invoke to process (send) events in the queue.
+ * @param event - The event to send.
+ * @returns Resolved/rejected depending on the outcome of the request.
+ */
+
+// eslint-disable-next-line camelcase
+export class MatrixScheduler {
+  /**
+   * Default retry algorithm for the matrix scheduler. Retries events up to 4 times with exponential backoff.
+   * @param attempts - Number of attempts that have been made, including the one that just failed (ie. starting at 1)
+   * @see retryAlgorithm
+   */
+  // eslint-disable-next-line @typescript-eslint/naming-convention
+  static RETRY_BACKOFF_RATELIMIT(event, attempts, err) {
+    return calculateRetryBackoff(err, attempts, false);
+  }
+
+  /**
+   * Queues `m.room.message` events and lets other events continue
+   * concurrently.
+   * @see queueAlgorithm
+   */
+  // eslint-disable-next-line @typescript-eslint/naming-convention
+  static QUEUE_MESSAGES(event) {
+    // enqueue messages or events that associate with another event (redactions and relations)
+    if (event.getType() === EventType.RoomMessage || event.hasAssociation()) {
+      // put these events in the 'message' queue.
+      return "message";
+    }
+    // allow all other events continue concurrently.
+    return null;
+  }
+
+  // queueName: [{
+  //  event: MatrixEvent,  // event to send
+  //  defer: Deferred,  // defer to resolve/reject at the END of the retries
+  //  attempts: Number  // number of times we've called processFn
+  // }, ...]
+
+  /**
+   * Construct a scheduler for Matrix. Requires
+   * {@link MatrixScheduler#setProcessFunction} to be provided
+   * with a way of processing events.
+   * @param retryAlgorithm - Optional. The retry
+   * algorithm to apply when determining when to try to send an event again.
+   * Defaults to {@link MatrixScheduler.RETRY_BACKOFF_RATELIMIT}.
+   * @param queueAlgorithm - Optional. The queuing
+   * algorithm to apply when determining which events should be sent before the
+   * given event. Defaults to {@link MatrixScheduler.QUEUE_MESSAGES}.
+   */
+  constructor() {
+    var retryAlgorithm = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : MatrixScheduler.RETRY_BACKOFF_RATELIMIT;
+    var queueAlgorithm = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : MatrixScheduler.QUEUE_MESSAGES;
+    this.retryAlgorithm = retryAlgorithm;
+    this.queueAlgorithm = queueAlgorithm;
+    _defineProperty(this, "queues", {});
+    _defineProperty(this, "activeQueues", []);
+    _defineProperty(this, "procFn", null);
+    _defineProperty(this, "processQueue", queueName => {
+      // get head of queue
+      var obj = this.peekNextEvent(queueName);
+      if (!obj) {
+        this.disableQueue(queueName);
+        return;
+      }
+      debuglog("Queue '%s' has %s pending events", queueName, this.queues[queueName].length);
+      // fire the process function and if it resolves, resolve the deferred. Else
+      // invoke the retry algorithm.
+
+      // First wait for a resolved promise, so the resolve handlers for
+      // the deferred of the previously sent event can run.
+      // This way enqueued relations/redactions to enqueued events can receive
+      // the remove id of their target before being sent.
+      Promise.resolve().then(() => {
+        return this.procFn(obj.event);
+      }).then(res => {
+        // remove this from the queue
+        this.removeNextEvent(queueName);
+        debuglog("Queue '%s' sent event %s", queueName, obj.event.getId());
+        obj.defer.resolve(res);
+        // keep processing
+        this.processQueue(queueName);
+      }, err => {
+        obj.attempts += 1;
+        // ask the retry algorithm when/if we should try again
+        var waitTimeMs = this.retryAlgorithm(obj.event, obj.attempts, err);
+        debuglog("retry(%s) err=%s event_id=%s waitTime=%s", obj.attempts, err, obj.event.getId(), waitTimeMs);
+        if (waitTimeMs === -1) {
+          // give up (you quitter!)
+          logger.info("Queue '%s' giving up on event %s", queueName, obj.event.getId());
+          // remove this from the queue
+          this.clearQueue(queueName, err);
+        } else {
+          setTimeout(this.processQueue, waitTimeMs, queueName);
+        }
+      });
+    });
+  }
+
+  /**
+   * Retrieve a queue based on an event. The event provided does not need to be in
+   * the queue.
+   * @param event - An event to get the queue for.
+   * @returns A shallow copy of events in the queue or null.
+   * Modifying this array will not modify the list itself. Modifying events in
+   * this array <i>will</i> modify the underlying event in the queue.
+   * @see MatrixScheduler.removeEventFromQueue To remove an event from the queue.
+   */
+  getQueueForEvent(event) {
+    var name = this.queueAlgorithm(event);
+    if (!name || !this.queues[name]) {
+      return null;
+    }
+    return this.queues[name].map(function (obj) {
+      return obj.event;
+    });
+  }
+
+  /**
+   * Remove this event from the queue. The event is equal to another event if they
+   * have the same ID returned from event.getId().
+   * @param event - The event to remove.
+   * @returns True if this event was removed.
+   */
+  removeEventFromQueue(event) {
+    var name = this.queueAlgorithm(event);
+    if (!name || !this.queues[name]) {
+      return false;
+    }
+    var removed = false;
+    removeElement(this.queues[name], element => {
+      if (element.event.getId() === event.getId()) {
+        // XXX we should probably reject the promise?
+        // https://github.com/matrix-org/matrix-js-sdk/issues/496
+        removed = true;
+        return true;
+      }
+      return false;
+    });
+    return removed;
+  }
+
+  /**
+   * Set the process function. Required for events in the queue to be processed.
+   * If set after events have been added to the queue, this will immediately start
+   * processing them.
+   * @param fn - The function that can process events
+   * in the queue.
+   */
+  setProcessFunction(fn) {
+    this.procFn = fn;
+    this.startProcessingQueues();
+  }
+
+  /**
+   * Queue an event if it is required and start processing queues.
+   * @param event - The event that may be queued.
+   * @returns A promise if the event was queued, which will be
+   * resolved or rejected in due time, else null.
+   */
+  queueEvent(event) {
+    var queueName = this.queueAlgorithm(event);
+    if (!queueName) {
+      return null;
+    }
+    // add the event to the queue and make a deferred for it.
+    if (!this.queues[queueName]) {
+      this.queues[queueName] = [];
+    }
+    var deferred = defer();
+    this.queues[queueName].push({
+      event: event,
+      defer: deferred,
+      attempts: 0
+    });
+    debuglog("Queue algorithm dumped event %s into queue '%s'", event.getId(), queueName);
+    this.startProcessingQueues();
+    return deferred.promise;
+  }
+  startProcessingQueues() {
+    if (!this.procFn) return;
+    // for each inactive queue with events in them
+    Object.keys(this.queues).filter(queueName => {
+      return this.activeQueues.indexOf(queueName) === -1 && this.queues[queueName].length > 0;
+    }).forEach(queueName => {
+      // mark the queue as active
+      this.activeQueues.push(queueName);
+      // begin processing the head of the queue
+      debuglog("Spinning up queue: '%s'", queueName);
+      this.processQueue(queueName);
+    });
+  }
+  disableQueue(queueName) {
+    // queue is empty. Mark as inactive and stop recursing.
+    var index = this.activeQueues.indexOf(queueName);
+    if (index >= 0) {
+      this.activeQueues.splice(index, 1);
+    }
+    logger.info("Stopping queue '%s' as it is now empty", queueName);
+  }
+  clearQueue(queueName, err) {
+    logger.info("clearing queue '%s'", queueName);
+    var obj;
+    while (obj = this.removeNextEvent(queueName)) {
+      obj.defer.reject(err);
+    }
+    this.disableQueue(queueName);
+  }
+  peekNextEvent(queueName) {
+    var queue = this.queues[queueName];
+    if (!Array.isArray(queue)) {
+      return undefined;
+    }
+    return queue[0];
+  }
+  removeNextEvent(queueName) {
+    var queue = this.queues[queueName];
+    if (!Array.isArray(queue)) {
+      return undefined;
+    }
+    return queue.shift();
+  }
+}
+
+/* istanbul ignore next */
+function debuglog() {
+  if (DEBUG) {
+    logger.log(...arguments);
+  }
+}
+//# sourceMappingURL=scheduler.js.map

package/lib/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","names":["logger","EventType","defer","removeElement","calculateRetryBackoff","DEBUG","MatrixScheduler","RETRY_BACKOFF_RATELIMIT","event","attempts","err","QUEUE_MESSAGES","getType","RoomMessage","hasAssociation","constructor","retryAlgorithm","arguments","length","undefined","queueAlgorithm","_defineProperty","queueName","obj","peekNextEvent","disableQueue","debuglog","queues","Promise","resolve","then","procFn","res","removeNextEvent","getId","processQueue","waitTimeMs","info","clearQueue","setTimeout","getQueueForEvent","name","map","removeEventFromQueue","removed","element","setProcessFunction","fn","startProcessingQueues","queueEvent","deferred","push","promise","Object","keys","filter","activeQueues","indexOf","forEach","index","splice","reject","queue","Array","isArray","shift","log"],"sources":["../src/scheduler.ts"],"sourcesContent":["/*\nCopyright 2015 - 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\n/**\n * This is an internal module which manages queuing, scheduling and retrying\n * of requests.\n */\nimport { logger } from \"./logger.ts\";\nimport { MatrixEvent } from \"./models/event.ts\";\nimport { EventType } from \"./@types/event.ts\";\nimport { defer, IDeferred, removeElement } from \"./utils.ts\";\nimport { calculateRetryBackoff, MatrixError } from \"./http-api/index.ts\";\nimport { ISendEventResponse } from \"./@types/requests.ts\";\n\nconst DEBUG = false; // set true to enable console logging.\n\ninterface IQueueEntry<T> {\n    event: MatrixEvent;\n    defer: IDeferred<T>;\n    attempts: number;\n}\n\n/**\n * The function to invoke to process (send) events in the queue.\n * @param event - The event to send.\n * @returns Resolved/rejected depending on the outcome of the request.\n */\ntype ProcessFunction<T> = (event: MatrixEvent) => Promise<T>;\n\n// eslint-disable-next-line camelcase\nexport class MatrixScheduler<T = ISendEventResponse> {\n    /**\n     * Default retry algorithm for the matrix scheduler. Retries events up to 4 times with exponential backoff.\n     * @param attempts - Number of attempts that have been made, including the one that just failed (ie. starting at 1)\n     * @see retryAlgorithm\n     */\n    // eslint-disable-next-line @typescript-eslint/naming-convention\n    public static RETRY_BACKOFF_RATELIMIT(event: MatrixEvent | null, attempts: number, err: MatrixError): number {\n        return calculateRetryBackoff(err, attempts, false);\n    }\n\n    /**\n     * Queues `m.room.message` events and lets other events continue\n     * concurrently.\n     * @see queueAlgorithm\n     */\n    // eslint-disable-next-line @typescript-eslint/naming-convention\n    public static QUEUE_MESSAGES(event: MatrixEvent): string | null {\n        // enqueue messages or events that associate with another event (redactions and relations)\n        if (event.getType() === EventType.RoomMessage || event.hasAssociation()) {\n            // put these events in the 'message' queue.\n            return \"message\";\n        }\n        // allow all other events continue concurrently.\n        return null;\n    }\n\n    // queueName: [{\n    //  event: MatrixEvent,  // event to send\n    //  defer: Deferred,  // defer to resolve/reject at the END of the retries\n    //  attempts: Number  // number of times we've called processFn\n    // }, ...]\n    private readonly queues: Record<string, IQueueEntry<T>[]> = {};\n    private activeQueues: string[] = [];\n    private procFn: ProcessFunction<T> | null = null;\n\n    /**\n     * Construct a scheduler for Matrix. Requires\n     * {@link MatrixScheduler#setProcessFunction} to be provided\n     * with a way of processing events.\n     * @param retryAlgorithm - Optional. The retry\n     * algorithm to apply when determining when to try to send an event again.\n     * Defaults to {@link MatrixScheduler.RETRY_BACKOFF_RATELIMIT}.\n     * @param queueAlgorithm - Optional. The queuing\n     * algorithm to apply when determining which events should be sent before the\n     * given event. Defaults to {@link MatrixScheduler.QUEUE_MESSAGES}.\n     */\n    public constructor(\n        /**\n         * The retry algorithm to apply when retrying events. To stop retrying, return\n         * `-1`. If this event was part of a queue, it will be removed from\n         * the queue.\n         * @param event - The event being retried.\n         * @param attempts - The number of failed attempts. This will always be \\>= 1.\n         * @param err - The most recent error message received when trying\n         * to send this event.\n         * @returns The number of milliseconds to wait before trying again. If\n         * this is 0, the request will be immediately retried. If this is\n         * `-1`, the event will be marked as\n         * {@link EventStatus.NOT_SENT} and will not be retried.\n         */\n        public readonly retryAlgorithm = MatrixScheduler.RETRY_BACKOFF_RATELIMIT,\n        /**\n         * The queuing algorithm to apply to events. This function must be idempotent as\n         * it may be called multiple times with the same event. All queues created are\n         * serviced in a FIFO manner. To send the event ASAP, return `null`\n         * which will not put this event in a queue. Events that fail to send that form\n         * part of a queue will be removed from the queue and the next event in the\n         * queue will be sent.\n         * @param event - The event to be sent.\n         * @returns The name of the queue to put the event into. If a queue with\n         * this name does not exist, it will be created. If this is `null`,\n         * the event is not put into a queue and will be sent concurrently.\n         */\n        public readonly queueAlgorithm = MatrixScheduler.QUEUE_MESSAGES,\n    ) {}\n\n    /**\n     * Retrieve a queue based on an event. The event provided does not need to be in\n     * the queue.\n     * @param event - An event to get the queue for.\n     * @returns A shallow copy of events in the queue or null.\n     * Modifying this array will not modify the list itself. Modifying events in\n     * this array <i>will</i> modify the underlying event in the queue.\n     * @see MatrixScheduler.removeEventFromQueue To remove an event from the queue.\n     */\n    public getQueueForEvent(event: MatrixEvent): MatrixEvent[] | null {\n        const name = this.queueAlgorithm(event);\n        if (!name || !this.queues[name]) {\n            return null;\n        }\n        return this.queues[name].map(function (obj) {\n            return obj.event;\n        });\n    }\n\n    /**\n     * Remove this event from the queue. The event is equal to another event if they\n     * have the same ID returned from event.getId().\n     * @param event - The event to remove.\n     * @returns True if this event was removed.\n     */\n    public removeEventFromQueue(event: MatrixEvent): boolean {\n        const name = this.queueAlgorithm(event);\n        if (!name || !this.queues[name]) {\n            return false;\n        }\n        let removed = false;\n        removeElement(this.queues[name], (element) => {\n            if (element.event.getId() === event.getId()) {\n                // XXX we should probably reject the promise?\n                // https://github.com/matrix-org/matrix-js-sdk/issues/496\n                removed = true;\n                return true;\n            }\n            return false;\n        });\n        return removed;\n    }\n\n    /**\n     * Set the process function. Required for events in the queue to be processed.\n     * If set after events have been added to the queue, this will immediately start\n     * processing them.\n     * @param fn - The function that can process events\n     * in the queue.\n     */\n    public setProcessFunction(fn: ProcessFunction<T>): void {\n        this.procFn = fn;\n        this.startProcessingQueues();\n    }\n\n    /**\n     * Queue an event if it is required and start processing queues.\n     * @param event - The event that may be queued.\n     * @returns A promise if the event was queued, which will be\n     * resolved or rejected in due time, else null.\n     */\n    public queueEvent(event: MatrixEvent): Promise<T> | null {\n        const queueName = this.queueAlgorithm(event);\n        if (!queueName) {\n            return null;\n        }\n        // add the event to the queue and make a deferred for it.\n        if (!this.queues[queueName]) {\n            this.queues[queueName] = [];\n        }\n        const deferred = defer<T>();\n        this.queues[queueName].push({\n            event: event,\n            defer: deferred,\n            attempts: 0,\n        });\n        debuglog(\"Queue algorithm dumped event %s into queue '%s'\", event.getId(), queueName);\n        this.startProcessingQueues();\n        return deferred.promise;\n    }\n\n    private startProcessingQueues(): void {\n        if (!this.procFn) return;\n        // for each inactive queue with events in them\n        Object.keys(this.queues)\n            .filter((queueName) => {\n                return this.activeQueues.indexOf(queueName) === -1 && this.queues[queueName].length > 0;\n            })\n            .forEach((queueName) => {\n                // mark the queue as active\n                this.activeQueues.push(queueName);\n                // begin processing the head of the queue\n                debuglog(\"Spinning up queue: '%s'\", queueName);\n                this.processQueue(queueName);\n            });\n    }\n\n    private processQueue = (queueName: string): void => {\n        // get head of queue\n        const obj = this.peekNextEvent(queueName);\n        if (!obj) {\n            this.disableQueue(queueName);\n            return;\n        }\n        debuglog(\"Queue '%s' has %s pending events\", queueName, this.queues[queueName].length);\n        // fire the process function and if it resolves, resolve the deferred. Else\n        // invoke the retry algorithm.\n\n        // First wait for a resolved promise, so the resolve handlers for\n        // the deferred of the previously sent event can run.\n        // This way enqueued relations/redactions to enqueued events can receive\n        // the remove id of their target before being sent.\n        Promise.resolve()\n            .then(() => {\n                return this.procFn!(obj.event);\n            })\n            .then(\n                (res) => {\n                    // remove this from the queue\n                    this.removeNextEvent(queueName);\n                    debuglog(\"Queue '%s' sent event %s\", queueName, obj.event.getId());\n                    obj.defer.resolve(res);\n                    // keep processing\n                    this.processQueue(queueName);\n                },\n                (err) => {\n                    obj.attempts += 1;\n                    // ask the retry algorithm when/if we should try again\n                    const waitTimeMs = this.retryAlgorithm(obj.event, obj.attempts, err);\n                    debuglog(\n                        \"retry(%s) err=%s event_id=%s waitTime=%s\",\n                        obj.attempts,\n                        err,\n                        obj.event.getId(),\n                        waitTimeMs,\n                    );\n                    if (waitTimeMs === -1) {\n                        // give up (you quitter!)\n                        logger.info(\"Queue '%s' giving up on event %s\", queueName, obj.event.getId());\n                        // remove this from the queue\n                        this.clearQueue(queueName, err);\n                    } else {\n                        setTimeout(this.processQueue, waitTimeMs, queueName);\n                    }\n                },\n            );\n    };\n\n    private disableQueue(queueName: string): void {\n        // queue is empty. Mark as inactive and stop recursing.\n        const index = this.activeQueues.indexOf(queueName);\n        if (index >= 0) {\n            this.activeQueues.splice(index, 1);\n        }\n        logger.info(\"Stopping queue '%s' as it is now empty\", queueName);\n    }\n\n    private clearQueue(queueName: string, err: unknown): void {\n        logger.info(\"clearing queue '%s'\", queueName);\n        let obj: IQueueEntry<T> | undefined;\n        while ((obj = this.removeNextEvent(queueName))) {\n            obj.defer.reject(err);\n        }\n        this.disableQueue(queueName);\n    }\n\n    private peekNextEvent(queueName: string): IQueueEntry<T> | undefined {\n        const queue = this.queues[queueName];\n        if (!Array.isArray(queue)) {\n            return undefined;\n        }\n        return queue[0];\n    }\n\n    private removeNextEvent(queueName: string): IQueueEntry<T> | undefined {\n        const queue = this.queues[queueName];\n        if (!Array.isArray(queue)) {\n            return undefined;\n        }\n        return queue.shift();\n    }\n}\n\n/* istanbul ignore next */\nfunction debuglog(...args: any[]): void {\n    if (DEBUG) {\n        logger.log(...args);\n    }\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAASA,MAAM,QAAQ,aAAa;AAEpC,SAASC,SAAS,QAAQ,mBAAmB;AAC7C,SAASC,KAAK,EAAaC,aAAa,QAAQ,YAAY;AAC5D,SAASC,qBAAqB,QAAqB,qBAAqB;AAGxE,IAAMC,KAAK,GAAG,KAAK,CAAC,CAAC;;AAQrB;AACA;AACA;AACA;AACA;;AAGA;AACA,OAAO,MAAMC,eAAe,CAAyB;EACjD;AACJ;AACA;AACA;AACA;EACI;EACA,OAAcC,uBAAuBA,CAACC,KAAyB,EAAEC,QAAgB,EAAEC,GAAgB,EAAU;IACzG,OAAON,qBAAqB,CAACM,GAAG,EAAED,QAAQ,EAAE,KAAK,CAAC;EACtD;;EAEA;AACJ;AACA;AACA;AACA;EACI;EACA,OAAcE,cAAcA,CAACH,KAAkB,EAAiB;IAC5D;IACA,IAAIA,KAAK,CAACI,OAAO,CAAC,CAAC,KAAKX,SAAS,CAACY,WAAW,IAAIL,KAAK,CAACM,cAAc,CAAC,CAAC,EAAE;MACrE;MACA,OAAO,SAAS;IACpB;IACA;IACA,OAAO,IAAI;EACf;;EAEA;EACA;EACA;EACA;EACA;;EAKA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWC,WAAWA,CAAA,EA4BhB;IAAA,IAdkBC,cAAc,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAGX,eAAe,CAACC,uBAAuB;IAAA,IAaxDa,cAAc,GAAAH,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAGX,eAAe,CAACK,cAAc;IAAA,KAb/CK,cAAc,GAAdA,cAAc;IAAA,KAadI,cAAc,GAAdA,cAAc;IAAAC,eAAA,iBA1C0B,CAAC,CAAC;IAAAA,eAAA,uBAC7B,EAAE;IAAAA,eAAA,iBACS,IAAI;IAAAA,eAAA,uBA4IxBC,SAAiB,IAAW;MAChD;MACA,IAAMC,GAAG,GAAG,IAAI,CAACC,aAAa,CAACF,SAAS,CAAC;MACzC,IAAI,CAACC,GAAG,EAAE;QACN,IAAI,CAACE,YAAY,CAACH,SAAS,CAAC;QAC5B;MACJ;MACAI,QAAQ,CAAC,kCAAkC,EAAEJ,SAAS,EAAE,IAAI,CAACK,MAAM,CAACL,SAAS,CAAC,CAACJ,MAAM,CAAC;MACtF;MACA;;MAEA;MACA;MACA;MACA;MACAU,OAAO,CAACC,OAAO,CAAC,CAAC,CACZC,IAAI,CAAC,MAAM;QACR,OAAO,IAAI,CAACC,MAAM,CAAER,GAAG,CAACf,KAAK,CAAC;MAClC,CAAC,CAAC,CACDsB,IAAI,CACAE,GAAG,IAAK;QACL;QACA,IAAI,CAACC,eAAe,CAACX,SAAS,CAAC;QAC/BI,QAAQ,CAAC,0BAA0B,EAAEJ,SAAS,EAAEC,GAAG,CAACf,KAAK,CAAC0B,KAAK,CAAC,CAAC,CAAC;QAClEX,GAAG,CAACrB,KAAK,CAAC2B,OAAO,CAACG,GAAG,CAAC;QACtB;QACA,IAAI,CAACG,YAAY,CAACb,SAAS,CAAC;MAChC,CAAC,EACAZ,GAAG,IAAK;QACLa,GAAG,CAACd,QAAQ,IAAI,CAAC;QACjB;QACA,IAAM2B,UAAU,GAAG,IAAI,CAACpB,cAAc,CAACO,GAAG,CAACf,KAAK,EAAEe,GAAG,CAACd,QAAQ,EAAEC,GAAG,CAAC;QACpEgB,QAAQ,CACJ,0CAA0C,EAC1CH,GAAG,CAACd,QAAQ,EACZC,GAAG,EACHa,GAAG,CAACf,KAAK,CAAC0B,KAAK,CAAC,CAAC,EACjBE,UACJ,CAAC;QACD,IAAIA,UAAU,KAAK,CAAC,CAAC,EAAE;UACnB;UACApC,MAAM,CAACqC,IAAI,CAAC,kCAAkC,EAAEf,SAAS,EAAEC,GAAG,CAACf,KAAK,CAAC0B,KAAK,CAAC,CAAC,CAAC;UAC7E;UACA,IAAI,CAACI,UAAU,CAAChB,SAAS,EAAEZ,GAAG,CAAC;QACnC,CAAC,MAAM;UACH6B,UAAU,CAAC,IAAI,CAACJ,YAAY,EAAEC,UAAU,EAAEd,SAAS,CAAC;QACxD;MACJ,CACJ,CAAC;IACT,CAAC;EApJE;;EAEH;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACWkB,gBAAgBA,CAAChC,KAAkB,EAAwB;IAC9D,IAAMiC,IAAI,GAAG,IAAI,CAACrB,cAAc,CAACZ,KAAK,CAAC;IACvC,IAAI,CAACiC,IAAI,IAAI,CAAC,IAAI,CAACd,MAAM,CAACc,IAAI,CAAC,EAAE;MAC7B,OAAO,IAAI;IACf;IACA,OAAO,IAAI,CAACd,MAAM,CAACc,IAAI,CAAC,CAACC,GAAG,CAAC,UAAUnB,GAAG,EAAE;MACxC,OAAOA,GAAG,CAACf,KAAK;IACpB,CAAC,CAAC;EACN;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWmC,oBAAoBA,CAACnC,KAAkB,EAAW;IACrD,IAAMiC,IAAI,GAAG,IAAI,CAACrB,cAAc,CAACZ,KAAK,CAAC;IACvC,IAAI,CAACiC,IAAI,IAAI,CAAC,IAAI,CAACd,MAAM,CAACc,IAAI,CAAC,EAAE;MAC7B,OAAO,KAAK;IAChB;IACA,IAAIG,OAAO,GAAG,KAAK;IACnBzC,aAAa,CAAC,IAAI,CAACwB,MAAM,CAACc,IAAI,CAAC,EAAGI,OAAO,IAAK;MAC1C,IAAIA,OAAO,CAACrC,KAAK,CAAC0B,KAAK,CAAC,CAAC,KAAK1B,KAAK,CAAC0B,KAAK,CAAC,CAAC,EAAE;QACzC;QACA;QACAU,OAAO,GAAG,IAAI;QACd,OAAO,IAAI;MACf;MACA,OAAO,KAAK;IAChB,CAAC,CAAC;IACF,OAAOA,OAAO;EAClB;;EAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACWE,kBAAkBA,CAACC,EAAsB,EAAQ;IACpD,IAAI,CAAChB,MAAM,GAAGgB,EAAE;IAChB,IAAI,CAACC,qBAAqB,CAAC,CAAC;EAChC;;EAEA;AACJ;AACA;AACA;AACA;AACA;EACWC,UAAUA,CAACzC,KAAkB,EAAqB;IACrD,IAAMc,SAAS,GAAG,IAAI,CAACF,cAAc,CAACZ,KAAK,CAAC;IAC5C,IAAI,CAACc,SAAS,EAAE;MACZ,OAAO,IAAI;IACf;IACA;IACA,IAAI,CAAC,IAAI,CAACK,MAAM,CAACL,SAAS,CAAC,EAAE;MACzB,IAAI,CAACK,MAAM,CAACL,SAAS,CAAC,GAAG,EAAE;IAC/B;IACA,IAAM4B,QAAQ,GAAGhD,KAAK,CAAI,CAAC;IAC3B,IAAI,CAACyB,MAAM,CAACL,SAAS,CAAC,CAAC6B,IAAI,CAAC;MACxB3C,KAAK,EAAEA,KAAK;MACZN,KAAK,EAAEgD,QAAQ;MACfzC,QAAQ,EAAE;IACd,CAAC,CAAC;IACFiB,QAAQ,CAAC,iDAAiD,EAAElB,KAAK,CAAC0B,KAAK,CAAC,CAAC,EAAEZ,SAAS,CAAC;IACrF,IAAI,CAAC0B,qBAAqB,CAAC,CAAC;IAC5B,OAAOE,QAAQ,CAACE,OAAO;EAC3B;EAEQJ,qBAAqBA,CAAA,EAAS;IAClC,IAAI,CAAC,IAAI,CAACjB,MAAM,EAAE;IAClB;IACAsB,MAAM,CAACC,IAAI,CAAC,IAAI,CAAC3B,MAAM,CAAC,CACnB4B,MAAM,CAAEjC,SAAS,IAAK;MACnB,OAAO,IAAI,CAACkC,YAAY,CAACC,OAAO,CAACnC,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAACK,MAAM,CAACL,SAAS,CAAC,CAACJ,MAAM,GAAG,CAAC;IAC3F,CAAC,CAAC,CACDwC,OAAO,CAAEpC,SAAS,IAAK;MACpB;MACA,IAAI,CAACkC,YAAY,CAACL,IAAI,CAAC7B,SAAS,CAAC;MACjC;MACAI,QAAQ,CAAC,yBAAyB,EAAEJ,SAAS,CAAC;MAC9C,IAAI,CAACa,YAAY,CAACb,SAAS,CAAC;IAChC,CAAC,CAAC;EACV;EAqDQG,YAAYA,CAACH,SAAiB,EAAQ;IAC1C;IACA,IAAMqC,KAAK,GAAG,IAAI,CAACH,YAAY,CAACC,OAAO,CAACnC,SAAS,CAAC;IAClD,IAAIqC,KAAK,IAAI,CAAC,EAAE;MACZ,IAAI,CAACH,YAAY,CAACI,MAAM,CAACD,KAAK,EAAE,CAAC,CAAC;IACtC;IACA3D,MAAM,CAACqC,IAAI,CAAC,wCAAwC,EAAEf,SAAS,CAAC;EACpE;EAEQgB,UAAUA,CAAChB,SAAiB,EAAEZ,GAAY,EAAQ;IACtDV,MAAM,CAACqC,IAAI,CAAC,qBAAqB,EAAEf,SAAS,CAAC;IAC7C,IAAIC,GAA+B;IACnC,OAAQA,GAAG,GAAG,IAAI,CAACU,eAAe,CAACX,SAAS,CAAC,EAAG;MAC5CC,GAAG,CAACrB,KAAK,CAAC2D,MAAM,CAACnD,GAAG,CAAC;IACzB;IACA,IAAI,CAACe,YAAY,CAACH,SAAS,CAAC;EAChC;EAEQE,aAAaA,CAACF,SAAiB,EAA8B;IACjE,IAAMwC,KAAK,GAAG,IAAI,CAACnC,MAAM,CAACL,SAAS,CAAC;IACpC,IAAI,CAACyC,KAAK,CAACC,OAAO,CAACF,KAAK,CAAC,EAAE;MACvB,OAAO3C,SAAS;IACpB;IACA,OAAO2C,KAAK,CAAC,CAAC,CAAC;EACnB;EAEQ7B,eAAeA,CAACX,SAAiB,EAA8B;IACnE,IAAMwC,KAAK,GAAG,IAAI,CAACnC,MAAM,CAACL,SAAS,CAAC;IACpC,IAAI,CAACyC,KAAK,CAACC,OAAO,CAACF,KAAK,CAAC,EAAE;MACvB,OAAO3C,SAAS;IACpB;IACA,OAAO2C,KAAK,CAACG,KAAK,CAAC,CAAC;EACxB;AACJ;;AAEA;AACA,SAASvC,QAAQA,CAAA,EAAuB;EACpC,IAAIrB,KAAK,EAAE;IACPL,MAAM,CAACkE,GAAG,CAAC,GAAAjD,SAAO,CAAC;EACvB;AACJ","ignoreList":[]}