Struct rolldown_common::EnaKey

pub struct EnaKey(_);

Trait Implementations

impl Clone for EnaKey

fn clone(&self) -> EnaKey

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for EnaKey

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

Formats the value using the given formatter.

impl Hash for EnaKey

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<EnaKey> for EnaKey

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl UnifyKey for EnaKey

type Value = ()

fn index(&self) -> u32

fn from_index(u: u32) -> Self

fn tag() -> &'static str

fn order_roots( a: Self, a_value: &Self::Value, b: Self, b_value: &Self::Value ) -> Option<(Self, Self)>

If true, then self should be preferred as root to other. Note that we assume a consistent partial ordering, so returning true implies that other.prefer_as_root_to(self) would return false. If there is no ordering between two keys (i.e., a.prefer_as_root_to(b) and b.prefer_as_root_to(a) both return false) then the rank will be used to determine the root in an optimal way.

impl Copy for EnaKey

impl Eq for EnaKey

impl StructuralEq for EnaKey

impl StructuralPartialEq for EnaKey