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

//! quick sort algorithm.
//!
//! unstable sort  
//! **average:O(Nlog₂N), worst:O(N²)**

//mod utils;

/// Sort in ascending order using a quick sort algorithm.
///
/// ```rust
/// use buldak::quick;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// quick::sort(&mut nums);
/// assert_eq!(nums, [1, 2, 3, 4, 5, 13, 21, 111, 234]);
/// ```
pub fn sort<T>(array: &mut [T])
where
    T: std::cmp::Ord + std::clone::Clone,
{
    sort_by(array, |l, r| l.cmp(r))
}

/// Sort in descending order using a quick sort algorithm.
///
/// ```rust
/// use buldak::quick;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// quick::sort_reverse(&mut nums);
/// assert_eq!(nums, [234, 111, 21, 13, 5, 4, 3, 2, 1]);
/// ```
pub fn sort_reverse<T>(array: &mut [T])
where
    T: std::cmp::Ord + std::clone::Clone,
{
    sort_by(array, |l, r| l.cmp(r).reverse())
}

/// It takes a comparator function to determine the order,
/// and sorts it using a quick sort algorithm.
///
/// ```rust
/// use buldak::quick;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// quick::sort_by(&mut nums, |l, r| l.cmp(r));
/// assert_eq!(nums, [1, 2, 3, 4, 5, 13, 21, 111, 234]);
/// ```
pub fn sort_by<T, F>(array: &mut [T], compare: F)
where
    T: std::cmp::Ord + std::clone::Clone,
    F: Fn(&T, &T) -> std::cmp::Ordering + std::clone::Clone,
{
    _quick_sort_impl(array, compare)
}

fn _library_sort<T, F>(array: &mut [T], n: usize, epsilon: f64, compare: F)
where
    T: std::cmp::Ord + std::clone::Clone,
    F: Fn(&T, &T) -> std::cmp::Ordering + std::clone::Clone,
{
    let epsilon = 1;

    let s_len = ((1+epsilon) * array.len() as f64) as usize;
    let mut buffer:Vec<Option<T>> = vec![None; s_len];

    let mut i = 0;
    let mut j = 0;

    _library_sort_impl

    while i<s_len && j <array.len() {
        if buffer[i].is_some() {
            array[j] = buffer[i].unwrap().to_owned();
            j+=1;
        }
    }
}

fn _library_sort_impl<T, F>(array: &mut [T], n: usize, epsilon: f64, compare: F)
where
    T: std::cmp::Ord + std::clone::Clone,
    F: Fn(&T, &T) -> std::cmp::Ordering + std::clone::Clone,
{
    let mut goal = 1;
    let mut pos = 0;

    let sLen = ((1+epsilon)*n as i64) as usize;

    while pos < n {
        for i in 1..=goal {

        }

        
        goal *= 2;
    }
}

fn _rebalance<T, F>(array: &mut [T], n: usize, epsilon: f64, compare: F)
where
    T: std::cmp::Ord + std::clone::Clone,
    F: Fn(&T, &T) -> std::cmp::Ordering + std::clone::Clone,
{
}