pub fn take_primitive_iter_n_arrays<T: DFNumericType, I: IntoIterator<Item = usize>>(
    ca: &DataArray<T>,
    indices: I,
) -> DataArray<T> {
    let taker = ca.take_rand();
    indices.into_iter().map(|idx| taker.get(idx)).collect()
}
/// Take kernel for multiple chunks. We directly return a DataArray because that path chooses the fastest collection path.
Take kernel for multiple chunks. We directly return a DataArray because that path chooses the fastest collection path.
Take kernel for multiple chunks . We directly return a DataArray because that path chooses the fastest collection path .
pub fn take_primitive_iter_n_arrays<T: DFNumericType, I: IntoIterator<Item = usize>>(
    ca: &DataArray<T>,
    indices: I,
) -> DataArray<T> {
    let taker = ca.take_rand();
    indices.into_iter().map(|idx| taker.get(idx)).collect()
}
pub fn take_primitive_iter_n_arrays < T : DFNumericType , I : IntoIterator < Item = usize > > ( ca : & DataArray < T > , indices : I , ) -> DataArray < T > { let taker = ca . take_rand ( ) ; indices . into_iter ( ) . map ( | idx | taker . get ( idx ) ) . collect ( ) }
Take kernel for multiple chunks.
Take kernel for multiple chunks .
ca
&DataArray<T>
indices
I
ca
&DataArray<T>
indices
I