Enum ListOrdering 

pub enum ListOrdering {
    Ordered,
    Unordered,
}

Ordering semantics for list nodes, per LASTMERGE/JDime. Unordered lists (e.g., import blocks, class members) can be freely permuted without changing program semantics, enabling better conflict resolution.

Variants

Ordered

Unordered

Trait Implementations

impl Clone for ListOrdering

fn clone(&self) -> ListOrdering

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ListOrdering

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

Formats the value using the given formatter.

impl Hash for ListOrdering

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ListOrdering

fn eq(&self, other: &ListOrdering) -> 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 ListOrdering

impl Eq for ListOrdering

impl StructuralPartialEq for ListOrdering