Struct TreeTable 

pub struct TreeTable<T, V, Id, K = String>
where
    V: Deref<Target = [T]> + Clone + 'static,
    T: PartialEq + Clone + 'static,
    Id: Eq + Hash + Clone + Send + Sync + 'static,
    K: Eq + Hash + Clone + PartialEq + Send + Sync + 'static,
{ /* private fields */ }

Implementations

impl<T, V, Id, K> TreeTable<T, V, Id, K>

where V: Deref<Target = [T]> + Clone + 'static, T: PartialEq + Clone + 'static, Id: Eq + Hash + Clone + Send + Sync + 'static, K: Eq + Hash + Clone + PartialEq + Send + Sync + 'static,

pub fn new<S, U, C, R, H, F>( cx: &mut Context, tree: S, columns: C, flatten_rows: F, row_id: impl Fn(&T) -> Id + 'static, parent_id: impl Fn(&T) -> Option<Id> + 'static, ) -> Handle<'_, TreeTable<T, V, Id, K>>

where S: Res<U> + 'static, U: Clone + 'static, C: Res<R> + 'static, R: Deref<Target = [TreeTableColumn<T, Id, H, K>]> + Clone + 'static, H: Clone + View, F: Fn(&U) -> V + 'static,

pub fn from_rows<S, C, R, H>( cx: &mut Context, rows: S, columns: C, row_id: impl Fn(&T) -> Id + 'static, parent_id: impl Fn(&T) -> Option<Id> + 'static, ) -> Handle<'_, TreeTable<T, V, Id, K>>

where S: Res<V> + 'static, C: Res<R> + 'static, R: Deref<Target = [TreeTableColumn<T, Id, H, K>]> + Clone + 'static, H: Clone + View,

impl<Id, K> TreeTable<TreeNodeRow<Id>, Vec<TreeNodeRow<Id>>, Id, K>

where Id: Eq + Hash + Clone + Send + Sync + 'static, K: Eq + Hash + Clone + PartialEq + Send + Sync + 'static,

pub fn from_hierarchy<S, U, C, R, H>( cx: &mut Context, tree: S, columns: C, root_ids: impl Fn(&U) -> Vec<Id> + 'static, child_ids: impl Fn(&U, &Id) -> Vec<Id> + 'static, is_visible: impl Fn(&U, &Id) -> bool + 'static, ) -> Handle<'_, TreeTable<TreeNodeRow<Id>, Vec<TreeNodeRow<Id>>, Id, K>>

where S: Res<U> + 'static, U: Clone + 'static, C: Res<R> + 'static, R: Deref<Target = [TreeTableColumn<TreeNodeRow<Id>, Id, H, K>]> + Clone + 'static, H: Clone + View,

Creates a TreeTable directly from hierarchical data.

Provide closures to enumerate root node IDs and child node IDs for a given parent. The returned order is the order provided by those closures; filtering only removes invisible nodes and their descendants. The table manages expand/collapse state and internally projects IDs into TreeNodeRow values.

Trait Implementations

impl<T, V, Id, K> View for TreeTable<T, V, Id, K>

where V: Deref<Target = [T]> + Clone + 'static, T: PartialEq + Clone + 'static, Id: Eq + Hash + Clone + Send + Sync + 'static, K: Eq + Hash + Clone + PartialEq + Send + Sync + 'static,

fn element(&self) -> Option<&'static str>

Specifies a name for the view type which can be used as an element selector in css.

fn event(&mut self, cx: &mut EventContext<'_>, event: &mut Event)

Handles any events received by the view.

fn build<F>(self, cx: &mut Context, content: F) -> Handle<'_, Self>

where F: FnOnce(&mut Context),

Builds the view into the tree and returns a handle which can be used to apply style and layout modifiers to the view.

fn draw(&self, cx: &mut DrawContext<'_>, canvas: &Canvas)

Provides custom drawing for the view.

fn accessibility(&self, cx: &mut AccessContext<'_>, node: &mut AccessNode)

Provides a way to configure the accessibility features of a view.