buldak 0.28.1

It is a library that provides various sorting functions.
Documentation 
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

//! radix sort algorithm.
//!
//! **O(wN)**: w=length of key

use std::convert::{TryFrom, TryInto};

/// Sort in ascending order using a radix sort algorithm.
///
/// The parameter 'radix' is ​​the base on which to sort.
/// If you want decimal based sorting, you can pass 10.
///
/// ```rust
/// use buldak::radix;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, -33, 234, 21, 13];
/// radix::sort(&mut nums, 10);
/// assert_eq!(nums, [-33, 1, 2, 3, 4, 5, 13, 21, 111, 234]);
/// ```
pub fn sort<T>(array: &mut [T], radix: usize) -> Result<(), String>
where
    T: TryInto<isize> + TryFrom<isize> + std::clone::Clone,
    <T as TryInto<isize>>::Error: std::fmt::Debug,
{
    _radix_sort_scan_impl(array, radix, true)
}

/// Sort in descending order using a radix algorithm.
///
/// The parameter 'radix' is ​​the base on which to sort.
/// If you want decimal based sorting, you can pass 10.
///
/// ```rust
/// use buldak::radix;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, -33, 234, 21, 13];
/// radix::sort_reverse(&mut nums, 10);
/// assert_eq!(nums, [234, 111, 21, 13, 5, 4, 3, 2, 1, -33]);
/// ```
pub fn sort_reverse<T>(array: &mut [T], radix: usize) -> Result<(), String>
where
    T: TryInto<isize> + TryFrom<isize> + std::clone::Clone,
    <T as TryInto<isize>>::Error: std::fmt::Debug,
{
    _radix_sort_scan_impl(array, radix, false)
}

fn _radix_sort_impl<T>(
    array: &mut [T],
    digits_max: usize,
    radix: usize,
    asc: bool,
) -> Result<(), String>
where
    T: TryInto<isize> + TryFrom<isize> + std::clone::Clone,
    <T as TryInto<isize>>::Error: std::fmt::Debug,
{
    use std::collections::LinkedList;
    let mut counter = vec![LinkedList::new(); radix];
    let mut neg_counter = vec![LinkedList::new(); radix];

    for y in 0..digits_max {
        for j in 0..array.len() {
            let mut e = array[j].to_owned().try_into().unwrap();
            let is_neg = e < 0;

            if is_neg {
                e = e.abs();
            }

            let modulo = radix.pow(y as u32 + 1) as isize;
            let divisor = modulo / radix as isize;
            let index = e % modulo / divisor;

            if is_neg {
                neg_counter[index as usize].push_back(array[j].to_owned());
            } else {
                counter[index as usize].push_back(array[j].to_owned());
            }
        }

        let mut pos = 0;

        if asc {
            for i in 0_isize..(neg_counter.len() as isize) {
                while let Some(value) = neg_counter[i as usize].pop_back() {
                    array[pos] = value;
                    pos += 1;
                }
            }
            for i in 0_isize..(counter.len() as isize) {
                while let Some(value) = counter[i as usize].pop_front() {
                    array[pos] = value;
                    pos += 1;
                }
            }
        } else {
            for i in (0_isize..(counter.len() as isize)).rev() {
                while let Some(value) = counter[i as usize].pop_front() {
                    array[pos] = value;
                    pos += 1;
                }
            }
            for i in (0_isize..(neg_counter.len() as isize)).rev() {
                while let Some(value) = neg_counter[i as usize].pop_back() {
                    array[pos] = value;
                    pos += 1;
                }
            }
        }
    }

    Ok(())
}

fn _radix_sort_scan_impl<T>(array: &mut [T], radix: usize, asc: bool) -> Result<(), String>
where
    T: TryInto<isize> + TryFrom<isize> + std::clone::Clone,
    <T as TryInto<isize>>::Error: std::fmt::Debug,
{
    if array.len() == 0 {
        return Ok(());
    }

    let mut abs_max: isize = array[0].to_owned().try_into().unwrap().abs();
    for e in array.iter() {
        let e: isize = e.to_owned().try_into().unwrap().abs();
        if e > abs_max {
            abs_max = e;
        }
    }

    let abs_max = abs_max as f64;

    let digits_max = abs_max.log(radix as f64) as usize + 1;

    return _radix_sort_impl(array, digits_max, radix, asc);
}

// /// Sort in ascending order using a radix sort algorithm.
// ///
// /// The parameter 'radix' is ​​the base on which to sort.
// /// If you want decimal based sorting, you can pass 10.
// ///
// /// The parameter 'digits_max' is the maximum number of digits in the array.
// /// For example, if the maximum number in the array does not exceed 9999, you can pass 4.
// /// Any value beyond this number will cause an error.
// ///
// /// ```rust
// /// use buldak::radix;
// ///
// /// let mut nums = [1, 4, 2, 3, 5, 111, -33, 234, 21, 13];
// /// radix::sort(&mut nums, 10, 4);
// /// assert_eq!(nums, [-33, 1, 2, 3, 4, 5, 13, 21, 111, 234]);
// /// ```
// pub fn sort<T>(array: &mut [T], radix: usize, digits_max: usize)-> Result<(), String>
// where
//     T: TryInto<isize> + TryFrom<isize> + std::clone::Clone,
//     <T as TryInto<isize>>::Error: std::fmt::Debug,
// {
//     _radix_sort_impl(array, digits_max, radix, true)
// }

// /// Sort in descending order using a radix algorithm.
// ///
// /// The parameter 'radix' is ​​the base on which to sort.
// /// If you want decimal based sorting, you can pass 10.
// ///
// /// The parameter 'digits_max' is the maximum number of digits in the array.
// /// For example, if the maximum number in the array does not exceed 9999, you can pass 4.
// /// Any value beyond this number will cause an error.
// ///
// /// ```rust
// /// use buldak::radix;
// ///
// /// let mut nums = [1, 4, 2, 3, 5, 111, -33, 234, 21, 13];
// /// radix::sort_reverse(&mut nums, 10, 4);
// /// assert_eq!(nums, [234, 111, 21, 13, 5, 4, 3, 2, 1, -33]);
// /// ```
// pub fn sort_reverse<T>(array: &mut [T], radix: usize, digits_max: usize) -> Result<(), String>
// where
//     T: TryInto<isize> + TryFrom<isize> + std::clone::Clone,
//     <T as TryInto<isize>>::Error: std::fmt::Debug,
// {
//     _radix_sort_impl(array, digits_max, radix, false)
// }

mod tests {
    #[test]
    fn sort_ascending() {
        struct TestCase {
            input: Vec<i32>,
            expected: Vec<i32>,
        }

        let test_cases = vec![TestCase {
            input: vec![1, 4, 2, 3, 5, 111, 234, 21, 13],
            expected: vec![1, 2, 3, 4, 5, 13, 21, 111, 234],
        }];

        for case in test_cases {
            let mut actual = case.input.clone();
            super::sort(&mut actual, 10).unwrap();
            assert_eq!(actual, case.expected);
        }
    }

    #[test]
    fn sort_descending() {
        struct TestCase {
            input: Vec<i32>,
            expected: Vec<i32>,
        }

        let test_cases = vec![TestCase {
            input: vec![1, 4, 2, 3, 5, 111, 234, 21, 13],
            expected: vec![234, 111, 21, 13, 5, 4, 3, 2, 1],
        }];

        for case in test_cases {
            let mut actual = case.input.clone();
            super::sort_reverse(&mut actual, 10).unwrap();
            assert_eq!(actual, case.expected);
        }
    }
}