Struct ultraviolet::vec::Vec2x8[−][src]

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

A set of two coordinates which may be interpreted as a vector or point in 2d space.

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: f32x8

Implementations

`impl Vec2x8`[src]

`pub const fn new(x: f32x8, y: 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 into_homogeneous_point(self) -> Vec3x8`[src]

Create a homogeneous 2d 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) -> Vec3x8`[src]

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

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

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

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

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

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

`pub fn wedge(&self, other: Vec2x8) -> Bivec2x8`[src]

The wedge (aka exterior) product of two vectors.

Note: Sometimes called “cross” product in 2D. Such a product is not well defined in 2 dimensions and is really just shorthand notation for a hacky operation that extends the vectors into 3 dimensions, takes the cross product, then returns only the resulting Z component as a pseudoscalar value. This value is will have the same value as the resulting bivector of the wedge product in 2d (a 2d bivector is also a kind of pseudoscalar value), so you may use this product to calculate the same value.

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: Vec2x8) -> Rotor2x8`[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: Rotor2x8)`[src]

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

`pub fn reflected(&self, normal: Vec2x8) -> 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 mul_add(&self, mul: Vec2x8, add: Vec2x8) -> 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 fn xyz(&self) -> Vec3x8`[src]

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

`pub fn layout() -> Layout`[src]

`pub fn as_array(&self) -> &[f32x8; 2]`[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 Vec2x8`[src]

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

`pub fn splat(vec: Vec2) -> 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<Vec2x8> for Vec2x8`[src]

`type Output = Self`

The resulting type after applying the + operator.

`fn add(self, rhs: Vec2x8) -> Self`[src]

`impl AddAssign<Vec2x8> for Vec2x8`[src]

`fn add_assign(&mut self, rhs: Vec2x8)`[src]

`impl Clone for Vec2x8`[src]

`fn clone(&self) -> Vec2x8`[src]

`pub fn clone_from(&mut self, source: &Self)`1.0.0[src]

`impl Copy for Vec2x8`[src]

`impl Debug for Vec2x8`[src]

`fn fmt(&self, f: &mut Formatter<'_>) -> Result`[src]

`impl Default for Vec2x8`[src]

`fn default() -> Vec2x8`[src]

`impl Div<Vec2x8> for Vec2x8`[src]

`type Output = Self`

The resulting type after applying the / operator.

`fn div(self, rhs: Vec2x8) -> Self`[src]

`impl Div<f32x8> for Vec2x8`[src]

`type Output = Vec2x8`

The resulting type after applying the / operator.

`fn div(self, rhs: f32x8) -> Vec2x8`[src]

`impl DivAssign<Vec2x8> for Vec2x8`[src]

`fn div_assign(&mut self, rhs: Vec2x8)`[src]

`impl DivAssign<f32x8> for Vec2x8`[src]

`fn div_assign(&mut self, rhs: f32x8)`[src]

`impl From<&'_ [f32x8; 2]> for Vec2x8`[src]

`fn from(comps: &[f32x8; 2]) -> Self`[src]

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

`fn from(comps: &(f32x8, f32x8)) -> Self`[src]

`impl From<&'_ mut [f32x8; 2]> for Vec2x8`[src]

`fn from(comps: &mut [f32x8; 2]) -> Self`[src]

`impl From<[Vec2; 8]> for Vec2x8`[src]

`fn from(vecs: [Vec2; 8]) -> Self`[src]

`impl From<[f32x8; 2]> for Vec2x8`[src]

`fn from(comps: [f32x8; 2]) -> Self`[src]

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

`fn from(comps: (f32x8, f32x8)) -> Self`[src]

`impl From<Vec2> for Vec2x8`[src]

`fn from(vec: Vec2) -> Self`[src]

`impl From<Vec2x8> for Vec3x8`[src]

`fn from(vec: Vec2x8) -> Self`[src]

`impl From<Vec3x8> for Vec2x8`[src]

`fn from(vec: Vec3x8) -> Self`[src]

`impl Index<usize> for Vec2x8`[src]

`type Output = f32x8`

The returned type after indexing.

`fn index(&self, index: usize) -> &Self::Output`[src]

`impl IndexMut<usize> for Vec2x8`[src]

`fn index_mut(&mut self, index: usize) -> &mut Self::Output`[src]

`impl Into<[Vec2; 8]> for Vec2x8`[src]

`fn into(self) -> [Vec2; 8]`[src]

`impl Into<[f32x8; 2]> for Vec2x8`[src]

`fn into(self) -> [f32x8; 2]`[src]

`impl Lerp<f32x8> for Vec2x8`[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.