Merge pull request #2701 from matrix-org/travis/fix-invites
Change the room list algo to eagerly delete and carefully insertpull/21833/head
commit
f82cc28f96
|
@ -52,7 +52,6 @@ export default class AccountSettingsHandler extends MatrixClientBackedSettingsHa
|
||||||
} else if (event.getType() === "im.vector.web.settings") {
|
} else if (event.getType() === "im.vector.web.settings") {
|
||||||
// We can't really discern what changed, so trigger updates for everything
|
// We can't really discern what changed, so trigger updates for everything
|
||||||
for (const settingName of Object.keys(event.getContent())) {
|
for (const settingName of Object.keys(event.getContent())) {
|
||||||
console.log(settingName);
|
|
||||||
this._watchers.notifyUpdate(settingName, null, event.getContent()[settingName]);
|
this._watchers.notifyUpdate(settingName, null, event.getContent()[settingName]);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -64,7 +64,7 @@ class RoomListStore extends Store {
|
||||||
* behave.
|
* behave.
|
||||||
* @param {boolean} forceRegeneration True to force a change in the algorithm
|
* @param {boolean} forceRegeneration True to force a change in the algorithm
|
||||||
*/
|
*/
|
||||||
updateSortingAlgorithm(forceRegeneration=false) {
|
updateSortingAlgorithm(forceRegeneration = false) {
|
||||||
const byImportance = SettingsStore.getValue("RoomList.orderByImportance");
|
const byImportance = SettingsStore.getValue("RoomList.orderByImportance");
|
||||||
if (byImportance !== this._state.orderRoomsByImportance || forceRegeneration) {
|
if (byImportance !== this._state.orderRoomsByImportance || forceRegeneration) {
|
||||||
console.log("Updating room sorting algorithm: sortByImportance=" + byImportance);
|
console.log("Updating room sorting algorithm: sortByImportance=" + byImportance);
|
||||||
|
@ -119,8 +119,15 @@ class RoomListStore extends Store {
|
||||||
const logicallyReady = this._matrixClient && this._state.ready;
|
const logicallyReady = this._matrixClient && this._state.ready;
|
||||||
switch (payload.action) {
|
switch (payload.action) {
|
||||||
case 'setting_updated': {
|
case 'setting_updated': {
|
||||||
if (payload.settingName !== 'RoomList.orderByImportance') break;
|
if (payload.settingName === 'RoomList.orderByImportance') {
|
||||||
this.updateSortingAlgorithm();
|
this.updateSortingAlgorithm();
|
||||||
|
} else if (payload.settingName === 'feature_custom_tags') {
|
||||||
|
const isActive = SettingsStore.isFeatureEnabled("feature_custom_tags");
|
||||||
|
if (isActive !== this._state.tagsEnabled) {
|
||||||
|
this._setState({tagsEnabled: isActive});
|
||||||
|
this.updateSortingAlgorithm(/*force=*/true);
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
// Initialise state after initial sync
|
// Initialise state after initial sync
|
||||||
|
@ -129,6 +136,8 @@ class RoomListStore extends Store {
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
this._setState({tagsEnabled: SettingsStore.isFeatureEnabled("feature_custom_tags")});
|
||||||
|
|
||||||
this._matrixClient = payload.matrixClient;
|
this._matrixClient = payload.matrixClient;
|
||||||
this.updateSortingAlgorithm(/*force=*/true);
|
this.updateSortingAlgorithm(/*force=*/true);
|
||||||
}
|
}
|
||||||
|
@ -204,7 +213,7 @@ class RoomListStore extends Store {
|
||||||
break;
|
break;
|
||||||
case 'MatrixActions.Room.myMembership': {
|
case 'MatrixActions.Room.myMembership': {
|
||||||
if (!logicallyReady) break;
|
if (!logicallyReady) break;
|
||||||
this._roomUpdateTriggered(payload.room.roomId);
|
this._roomUpdateTriggered(payload.room.roomId, true);
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
// This could be a new room that we've been invited to, joined or created
|
// This could be a new room that we've been invited to, joined or created
|
||||||
|
@ -212,7 +221,7 @@ class RoomListStore extends Store {
|
||||||
// a member.
|
// a member.
|
||||||
case 'MatrixActions.Room': {
|
case 'MatrixActions.Room': {
|
||||||
if (!logicallyReady) break;
|
if (!logicallyReady) break;
|
||||||
this._roomUpdateTriggered(payload.room.roomId);
|
this._roomUpdateTriggered(payload.room.roomId, true);
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
// TODO: Re-enable optimistic updates when we support dragging again
|
// TODO: Re-enable optimistic updates when we support dragging again
|
||||||
|
@ -254,12 +263,12 @@ class RoomListStore extends Store {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
_roomUpdateTriggered(roomId) {
|
_roomUpdateTriggered(roomId, ignoreSticky) {
|
||||||
// We don't calculate categories for sticky rooms because we have a moderate
|
// We don't calculate categories for sticky rooms because we have a moderate
|
||||||
// interest in trying to maintain the category that they were last in before
|
// interest in trying to maintain the category that they were last in before
|
||||||
// being artificially flagged as IDLE. Also, this reduces the amount of time
|
// being artificially flagged as IDLE. Also, this reduces the amount of time
|
||||||
// we spend in _setRoomCategory ever so slightly.
|
// we spend in _setRoomCategory ever so slightly.
|
||||||
if (this._state.stickyRoomId !== roomId) {
|
if (this._state.stickyRoomId !== roomId || ignoreSticky) {
|
||||||
// Micro optimization: Only look up the room if we're confident we'll need it.
|
// Micro optimization: Only look up the room if we're confident we'll need it.
|
||||||
const room = this._matrixClient.getRoom(roomId);
|
const room = this._matrixClient.getRoom(roomId);
|
||||||
if (!room) return;
|
if (!room) return;
|
||||||
|
@ -269,6 +278,36 @@ class RoomListStore extends Store {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
_filterTags(tags) {
|
||||||
|
tags = tags ? Object.keys(tags) : [];
|
||||||
|
if (this._state.tagsEnabled) return tags;
|
||||||
|
return tags.filter((t) => !!LIST_ORDERS[t]);
|
||||||
|
}
|
||||||
|
|
||||||
|
_getRecommendedTagsForRoom(room) {
|
||||||
|
const tags = [];
|
||||||
|
|
||||||
|
const myMembership = room.getMyMembership();
|
||||||
|
if (myMembership === 'join' || myMembership === 'invite') {
|
||||||
|
// Stack the user's tags on top
|
||||||
|
tags.push(...this._filterTags(room.tags));
|
||||||
|
|
||||||
|
const dmRoomMap = DMRoomMap.shared();
|
||||||
|
if (dmRoomMap.getUserIdForRoomId(room.roomId)) {
|
||||||
|
tags.push("im.vector.fake.direct");
|
||||||
|
} else if (myMembership === 'invite') {
|
||||||
|
tags.push("im.vector.fake.invite");
|
||||||
|
} else if (tags.length === 0) {
|
||||||
|
tags.push("im.vector.fake.recent");
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
tags.push("im.vector.fake.archived");
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
return tags;
|
||||||
|
}
|
||||||
|
|
||||||
_setRoomCategory(room, category) {
|
_setRoomCategory(room, category) {
|
||||||
if (!room) return; // This should only happen in tests
|
if (!room) return; // This should only happen in tests
|
||||||
|
|
||||||
|
@ -284,42 +323,33 @@ class RoomListStore extends Store {
|
||||||
return _targetTimestamp;
|
return _targetTimestamp;
|
||||||
};
|
};
|
||||||
|
|
||||||
const myMembership = room.getMyMembership();
|
const targetTags = this._getRecommendedTagsForRoom(room);
|
||||||
let doInsert = true;
|
const insertedIntoTags = [];
|
||||||
const targetTags = [];
|
|
||||||
if (myMembership !== "join" && myMembership !== "invite") {
|
|
||||||
doInsert = false;
|
|
||||||
} else {
|
|
||||||
const dmRoomMap = DMRoomMap.shared();
|
|
||||||
if (dmRoomMap.getUserIdForRoomId(room.roomId)) {
|
|
||||||
targetTags.push('im.vector.fake.direct');
|
|
||||||
} else {
|
|
||||||
targetTags.push('im.vector.fake.recent');
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// We need to update all instances of a room to ensure that they are correctly organized
|
// We need to make sure all the tags (lists) are updated with the room's new position. We
|
||||||
// in the list. We do this by shallow-cloning the entire `lists` object using a single
|
// generally only get called here when there's a new room to insert or a room has potentially
|
||||||
// iterator. Within the loop, we also rebuild the list of rooms per tag (key) so that the
|
// changed positions within the list.
|
||||||
// updated room gets slotted into the right spot. This sacrifices code clarity for not
|
//
|
||||||
// iterating on potentially large collections multiple times.
|
// We do all our checks by iterating over the rooms in the existing lists, trying to insert
|
||||||
|
// our room where we can. As a guiding principle, we should be removing the room from all
|
||||||
|
// tags, and insert the room into targetTags. We should perform the deletion before the addition
|
||||||
|
// where possible to keep a consistent state. By the end of this, targetTags should be the
|
||||||
|
// same as insertedIntoTags.
|
||||||
|
|
||||||
let inserted = false;
|
|
||||||
for (const key of Object.keys(this._state.lists)) {
|
for (const key of Object.keys(this._state.lists)) {
|
||||||
const hasRoom = this._state.lists[key].some((e) => e.room.roomId === room.roomId);
|
const shouldHaveRoom = targetTags.includes(key);
|
||||||
|
|
||||||
// Speed optimization: Skip the loop below if we're not going to do anything productive
|
// Speed optimization: Don't do complicated math if we don't have to.
|
||||||
if (!hasRoom || LIST_ORDERS[key] !== 'recent') {
|
if (!shouldHaveRoom) {
|
||||||
listsClone[key] = this._state.lists[key];
|
listsClone[key] = this._state.lists[key].filter((e) => e.room.roomId !== room.roomId);
|
||||||
if (LIST_ORDERS[key] !== 'recent' && (hasRoom || targetTags.includes(key))) {
|
} else if (LIST_ORDERS[key] !== 'recent') {
|
||||||
// Ensure that we don't try and sort the room into the tag
|
// Manually ordered tags are sorted later, so for now we'll just clone the tag
|
||||||
inserted = true;
|
// and add our room if needed
|
||||||
doInsert = false;
|
listsClone[key] = this._state.lists[key].filter((e) => e.room.roomId !== room.roomId);
|
||||||
}
|
listsClone[key].push({room, category});
|
||||||
continue;
|
insertedIntoTags.push(key);
|
||||||
} else {
|
} else {
|
||||||
listsClone[key] = [];
|
listsClone[key] = [];
|
||||||
}
|
|
||||||
|
|
||||||
// We track where the boundary within listsClone[key] is just in case our timestamp
|
// We track where the boundary within listsClone[key] is just in case our timestamp
|
||||||
// ordering fails. If we can't stick the room in at the correct place in the category
|
// ordering fails. If we can't stick the room in at the correct place in the category
|
||||||
|
@ -330,10 +360,16 @@ class RoomListStore extends Store {
|
||||||
let pushedEntry = false;
|
let pushedEntry = false;
|
||||||
|
|
||||||
for (const entry of this._state.lists[key]) {
|
for (const entry of this._state.lists[key]) {
|
||||||
// if the list is a recent list, and the room appears in this list, and we're not looking at a sticky
|
// We insert our own record as needed, so don't let the old one through.
|
||||||
// room (sticky rooms have unreliable categories), try to slot the new room in
|
if (entry.room.roomId === room.roomId) {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
// if the list is a recent list, and the room appears in this list, and we're
|
||||||
|
// not looking at a sticky room (sticky rooms have unreliable categories), try
|
||||||
|
// to slot the new room in
|
||||||
if (entry.room.roomId !== this._state.stickyRoomId) {
|
if (entry.room.roomId !== this._state.stickyRoomId) {
|
||||||
if (!pushedEntry && doInsert && (targetTags.length === 0 || targetTags.includes(key))) {
|
if (!pushedEntry && shouldHaveRoom) {
|
||||||
// Micro optimization: Support lazily loading the last timestamp in a room
|
// Micro optimization: Support lazily loading the last timestamp in a room
|
||||||
let _entryTimestamp = null;
|
let _entryTimestamp = null;
|
||||||
const entryTimestamp = () => {
|
const entryTimestamp = () => {
|
||||||
|
@ -366,46 +402,43 @@ class RoomListStore extends Store {
|
||||||
listsClone[key].push({room, category});
|
listsClone[key].push({room, category});
|
||||||
}
|
}
|
||||||
pushedEntry = true;
|
pushedEntry = true;
|
||||||
inserted = true;
|
insertedIntoTags.push(key);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// We insert our own record as needed, so don't let the old one through.
|
|
||||||
if (entry.room.roomId === room.roomId) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Fall through and clone the list.
|
// Fall through and clone the list.
|
||||||
listsClone[key].push(entry);
|
listsClone[key].push(entry);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if (!pushedEntry) {
|
||||||
|
if (listsClone[key].length === 0) {
|
||||||
|
listsClone[key].push({room, category});
|
||||||
|
insertedIntoTags.push(key);
|
||||||
|
} else {
|
||||||
|
// In theory, this should never happen
|
||||||
|
console.warn(`!! Room ${room.roomId} lost: No position available`);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (!inserted) {
|
// Double check that we inserted the room in the right places
|
||||||
// There's a good chance that we just joined the room, so we need to organize it
|
for (const targetTag of targetTags) {
|
||||||
// We also could have left it...
|
let count = 0;
|
||||||
let tags = [];
|
for (const insertedTag of insertedIntoTags) {
|
||||||
if (doInsert) {
|
if (insertedTag === targetTag) count++;
|
||||||
tags = Object.keys(room.tags);
|
|
||||||
if (tags.length === 0) {
|
|
||||||
tags = targetTags;
|
|
||||||
}
|
|
||||||
if (tags.length === 0) {
|
|
||||||
tags = [myMembership === 'join' ? 'im.vector.fake.recent' : 'im.vector.fake.invite'];
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
tags = ['im.vector.fake.archived'];
|
|
||||||
}
|
|
||||||
for (const tag of tags) {
|
|
||||||
for (let i = 0; i < listsClone[tag].length; i++) {
|
|
||||||
// Just find the top of our category grouping and insert it there.
|
|
||||||
const catIdxAtPosition = CATEGORY_ORDER.indexOf(listsClone[tag][i].category);
|
|
||||||
if (catIdxAtPosition >= targetCategoryIndex) {
|
|
||||||
listsClone[tag].splice(i, 0, {room: room, category: category});
|
|
||||||
break;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if (count !== 1) {
|
||||||
|
console.warn(`!! Room ${room.roomId} inserted ${count} times`);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Sort the favourites before we set the clone
|
||||||
|
for (const tag of Object.keys(listsClone)) {
|
||||||
|
if (LIST_ORDERS[tag] === 'recent') continue; // skip recents (pre-sorted)
|
||||||
|
listsClone[tag].sort(this._getManualComparator(tag));
|
||||||
}
|
}
|
||||||
|
|
||||||
this._setState({lists: listsClone});
|
this._setState({lists: listsClone});
|
||||||
|
@ -606,7 +639,7 @@ class RoomListStore extends Store {
|
||||||
return -1;
|
return -1;
|
||||||
}
|
}
|
||||||
|
|
||||||
return a === b ? this._lexicographicalComparator(roomA, roomB) : ( a > b ? 1 : -1);
|
return a === b ? this._lexicographicalComparator(roomA, roomB) : (a > b ? 1 : -1);
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue