Enum SortCtor

pub enum SortCtor {
    Set,
    Map,
    Adt(AdtSortDef),
    User {
        name: Symbol,
    },
}

Variants

Set

Map

Adt(AdtSortDef)

User

Fields

name: Symbol

Trait Implementations

impl Clone for SortCtor

fn clone(&self) -> SortCtor

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SortCtor

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

Formats the value using the given formatter.

impl<__D: TyDecoder> Decodable<__D> for SortCtor

fn decode(__decoder: &mut __D) -> Self

impl<__E: TyEncoder> Encodable<__E> for SortCtor

fn encode(&self, __encoder: &mut __E)

impl Hash for SortCtor

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 SortCtor

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

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

fn default_cx(tcx: TyCtxt<'_>) -> PrettyCx<'_>

impl Eq for SortCtor

impl StructuralPartialEq for SortCtor