Struct git2::TreeEntry

pub struct TreeEntry<'tree> { /* private fields */ }

A structure representing an entry inside of a tree. An entry is borrowed from a tree.

Implementations

impl<'tree> TreeEntry<'tree>

pub fn id(&self) -> Oid

Get the id of the object pointed by the entry

pub fn name(&self) -> Option<&str>

Get the filename of a tree entry

Returns None if the name is not valid utf-8

pub fn name_bytes(&self) -> &[u8]

Get the filename of a tree entry

pub fn to_object<'a>(&self, repo: &'a Repository) -> Result<Object<'a>, Error>

Convert a tree entry to the object it points to.

pub fn kind(&self) -> Option<ObjectType>

Get the type of the object pointed by the entry

pub fn filemode(&self) -> i32

Get the UNIX file attributes of a tree entry

pub fn filemode_raw(&self) -> i32

Get the raw UNIX file attributes of a tree entry

pub fn to_owned(&self) -> TreeEntry<'static>

Convert this entry of any lifetime into an owned signature with a static lifetime.

This will use the Clone::clone implementation under the hood.

Trait Implementations

impl<'a> Clone for TreeEntry<'a>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a> Drop for TreeEntry<'a>

fn drop(&mut self)

Executes the destructor for this type.

impl<'a> Ord for TreeEntry<'a>

fn cmp(&self, other: &TreeEntry<'a>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<'a> PartialEq<TreeEntry<'a>> for TreeEntry<'a>

fn eq(&self, other: &TreeEntry<'a>) -> 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<'a> PartialOrd<TreeEntry<'a>> for TreeEntry<'a>

fn partial_cmp(&self, other: &TreeEntry<'a>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a> Eq for TreeEntry<'a>