Enum gix_status::index_as_worktree::EntryStatus

pub enum EntryStatus<T = (), U = ()> {
    Conflict(Conflict),
    Change(Change<T, U>),
    NeedsUpdate(Stat),
    IntentToAdd,
}

Information about an entry.

Variants

Conflict(Conflict)

The entry is in a conflicting state, and we didn’t collect any more information about it.

Change(Change<T, U>)

There is no conflict and a change was discovered.

NeedsUpdate(Stat)

The entry didn’t change, but its state caused extra work that can be avoided next time if its stats would be updated to the given stat.

Tuple Fields

0: Stat

The new stats which represent what’s currently in the working tree. If these replace the current stats in the entry, next time this operation runs we can determine the actual state much faster.

IntentToAdd

An index entry that corresponds to an untracked worktree file marked with git add --intent-to-add.

This means it’s not available in the object database yet even though now an entry exists that represents the worktree file. The entry represents the promise of adding a new file, no matter the actual stat or content. Effectively this means nothing changed. This also means the file is still present, and that no detailed change checks were performed.

Trait Implementations

impl<T: Clone, U: Clone> Clone for EntryStatus<T, U>

fn clone(&self) -> EntryStatus<T, U>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, U: Debug> Debug for EntryStatus<T, U>

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

Formats the value using the given formatter.

impl<T, U> From<Change<T, U>> for EntryStatus<T, U>

fn from(value: Change<T, U>) -> Self

Converts to this type from the input type.

impl<T: Ord, U: Ord> Ord for EntryStatus<T, U>

fn cmp(&self, other: &EntryStatus<T, U>) -> Ordering

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<T: PartialEq, U: PartialEq> PartialEq for EntryStatus<T, U>

fn eq(&self, other: &EntryStatus<T, U>) -> 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<T: PartialOrd, U: PartialOrd> PartialOrd for EntryStatus<T, U>

fn partial_cmp(&self, other: &EntryStatus<T, U>) -> 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<T: Eq, U: Eq> Eq for EntryStatus<T, U>

impl<T, U> StructuralPartialEq for EntryStatus<T, U>