matrix/matrix-js-sdk
1
0
Fork 0
mirror of https://github.com/matrix-org/matrix-js-sdk.git synced 2025-11-28 05:03:59 +03:00
Code Activity

Rename var to match new function

Browse Source
This commit is contained in:
Erik Johnston
2020-01-14 10:07:54 +00:00
parent ed3fded8e8
commit 260040b919
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
src/crypto/algorithms/megolm.js
View File

@@ -331,7 +331,8 @@ MegolmEncryption.prototype._prepareNewSession = async function() {
/** /**
* Splits the user device map into multiple chunks to reduce the number of * Splits the user device map into multiple chunks to reduce the number of
* devices we encrypt to per API call. * devices we encrypt to per API call. Also filters out devices we don't have
* a session with.
* *
* @private * @private
* *
@@ -350,7 +351,7 @@ MegolmEncryption.prototype._prepareNewSession = async function() {
MegolmEncryption.prototype._splitUserDeviceMap = function( MegolmEncryption.prototype._splitUserDeviceMap = function(
session, chainIndex, devicemap, devicesByUser, session, chainIndex, devicemap, devicesByUser,
) { ) {
const maxToDeviceMessagesPerRequest = 20; const maxUsersPerRequest = 20;
// use an array where the slices of a content map gets stored // use an array where the slices of a content map gets stored
const mapSlices = []; const mapSlices = [];
@@ -406,7 +407,7 @@ MegolmEncryption.prototype._splitUserDeviceMap = function(
// server (e.g. only have to send one EDU if a remote user, etc). This // server (e.g. only have to send one EDU if a remote user, etc). This
// does mean that if a user has many devices we may go over the desired // does mean that if a user has many devices we may go over the desired
// limit, but its not a hard limit so that is fine. // limit, but its not a hard limit so that is fine.
if (entriesInCurrentSlice > maxToDeviceMessagesPerRequest) { if (entriesInCurrentSlice > maxUsersPerRequest) {
// the current slice is filled up. Start inserting into the next slice // the current slice is filled up. Start inserting into the next slice
entriesInCurrentSlice = 0; entriesInCurrentSlice = 0;
currentSliceId++; currentSliceId++;