honeycomb_core/geometry/dim2/vertex.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221
//! Custom spatial representation
//!
//! This module contains all code used to model vertices.
// ------ IMPORTS
use crate::prelude::{AttributeBind, AttributeUpdate, OrbitPolicy, Vector2, VertexIdType};
use crate::{attributes::AttrSparseVec, geometry::CoordsFloat};
// ------ CONTENT
/// 2D vertex representation
///
/// # Generics
///
/// - `T: CoordsFloat` -- Generic type for coordinates representation.
///
/// # Example
///
/// ```
/// # use honeycomb_core::prelude::CoordsError;
/// # fn main() -> Result<(), CoordsError> {
/// use honeycomb_core::prelude::{Vector2, Vertex2};
///
/// let v1 = Vertex2(1.0, 0.0);
/// let v2 = Vertex2(1.0, 1.0);
///
/// assert_eq!(v1.x(), 1.0);
/// assert_eq!(v1.y(), 0.0);
///
/// let two: f64 = 2.0;
/// // vectorAB = vertexB - vertexA
/// let v2_minus_v1: Vector2<f64> = v2 - v1;
///
/// assert_eq!(v2_minus_v1.norm(), 1.0);
/// assert_eq!(v2_minus_v1.unit_dir()?, Vector2::unit_y());
///
/// let mut v3 = Vertex2(0.0, 1.0);
/// // vertexA + vectorB = vertexA'
/// v3 += v2_minus_v1;
///
/// assert_eq!(v3.x(), 0.0);
/// assert_eq!(v3.y(), 2.0);
///
/// # Ok(())
/// # }
/// ```
///
#[derive(Debug, Clone, Copy, Default, PartialEq)]
pub struct Vertex2<T: CoordsFloat>(pub T, pub T);
unsafe impl<T: CoordsFloat> Send for Vertex2<T> {}
unsafe impl<T: CoordsFloat> Sync for Vertex2<T> {}
impl<T: CoordsFloat> Vertex2<T> {
/// Consume `self` to return inner value
///
/// # Return
///
/// Return coordinate values as a simple tuple.
///
pub fn into_inner(self) -> (T, T) {
(self.0, self.1)
}
/// Getter
///
/// # Return
///
/// Return the value of the `x` coordinate of the vertex.
///
pub fn x(&self) -> T {
self.0
}
/// Getter
///
/// # Return
///
/// Return the value of the `y` coordinate of the vertex.
///
pub fn y(&self) -> T {
self.1
}
/// Compute the mid-point between two vertices.
///
/// # Return
///
/// Return the mid-point as a new [Vertex2] object.
///
/// # Panics
///
/// This function may panic if it cannot initialize an object `T: CoordsFloat` from the value
/// `2.0`. The chance of this happening when using `T = f64` or `T = f32` is most likely zero.
///
/// # Example
///
/// ```rust
/// use honeycomb_core::prelude::Vertex2;
///
/// let far_far_away: Vertex2<f64> = Vertex2(2.0, 2.0);
/// let origin: Vertex2<f64> = Vertex2::default();
///
/// assert_eq!(Vertex2::average(&origin, &far_far_away), Vertex2(1.0, 1.0));
/// ```
pub fn average(lhs: &Vertex2<T>, rhs: &Vertex2<T>) -> Vertex2<T> {
let two = T::from(2.0).unwrap();
Vertex2((lhs.0 + rhs.0) / two, (lhs.1 + rhs.1) / two)
}
}
// Building trait
impl<T: CoordsFloat> From<(T, T)> for Vertex2<T> {
fn from((x, y): (T, T)) -> Self {
Self(x, y)
}
}
// Basic operations
// -- add flavors
impl<T: CoordsFloat> std::ops::Add<Vector2<T>> for Vertex2<T> {
// Vertex + Vector = Vertex
type Output = Self;
fn add(self, rhs: Vector2<T>) -> Self::Output {
Self(self.0 + rhs.0, self.1 + rhs.1)
}
}
impl<T: CoordsFloat> std::ops::AddAssign<Vector2<T>> for Vertex2<T> {
fn add_assign(&mut self, rhs: Vector2<T>) {
self.0 += rhs.0;
self.1 += rhs.1;
}
}
impl<T: CoordsFloat> std::ops::Add<&Vector2<T>> for Vertex2<T> {
// Vertex + Vector = Vertex
type Output = Self;
fn add(self, rhs: &Vector2<T>) -> Self::Output {
Self(self.0 + rhs.0, self.1 + rhs.1)
}
}
impl<T: CoordsFloat> std::ops::AddAssign<&Vector2<T>> for Vertex2<T> {
fn add_assign(&mut self, rhs: &Vector2<T>) {
self.0 += rhs.0;
self.1 += rhs.1;
}
}
// -- sub flavors
impl<T: CoordsFloat> std::ops::Sub<Vector2<T>> for Vertex2<T> {
// Vertex - Vector = Vertex
type Output = Self;
fn sub(self, rhs: Vector2<T>) -> Self::Output {
Self(self.0 - rhs.0, self.1 - rhs.1)
}
}
impl<T: CoordsFloat> std::ops::SubAssign<Vector2<T>> for Vertex2<T> {
fn sub_assign(&mut self, rhs: Vector2<T>) {
self.0 -= rhs.0;
self.1 -= rhs.1;
}
}
impl<T: CoordsFloat> std::ops::Sub<&Vector2<T>> for Vertex2<T> {
// Vertex - Vector = Vertex
type Output = Self;
fn sub(self, rhs: &Vector2<T>) -> Self::Output {
Self(self.0 - rhs.0, self.1 - rhs.1)
}
}
impl<T: CoordsFloat> std::ops::SubAssign<&Vector2<T>> for Vertex2<T> {
fn sub_assign(&mut self, rhs: &Vector2<T>) {
self.0 -= rhs.0;
self.1 -= rhs.1;
}
}
impl<T: CoordsFloat> std::ops::Sub<Vertex2<T>> for Vertex2<T> {
type Output = Vector2<T>;
fn sub(self, rhs: Vertex2<T>) -> Self::Output {
Vector2(self.0 - rhs.0, self.1 - rhs.1)
}
}
/// Attribute logic definitions
///
/// - **MERGING POLICY** - The new vertex is placed at the midpoint between the two existing ones.
/// - **SPLITTING POLICY** - The current vertex is duplicated.
/// - **(PARTIALLY) UNDEFINED ATTRIBUTES MERGING** - The default implementations are used.
impl<T: CoordsFloat> AttributeUpdate for Vertex2<T> {
fn merge(attr1: Self, attr2: Self) -> Self {
Self::average(&attr1, &attr2)
}
fn split(attr: Self) -> (Self, Self) {
(attr, attr)
}
}
/// Attribute support definitions
///
/// - **BINDS TO 0-CELLS**
impl<T: CoordsFloat> AttributeBind for Vertex2<T> {
type StorageType = AttrSparseVec<Self>;
type IdentifierType = VertexIdType;
const BIND_POLICY: OrbitPolicy = OrbitPolicy::Vertex;
}