@textrp/briij-js-sdk 41.0.1 → 43.0.0

package/lib/randomstring.js.map

@@ -1 +1 @@
-{"version":3,"file":"randomstring.js","names":["encodeUnpaddedBase64Url","LOWERCASE","UPPERCASE","DIGITS","secureRandomBase64Url","len","key","Uint8Array","globalThis","crypto","getRandomValues","secureRandomString","secureRandomStringFrom","chars","length","Error","randomValueCutoff","entropyBuffer","Math","floor","entropyBufferPos","result","randomByte","push","join"],"sources":["../src/randomstring.ts"],"sourcesContent":["/*\r\nCopyright 2018 New Vector Ltd\r\nCopyright 2019 The Matrix.org Foundation C.I.C.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n*/\r\n\r\nimport { encodeUnpaddedBase64Url } from \"./base64.ts\";\r\n\r\n/**\r\n * String representing the lowercase latin alphabet for use in {@link secureRandomStringFrom}\r\n * (can be combined with other such exports or other characters by appending strings)\r\n */\r\nexport const LOWERCASE = \"abcdefghijklmnopqrstuvwxyz\";\r\n\r\n/**\r\n * String representing the uppercase latin alphabet for use in secureRandomStringFrom\r\n * (can be combined with other such exports or other characters by appending strings)\r\n */\r\nexport const UPPERCASE = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\r\n\r\n/**\r\n * String representing the arabic numerals for use in secureRandomStringFrom\r\n * (can be combined with other such exports or other characters by appending strings)\r\n */\r\nexport const DIGITS = \"0123456789\";\r\n\r\nexport function secureRandomBase64Url(len: number): string {\r\n    const key = new Uint8Array(len);\r\n    globalThis.crypto.getRandomValues(key);\r\n\r\n    return encodeUnpaddedBase64Url(key);\r\n}\r\n\r\n/**\r\n * Generates a random string of uppercase and lowercase letters plus digits using a\r\n * cryptographically secure random number generator.\r\n * @param len The length of the string to generate\r\n * @returns Random string of uppercase and lowercase letters plus digits of length `len`\r\n */\r\nexport function secureRandomString(len: number): string {\r\n    return secureRandomStringFrom(len, UPPERCASE + LOWERCASE + DIGITS);\r\n}\r\n\r\n/**\r\n * Generate a cryptographically secure random string using characters given.\r\n *\r\n * @param len - The length of the string to generate (must be positive and less than 32768).\r\n * @param chars - The characters to use in the random string (between 2 and 256 characters long).\r\n * @returns Random string of characters of length `len`.\r\n */\r\nexport function secureRandomStringFrom(len: number, chars: string): string {\r\n    // This is intended for latin strings so 256 possibilities should be more than enough and\r\n    // means we can use random bytes, minimising the amount of entropy we need to ask for.\r\n    if (chars.length < 2 || chars.length > 256) {\r\n        throw new Error(\"Character set must be between 2 and 256 characters long\");\r\n    }\r\n\r\n    if (len < 1 || len > 32768) {\r\n        throw new Error(\"Requested random string length must be between 1 and 32768\");\r\n    }\r\n\r\n    // We'll generate random unsigned bytes, so get the largest number less than 256 that is a multiple\r\n    // of the length of the character set: We'll need to discard any random values that are larger than\r\n    // this as we can't possibly map them onto the character set while keeping each character equally\r\n    // likely to be chosen (minus 1 to convert to indices in a string). (Essentially, we're using a d8\r\n    // to choose between 7 possibilities and re-rolling on an 8, keeping all 7 outcomes equally likely.)\r\n    // Our random values must be strictly less than this\r\n    const randomValueCutoff = 256 - (256 % chars.length);\r\n\r\n    // Grab 30% more entropy than we need. This should be enough that we can discard the values that are\r\n    // too high without having to go back and grab more unless we're super unlucky.\r\n    const entropyBuffer = new Uint8Array(Math.floor(len * 1.3));\r\n    // Mark all of this buffer as used to start with (we haven't populated it with entropy yet) so it will\r\n    // be filled on the first iteration.\r\n    let entropyBufferPos = entropyBuffer.length;\r\n\r\n    const result = [];\r\n    while (result.length < len) {\r\n        if (entropyBufferPos === entropyBuffer.length) {\r\n            globalThis.crypto.getRandomValues(entropyBuffer);\r\n            entropyBufferPos = 0;\r\n        }\r\n\r\n        const randomByte = entropyBuffer[entropyBufferPos++];\r\n\r\n        if (randomByte < randomValueCutoff) {\r\n            result.push(chars[randomByte % chars.length]);\r\n        }\r\n    }\r\n\r\n    return result.join(\"\");\r\n}\r\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASA,uBAAuB,QAAQ,aAAa;;AAErD;AACA;AACA;AACA;AACA,OAAO,IAAMC,SAAS,GAAG,4BAA4B;;AAErD;AACA;AACA;AACA;AACA,OAAO,IAAMC,SAAS,GAAG,4BAA4B;;AAErD;AACA;AACA;AACA;AACA,OAAO,IAAMC,MAAM,GAAG,YAAY;AAElC,OAAO,SAASC,qBAAqBA,CAACC,GAAW,EAAU;EACvD,IAAMC,GAAG,GAAG,IAAIC,UAAU,CAACF,GAAG,CAAC;EAC/BG,UAAU,CAACC,MAAM,CAACC,eAAe,CAACJ,GAAG,CAAC;EAEtC,OAAON,uBAAuB,CAACM,GAAG,CAAC;AACvC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASK,kBAAkBA,CAACN,GAAW,EAAU;EACpD,OAAOO,sBAAsB,CAACP,GAAG,EAAEH,SAAS,GAAGD,SAAS,GAAGE,MAAM,CAAC;AACtE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASS,sBAAsBA,CAACP,GAAW,EAAEQ,KAAa,EAAU;EACvE;EACA;EACA,IAAIA,KAAK,CAACC,MAAM,GAAG,CAAC,IAAID,KAAK,CAACC,MAAM,GAAG,GAAG,EAAE;IACxC,MAAM,IAAIC,KAAK,CAAC,yDAAyD,CAAC;EAC9E;EAEA,IAAIV,GAAG,GAAG,CAAC,IAAIA,GAAG,GAAG,KAAK,EAAE;IACxB,MAAM,IAAIU,KAAK,CAAC,4DAA4D,CAAC;EACjF;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA,IAAMC,iBAAiB,GAAG,GAAG,GAAI,GAAG,GAAGH,KAAK,CAACC,MAAO;;EAEpD;EACA;EACA,IAAMG,aAAa,GAAG,IAAIV,UAAU,CAACW,IAAI,CAACC,KAAK,CAACd,GAAG,GAAG,GAAG,CAAC,CAAC;EAC3D;EACA;EACA,IAAIe,gBAAgB,GAAGH,aAAa,CAACH,MAAM;EAE3C,IAAMO,MAAM,GAAG,EAAE;EACjB,OAAOA,MAAM,CAACP,MAAM,GAAGT,GAAG,EAAE;IACxB,IAAIe,gBAAgB,KAAKH,aAAa,CAACH,MAAM,EAAE;MAC3CN,UAAU,CAACC,MAAM,CAACC,eAAe,CAACO,aAAa,CAAC;MAChDG,gBAAgB,GAAG,CAAC;IACxB;IAEA,IAAME,UAAU,GAAGL,aAAa,CAACG,gBAAgB,EAAE,CAAC;IAEpD,IAAIE,UAAU,GAAGN,iBAAiB,EAAE;MAChCK,MAAM,CAACE,IAAI,CAACV,KAAK,CAACS,UAAU,GAAGT,KAAK,CAACC,MAAM,CAAC,CAAC;IACjD;EACJ;EAEA,OAAOO,MAAM,CAACG,IAAI,CAAC,EAAE,CAAC;AAC1B","ignoreList":[]}
+{"version":3,"file":"randomstring.js","names":["encodeUnpaddedBase64Url","LOWERCASE","UPPERCASE","DIGITS","secureRandomBase64Url","len","key","Uint8Array","globalThis","crypto","getRandomValues","secureRandomString","secureRandomStringFrom","chars","length","Error","randomValueCutoff","entropyBuffer","Math","floor","entropyBufferPos","result","randomByte","push","join"],"sources":["../src/randomstring.ts"],"sourcesContent":["/*\nCopyright 2018 New Vector Ltd\nCopyright 2019 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 { encodeUnpaddedBase64Url } from \"./base64.ts\";\n\n/**\n * String representing the lowercase latin alphabet for use in {@link secureRandomStringFrom}\n * (can be combined with other such exports or other characters by appending strings)\n */\nexport const LOWERCASE = \"abcdefghijklmnopqrstuvwxyz\";\n\n/**\n * String representing the uppercase latin alphabet for use in secureRandomStringFrom\n * (can be combined with other such exports or other characters by appending strings)\n */\nexport const UPPERCASE = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\n/**\n * String representing the arabic numerals for use in secureRandomStringFrom\n * (can be combined with other such exports or other characters by appending strings)\n */\nexport const DIGITS = \"0123456789\";\n\nexport function secureRandomBase64Url(len: number): string {\n    const key = new Uint8Array(len);\n    globalThis.crypto.getRandomValues(key);\n\n    return encodeUnpaddedBase64Url(key);\n}\n\n/**\n * Generates a random string of uppercase and lowercase letters plus digits using a\n * cryptographically secure random number generator.\n * @param len The length of the string to generate\n * @returns Random string of uppercase and lowercase letters plus digits of length `len`\n */\nexport function secureRandomString(len: number): string {\n    return secureRandomStringFrom(len, UPPERCASE + LOWERCASE + DIGITS);\n}\n\n/**\n * Generate a cryptographically secure random string using characters given.\n *\n * @param len - The length of the string to generate (must be positive and less than 32768).\n * @param chars - The characters to use in the random string (between 2 and 256 characters long).\n * @returns Random string of characters of length `len`.\n */\nexport function secureRandomStringFrom(len: number, chars: string): string {\n    // This is intended for latin strings so 256 possibilities should be more than enough and\n    // means we can use random bytes, minimising the amount of entropy we need to ask for.\n    if (chars.length < 2 || chars.length > 256) {\n        throw new Error(\"Character set must be between 2 and 256 characters long\");\n    }\n\n    if (len < 1 || len > 32768) {\n        throw new Error(\"Requested random string length must be between 1 and 32768\");\n    }\n\n    // We'll generate random unsigned bytes, so get the largest number less than 256 that is a multiple\n    // of the length of the character set: We'll need to discard any random values that are larger than\n    // this as we can't possibly map them onto the character set while keeping each character equally\n    // likely to be chosen (minus 1 to convert to indices in a string). (Essentially, we're using a d8\n    // to choose between 7 possibilities and re-rolling on an 8, keeping all 7 outcomes equally likely.)\n    // Our random values must be strictly less than this\n    const randomValueCutoff = 256 - (256 % chars.length);\n\n    // Grab 30% more entropy than we need. This should be enough that we can discard the values that are\n    // too high without having to go back and grab more unless we're super unlucky.\n    const entropyBuffer = new Uint8Array(Math.floor(len * 1.3));\n    // Mark all of this buffer as used to start with (we haven't populated it with entropy yet) so it will\n    // be filled on the first iteration.\n    let entropyBufferPos = entropyBuffer.length;\n\n    const result = [];\n    while (result.length < len) {\n        if (entropyBufferPos === entropyBuffer.length) {\n            globalThis.crypto.getRandomValues(entropyBuffer);\n            entropyBufferPos = 0;\n        }\n\n        const randomByte = entropyBuffer[entropyBufferPos++];\n\n        if (randomByte < randomValueCutoff) {\n            result.push(chars[randomByte % chars.length]);\n        }\n    }\n\n    return result.join(\"\");\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASA,uBAAuB,QAAQ,aAAa;;AAErD;AACA;AACA;AACA;AACA,OAAO,IAAMC,SAAS,GAAG,4BAA4B;;AAErD;AACA;AACA;AACA;AACA,OAAO,IAAMC,SAAS,GAAG,4BAA4B;;AAErD;AACA;AACA;AACA;AACA,OAAO,IAAMC,MAAM,GAAG,YAAY;AAElC,OAAO,SAASC,qBAAqBA,CAACC,GAAW,EAAU;EACvD,IAAMC,GAAG,GAAG,IAAIC,UAAU,CAACF,GAAG,CAAC;EAC/BG,UAAU,CAACC,MAAM,CAACC,eAAe,CAACJ,GAAG,CAAC;EAEtC,OAAON,uBAAuB,CAACM,GAAG,CAAC;AACvC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASK,kBAAkBA,CAACN,GAAW,EAAU;EACpD,OAAOO,sBAAsB,CAACP,GAAG,EAAEH,SAAS,GAAGD,SAAS,GAAGE,MAAM,CAAC;AACtE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASS,sBAAsBA,CAACP,GAAW,EAAEQ,KAAa,EAAU;EACvE;EACA;EACA,IAAIA,KAAK,CAACC,MAAM,GAAG,CAAC,IAAID,KAAK,CAACC,MAAM,GAAG,GAAG,EAAE;IACxC,MAAM,IAAIC,KAAK,CAAC,yDAAyD,CAAC;EAC9E;EAEA,IAAIV,GAAG,GAAG,CAAC,IAAIA,GAAG,GAAG,KAAK,EAAE;IACxB,MAAM,IAAIU,KAAK,CAAC,4DAA4D,CAAC;EACjF;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA,IAAMC,iBAAiB,GAAG,GAAG,GAAI,GAAG,GAAGH,KAAK,CAACC,MAAO;;EAEpD;EACA;EACA,IAAMG,aAAa,GAAG,IAAIV,UAAU,CAACW,IAAI,CAACC,KAAK,CAACd,GAAG,GAAG,GAAG,CAAC,CAAC;EAC3D;EACA;EACA,IAAIe,gBAAgB,GAAGH,aAAa,CAACH,MAAM;EAE3C,IAAMO,MAAM,GAAG,EAAE;EACjB,OAAOA,MAAM,CAACP,MAAM,GAAGT,GAAG,EAAE;IACxB,IAAIe,gBAAgB,KAAKH,aAAa,CAACH,MAAM,EAAE;MAC3CN,UAAU,CAACC,MAAM,CAACC,eAAe,CAACO,aAAa,CAAC;MAChDG,gBAAgB,GAAG,CAAC;IACxB;IAEA,IAAME,UAAU,GAAGL,aAAa,CAACG,gBAAgB,EAAE,CAAC;IAEpD,IAAIE,UAAU,GAAGN,iBAAiB,EAAE;MAChCK,MAAM,CAACE,IAAI,CAACV,KAAK,CAACS,UAAU,GAAGT,KAAK,CAACC,MAAM,CAAC,CAAC;IACjD;EACJ;EAEA,OAAOO,MAAM,CAACG,IAAI,CAAC,EAAE,CAAC;AAC1B","ignoreList":[]}

package/lib/realtime-callbacks.js

@@ -1,27 +1,27 @@
-/*
-Copyright 2016 OpenMarket Ltd
-Copyright 2019 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.
+/*
+Copyright 2016 OpenMarket Ltd
+Copyright 2019 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.
 */
 
-/* A re-implementation of the javascript callback functions (setTimeout,
- * clearTimeout; setInterval and clearInterval are not yet implemented) which
- * try to improve handling of large clock jumps (as seen when
- * suspending/resuming the system).
- *
- * In particular, if a timeout would have fired while the system was suspended,
- * it will instead fire as soon as possible after resume.
+/* A re-implementation of the javascript callback functions (setTimeout,
+ * clearTimeout; setInterval and clearInterval are not yet implemented) which
+ * try to improve handling of large clock jumps (as seen when
+ * suspending/resuming the system).
+ *
+ * In particular, if a timeout would have fired while the system was suspended,
+ * it will instead fire as soon as possible after resume.
  */
 
 import { logger } from "./logger.js";
@@ -43,15 +43,15 @@ var callbackList = [];
 /* istanbul ignore next */
 var debuglog = function debuglog() {};
 
-/**
- * reimplementation of window.setTimeout, which will call the callback if
- * the wallclock time goes past the deadline.
- *
- * @param func -   callback to be called after a delay
- * @param delayMs -  number of milliseconds to delay by
- *
- * @returns an identifier for this callback, which may be passed into
- *                   clearTimeout later.
+/**
+ * reimplementation of window.setTimeout, which will call the callback if
+ * the wallclock time goes past the deadline.
+ *
+ * @param func -   callback to be called after a delay
+ * @param delayMs -  number of milliseconds to delay by
+ *
+ * @returns an identifier for this callback, which may be passed into
+ *                   clearTimeout later.
  */
 export function setTimeout(func, delayMs) {
   for (var _len = arguments.length, params = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) {
@@ -80,10 +80,10 @@ export function setTimeout(func, delayMs) {
   return key;
 }
 
-/**
- * reimplementation of window.clearTimeout, which mirrors setTimeout
- *
- * @param key -   result from an earlier setTimeout call
+/**
+ * reimplementation of window.clearTimeout, which mirrors setTimeout
+ *
+ * @param key -   result from an earlier setTimeout call
  */
 export function clearTimeout(key) {
   if (callbackList.length === 0) {
@@ -151,10 +151,10 @@ function runCallbacks() {
   }
 }
 
-/* search in a sorted array.
- *
- * returns the index of the last element for which func returns
- * greater than zero, or array.length if no such element exists.
+/* search in a sorted array.
+ *
+ * returns the index of the last element for which func returns
+ * greater than zero, or array.length if no such element exists.
  */
 function binarySearch(array, func) {
   // min is inclusive, max exclusive.

package/lib/realtime-callbacks.js.map

@@ -1 +1 @@
-{"version":3,"file":"realtime-callbacks.js","names":["logger","TIMER_CHECK_PERIOD_MS","count","realCallbackKey","callbackList","debuglog","setTimeout","func","delayMs","_len","arguments","length","params","Array","_key","runAt","Date","now","key","data","idx","binarySearch","el","splice","scheduleRealCallback","clearTimeout","i","cb","globalThis","first","timestamp","Math","min","runCallbacks","callbacksToRun","shift","push","apply","e","error","array","max","mid","res"],"sources":["../src/realtime-callbacks.ts"],"sourcesContent":["/*\r\nCopyright 2016 OpenMarket Ltd\r\nCopyright 2019 The Matrix.org Foundation C.I.C.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n*/\r\n\r\n/* A re-implementation of the javascript callback functions (setTimeout,\r\n * clearTimeout; setInterval and clearInterval are not yet implemented) which\r\n * try to improve handling of large clock jumps (as seen when\r\n * suspending/resuming the system).\r\n *\r\n * In particular, if a timeout would have fired while the system was suspended,\r\n * it will instead fire as soon as possible after resume.\r\n */\r\n\r\nimport { logger } from \"./logger.ts\";\r\n\r\n// we schedule a callback at least this often, to check if we've missed out on\r\n// some wall-clock time due to being suspended.\r\nconst TIMER_CHECK_PERIOD_MS = 1000;\r\n\r\n// counter, for making up ids to return from setTimeout\r\nlet count = 0;\r\n\r\n// the key for our callback with the real globalThis.setTimeout\r\nlet realCallbackKey: NodeJS.Timeout | number;\r\n\r\ntype Callback = {\r\n    runAt: number;\r\n    func: (...params: any[]) => void;\r\n    params: any[];\r\n    key: number;\r\n};\r\n\r\n// a sorted list of the callbacks to be run.\r\n// each is an object with keys [runAt, func, params, key].\r\nconst callbackList: Callback[] = [];\r\n\r\n// var debuglog = logger.log.bind(logger);\r\n/* istanbul ignore next */\r\nconst debuglog = function (...params: any[]): void {};\r\n\r\n/**\r\n * reimplementation of window.setTimeout, which will call the callback if\r\n * the wallclock time goes past the deadline.\r\n *\r\n * @param func -   callback to be called after a delay\r\n * @param delayMs -  number of milliseconds to delay by\r\n *\r\n * @returns an identifier for this callback, which may be passed into\r\n *                   clearTimeout later.\r\n */\r\nexport function setTimeout(func: (...params: any[]) => void, delayMs: number, ...params: any[]): number {\r\n    delayMs = delayMs || 0;\r\n    if (delayMs < 0) {\r\n        delayMs = 0;\r\n    }\r\n\r\n    const runAt = Date.now() + delayMs;\r\n    const key = count++;\r\n    debuglog(\"setTimeout: scheduling cb\", key, \"at\", runAt, \"(delay\", delayMs, \")\");\r\n    const data = {\r\n        runAt: runAt,\r\n        func: func,\r\n        params: params,\r\n        key: key,\r\n    };\r\n\r\n    // figure out where it goes in the list\r\n    const idx = binarySearch(callbackList, function (el) {\r\n        return el.runAt - runAt;\r\n    });\r\n\r\n    callbackList.splice(idx, 0, data);\r\n    scheduleRealCallback();\r\n\r\n    return key;\r\n}\r\n\r\n/**\r\n * reimplementation of window.clearTimeout, which mirrors setTimeout\r\n *\r\n * @param key -   result from an earlier setTimeout call\r\n */\r\nexport function clearTimeout(key: number): void {\r\n    if (callbackList.length === 0) {\r\n        return;\r\n    }\r\n\r\n    // remove the element from the list\r\n    let i: number;\r\n    for (i = 0; i < callbackList.length; i++) {\r\n        const cb = callbackList[i];\r\n        if (cb.key == key) {\r\n            callbackList.splice(i, 1);\r\n            break;\r\n        }\r\n    }\r\n\r\n    // iff it was the first one in the list, reschedule our callback.\r\n    if (i === 0) {\r\n        scheduleRealCallback();\r\n    }\r\n}\r\n\r\n// use the real globalThis.setTimeout to schedule a callback to runCallbacks.\r\nfunction scheduleRealCallback(): void {\r\n    if (realCallbackKey) {\r\n        globalThis.clearTimeout(realCallbackKey as NodeJS.Timeout);\r\n    }\r\n\r\n    const first = callbackList[0];\r\n\r\n    if (!first) {\r\n        debuglog(\"scheduleRealCallback: no more callbacks, not rescheduling\");\r\n        return;\r\n    }\r\n\r\n    const timestamp = Date.now();\r\n    const delayMs = Math.min(first.runAt - timestamp, TIMER_CHECK_PERIOD_MS);\r\n\r\n    debuglog(\"scheduleRealCallback: now:\", timestamp, \"delay:\", delayMs);\r\n    realCallbackKey = globalThis.setTimeout(runCallbacks, delayMs);\r\n}\r\n\r\nfunction runCallbacks(): void {\r\n    const timestamp = Date.now();\r\n    debuglog(\"runCallbacks: now:\", timestamp);\r\n\r\n    // get the list of things to call\r\n    const callbacksToRun: Callback[] = [];\r\n    // eslint-disable-next-line\r\n    while (true) {\r\n        const first = callbackList[0];\r\n        if (!first || first.runAt > timestamp) {\r\n            break;\r\n        }\r\n        const cb = callbackList.shift()!;\r\n        debuglog(\"runCallbacks: popping\", cb.key);\r\n        callbacksToRun.push(cb);\r\n    }\r\n\r\n    // reschedule the real callback before running our functions, to\r\n    // keep the codepaths the same whether or not our functions\r\n    // register their own setTimeouts.\r\n    scheduleRealCallback();\r\n\r\n    for (const cb of callbacksToRun) {\r\n        try {\r\n            cb.func.apply(globalThis, cb.params);\r\n        } catch (e) {\r\n            logger.error(\"Uncaught exception in callback function\", e);\r\n        }\r\n    }\r\n}\r\n\r\n/* search in a sorted array.\r\n *\r\n * returns the index of the last element for which func returns\r\n * greater than zero, or array.length if no such element exists.\r\n */\r\nfunction binarySearch<T>(array: T[], func: (v: T) => number): number {\r\n    // min is inclusive, max exclusive.\r\n    let min = 0;\r\n    let max = array.length;\r\n\r\n    while (min < max) {\r\n        const mid = (min + max) >> 1;\r\n        const res = func(array[mid]);\r\n        if (res > 0) {\r\n            // the element at 'mid' is too big; set it as the new max.\r\n            max = mid;\r\n        } else {\r\n            // the element at 'mid' is too small. 'min' is inclusive, so +1.\r\n            min = mid + 1;\r\n        }\r\n    }\r\n    // presumably, min==max now.\r\n    return min;\r\n}\r\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASA,MAAM,QAAQ,aAAa;;AAEpC;AACA;AACA,IAAMC,qBAAqB,GAAG,IAAI;;AAElC;AACA,IAAIC,KAAK,GAAG,CAAC;;AAEb;AACA,IAAIC,eAAwC;AAS5C;AACA;AACA,IAAMC,YAAwB,GAAG,EAAE;;AAEnC;AACA;AACA,IAAMC,QAAQ,GAAG,SAAXA,QAAQA,CAAA,EAAqC,CAAC,CAAC;;AAErD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,UAAUA,CAACC,IAAgC,EAAEC,OAAe,EAA4B;EAAA,SAAAC,IAAA,GAAAC,SAAA,CAAAC,MAAA,EAAvBC,MAAM,OAAAC,KAAA,CAAAJ,IAAA,OAAAA,IAAA,WAAAK,IAAA,MAAAA,IAAA,GAAAL,IAAA,EAAAK,IAAA;IAANF,MAAM,CAAAE,IAAA,QAAAJ,SAAA,CAAAI,IAAA;EAAA;EACnFN,OAAO,GAAGA,OAAO,IAAI,CAAC;EACtB,IAAIA,OAAO,GAAG,CAAC,EAAE;IACbA,OAAO,GAAG,CAAC;EACf;EAEA,IAAMO,KAAK,GAAGC,IAAI,CAACC,GAAG,CAAC,CAAC,GAAGT,OAAO;EAClC,IAAMU,GAAG,GAAGhB,KAAK,EAAE;EACnBG,QAAQ,CAAC,2BAA2B,EAAEa,GAAG,EAAE,IAAI,EAAEH,KAAK,EAAE,QAAQ,EAAEP,OAAO,EAAE,GAAG,CAAC;EAC/E,IAAMW,IAAI,GAAG;IACTJ,KAAK,EAAEA,KAAK;IACZR,IAAI,EAAEA,IAAI;IACVK,MAAM,EAAEA,MAAM;IACdM,GAAG,EAAEA;EACT,CAAC;;EAED;EACA,IAAME,GAAG,GAAGC,YAAY,CAACjB,YAAY,EAAE,UAAUkB,EAAE,EAAE;IACjD,OAAOA,EAAE,CAACP,KAAK,GAAGA,KAAK;EAC3B,CAAC,CAAC;EAEFX,YAAY,CAACmB,MAAM,CAACH,GAAG,EAAE,CAAC,EAAED,IAAI,CAAC;EACjCK,oBAAoB,CAAC,CAAC;EAEtB,OAAON,GAAG;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASO,YAAYA,CAACP,GAAW,EAAQ;EAC5C,IAAId,YAAY,CAACO,MAAM,KAAK,CAAC,EAAE;IAC3B;EACJ;;EAEA;EACA,IAAIe,CAAS;EACb,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGtB,YAAY,CAACO,MAAM,EAAEe,CAAC,EAAE,EAAE;IACtC,IAAMC,EAAE,GAAGvB,YAAY,CAACsB,CAAC,CAAC;IAC1B,IAAIC,EAAE,CAACT,GAAG,IAAIA,GAAG,EAAE;MACfd,YAAY,CAACmB,MAAM,CAACG,CAAC,EAAE,CAAC,CAAC;MACzB;IACJ;EACJ;;EAEA;EACA,IAAIA,CAAC,KAAK,CAAC,EAAE;IACTF,oBAAoB,CAAC,CAAC;EAC1B;AACJ;;AAEA;AACA,SAASA,oBAAoBA,CAAA,EAAS;EAClC,IAAIrB,eAAe,EAAE;IACjByB,UAAU,CAACH,YAAY,CAACtB,eAAiC,CAAC;EAC9D;EAEA,IAAM0B,KAAK,GAAGzB,YAAY,CAAC,CAAC,CAAC;EAE7B,IAAI,CAACyB,KAAK,EAAE;IACRxB,QAAQ,CAAC,2DAA2D,CAAC;IACrE;EACJ;EAEA,IAAMyB,SAAS,GAAGd,IAAI,CAACC,GAAG,CAAC,CAAC;EAC5B,IAAMT,OAAO,GAAGuB,IAAI,CAACC,GAAG,CAACH,KAAK,CAACd,KAAK,GAAGe,SAAS,EAAE7B,qBAAqB,CAAC;EAExEI,QAAQ,CAAC,4BAA4B,EAAEyB,SAAS,EAAE,QAAQ,EAAEtB,OAAO,CAAC;EACpEL,eAAe,GAAGyB,UAAU,CAACtB,UAAU,CAAC2B,YAAY,EAAEzB,OAAO,CAAC;AAClE;AAEA,SAASyB,YAAYA,CAAA,EAAS;EAC1B,IAAMH,SAAS,GAAGd,IAAI,CAACC,GAAG,CAAC,CAAC;EAC5BZ,QAAQ,CAAC,oBAAoB,EAAEyB,SAAS,CAAC;;EAEzC;EACA,IAAMI,cAA0B,GAAG,EAAE;EACrC;EACA,OAAO,IAAI,EAAE;IACT,IAAML,KAAK,GAAGzB,YAAY,CAAC,CAAC,CAAC;IAC7B,IAAI,CAACyB,KAAK,IAAIA,KAAK,CAACd,KAAK,GAAGe,SAAS,EAAE;MACnC;IACJ;IACA,IAAMH,EAAE,GAAGvB,YAAY,CAAC+B,KAAK,CAAC,CAAE;IAChC9B,QAAQ,CAAC,uBAAuB,EAAEsB,EAAE,CAACT,GAAG,CAAC;IACzCgB,cAAc,CAACE,IAAI,CAACT,EAAE,CAAC;EAC3B;;EAEA;EACA;EACA;EACAH,oBAAoB,CAAC,CAAC;EAEtB,KAAK,IAAMG,GAAE,IAAIO,cAAc,EAAE;IAC7B,IAAI;MACAP,GAAE,CAACpB,IAAI,CAAC8B,KAAK,CAACT,UAAU,EAAED,GAAE,CAACf,MAAM,CAAC;IACxC,CAAC,CAAC,OAAO0B,CAAC,EAAE;MACRtC,MAAM,CAACuC,KAAK,CAAC,yCAAyC,EAAED,CAAC,CAAC;IAC9D;EACJ;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA,SAASjB,YAAYA,CAAImB,KAAU,EAAEjC,IAAsB,EAAU;EACjE;EACA,IAAIyB,GAAG,GAAG,CAAC;EACX,IAAIS,GAAG,GAAGD,KAAK,CAAC7B,MAAM;EAEtB,OAAOqB,GAAG,GAAGS,GAAG,EAAE;IACd,IAAMC,GAAG,GAAIV,GAAG,GAAGS,GAAG,IAAK,CAAC;IAC5B,IAAME,GAAG,GAAGpC,IAAI,CAACiC,KAAK,CAACE,GAAG,CAAC,CAAC;IAC5B,IAAIC,GAAG,GAAG,CAAC,EAAE;MACT;MACAF,GAAG,GAAGC,GAAG;IACb,CAAC,MAAM;MACH;MACAV,GAAG,GAAGU,GAAG,GAAG,CAAC;IACjB;EACJ;EACA;EACA,OAAOV,GAAG;AACd","ignoreList":[]}
+{"version":3,"file":"realtime-callbacks.js","names":["logger","TIMER_CHECK_PERIOD_MS","count","realCallbackKey","callbackList","debuglog","setTimeout","func","delayMs","_len","arguments","length","params","Array","_key","runAt","Date","now","key","data","idx","binarySearch","el","splice","scheduleRealCallback","clearTimeout","i","cb","globalThis","first","timestamp","Math","min","runCallbacks","callbacksToRun","shift","push","apply","e","error","array","max","mid","res"],"sources":["../src/realtime-callbacks.ts"],"sourcesContent":["/*\nCopyright 2016 OpenMarket Ltd\nCopyright 2019 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/* A re-implementation of the javascript callback functions (setTimeout,\n * clearTimeout; setInterval and clearInterval are not yet implemented) which\n * try to improve handling of large clock jumps (as seen when\n * suspending/resuming the system).\n *\n * In particular, if a timeout would have fired while the system was suspended,\n * it will instead fire as soon as possible after resume.\n */\n\nimport { logger } from \"./logger.ts\";\n\n// we schedule a callback at least this often, to check if we've missed out on\n// some wall-clock time due to being suspended.\nconst TIMER_CHECK_PERIOD_MS = 1000;\n\n// counter, for making up ids to return from setTimeout\nlet count = 0;\n\n// the key for our callback with the real globalThis.setTimeout\nlet realCallbackKey: NodeJS.Timeout | number;\n\ntype Callback = {\n    runAt: number;\n    func: (...params: any[]) => void;\n    params: any[];\n    key: number;\n};\n\n// a sorted list of the callbacks to be run.\n// each is an object with keys [runAt, func, params, key].\nconst callbackList: Callback[] = [];\n\n// var debuglog = logger.log.bind(logger);\n/* istanbul ignore next */\nconst debuglog = function (...params: any[]): void {};\n\n/**\n * reimplementation of window.setTimeout, which will call the callback if\n * the wallclock time goes past the deadline.\n *\n * @param func -   callback to be called after a delay\n * @param delayMs -  number of milliseconds to delay by\n *\n * @returns an identifier for this callback, which may be passed into\n *                   clearTimeout later.\n */\nexport function setTimeout(func: (...params: any[]) => void, delayMs: number, ...params: any[]): number {\n    delayMs = delayMs || 0;\n    if (delayMs < 0) {\n        delayMs = 0;\n    }\n\n    const runAt = Date.now() + delayMs;\n    const key = count++;\n    debuglog(\"setTimeout: scheduling cb\", key, \"at\", runAt, \"(delay\", delayMs, \")\");\n    const data = {\n        runAt: runAt,\n        func: func,\n        params: params,\n        key: key,\n    };\n\n    // figure out where it goes in the list\n    const idx = binarySearch(callbackList, function (el) {\n        return el.runAt - runAt;\n    });\n\n    callbackList.splice(idx, 0, data);\n    scheduleRealCallback();\n\n    return key;\n}\n\n/**\n * reimplementation of window.clearTimeout, which mirrors setTimeout\n *\n * @param key -   result from an earlier setTimeout call\n */\nexport function clearTimeout(key: number): void {\n    if (callbackList.length === 0) {\n        return;\n    }\n\n    // remove the element from the list\n    let i: number;\n    for (i = 0; i < callbackList.length; i++) {\n        const cb = callbackList[i];\n        if (cb.key == key) {\n            callbackList.splice(i, 1);\n            break;\n        }\n    }\n\n    // iff it was the first one in the list, reschedule our callback.\n    if (i === 0) {\n        scheduleRealCallback();\n    }\n}\n\n// use the real globalThis.setTimeout to schedule a callback to runCallbacks.\nfunction scheduleRealCallback(): void {\n    if (realCallbackKey) {\n        globalThis.clearTimeout(realCallbackKey as NodeJS.Timeout);\n    }\n\n    const first = callbackList[0];\n\n    if (!first) {\n        debuglog(\"scheduleRealCallback: no more callbacks, not rescheduling\");\n        return;\n    }\n\n    const timestamp = Date.now();\n    const delayMs = Math.min(first.runAt - timestamp, TIMER_CHECK_PERIOD_MS);\n\n    debuglog(\"scheduleRealCallback: now:\", timestamp, \"delay:\", delayMs);\n    realCallbackKey = globalThis.setTimeout(runCallbacks, delayMs);\n}\n\nfunction runCallbacks(): void {\n    const timestamp = Date.now();\n    debuglog(\"runCallbacks: now:\", timestamp);\n\n    // get the list of things to call\n    const callbacksToRun: Callback[] = [];\n    // eslint-disable-next-line\n    while (true) {\n        const first = callbackList[0];\n        if (!first || first.runAt > timestamp) {\n            break;\n        }\n        const cb = callbackList.shift()!;\n        debuglog(\"runCallbacks: popping\", cb.key);\n        callbacksToRun.push(cb);\n    }\n\n    // reschedule the real callback before running our functions, to\n    // keep the codepaths the same whether or not our functions\n    // register their own setTimeouts.\n    scheduleRealCallback();\n\n    for (const cb of callbacksToRun) {\n        try {\n            cb.func.apply(globalThis, cb.params);\n        } catch (e) {\n            logger.error(\"Uncaught exception in callback function\", e);\n        }\n    }\n}\n\n/* search in a sorted array.\n *\n * returns the index of the last element for which func returns\n * greater than zero, or array.length if no such element exists.\n */\nfunction binarySearch<T>(array: T[], func: (v: T) => number): number {\n    // min is inclusive, max exclusive.\n    let min = 0;\n    let max = array.length;\n\n    while (min < max) {\n        const mid = (min + max) >> 1;\n        const res = func(array[mid]);\n        if (res > 0) {\n            // the element at 'mid' is too big; set it as the new max.\n            max = mid;\n        } else {\n            // the element at 'mid' is too small. 'min' is inclusive, so +1.\n            min = mid + 1;\n        }\n    }\n    // presumably, min==max now.\n    return min;\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASA,MAAM,QAAQ,aAAa;;AAEpC;AACA;AACA,IAAMC,qBAAqB,GAAG,IAAI;;AAElC;AACA,IAAIC,KAAK,GAAG,CAAC;;AAEb;AACA,IAAIC,eAAwC;AAS5C;AACA;AACA,IAAMC,YAAwB,GAAG,EAAE;;AAEnC;AACA;AACA,IAAMC,QAAQ,GAAG,SAAXA,QAAQA,CAAA,EAAqC,CAAC,CAAC;;AAErD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,UAAUA,CAACC,IAAgC,EAAEC,OAAe,EAA4B;EAAA,SAAAC,IAAA,GAAAC,SAAA,CAAAC,MAAA,EAAvBC,MAAM,OAAAC,KAAA,CAAAJ,IAAA,OAAAA,IAAA,WAAAK,IAAA,MAAAA,IAAA,GAAAL,IAAA,EAAAK,IAAA;IAANF,MAAM,CAAAE,IAAA,QAAAJ,SAAA,CAAAI,IAAA;EAAA;EACnFN,OAAO,GAAGA,OAAO,IAAI,CAAC;EACtB,IAAIA,OAAO,GAAG,CAAC,EAAE;IACbA,OAAO,GAAG,CAAC;EACf;EAEA,IAAMO,KAAK,GAAGC,IAAI,CAACC,GAAG,CAAC,CAAC,GAAGT,OAAO;EAClC,IAAMU,GAAG,GAAGhB,KAAK,EAAE;EACnBG,QAAQ,CAAC,2BAA2B,EAAEa,GAAG,EAAE,IAAI,EAAEH,KAAK,EAAE,QAAQ,EAAEP,OAAO,EAAE,GAAG,CAAC;EAC/E,IAAMW,IAAI,GAAG;IACTJ,KAAK,EAAEA,KAAK;IACZR,IAAI,EAAEA,IAAI;IACVK,MAAM,EAAEA,MAAM;IACdM,GAAG,EAAEA;EACT,CAAC;;EAED;EACA,IAAME,GAAG,GAAGC,YAAY,CAACjB,YAAY,EAAE,UAAUkB,EAAE,EAAE;IACjD,OAAOA,EAAE,CAACP,KAAK,GAAGA,KAAK;EAC3B,CAAC,CAAC;EAEFX,YAAY,CAACmB,MAAM,CAACH,GAAG,EAAE,CAAC,EAAED,IAAI,CAAC;EACjCK,oBAAoB,CAAC,CAAC;EAEtB,OAAON,GAAG;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASO,YAAYA,CAACP,GAAW,EAAQ;EAC5C,IAAId,YAAY,CAACO,MAAM,KAAK,CAAC,EAAE;IAC3B;EACJ;;EAEA;EACA,IAAIe,CAAS;EACb,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGtB,YAAY,CAACO,MAAM,EAAEe,CAAC,EAAE,EAAE;IACtC,IAAMC,EAAE,GAAGvB,YAAY,CAACsB,CAAC,CAAC;IAC1B,IAAIC,EAAE,CAACT,GAAG,IAAIA,GAAG,EAAE;MACfd,YAAY,CAACmB,MAAM,CAACG,CAAC,EAAE,CAAC,CAAC;MACzB;IACJ;EACJ;;EAEA;EACA,IAAIA,CAAC,KAAK,CAAC,EAAE;IACTF,oBAAoB,CAAC,CAAC;EAC1B;AACJ;;AAEA;AACA,SAASA,oBAAoBA,CAAA,EAAS;EAClC,IAAIrB,eAAe,EAAE;IACjByB,UAAU,CAACH,YAAY,CAACtB,eAAiC,CAAC;EAC9D;EAEA,IAAM0B,KAAK,GAAGzB,YAAY,CAAC,CAAC,CAAC;EAE7B,IAAI,CAACyB,KAAK,EAAE;IACRxB,QAAQ,CAAC,2DAA2D,CAAC;IACrE;EACJ;EAEA,IAAMyB,SAAS,GAAGd,IAAI,CAACC,GAAG,CAAC,CAAC;EAC5B,IAAMT,OAAO,GAAGuB,IAAI,CAACC,GAAG,CAACH,KAAK,CAACd,KAAK,GAAGe,SAAS,EAAE7B,qBAAqB,CAAC;EAExEI,QAAQ,CAAC,4BAA4B,EAAEyB,SAAS,EAAE,QAAQ,EAAEtB,OAAO,CAAC;EACpEL,eAAe,GAAGyB,UAAU,CAACtB,UAAU,CAAC2B,YAAY,EAAEzB,OAAO,CAAC;AAClE;AAEA,SAASyB,YAAYA,CAAA,EAAS;EAC1B,IAAMH,SAAS,GAAGd,IAAI,CAACC,GAAG,CAAC,CAAC;EAC5BZ,QAAQ,CAAC,oBAAoB,EAAEyB,SAAS,CAAC;;EAEzC;EACA,IAAMI,cAA0B,GAAG,EAAE;EACrC;EACA,OAAO,IAAI,EAAE;IACT,IAAML,KAAK,GAAGzB,YAAY,CAAC,CAAC,CAAC;IAC7B,IAAI,CAACyB,KAAK,IAAIA,KAAK,CAACd,KAAK,GAAGe,SAAS,EAAE;MACnC;IACJ;IACA,IAAMH,EAAE,GAAGvB,YAAY,CAAC+B,KAAK,CAAC,CAAE;IAChC9B,QAAQ,CAAC,uBAAuB,EAAEsB,EAAE,CAACT,GAAG,CAAC;IACzCgB,cAAc,CAACE,IAAI,CAACT,EAAE,CAAC;EAC3B;;EAEA;EACA;EACA;EACAH,oBAAoB,CAAC,CAAC;EAEtB,KAAK,IAAMG,GAAE,IAAIO,cAAc,EAAE;IAC7B,IAAI;MACAP,GAAE,CAACpB,IAAI,CAAC8B,KAAK,CAACT,UAAU,EAAED,GAAE,CAACf,MAAM,CAAC;IACxC,CAAC,CAAC,OAAO0B,CAAC,EAAE;MACRtC,MAAM,CAACuC,KAAK,CAAC,yCAAyC,EAAED,CAAC,CAAC;IAC9D;EACJ;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA,SAASjB,YAAYA,CAAImB,KAAU,EAAEjC,IAAsB,EAAU;EACjE;EACA,IAAIyB,GAAG,GAAG,CAAC;EACX,IAAIS,GAAG,GAAGD,KAAK,CAAC7B,MAAM;EAEtB,OAAOqB,GAAG,GAAGS,GAAG,EAAE;IACd,IAAMC,GAAG,GAAIV,GAAG,GAAGS,GAAG,IAAK,CAAC;IAC5B,IAAME,GAAG,GAAGpC,IAAI,CAACiC,KAAK,CAACE,GAAG,CAAC,CAAC;IAC5B,IAAIC,GAAG,GAAG,CAAC,EAAE;MACT;MACAF,GAAG,GAAGC,GAAG;IACb,CAAC,MAAM;MACH;MACAV,GAAG,GAAGU,GAAG,GAAG,CAAC;IACjB;EACJ;EACA;EACA,OAAOV,GAAG;AACd","ignoreList":[]}

package/lib/receipt-accumulator.js

@@ -1,32 +1,32 @@
 import _defineProperty from "@babel/runtime/helpers/defineProperty";
-/*
-Copyright 2023 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.
+/*
+Copyright 2023 The Matrix.org Foundation C.I.C.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
 */
 
 import { EventType } from "./@types/event.js";
 import { isSupportedReceiptType, MapWithDefault, recursiveMapToObject } from "./utils.js";
-/**
- * Summarises the read receipts within a room. Used by the sync accumulator.
- *
- * Given receipts for users, picks the most recently-received one and provides
- * the results in a new fake receipt event returned from
- * buildAccumulatedReceiptEvent().
- *
- * Handles unthreaded receipts and receipts in each thread separately, so the
- * returned event contains the most recently received unthreaded receipt, and
- * the most recently received receipt in each thread.
+/**
+ * Summarises the read receipts within a room. Used by the sync accumulator.
+ *
+ * Given receipts for users, picks the most recently-received one and provides
+ * the results in a new fake receipt event returned from
+ * buildAccumulatedReceiptEvent().
+ *
+ * Handles unthreaded receipts and receipts in each thread separately, so the
+ * returned event contains the most recently received unthreaded receipt, and
+ * the most recently received receipt in each thread.
  */
 export class ReceiptAccumulator {
   constructor() {
@@ -35,34 +35,34 @@ export class ReceiptAccumulator {
     /** thread_id -\> user_id -\> most-recently-received receipt for this thread */
     _defineProperty(this, "threadedReadReceipts", new MapWithDefault(() => new Map()));
   }
-  /**
-   * Provide an unthreaded receipt for this user. Overwrites any other
-   * unthreaded receipt we have for this user.
+  /**
+   * Provide an unthreaded receipt for this user. Overwrites any other
+   * unthreaded receipt we have for this user.
    */
   setUnthreaded(userId, receipt) {
     this.unthreadedReadReceipts.set(userId, receipt);
   }
 
-  /**
-   * Provide a receipt for this user in this thread. Overwrites any other
-   * receipt we have for this user in this thread.
+  /**
+   * Provide a receipt for this user in this thread. Overwrites any other
+   * receipt we have for this user in this thread.
    */
   setThreaded(threadId, userId, receipt) {
     this.threadedReadReceipts.getOrCreate(threadId).set(userId, receipt);
   }
 
-  /**
-   * @returns an iterator of pairs of [userId, AccumulatedReceipt] - all the
-   *          most recently-received unthreaded receipts for each user.
+  /**
+   * @returns an iterator of pairs of [userId, AccumulatedReceipt] - all the
+   *          most recently-received unthreaded receipts for each user.
    */
   allUnthreaded() {
     return this.unthreadedReadReceipts.entries();
   }
 
-  /**
-   * @returns an iterator of pairs of [userId, AccumulatedReceipt] - all the
-   *          most recently-received threaded receipts for each user, in all
-   *          threads.
+  /**
+   * @returns an iterator of pairs of [userId, AccumulatedReceipt] - all the
+   *          most recently-received threaded receipts for each user, in all
+   *          threads.
    */
   *allThreaded() {
     for (var receiptsForThread of this.threadedReadReceipts.values()) {
@@ -72,9 +72,9 @@ export class ReceiptAccumulator {
     }
   }
 
-  /**
-   * Given a list of ephemeral events, find the receipts and store the
-   * relevant ones to be returned later from buildAccumulatedReceiptEvent().
+  /**
+   * Given a list of ephemeral events, find the receipts and store the
+   * relevant ones to be returned later from buildAccumulatedReceiptEvent().
    */
   consumeEphemeralEvents(events) {
     events === null || events === void 0 || events.forEach(e => {
@@ -137,10 +137,10 @@ export class ReceiptAccumulator {
     });
   }
 
-  /**
-   * Build a receipt event that contains all relevant information for this
-   * room, taking the most recently received receipt for each user in an
-   * unthreaded context, and in each thread.
+  /**
+   * Build a receipt event that contains all relevant information for this
+   * room, taking the most recently received receipt for each user in an
+   * unthreaded context, and in each thread.
    */
   buildAccumulatedReceiptEvent(roomId) {
     var receiptEvent = {

package/lib/receipt-accumulator.js.map

@@ -1 +1 @@
-{"version":3,"file":"receipt-accumulator.js","names":["EventType","isSupportedReceiptType","MapWithDefault","recursiveMapToObject","ReceiptAccumulator","constructor","_defineProperty","Map","setUnthreaded","userId","receipt","unthreadedReadReceipts","set","setThreaded","threadId","threadedReadReceipts","getOrCreate","allUnthreaded","entries","allThreaded","receiptsForThread","values","e","consumeEphemeralEvents","events","forEach","type","Receipt","content","Object","keys","eventId","_ref","key","value","data","thread_id","buildAccumulatedReceiptEvent","roomId","receiptEvent","room_id","receiptEventContent","receiptData","size"],"sources":["../src/receipt-accumulator.ts"],"sourcesContent":["/*\r\nCopyright 2023 The Matrix.org Foundation C.I.C.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n*/\r\n\r\nimport { type IMinimalEvent } from \"./sync-accumulator.ts\";\r\nimport { EventType } from \"./@types/event.ts\";\r\nimport { isSupportedReceiptType, MapWithDefault, recursiveMapToObject } from \"./utils.ts\";\r\nimport { type IContent } from \"./models/event.ts\";\r\nimport { type ReceiptContent, type ReceiptType } from \"./@types/read_receipts.ts\";\r\n\r\ninterface AccumulatedReceipt {\r\n    data: IMinimalEvent;\r\n    type: ReceiptType;\r\n    eventId: string;\r\n}\r\n\r\n/**\r\n * Summarises the read receipts within a room. Used by the sync accumulator.\r\n *\r\n * Given receipts for users, picks the most recently-received one and provides\r\n * the results in a new fake receipt event returned from\r\n * buildAccumulatedReceiptEvent().\r\n *\r\n * Handles unthreaded receipts and receipts in each thread separately, so the\r\n * returned event contains the most recently received unthreaded receipt, and\r\n * the most recently received receipt in each thread.\r\n */\r\nexport class ReceiptAccumulator {\r\n    /** user_id -\\> most-recently-received unthreaded receipt */\r\n    private unthreadedReadReceipts: Map<string, AccumulatedReceipt> = new Map();\r\n\r\n    /** thread_id -\\> user_id -\\> most-recently-received receipt for this thread */\r\n    private threadedReadReceipts: MapWithDefault<string, Map<string, AccumulatedReceipt>> = new MapWithDefault(\r\n        () => new Map(),\r\n    );\r\n\r\n    /**\r\n     * Provide an unthreaded receipt for this user. Overwrites any other\r\n     * unthreaded receipt we have for this user.\r\n     */\r\n    private setUnthreaded(userId: string, receipt: AccumulatedReceipt): void {\r\n        this.unthreadedReadReceipts.set(userId, receipt);\r\n    }\r\n\r\n    /**\r\n     * Provide a receipt for this user in this thread. Overwrites any other\r\n     * receipt we have for this user in this thread.\r\n     */\r\n    private setThreaded(threadId: string, userId: string, receipt: AccumulatedReceipt): void {\r\n        this.threadedReadReceipts.getOrCreate(threadId).set(userId, receipt);\r\n    }\r\n\r\n    /**\r\n     * @returns an iterator of pairs of [userId, AccumulatedReceipt] - all the\r\n     *          most recently-received unthreaded receipts for each user.\r\n     */\r\n    private allUnthreaded(): IterableIterator<[string, AccumulatedReceipt]> {\r\n        return this.unthreadedReadReceipts.entries();\r\n    }\r\n\r\n    /**\r\n     * @returns an iterator of pairs of [userId, AccumulatedReceipt] - all the\r\n     *          most recently-received threaded receipts for each user, in all\r\n     *          threads.\r\n     */\r\n    private *allThreaded(): IterableIterator<[string, AccumulatedReceipt]> {\r\n        for (const receiptsForThread of this.threadedReadReceipts.values()) {\r\n            for (const e of receiptsForThread.entries()) {\r\n                yield e;\r\n            }\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Given a list of ephemeral events, find the receipts and store the\r\n     * relevant ones to be returned later from buildAccumulatedReceiptEvent().\r\n     */\r\n    public consumeEphemeralEvents(events: IMinimalEvent[] | undefined): void {\r\n        events?.forEach((e) => {\r\n            if (e.type !== EventType.Receipt || !e.content) {\r\n                // This means we'll drop unknown ephemeral events but that\r\n                // seems okay.\r\n                return;\r\n            }\r\n\r\n            // Handle m.receipt events. They clobber based on:\r\n            //   (user_id, receipt_type)\r\n            // but they are keyed in the event as:\r\n            //   content:{ $event_id: { $receipt_type: { $user_id: {json} }}}\r\n            // so store them in the former so we can accumulate receipt deltas\r\n            // quickly and efficiently (we expect a lot of them). Fold the\r\n            // receipt type into the key name since we only have 1 at the\r\n            // moment (m.read) and nested JSON objects are slower and more\r\n            // of a hassle to work with. We'll inflate this back out when\r\n            // getJSON() is called.\r\n            Object.keys(e.content).forEach((eventId) => {\r\n                Object.entries<ReceiptContent>(e.content[eventId]).forEach(([key, value]) => {\r\n                    if (!isSupportedReceiptType(key)) return;\r\n\r\n                    for (const userId of Object.keys(value)) {\r\n                        const data = e.content[eventId][key][userId];\r\n\r\n                        const receipt = {\r\n                            data: e.content[eventId][key][userId],\r\n                            type: key as ReceiptType,\r\n                            eventId,\r\n                        };\r\n\r\n                        // In a world that supports threads, read receipts normally have\r\n                        // a `thread_id` which is either the thread they belong in or\r\n                        // `MAIN_ROOM_TIMELINE`, so we normally use `setThreaded(...)`\r\n                        // here. The `MAIN_ROOM_TIMELINE` is just treated as another\r\n                        // thread.\r\n                        //\r\n                        // We still encounter read receipts that are \"unthreaded\"\r\n                        // (missing the `thread_id` property). These come from clients\r\n                        // that don't support threads, and from threaded clients that\r\n                        // are doing a \"Mark room as read\" operation. Unthreaded\r\n                        // receipts mark everything \"before\" them as read, in all\r\n                        // threads, where \"before\" means in Sync Order i.e. the order\r\n                        // the events were received from the homeserver in a sync.\r\n                        // [Note: we have some bugs where we use timestamp order instead\r\n                        // of Sync Order, because we don't correctly remember the Sync\r\n                        // Order. See #3325.]\r\n                        //\r\n                        // Calling the wrong method will cause incorrect behavior like\r\n                        // messages re-appearing as \"new\" when you already read them\r\n                        // previously.\r\n                        if (!data.thread_id) {\r\n                            this.setUnthreaded(userId, receipt);\r\n                        } else {\r\n                            this.setThreaded(data.thread_id, userId, receipt);\r\n                        }\r\n                    }\r\n                });\r\n            });\r\n        });\r\n    }\r\n\r\n    /**\r\n     * Build a receipt event that contains all relevant information for this\r\n     * room, taking the most recently received receipt for each user in an\r\n     * unthreaded context, and in each thread.\r\n     */\r\n    public buildAccumulatedReceiptEvent(roomId: string): IMinimalEvent | null {\r\n        const receiptEvent: IMinimalEvent = {\r\n            type: EventType.Receipt,\r\n            room_id: roomId,\r\n            content: {\r\n                // $event_id: { \"m.read\": { $user_id: $json } }\r\n            } as IContent,\r\n        };\r\n\r\n        const receiptEventContent: MapWithDefault<\r\n            string,\r\n            MapWithDefault<ReceiptType, Map<string, object>>\r\n        > = new MapWithDefault(() => new MapWithDefault(() => new Map()));\r\n\r\n        for (const [userId, receiptData] of this.allUnthreaded()) {\r\n            receiptEventContent\r\n                .getOrCreate(receiptData.eventId)\r\n                .getOrCreate(receiptData.type)\r\n                .set(userId, receiptData.data);\r\n        }\r\n\r\n        for (const [userId, receiptData] of this.allThreaded()) {\r\n            receiptEventContent\r\n                .getOrCreate(receiptData.eventId)\r\n                .getOrCreate(receiptData.type)\r\n                .set(userId, receiptData.data);\r\n        }\r\n\r\n        receiptEvent.content = recursiveMapToObject(receiptEventContent);\r\n\r\n        return receiptEventContent.size > 0 ? receiptEvent : null;\r\n    }\r\n}\r\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAGA,SAASA,SAAS,QAAQ,mBAAmB;AAC7C,SAASC,sBAAsB,EAAEC,cAAc,EAAEC,oBAAoB,QAAQ,YAAY;AAUzF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,MAAMC,kBAAkB,CAAC;EAAAC,YAAA;IAC5B;IAAAC,eAAA,iCACkE,IAAIC,GAAG,CAAC,CAAC;IAE3E;IAAAD,eAAA,+BACwF,IAAIJ,cAAc,CACtG,MAAM,IAAIK,GAAG,CAAC,CAClB,CAAC;EAAA;EAED;AACJ;AACA;AACA;EACYC,aAAaA,CAACC,MAAc,EAAEC,OAA2B,EAAQ;IACrE,IAAI,CAACC,sBAAsB,CAACC,GAAG,CAACH,MAAM,EAAEC,OAAO,CAAC;EACpD;;EAEA;AACJ;AACA;AACA;EACYG,WAAWA,CAACC,QAAgB,EAAEL,MAAc,EAAEC,OAA2B,EAAQ;IACrF,IAAI,CAACK,oBAAoB,CAACC,WAAW,CAACF,QAAQ,CAAC,CAACF,GAAG,CAACH,MAAM,EAAEC,OAAO,CAAC;EACxE;;EAEA;AACJ;AACA;AACA;EACYO,aAAaA,CAAA,EAAmD;IACpE,OAAO,IAAI,CAACN,sBAAsB,CAACO,OAAO,CAAC,CAAC;EAChD;;EAEA;AACJ;AACA;AACA;AACA;EACI,CAASC,WAAWA,CAAA,EAAmD;IACnE,KAAK,IAAMC,iBAAiB,IAAI,IAAI,CAACL,oBAAoB,CAACM,MAAM,CAAC,CAAC,EAAE;MAChE,KAAK,IAAMC,CAAC,IAAIF,iBAAiB,CAACF,OAAO,CAAC,CAAC,EAAE;QACzC,MAAMI,CAAC;MACX;IACJ;EACJ;;EAEA;AACJ;AACA;AACA;EACWC,sBAAsBA,CAACC,MAAmC,EAAQ;IACrEA,MAAM,aAANA,MAAM,eAANA,MAAM,CAAEC,OAAO,CAAEH,CAAC,IAAK;MACnB,IAAIA,CAAC,CAACI,IAAI,KAAK1B,SAAS,CAAC2B,OAAO,IAAI,CAACL,CAAC,CAACM,OAAO,EAAE;QAC5C;QACA;QACA;MACJ;;MAEA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACAC,MAAM,CAACC,IAAI,CAACR,CAAC,CAACM,OAAO,CAAC,CAACH,OAAO,CAAEM,OAAO,IAAK;QACxCF,MAAM,CAACX,OAAO,CAAiBI,CAAC,CAACM,OAAO,CAACG,OAAO,CAAC,CAAC,CAACN,OAAO,CAACO,IAAA,IAAkB;UAAA,IAAjB,CAACC,GAAG,EAAEC,KAAK,CAAC,GAAAF,IAAA;UACpE,IAAI,CAAC/B,sBAAsB,CAACgC,GAAG,CAAC,EAAE;UAElC,KAAK,IAAMxB,MAAM,IAAIoB,MAAM,CAACC,IAAI,CAACI,KAAK,CAAC,EAAE;YACrC,IAAMC,IAAI,GAAGb,CAAC,CAACM,OAAO,CAACG,OAAO,CAAC,CAACE,GAAG,CAAC,CAACxB,MAAM,CAAC;YAE5C,IAAMC,OAAO,GAAG;cACZyB,IAAI,EAAEb,CAAC,CAACM,OAAO,CAACG,OAAO,CAAC,CAACE,GAAG,CAAC,CAACxB,MAAM,CAAC;cACrCiB,IAAI,EAAEO,GAAkB;cACxBF;YACJ,CAAC;;YAED;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA,IAAI,CAACI,IAAI,CAACC,SAAS,EAAE;cACjB,IAAI,CAAC5B,aAAa,CAACC,MAAM,EAAEC,OAAO,CAAC;YACvC,CAAC,MAAM;cACH,IAAI,CAACG,WAAW,CAACsB,IAAI,CAACC,SAAS,EAAE3B,MAAM,EAAEC,OAAO,CAAC;YACrD;UACJ;QACJ,CAAC,CAAC;MACN,CAAC,CAAC;IACN,CAAC,CAAC;EACN;;EAEA;AACJ;AACA;AACA;AACA;EACW2B,4BAA4BA,CAACC,MAAc,EAAwB;IACtE,IAAMC,YAA2B,GAAG;MAChCb,IAAI,EAAE1B,SAAS,CAAC2B,OAAO;MACvBa,OAAO,EAAEF,MAAM;MACfV,OAAO,EAAE;QACL;MAAA;IAER,CAAC;IAED,IAAMa,mBAGL,GAAG,IAAIvC,cAAc,CAAC,MAAM,IAAIA,cAAc,CAAC,MAAM,IAAIK,GAAG,CAAC,CAAC,CAAC,CAAC;IAEjE,KAAK,IAAM,CAACE,MAAM,EAAEiC,WAAW,CAAC,IAAI,IAAI,CAACzB,aAAa,CAAC,CAAC,EAAE;MACtDwB,mBAAmB,CACdzB,WAAW,CAAC0B,WAAW,CAACX,OAAO,CAAC,CAChCf,WAAW,CAAC0B,WAAW,CAAChB,IAAI,CAAC,CAC7Bd,GAAG,CAACH,MAAM,EAAEiC,WAAW,CAACP,IAAI,CAAC;IACtC;IAEA,KAAK,IAAM,CAAC1B,OAAM,EAAEiC,YAAW,CAAC,IAAI,IAAI,CAACvB,WAAW,CAAC,CAAC,EAAE;MACpDsB,mBAAmB,CACdzB,WAAW,CAAC0B,YAAW,CAACX,OAAO,CAAC,CAChCf,WAAW,CAAC0B,YAAW,CAAChB,IAAI,CAAC,CAC7Bd,GAAG,CAACH,OAAM,EAAEiC,YAAW,CAACP,IAAI,CAAC;IACtC;IAEAI,YAAY,CAACX,OAAO,GAAGzB,oBAAoB,CAACsC,mBAAmB,CAAC;IAEhE,OAAOA,mBAAmB,CAACE,IAAI,GAAG,CAAC,GAAGJ,YAAY,GAAG,IAAI;EAC7D;AACJ","ignoreList":[]}
+{"version":3,"file":"receipt-accumulator.js","names":["EventType","isSupportedReceiptType","MapWithDefault","recursiveMapToObject","ReceiptAccumulator","constructor","_defineProperty","Map","setUnthreaded","userId","receipt","unthreadedReadReceipts","set","setThreaded","threadId","threadedReadReceipts","getOrCreate","allUnthreaded","entries","allThreaded","receiptsForThread","values","e","consumeEphemeralEvents","events","forEach","type","Receipt","content","Object","keys","eventId","_ref","key","value","data","thread_id","buildAccumulatedReceiptEvent","roomId","receiptEvent","room_id","receiptEventContent","receiptData","size"],"sources":["../src/receipt-accumulator.ts"],"sourcesContent":["/*\nCopyright 2023 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nimport { type IMinimalEvent } from \"./sync-accumulator.ts\";\nimport { EventType } from \"./@types/event.ts\";\nimport { isSupportedReceiptType, MapWithDefault, recursiveMapToObject } from \"./utils.ts\";\nimport { type IContent } from \"./models/event.ts\";\nimport { type ReceiptContent, type ReceiptType } from \"./@types/read_receipts.ts\";\n\ninterface AccumulatedReceipt {\n    data: IMinimalEvent;\n    type: ReceiptType;\n    eventId: string;\n}\n\n/**\n * Summarises the read receipts within a room. Used by the sync accumulator.\n *\n * Given receipts for users, picks the most recently-received one and provides\n * the results in a new fake receipt event returned from\n * buildAccumulatedReceiptEvent().\n *\n * Handles unthreaded receipts and receipts in each thread separately, so the\n * returned event contains the most recently received unthreaded receipt, and\n * the most recently received receipt in each thread.\n */\nexport class ReceiptAccumulator {\n    /** user_id -\\> most-recently-received unthreaded receipt */\n    private unthreadedReadReceipts: Map<string, AccumulatedReceipt> = new Map();\n\n    /** thread_id -\\> user_id -\\> most-recently-received receipt for this thread */\n    private threadedReadReceipts: MapWithDefault<string, Map<string, AccumulatedReceipt>> = new MapWithDefault(\n        () => new Map(),\n    );\n\n    /**\n     * Provide an unthreaded receipt for this user. Overwrites any other\n     * unthreaded receipt we have for this user.\n     */\n    private setUnthreaded(userId: string, receipt: AccumulatedReceipt): void {\n        this.unthreadedReadReceipts.set(userId, receipt);\n    }\n\n    /**\n     * Provide a receipt for this user in this thread. Overwrites any other\n     * receipt we have for this user in this thread.\n     */\n    private setThreaded(threadId: string, userId: string, receipt: AccumulatedReceipt): void {\n        this.threadedReadReceipts.getOrCreate(threadId).set(userId, receipt);\n    }\n\n    /**\n     * @returns an iterator of pairs of [userId, AccumulatedReceipt] - all the\n     *          most recently-received unthreaded receipts for each user.\n     */\n    private allUnthreaded(): IterableIterator<[string, AccumulatedReceipt]> {\n        return this.unthreadedReadReceipts.entries();\n    }\n\n    /**\n     * @returns an iterator of pairs of [userId, AccumulatedReceipt] - all the\n     *          most recently-received threaded receipts for each user, in all\n     *          threads.\n     */\n    private *allThreaded(): IterableIterator<[string, AccumulatedReceipt]> {\n        for (const receiptsForThread of this.threadedReadReceipts.values()) {\n            for (const e of receiptsForThread.entries()) {\n                yield e;\n            }\n        }\n    }\n\n    /**\n     * Given a list of ephemeral events, find the receipts and store the\n     * relevant ones to be returned later from buildAccumulatedReceiptEvent().\n     */\n    public consumeEphemeralEvents(events: IMinimalEvent[] | undefined): void {\n        events?.forEach((e) => {\n            if (e.type !== EventType.Receipt || !e.content) {\n                // This means we'll drop unknown ephemeral events but that\n                // seems okay.\n                return;\n            }\n\n            // Handle m.receipt events. They clobber based on:\n            //   (user_id, receipt_type)\n            // but they are keyed in the event as:\n            //   content:{ $event_id: { $receipt_type: { $user_id: {json} }}}\n            // so store them in the former so we can accumulate receipt deltas\n            // quickly and efficiently (we expect a lot of them). Fold the\n            // receipt type into the key name since we only have 1 at the\n            // moment (m.read) and nested JSON objects are slower and more\n            // of a hassle to work with. We'll inflate this back out when\n            // getJSON() is called.\n            Object.keys(e.content).forEach((eventId) => {\n                Object.entries<ReceiptContent>(e.content[eventId]).forEach(([key, value]) => {\n                    if (!isSupportedReceiptType(key)) return;\n\n                    for (const userId of Object.keys(value)) {\n                        const data = e.content[eventId][key][userId];\n\n                        const receipt = {\n                            data: e.content[eventId][key][userId],\n                            type: key as ReceiptType,\n                            eventId,\n                        };\n\n                        // In a world that supports threads, read receipts normally have\n                        // a `thread_id` which is either the thread they belong in or\n                        // `MAIN_ROOM_TIMELINE`, so we normally use `setThreaded(...)`\n                        // here. The `MAIN_ROOM_TIMELINE` is just treated as another\n                        // thread.\n                        //\n                        // We still encounter read receipts that are \"unthreaded\"\n                        // (missing the `thread_id` property). These come from clients\n                        // that don't support threads, and from threaded clients that\n                        // are doing a \"Mark room as read\" operation. Unthreaded\n                        // receipts mark everything \"before\" them as read, in all\n                        // threads, where \"before\" means in Sync Order i.e. the order\n                        // the events were received from the homeserver in a sync.\n                        // [Note: we have some bugs where we use timestamp order instead\n                        // of Sync Order, because we don't correctly remember the Sync\n                        // Order. See #3325.]\n                        //\n                        // Calling the wrong method will cause incorrect behavior like\n                        // messages re-appearing as \"new\" when you already read them\n                        // previously.\n                        if (!data.thread_id) {\n                            this.setUnthreaded(userId, receipt);\n                        } else {\n                            this.setThreaded(data.thread_id, userId, receipt);\n                        }\n                    }\n                });\n            });\n        });\n    }\n\n    /**\n     * Build a receipt event that contains all relevant information for this\n     * room, taking the most recently received receipt for each user in an\n     * unthreaded context, and in each thread.\n     */\n    public buildAccumulatedReceiptEvent(roomId: string): IMinimalEvent | null {\n        const receiptEvent: IMinimalEvent = {\n            type: EventType.Receipt,\n            room_id: roomId,\n            content: {\n                // $event_id: { \"m.read\": { $user_id: $json } }\n            } as IContent,\n        };\n\n        const receiptEventContent: MapWithDefault<\n            string,\n            MapWithDefault<ReceiptType, Map<string, object>>\n        > = new MapWithDefault(() => new MapWithDefault(() => new Map()));\n\n        for (const [userId, receiptData] of this.allUnthreaded()) {\n            receiptEventContent\n                .getOrCreate(receiptData.eventId)\n                .getOrCreate(receiptData.type)\n                .set(userId, receiptData.data);\n        }\n\n        for (const [userId, receiptData] of this.allThreaded()) {\n            receiptEventContent\n                .getOrCreate(receiptData.eventId)\n                .getOrCreate(receiptData.type)\n                .set(userId, receiptData.data);\n        }\n\n        receiptEvent.content = recursiveMapToObject(receiptEventContent);\n\n        return receiptEventContent.size > 0 ? receiptEvent : null;\n    }\n}\n"],"mappings":";AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAGA,SAASA,SAAS,QAAQ,mBAAmB;AAC7C,SAASC,sBAAsB,EAAEC,cAAc,EAAEC,oBAAoB,QAAQ,YAAY;AAUzF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,MAAMC,kBAAkB,CAAC;EAAAC,YAAA;IAC5B;IAAAC,eAAA,iCACkE,IAAIC,GAAG,CAAC,CAAC;IAE3E;IAAAD,eAAA,+BACwF,IAAIJ,cAAc,CACtG,MAAM,IAAIK,GAAG,CAAC,CAClB,CAAC;EAAA;EAED;AACJ;AACA;AACA;EACYC,aAAaA,CAACC,MAAc,EAAEC,OAA2B,EAAQ;IACrE,IAAI,CAACC,sBAAsB,CAACC,GAAG,CAACH,MAAM,EAAEC,OAAO,CAAC;EACpD;;EAEA;AACJ;AACA;AACA;EACYG,WAAWA,CAACC,QAAgB,EAAEL,MAAc,EAAEC,OAA2B,EAAQ;IACrF,IAAI,CAACK,oBAAoB,CAACC,WAAW,CAACF,QAAQ,CAAC,CAACF,GAAG,CAACH,MAAM,EAAEC,OAAO,CAAC;EACxE;;EAEA;AACJ;AACA;AACA;EACYO,aAAaA,CAAA,EAAmD;IACpE,OAAO,IAAI,CAACN,sBAAsB,CAACO,OAAO,CAAC,CAAC;EAChD;;EAEA;AACJ;AACA;AACA;AACA;EACI,CAASC,WAAWA,CAAA,EAAmD;IACnE,KAAK,IAAMC,iBAAiB,IAAI,IAAI,CAACL,oBAAoB,CAACM,MAAM,CAAC,CAAC,EAAE;MAChE,KAAK,IAAMC,CAAC,IAAIF,iBAAiB,CAACF,OAAO,CAAC,CAAC,EAAE;QACzC,MAAMI,CAAC;MACX;IACJ;EACJ;;EAEA;AACJ;AACA;AACA;EACWC,sBAAsBA,CAACC,MAAmC,EAAQ;IACrEA,MAAM,aAANA,MAAM,eAANA,MAAM,CAAEC,OAAO,CAAEH,CAAC,IAAK;MACnB,IAAIA,CAAC,CAACI,IAAI,KAAK1B,SAAS,CAAC2B,OAAO,IAAI,CAACL,CAAC,CAACM,OAAO,EAAE;QAC5C;QACA;QACA;MACJ;;MAEA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACAC,MAAM,CAACC,IAAI,CAACR,CAAC,CAACM,OAAO,CAAC,CAACH,OAAO,CAAEM,OAAO,IAAK;QACxCF,MAAM,CAACX,OAAO,CAAiBI,CAAC,CAACM,OAAO,CAACG,OAAO,CAAC,CAAC,CAACN,OAAO,CAACO,IAAA,IAAkB;UAAA,IAAjB,CAACC,GAAG,EAAEC,KAAK,CAAC,GAAAF,IAAA;UACpE,IAAI,CAAC/B,sBAAsB,CAACgC,GAAG,CAAC,EAAE;UAElC,KAAK,IAAMxB,MAAM,IAAIoB,MAAM,CAACC,IAAI,CAACI,KAAK,CAAC,EAAE;YACrC,IAAMC,IAAI,GAAGb,CAAC,CAACM,OAAO,CAACG,OAAO,CAAC,CAACE,GAAG,CAAC,CAACxB,MAAM,CAAC;YAE5C,IAAMC,OAAO,GAAG;cACZyB,IAAI,EAAEb,CAAC,CAACM,OAAO,CAACG,OAAO,CAAC,CAACE,GAAG,CAAC,CAACxB,MAAM,CAAC;cACrCiB,IAAI,EAAEO,GAAkB;cACxBF;YACJ,CAAC;;YAED;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA;YACA,IAAI,CAACI,IAAI,CAACC,SAAS,EAAE;cACjB,IAAI,CAAC5B,aAAa,CAACC,MAAM,EAAEC,OAAO,CAAC;YACvC,CAAC,MAAM;cACH,IAAI,CAACG,WAAW,CAACsB,IAAI,CAACC,SAAS,EAAE3B,MAAM,EAAEC,OAAO,CAAC;YACrD;UACJ;QACJ,CAAC,CAAC;MACN,CAAC,CAAC;IACN,CAAC,CAAC;EACN;;EAEA;AACJ;AACA;AACA;AACA;EACW2B,4BAA4BA,CAACC,MAAc,EAAwB;IACtE,IAAMC,YAA2B,GAAG;MAChCb,IAAI,EAAE1B,SAAS,CAAC2B,OAAO;MACvBa,OAAO,EAAEF,MAAM;MACfV,OAAO,EAAE;QACL;MAAA;IAER,CAAC;IAED,IAAMa,mBAGL,GAAG,IAAIvC,cAAc,CAAC,MAAM,IAAIA,cAAc,CAAC,MAAM,IAAIK,GAAG,CAAC,CAAC,CAAC,CAAC;IAEjE,KAAK,IAAM,CAACE,MAAM,EAAEiC,WAAW,CAAC,IAAI,IAAI,CAACzB,aAAa,CAAC,CAAC,EAAE;MACtDwB,mBAAmB,CACdzB,WAAW,CAAC0B,WAAW,CAACX,OAAO,CAAC,CAChCf,WAAW,CAAC0B,WAAW,CAAChB,IAAI,CAAC,CAC7Bd,GAAG,CAACH,MAAM,EAAEiC,WAAW,CAACP,IAAI,CAAC;IACtC;IAEA,KAAK,IAAM,CAAC1B,OAAM,EAAEiC,YAAW,CAAC,IAAI,IAAI,CAACvB,WAAW,CAAC,CAAC,EAAE;MACpDsB,mBAAmB,CACdzB,WAAW,CAAC0B,YAAW,CAACX,OAAO,CAAC,CAChCf,WAAW,CAAC0B,YAAW,CAAChB,IAAI,CAAC,CAC7Bd,GAAG,CAACH,OAAM,EAAEiC,YAAW,CAACP,IAAI,CAAC;IACtC;IAEAI,YAAY,CAACX,OAAO,GAAGzB,oBAAoB,CAACsC,mBAAmB,CAAC;IAEhE,OAAOA,mBAAmB,CAACE,IAAI,GAAG,CAAC,GAAGJ,YAAY,GAAG,IAAI;EAC7D;AACJ","ignoreList":[]}

package/lib/rendezvous/RendezvousChannel.js.map

@@ -1 +1 @@
-{"version":3,"file":"RendezvousChannel.js","names":[],"sources":["../../src/rendezvous/RendezvousChannel.ts"],"sourcesContent":["/*\r\nCopyright 2022 The Matrix.org Foundation C.I.C.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n*/\r\n\r\nimport { type RendezvousCode, type RendezvousIntent, type RendezvousFailureReason } from \"./index.ts\";\r\n\r\nexport interface RendezvousChannel<T> {\r\n    /**\r\n     * @returns the checksum/confirmation digits to be shown to the user\r\n     */\r\n    connect(): Promise<string>;\r\n\r\n    /**\r\n     * Send a payload via the channel.\r\n     * @param data - payload to send\r\n     */\r\n    send(data: T): Promise<void>;\r\n\r\n    /**\r\n     * Receive a payload from the channel.\r\n     * @returns the received payload\r\n     */\r\n    receive(): Promise<Partial<T> | undefined>;\r\n\r\n    /**\r\n     * Close the channel and clear up any resources.\r\n     */\r\n    close(): Promise<void>;\r\n\r\n    /**\r\n     * @returns a representation of the channel that can be encoded in a QR or similar\r\n     */\r\n    generateCode(intent: RendezvousIntent): Promise<RendezvousCode>;\r\n\r\n    cancel(reason: RendezvousFailureReason): Promise<void>;\r\n}\r\n"],"mappings":"","ignoreList":[]}
+{"version":3,"file":"RendezvousChannel.js","names":[],"sources":["../../src/rendezvous/RendezvousChannel.ts"],"sourcesContent":["/*\nCopyright 2022 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nimport { type RendezvousCode, type RendezvousIntent, type RendezvousFailureReason } from \"./index.ts\";\n\nexport interface RendezvousChannel<T> {\n    /**\n     * @returns the checksum/confirmation digits to be shown to the user\n     */\n    connect(): Promise<string>;\n\n    /**\n     * Send a payload via the channel.\n     * @param data - payload to send\n     */\n    send(data: T): Promise<void>;\n\n    /**\n     * Receive a payload from the channel.\n     * @returns the received payload\n     */\n    receive(): Promise<Partial<T> | undefined>;\n\n    /**\n     * Close the channel and clear up any resources.\n     */\n    close(): Promise<void>;\n\n    /**\n     * @returns a representation of the channel that can be encoded in a QR or similar\n     */\n    generateCode(intent: RendezvousIntent): Promise<RendezvousCode>;\n\n    cancel(reason: RendezvousFailureReason): Promise<void>;\n}\n"],"mappings":"","ignoreList":[]}

package/lib/rendezvous/RendezvousCode.js.map

@@ -1 +1 @@
-{"version":3,"file":"RendezvousCode.js","names":[],"sources":["../../src/rendezvous/RendezvousCode.ts"],"sourcesContent":["/*\r\nCopyright 2022 The Matrix.org Foundation C.I.C.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n*/\r\n\r\nimport { type RendezvousTransportDetails, type RendezvousIntent } from \"./index.ts\";\r\n\r\nexport interface RendezvousCode {\r\n    intent: RendezvousIntent;\r\n    rendezvous?: {\r\n        transport: RendezvousTransportDetails;\r\n        algorithm: string;\r\n    };\r\n}\r\n"],"mappings":"","ignoreList":[]}
+{"version":3,"file":"RendezvousCode.js","names":[],"sources":["../../src/rendezvous/RendezvousCode.ts"],"sourcesContent":["/*\nCopyright 2022 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nimport { type RendezvousTransportDetails, type RendezvousIntent } from \"./index.ts\";\n\nexport interface RendezvousCode {\n    intent: RendezvousIntent;\n    rendezvous?: {\n        transport: RendezvousTransportDetails;\n        algorithm: string;\n    };\n}\n"],"mappings":"","ignoreList":[]}

package/lib/rendezvous/RendezvousError.js

@@ -1,17 +1,17 @@
-/*
-Copyright 2022 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.
+/*
+Copyright 2022 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.
 */
 
 export class RendezvousError extends Error {

package/lib/rendezvous/RendezvousError.js.map

@@ -1 +1 @@
-{"version":3,"file":"RendezvousError.js","names":["RendezvousError","Error","constructor","message","code"],"sources":["../../src/rendezvous/RendezvousError.ts"],"sourcesContent":["/*\r\nCopyright 2022 The Matrix.org Foundation C.I.C.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n*/\r\n\r\nimport { type RendezvousFailureReason } from \"./index.ts\";\r\n\r\nexport class RendezvousError extends Error {\r\n    public constructor(\r\n        message: string,\r\n        public readonly code: RendezvousFailureReason,\r\n    ) {\r\n        super(message);\r\n    }\r\n}\r\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAIA,OAAO,MAAMA,eAAe,SAASC,KAAK,CAAC;EAChCC,WAAWA,CACdC,OAAe,EACCC,IAA6B,EAC/C;IACE,KAAK,CAACD,OAAO,CAAC;IAAC,KAFCC,IAA6B,GAA7BA,IAA6B;EAGjD;AACJ","ignoreList":[]}
+{"version":3,"file":"RendezvousError.js","names":["RendezvousError","Error","constructor","message","code"],"sources":["../../src/rendezvous/RendezvousError.ts"],"sourcesContent":["/*\nCopyright 2022 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nimport { type RendezvousFailureReason } from \"./index.ts\";\n\nexport class RendezvousError extends Error {\n    public constructor(\n        message: string,\n        public readonly code: RendezvousFailureReason,\n    ) {\n        super(message);\n    }\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAIA,OAAO,MAAMA,eAAe,SAASC,KAAK,CAAC;EAChCC,WAAWA,CACdC,OAAe,EACCC,IAA6B,EAC/C;IACE,KAAK,CAACD,OAAO,CAAC;IAAC,KAFCC,IAA6B,GAA7BA,IAA6B;EAGjD;AACJ","ignoreList":[]}

package/lib/rendezvous/RendezvousFailureReason.js

@@ -1,17 +1,17 @@
-/*
-Copyright 2022 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.
+/*
+Copyright 2022 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.
 */
 
 export var MSC4108FailureReason = /*#__PURE__*/function (MSC4108FailureReason) {

package/lib/rendezvous/RendezvousFailureReason.js.map

@@ -1 +1 @@
-{"version":3,"file":"RendezvousFailureReason.js","names":["MSC4108FailureReason","ClientRendezvousFailureReason"],"sources":["../../src/rendezvous/RendezvousFailureReason.ts"],"sourcesContent":["/*\r\nCopyright 2022 The Matrix.org Foundation C.I.C.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n*/\r\n\r\nexport type RendezvousFailureListener = (reason: RendezvousFailureReason) => void;\r\n\r\nexport type RendezvousFailureReason = MSC4108FailureReason | ClientRendezvousFailureReason;\r\n\r\nexport enum MSC4108FailureReason {\r\n    AuthorizationExpired = \"authorization_expired\",\r\n    DeviceAlreadyExists = \"device_already_exists\",\r\n    DeviceNotFound = \"device_not_found\",\r\n    UnexpectedMessageReceived = \"unexpected_message_received\",\r\n    UnsupportedProtocol = \"unsupported_protocol\",\r\n    UserCancelled = \"user_cancelled\",\r\n}\r\n\r\nexport enum ClientRendezvousFailureReason {\r\n    /** The sign in request has expired */\r\n    Expired = \"expired\",\r\n    /** The homeserver is lacking support for the required features */\r\n    HomeserverLacksSupport = \"homeserver_lacks_support\",\r\n    /** The secure channel verification failed meaning that it might be compromised */\r\n    InsecureChannelDetected = \"insecure_channel_detected\",\r\n    /** An invalid/incompatible QR code was scanned */\r\n    InvalidCode = \"invalid_code\",\r\n    /** The other device is not signed in */\r\n    OtherDeviceNotSignedIn = \"other_device_not_signed_in\",\r\n    /** The other device is already signed in */\r\n    OtherDeviceAlreadySignedIn = \"other_device_already_signed_in\",\r\n    /** Other */\r\n    Unknown = \"unknown\",\r\n    /** The user declined the sign in request */\r\n    UserDeclined = \"user_declined\",\r\n    /** The rendezvous request is missing an ETag header */\r\n    ETagMissing = \"etag_missing\",\r\n}\r\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAMA,WAAYA,oBAAoB,0BAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAAA,OAApBA,oBAAoB;AAAA;AAShC,WAAYC,6BAA6B,0BAA7BA,6BAA6B;EACrC;EADQA,6BAA6B;EAGrC;EAHQA,6BAA6B;EAKrC;EALQA,6BAA6B;EAOrC;EAPQA,6BAA6B;EASrC;EATQA,6BAA6B;EAWrC;EAXQA,6BAA6B;EAarC;EAbQA,6BAA6B;EAerC;EAfQA,6BAA6B;EAiBrC;EAjBQA,6BAA6B;EAAA,OAA7BA,6BAA6B;AAAA","ignoreList":[]}
+{"version":3,"file":"RendezvousFailureReason.js","names":["MSC4108FailureReason","ClientRendezvousFailureReason"],"sources":["../../src/rendezvous/RendezvousFailureReason.ts"],"sourcesContent":["/*\nCopyright 2022 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nexport type RendezvousFailureListener = (reason: RendezvousFailureReason) => void;\n\nexport type RendezvousFailureReason = MSC4108FailureReason | ClientRendezvousFailureReason;\n\nexport enum MSC4108FailureReason {\n    AuthorizationExpired = \"authorization_expired\",\n    DeviceAlreadyExists = \"device_already_exists\",\n    DeviceNotFound = \"device_not_found\",\n    UnexpectedMessageReceived = \"unexpected_message_received\",\n    UnsupportedProtocol = \"unsupported_protocol\",\n    UserCancelled = \"user_cancelled\",\n}\n\nexport enum ClientRendezvousFailureReason {\n    /** The sign in request has expired */\n    Expired = \"expired\",\n    /** The homeserver is lacking support for the required features */\n    HomeserverLacksSupport = \"homeserver_lacks_support\",\n    /** The secure channel verification failed meaning that it might be compromised */\n    InsecureChannelDetected = \"insecure_channel_detected\",\n    /** An invalid/incompatible QR code was scanned */\n    InvalidCode = \"invalid_code\",\n    /** The other device is not signed in */\n    OtherDeviceNotSignedIn = \"other_device_not_signed_in\",\n    /** The other device is already signed in */\n    OtherDeviceAlreadySignedIn = \"other_device_already_signed_in\",\n    /** Other */\n    Unknown = \"unknown\",\n    /** The user declined the sign in request */\n    UserDeclined = \"user_declined\",\n    /** The rendezvous request is missing an ETag header */\n    ETagMissing = \"etag_missing\",\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAMA,WAAYA,oBAAoB,0BAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAApBA,oBAAoB;EAAA,OAApBA,oBAAoB;AAAA;AAShC,WAAYC,6BAA6B,0BAA7BA,6BAA6B;EACrC;EADQA,6BAA6B;EAGrC;EAHQA,6BAA6B;EAKrC;EALQA,6BAA6B;EAOrC;EAPQA,6BAA6B;EASrC;EATQA,6BAA6B;EAWrC;EAXQA,6BAA6B;EAarC;EAbQA,6BAA6B;EAerC;EAfQA,6BAA6B;EAiBrC;EAjBQA,6BAA6B;EAAA,OAA7BA,6BAA6B;AAAA","ignoreList":[]}

package/lib/rendezvous/RendezvousIntent.js

@@ -1,17 +1,17 @@
-/*
-Copyright 2022 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.
+/*
+Copyright 2022 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.
 */
 
 export var RendezvousIntent = /*#__PURE__*/function (RendezvousIntent) {

package/lib/rendezvous/RendezvousIntent.js.map

@@ -1 +1 @@
-{"version":3,"file":"RendezvousIntent.js","names":["RendezvousIntent"],"sources":["../../src/rendezvous/RendezvousIntent.ts"],"sourcesContent":["/*\r\nCopyright 2022 The Matrix.org Foundation C.I.C.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n*/\r\n\r\nexport enum RendezvousIntent {\r\n    LOGIN_ON_NEW_DEVICE = \"login.start\",\r\n    RECIPROCATE_LOGIN_ON_EXISTING_DEVICE = \"login.reciprocate\",\r\n}\r\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,WAAYA,gBAAgB,0BAAhBA,gBAAgB;EAAhBA,gBAAgB;EAAhBA,gBAAgB;EAAA,OAAhBA,gBAAgB;AAAA","ignoreList":[]}
+{"version":3,"file":"RendezvousIntent.js","names":["RendezvousIntent"],"sources":["../../src/rendezvous/RendezvousIntent.ts"],"sourcesContent":["/*\nCopyright 2022 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nexport enum RendezvousIntent {\n    LOGIN_ON_NEW_DEVICE = \"login.start\",\n    RECIPROCATE_LOGIN_ON_EXISTING_DEVICE = \"login.reciprocate\",\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,WAAYA,gBAAgB,0BAAhBA,gBAAgB;EAAhBA,gBAAgB;EAAhBA,gBAAgB;EAAA,OAAhBA,gBAAgB;AAAA","ignoreList":[]}

package/lib/rendezvous/RendezvousTransport.js.map

@@ -1 +1 @@
-{"version":3,"file":"RendezvousTransport.js","names":[],"sources":["../../src/rendezvous/RendezvousTransport.ts"],"sourcesContent":["/*\r\nCopyright 2022 The Matrix.org Foundation C.I.C.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n*/\r\n\r\nimport { type RendezvousFailureListener, type RendezvousFailureReason } from \"./index.ts\";\r\n\r\nexport interface RendezvousTransportDetails {\r\n    type: string;\r\n}\r\n\r\n/**\r\n * Interface representing a generic rendezvous transport.\r\n */\r\nexport interface RendezvousTransport<T> {\r\n    /**\r\n     * Ready state of the transport. This is set to true when the transport is ready to be used.\r\n     */\r\n    readonly ready: boolean;\r\n\r\n    /**\r\n     * Listener for cancellation events. This is called when the rendezvous is cancelled or fails.\r\n     */\r\n    onFailure?: RendezvousFailureListener;\r\n\r\n    /**\r\n     * @returns the transport details that can be encoded in a QR or similar\r\n     */\r\n    details(): Promise<RendezvousTransportDetails>;\r\n\r\n    /**\r\n     * Send data via the transport.\r\n     * @param data - the data itself\r\n     */\r\n    send(data: T): Promise<void>;\r\n\r\n    /**\r\n     * Receive data from the transport.\r\n     */\r\n    receive(): Promise<Partial<T> | undefined>;\r\n\r\n    /**\r\n     * Cancel the rendezvous. This will call `onCancelled()` if it is set.\r\n     * @param reason - the reason for the cancellation/failure\r\n     */\r\n    cancel(reason: RendezvousFailureReason): Promise<void>;\r\n}\r\n"],"mappings":"","ignoreList":[]}
+{"version":3,"file":"RendezvousTransport.js","names":[],"sources":["../../src/rendezvous/RendezvousTransport.ts"],"sourcesContent":["/*\nCopyright 2022 The Matrix.org Foundation C.I.C.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\nimport { type RendezvousFailureListener, type RendezvousFailureReason } from \"./index.ts\";\n\nexport interface RendezvousTransportDetails {\n    type: string;\n}\n\n/**\n * Interface representing a generic rendezvous transport.\n */\nexport interface RendezvousTransport<T> {\n    /**\n     * Ready state of the transport. This is set to true when the transport is ready to be used.\n     */\n    readonly ready: boolean;\n\n    /**\n     * Listener for cancellation events. This is called when the rendezvous is cancelled or fails.\n     */\n    onFailure?: RendezvousFailureListener;\n\n    /**\n     * @returns the transport details that can be encoded in a QR or similar\n     */\n    details(): Promise<RendezvousTransportDetails>;\n\n    /**\n     * Send data via the transport.\n     * @param data - the data itself\n     */\n    send(data: T): Promise<void>;\n\n    /**\n     * Receive data from the transport.\n     */\n    receive(): Promise<Partial<T> | undefined>;\n\n    /**\n     * Cancel the rendezvous. This will call `onCancelled()` if it is set.\n     * @param reason - the reason for the cancellation/failure\n     */\n    cancel(reason: RendezvousFailureReason): Promise<void>;\n}\n"],"mappings":"","ignoreList":[]}