pub struct RootLDNode { /* private fields */ }Trait Implementations§
Source§impl Debug for RootLDNode
impl Debug for RootLDNode
Source§impl HasByteSize for RootLDNode
impl HasByteSize for RootLDNode
Source§impl SubTreeR for RootLDNode
impl SubTreeR for RootLDNode
fn get<I, V, IRW, VRW>( &self, value: V, raw_entries: &[u8], id_rw: &IRW, val_rw: &VRW, ) -> Result<Option<Entry<I, V>>, Error>
Source§fn visit_desc<I, V, IRW, VRW, T>(
&self,
_visitor: T,
_raw_entries: &[u8],
_id_rw: &IRW,
_val_rw: &VRW,
) -> Result<T, Error>
fn visit_desc<I, V, IRW, VRW, T>( &self, _visitor: T, _raw_entries: &[u8], _id_rw: &IRW, _val_rw: &VRW, ) -> Result<T, Error>
Visit from the largest to the smallest value
Auto Trait Implementations§
impl Freeze for RootLDNode
impl RefUnwindSafe for RootLDNode
impl Send for RootLDNode
impl Sync for RootLDNode
impl Unpin for RootLDNode
impl UnwindSafe for RootLDNode
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