Struct git_repository::Tree

pub struct Tree<'repo> {
    pub id: ObjectId,
    pub data: Vec<u8>,
    /* private fields */
}

A decoded tree object with access to its owning repository.

Fields

id: ObjectId

The id of the tree

data: Vec<u8>

The fully decoded tree data

Implementations

impl<'repo> Tree<'repo>

pub fn iter(&self) -> impl Iterator<Item = Result<EntryRef<'repo, '_>, Error>>

Return an iterator over tree entries.

impl<'repo> Tree<'repo>

Initialization

pub fn from_data(
    id: impl Into<ObjectId>,
    data: Vec<u8>,
    repo: &'repo Repository
) -> Self

Obtain a tree instance by handing in all components that it is made up of.

impl<'repo> Tree<'repo>

Access

pub fn id(&self) -> Id<'repo>

Return this tree’s identifier.

pub fn lookup_path<I, P>(self, path: I) -> Result<Option<Entry>, Error<Error>> where
    I: IntoIterator<Item = P>,
    P: PartialEq<BStr>, 

Follow a sequence of path components starting from this instance, and look them up one by one until the last component is looked up and its tree entry is returned.

Performance Notes

Searching tree entries is currently done in sequence, which allows to the search to be allocation free. It would be possible to re-use a vector and use a binary search instead, which might be able to improve performance over all. However, a benchmark should be created first to have some data and see which trade-off to choose here.

pub fn traverse(&self) -> Traversal<'_, 'repo>

Obtain a platform for initiating a variety of traversals.

Trait Implementations

impl<'r> Debug for Tree<'r>

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

Formats the value using the given formatter.

impl<'a> Drop for Tree<'a>

fn drop(&mut self)

Executes the destructor for this type.

impl<'repo> TryFrom<Object<'repo>> for Tree<'repo>

type Error = Object<'repo>

The type returned in the event of a conversion error.

fn try_from(value: Object<'repo>) -> Result<Self, Self::Error>

Performs the conversion.