1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
use std::collections::HashMap;
use crate::{
core::prelude::*,
errors::prelude::*,
extensions::prelude::*,
validators::prelude::*,
};
use crate::prelude::Numeric;
/// `ArrayTrait` - Array Reordering functions
pub trait ArrayReorder<T: ArrayElement> where Self: Sized + Clone {
/// Reverse the order of elements in an array along the given axis
///
/// # Arguments
///
/// * `axes` - axes along which to flip over. if None, will flip over all of the axes.
///
/// # Examples
///
/// ```
/// use arr_rs::prelude::*;
///
/// let arr = array_arange!(i32, 0, 7).reshape(&[2, 2, 2]);
/// assert_eq!(array!(i32, [[[1, 0], [3, 2]], [[5, 4], [7, 6]]]), arr.flip(Some(vec![2])));
/// ```
///
/// # Errors
///
/// may returns `ArrayError`
fn flip(&self, axes: Option<Vec<isize>>) -> Result<Array<T>, ArrayError>;
/// Reverse the order of elements along axis 0 (up/down)
///
/// # Examples
///
/// ```
/// use arr_rs::prelude::*;
///
/// let arr = array_arange!(i32, 0, 7).reshape(&[2, 2, 2]);
/// assert_eq!(array!(i32, [[[4, 5], [6, 7]], [[0, 1], [2, 3]]]), arr.flipud());
/// ```
///
/// # Errors
///
/// may returns `ArrayError`
fn flipud(&self) -> Result<Array<T>, ArrayError>;
/// Reverse the order of elements along axis 1 (left/right)
///
/// # Examples
///
/// ```
/// use arr_rs::prelude::*;
///
/// let arr = array_arange!(i32, 0, 7).reshape(&[2, 2, 2]);
/// assert_eq!(array!(i32, [[[2, 3], [0, 1]], [[6, 7], [4, 5]]]), arr.fliplr());
/// ```
///
/// # Errors
///
/// may returns `ArrayError`
fn fliplr(&self) -> Result<Array<T>, ArrayError>;
/// Roll array elements along a given axis
///
/// # Arguments
///
/// * `shift` - number of places by which elements are shifted.
/// if a tuple, then axis must be a tuple of the same size, and each of the given axes is shifted by the corresponding number.
/// if an int while axis is a tuple of ints, then the same value is used for all given axes.
/// * `axes` - axes along which to roll over. if None, will flip over all of the axes.
///
/// # Examples
///
/// ```
/// use arr_rs::prelude::*;
///
/// let arr = array_arange!(i32, 0, 7).reshape(&[2, 2, 2]);
/// assert_eq!(array!(i32, [[[4, 5], [6, 7]], [[0, 1], [2, 3]]]), arr.roll(vec![1], Some(vec![0])));
/// ```
///
/// # Errors
///
/// may returns `ArrayError`
fn roll(&self, shift: Vec<isize>, axes: Option<Vec<isize>>) -> Result<Array<T>, ArrayError>;
/// Rotate an array by 90 degrees in the plane specified by axes.
/// Rotation direction is from the first towards the second axis.
///
/// # Arguments
///
/// * `k` - number of times the array is rotated by 90 degrees.
/// * `axes` - the array is rotated in the plane defined by the axes. axes must be different.
///
/// # Examples
///
/// ```
/// use arr_rs::prelude::*;
///
/// let arr = array_arange!(i32, 0, 7).reshape(&[2, 4]);
/// assert_eq!(array!(i32, [[3, 7], [2, 6], [1, 5], [0, 4]]), arr.rot90(1, vec![0, 1]));
/// ```
///
/// # Errors
///
/// may returns `ArrayError`
fn rot90(&self, k: usize, axes: Vec<isize>) -> Result<Array<T>, ArrayError>;
}
impl <T: ArrayElement> ArrayReorder<T> for Array<T> {
fn flip(&self, axes: Option<Vec<isize>>) -> Result<Self, ArrayError> {
match axes {
None => Self::new(self.get_elements()?.reverse_ext(), self.get_shape()?),
Some(axes) => {
let self_shape = self.shape.clone();
let axes = axes.into_iter().map(|i| self.normalize_axis(i)).collect::<Vec<usize>>();
let mut elements = self.elements.clone();
for ax in axes {
let flatten = Self::flat(elements);
elements =
if ax == 0 { flatten
.split(self_shape[0], Some(0))?.reverse_ext().into_iter()
.flatten().collect::<Vec<T>>()
} else if ax == self.ndim()? - 1 { flatten
.split(self_shape[0..ax].iter().product(), None)?.iter_mut()
.flat_map(|arr| arr.elements.reverse_ext())
.collect::<Vec<T>>()
} else { flatten
.split(self_shape[ax], None)?.into_iter()
.map(|i| i.reshape(&self.shape.clone().remove_at(ax)))
.map(|i| i.flip(Some(vec![ax.to_isize() - 1])))
.collect::<Vec<Result<Self, _>>>()
.has_error()?.into_iter()
.flat_map(Result::unwrap)
.collect::<Vec<T>>()
}
};
Self::flat(elements).reshape(&self_shape)
}
}
}
fn flipud(&self) -> Result<Self, ArrayError> {
self.is_dim_unsupported(&[0])?;
self.clone().flip(Some(vec![0]))
}
fn fliplr(&self) -> Result<Self, ArrayError> {
self.is_dim_unsupported(&[0, 1])?;
self.clone().flip(Some(vec![1]))
}
fn roll(&self, shift: Vec<isize>, axes: Option<Vec<isize>>) -> Result<Self, ArrayError> {
let array = if axes.is_none() { self.ravel()? } else { self.clone() };
let axes = axes.unwrap_or_else(|| vec![0]);
let broadcasted = Array::flat(shift).broadcast(&Array::flat(axes)?)?;
if broadcasted.ndim()? > 1 { return Err(ArrayError::ParameterError { param: "'shift' and 'axis'", message: "should be 1D" }); }
let broadcasted = broadcasted.into_iter().map(|a| (
self.normalize_axis(a.1),
a.0,
)).collect::<Vec<(usize, isize)>>();
let mut shifts: HashMap<usize, isize> = HashMap::new();
for (a, b) in &broadcasted {
*shifts.entry(*a).or_insert(0) += *b;
}
let mut elements = array.get_elements()?;
match array.ndim()? {
0 => Self::empty(),
1 => {
for &sh in shifts.values() {
if sh >= 0 { elements.rotate_right(sh.to_usize()); }
else { elements.rotate_left(sh.unsigned_abs()); }
}
Self::flat(elements).reshape(&self.shape)
},
_ => {
for (ax, sh) in shifts.clone() {
let flatten = Self::flat(elements.clone());
elements = if ax == 0 {
let mut split = flatten.split(self.shape[0], Some(0))?;
if sh >= 0 { split.rotate_right(sh.to_usize()); }
else { split.rotate_left(sh.unsigned_abs()); }
split.into_iter().flatten().collect()
} else if ax == array.ndim()? - 1 { flatten
.split(self.shape[0..ax].iter().product(), None)?.iter()
.flat_map(|item| {
let mut tmp_item = item.elements.clone();
if sh >= 0 { tmp_item.rotate_right(sh.to_usize()); }
else { tmp_item.rotate_left(sh.unsigned_abs()); }
tmp_item
}).collect()
} else { flatten
.split(self.shape[ax], None)?.into_iter()
.map(|i| i.reshape(&self.shape.clone().remove_at(ax)))
.map(|i| i.roll(vec![shifts[&ax]], Some(vec![ax.to_isize() - 1])))
.collect::<Vec<Result<Self, _>>>()
.has_error()?.into_iter()
.flat_map(Result::unwrap)
.collect::<Vec<T>>()
}
}
Self::new(elements, self.shape.clone())
}
}
}
fn rot90(&self, k: usize, axes: Vec<isize>) -> Result<Self, ArrayError> {
self.is_dim_unsupported(&[0, 1])?;
if axes.len() != 2 {
return Err(ArrayError::ParameterError { param: "axes", message: "axes length must be 2" })
}
let self_ndim = self.ndim()?.to_isize();
if axes[0] >= self_ndim || axes[0] < -self_ndim || axes[1] >= self_ndim || axes[1] < -self_ndim {
return Err(ArrayError::ParameterError { param: "axes", message: "out of range" })
}
let k = k % 4;
if k == 0 { return Ok(self.clone()) }
if k == 2 { return self.flip(Some(vec![axes[1]])).flip(Some(vec![axes[0]])) }
let axes = axes.into_iter().map(|i| self.normalize_axis(i)).collect::<Vec<usize>>();
let mut axes_list = (0..self_ndim).collect::<Vec<isize>>();
(axes_list[axes[0]], axes_list[axes[1]]) = (axes_list[axes[1]], axes_list[axes[0]]);
if k == 1 { self.flip(Some(vec![axes[1].to_isize()])).transpose(Some(axes_list)) }
else { self.transpose(Some(axes_list)).flip(Some(vec![axes[1].to_isize()])) }
}
}
impl <T: ArrayElement> ArrayReorder<T> for Result<Array<T>, ArrayError> {
fn flip(&self, axes: Option<Vec<isize>>) -> Self {
self.clone()?.flip(axes)
}
fn flipud(&self) -> Self {
self.clone()?.flipud()
}
fn fliplr(&self) -> Self {
self.clone()?.fliplr()
}
fn roll(&self, shift: Vec<isize>, axes: Option<Vec<isize>>) -> Self {
self.clone()?.roll(shift, axes)
}
fn rot90(&self, k: usize, axes: Vec<isize>) -> Self {
self.clone()?.rot90(k, axes)
}
}