Type Alias oxygengine_physics_2d::prelude::material::MaterialId

pub type MaterialId = u32;

The identifier of a material.

Trait Implementations

impl SimdValue for u32

type Element = u32

The type of the elements of each lane of this SIMD value.

type SimdBool = bool

Type of the result of comparing two SIMD values like self.

fn lanes() -> usize

The number of lanes of this SIMD value.

fn splat(val: <u32 as SimdValue>::Element) -> u32

Initializes an SIMD value with each lanes set to val.

fn extract(&self, _: usize) -> <u32 as SimdValue>::Element

Extracts the i-th lane of self.

unsafe fn extract_unchecked(&self, _: usize) -> <u32 as SimdValue>::Element

Extracts the i-th lane of self without bound-checking.

fn replace(&mut self, _: usize, val: <u32 as SimdValue>::Element)

Replaces the i-th lane of self by val.

unsafe fn replace_unchecked( &mut self, _: usize, val: <u32 as SimdValue>::Element )

Replaces the i-th lane of self by val without bound-checking.

fn select(self, cond: <u32 as SimdValue>::SimdBool, other: u32) -> u32

Merges self and other depending on the lanes of cond.

fn map_lanes(self, f: impl Fn(Self::Element) -> Self::Element) -> Selfwhere Self: Clone,

Applies a function to each lane of self.

fn zip_map_lanes( self, b: Self, f: impl Fn(Self::Element, Self::Element) -> Self::Element ) -> Selfwhere Self: Clone,

Applies a function to each lane of self paired with the corresponding lane of b.

impl<N2> SubsetOf<AutoSimd<N2>> for u32where AutoSimd<N2>: SimdValue + Copy, <AutoSimd<N2> as SimdValue>::Element: SupersetOf<u32> + PartialEq<<AutoSimd<N2> as SimdValue>::Element>,

fn to_superset(&self) -> AutoSimd<N2>

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &AutoSimd<N2>) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(c: &AutoSimd<N2>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N2> SubsetOf<Complex<N2>> for u32where N2: Zero + SupersetOf<u32>,

fn to_superset(&self) -> Complex<N2>

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &Complex<N2>) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(c: &Complex<N2>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<WideF32x4> for u32

fn to_superset(&self) -> WideF32x4

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &WideF32x4) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(c: &WideF32x4) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<f32> for u32

fn to_superset(&self) -> f32

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &f32) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &f32) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<f64> for u32

fn to_superset(&self) -> f64

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &f64) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &f64) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<i128> for u32

fn to_superset(&self) -> i128

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &i128) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &i128) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<i16> for u32

fn to_superset(&self) -> i16

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &i16) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &i16) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<i32> for u32

fn to_superset(&self) -> i32

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &i32) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &i32) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<i64> for u32

fn to_superset(&self) -> i64

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &i64) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &i64) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<i8> for u32

fn to_superset(&self) -> i8

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &i8) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &i8) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<isize> for u32

fn to_superset(&self) -> isize

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &isize) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &isize) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<u128> for u32

fn to_superset(&self) -> u128

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &u128) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &u128) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<u16> for u32

fn to_superset(&self) -> u16

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &u16) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &u16) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<u32> for u32

fn to_superset(&self) -> u32

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &u32) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &u32) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<u64> for u32

fn to_superset(&self) -> u64

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &u64) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &u64) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<u8> for u32

fn to_superset(&self) -> u8

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &u8) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &u8) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl SubsetOf<usize> for u32

fn to_superset(&self) -> usize

The inclusion map: converts self to the equivalent element of its superset.

fn from_superset_unchecked(element: &usize) -> u32

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn is_in_subset(_: &usize) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl PrimitiveSimdValue for u32