#[repr(C)]pub struct ClusterDagMiniHeader {
pub magic: [u8; 4],
pub version: u16,
pub max_lod_depth: u16,
pub cluster_count: u32,
pub group_count: u32,
pub total_meshlet_vertices: u32,
pub total_meshlet_triangles: u32,
pub root_cluster_offset: u32,
pub flags: u32,
}Expand description
32-byte POD mini-header for SectionType::ClusterDag (CDAG).
Fields§
§magic: [u8; 4]§version: u16§max_lod_depth: u16§cluster_count: u32§group_count: u32§total_meshlet_vertices: u32§total_meshlet_triangles: u32§root_cluster_offset: u32§flags: u32Trait Implementations§
Source§impl Clone for ClusterDagMiniHeader
impl Clone for ClusterDagMiniHeader
impl Copy for ClusterDagMiniHeader
Source§impl Debug for ClusterDagMiniHeader
impl Debug for ClusterDagMiniHeader
Source§impl Default for ClusterDagMiniHeader
impl Default for ClusterDagMiniHeader
impl Eq for ClusterDagMiniHeader
Source§impl PartialEq for ClusterDagMiniHeader
impl PartialEq for ClusterDagMiniHeader
impl Pod for ClusterDagMiniHeader
impl StructuralPartialEq for ClusterDagMiniHeader
Auto Trait Implementations§
impl Freeze for ClusterDagMiniHeader
impl RefUnwindSafe for ClusterDagMiniHeader
impl Send for ClusterDagMiniHeader
impl Sync for ClusterDagMiniHeader
impl Unpin for ClusterDagMiniHeader
impl UnsafeUnpin for ClusterDagMiniHeader
impl UnwindSafe for ClusterDagMiniHeader
Blanket Implementations§
§impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
Aggregate shares in an MPC protocol.
impl<T> AnyBitPattern for Twhere
T: Pod,
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
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
§impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
§type Bits = T
type Bits = T
Self must have the same layout as the specified Bits except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern.§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
If this function returns true, then it must be valid to reinterpret
bits
as &Self.Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
impl<T> Interleave for Twhere
T: Pod,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreimpl<T> NoUninit for Twhere
T: Pod,
§impl<T> NoneValue for Twhere
T: Default,
impl<T> NoneValue for Twhere
T: Default,
type NoneType = T
§fn null_value() -> T
fn null_value() -> T
The none-equivalent value.