Struct TreeIdsAndLabels 

pub struct TreeIdsAndLabels {
    pub tree_ids: Merge<TreeId>,
    pub labels: ConflictLabels,
}

A MergedTree, without the Arc<Store>. That allows us to derive Eq and Hash for it, which we need in some algorithms.

Fields

tree_ids: Merge<TreeId>

The tree IDs of the merged tree.

labels: ConflictLabels

Conflict labels of the merged tree.

Implementations

impl TreeIdsAndLabels

pub fn new(merged_tree: MergedTree) -> Self

Creates a new TreeIdsAndLabels.

pub fn to_merged_tree(&self, store: &Arc<Store>) -> MergedTree

Converts the TreeIdsAndLabels into a MergedTree.

Trait Implementations

impl Clone for TreeIdsAndLabels

fn clone(&self) -> TreeIdsAndLabels

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeIdsAndLabels

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

Formats the value using the given formatter.

impl Eq for TreeIdsAndLabels

impl Hash for TreeIdsAndLabels

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for TreeIdsAndLabels

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for TreeIdsAndLabels