gtfsort 0.2.4

An optimized chr/pos/feature GTF/GFF sorter using a lexicographic-based index ordering algorithm written in Rust.
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

use std::{borrow::Cow, cmp::Ordering, fmt::Debug, ops::Deref};

#[derive(Debug, PartialEq, Eq)]
pub struct CowNaturalSort<'a>(pub Cow<'a, str>);

impl<'a> CowNaturalSort<'a> {
    #[inline(always)]
    pub fn new(s: Cow<'a, str>) -> Self {
        Self(s)
    }
}

impl Deref for CowNaturalSort<'_> {
    type Target = str;

    #[inline(always)]
    fn deref(&self) -> &Self::Target {
        &self.0
    }
}

impl PartialOrd for CowNaturalSort<'_> {
    #[inline(always)]
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl Ord for CowNaturalSort<'_> {
    #[inline(always)]
    fn cmp(&self, other: &Self) -> Ordering {
        natord::compare(&self.0, &other.0)
    }
}