Struct TreeNode 

pub struct TreeNode {
    pub children: Option<Vec<TreeNode>>,
    pub session: Option<Box<SessionView>>,
}

Fields

children: Option<Vec<TreeNode>>

Children is this node’s direct children, each a whole node, so the array nests to the depth of the flow. A leaf carries null rather than an empty array. The subtree is materialised in full, up to 10000 nodes, out of one indexed read of the root; nothing is walked node by node.

session: Option<Box<SessionView>>

Session is this node’s own session, carrying its event count and its direct fan-out. It is the same shape the list and detail reads answer with, minus the last-event preview, which the tree does not fetch.

Implementations

impl TreeNode

pub fn new() -> TreeNode

Trait Implementations

impl Clone for TreeNode

fn clone(&self) -> TreeNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeNode

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

Formats the value using the given formatter.

impl Default for TreeNode

fn default() -> TreeNode

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for TreeNode

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for TreeNode

fn eq(&self, other: &TreeNode) -> bool

Equality operator ==.

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

Inequality operator !=.

impl Serialize for TreeNode

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for TreeNode