mirror of
https://github.com/matrix-org/matrix-rust-sdk.git
synced 2026-04-24 00:58:00 -04:00
test(event cache): add an integration test for automatically paginating a room with missing receipts
This commit is contained in:
@@ -24,9 +24,12 @@
|
||||
//! This avoids potential race conditions where a sync could be done, but the
|
||||
//! processing by the event cache isn't, at the time we check the unread counts.
|
||||
|
||||
use std::time::Duration;
|
||||
|
||||
use matrix_sdk::{
|
||||
ThreadingSupport, assert_let_timeout, event_cache::RoomEventCacheUpdate,
|
||||
test_utils::mocks::MatrixMockServer,
|
||||
ThreadingSupport, assert_let_timeout,
|
||||
event_cache::RoomEventCacheUpdate,
|
||||
test_utils::mocks::{MatrixMockServer, RoomMessagesResponseTemplate},
|
||||
};
|
||||
use matrix_sdk_test::{BOB, JoinedRoomBuilder, async_test, event_factory::EventFactory};
|
||||
use ruma::{
|
||||
@@ -652,3 +655,77 @@ async fn test_select_best_receipt_considers_thread_config() {
|
||||
// implicit receipt sent in a thread isn't taken into account.
|
||||
assert_eq!(room.num_unread_messages(), 2);
|
||||
}
|
||||
|
||||
/// Test that the unread count computation causes a back-pagination, when it
|
||||
/// can't find an event pointed to by a read receipt.
|
||||
#[async_test]
|
||||
async fn test_compute_unread_counts_triggers_backpaginations() {
|
||||
let server = MatrixMockServer::new().await;
|
||||
let client = server.client_builder().build().await;
|
||||
let own_user_id = client.user_id().unwrap();
|
||||
|
||||
client.event_cache().config_mut().experimental_auto_backpagination = true;
|
||||
client.event_cache().subscribe().unwrap();
|
||||
|
||||
let room_id = room_id!("!omelette:fromage.fr");
|
||||
let f = EventFactory::new().room(room_id).sender(*BOB);
|
||||
|
||||
let room = server.sync_joined_room(&client, room_id).await;
|
||||
|
||||
let (room_event_cache, _drop_handles) = room.event_cache().await.unwrap();
|
||||
let (_, mut room_cache_updates) = room_event_cache.subscribe().await.unwrap();
|
||||
assert!(room_cache_updates.is_empty());
|
||||
|
||||
// Already set up the mock for /messages, as the background pagination will hit
|
||||
// it as soon as the sync is received.
|
||||
server
|
||||
.mock_room_messages()
|
||||
.match_from("prev_batch")
|
||||
.ok(RoomMessagesResponseTemplate::default()
|
||||
.events(vec![
|
||||
f.text_msg("hello 2").event_id(event_id!("$2")),
|
||||
f.text_msg("hello 1").event_id(event_id!("$1")),
|
||||
])
|
||||
.with_delay(Duration::from_millis(100)))
|
||||
.mock_once()
|
||||
.mount()
|
||||
.await;
|
||||
|
||||
// Starting with a gappy sync, with a room with two messages from Bob, and a
|
||||
// receipt on Bob's first message $1, which is missing from the timeline,
|
||||
server
|
||||
.sync_room(
|
||||
&client,
|
||||
JoinedRoomBuilder::new(room_id)
|
||||
.add_timeline_event(f.text_msg("hello 3").event_id(event_id!("$3")))
|
||||
.add_timeline_event(f.text_msg("hello 4").event_id(event_id!("$4")))
|
||||
.add_receipt(
|
||||
f.read_receipts()
|
||||
.add(
|
||||
event_id!("$1"),
|
||||
own_user_id,
|
||||
ReceiptType::Read,
|
||||
ReceiptThread::Unthreaded,
|
||||
)
|
||||
.into_event(),
|
||||
)
|
||||
.set_timeline_limited()
|
||||
.set_timeline_prev_batch("prev_batch".to_owned()),
|
||||
)
|
||||
.await;
|
||||
|
||||
// (one vector diff update, one read receipt update)
|
||||
assert_let_timeout!(Ok(_) = room_cache_updates.recv());
|
||||
assert_let_timeout!(Ok(_) = room_cache_updates.recv());
|
||||
|
||||
// The message counts are properly updated (two unread messages in the
|
||||
// timeline, which are $3 and $4).
|
||||
assert_eq!(room.num_unread_messages(), 2);
|
||||
|
||||
// Then, there's a background pagination happening in the room, which will fetch
|
||||
// the missing $1 and $2.
|
||||
assert_let_timeout!(Duration::from_millis(150), Ok(_) = room_cache_updates.recv());
|
||||
|
||||
// The message counts are properly updated (three messages after $1).
|
||||
assert_eq!(room.num_unread_messages(), 3);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user