Struct Tree 

pub struct Tree<'a> { /* private fields */ }

A structurally valid tree, including Git ordering and unique byte names. Validation uses constant storage. File/directory aliases can be separated by other names in Git order, so checking them may reread earlier entries. Every read, including these rescans, consumes an encoded-byte work budget.

Implementations

impl<'a> Tree<'a>

pub fn parse(data: &'a [u8]) -> Result<Tree<'a>, Error>

Validate using a 64 MiB encoded-byte work budget. Hosts importing multiple trees can share a different budget through parse_with_budget.

pub fn parse_with_format( data: &'a [u8], format: ObjectFormat, ) -> Result<Tree<'a>, Error>

pub fn parse_with_budget( data: &'a [u8], budget: &mut u64, ) -> Result<Tree<'a>, Error>

Charge encoded bytes read, including duplicate-name rescans, against a caller-owned budget. LimitExceeded stops before reading beyond it. Budget already spent is retained on error; the tree remains borrowed/immutable.

pub fn parse_with_budget_and_format( data: &'a [u8], budget: &mut u64, format: ObjectFormat, ) -> Result<Tree<'a>, Error>

pub fn entries(&self) -> TreeEntries<'a>

Trait Implementations

impl<'a> Clone for Tree<'a>

fn clone(&self) -> Tree<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Copy for Tree<'a>

impl<'a> Debug for Tree<'a>

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

Formats the value using the given formatter.