2018-05-19 21:41:58 +08:00
|
|
|
|
use approx::{AbsDiffEq, RelativeEq, UlpsEq};
|
2016-12-05 05:44:42 +08:00
|
|
|
|
use std::fmt;
|
2017-08-03 01:37:44 +08:00
|
|
|
|
use std::hash;
|
2018-07-20 21:25:55 +08:00
|
|
|
|
#[cfg(feature = "abomonation-serialize")]
|
|
|
|
|
use std::io::{Result as IOResult, Write};
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
#[cfg(feature = "serde-serialize")]
|
2018-10-22 13:00:10 +08:00
|
|
|
|
use serde::{Deserialize, Serialize};
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
2017-08-14 20:32:02 +08:00
|
|
|
|
#[cfg(feature = "abomonation-serialize")]
|
|
|
|
|
use abomonation::Abomonation;
|
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
use alga::general::{Real, SubsetOf};
|
2016-12-05 05:44:42 +08:00
|
|
|
|
use alga::linear::Rotation;
|
|
|
|
|
|
2018-05-19 23:15:15 +08:00
|
|
|
|
use base::allocator::Allocator;
|
|
|
|
|
use base::dimension::{DimName, DimNameAdd, DimNameSum, U1};
|
|
|
|
|
use base::storage::Owned;
|
2019-02-25 00:29:27 +08:00
|
|
|
|
use base::{DefaultAllocator, MatrixN, VectorN};
|
2018-02-02 19:26:35 +08:00
|
|
|
|
use geometry::{Isometry, Point, Translation};
|
2017-02-13 01:17:09 +08:00
|
|
|
|
|
2016-12-05 05:44:42 +08:00
|
|
|
|
/// A similarity, i.e., an uniform scaling, followed by a rotation, followed by a translation.
|
|
|
|
|
#[repr(C)]
|
2017-08-03 01:37:44 +08:00
|
|
|
|
#[derive(Debug)]
|
2017-02-16 05:04:34 +08:00
|
|
|
|
#[cfg_attr(feature = "serde-serialize", derive(Serialize, Deserialize))]
|
2018-05-19 21:41:58 +08:00
|
|
|
|
#[cfg_attr(
|
|
|
|
|
feature = "serde-serialize",
|
2018-10-22 13:00:10 +08:00
|
|
|
|
serde(bound(
|
|
|
|
|
serialize = "N: Serialize,
|
2018-09-13 12:55:58 +08:00
|
|
|
|
R: Serialize,
|
2017-08-03 01:37:44 +08:00
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
2018-09-13 12:55:58 +08:00
|
|
|
|
Owned<N, D>: Serialize"
|
2018-10-22 13:00:10 +08:00
|
|
|
|
))
|
2018-05-19 21:41:58 +08:00
|
|
|
|
)]
|
|
|
|
|
#[cfg_attr(
|
|
|
|
|
feature = "serde-serialize",
|
2018-10-22 13:00:10 +08:00
|
|
|
|
serde(bound(
|
|
|
|
|
deserialize = "N: Deserialize<'de>,
|
2018-09-13 12:55:58 +08:00
|
|
|
|
R: Deserialize<'de>,
|
2017-08-03 01:37:44 +08:00
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
2018-09-13 12:55:58 +08:00
|
|
|
|
Owned<N, D>: Deserialize<'de>"
|
2018-10-22 13:00:10 +08:00
|
|
|
|
))
|
2018-05-19 21:41:58 +08:00
|
|
|
|
)]
|
2017-08-03 01:37:44 +08:00
|
|
|
|
pub struct Similarity<N: Real, D: DimName, R>
|
2018-10-22 13:00:10 +08:00
|
|
|
|
where DefaultAllocator: Allocator<N, D>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
{
|
2017-02-13 01:17:09 +08:00
|
|
|
|
/// The part of this similarity that does not include the scaling factor.
|
2017-08-03 01:37:44 +08:00
|
|
|
|
pub isometry: Isometry<N, D, R>,
|
2018-02-02 19:26:35 +08:00
|
|
|
|
scaling: N,
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
2017-08-14 20:32:02 +08:00
|
|
|
|
#[cfg(feature = "abomonation-serialize")]
|
2017-08-16 01:36:38 +08:00
|
|
|
|
impl<N: Real, D: DimName, R> Abomonation for Similarity<N, D, R>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
Isometry<N, D, R>: Abomonation,
|
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
2017-08-14 20:32:02 +08:00
|
|
|
|
{
|
2018-07-20 21:25:55 +08:00
|
|
|
|
unsafe fn entomb<W: Write>(&self, writer: &mut W) -> IOResult<()> {
|
2017-08-14 20:32:02 +08:00
|
|
|
|
self.isometry.entomb(writer)
|
|
|
|
|
}
|
|
|
|
|
|
2018-07-20 21:25:55 +08:00
|
|
|
|
fn extent(&self) -> usize {
|
|
|
|
|
self.isometry.extent()
|
2017-08-14 20:32:02 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsafe fn exhume<'a, 'b>(&'a mut self, bytes: &'b mut [u8]) -> Option<&'b mut [u8]> {
|
|
|
|
|
self.isometry.exhume(bytes)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-02 19:26:35 +08:00
|
|
|
|
impl<N: Real + hash::Hash, D: DimName + hash::Hash, R: hash::Hash> hash::Hash
|
|
|
|
|
for Similarity<N, D, R>
|
|
|
|
|
where
|
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
|
|
|
|
Owned<N, D>: hash::Hash,
|
|
|
|
|
{
|
2017-08-03 01:37:44 +08:00
|
|
|
|
fn hash<H: hash::Hasher>(&self, state: &mut H) {
|
|
|
|
|
self.isometry.hash(state);
|
|
|
|
|
self.scaling.hash(state);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<N: Real, D: DimName + Copy, R: Rotation<Point<N, D>> + Copy> Copy for Similarity<N, D, R>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
|
|
|
|
Owned<N, D>: Copy,
|
2018-10-22 13:00:10 +08:00
|
|
|
|
{}
|
2017-08-03 01:37:44 +08:00
|
|
|
|
|
|
|
|
|
impl<N: Real, D: DimName, R: Rotation<Point<N, D>> + Clone> Clone for Similarity<N, D, R>
|
2018-10-22 13:00:10 +08:00
|
|
|
|
where DefaultAllocator: Allocator<N, D>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
{
|
2017-08-03 01:37:44 +08:00
|
|
|
|
#[inline]
|
|
|
|
|
fn clone(&self) -> Self {
|
|
|
|
|
Similarity::from_isometry(self.isometry.clone(), self.scaling)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<N: Real, D: DimName, R> Similarity<N, D, R>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
R: Rotation<Point<N, D>>,
|
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
|
|
|
|
{
|
2016-12-05 05:44:42 +08:00
|
|
|
|
/// Creates a new similarity from its rotational and translational parts.
|
|
|
|
|
#[inline]
|
2018-02-02 19:26:35 +08:00
|
|
|
|
pub fn from_parts(
|
|
|
|
|
translation: Translation<N, D>,
|
|
|
|
|
rotation: R,
|
|
|
|
|
scaling: N,
|
2018-10-22 13:00:10 +08:00
|
|
|
|
) -> Similarity<N, D, R>
|
|
|
|
|
{
|
2017-08-03 01:37:44 +08:00
|
|
|
|
Similarity::from_isometry(Isometry::from_parts(translation, rotation), scaling)
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Creates a new similarity from its rotational and translational parts.
|
|
|
|
|
#[inline]
|
2017-08-03 01:37:44 +08:00
|
|
|
|
pub fn from_isometry(isometry: Isometry<N, D, R>, scaling: N) -> Similarity<N, D, R> {
|
2018-02-02 19:26:35 +08:00
|
|
|
|
assert!(
|
|
|
|
|
!relative_eq!(scaling, N::zero()),
|
|
|
|
|
"The scaling factor must not be zero."
|
|
|
|
|
);
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
Similarity {
|
2016-12-05 05:44:42 +08:00
|
|
|
|
isometry: isometry,
|
2018-02-02 19:26:35 +08:00
|
|
|
|
scaling: scaling,
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Creates a new similarity that applies only a scaling factor.
|
|
|
|
|
#[inline]
|
2017-08-03 01:37:44 +08:00
|
|
|
|
pub fn from_scaling(scaling: N) -> Similarity<N, D, R> {
|
|
|
|
|
Self::from_isometry(Isometry::identity(), scaling)
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Inverts `self`.
|
|
|
|
|
#[inline]
|
2017-08-03 01:37:44 +08:00
|
|
|
|
pub fn inverse(&self) -> Similarity<N, D, R> {
|
2016-12-05 05:44:42 +08:00
|
|
|
|
let mut res = self.clone();
|
|
|
|
|
res.inverse_mut();
|
|
|
|
|
res
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Inverts `self` in-place.
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn inverse_mut(&mut self) {
|
|
|
|
|
self.scaling = N::one() / self.scaling;
|
|
|
|
|
self.isometry.inverse_mut();
|
|
|
|
|
self.isometry.translation.vector *= self.scaling;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// The scaling factor of this similarity transformation.
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn set_scaling(&mut self, scaling: N) {
|
2018-02-02 19:26:35 +08:00
|
|
|
|
assert!(
|
|
|
|
|
!relative_eq!(scaling, N::zero()),
|
|
|
|
|
"The similarity scaling factor must not be zero."
|
|
|
|
|
);
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
|
|
|
|
self.scaling = scaling;
|
|
|
|
|
}
|
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
/// The scaling factor of this similarity transformation.
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn scaling(&self) -> N {
|
|
|
|
|
self.scaling
|
|
|
|
|
}
|
|
|
|
|
|
2016-12-05 05:44:42 +08:00
|
|
|
|
/// The similarity transformation that applies a scaling factor `scaling` before `self`.
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn prepend_scaling(&self, scaling: N) -> Self {
|
2018-02-02 19:26:35 +08:00
|
|
|
|
assert!(
|
|
|
|
|
!relative_eq!(scaling, N::zero()),
|
|
|
|
|
"The similarity scaling factor must not be zero."
|
|
|
|
|
);
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
|
|
|
|
Self::from_isometry(self.isometry.clone(), self.scaling * scaling)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// The similarity transformation that applies a scaling factor `scaling` after `self`.
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn append_scaling(&self, scaling: N) -> Self {
|
2018-02-02 19:26:35 +08:00
|
|
|
|
assert!(
|
|
|
|
|
!relative_eq!(scaling, N::zero()),
|
|
|
|
|
"The similarity scaling factor must not be zero."
|
|
|
|
|
);
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
|
|
|
|
Self::from_parts(
|
2018-10-28 14:33:39 +08:00
|
|
|
|
Translation::from(&self.isometry.translation.vector * scaling),
|
2016-12-05 05:44:42 +08:00
|
|
|
|
self.isometry.rotation.clone(),
|
2018-02-02 19:26:35 +08:00
|
|
|
|
self.scaling * scaling,
|
|
|
|
|
)
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Sets `self` to the similarity transformation that applies a scaling factor `scaling` before `self`.
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn prepend_scaling_mut(&mut self, scaling: N) {
|
2018-02-02 19:26:35 +08:00
|
|
|
|
assert!(
|
|
|
|
|
!relative_eq!(scaling, N::zero()),
|
|
|
|
|
"The similarity scaling factor must not be zero."
|
|
|
|
|
);
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
|
|
|
|
self.scaling *= scaling
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Sets `self` to the similarity transformation that applies a scaling factor `scaling` after `self`.
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn append_scaling_mut(&mut self, scaling: N) {
|
2018-02-02 19:26:35 +08:00
|
|
|
|
assert!(
|
|
|
|
|
!relative_eq!(scaling, N::zero()),
|
|
|
|
|
"The similarity scaling factor must not be zero."
|
|
|
|
|
);
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
|
|
|
|
self.isometry.translation.vector *= scaling;
|
|
|
|
|
self.scaling *= scaling;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Appends to `self` the given translation in-place.
|
|
|
|
|
#[inline]
|
2017-08-03 01:37:44 +08:00
|
|
|
|
pub fn append_translation_mut(&mut self, t: &Translation<N, D>) {
|
2016-12-05 05:44:42 +08:00
|
|
|
|
self.isometry.append_translation_mut(t)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Appends to `self` the given rotation in-place.
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn append_rotation_mut(&mut self, r: &R) {
|
|
|
|
|
self.isometry.append_rotation_mut(r)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Appends in-place to `self` a rotation centered at the point `p`, i.e., the rotation that
|
|
|
|
|
/// lets `p` invariant.
|
|
|
|
|
#[inline]
|
2017-08-03 01:37:44 +08:00
|
|
|
|
pub fn append_rotation_wrt_point_mut(&mut self, r: &R, p: &Point<N, D>) {
|
2016-12-05 05:44:42 +08:00
|
|
|
|
self.isometry.append_rotation_wrt_point_mut(r, p)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Appends in-place to `self` a rotation centered at the point with coordinates
|
|
|
|
|
/// `self.translation`.
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn append_rotation_wrt_center_mut(&mut self, r: &R) {
|
|
|
|
|
self.isometry.append_rotation_wrt_center_mut(r)
|
|
|
|
|
}
|
2019-02-25 00:29:27 +08:00
|
|
|
|
|
|
|
|
|
/// Transform the given point by this similarity.
|
|
|
|
|
///
|
|
|
|
|
/// # Example
|
|
|
|
|
/// ```
|
|
|
|
|
/// # #[macro_use] extern crate approx;
|
|
|
|
|
/// # use std::f32;
|
|
|
|
|
/// # use nalgebra::{Point3, Similarity3, Vector3};
|
|
|
|
|
/// let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
|
|
|
|
|
/// let translation = Vector3::new(1.0, 2.0, 3.0);
|
|
|
|
|
/// let sim = Similarity3::new(translation, axisangle, 3.0);
|
|
|
|
|
/// let transformed_point = sim.transform_point(&Point3::new(4.0, 5.0, 6.0));
|
|
|
|
|
/// assert_relative_eq!(transformed_point, Point3::new(19.0, 17.0, -9.0), epsilon = 1.0e-5);
|
|
|
|
|
/// ```
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn transform_point(&self, pt: &Point<N, D>) -> Point<N, D> {
|
|
|
|
|
self * pt
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Transform the given vector by this similarity, ignoring the translational
|
|
|
|
|
/// component.
|
|
|
|
|
///
|
|
|
|
|
/// # Example
|
|
|
|
|
/// ```
|
|
|
|
|
/// # #[macro_use] extern crate approx;
|
|
|
|
|
/// # use std::f32;
|
|
|
|
|
/// # use nalgebra::{Similarity3, Vector3};
|
|
|
|
|
/// let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
|
|
|
|
|
/// let translation = Vector3::new(1.0, 2.0, 3.0);
|
|
|
|
|
/// let sim = Similarity3::new(translation, axisangle, 3.0);
|
|
|
|
|
/// let transformed_vector = sim.transform_vector(&Vector3::new(4.0, 5.0, 6.0));
|
|
|
|
|
/// assert_relative_eq!(transformed_vector, Vector3::new(18.0, 15.0, -12.0), epsilon = 1.0e-5);
|
|
|
|
|
/// ```
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn transform_vector(&self, v: &VectorN<N, D>) -> VectorN<N, D> {
|
|
|
|
|
self * v
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Transform the given point by the inverse of this similarity. This may
|
|
|
|
|
/// be cheaper than inverting the similarity and then transforming the
|
|
|
|
|
/// given point.
|
|
|
|
|
///
|
|
|
|
|
/// # Example
|
|
|
|
|
/// ```
|
|
|
|
|
/// # #[macro_use] extern crate approx;
|
|
|
|
|
/// # use std::f32;
|
|
|
|
|
/// # use nalgebra::{Point3, Similarity3, Vector3};
|
|
|
|
|
/// let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
|
|
|
|
|
/// let translation = Vector3::new(1.0, 2.0, 3.0);
|
|
|
|
|
/// let sim = Similarity3::new(translation, axisangle, 2.0);
|
|
|
|
|
/// let transformed_point = sim.inverse_transform_point(&Point3::new(4.0, 5.0, 6.0));
|
|
|
|
|
/// assert_relative_eq!(transformed_point, Point3::new(-1.5, 1.5, 1.5), epsilon = 1.0e-5);
|
|
|
|
|
/// ```
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn inverse_transform_point(&self, pt: &Point<N, D>) -> Point<N, D> {
|
|
|
|
|
self.isometry.inverse_transform_point(pt) / self.scaling()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Transform the given vector by the inverse of this similarity,
|
|
|
|
|
/// ignoring the translational component. This may be cheaper than
|
|
|
|
|
/// inverting the similarity and then transforming the given vector.
|
|
|
|
|
///
|
|
|
|
|
/// # Example
|
|
|
|
|
/// ```
|
|
|
|
|
/// # #[macro_use] extern crate approx;
|
|
|
|
|
/// # use std::f32;
|
|
|
|
|
/// # use nalgebra::{Similarity3, Vector3};
|
|
|
|
|
/// let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
|
|
|
|
|
/// let translation = Vector3::new(1.0, 2.0, 3.0);
|
|
|
|
|
/// let sim = Similarity3::new(translation, axisangle, 2.0);
|
|
|
|
|
/// let transformed_vector = sim.inverse_transform_vector(&Vector3::new(4.0, 5.0, 6.0));
|
|
|
|
|
/// assert_relative_eq!(transformed_vector, Vector3::new(-3.0, 2.5, 2.0), epsilon = 1.0e-5);
|
|
|
|
|
/// ```
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn inverse_transform_vector(&self, v: &VectorN<N, D>) -> VectorN<N, D> {
|
|
|
|
|
self.isometry.inverse_transform_vector(v) / self.scaling()
|
|
|
|
|
}
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
2018-09-24 12:48:42 +08:00
|
|
|
|
// NOTE: we don't require `R: Rotation<...>` here because this is not useful for the implementation
|
|
|
|
|
// and makes it harder to use it, e.g., for Transform × Isometry implementation.
|
2016-12-05 05:44:42 +08:00
|
|
|
|
// This is OK since all constructors of the isometry enforce the Rotation bound already (and
|
|
|
|
|
// explicit struct construction is prevented by the private scaling factor).
|
2017-08-03 01:37:44 +08:00
|
|
|
|
impl<N: Real, D: DimName, R> Similarity<N, D, R>
|
2018-10-22 13:00:10 +08:00
|
|
|
|
where DefaultAllocator: Allocator<N, D>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
{
|
2016-12-05 05:44:42 +08:00
|
|
|
|
/// Converts this similarity into its equivalent homogeneous transformation matrix.
|
|
|
|
|
#[inline]
|
2017-08-03 01:37:44 +08:00
|
|
|
|
pub fn to_homogeneous(&self) -> MatrixN<N, DimNameSum<D, U1>>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
D: DimNameAdd<U1>,
|
|
|
|
|
R: SubsetOf<MatrixN<N, DimNameSum<D, U1>>>,
|
|
|
|
|
DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>>,
|
|
|
|
|
{
|
2016-12-05 05:44:42 +08:00
|
|
|
|
let mut res = self.isometry.to_homogeneous();
|
|
|
|
|
|
|
|
|
|
for e in res.fixed_slice_mut::<D, D>(0, 0).iter_mut() {
|
|
|
|
|
*e *= self.scaling
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
res
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
impl<N: Real, D: DimName, R> Eq for Similarity<N, D, R>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
R: Rotation<Point<N, D>> + Eq,
|
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
2018-10-22 13:00:10 +08:00
|
|
|
|
{}
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
impl<N: Real, D: DimName, R> PartialEq for Similarity<N, D, R>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
R: Rotation<Point<N, D>> + PartialEq,
|
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
|
|
|
|
{
|
2016-12-05 05:44:42 +08:00
|
|
|
|
#[inline]
|
2017-08-03 01:37:44 +08:00
|
|
|
|
fn eq(&self, right: &Similarity<N, D, R>) -> bool {
|
2016-12-05 05:44:42 +08:00
|
|
|
|
self.isometry == right.isometry && self.scaling == right.scaling
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-05-19 21:41:58 +08:00
|
|
|
|
impl<N: Real, D: DimName, R> AbsDiffEq for Similarity<N, D, R>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
2018-05-19 21:41:58 +08:00
|
|
|
|
R: Rotation<Point<N, D>> + AbsDiffEq<Epsilon = N::Epsilon>,
|
2018-02-02 19:26:35 +08:00
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
|
|
|
|
N::Epsilon: Copy,
|
|
|
|
|
{
|
2016-12-05 05:44:42 +08:00
|
|
|
|
type Epsilon = N::Epsilon;
|
|
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
|
fn default_epsilon() -> Self::Epsilon {
|
|
|
|
|
N::default_epsilon()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[inline]
|
2018-05-19 21:41:58 +08:00
|
|
|
|
fn abs_diff_eq(&self, other: &Self, epsilon: Self::Epsilon) -> bool {
|
|
|
|
|
self.isometry.abs_diff_eq(&other.isometry, epsilon)
|
|
|
|
|
&& self.scaling.abs_diff_eq(&other.scaling, epsilon)
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
2018-05-19 21:41:58 +08:00
|
|
|
|
}
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
2018-05-19 21:41:58 +08:00
|
|
|
|
impl<N: Real, D: DimName, R> RelativeEq for Similarity<N, D, R>
|
|
|
|
|
where
|
|
|
|
|
R: Rotation<Point<N, D>> + RelativeEq<Epsilon = N::Epsilon>,
|
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
|
|
|
|
N::Epsilon: Copy,
|
|
|
|
|
{
|
2016-12-05 05:44:42 +08:00
|
|
|
|
#[inline]
|
2018-05-19 21:41:58 +08:00
|
|
|
|
fn default_max_relative() -> Self::Epsilon {
|
|
|
|
|
N::default_max_relative()
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[inline]
|
2018-02-02 19:26:35 +08:00
|
|
|
|
fn relative_eq(
|
|
|
|
|
&self,
|
|
|
|
|
other: &Self,
|
|
|
|
|
epsilon: Self::Epsilon,
|
|
|
|
|
max_relative: Self::Epsilon,
|
2018-10-22 13:00:10 +08:00
|
|
|
|
) -> bool
|
|
|
|
|
{
|
2018-02-02 19:26:35 +08:00
|
|
|
|
self.isometry
|
|
|
|
|
.relative_eq(&other.isometry, epsilon, max_relative)
|
2018-07-20 21:25:55 +08:00
|
|
|
|
&& self
|
|
|
|
|
.scaling
|
2018-02-02 19:26:35 +08:00
|
|
|
|
.relative_eq(&other.scaling, epsilon, max_relative)
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
2018-05-19 21:41:58 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<N: Real, D: DimName, R> UlpsEq for Similarity<N, D, R>
|
|
|
|
|
where
|
|
|
|
|
R: Rotation<Point<N, D>> + UlpsEq<Epsilon = N::Epsilon>,
|
|
|
|
|
DefaultAllocator: Allocator<N, D>,
|
|
|
|
|
N::Epsilon: Copy,
|
|
|
|
|
{
|
|
|
|
|
#[inline]
|
|
|
|
|
fn default_max_ulps() -> u32 {
|
|
|
|
|
N::default_max_ulps()
|
|
|
|
|
}
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
|
fn ulps_eq(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool {
|
2018-02-02 19:26:35 +08:00
|
|
|
|
self.isometry.ulps_eq(&other.isometry, epsilon, max_ulps)
|
|
|
|
|
&& self.scaling.ulps_eq(&other.scaling, epsilon, max_ulps)
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
*
|
|
|
|
|
* Display
|
|
|
|
|
*
|
|
|
|
|
*/
|
2017-08-03 01:37:44 +08:00
|
|
|
|
impl<N, D: DimName, R> fmt::Display for Similarity<N, D, R>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
N: Real + fmt::Display,
|
|
|
|
|
R: Rotation<Point<N, D>> + fmt::Display,
|
|
|
|
|
DefaultAllocator: Allocator<N, D> + Allocator<usize, D>,
|
|
|
|
|
{
|
2016-12-05 05:44:42 +08:00
|
|
|
|
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
|
|
|
|
|
let precision = f.precision().unwrap_or(3);
|
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
try!(writeln!(f, "Similarity {{"));
|
2016-12-05 05:44:42 +08:00
|
|
|
|
try!(write!(f, "{:.*}", precision, self.isometry));
|
|
|
|
|
try!(write!(f, "Scaling: {:.*}", precision, self.scaling));
|
|
|
|
|
writeln!(f, "}}")
|
|
|
|
|
}
|
|
|
|
|
}
|