Struct git2::Sort[−][src]

pub struct Sort { /* fields omitted */ }

Expand description

Orderings that may be specified for Revwalk iteration.

Implementations

`impl Sort`[src]

`pub const NONE: Sort`[src]

Sort the repository contents in no particular ordering.

This sorting is arbitrary, implementation-specific, and subject to change at any time. This is the default sorting for new walkers.

`pub const TOPOLOGICAL: Sort`[src]

Sort the repository contents in topological order (children before parents).

This sorting mode can be combined with time sorting.

`pub const TIME: Sort`[src]

Sort the repository contents by commit time.

This sorting mode can be combined with topological sorting.

`pub const REVERSE: Sort`[src]

Iterate through the repository contents in reverse order.

This sorting mode can be combined with any others.

`pub const fn empty() -> Sort`[src]

Returns an empty set of flags

`pub const fn all() -> Sort`[src]

Returns the set containing all flags.

`pub const fn bits(&self) -> u32`[src]

Returns the raw value of the flags currently stored.

`pub fn from_bits(bits: u32) -> Option<Sort>`[src]

Convert from underlying bit representation, unless that representation contains bits that do not correspond to a flag.

`pub const fn from_bits_truncate(bits: u32) -> Sort`[src]

Convert from underlying bit representation, dropping any bits that do not correspond to flags.

`pub const unsafe fn from_bits_unchecked(bits: u32) -> Sort`[src]

Convert from underlying bit representation, preserving all bits (even those not corresponding to a defined flag).

`pub const fn is_empty(&self) -> bool`[src]

Returns true if no flags are currently stored.

`pub const fn is_all(&self) -> bool`[src]

Returns true if all flags are currently set.

`pub const fn intersects(&self, other: Sort) -> bool`[src]

Returns true if there are flags common to both self and other.

`pub const fn contains(&self, other: Sort) -> bool`[src]

Returns true all of the flags in other are contained within self.

`pub fn insert(&mut self, other: Sort)`[src]

Inserts the specified flags in-place.

`pub fn remove(&mut self, other: Sort)`[src]

Removes the specified flags in-place.

`pub fn toggle(&mut self, other: Sort)`[src]

Toggles the specified flags in-place.

`pub fn set(&mut self, other: Sort, value: bool)`[src]

Inserts or removes the specified flags depending on the passed value.

`impl Sort`[src]

`pub fn is_none(&self) -> bool`[src]

`pub fn is_topological(&self) -> bool`[src]

`pub fn is_time(&self) -> bool`[src]

`pub fn is_reverse(&self) -> bool`[src]

Trait Implementations

`impl Binary for Sort`[src]

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

Formats the value using the given formatter.

`impl BitAnd<Sort> for Sort`[src]

`fn bitand(self, other: Sort) -> Sort`[src]

Returns the intersection between the two sets of flags.

`type Output = Sort`

The resulting type after applying the & operator.

`impl BitAndAssign<Sort> for Sort`[src]

`fn bitand_assign(&mut self, other: Sort)`[src]

Disables all flags disabled in the set.

`impl BitOr<Sort> for Sort`[src]

`fn bitor(self, other: Sort) -> Sort`[src]

Returns the union of the two sets of flags.

`type Output = Sort`

The resulting type after applying the | operator.

`impl BitOrAssign<Sort> for Sort`[src]

`fn bitor_assign(&mut self, other: Sort)`[src]

Adds the set of flags.

`impl BitXor<Sort> for Sort`[src]

`fn bitxor(self, other: Sort) -> Sort`[src]

Returns the left flags, but with all the right flags toggled.

`type Output = Sort`

The resulting type after applying the ^ operator.

`impl BitXorAssign<Sort> for Sort`[src]

`fn bitxor_assign(&mut self, other: Sort)`[src]

Toggles the set of flags.

`impl Clone for Sort`[src]

`fn clone(&self) -> Sort`[src]

Returns a copy of the value. Read more

`fn clone_from(&mut self, source: &Self)`1.0.0 [src]

Performs copy-assignment from source. Read more

`impl Debug for Sort`[src]

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

Formats the value using the given formatter. Read more

`impl Extend<Sort> for Sort`[src]

