fix: .accept()

Author: Evalir

src/est.rs

@@ -34,7 +34,7 @@ impl SearchRange {
 
     /// Calculate the midpoint of the search range.
     pub(crate) const fn midpoint(&self) -> u64 {
-        (self.max() + self.min()) / 2
+        ((self.max() as u128 + self.min() as u128) / 2) as u64
     }
 
     /// Get the start of the search range.
@@ -272,6 +272,33 @@ impl EstimationResult {
     }
 }
 
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_search_range() {
+        let mut range = SearchRange::new(100, 200);
+        assert_eq!(range.min(), 100);
+        assert_eq!(range.max(), 200);
+        assert_eq!(range.size(), 100);
+        assert_eq!(range.ratio(), 0.5);
+        assert_eq!(range.midpoint(), 150);
+        assert!(range.contains(150));
+
+        range.maybe_raise_min(100);
+        assert_eq!(range.min(), 100);
+
+        range.maybe_raise_min(125);
+        assert_eq!(range.min(), 125);
+        assert_eq!(range.midpoint(), 162);
+
+        range.maybe_lower_max(180);
+        assert_eq!(range.max(), 180);
+        assert_eq!(range.midpoint(), 152);
+    }
+}
+
 // Some code above is reproduced from `reth`. It is reused here under the MIT
 // license.
 //

src/evm.rs

@@ -2432,14 +2432,14 @@ mod tests {
 
         let tx = tx.with_gas_limit(estimation.limit());
 
-        let mut output = trevm.clear_tx().fill_tx(&tx).run().unwrap();
+        let mut output = trevm.clear_tx().fill_tx(&tx).run().unwrap().accept();
 
-        let bob_code = output.read_code(BOB.address());
+        let bob_code = output.1.read_code(BOB.address());
         dbg!(&bob_code);
 
-        dbg!(&output.result());
-        assert!(output.result().is_success());
-        assert!(output.result().logs().len() == 1);
+        dbg!(&output.0);
+        assert!(output.0.is_success());
+        assert!(output.0.logs().len() == 1);
     }
 }