Enum Inclusivity 

pub enum Inclusivity {
    SelfAndAncestors,
    AncestorsOnly,
}

Whether a tree walk starts at the node itself or at its parent.

Five different ancestor walks in this codebase encoded this choice in a loop’s starting value, so the difference between “the caret’s own scroll box” and “the scroll box around it” was invisible at the call site — and the two mirror-image helper pairs (accumulated_scroll_for_node vs node_rect_to_screen, find_scrollable_ancestor vs find_scroll_parent) had names that gave no hint which was which.

Variants

SelfAndAncestors

Start at the node itself. Correct when the node’s own scrolling is part of the answer: how far this box’s content has moved, or which box a caret inside it lives in.

AncestorsOnly

Start at the node’s parent. Correct when the answer is about where the node’s BOX sits, or which OTHER container should take over: a container’s own scrolling never moves its own box, and momentum must chain outwards, not back into itself.

Implementations

impl Inclusivity

pub const fn includes_self(self) -> bool

Whether the walk visits the starting node.

Trait Implementations

impl Clone for Inclusivity

fn clone(&self) -> Inclusivity

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Inclusivity

impl Debug for Inclusivity

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for Inclusivity

impl Hash for Inclusivity

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Inclusivity

fn eq(&self, other: &Inclusivity) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Inclusivity