`fn extend<T: IntoIterator<Item = Sort>>(&mut self, iterator: T)`[src]

Extends a collection with the contents of an iterator. Read more

`fn extend_one(&mut self, item: A)`[src]

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

`fn extend_reserve(&mut self, additional: usize)`[src]

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements. Read more

`impl FromIterator<Sort> for Sort`[src]

`fn from_iter<T: IntoIterator<Item = Sort>>(iterator: T) -> Sort`[src]

Creates a value from an iterator. Read more

`impl Hash for Sort`[src]

`fn hash<H: Hasher>(&self, state: &mut H)`[src]

Feeds this value into the given Hasher. Read more

`fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher,` 1.3.0 [src]

Feeds a slice of this type into the given Hasher. Read more

`impl LowerHex for Sort`[src]

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

Formats the value using the given formatter.

`impl Not for Sort`[src]

`fn not(self) -> Sort`[src]

Returns the complement of this set of flags.

`type Output = Sort`

The resulting type after applying the ! operator.

`impl Octal for Sort`[src]

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

Formats the value using the given formatter.

`impl Ord for Sort`[src]

`fn cmp(&self, other: &Sort) -> Ordering`[src]

This method returns an Ordering between self and other. Read more

`#[must_use] fn max(self, other: Self) -> Self`1.21.0 [src]

Compares and returns the maximum of two values. Read more

`#[must_use] fn min(self, other: Self) -> Self`1.21.0 [src]

Compares and returns the minimum of two values. Read more

`#[must_use] fn clamp(self, min: Self, max: Self) -> Self`1.50.0 [src]

Restrict a value to a certain interval. Read more

`impl PartialEq<Sort> for Sort`[src]

`fn eq(&self, other: &Sort) -> bool`[src]

This method tests for self and other values to be equal, and is used by ==. Read more

`fn ne(&self, other: &Sort) -> bool`[src]

This method tests for !=.

`impl PartialOrd<Sort> for Sort`[src]

`fn partial_cmp(&self, other: &Sort) -> Option<Ordering>`[src]

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

`#[must_use] fn lt(&self, other: &Rhs) -> bool`1.0.0 [src]

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

`#[must_use] fn le(&self, other: &Rhs) -> bool`1.0.0 [src]

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

`#[must_use] fn gt(&self, other: &Rhs) -> bool`1.0.0 [src]

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

`#[must_use] fn ge(&self, other: &Rhs) -> bool`1.0.0 [src]

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

`impl Sub<Sort> for Sort`[src]

`fn sub(self, other: Sort) -> Sort`[src]

Returns the set difference of the two sets of flags.

`type Output = Sort`

The resulting type after applying the - operator.

`impl SubAssign<Sort> for Sort`[src]

`fn sub_assign(&mut self, other: Sort)`[src]

Disables all flags enabled in the set.

`impl UpperHex for Sort`[src]

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

Formats the value using the given formatter.

`impl Copy for Sort`[src]

`impl Eq for Sort`[src]

`impl StructuralEq for Sort`[src]

`impl StructuralPartialEq for Sort`[src]

Auto Trait Implementations

`impl RefUnwindSafe for Sort`

`impl Send for Sort`

`impl Sync for Sort`

`impl Unpin for Sort`

`impl UnwindSafe for Sort`

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

Gets the TypeId of self. Read more

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

Immutably borrows from an owned value. Read more

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

Mutably borrows from an owned value. Read more

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

Performs the conversion.

`impl<T, U> Into for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

Performs the conversion.

`impl<T> ToOwned for T where T: Clone,` [src]

`type Owned = T`

The resulting type after obtaining ownership.

`pub fn to_owned(&self) -> T`[src]

Creates owned data from borrowed data, usually by cloning. Read more

`pub fn clone_into(&self, target: &mut T)`[src]

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

`impl<T, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

`pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`[src]

Performs the conversion.

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`pub fn try_into(self) -> Result<U, >::Error>`[src]

Performs the conversion.

Struct git2::Sort[−][src]

Implementations

impl Sort[src]

pub const NONE: Sort[src]

pub const TOPOLOGICAL: Sort[src]

