nits

Author: omansfeld

neqo-transport/src/cc/mod.rs

@@ -28,7 +28,7 @@ pub use cubic::Cubic;
 pub use hystart::{HyStart, HyStartCssBaseline};
 pub use new_reno::NewReno;
 #[cfg(test)]
-pub use search::Result;
+pub use search::Outcome;
 pub use search::Search;
 
 #[derive(Clone, Copy, PartialEq, Eq, Debug)]

neqo-transport/src/cc/search.rs

@@ -18,7 +18,7 @@ use crate::{cc::classic_cc::SlowStart, packet, rtt::RttEstimate, stats::Congesti
 
 /// The outcome of a single SEARCH evaluation.
 #[derive(Debug, PartialEq, Eq)]
-pub enum Result {
+pub enum Outcome {
     /// Evaluation ran and slow start should be exited with the provided cwnd.
     Exit(usize),
     /// Evaluation ran and slow start should be continued.
@@ -273,15 +273,15 @@ impl Search {
 
     /// Re-exports the internal `evaluate` function for use in tests.
     #[cfg(test)]
-    pub fn evaluate_test(&self, rtt: Duration, curr_idx: usize, curr_cwnd: usize) -> Result {
+    pub fn evaluate_test(&self, rtt: Duration, curr_idx: usize, curr_cwnd: usize) -> Outcome {
         self.evaluate(rtt, curr_idx, curr_cwnd)
     }
 
     /// Evaluates whether SEARCH should exit slow start.
     ///
-    /// Returns [`Result::Exit`] with the current cwnd if the normalized delivery-rate
+    /// Returns [`Outcome::Exit`] with the current cwnd if the normalized delivery-rate
     /// difference exceeds [`Self::THRESH`], or a non-exit variant explaining why not.
-    fn evaluate(&self, rtt: Duration, curr_idx: usize, curr_cwnd: usize) -> Result {
+    fn evaluate(&self, rtt: Duration, curr_idx: usize, curr_cwnd: usize) -> Outcome {
         // Compute how many bins fit in the last RTT. Integer division implicitly floors that value,
         // so `prev_idx` might be too recent by a fraction of a bin. Said fraction is scaled to
         // `0..[Self::SCALE]` for interpolation in `compute_sent`.
@@ -290,11 +290,11 @@ impl Search {
 
         if prev_idx <= Self::W {
             qdebug!("SEARCH: evaluate: not enough data for SEARCH evaluation (warming up)");
-            return Result::WarmingUp;
+            return Outcome::WarmingUp;
         }
         if curr_idx - prev_idx >= Self::EXTRA_BINS {
             qdebug!("SEARCH: evaluate: not enough data for SEARCH evaluation (RTT inflated)");
-            return Result::RttInflated;
+            return Outcome::RttInflated;
         }
 
         let curr_delv = self.compute_delv(curr_idx - Self::W, curr_idx);
@@ -303,7 +303,7 @@ impl Search {
 
         if prev_sent == 0 {
             qdebug!("SEARCH: evaluate: prev_sent is zero, can't evaluate");
-            return Result::ZeroSent;
+            return Outcome::ZeroSent;
         }
 
         let diff = prev_sent.saturating_sub(curr_delv);
@@ -315,13 +315,13 @@ impl Search {
                 "SEARCH: evaluate: norm_diff {norm_diff} < THRESH {} --> continue",
                 Self::THRESH
             );
-            return Result::Continue;
+            return Outcome::Continue;
         }
         qdebug!(
             "SEARCH: evaluate: norm_diff {norm_diff} >= THRESH {} --> exit",
             Self::THRESH
         );
-        Result::Exit(curr_cwnd)
+        Outcome::Exit(curr_cwnd)
     }
 }
 
@@ -365,7 +365,7 @@ impl SlowStart for Search {
         //
         // <https://datatracker.ietf.org/doc/html/draft-chung-ccwg-search-09#section-3.2-17>
         match self.evaluate(rtt, curr_idx, curr_cwnd) {
-            Result::Exit(cwnd) => Some(cwnd),
+            Outcome::Exit(cwnd) => Some(cwnd),
             _ => None,
         }
     }

neqo-transport/src/cc/tests/search.rs

@@ -12,7 +12,9 @@ use test_fixture::now;
 
 use crate::{
     MIN_INITIAL_PACKET_SIZE,
-    cc::{CongestionControlStats, Result, Search, classic_cc::SlowStart as _, tests::INITIAL_CWND},
+    cc::{
+        CongestionControlStats, Outcome, Search, classic_cc::SlowStart as _, tests::INITIAL_CWND,
+    },
     rtt::RttEstimate,
 };
 
@@ -345,7 +347,7 @@ fn sent_and_acked_byte_computation() {
     // `sent_bytes` and `delv_bytes` should be `10 * 1000 = 10_000`.
     assert!(
         sent_bytes == delv_bytes && delv_bytes == 10_000,
-        "Should have `sent_bytes == delv_bytes == 10_000 and got `sent_bytes = {sent_bytes}` and `delv_bytes = {delv_bytes}`"
+        "Should have `sent_bytes == delv_bytes == 10_000` and got `sent_bytes = {sent_bytes}` and `delv_bytes = {delv_bytes}`"
     );
 }
 
@@ -450,7 +452,7 @@ fn inflated_rtt_is_guarded() {
     let high_rtt = Duration::from_millis(600);
     assert_eq!(
         search.evaluate_test(high_rtt, curr_idx, INITIAL_CWND),
-        Result::RttInflated,
+        Outcome::RttInflated,
     );
 }
 
@@ -479,7 +481,7 @@ fn no_sent_bytes() {
     let curr_idx = search.curr_idx().unwrap();
     assert_eq!(
         search.evaluate_test(INITIAL_RTT, curr_idx, INITIAL_CWND),
-        Result::ZeroSent,
+        Outcome::ZeroSent,
     );
 }
 
@@ -509,7 +511,7 @@ fn warming_up() {
     let curr_idx = search.curr_idx().unwrap();
     assert_eq!(
         search.evaluate_test(INITIAL_RTT, curr_idx, INITIAL_CWND),
-        Result::WarmingUp,
+        Outcome::WarmingUp,
     );
 
     // One more bin crosses the boundary: prev_idx = 13 - 2 = 11 > W(10).
@@ -528,7 +530,7 @@ fn warming_up() {
     // Now the SEARCH checks should run.
     assert_eq!(
         search.evaluate_test(INITIAL_RTT, curr_idx, INITIAL_CWND),
-        Result::Continue,
+        Outcome::Continue,
     );
 }
 
@@ -572,7 +574,7 @@ fn continue_when_delivery_rate_steady() {
         let curr_idx = search.curr_idx().unwrap();
         assert_eq!(
             search.evaluate_test(INITIAL_RTT, curr_idx, INITIAL_CWND),
-            Result::Continue,
+            Outcome::Continue,
         );
     }
 }