Struct evosim::blob::geno_blob_builder::QuadTree

pub struct QuadTree<T> {
    pub nodes: Vec<Option<T>>,
    pub max_depth: u32,
}

QuadTree, Helper struct

Fields

nodes: Vec<Option<T>>

max_depth: u32

Implementations

impl<T> QuadTree<T>

pub fn new(max_depth: u32) -> Self

pub fn parent(&self, index: usize) -> Option<usize>

pub fn children(&self, index: usize) -> [usize; 4]

pub fn depth(&self, index: usize) -> u32

pub fn is_leaf(&self, index: usize) -> bool

pub fn clean_subtree(&mut self, index: usize)

pub fn clean_subtree_without_self(&mut self, index: usize)

pub fn branch_nodes(&self) -> Vec<usize>

all nodes have at least one none child, using for mutate to gain limb

pub fn subtree_indices(&self, index: usize) -> Vec<usize>

all the not-None indices of the subtree

pub fn child_direction(&self, index: usize) -> Option<usize>

pub fn is_empty(&self, index: usize) -> bool

pub fn tree_edit_distance(&self, other: &QuadTree<T>) -> usize

Calculates the Tree Edit Distance (TED) between two QuadTrees.

The Tree Edit Distance is a measure of the similarity between two trees, defined as the minimum cost sequence of node deletions, insertions, and substitutions that transform one tree into the other. This function uses dynamic programming to efficiently compute the TED between the current tree and another.

Parameters

• other: A reference to the other QuadTree with which the edit distance is to be calculated.

Returns

Returns a usize representing the Tree Edit Distance between the two trees.

Examples

let tree1 = QuadTree::new(...);
let tree2 = QuadTree::new(...);
let distance = tree1.tree_edit_distance(&tree2);

fn _tree_edit_distance( &self, i: usize, j: usize, other: &QuadTree<T>, dp: &mut Vec<Vec<Option<usize>>> ) -> usize

Trait Implementations

impl<T: Clone> Clone for QuadTree<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for QuadTree<T>

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

tree structure debug info

impl<'de, T> Deserialize<'de> for QuadTree<T>where T: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Serialize for QuadTree<T>where T: Serialize,

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

Serialize this value into the given Serde serializer.