pub struct RecycledNodeInsertion {
pub id: NodeId,
pub stable_id_reused: bool,
pub fallback_error: Option<NodeError>,
}Expand description
The result of putting a recycled node back into an applier.
Fields§
§id: NodeIdThe id the node has now.
stable_id_reused: boolWhether the node got its old stable id back.
fallback_error: Option<NodeError>The error that forced a new id, or None if the old id was reused.
Trait Implementations§
Source§impl Clone for RecycledNodeInsertion
impl Clone for RecycledNodeInsertion
Source§impl Debug for RecycledNodeInsertion
impl Debug for RecycledNodeInsertion
impl Eq for RecycledNodeInsertion
Source§impl PartialEq for RecycledNodeInsertion
impl PartialEq for RecycledNodeInsertion
impl StructuralPartialEq for RecycledNodeInsertion
Auto Trait Implementations§
impl Freeze for RecycledNodeInsertion
impl RefUnwindSafe for RecycledNodeInsertion
impl Send for RecycledNodeInsertion
impl Sync for RecycledNodeInsertion
impl Unpin for RecycledNodeInsertion
impl UnsafeUnpin for RecycledNodeInsertion
impl UnwindSafe for RecycledNodeInsertion
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