nalgebra/src/geometry/point_construction.rs

246 lines
7.4 KiB
Rust
Raw Normal View History

#[cfg(feature = "arbitrary")]
use quickcheck::{Arbitrary, Gen};
2018-02-02 19:26:35 +08:00
use num::{Bounded, One, Zero};
2021-03-02 19:25:12 +08:00
#[cfg(feature = "rand-no-std")]
use rand::{
distributions::{Distribution, Standard},
Rng,
};
2019-03-23 21:29:07 +08:00
use crate::base::allocator::Allocator;
use crate::base::dimension::{DimNameAdd, DimNameSum, U1};
use crate::base::{CVectorN, DefaultAllocator, Scalar};
use crate::{
2021-04-06 16:53:11 +08:00
Const, Point1, Point2, Point3, Point4, Point5, Point6, Vector1, Vector2, Vector3, Vector4,
Vector5, Vector6, VectorN,
};
use simba::scalar::{ClosedDiv, SupersetOf};
2019-03-23 21:29:07 +08:00
use crate::geometry::Point;
/// # Other construction methods
impl<N: Scalar, const D: usize> Point<N, D>
// where
// DefaultAllocator: Allocator<N, D>,
2018-02-02 19:26:35 +08:00
{
/// Creates a new point with uninitialized coordinates.
#[inline]
pub unsafe fn new_uninitialized() -> Self {
2020-11-28 05:00:48 +08:00
Self::from(crate::unimplemented_or_uninitialized_generic!(
Const::<D>, Const::<1>
2020-11-28 05:00:48 +08:00
))
}
/// Creates a new point with all coordinates equal to zero.
2018-10-24 03:59:10 +08:00
///
/// # Example
///
/// ```
/// # use nalgebra::{Point2, Point3};
/// // This works in any dimension.
2019-03-23 21:29:07 +08:00
/// // The explicit crate::<f32> type annotation may not always be needed,
2018-10-24 03:59:10 +08:00
/// // depending on the context of type inference.
/// let pt = Point2::<f32>::origin();
/// assert!(pt.x == 0.0 && pt.y == 0.0);
///
/// let pt = Point3::<f32>::origin();
/// assert!(pt.x == 0.0 && pt.y == 0.0 && pt.z == 0.0);
/// ```
#[inline]
pub fn origin() -> Self
2020-04-06 00:49:48 +08:00
where
N: Zero,
{
Self::from(CVectorN::from_element(N::zero()))
}
2018-10-13 16:45:42 +08:00
/// Creates a new point from a slice.
2018-10-24 03:59:10 +08:00
///
/// # Example
///
/// ```
/// # use nalgebra::{Point2, Point3};
/// let data = [ 1.0, 2.0, 3.0 ];
///
/// let pt = Point2::from_slice(&data[..2]);
/// assert_eq!(pt, Point2::new(1.0, 2.0));
///
/// let pt = Point3::from_slice(&data);
/// assert_eq!(pt, Point3::new(1.0, 2.0, 3.0));
/// ```
2018-10-13 16:45:42 +08:00
#[inline]
pub fn from_slice(components: &[N]) -> Self {
Self::from(CVectorN::from_row_slice(components))
2018-10-13 16:45:42 +08:00
}
/// Creates a new point from its homogeneous vector representation.
///
/// In practice, this builds a D-dimensional points with the same first D component as `v`
/// divided by the last component of `v`. Returns `None` if this divisor is zero.
2018-10-24 03:59:10 +08:00
///
/// # Example
///
/// ```
/// # use nalgebra::{Point2, Point3, Vector3, Vector4};
///
/// let coords = Vector4::new(1.0, 2.0, 3.0, 1.0);
/// let pt = Point3::from_homogeneous(coords);
/// assert_eq!(pt, Some(Point3::new(1.0, 2.0, 3.0)));
///
/// // All component of the result will be divided by the
/// // last component of the vector, here 2.0.
2018-10-24 03:59:10 +08:00
/// let coords = Vector4::new(1.0, 2.0, 3.0, 2.0);
/// let pt = Point3::from_homogeneous(coords);
/// assert_eq!(pt, Some(Point3::new(0.5, 1.0, 1.5)));
///
/// // Fails because the last component is zero.
/// let coords = Vector4::new(1.0, 2.0, 3.0, 0.0);
/// let pt = Point3::from_homogeneous(coords);
/// assert!(pt.is_none());
///
/// // Works also in other dimensions.
/// let coords = Vector3::new(1.0, 2.0, 1.0);
/// let pt = Point2::from_homogeneous(coords);
/// assert_eq!(pt, Some(Point2::new(1.0, 2.0)));
/// ```
#[inline]
pub fn from_homogeneous(v: VectorN<N, DimNameSum<Const<D>, U1>>) -> Option<Self>
2018-02-02 19:26:35 +08:00
where
N: Scalar + Zero + One + ClosedDiv,
Const<D>: DimNameAdd<U1>,
DefaultAllocator: Allocator<N, DimNameSum<Const<D>, U1>>,
2018-02-02 19:26:35 +08:00
{
if !v[D].is_zero() {
let coords = v.fixed_slice::<Const<D>, U1>(0, 0) / v[D].inlined_clone();
2018-10-24 02:47:42 +08:00
Some(Self::from(coords))
2018-02-02 19:26:35 +08:00
} else {
None
}
}
/// Cast the components of `self` to another type.
///
/// # Example
/// ```
/// # use nalgebra::Point2;
/// let pt = Point2::new(1.0f64, 2.0);
/// let pt2 = pt.cast::<f32>();
/// assert_eq!(pt2, Point2::new(1.0f32, 2.0));
/// ```
pub fn cast<To: Scalar>(self) -> Point<To, D>
where
Point<To, D>: SupersetOf<Self>,
{
crate::convert(self)
}
}
/*
*
2018-09-24 12:48:42 +08:00
* Traits that build points.
*
*/
impl<N: Scalar + Bounded, const D: usize> Bounded for Point<N, D>
// where
// DefaultAllocator: Allocator<N, D>,
2018-02-02 19:26:35 +08:00
{
#[inline]
fn max_value() -> Self {
Self::from(CVectorN::max_value())
}
#[inline]
fn min_value() -> Self {
Self::from(CVectorN::min_value())
}
}
2021-03-02 19:25:12 +08:00
#[cfg(feature = "rand-no-std")]
impl<N: Scalar, const D: usize> Distribution<Point<N, D>> for Standard
2018-02-02 19:26:35 +08:00
where
2018-05-23 05:58:14 +08:00
Standard: Distribution<N>,
2018-02-02 19:26:35 +08:00
{
/// Generate a `Point` where each coordinate is an independent variate from `[0, 1)`.
#[inline]
2018-05-23 05:58:14 +08:00
fn sample<'a, G: Rng + ?Sized>(&self, rng: &mut G) -> Point<N, D> {
Point::from(rng.gen::<CVectorN<N, D>>())
}
}
2018-02-02 19:26:35 +08:00
#[cfg(feature = "arbitrary")]
impl<N: Scalar + Arbitrary + Send, const D: usize> Arbitrary for Point<N, D>
2018-02-02 19:26:35 +08:00
where
<DefaultAllocator as Allocator<N, Const<D>>>::Buffer: Send,
2018-02-02 19:26:35 +08:00
{
#[inline]
2021-03-01 00:52:14 +08:00
fn arbitrary(g: &mut Gen) -> Self {
Self::from(CVectorN::arbitrary(g))
}
}
/*
*
* Small points construction from components.
*
*/
// NOTE: the impl for Point1 is not with the others so that we
// can add a section with the impl block comment.
/// # Construction from individual components
impl<N: Scalar> Point1<N> {
/// Initializes this point from its components.
///
/// # Example
///
/// ```
/// # use nalgebra::Point1;
/// let p = Point1::new(1.0);
/// assert_eq!(p.x, 1.0);
/// ```
#[inline]
pub fn new(x: N) -> Self {
Vector1::new(x).into()
}
}
macro_rules! componentwise_constructors_impl(
($($doc: expr; $Point: ident, $Vector: ident, $($args: ident:$irow: expr),*);* $(;)*) => {$(
impl<N: Scalar> $Point<N> {
#[doc = "Initializes this point from its components."]
#[doc = "# Example\n```"]
#[doc = $doc]
#[doc = "```"]
#[inline]
pub fn new($($args: N),*) -> Self {
$Vector::new($($args),*).into()
}
}
)*}
);
componentwise_constructors_impl!(
"# use nalgebra::Point2;\nlet p = Point2::new(1.0, 2.0);\nassert!(p.x == 1.0 && p.y == 2.0);";
Point2, Vector2, x:0, y:1;
"# use nalgebra::Point3;\nlet p = Point3::new(1.0, 2.0, 3.0);\nassert!(p.x == 1.0 && p.y == 2.0 && p.z == 3.0);";
Point3, Vector3, x:0, y:1, z:2;
"# use nalgebra::Point4;\nlet p = Point4::new(1.0, 2.0, 3.0, 4.0);\nassert!(p.x == 1.0 && p.y == 2.0 && p.z == 3.0 && p.w == 4.0);";
Point4, Vector4, x:0, y:1, z:2, w:3;
"# use nalgebra::Point5;\nlet p = Point5::new(1.0, 2.0, 3.0, 4.0, 5.0);\nassert!(p.x == 1.0 && p.y == 2.0 && p.z == 3.0 && p.w == 4.0 && p.a == 5.0);";
Point5, Vector5, x:0, y:1, z:2, w:3, a:4;
"# use nalgebra::Point6;\nlet p = Point6::new(1.0, 2.0, 3.0, 4.0, 5.0, 6.0);\nassert!(p.x == 1.0 && p.y == 2.0 && p.z == 3.0 && p.w == 4.0 && p.a == 5.0 && p.b == 6.0);";
Point6, Vector6, x:0, y:1, z:2, w:3, a:4, b:5;
);
2018-04-01 03:42:22 +08:00
macro_rules! from_array_impl(
($($Point: ident, $len: expr);*) => {$(
impl <N: Scalar> From<[N; $len]> for $Point<N> {
fn from(coords: [N; $len]) -> Self {
Self {
2018-10-24 02:47:42 +08:00
coords: coords.into()
}
2018-04-01 03:42:22 +08:00
}
}
)*}
);
from_array_impl!(Point1, 1; Point2, 2; Point3, 3; Point4, 4; Point5, 5; Point6, 6);