pub struct InternalTargetsRecursionlessTree<T: LinkReference> { /* private fields */ }Implementations§
Source§impl<T: LinkReference> InternalTargetsRecursionlessTree<T>
impl<T: LinkReference> InternalTargetsRecursionlessTree<T>
Trait Implementations§
Source§impl<T: LinkReference> IterativeSizeBalancedTree<T> for InternalTargetsRecursionlessTree<T>
impl<T: LinkReference> IterativeSizeBalancedTree<T> for InternalTargetsRecursionlessTree<T>
Source§impl<T: LinkReference> LinksTree<T> for InternalTargetsRecursionlessTree<T>
impl<T: LinkReference> LinksTree<T> for InternalTargetsRecursionlessTree<T>
Source§impl<T: LinkReference> RecursiveSizeBalancedTree<T> for InternalTargetsRecursionlessTree<T>
impl<T: LinkReference> RecursiveSizeBalancedTree<T> for InternalTargetsRecursionlessTree<T>
Source§unsafe fn get_left_reference(&self, node: T) -> *const T
unsafe fn get_left_reference(&self, node: T) -> *const T
Returns a const raw pointer to the left-child field of
node.Source§unsafe fn get_right_reference(&self, node: T) -> *const T
unsafe fn get_right_reference(&self, node: T) -> *const T
Returns a const raw pointer to the right-child field of
node.Source§unsafe fn get_mut_left_reference(&mut self, node: T) -> *mut T
unsafe fn get_mut_left_reference(&mut self, node: T) -> *mut T
Returns a mutable raw pointer to the left-child field of
node.Source§unsafe fn get_mut_right_reference(&mut self, node: T) -> *mut T
unsafe fn get_mut_right_reference(&mut self, node: T) -> *mut T
Returns a mutable raw pointer to the right-child field of
node.Source§unsafe fn first_is_to_the_left_of_second(&self, first: T, second: T) -> bool
unsafe fn first_is_to_the_left_of_second(&self, first: T, second: T) -> bool
Returns
true if first should be placed to the left of second.Source§unsafe fn first_is_to_the_right_of_second(&self, first: T, second: T) -> bool
unsafe fn first_is_to_the_right_of_second(&self, first: T, second: T) -> bool
Returns
true if first should be placed to the right of second.Source§unsafe fn clear_node(&mut self, node: T)
unsafe fn clear_node(&mut self, node: T)
Resets
node’s left, right, and size fields to zero.Source§unsafe fn get_left_or_default(&self, node: T) -> T
unsafe fn get_left_or_default(&self, node: T) -> T
Returns the left child of
node, or T::from_byte(0) if node is zero.Source§unsafe fn get_right_or_default(&self, node: T) -> T
unsafe fn get_right_or_default(&self, node: T) -> T
Returns the right child of
node, or T::from_byte(0) if node is zero.Source§unsafe fn get_size_or_zero(&self, node: T) -> T
unsafe fn get_size_or_zero(&self, node: T) -> T
Returns the size of
node, or zero if node is zero.Source§unsafe fn get_left_size(&self, node: T) -> T
unsafe fn get_left_size(&self, node: T) -> T
Returns the size of the left subtree of
node.Source§unsafe fn get_right_size(&self, node: T) -> T
unsafe fn get_right_size(&self, node: T) -> T
Returns the size of the right subtree of
node.Source§unsafe fn fix_size(&mut self, node: T)
unsafe fn fix_size(&mut self, node: T)
Recalculates the size of
node from its children:
size = left_size + right_size + 1.Source§unsafe fn left_rotate(&mut self, root: *mut T)
unsafe fn left_rotate(&mut self, root: *mut T)
Performs a left rotation at the subtree rooted at
*root,
updating *root in place.Source§unsafe fn left_rotate_core(&mut self, root: T) -> T
unsafe fn left_rotate_core(&mut self, root: T) -> T
Performs a left rotation and returns the new root.
Source§unsafe fn right_rotate(&mut self, root: *mut T)
unsafe fn right_rotate(&mut self, root: *mut T)
Performs a right rotation at the subtree rooted at
*root,
updating *root in place.Source§unsafe fn right_rotate_core(&mut self, root: T) -> T
unsafe fn right_rotate_core(&mut self, root: T) -> T
Performs a right rotation and returns the new root.
Source§unsafe fn get_rightest(&self, current: T) -> T
unsafe fn get_rightest(&self, current: T) -> T
Returns the rightmost (maximum) node in the subtree rooted at
current.Source§unsafe fn get_leftest(&self, current: T) -> T
unsafe fn get_leftest(&self, current: T) -> T
Returns the leftmost (minimum) node in the subtree rooted at
current.Source§unsafe fn get_previous(&self, node: T) -> T
unsafe fn get_previous(&self, node: T) -> T
Returns the in-order predecessor of
node.impl<T: LinkReference> SplitTree<T> for InternalTargetsRecursionlessTree<T>
Source§impl<T: LinkReference> SplitUpdateMem<T> for InternalTargetsRecursionlessTree<T>
impl<T: LinkReference> SplitUpdateMem<T> for InternalTargetsRecursionlessTree<T>
Auto Trait Implementations§
impl<T> !Send for InternalTargetsRecursionlessTree<T>
impl<T> !Sync for InternalTargetsRecursionlessTree<T>
impl<T> Freeze for InternalTargetsRecursionlessTree<T>where
InternalRecursionlessSizeBalancedTreeBase<T>: Freeze,
impl<T> RefUnwindSafe for InternalTargetsRecursionlessTree<T>where
InternalRecursionlessSizeBalancedTreeBase<T>: RefUnwindSafe,
impl<T> Unpin for InternalTargetsRecursionlessTree<T>where
InternalRecursionlessSizeBalancedTreeBase<T>: Unpin,
impl<T> UnsafeUnpin for InternalTargetsRecursionlessTree<T>where
InternalRecursionlessSizeBalancedTreeBase<T>: UnsafeUnpin,
impl<T> UnwindSafe for InternalTargetsRecursionlessTree<T>where
InternalRecursionlessSizeBalancedTreeBase<T>: UnwindSafe,
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