pub struct UnionFindLayout {
pub node_count: u32,
pub edge_count: u32,
pub node_words: usize,
pub edge_storage_words: usize,
}Expand description
Validated dispatch layout for the union-find primitive.
The primitive owns these derived counts so dispatch wrappers do not fork parent output sizing or padded edge-buffer policy.
Fields§
§node_count: u32Number of parent nodes accepted by the primitive.
edge_count: u32Number of union edges accepted by the primitive.
node_words: usizeNumber of parent words expected in the backend output.
edge_storage_words: usizeNumber of edge words to upload for each edge endpoint buffer.
Trait Implementations§
Source§impl Clone for UnionFindLayout
impl Clone for UnionFindLayout
Source§fn clone(&self) -> UnionFindLayout
fn clone(&self) -> UnionFindLayout
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for UnionFindLayout
Source§impl Debug for UnionFindLayout
impl Debug for UnionFindLayout
impl Eq for UnionFindLayout
Source§impl PartialEq for UnionFindLayout
impl PartialEq for UnionFindLayout
impl StructuralPartialEq for UnionFindLayout
Auto Trait Implementations§
impl Freeze for UnionFindLayout
impl RefUnwindSafe for UnionFindLayout
impl Send for UnionFindLayout
impl Sync for UnionFindLayout
impl Unpin for UnionFindLayout
impl UnsafeUnpin for UnionFindLayout
impl UnwindSafe for UnionFindLayout
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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
Compare self to
key and return true if they are equal.