Struct FlatEntry 

pub struct FlatEntry<K: ItemKey = NodeId> {
    pub node_id: K,
    pub depth: usize,
    pub has_children: bool,
    pub is_expanded: bool,
}

A single entry in a tree’s flattened, currently-visible row list.

Generic over the key type so external sources carry their own identity (K = NodeId for TreeModel-backed sources, K = i64 for an entity-id store, …). The default K = NodeId keeps every in-tree FlatEntry mention and entry.node_id read compiling unchanged.

Fields

node_id: K

The row’s stable key in its source.

depth: usize

Depth in the tree (0 for roots).

has_children: bool

Whether this row has children in the source.

is_expanded: bool

Whether this row is currently expanded (children visible).

Trait Implementations

impl<K: Clone + ItemKey> Clone for FlatEntry<K>

fn clone(&self) -> FlatEntry<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + ItemKey> Debug for FlatEntry<K>

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

Formats the value using the given formatter.

impl<K: Eq + ItemKey> Eq for FlatEntry<K>

impl<K: PartialEq + ItemKey> PartialEq for FlatEntry<K>

fn eq(&self, other: &FlatEntry<K>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: PartialEq + ItemKey> StructuralPartialEq for FlatEntry<K>