pub struct NumberTreeEntries<'a, T> { /* private fields */ }
Expand description
Writer for a number tree numbers array.
The children must be added in ascending order. Their minimum and
maximum keys must not exceed the /Limits
property of the parent NumberTree
node. This struct is created by NumberTree::nums
.
Implementations§
Trait Implementations§
source§impl<'a, 'any, T> Rewrite<'a> for NumberTreeEntries<'any, T>
impl<'a, 'any, T> Rewrite<'a> for NumberTreeEntries<'any, T>
source§type Output = NumberTreeEntries<'a, T>
type Output = NumberTreeEntries<'a, T>
The writer with the rewritten lifetime.
Auto Trait Implementations§
impl<'a, T> Freeze for NumberTreeEntries<'a, T>
impl<'a, T> RefUnwindSafe for NumberTreeEntries<'a, T>where
T: RefUnwindSafe,
impl<'a, T> Send for NumberTreeEntries<'a, T>where
T: Send,
impl<'a, T> Sync for NumberTreeEntries<'a, T>where
T: Sync,
impl<'a, T> Unpin for NumberTreeEntries<'a, T>where
T: Unpin,
impl<'a, T> !UnwindSafe for NumberTreeEntries<'a, T>
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