pub const TIME: Sort[src]

pub const REVERSE: Sort[src]

pub const fn empty() -> Sort[src]

pub const fn all() -> Sort[src]

pub const fn bits(&self) -> u32[src]

pub fn from_bits(bits: u32) -> Option<Sort>[src]

pub const fn from_bits_truncate(bits: u32) -> Sort[src]

pub const unsafe fn from_bits_unchecked(bits: u32) -> Sort[src]

pub const fn is_empty(&self) -> bool[src]

pub const fn is_all(&self) -> bool[src]

pub const fn intersects(&self, other: Sort) -> bool[src]

pub const fn contains(&self, other: Sort) -> bool[src]

pub fn insert(&mut self, other: Sort)[src]

pub fn remove(&mut self, other: Sort)[src]

pub fn toggle(&mut self, other: Sort)[src]

pub fn set(&mut self, other: Sort, value: bool)[src]

impl Sort[src]

pub fn is_none(&self) -> bool[src]

pub fn is_topological(&self) -> bool[src]

pub fn is_time(&self) -> bool[src]

pub fn is_reverse(&self) -> bool[src]

Trait Implementations

impl Binary for Sort[src]

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

impl BitAnd<Sort> for Sort[src]

fn bitand(self, other: Sort) -> Sort[src]

type Output = Sort

impl BitAndAssign<Sort> for Sort[src]

fn bitand_assign(&mut self, other: Sort)[src]

impl BitOr<Sort> for Sort[src]

fn bitor(self, other: Sort) -> Sort[src]

type Output = Sort

impl BitOrAssign<Sort> for Sort[src]

fn bitor_assign(&mut self, other: Sort)[src]

impl BitXor<Sort> for Sort[src]

fn bitxor(self, other: Sort) -> Sort[src]

type Output = Sort

impl BitXorAssign<Sort> for Sort[src]

fn bitxor_assign(&mut self, other: Sort)[src]

impl Clone for Sort[src]

fn clone(&self) -> Sort[src]

fn clone_from(&mut self, source: &Self)1.0.0[src]

impl Debug for Sort[src]

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

impl Extend<Sort> for Sort[src]

fn extend<T: IntoIterator<Item = Sort>>(&mut self, iterator: T)[src]

fn extend_one(&mut self, item: A)[src]

fn extend_reserve(&mut self, additional: usize)[src]

impl FromIterator<Sort> for Sort[src]

fn from_iter<T: IntoIterator<Item = Sort>>(iterator: T) -> Sort[src]

impl Hash for Sort[src]

fn hash<__H: Hasher>(&self, state: &mut __H)[src]

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher, 1.3.0[src]

impl LowerHex for Sort[src]

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

impl Not for Sort[src]

fn not(self) -> Sort[src]

type Output = Sort

impl Octal for Sort[src]

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

impl Ord for Sort[src]

fn cmp(&self, other: &Sort) -> Ordering[src]

#[must_use]fn max(self, other: Self) -> Self1.21.0[src]

#[must_use]fn min(self, other: Self) -> Self1.21.0[src]

#[must_use]fn clamp(self, min: Self, max: Self) -> Self1.50.0[src]

impl PartialEq<Sort> for Sort[src]

fn eq(&self, other: &Sort) -> bool[src]

fn ne(&self, other: &Sort) -> bool[src]

impl PartialOrd<Sort> for Sort[src]

fn partial_cmp(&self, other: &Sort) -> Option<Ordering>[src]

#[must_use]fn lt(&self, other: &Rhs) -> bool1.0.0[src]

#[must_use]fn le(&self, other: &Rhs) -> bool1.0.0[src]

#[must_use]fn gt(&self, other: &Rhs) -> bool1.0.0[src]

#[must_use]fn ge(&self, other: &Rhs) -> bool1.0.0[src]

impl Sub<Sort> for Sort[src]

`impl Sort`[src]

`pub const NONE: Sort`[src]

`pub const TOPOLOGICAL: Sort`[src]

`pub const TIME: Sort`[src]

`pub const REVERSE: Sort`[src]

`pub const fn empty() -> Sort`[src]

`pub const fn all() -> Sort`[src]

