pub enum Order {
ImplementationDefined,
AsInCratesIndex,
}
Expand description
The order we maintain for the produced changes.
Variants§
ImplementationDefined
Compare provided trees or commits without applying any other logic, with the order being influenced by factors like hashmaps.
The benefit is mode is the optimal performance as only one diff is created.
AsInCratesIndex
If the provided revisions are commits, single step through the history that connects them to maintain the order in which changes were submitted to the crates-index for all user-defined changes.
Admin changes are still implementation defined, but typically involve only deletions.
The shortcomings of this approach is that each pair of commits has to be diffed individually, increasing the amount of work linearly.
Trait Implementations§
impl Copy for Order
impl Eq for Order
impl StructuralPartialEq for Order
Auto Trait Implementations§
impl Freeze for Order
impl RefUnwindSafe for Order
impl Send for Order
impl Sync for Order
impl Unpin for Order
impl UnwindSafe for Order
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§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.