struct AddAction;Trait Implementations§
Source§impl TopTreeAction<TopTreeSubtreeSum> for AddAction
impl TopTreeAction<TopTreeSubtreeSum> for AddAction
type Action = u64
Source§type ActionMonoid = AdditiveOperation<u64>
type ActionMonoid = AdditiveOperation<u64>
Composes actions in application order:
operate(a, b) applies a
before b.fn act_info(info: &mut u64, action: &Self::Action)
fn act_point(point: &mut (u64, u64), action: &Self::Action)
fn act_path(path: &mut (u64, u64, u64), action: &Self::Action)
fn act_path_light(path: &mut (u64, u64, u64), action: &Self::Action)
Source§const ROOT_TO_NODE_TOP_DOWN: bool = true
const ROOT_TO_NODE_TOP_DOWN: bool = true
Whether pending actions require propagation from the auxiliary root before rotations.
Auto Trait Implementations§
impl Freeze for AddAction
impl RefUnwindSafe for AddAction
impl Send for AddAction
impl Sync for AddAction
impl Unpin for AddAction
impl UnsafeUnpin for AddAction
impl UnwindSafe for AddAction
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