cmporder 0.1.1

macros for prioritized Ord/PartialOrd
Documentation
  • Coverage
  • 0%
    0 out of 3 items documented0 out of 2 items with examples
  • Size
  • Source code size: 16.13 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 1.02 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 1m 14s Average build duration of successful builds.
  • all releases: 1m 2s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • acheul/cmporder-rs
    0 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • acheul

CmpOrder

Simple Macros to implement prioritized Ord/PartialOrd

Crates.io docs.rs

Examples

cmp_order!

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
struct ABC {
    a: u8,
    b: u8,
}

impl Ord for ABC {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        // priority:
        // 1) a
        // 2) b%2
        // 3) b
        cmp_order!(
            self.a.cmp(&other.a),
            (self.b % 2).cmp(&(other.b % 2)),
            self.b.cmp(&other.b),
        )
    }
}

impl PartialOrd for ABC {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}

let abc1 = ABC { a: 10, b: 20 };
let abc2 = ABC { a: 20, b: 10 };
let abc3 = ABC { a: 10, b: 11 };
let mut list = vec![abc1, abc2, abc3];

list.sort();
assert_eq!(list, vec![abc1, abc3, abc2]);

partial_cmp_order!

impl PartialOrd for ABC {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        // priority:
        // 1) a
        // 2) b%2
        // 3) b
        partial_cmp_order!(
            self.a.partial_cmp(&other.a),
            Some((self.b % 2).cmp(&(other.b % 2))),
            self.b.partial_cmp(&other.b)
        )
    }
}