Enum gix_negotiate::Algorithm

pub enum Algorithm {
    Noop,
    Consecutive,
    Skipping,
}

The way the negotiation is performed.

Variants

Noop

Do not send any information at all, which typically leads to complete packs to be sent.

Consecutive

Walk over consecutive commits and check each one. This can be costly be assures packs are exactly the size they need to be.

Skipping

Like Consecutive, but skips commits to converge faster, at the cost of receiving packs that are larger than they have to be.

Implementations

impl Algorithm

pub fn into_negotiator(self) -> Box<dyn Negotiator>

Create an instance of a negotiator which implements this algorithm.

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl Default for Algorithm

fn default() -> Algorithm

Returns the “default value” for a type.

impl Display for Algorithm

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

Formats the value using the given formatter.

impl PartialEq for Algorithm

fn eq(&self, other: &Algorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Algorithm

impl Eq for Algorithm

impl StructuralPartialEq for Algorithm