Struct TreeMarks 

pub struct TreeMarks<K> { /* private fields */ }

What a tree list works out of its rows, for the rows it builds: how deep each stands, which of them are folded away, which have subtasks, and which stand under the row they follow. The list fills it as it mounts rows; a row’s builder reads it, and the person’s folding stays with the list, so a row folded away stays folded while its neighbours come and go.

Implementations

impl<K> TreeMarks<K>

where K: Clone + Eq + Hash,

pub fn depth(&self, key: &K) -> u32

How many rows under its top row key stands.

pub fn is_folded(&self, key: &K) -> bool

Whether the person folded the row’s subtasks away.

pub fn is_branch(&self, key: &K) -> bool

Whether the row has subtasks, a disclosure to show.

pub fn is_nested(&self, key: &K) -> bool

Whether the row stands under the row it follows, rather than away from the parent it names: a list keeps the order its filter gave it, and a subtask the sort put elsewhere says whose it is instead of standing indented under nothing.

pub fn folded_keys(&self) -> Vec<K>

The rows whose subtasks the person folded away, as a view saved them.

pub fn restore_folded(&self, keys: impl IntoIterator<Item = K>)

Fold exactly keys’ subtasks away, showing every other row’s: a saved view restored.

pub fn fold(&self, key: &K, folded: bool)

Fold the row’s subtasks away, or show them again.

Trait Implementations

impl<K> Debug for TreeMarks<K>

where K: Debug,

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

Formats the value using the given formatter.

impl<K> Default for TreeMarks<K>

fn default() -> TreeMarks<K>

Returns the “default value” for a type.