Struct ultraviolet::vec::Vec3x8[][src]

#[repr(C)]pub struct Vec3x8 {
    pub x: f32x8,
    pub y: f32x8,
    pub z: f32x8,
}

A set of three coordinates which may be interpreted as a point or vector in 3d space, or as a homogeneous 2d vector or point.

Generally this distinction between a point and vector is more of a pain than it is worth to distinguish on a type level, however when converting to and from homogeneous coordinates it is quite important.

Fields

x: f32x8y: f32x8z: f32x8

Implementations

impl Vec3x8[src]

pub const fn new(x: f32x8, y: f32x8, z: f32x8) -> Self[src]

pub const fn broadcast(val: f32x8) -> Self[src]

pub fn unit_x() -> Self[src]

pub fn unit_y() -> Self[src]

pub fn unit_z() -> Self[src]

pub fn into_homogeneous_point(self) -> Vec4x8[src]

Create a homogeneous 3d point from this vector interpreted as a point, meaning the homogeneous component will start with a value of 1.0.

pub fn into_homogeneous_vector(self) -> Vec4x8[src]

Create a homogeneous 3d vector from this vector, meaning the homogeneous component will always have a value of 0.0.

pub fn from_homogeneous_point(v: Vec4x8) -> Self[src]

Create a 3d point from a homogeneous 3d point, performing division by the homogeneous component. This should not be used for homogeneous 3d vectors, which will have 0 as their homogeneous component.

pub fn from_homogeneous_vector(v: Vec4x8) -> Self[src]

Create a 3d vector from homogeneous 2d vector, which simply discards the homogeneous component.

pub fn dot(&self, other: Vec3x8) -> f32x8[src]

pub fn wedge(&self, other: Vec3x8) -> Bivec3x8[src]

The wedge (aka exterior) product of two vectors.

This operation results in a bivector, which represents the plane parallel to the two vectors, and which has a ‘oriented area’ equal to the parallelogram created by extending the two vectors, oriented such that the positive direction is the one which would move self closer to other.

pub fn geom(&self, other: Vec3x8) -> Rotor3x8[src]

The geometric product of this and another vector, which is defined as the sum of the dot product and the wedge product.

This operation results in a ‘rotor’, named as such as it may define a rotation. The rotor which results from the geometric product will rotate in the plane parallel to the two vectors, by twice the angle between them and in the opposite direction (i.e. it will rotate in the direction that would bring other towards self, and rotate in that direction by twice the angle between them).

pub fn rotate_by(&mut self, rotor: Rotor3x8)[src]

pub fn rotated_by(self, rotor: Rotor3x8) -> Self[src]

pub fn cross(&self, other: Vec3x8) -> Self[src]

pub fn reflect(&mut self, normal: Vec3x8)[src]

pub fn reflected(&self, normal: Vec3x8) -> Self[src]

pub fn mag_sq(&self) -> f32x8[src]

pub fn mag(&self) -> f32x8[src]

pub fn normalize(&mut self)[src]

pub fn normalized(&self) -> Self[src]

pub fn normalize_homogeneous_point(&mut self)[src]

Normalize self in-place by interpreting it as a homogeneous point, i.e. scaling the vector to ensure the homogeneous component has length 1.

pub fn normalized_homogeneous_point(&self) -> Self[src]

Normalize self by interpreting it as a homogeneous point, i.e. scaling the vector to ensure the homogeneous component has length 1.

pub fn truncated(&self) -> Vec2x8[src]

Convert self into a Vec2 by simply removing its z component.

pub fn mul_add(&self, mul: Vec3x8, add: Vec3x8) -> Self[src]

pub fn abs(&self) -> Self[src]

pub fn clamp(&mut self, min: Self, max: Self)[src]

pub fn clamped(self, min: Self, max: Self) -> Self[src]

pub fn map<F>(&self, f: F) -> Self where
    F: Fn(f32x8) -> f32x8
[src]

pub fn apply<F>(&mut self, f: F) where
    F: Fn(f32x8) -> f32x8
[src]

pub fn max_by_component(self, other: Self) -> Self[src]

pub fn min_by_component(self, other: Self) -> Self[src]

pub fn component_max(&self) -> f32x8[src]

pub fn component_min(&self) -> f32x8[src]

pub fn zero() -> Self[src]

pub fn one() -> Self[src]

pub const fn xy(&self) -> Vec2x8[src]

pub fn xyzw(&self) -> Vec4x8[src]

pub fn layout() -> Layout[src]

pub fn as_array(&self) -> &[f32x8; 3][src]

pub fn as_slice(&self) -> &[f32x8][src]

pub fn as_byte_slice(&self) -> &[u8][src]

pub fn as_mut_slice(&mut self) -> &mut [f32x8][src]

pub fn as_mut_byte_slice(&mut self) -> &mut [u8][src]

pub const fn as_ptr(&self) -> *const f32x8[src]

Returns a constant unsafe pointer to the underlying data in the underlying type. This function is safe because all types here are repr(C) and can be represented as their underlying type.

Safety

It is up to the caller to correctly use this pointer and its bounds.

pub fn as_mut_ptr(&mut self) -> *mut f32x8[src]

Returns a mutable unsafe pointer to the underlying data in the underlying type. This function is safe because all types here are repr(C) and can be represented as their underlying type.

Safety

