Struct ListItem 

pub struct ListItem<T> { /* private fields */ }

One owned typed value and its recursive nested list items.

ListItem is deliberately independent of the Tree component’s public node model, so either public API can evolve without changing the other.

Implementations

impl<T> ListItem<T>

pub fn new(value: T) -> Self

Creates a visible leaf item from a typed value.

pub fn item(self, item: impl Into<Self>) -> Self

Appends one nested item.

pub fn items<I, N>(self, items: I) -> Self

where I: IntoIterator<Item = N>, N: Into<Self>,

Appends nested items in iteration order.

pub const fn hidden(self, hidden: bool) -> Self

Includes or excludes this item and all of its descendants.

pub const fn offset(self, start: usize, end: usize) -> Self

Omits start nested items from the front and end from the back.

pub const fn value(&self) -> &T

Returns this item’s value.

pub fn item_nodes(&self) -> &[Self]

Returns all nested items before visibility and offset are applied.

pub const fn is_hidden(&self) -> bool

Returns whether this item and its descendants are excluded.

Trait Implementations

impl<T: Clone> Clone for ListItem<T>

fn clone(&self) -> ListItem<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for ListItem<T>

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

Formats the value using the given formatter.

impl<T> From<T> for ListItem<T>

fn from(value: T) -> Self

Converts to this type from the input type.

impl<T: PartialEq> PartialEq for ListItem<T>

fn eq(&self, other: &ListItem<T>) -> 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<T: Eq> Eq for ListItem<T>

impl<T> StructuralPartialEq for ListItem<T>