pub enum Sorting {
DateOrder,
TopoOrder,
}
Expand description
Sorting to use for the topological walk.
§Sample History
The following history will be referred to for explaining how the sort order works, with the number denoting the commit timestamp (their X-alignment doesn’t matter).
---1----2----4----7 <- second parent of 8
\ \
3----5----6----8---
Variants§
DateOrder
Show no parents before all of its children are shown, but otherwise show commits in the commit timestamp order.
This is equivalent to git rev-list --date-order
.
TopoOrder
Show no parents before all of its children are shown, and avoid showing commits on multiple lines of history intermixed.
In the sample history the order would be 8, 6, 5, 3, 7, 4, 2, 1
.
This is equivalent to git rev-list --topo-order
.
Trait Implementations§
impl Copy for Sorting
Auto Trait Implementations§
impl Freeze for Sorting
impl RefUnwindSafe for Sorting
impl Send for Sorting
impl Sync for Sorting
impl Unpin for Sorting
impl UnwindSafe for Sorting
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)