It is up to the caller to correctly use this pointer and its bounds.

impl Vec3x8[src]

pub fn new_splat(x: f32, y: f32, z: f32) -> Self[src]

pub fn splat(vec: Vec3) -> Self[src]

pub fn blend(mask: m32x8, tru: Self, fals: Self) -> Self[src]

Blend two vectors together lanewise using mask as a mask.

This is essentially a bitwise blend operation, such that any point where there is a 1 bit in mask, the output will put the bit from tru, while where there is a 0 bit in mask, the output will put the bit from fals

pub fn refract(&mut self, normal: Self, eta: f32x8)[src]

pub fn refracted(&self, normal: Self, eta: f32x8) -> Self[src]

Trait Implementations

impl Add<Vec3x8> for Vec3x8[src]

type Output = Self

The resulting type after applying the + operator.

impl AddAssign<Vec3x8> for Vec3x8[src]

impl Clone for Vec3x8[src]

impl Copy for Vec3x8[src]

impl Debug for Vec3x8[src]

impl Default for Vec3x8[src]

impl Div<Vec3x8> for Vec3x8[src]

type Output = Self

The resulting type after applying the / operator.

impl Div<f32x8> for Vec3x8[src]

type Output = Vec3x8

The resulting type after applying the / operator.

impl DivAssign<Vec3x8> for Vec3x8[src]

impl DivAssign<f32x8> for Vec3x8[src]

impl From<&'_ [f32x8; 3]> for Vec3x8[src]

impl From<&'_ (f32x8, f32x8, f32x8)> for Vec3x8[src]

impl From<&'_ mut [f32x8; 3]> for Vec3x8[src]

impl From<[Vec3; 8]> for Vec3x8[src]

impl From<[f32x8; 3]> for Vec3x8[src]

impl From<(f32x8, f32x8, f32x8)> for Vec3x8[src]

impl From<Vec2x8> for Vec3x8[src]

impl From<Vec3x8> for Vec2x8[src]

impl From<Vec3x8> for Vec4x8[src]

impl From<Vec4x8> for Vec3x8[src]

impl Index<usize> for Vec3x8[src]

type Output = f32x8

The returned type after indexing.

impl IndexMut<usize> for Vec3x8[src]

impl Into<[Vec3; 8]> for Vec3x8[src]

impl Into<[f32x8; 3]> for Vec3x8[src]

impl Lerp<f32x8> for Vec3x8[src]

fn lerp(&self, end: Self, t: f32x8) -> Self[src]

Linearly interpolate between self and end by t between 0.0 and 1.0. i.e. (1.0 - t) * self + (t) * end.

For interpolating Rotors with linear interpolation, you almost certainly want to normalize the returned Rotor. For example,

let interpolated_rotor = rotor1.lerp(rotor2, 0.5).normalized();

For most cases (especially where performance is the primary concern, like in animation interpolation for games, this ‘normalized lerp’ or ‘nlerp’ is probably what you want to use. However, there are situations in which you really want the interpolation between two Rotors to be of constant angular velocity. In this case, check out Slerp.

impl Mul<Vec3x8> for Mat3x8[src]

type Output = Vec3x8

The resulting type after applying the * operator.

impl Mul<Vec3x8> for Rotor3x8[src]

type Output = Vec3x8

The resulting type after applying the * operator.

impl Mul<Vec3x8> for Isometry3x8[src]

type Output = Vec3x8

The resulting type after applying the * operator.

impl Mul<Vec3x8> for Similarity3x8[src]

type Output = Vec3x8

The resulting type after applying the * operator.

impl Mul<Vec3x8> for Vec3x8[src]

type Output = Self

The resulting type after applying the * operator.

impl Mul<Vec3x8> for f32x8[src]

type Output = Vec3x8

The resulting type after applying the * operator.

impl Mul<f32x8> for Vec3x8[src]

type Output = Vec3x8

The resulting type after applying the * operator.

impl MulAssign<Vec3x8> for Vec3x8[src]

impl MulAssign<f32x8> for Vec3x8[src]

impl Neg for Vec3x8[src]

type Output = Vec3x8

The resulting type after applying the - operator.

impl PartialEq<Vec3x8> for Vec3x8[src]

impl Slerp<f32x8> for Vec3x8[src]

fn slerp(&self, end: Self, t: f32x8) -> Self[src]

Spherical-linear interpolation between self and end based on t from 0.0 to 1.0.

self and end should both be normalized or something bad will happen!

The implementation for SIMD types also requires that the two things being interpolated between are not exactly aligned, or else the result is undefined.

Basically, interpolation that maintains a constant angular velocity from one orientation on a unit hypersphere to another. This is sorta the “high quality” interpolation for Rotors, and it can also be used to interpolate other things, one example being interpolation of 3d normal vectors.

Note that you should often normalize the result returned by this operation, when working with Rotors, etc!

impl StructuralPartialEq for Vec3x8[src]

impl Sub<Vec3x8> for Vec3x8[src]

type Output = Self

The resulting type after applying the - operator.

impl SubAssign<Vec3x8> for Vec3x8[src]

impl Sum<Vec3x8> for Vec3x8[src]

Auto Trait Implementations

impl RefUnwindSafe for Vec3x8

impl Send for Vec3x8

impl Sync for Vec3x8

impl Unpin for Vec3x8

impl UnwindSafe for Vec3x8

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.