1use core::mem::ManuallyDrop;
6
7use super::*;
8
9use generic_array::internals::ArrayConsumer;
10
11pub unsafe trait Select<T, N: ArrayLength> {
13 fn select(self, true_values: NumericArray<T, N>, false_values: NumericArray<T, N>) -> NumericArray<T, N>;
33}
34
35pub unsafe trait Permute<T, N: ArrayLength> {
37 fn permute(self, values: &NumericArray<T, N>) -> NumericArray<T, N>;
39}
40
41unsafe impl<T, I, N: ArrayLength> Permute<T, N> for NumericArray<I, N>
42where
43 T: Clone,
44 I: Copy + Into<usize>,
45{
46 #[inline]
47 fn permute(self, values: &NumericArray<T, N>) -> NumericArray<T, N> {
48 NumericArray::from_iter(self.iter().map(|index| unsafe {
49 let index: usize = (*index).into();
50
51 values.get_unchecked(index.min(N::to_usize())).clone()
52 }))
53 }
54}
55
56unsafe impl<T, N: ArrayLength> Select<T, N> for NumericArray<bool, N> {
57 #[inline]
58 fn select(self, true_values: NumericArray<T, N>, false_values: NumericArray<T, N>) -> NumericArray<T, N> {
59 if core::mem::needs_drop::<T>() {
60 unsafe {
61 let mut true_values = ArrayConsumer::new(true_values.0);
62 let mut false_values = ArrayConsumer::new(false_values.0);
63
64 let (true_values_iter, true_values_position) = true_values.iter_position();
65 let (false_values_iter, false_values_position) = false_values.iter_position();
66
67 NumericArray::from_iter(self.0.iter().zip(true_values_iter.zip(false_values_iter)).map(|(m, (t, f))| {
68 let t = ptr::read(t);
69 let f = ptr::read(f);
70
71 *true_values_position += 1;
72 *false_values_position = *true_values_position;
73
74 match *m {
75 true => t,
76 false => f,
77 }
78 }))
79 }
80 } else {
81 let true_values = ManuallyDrop::new(true_values);
82 let mut values = ManuallyDrop::new(false_values);
83
84 for (mask, (v, t)) in self.iter().zip(values.iter_mut().zip(true_values.iter())) {
85 if *mask {
86 unsafe { ptr::copy_nonoverlapping(t, v, 1) };
87 }
88 }
89
90 ManuallyDrop::into_inner(values)
91 }
92 }
93}