Manually implement ordering

---

• In rare case we might want to have an ordering that is not the same as the default implementation of PartialOrd. In these cases we can implement it ourselves.
• For this we need to implement both PartialEq and PartialOrd.
• In our case the functions only take into account the height field.
• the #[allow(dead_code)] is only needed in this example because we never access the id and name fields.

examples/struct/implement-ordering/src/main.rs

use std::cmp::Ordering;

#[allow(dead_code)]
struct Person {
    id: u32,
    name: String,
    height: u32,
}

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

impl PartialEq for Person {
    fn eq(&self, other: &Self) -> bool {
        self.height == other.height
    }
}

fn main() {
    let a = Person {
        id: 1,
        name: "Foo".to_string(),
        height: 160,
    };

    let b = Person {
        id: 1,
        name: "Foo".to_string(),
        height: 180,
    };

    let c = Person {
        id: 1,
        name: "Foo".to_string(),
        height: 160,
    };

    let x = Person {
        id: 2,
        name: "Bar".to_string(),
        height: 180,
    };


    println!("{}", a < b);
    println!("{}", a == c);
    println!("{}", b == x);
}

true
true
true