chore: clippy lints

Author: avhz

crates/RustQuant_instruments/src/options/option_models.rs

@@ -1004,26 +1004,26 @@ mod bachelier {
     }
 
     const A: [f64; 8] = [
-        3.994_961_687_345_134e-1,
-        2.100_960_795_068_497e+1,
-        4.980_340_217_855_084e+1,
-        5.988_761_102_690_991e+2,
-        1.848_489_695_437_094e+3,
-        6.106_322_407_867_059e+3,
-        2.493_415_285_349_361e+4,
-        1.266_458_051_348_246e+4,
+        3.994_961_687_345_13e-1,
+        2.100_960_795_068_49e+1,
+        4.980_340_217_855_08e+1,
+        5.988_761_102_690_99e+2,
+        1.848_489_695_437_09e+3,
+        6.106_322_407_867_05e+3,
+        2.493_415_285_349_36e+4,
+        1.266_458_051_348_24e+4,
     ];
 
     const B: [f64; 9] = [
-        4.990_534_153_589_422e+1,
-        3.093_573_936_743_112e+1,
-        1.495_105_008_310_999e+3,
-        1.323_614_537_899_738e+3,
-        1.598_919_697_679_745e+4,
-        2.392_008_891_720_782e+4,
-        3.608_817_108_375_034e+3,
-        -2.067_719_486_400_926e+2,
-        1.174_240_599_306_013e+1,
+        4.990_534_153_589_42e+1,
+        3.093_573_936_743_11e+1,
+        1.495_105_008_310_99e+3,
+        1.323_614_537_899_73e+3,
+        1.598_919_697_679_74e+4,
+        2.392_008_891_720_78e+4,
+        3.608_817_108_375_03e+3,
+        -2.067_719_486_400_92e+2,
+        1.174_240_599_306_01e+1,
     ];
 
     #[inline]
@@ -1034,12 +1034,14 @@ mod bachelier {
         let mut sum1 = 0.0;
         let mut sum2 = 0.0;
 
-        for k in 0..A.len() {
-            sum1 += A[k] * eta.powi(k as i32);
+        // for k in 0..A.len() {
+        for (k, v) in A.iter().enumerate() {
+            sum1 += v * eta.powi(k as i32);
         }
 
-        for k in 0..B.len() {
-            sum2 += B[k] * eta.powi(k as i32);
+        // for k in 0..B.len() {
+        for (k, v) in B.iter().enumerate() {
+            sum2 += v * eta.powi(k as i32);
         }
 
         let hn = eta.sqrt() * sum1 / (1. + sum2);
@@ -1055,12 +1057,14 @@ mod bachelier {
         let mut sum1 = 0.0;
         let mut sum2 = 0.0;
 
-        for k in 0..A.len() {
-            sum1 += A[k] * eta.powi(k as i32);
+        // for k in 0..A.len() {
+        for (k, v) in A.iter().enumerate() {
+            sum1 += v * eta.powi(k as i32);
         }
 
-        for k in 1..=B.len() {
-            sum2 += B[k] * eta.powi(k as i32);
+        // for k in 1..=B.len() {
+        for (k, v) in B.iter().enumerate().skip(1) {
+            sum2 += v * eta.powi(k as i32);
         }
 
         let hn = eta.sqrt() * sum1 / (1. + sum2);