pub struct NodeAppArgs<'visit, T> {
pub idx: UniIndex,
pub rel_pos: AccessRelatedness,
pub nodes: &'visit mut UniValMap<Node>,
pub data: &'visit mut T,
}Expand description
Data given to the transition function
Fields§
§idx: UniIndexThe index of the current node.
rel_pos: AccessRelatednessRelative position of the access.
nodes: &'visit mut UniValMap<Node>The node map of this tree.
data: &'visit mut TAdditional data we want to be able to modify in f_propagate and read in f_continue.
Auto Trait Implementations§
impl<'visit, T> Freeze for NodeAppArgs<'visit, T>
impl<'visit, T> RefUnwindSafe for NodeAppArgs<'visit, T>where
T: RefUnwindSafe,
impl<'visit, T> Send for NodeAppArgs<'visit, T>where
T: Send,
impl<'visit, T> Sync for NodeAppArgs<'visit, T>where
T: Sync,
impl<'visit, T> Unpin for NodeAppArgs<'visit, T>
impl<'visit, T> !UnwindSafe for NodeAppArgs<'visit, T>
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
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 24 bytes