@@ -192,7 +192,7 @@ fn load_level_heads(client: &mut Client, level_info: &[Level]) -> BTreeMap<i64,
192
192
/// specific room within a certain range. These are appended onto the provided
193
193
/// map.
194
194
///
195
- /// - Fetches the first [group] rows with group id after [min]
195
+ /// - Fetches the first ` [group]` rows with group id after ` [min]`
196
196
/// - Recursively searches for missing predecessors and adds those
197
197
///
198
198
/// Returns with the state_group map and the id of the last group that was used
@@ -206,7 +206,6 @@ fn load_level_heads(client: &mut Client, level_info: &[Level]) -> BTreeMap<i64,
206
206
/// also requires groups_to_compress to be specified
207
207
/// * 'max_group_found' - The last group to get from the database before stopping
208
208
/// * 'state_group_map' - The map to populate with the entries from the database
209
-
210
209
fn load_map_from_db (
211
210
client : & mut Client ,
212
211
room_id : & str ,
@@ -326,7 +325,7 @@ fn find_max_group(
326
325
/// Fetch the entries in state_groups_state and immediate predecessors for
327
326
/// a specific room.
328
327
///
329
- /// - Fetches first [groups_to_compress] rows with group id higher than min
328
+ /// - Fetches first ` [groups_to_compress]` rows with group id higher than min
330
329
/// - Stores the group id, predecessor id and deltas into a map
331
330
/// - returns map and maximum row that was considered
332
331
///
@@ -467,7 +466,7 @@ fn get_missing_from_db(
467
466
/// Helper function that escapes the wrapped text when writing SQL
468
467
pub struct PGEscape < ' a > ( pub & ' a str ) ;
469
468
470
- impl < ' a > fmt:: Display for PGEscape < ' a > {
469
+ impl fmt:: Display for PGEscape < ' _ > {
471
470
fn fmt ( & self , f : & mut fmt:: Formatter < ' _ > ) -> fmt:: Result {
472
471
let mut delim = Cow :: from ( "$$" ) ;
473
472
while self . 0 . contains ( & delim as & str ) {
0 commit comments