Struct pixel_game_lib::Transform
source · pub struct Transform<P, O, S> {
pub position: Vec3<P>,
pub orientation: Quaternion<O>,
pub scale: Vec3<S>,
}
Expand description
Re-export vek types.
A convenient position + orientation + scale container, backed by two Vec3
and a Quaternion.
It can be easily interpolated and converted to a Mat4
of any layout.
let (p, rz, s) = (Vec3::unit_x(), 3.0_f32, 5.0_f32);
let a = Mat4::scaling_3d(s).rotated_z(rz).translated_3d(p);
let b = Mat4::from(Transform {
position: p,
orientation: Quaternion::rotation_z(rz),
scale: Vec3::broadcast(s),
});
assert_relative_eq!(a, b);
Fields§
§position: Vec3<P>
Local position.
orientation: Quaternion<O>
Local orientation; It is not named rotation
because rotation
denotes an
operation, but not a current state.
scale: Vec3<S>
Local scale.
Trait Implementations§
source§impl<P, O, S> Default for Transform<P, O, S>
impl<P, O, S> Default for Transform<P, O, S>
The default Transform
has a zero position, identity orientation and unit scale.
let a = Transform {
position: Vec3::<f32>::zero(),
orientation: Quaternion::<f32>::identity(),
scale: Vec3::<f32>::one(),
};
assert_eq!(a, Transform::default());
source§impl<'de, P, O, S> Deserialize<'de> for Transform<P, O, S>
impl<'de, P, O, S> Deserialize<'de> for Transform<P, O, S>
source§fn deserialize<__D>(
__deserializer: __D
) -> Result<Transform<P, O, S>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D
) -> Result<Transform<P, O, S>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
source§impl<T> From<Transform<T, T, T>> for Mat4<T>
impl<T> From<Transform<T, T, T>> for Mat4<T>
A Mat4
can be obtained from a Transform
, by rotating, then scaling, then
translating.
source§impl<T> From<Transform<T, T, T>> for Mat4<T>
impl<T> From<Transform<T, T, T>> for Mat4<T>
A Mat4
can be obtained from a Transform
, by rotating, then scaling, then
translating.
source§impl<'a, P, O, S, Factor> Lerp<Factor> for &'a Transform<P, O, S>
impl<'a, P, O, S, Factor> Lerp<Factor> for &'a Transform<P, O, S>
LERP on a Transform
is defined as LERP-ing between the positions and scales,
and performing SLERP between the orientations.
source§fn lerp_unclamped(
a: &'a Transform<P, O, S>,
b: &'a Transform<P, O, S>,
t: Factor
) -> <&'a Transform<P, O, S> as Lerp<Factor>>::Output
fn lerp_unclamped( a: &'a Transform<P, O, S>, b: &'a Transform<P, O, S>, t: Factor ) -> <&'a Transform<P, O, S> as Lerp<Factor>>::Output
from
to to
with factor
unconstrained,
using the supposedly fastest but less precise implementation. Read moresource§fn lerp_unclamped_precise(
a: &'a Transform<P, O, S>,
b: &'a Transform<P, O, S>,
t: Factor
) -> <&'a Transform<P, O, S> as Lerp<Factor>>::Output
fn lerp_unclamped_precise( a: &'a Transform<P, O, S>, b: &'a Transform<P, O, S>, t: Factor ) -> <&'a Transform<P, O, S> as Lerp<Factor>>::Output
from
to to
with factor
unconstrained,
using a possibly slower but more precise operation. Read moresource§fn lerp_unclamped_inclusive_range(
range: RangeInclusive<Self>,
factor: Factor
) -> Self::Output
fn lerp_unclamped_inclusive_range( range: RangeInclusive<Self>, factor: Factor ) -> Self::Output
lerp_unclamped()
that used a single RangeInclusive
parameter instead of two values.source§fn lerp_unclamped_precise_inclusive_range(
range: RangeInclusive<Self>,
factor: Factor
) -> Self::Output
fn lerp_unclamped_precise_inclusive_range( range: RangeInclusive<Self>, factor: Factor ) -> Self::Output
lerp_unclamped_precise()
that used a single RangeInclusive
parameter instead of two values.source§impl<P, O, S, Factor> Lerp<Factor> for Transform<P, O, S>
impl<P, O, S, Factor> Lerp<Factor> for Transform<P, O, S>
LERP on a Transform
is defined as LERP-ing between the positions and scales,
and performing SLERP between the orientations.
source§fn lerp_unclamped(
a: Transform<P, O, S>,
b: Transform<P, O, S>,
t: Factor
) -> Transform<P, O, S>
fn lerp_unclamped( a: Transform<P, O, S>, b: Transform<P, O, S>, t: Factor ) -> Transform<P, O, S>
from
to to
with factor
unconstrained,
using the supposedly fastest but less precise implementation. Read moresource§fn lerp_unclamped_precise(
a: Transform<P, O, S>,
b: Transform<P, O, S>,
t: Factor
) -> Transform<P, O, S>
fn lerp_unclamped_precise( a: Transform<P, O, S>, b: Transform<P, O, S>, t: Factor ) -> Transform<P, O, S>
from
to to
with factor
unconstrained,
using a possibly slower but more precise operation. Read moresource§fn lerp_unclamped_inclusive_range(
range: RangeInclusive<Self>,
factor: Factor
) -> Self::Output
fn lerp_unclamped_inclusive_range( range: RangeInclusive<Self>, factor: Factor ) -> Self::Output
lerp_unclamped()
that used a single RangeInclusive
parameter instead of two values.source§fn lerp_unclamped_precise_inclusive_range(
range: RangeInclusive<Self>,
factor: Factor
) -> Self::Output
fn lerp_unclamped_precise_inclusive_range( range: RangeInclusive<Self>, factor: Factor ) -> Self::Output
lerp_unclamped_precise()
that used a single RangeInclusive
parameter instead of two values.source§impl<P, O, S> PartialEq for Transform<P, O, S>
impl<P, O, S> PartialEq for Transform<P, O, S>
source§impl<P, O, S> Serialize for Transform<P, O, S>
impl<P, O, S> Serialize for Transform<P, O, S>
source§fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl<P, O, S> Copy for Transform<P, O, S>
impl<P, O, S> Eq for Transform<P, O, S>
impl<P, O, S> StructuralEq for Transform<P, O, S>
impl<P, O, S> StructuralPartialEq for Transform<P, O, S>
Auto Trait Implementations§
impl<P, O, S> RefUnwindSafe for Transform<P, O, S>
impl<P, O, S> Send for Transform<P, O, S>
impl<P, O, S> Sync for Transform<P, O, S>
impl<P, O, S> Unpin for Transform<P, O, S>
impl<P, O, S> UnwindSafe for Transform<P, O, S>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.