Struct git_repository::Tree

source · [−]

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

Expand description

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

source

impl<'repo> Tree<'repo>

Diffing

source

pub fn changes<'a>(&'a self) -> Platform<'a, 'repo>

Return a platform to see the changes needed to create other trees, for instance.

Performance

It’s highly recommended to set an object cache to avoid extracting the same object multiple times.

source

impl<'repo> Tree<'repo>

Traversal

source

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

Obtain a platform for initiating a variety of traversals.

source

impl<'repo> Tree<'repo>

source

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

Return an iterator over tree entries.

source

impl<'repo> Tree<'repo>

Initialization

source

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.

source

impl<'repo> Tree<'repo>

Access

source

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

Return this tree’s identifier.

source

pub fn lookup_entry<I, P>(self, path: I) -> Result<Option<Entry>, 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.

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.

Why is this consunming?

The borrow checker shows pathological behaviour in loops that mutate a buffer, but also want to return from it. Workarounds include keeping an index and doing a separate access to the memory, which seems hard to do here without re-parsing the entries.

source

pub fn lookup_entry_by_path(
self,
relative_path: impl AsRef<Path>
) -> Result<Option<Entry>, Error>

Like lookup_entry(), but takes a Path directly via relative_path, a path relative to this tree.

Note

If any path component contains illformed UTF-8 and thus can’t be converted to bytes on platforms which can’t do so natively, the returned component will be empty which makes the lookup fail.