Struct re_viewer_context::query_context::DataResultTree

pub struct DataResultTree {
    data_results: SlotMap<DataResultHandle, DataResultNode>,
    data_results_by_path: HashMap<EntityPathHash, DataResultHandle>,
    root_handle: Option<DataResultHandle>,
}

A hierarchical tree of DataResults

Fields

data_results: SlotMap<DataResultHandle, DataResultNode>

data_results_by_path: HashMap<EntityPathHash, DataResultHandle>

root_handle: Option<DataResultHandle>

Implementations

impl DataResultTree

pub fn new( data_results: SlotMap<DataResultHandle, DataResultNode>, root_handle: Option<DataResultHandle>, ) -> Self

pub fn root_handle(&self) -> Option<DataResultHandle>

pub fn root_node(&self) -> Option<&DataResultNode>

pub fn visit<'a>(&'a self, visitor: &mut impl FnMut(&'a DataResultNode) -> bool)

Depth-first traversal of the tree, calling visitor on each result.

Stops traversing a branch if visitor returns false.

pub fn visit_from_node<'a>( &'a self, node: &DataResultNode, visitor: &mut impl FnMut(&'a DataResultNode) -> bool, )

Depth-first traversal of the tree, calling visitor on each result, starting from a specific node.

Stops traversing a branch if visitor returns false.

pub fn find_node_by( &self, starting_node: Option<&DataResultNode>, predicate: impl Fn(&DataResultNode) -> bool, ) -> Option<&DataResultNode>

Depth-first search of a node based on the provided predicate.

If a staring_node is provided, the search starts at that node. Otherwise, it starts at the root node.

pub fn lookup_result(&self, handle: DataResultHandle) -> Option<&DataResult>

Look up a DataResult in the tree based on its handle.

pub fn lookup_node(&self, handle: DataResultHandle) -> Option<&DataResultNode>

Look up a DataResultNode in the tree based on its handle.

pub fn lookup_node_mut( &mut self, handle: DataResultHandle, ) -> Option<&mut DataResultNode>

Look up a DataResultNode in the tree based on its handle.

pub fn lookup_node_by_path(&self, path: &EntityPath) -> Option<&DataResultNode>

Look up a DataResultNode in the tree based on an EntityPath.

pub fn lookup_result_by_path(&self, path: &EntityPath) -> Option<&DataResult>

Look up a DataResult in the tree based on an EntityPath.

pub fn is_empty(&self) -> bool

fn visit_recursive<'a>( &'a self, handle: DataResultHandle, visitor: &mut impl FnMut(&'a DataResultNode) -> bool, )

Trait Implementations

impl Clone for DataResultTree

fn clone(&self) -> DataResultTree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DataResultTree

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

Formats the value using the given formatter.

impl Default for DataResultTree

fn default() -> DataResultTree

Returns the “default value” for a type.