FEAT: Use from_shape_fn_memory_order in ndarray-rand

This simplifies random/random_using methods by skipping the index
iteration in the constructor, which is unused anyway and only used for
figuring out how many elments to make.

Author: bluss

ndarray-rand/src/lib.rs

@@ -246,7 +246,7 @@ where
         R: Rng + ?Sized,
         Sh: ShapeBuilder<Dim = D>,
     {
-        Self::from_shape_fn(shape, |_| dist.sample(rng))
+        Self::from_shape_fn_memory_order(shape, |_| dist.sample(rng))
     }
 
     fn sample_axis(&self, axis: Axis, n_samples: usize, strategy: SamplingStrategy) -> Array<A, D>

ndarray-rand/tests/tests.rs

@@ -1,6 +1,8 @@
 use ndarray::{Array, Array2, ArrayView1, Axis};
 #[cfg(feature = "quickcheck")]
 use ndarray_rand::rand::{distributions::Distribution, thread_rng};
+
+use ndarray::ShapeBuilder;
 use ndarray_rand::rand_distr::Uniform;
 use ndarray_rand::{RandomExt, SamplingStrategy};
 use quickcheck::quickcheck;
@@ -14,6 +16,21 @@ fn test_dim() {
             assert_eq!(a.shape(), &[m, n]);
             assert!(a.iter().all(|x| *x < 2.));
             assert!(a.iter().all(|x| *x >= 0.));
+            assert!(a.is_standard_layout());
+        }
+    }
+}
+
+#[test]
+fn test_dim_f() {
+    let (mm, nn) = (5, 5);
+    for m in 0..mm {
+        for n in 0..nn {
+            let a = Array::random((m, n).f(), Uniform::new(0., 2.));
+            assert_eq!(a.shape(), &[m, n]);
+            assert!(a.iter().all(|x| *x < 2.));
+            assert!(a.iter().all(|x| *x >= 0.));
+            assert!(a.t().is_standard_layout());
         }
     }
 }