pub struct Conveyor {
pub needs_update: bool,
pub bundles: Vec<Option<Bundle>>,
/* private fields */
}Fields§
§needs_update: bool§bundles: Vec<Option<Bundle>>Implementations§
Source§impl Conveyor
impl Conveyor
pub fn new() -> Self
pub fn upsert_gadget(&mut self, device: &Device, desc: &GadgetDescriptor<'_>)
pub fn update_gadget( &mut self, queue: &Queue, gadget_label: &str, data: &[u8], ) -> Result<(), ConveyorError>
pub fn update_bundles(&mut self, device: &Device)
pub fn attach_bundles(&self, render_pass: &mut RenderPass<'_>)
pub fn collect_bind_group_layouts( bundles_collection: Vec<&Vec<Option<Bundle>>>, ) -> Vec<&BindGroupLayout>
Auto Trait Implementations§
impl Freeze for Conveyor
impl !RefUnwindSafe for Conveyor
impl Send for Conveyor
impl Sync for Conveyor
impl Unpin for Conveyor
impl !UnwindSafe for Conveyor
Blanket Implementations§
§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.