pub struct MoveCommitsStats {
pub num_rebased_targets: u32,
pub num_rebased_descendants: u32,
pub num_skipped_rebases: u32,
pub num_abandoned_empty: u32,
pub rebased_commits: HashMap<CommitId, RebasedCommit>,
}Fields§
§num_rebased_targets: u32The number of commits in the target set which were rebased.
num_rebased_descendants: u32The number of descendant commits which were rebased.
num_skipped_rebases: u32The number of commits for which rebase was skipped, due to the commit already being in place.
num_abandoned_empty: u32The number of commits which were abandoned due to being empty.
rebased_commits: HashMap<CommitId, RebasedCommit>The rebased commits
Auto Trait Implementations§
impl Freeze for MoveCommitsStats
impl !RefUnwindSafe for MoveCommitsStats
impl Send for MoveCommitsStats
impl Sync for MoveCommitsStats
impl Unpin for MoveCommitsStats
impl !UnwindSafe for MoveCommitsStats
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more