#sorting #version #gnu #algorithm

vsort

GNU Version Sort Rust implementation

2 unstable releases

0.2.0 Aug 4, 2023
0.1.0 Jun 30, 2023

#1414 in Algorithms

Download history 628/week @ 2024-04-08 736/week @ 2024-04-15 759/week @ 2024-04-22 711/week @ 2024-04-29 523/week @ 2024-05-06 536/week @ 2024-05-13 466/week @ 2024-05-20 483/week @ 2024-05-27 478/week @ 2024-06-03 510/week @ 2024-06-10 635/week @ 2024-06-17 412/week @ 2024-06-24 445/week @ 2024-07-01 408/week @ 2024-07-08 392/week @ 2024-07-15 499/week @ 2024-07-22

1,797 downloads per month
Used in lsd

MIT license

22KB
385 lines

TESTS License: MIT Latest version

vsort

A Rust library that implements the GNU version sort algorithm. It follows the spec given here.

Installation

cargo add vsort

Why vsort?

Other version sort implementations don't match the GNU spec, and some were missing tests. The goal is to match the behavior of the core utils implementation as close as possible. If you notice any discrepancies please open an issue.

Why not FFI?

FFI is probably your best bet if you need absolute parity with GNU version sort. In the case you want their algorithm in Rust here it is :)

Usage:

use vsort::{compare, sort};

fn main() {
    let mut file_names = vec![
        "a.txt",
        "b 1.txt",
        "b 10.txt",
        "b 11.txt",
        "b 5.txt",
        "Ssm.txt",
    ];

    // Pass to sort_by
    file_names.sort_by(|a, b| compare(a, b));
    assert_eq!(
        file_names,
        vec!["Ssm.txt", "a.txt", "b 1.txt", "b 5.txt", "b 10.txt", "b 11.txt"]
    );

    let mut file_names = vec![
        "a.txt",
        "b 1.txt",
        "b 10.txt",
        "b 11.txt",
        "b 5.txt",
        "Ssm.txt",
    ];
    // Alternatively
    sort(&mut file_names);
    assert_eq!(
        file_names,
        vec!["Ssm.txt", "a.txt", "b 1.txt", "b 5.txt", "b 10.txt", "b 11.txt"]
    );
}

No runtime deps