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
// devela::data::layout::sort::impl_primitives
//
//! Implements compile-time sorting algorithms for arrays of primitives.
//
use crate::{Cmp, Sort, cswap, is, paste, whilst};
/* impl Sort on primitives */
macro_rules! impl_sort {
() => {
impl_sort![signed i8, i16, i32, i64, i128, isize];
impl_sort![unsigned u8, u16, u32, u64, u128, usize];
impl_sort![float f32, f64];
};
// $t: the input/output primitive type
(signed $( $t:ty ),+) => { $( impl_sort![@signed $t]; )+ };
(unsigned $( $t:ty ),+) => { $( impl_sort![@unsigned $t]; )+ };
(float $( $t:ty ),+) => { $( impl_sort![@float $t]; )+ };
(@signed $t:ty) => { paste! {
/// Implement const sorting methods for arrays of primitives.
impl<const N: usize> Sort<[$t; N]> {
/// Returns a copied sorted array using bubble sort.
#[must_use]
pub const fn bubble_array(&mut self) -> [$t; N] {
let mut arr = self.0;
whilst![i in 0..N; {
whilst![j in 0..N-i-1; {
is![arr[j] > arr[j+1], cswap!(xor arr[j], arr[j+1])];
}];
}];
arr
}
/// Returns a copied sorted array using insertion sort.
#[must_use]
pub const fn insertion_array(&mut self) -> [$t; N] {
let mut arr = self.0;
whilst![i in 1..N; {
let mut j = i;
while j > 0 && arr[j-1] > arr[j] {
cswap!(xor arr[j], arr[j-1]);
j -= 1;
}
}];
arr
}
/// Returns a copied sorted array using insertion sort.
#[must_use]
pub const fn selection_array(&mut self) -> [$t; N] {
let mut arr = self.0;
whilst![i in 0..N-1; {
let mut min_index = i;
whilst![j in (i+1),..N; {
is![arr[j] < arr[min_index], min_index = j];
}];
cswap!(xor arr[min_index], arr[i]);
}];
arr
}
}
}};
(@unsigned $t:ty) => { paste! {
impl<const N: usize> Sort<[$t; N]> {
/// Returns a copied sorted array using bubble sort.
#[must_use]
pub const fn bubble_array(&mut self) -> [$t; N] {
let mut arr = self.0;
whilst![i in 0..N; {
whilst![j in 0..N-i-1; {
is![arr[j] > arr[j+1], cswap!(xor: arr[j], arr[j+1])];
}];
}];
arr
}
/// Returns a copied sorted array using insertion sort.
#[must_use]
pub const fn insertion_array(&mut self) -> [$t; N] {
let mut arr = self.0;
whilst![i in 1..N; {
let mut j = i;
while j > 0 && arr[j-1] > arr[j] {
cswap!(xor: arr[j], arr[j-1]);
j -= 1;
}
}];
arr
}
/// Returns a copied sorted array using selection sort.
#[must_use]
pub const fn selection_array(&mut self) -> [$t; N] {
let mut arr = self.0;
whilst![i in 0..N-1; {
let mut min_index = i;
whilst![j in (i+1),..N; {
is![arr[j] < arr[min_index], min_index = j];
}];
cswap!(xor: arr[min_index], arr[i]);
}];
arr
}
}
}};
(@float $t:ty) => { paste! {
impl<const N: usize> Sort<[$t; N]> {
/// Returns a copied sorted array using bubble sort.
#[must_use]
pub const fn bubble_array(&mut self) -> [$t; N] {
let mut arr = self.0;
whilst![i in 0..N; {
whilst![j in 0..N-i-1; {
is![Cmp(arr[j]).gt(arr[j+1]), cswap!(tmp: arr[j], arr[j+1])];
}];
}];
arr
}
/// Returns a copied sorted array using insertion sort.
#[must_use]
pub const fn insertion_array(&mut self) -> [$t; N] {
let mut arr = self.0;
whilst![i in 1..N; {
let mut j = i;
while j > 0 && Cmp(arr[j-1]).gt(arr[j]) {
cswap!(tmp: arr[j], arr[j-1]);
j -= 1;
}
}];
arr
}
/// Returns a copied sorted array using selection sort.
#[must_use]
pub const fn selection_array(&mut self) -> [$t; N] {
let mut arr = self.0;
whilst![i in 0..N-1; {
let mut min_index = i;
whilst![j in (i+1),..N; {
is![Cmp(arr[j]).lt(arr[min_index]), min_index = j];
}];
cswap!(tmp: arr[min_index], arr[i]);
}];
arr
}
}
}};
}
impl_sort![];