use num::{One, Zero}; use simba::scalar::{ClosedDiv, SubsetOf, SupersetOf}; use simba::simd::PrimitiveSimdValue; use crate::base::allocator::Allocator; use crate::base::dimension::{DimNameAdd, DimNameSum, U1}; use crate::base::{Const, DefaultAllocator, Matrix, Scalar, VectorN}; use crate::geometry::Point; /* * This file provides the following conversions: * ============================================= * * Point -> Point * Point -> Vector (homogeneous) */ impl SubsetOf> for Point where N1: Scalar, N2: Scalar + SupersetOf, // DefaultAllocator: Allocator + Allocator, { #[inline] fn to_superset(&self) -> Point { Point::from(self.coords.to_superset()) } #[inline] fn is_in_subset(m: &Point) -> bool { // TODO: is there a way to reuse the `.is_in_subset` from the matrix implementation of // SubsetOf? m.iter().all(|e| e.is_in_subset()) } #[inline] fn from_superset_unchecked(m: &Point) -> Self { Self::from(Matrix::from_superset_unchecked(&m.coords)) } } impl SubsetOf, U1>>> for Point where Const: DimNameAdd, N1: Scalar, N2: Scalar + Zero + One + ClosedDiv + SupersetOf, DefaultAllocator: Allocator, U1>> + Allocator, U1>>, // + Allocator // + Allocator, { #[inline] fn to_superset(&self) -> VectorN, U1>> { let p: Point = self.to_superset(); p.to_homogeneous() } #[inline] fn is_in_subset(v: &VectorN, U1>>) -> bool { crate::is_convertible::<_, VectorN>>(v) && !v[D].is_zero() } #[inline] fn from_superset_unchecked(v: &VectorN, U1>>) -> Self { let coords = v.fixed_slice::(0, 0) / v[D].inlined_clone(); Self { coords: crate::convert_unchecked(coords), } } } impl From> for VectorN, U1>> where Const: DimNameAdd, DefaultAllocator: Allocator, U1>>, { #[inline] fn from(t: Point) -> Self { t.to_homogeneous() } } impl From>> for Point // where // DefaultAllocator: Allocator, { #[inline] fn from(coords: VectorN>) -> Self { Point { coords } } } impl From<[Point; 2]> for Point where N: From<[::Element; 2]>, N::Element: Scalar + Copy, // DefaultAllocator: Allocator + Allocator, >>::Buffer: Copy, { #[inline] fn from(arr: [Point; 2]) -> Self { Self::from(VectorN::from([arr[0].coords, arr[1].coords])) } } impl From<[Point; 4]> for Point where N: From<[::Element; 4]>, N::Element: Scalar + Copy, // DefaultAllocator: Allocator + Allocator, >>::Buffer: Copy, { #[inline] fn from(arr: [Point; 4]) -> Self { Self::from(VectorN::from([ arr[0].coords, arr[1].coords, arr[2].coords, arr[3].coords, ])) } } impl From<[Point; 8]> for Point where N: From<[::Element; 8]>, N::Element: Scalar + Copy, // DefaultAllocator: Allocator + Allocator, >>::Buffer: Copy, { #[inline] fn from(arr: [Point; 8]) -> Self { Self::from(VectorN::from([ arr[0].coords, arr[1].coords, arr[2].coords, arr[3].coords, arr[4].coords, arr[5].coords, arr[6].coords, arr[7].coords, ])) } } impl From<[Point; 16]> for Point where N: From<[::Element; 16]>, N::Element: Scalar + Copy, // DefaultAllocator: Allocator + Allocator, >>::Buffer: Copy, { #[inline] fn from(arr: [Point; 16]) -> Self { Self::from(VectorN::from([ arr[0].coords, arr[1].coords, arr[2].coords, arr[3].coords, arr[4].coords, arr[5].coords, arr[6].coords, arr[7].coords, arr[8].coords, arr[9].coords, arr[10].coords, arr[11].coords, arr[12].coords, arr[13].coords, arr[14].coords, arr[15].coords, ])) } }