Merge pull request #283 from hannobraun/derive

Derive some more useful traits for various types

src/kernel/geometry/curves/circle.rs

@@ -3,7 +3,7 @@ use std::f64::consts::PI;
 use crate::math::{Point, Scalar, Transform, Vector};
 
 /// A circle
-#[derive(Clone, Copy, Debug, PartialEq)]
+#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub struct Circle {
     /// The center point of the circle
     pub center: Point<3>,

src/kernel/geometry/curves/line.rs

@@ -1,7 +1,7 @@
 use crate::math::{Point, Transform, Vector};
 
 /// A line, defined by a point and a vector
-#[derive(Clone, Copy, Debug, PartialEq)]
+#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub struct Line {
     /// The origin of the line's coordinate system
     pub origin: Point<3>,

src/kernel/geometry/curves/mod.rs

@@ -14,7 +14,7 @@ pub use self::{circle::Circle, line::Line};
 /// The nomenclature is inspired by Boundary Representation Modelling Techniques
 /// by Ian Stroud. "Curve" refers to unbounded one-dimensional geometry, while
 /// while edges are bounded portions of curves.
-#[derive(Clone, Debug, PartialEq)]
+#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub enum Curve {
     /// A circle
     Circle(Circle),

src/kernel/geometry/surfaces/mod.rs

@@ -12,7 +12,7 @@ use crate::{
 use super::{Curve, Line};
 
 /// A two-dimensional shape
-#[derive(Clone, Debug, PartialEq)]
+#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub enum Surface {
     /// A swept curve
     Swept(Swept),

src/kernel/geometry/surfaces/swept.rs

@@ -4,7 +4,7 @@ use crate::{
 };
 
 /// A surface that was swept from a curve
-#[derive(Clone, Debug, PartialEq)]
+#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub struct Swept {
     /// The curve that this surface was swept from
     pub curve: Curve,

src/kernel/topology/edges.rs

@@ -6,7 +6,7 @@ use crate::{
 use super::vertices::Vertex;
 
 /// The edges of a shape
-#[derive(Clone)]
+#[derive(Clone, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub struct Edges {
     /// The cycles that the edges of the shape form
     ///
@@ -34,13 +34,13 @@ impl Edges {
 /// The end of each edge in the cycle must connect to the beginning of the next
 /// edge. The end of the last edge must connect to the beginning of the first
 /// one.
-#[derive(Clone)]
+#[derive(Clone, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub struct Cycle {
     pub edges: Vec<Edge>,
 }
 
 /// An edge of a shape
-#[derive(Clone, Debug)]
+#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub struct Edge {
     /// The curve that defines the edge's geometry
     ///

src/kernel/topology/faces.rs

@@ -17,7 +17,7 @@ use crate::{
 use super::edges::Edges;
 
 /// The faces of a shape
-#[derive(Clone)]
+#[derive(Clone, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub struct Faces(pub Vec<Face>);
 
 impl Faces {
@@ -34,7 +34,7 @@ impl Faces {
 }
 
 /// A face of a shape
-#[derive(Clone)]
+#[derive(Clone, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub enum Face {
     /// A face of a shape
     ///