f fix comment breaks

Author: TheBlueMatt

lightning/src/routing/scoring.rs

@@ -539,30 +539,29 @@ impl HistoricalMinMaxBuckets<'_> {
 	#[inline]
 	fn calculate_success_probability_times_billion(&self, required_decays: u32, payment_amt_64th_bucket: u8) -> Option<u64> {
 		// If historical penalties are enabled, calculate the penalty by walking the set of
-		// historical liquidity bucket (min, max) combinations (where min_idx < max_idx)
-		// and, for each, calculate the probability of success given our payment amount, then
-		// total the weighted average probability of success.
+		// historical liquidity bucket (min, max) combinations (where min_idx < max_idx) and, for
+		// each, calculate the probability of success given our payment amount, then total the
+		// weighted average probability of success.
 		//
-		// We use a sliding scale to decide which point within a given bucket will be compared
-		// to the amount being sent - for lower-bounds, the amount being sent is compared to
-		// the lower edge of the first bucket (i.e. zero), but compared to the upper 7/8ths of
-		// the last bucket (i.e. 9 times the index, or 63), with each bucket in between
-		// increasing the comparison point by 1/64th. For upper-bounds, the same applies,
-		// however with an offset of 1/64th (i.e. starting at one and ending at 64). This
-		// avoids failing to assign penalties to channels at the edges.
+		// We use a sliding scale to decide which point within a given bucket will be compared to
+		// the amount being sent - for lower-bounds, the amount being sent is compared to the lower
+		// edge of the first bucket (i.e. zero), but compared to the upper 7/8ths of the last
+		// bucket (i.e. 9 times the index, or 63), with each bucket in between increasing the
+		// comparison point by 1/64th. For upper-bounds, the same applies, however with an offset
+		// of 1/64th (i.e. starting at one and ending at 64). This avoids failing to assign
+		// penalties to channels at the edges.
 		//
-		// If we used the bottom edge of buckets, we'd end up never assigning any penalty at
-		// all to such a channel when sending less than ~0.19% of the channel's capacity (e.g.
-		// ~200k sats for a 1 BTC channel!).
+		// If we used the bottom edge of buckets, we'd end up never assigning any penalty at all to
+		// such a channel when sending less than ~0.19% of the channel's capacity (e.g. ~200k sats
+		// for a 1 BTC channel!).
 		//
-		// If we used the middle of each bucket we'd never assign any penalty at all when
-		// sending less than 1/16th of a channel's capacity, or 1/8th if we used the top of the
-		// bucket.
+		// If we used the middle of each bucket we'd never assign any penalty at all when sending
+		// less than 1/16th of a channel's capacity, or 1/8th if we used the top of the bucket.
 		let mut total_valid_points_tracked = 0;
 
 		// Rather than actually decaying the individual buckets, which would lose precision, we
-		// simply track whether all buckets would be decayed to zero, in which case we treat it
-		// as if we had no data.
+		// simply track whether all buckets would be decayed to zero, in which case we treat it as
+		// if we had no data.
 		let mut is_fully_decayed = true;
 		let mut check_track_bucket_contains_undecayed_points =
 			|bucket_val: u16| if bucket_val.checked_shr(required_decays).unwrap_or(0) > 0 { is_fully_decayed = false; };
@@ -574,8 +573,8 @@ impl HistoricalMinMaxBuckets<'_> {
 				check_track_bucket_contains_undecayed_points(*max_bucket);
 			}
 		}
-		// If the total valid points is smaller than 1.0 (i.e. 32 in our fixed-point scheme),
-		// treat it as if we were fully decayed.
+		// If the total valid points is smaller than 1.0 (i.e. 32 in our fixed-point scheme), treat
+		// it as if we were fully decayed.
 		if total_valid_points_tracked.checked_shr(required_decays).unwrap_or(0) < 32*32 || is_fully_decayed {
 			return None;
 		}