Struct jj_lib::tree::Tree

pub struct Tree { /* private fields */ }

Implementations

impl Tree

pub fn new( store: Arc<Store>, dir: RepoPath, id: TreeId, data: Arc<Tree> ) -> Self

pub fn null(store: Arc<Store>, dir: RepoPath) -> Self

pub fn store(&self) -> &Arc<Store>

pub fn dir(&self) -> &RepoPath

pub fn id(&self) -> &TreeId

pub fn data(&self) -> &Tree

pub fn entries_non_recursive(&self) -> TreeEntriesNonRecursiveIterator<'_>

pub fn entries(&self) -> TreeEntriesIterator<'static>

pub fn entries_matching<'matcher>( &self, matcher: &'matcher dyn Matcher ) -> TreeEntriesIterator<'matcher>

pub fn entry(&self, basename: &RepoPathComponent) -> Option<TreeEntry<'_>>

pub fn value(&self, basename: &RepoPathComponent) -> Option<&TreeValue>

pub fn path_value(&self, path: &RepoPath) -> Option<TreeValue>

pub fn sub_tree(&self, name: &RepoPathComponent) -> Option<Tree>

pub fn conflicts_matching( &self, matcher: &dyn Matcher ) -> Vec<(RepoPath, ConflictId)>

pub fn conflicts(&self) -> Vec<(RepoPath, ConflictId)>

pub fn has_conflict(&self) -> bool

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Tree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Tree

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

Formats the value using the given formatter.

impl Hash for Tree

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<Tree> for Tree

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Tree