Enum NodeKind 

pub enum NodeKind {
    Module,
    Type,
    Member,
    Case,
    Enumerator,
    BitValue,
    Bitfield,
    Const,
    ConstExpr,
    Interface,
    Operation,
    Param,
    Attribute,
    Exception,
    AnnotationDef,
    AnnotationMember,
    Domain,
    Topic,
    QosProfile,
    Participant,
    Endpoint,
    Library,
}

Every kind of node the model holds. Spec §3.

Exhaustive on purpose. An adapter presenting the model to another system has to name every kind; with a catch-all arm a kind added here would become a construct that system can never see, and nothing would say so. Adding a variant is a compile error at every such consumer, which is the point.

Variants

Module

A namespace. Spec §3.1.

Type

A named type. Spec §3.2.

Member

A field of an aggregate. Spec §3.3.

Case

One case of a union. Spec §3.3.

Enumerator

One enumerator. Spec §3.3.

BitValue

One bitmask bit. Spec §3.3.

Bitfield

One bitset field. Spec §3.3.

Const

A named constant. Spec §3.5.

ConstExpr

One node of a constant expression tree. Spec §3.5.

Interface

An interface or component form. Spec §3.4.

Operation

An operation. Spec §3.4.

Param

An operation parameter. Spec §3.4.

Attribute

An interface attribute. Spec §3.4.

Exception

An exception. Spec §3.4.

AnnotationDef

An @annotation declaration. Spec §3.6.

AnnotationMember

A member of an annotation declaration. Spec §3.6.

Domain

A DDS domain. Spec §3.7.

Topic

A topic. Spec §3.7.

QosProfile

A QoS profile. Spec §3.7.

Participant

A domain participant. Spec §3.7.

Endpoint

A reader or writer endpoint. Spec §3.7.

Library

A deployment library. Spec §3.7.

Implementations

impl NodeKind

pub const ALL: [Self; 22]

Every kind, in tag order. Lets a conformance test assert that the tag mapping is total and collision-free.

pub const fn tag(self) -> NodeKindTag

Wire tag for changesets and snapshots.

pub const fn from_tag(tag: NodeKindTag) -> Option<Self>

Inverse of NodeKind::tag.

pub const fn as_str(self) -> &'static str

Short name, for diagnostics and BreakCause::KindMismatch.

Trait Implementations

impl Clone for NodeKind

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for NodeKind

impl Debug for NodeKind

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

Formats the value using the given formatter.

impl Eq for NodeKind

impl Hash for NodeKind

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 Ord for NodeKind

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl PartialEq for NodeKind

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for NodeKind

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for NodeKind