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
use crate::{
core::prelude::*,
errors::prelude::*,
extensions::prelude::*,
};
/// `ArrayTrait` - Array Sort functions
pub trait ArraySort<T: ArrayElement> where Self: Sized + Clone {
/// Sort an array
///
/// # Arguments
///
/// * `axis` - axis along which to sort. if None, array is flattened
/// * `kind` - {‘quicksort’, ‘mergesort’, ‘heapsort’, ‘stable’}, optional. defaults to `quicksort`
///
/// # Examples
///
/// ```
/// use arr_rs::prelude::*;
///
/// let arr = array!(i32, [[1, 4], [3, 1]]);
/// assert_eq!(array!(i32, [1, 1, 3, 4]), arr.sort(None, None::<&str>));
///
/// let arr = array!(i32, [[1, 4], [3, 1]]);
/// assert_eq!(array!(i32, [[1, 4], [1, 3]]), arr.sort(Some(-1), None::<&str>));
/// ```
///
/// # Errors
///
/// may returns `ArrayError`
fn sort(&self, axis: Option<isize>, kind: Option<impl SortKindType>) -> Result<Array<T>, ArrayError>;
/// Returns the indices that would sort an array
///
/// # Arguments
///
/// * `axis` - axis along which to sort. if None, array is flattened
/// * `kind` - {‘quicksort’, ‘mergesort’, ‘heapsort’, ‘stable’}, optional. defaults to `quicksort`
///
/// # Examples
///
/// ```
/// use arr_rs::prelude::*;
///
/// let arr = array!(i32, [[1, 4], [3, 1]]);
/// assert_eq!(array!(usize, [0, 3, 2, 1]), arr.argsort(None, None::<&str>));
///
/// let arr = array!(i32, [[1, 4], [3, 1]]);
/// assert_eq!(array!(usize, [[0, 1], [1, 0]]), arr.argsort(Some(-1), None::<&str>));
/// ```
///
/// # Errors
///
/// may returns `ArrayError`
fn argsort(&self, axis: Option<isize>, kind: Option<impl SortKindType>) -> Result<Array<usize>, ArrayError>;
}
impl <T: ArrayElement> ArraySort<T> for Array<T> {
fn sort(&self, axis: Option<isize>, kind: Option<impl SortKindType>) -> Result<Self, ArrayError> {
let kind = match kind {
Some(k) => k.parse_type()?,
None => SortKind::Quicksort,
};
if let Some(axis) = axis {
let axis = self.normalize_axis(axis);
self.apply_along_axis(axis, |arr| arr.sort(None, Some(kind)))
} else {
let elements = self.get_elements()?;
match kind {
SortKind::Mergesort => elements.merge_sort(),
SortKind::Quicksort => elements.quick_sort(),
SortKind::Heapsort => elements.heap_sort(),
SortKind::Stable => elements.tim_sort(),
}.to_array()
}
}
fn argsort(&self, axis: Option<isize>, kind: Option<impl SortKindType>) -> Result<Array<usize>, ArrayError> {
let kind = match kind {
Some(k) => k.parse_type()?,
None => SortKind::Quicksort,
};
if let Some(axis) = axis {
let axis = self.normalize_axis(axis);
self.apply_along_axis(axis, |arr| arr.argsort(None, Some(kind)))
} else {
let elements = self.get_elements()?;
let mut sorted = match kind {
SortKind::Mergesort => elements.merge_sort(),
SortKind::Quicksort => elements.quick_sort(),
SortKind::Heapsort => elements.heap_sort(),
SortKind::Stable => elements.tim_sort(),
}.to_array()?.get_elements()?
.into_iter().enumerate()
.collect::<Vec<(usize, T)>>();
self.get_elements()?.into_iter()
.map(|item| {
let item = sorted.clone().into_iter().find(|(_, a)| a == &item).unwrap();
let index = sorted.clone().into_iter().position(|aa| aa == item).unwrap();
sorted.remove(index);
item.0
})
.collect::<Vec<usize>>()
.to_array()
}
}
}
impl <T: ArrayElement> ArraySort<T> for Result<Array<T>, ArrayError> {
fn sort(&self, axis: Option<isize>, kind: Option<impl SortKindType>) -> Self {
self.clone()?.sort(axis, kind)
}
fn argsort(&self, axis: Option<isize>, kind: Option<impl SortKindType>) -> Result<Array<usize>, ArrayError> {
self.clone()?.argsort(axis, kind)
}
}