`pub const fn bits(&self) -> u32`[src]

`pub fn from_bits(bits: u32) -> Option<Sort>`[src]

`pub const fn from_bits_truncate(bits: u32) -> Sort`[src]

`pub const unsafe fn from_bits_unchecked(bits: u32) -> Sort`[src]

`pub const fn is_empty(&self) -> bool`[src]

`pub const fn is_all(&self) -> bool`[src]

`pub const fn intersects(&self, other: Sort) -> bool`[src]

`pub const fn contains(&self, other: Sort) -> bool`[src]

`pub fn insert(&mut self, other: Sort)`[src]

`pub fn remove(&mut self, other: Sort)`[src]

`pub fn toggle(&mut self, other: Sort)`[src]

`pub fn set(&mut self, other: Sort, value: bool)`[src]

`impl Sort`[src]

`pub fn is_none(&self) -> bool`[src]

`pub fn is_topological(&self) -> bool`[src]

`pub fn is_time(&self) -> bool`[src]

`pub fn is_reverse(&self) -> bool`[src]

`impl Binary for Sort`[src]

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

`impl BitAnd<Sort> for Sort`[src]

`fn bitand(self, other: Sort) -> Sort`[src]

`type Output = Sort`

`impl BitAndAssign<Sort> for Sort`[src]

`fn bitand_assign(&mut self, other: Sort)`[src]

`impl BitOr<Sort> for Sort`[src]

`fn bitor(self, other: Sort) -> Sort`[src]

`type Output = Sort`

`impl BitOrAssign<Sort> for Sort`[src]

`fn bitor_assign(&mut self, other: Sort)`[src]

`impl BitXor<Sort> for Sort`[src]

`fn bitxor(self, other: Sort) -> Sort`[src]

`type Output = Sort`

`impl BitXorAssign<Sort> for Sort`[src]

`fn bitxor_assign(&mut self, other: Sort)`[src]

`impl Clone for Sort`[src]

`fn clone(&self) -> Sort`[src]

`fn clone_from(&mut self, source: &Self)`1.0.0 [src]

`impl Debug for Sort`[src]

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

`impl Extend<Sort> for Sort`[src]

`fn extend<T: IntoIterator<Item = Sort>>(&mut self, iterator: T)`[src]

`fn extend_one(&mut self, item: A)`[src]

`fn extend_reserve(&mut self, additional: usize)`[src]

`impl FromIterator<Sort> for Sort`[src]

`fn from_iter<T: IntoIterator<Item = Sort>>(iterator: T) -> Sort`[src]

`impl Hash for Sort`[src]

`fn hash<H: Hasher>(&self, state: &mut H)`[src]

`fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher,` 1.3.0 [src]

`impl LowerHex for Sort`[src]

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

`impl Not for Sort`[src]

`fn not(self) -> Sort`[src]

`type Output = Sort`

`impl Octal for Sort`[src]

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

`impl Ord for Sort`[src]

`fn cmp(&self, other: &Sort) -> Ordering`[src]

`#[must_use] fn max(self, other: Self) -> Self`1.21.0 [src]

`#[must_use] fn min(self, other: Self) -> Self`1.21.0 [src]

`#[must_use] fn clamp(self, min: Self, max: Self) -> Self`1.50.0 [src]

`impl PartialEq<Sort> for Sort`[src]

`fn eq(&self, other: &Sort) -> bool`[src]

`fn ne(&self, other: &Sort) -> bool`[src]

`impl PartialOrd<Sort> for Sort`[src]

`fn partial_cmp(&self, other: &Sort) -> Option<Ordering>`[src]

`#[must_use] fn lt(&self, other: &Rhs) -> bool`1.0.0 [src]

`#[must_use] fn le(&self, other: &Rhs) -> bool`1.0.0 [src]

`#[must_use] fn gt(&self, other: &Rhs) -> bool`1.0.0 [src]

`#[must_use] fn ge(&self, other: &Rhs) -> bool`1.0.0 [src]

`impl Sub<Sort> for Sort`[src]

`fn sub(self, other: Sort) -> Sort`[src]

`type Output = Sort`

`impl SubAssign<Sort> for Sort`[src]