✨ Implement partial ordering for the intervals

eigenein · Jul 29, 2022 · 9758eff · 9758eff
1 parent 9951fb6
commit 9758eff
Show file tree

Hide file tree

Showing 2 changed files with 45 additions and 0 deletions.
diff --git a/src/interval/lower_upper.rs b/src/interval/lower_upper.rs
@@ -1,3 +1,4 @@
+use std::cmp::Ordering;
 use std::ops::{Add, Div, Mul, Sub};
 
 use num_traits::One;
@@ -80,3 +81,23 @@ where
         }
     }
 }
+
+impl<T> PartialEq for LowerUpperInterval<T> {
+    #[must_use]
+    fn eq(&self, _other: &Self) -> bool {
+        false
+    }
+}
+
+impl<T: PartialOrd> PartialOrd for LowerUpperInterval<T> {
+    #[must_use]
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        if self.upper < other.lower {
+            Some(Ordering::Less)
+        } else if self.lower > other.upper {
+            Some(Ordering::Greater)
+        } else {
+            None
+        }
+    }
+}
diff --git a/src/interval/mean_margin.rs b/src/interval/mean_margin.rs
@@ -1,3 +1,4 @@
+use std::cmp::Ordering;
 use std::ops::{Add, Div, Mul, Sub};
 
 use num_traits::One;
@@ -78,3 +79,26 @@ where
         }
     }
 }
+
+impl<T> PartialEq for MeanMarginInterval<T> {
+    #[must_use]
+    fn eq(&self, _other: &Self) -> bool {
+        false
+    }
+}
+
+impl<T> PartialOrd for MeanMarginInterval<T>
+where
+    T: Copy + Sub<Output = T> + Add<Output = T> + PartialOrd,
+{
+    #[must_use]
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        if self.upper() < other.lower() {
+            Some(Ordering::Less)
+        } else if self.lower() > other.upper() {
+            Some(Ordering::Greater)
+        } else {
+            None
+        }
+    }
+}