Type Alias DiffTree 

pub type DiffTree<N, B> = Tree<DiffNode<N>, B>;

A tree containing DiffNodes as nodes

Aliased Type

pub struct DiffTree<N, B> { /* private fields */ }

Implementations

impl<N, B> DiffTree<N, B>

where B: Clone,

pub fn rev(&mut self)

pub fn validate(&self) -> Result<(), Path<B>>

impl<N, B> DiffTree<N, B>

where N: Clone, B: Clone + Eq + Hash,

pub fn mirror_subtree_rec( &mut self, tree: &Tree<N, B>, idx_s: usize, idx_t: usize, now: bool, )

impl<N, B> DiffTree<N, B>

where N: Clone + Default, B: Clone + Eq + Hash + Default,

pub fn mirror_subtree(&mut self, tree: &Tree<N, B>, path: &Path<B>, now: bool)

impl<N, B> DiffTree<N, B>

where N: Default + Eq, B: Default + Eq + Hash + Clone,

pub fn is_applicable_extend( &self, tree: &Tree<N, B>, ) -> Result<(), DiffApplyError<B>>

impl<N, B> DiffTree<N, B>

where N: Eq, B: Eq + Hash + Clone,

pub fn is_applicable(&self, tree: &Tree<N, B>) -> Result<(), DiffApplyError<B>>

Trait Implementations

impl<N, B> From<DiffMap<N, B>> for DiffTree<N, B>

where N: Ord, B: Ord + Default + Hash + Clone,

fn from(value: DiffMap<N, B>) -> Self

Converts to this type from the input type.