formatting errors commit that should be removed once rebasing

Author: qdeconinck

quiche/src/h3/qpack/mod.rs

@@ -161,7 +161,8 @@ mod tests {
         let mut enc = Encoder::new();
 
         // Indexed name with literal value
-        let headers1 = vec![crate::h3::Header::new(b"location", b"															")];
+        let headers1 =
+            vec![crate::h3::Header::new(b"location", b"															")];
         assert_eq!(enc.encode(&headers1, &mut encoded), Ok(19));
 
         // Literal name and value

quiche/src/lib.rs

@@ -8167,7 +8167,7 @@ impl Connection {
             .iter()
             .filter(|(_, p)| p.active())
             .map(|(_, p)| p.recovery.cwnd_available())
-            .filter(|cwnd| *cwnd != std::usize::MAX)
+            .filter(|cwnd| *cwnd != usize::MAX)
             .sum();
         self.tx_cap = cmp::min(
             cwin_available,

quiche/src/packet.rs

@@ -915,6 +915,7 @@ pub struct PktNumSpaceCrypto {
     pub crypto_seal: Option<crypto::Seal>,
 
     pub crypto_0rtt_open: Option<crypto::Open>,
+    #[allow(dead_code)]
     pub crypto_0rtt_seal: Option<crypto::Seal>,
 
     pub crypto_stream: stream::Stream,

quiche/src/rand.rs

@@ -47,7 +47,7 @@ pub fn rand_u64() -> u64 {
 }
 
 pub fn rand_u64_uniform(max: u64) -> u64 {
-    let chunk_size = u64::max_value() / max;
+    let chunk_size = u64::MAX / max;
     let end_of_last_chunk = chunk_size * max;
 
     let mut r = rand_u64();

quiche/src/ranges.rs

@@ -122,7 +122,7 @@ impl RangeSet {
     /// Iterate over the stored ranges in incremental order.
     pub fn iter(
         &self,
-    ) -> impl Iterator<Item = Range<u64>> + DoubleEndedIterator + ExactSizeIterator + '_
+    ) -> impl DoubleEndedIterator<Item = Range<u64>> + ExactSizeIterator + '_
     {
         match self {
             RangeSet::BTree(set) =>
@@ -135,9 +135,7 @@ impl RangeSet {
 
     /// Iterate over every single [`u64`] value covered by the ranges in this
     /// [`RangeSet`] in incremental order.
-    pub fn flatten(
-        &self,
-    ) -> impl Iterator<Item = u64> + DoubleEndedIterator + '_ {
+    pub fn flatten(&self) -> impl DoubleEndedIterator<Item = u64> + '_ {
         match self {
             RangeSet::BTree(set) =>
                 Either::Left(set.inner.iter().flat_map(|(k, v)| *k..*v)),