Struct gix_object::tree::EntryRef

pub struct EntryRef<'a> {
    pub mode: EntryMode,
    pub filename: &'a BStr,
    pub oid: &'a oid,
}

An element of a TreeRef.

Fields

mode: EntryMode

The kind of object to which oid is pointing.

filename: &'a BStr

The name of the file in the parent tree.

oid: &'a oid

The id of the object representing the entry.

Trait Implementations

impl<'a> Clone for EntryRef<'a>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for EntryRef<'a>

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

Formats the value using the given formatter.

impl<'de: 'a, 'a> Deserialize<'de> for EntryRef<'a>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<EntryRef<'_>> for Entry

fn from(other: EntryRef<'_>) -> Entry

Converts to this type from the input type.

impl<'a> Hash for EntryRef<'a>

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<'a> Ord for EntryRef<'a>

fn cmp(&self, other: &Self) -> Ordering

Entries compare by the common portion of the filename. This is critical for proper functioning of algorithms working on trees. Doing it like this is needed for compatibility with older, potentially broken(?) trees.

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<EntryRef<'a>> for EntryRef<'a>

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

fn partial_cmp(&self, other: &Self) -> 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> Serialize for EntryRef<'a>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<'a> Eq for EntryRef<'a>

impl<'a> StructuralEq for EntryRef<'a>

impl<'a> StructuralPartialEq for EntryRef<'a>