@@ -18,6 +18,9 @@ use matrix_sdk_common::deserialized_responses::SyncTimelineEvent;
18
18
19
19
use super :: linked_chunk:: { Chunk , ChunkIdentifier , Error , Iter , LinkedChunk , Position } ;
20
20
21
+ /// An alias for the real event type.
22
+ pub type Event = SyncTimelineEvent ;
23
+
21
24
#[ derive( Clone , Debug ) ]
22
25
pub struct Gap {
23
26
/// The token to use in the query, extracted from a previous "from" /
@@ -28,7 +31,7 @@ pub struct Gap {
28
31
const DEFAULT_CHUNK_CAPACITY : usize = 128 ;
29
32
30
33
pub struct RoomEvents {
31
- chunks : LinkedChunk < DEFAULT_CHUNK_CAPACITY , SyncTimelineEvent , Gap > ,
34
+ chunks : LinkedChunk < DEFAULT_CHUNK_CAPACITY , Event , Gap > ,
32
35
}
33
36
34
37
impl Default for RoomEvents {
@@ -52,7 +55,7 @@ impl RoomEvents {
52
55
/// The last event in `events` is the most recent one.
53
56
pub fn push_events < I > ( & mut self , events : I )
54
57
where
55
- I : IntoIterator < Item = SyncTimelineEvent > ,
58
+ I : IntoIterator < Item = Event > ,
56
59
I :: IntoIter : ExactSizeIterator ,
57
60
{
58
61
self . chunks . push_items_back ( events)
@@ -66,7 +69,7 @@ impl RoomEvents {
66
69
/// Insert events at a specified position.
67
70
pub fn insert_events_at < I > ( & mut self , events : I , position : Position ) -> Result < ( ) , Error >
68
71
where
69
- I : IntoIterator < Item = SyncTimelineEvent > ,
72
+ I : IntoIterator < Item = Event > ,
70
73
I :: IntoIter : ExactSizeIterator ,
71
74
{
72
75
self . chunks . insert_items_at ( events, position)
@@ -88,9 +91,9 @@ impl RoomEvents {
88
91
& mut self ,
89
92
events : I ,
90
93
gap_identifier : ChunkIdentifier ,
91
- ) -> Result < & Chunk < DEFAULT_CHUNK_CAPACITY , SyncTimelineEvent , Gap > , Error >
94
+ ) -> Result < & Chunk < DEFAULT_CHUNK_CAPACITY , Event , Gap > , Error >
92
95
where
93
- I : IntoIterator < Item = SyncTimelineEvent > ,
96
+ I : IntoIterator < Item = Event > ,
94
97
I :: IntoIter : ExactSizeIterator ,
95
98
{
96
99
self . chunks . replace_gap_at ( events, gap_identifier)
@@ -99,29 +102,29 @@ impl RoomEvents {
99
102
/// Search for a chunk, and return its identifier.
100
103
pub fn chunk_identifier < ' a , P > ( & ' a self , predicate : P ) -> Option < ChunkIdentifier >
101
104
where
102
- P : FnMut ( & ' a Chunk < DEFAULT_CHUNK_CAPACITY , SyncTimelineEvent , Gap > ) -> bool ,
105
+ P : FnMut ( & ' a Chunk < DEFAULT_CHUNK_CAPACITY , Event , Gap > ) -> bool ,
103
106
{
104
107
self . chunks . chunk_identifier ( predicate)
105
108
}
106
109
107
110
/// Iterate over the chunks, forward.
108
111
///
109
112
/// The oldest chunk comes first.
110
- pub fn chunks ( & self ) -> Iter < ' _ , DEFAULT_CHUNK_CAPACITY , SyncTimelineEvent , Gap > {
113
+ pub fn chunks ( & self ) -> Iter < ' _ , DEFAULT_CHUNK_CAPACITY , Event , Gap > {
111
114
self . chunks . chunks ( )
112
115
}
113
116
114
117
/// Iterate over the events, backward.
115
118
///
116
119
/// The most recent event comes first.
117
- pub fn revents ( & self ) -> impl Iterator < Item = ( Position , & SyncTimelineEvent ) > {
120
+ pub fn revents ( & self ) -> impl Iterator < Item = ( Position , & Event ) > {
118
121
self . chunks . ritems ( )
119
122
}
120
123
121
124
/// Iterate over the events, forward.
122
125
///
123
126
/// The oldest event comes first.
124
- pub fn events ( & self ) -> impl Iterator < Item = ( Position , & SyncTimelineEvent ) > {
127
+ pub fn events ( & self ) -> impl Iterator < Item = ( Position , & Event ) > {
125
128
self . chunks . items ( )
126
129
}
127
130
}
0 commit comments