chore(sdk): Add missing derive(Debug).

crates/matrix-sdk/src/event_cache/linked_chunk/as_vector.rs

@@ -33,6 +33,7 @@ type ChunkLength = usize;
 /// `Vec<VectorDiff<Item>>` (this type). Basically, it helps to consume a
 /// [`LinkedChunk<CAP, Item, Gap>`](super::LinkedChunk) as if it was an
 /// [`eyeball_im::ObservableVector<Item>`].
+#[derive(Debug)]
 pub struct AsVector<Item, Gap> {
     /// Strong reference to [`UpdatesInner`].
     updates: Arc<RwLock<UpdatesInner<Item, Gap>>>,
@@ -82,6 +83,7 @@ impl<Item, Gap> AsVector<Item, Gap> {
 }
 
 /// Internal type that converts [`Update`] into [`VectorDiff`].
+#[derive(Debug)]
 struct UpdateToVectorDiff {
     /// Pairs of all known chunks and their respective length. This is the only
     /// required data for this algorithm.

crates/matrix-sdk/src/event_cache/linked_chunk/mod.rs

@@ -865,6 +865,7 @@ impl Position {
 
 /// An iterator over a [`LinkedChunk`] that traverses the chunk in backward
 /// direction (i.e. it calls `previous` on each chunk to make progress).
+#[derive(Debug)]
 pub struct IterBackward<'a, const CAP: usize, Item, Gap> {
     chunk: Option<&'a Chunk<CAP, Item, Gap>>,
 }
@@ -890,6 +891,7 @@ impl<'a, const CAP: usize, Item, Gap> Iterator for IterBackward<'a, CAP, Item, G
 
 /// An iterator over a [`LinkedChunk`] that traverses the chunk in forward
 /// direction (i.e. it calls `next` on each chunk to make progress).
+#[derive(Debug)]
 pub struct Iter<'a, const CAP: usize, Item, Gap> {
     chunk: Option<&'a Chunk<CAP, Item, Gap>>,
 }

crates/matrix-sdk/src/event_cache/linked_chunk/updates.rs

@@ -95,6 +95,7 @@ pub enum Update<Item, Gap> {
 /// A collection of [`Update`]s that can be observed.
 ///
 /// Get a value for this type with [`LinkedChunk::updates`].
+#[derive(Debug)]
 pub struct ObservableUpdates<Item, Gap> {
     pub(super) inner: Arc<RwLock<UpdatesInner<Item, Gap>>>,
 }
@@ -164,6 +165,7 @@ pub(super) type ReaderToken = usize;
 /// for example with [`UpdatesSubscriber`]. Of course, they can be multiple
 /// `UpdatesSubscriber`s at the same time. Hence the need of supporting multiple
 /// readers.
+#[derive(Debug)]
 pub(super) struct UpdatesInner<Item, Gap> {
     /// All the updates that have not been read by all readers.
     updates: Vec<Update<Item, Gap>>,