Struct AstNodeForm 

pub struct AstNodeForm {
    pub id: NodeId,
    pub kind: AstNodeKind,
}

One AST node in the graph.

Fields

id: NodeId

kind: AstNodeKind

Trait Implementations

impl Archive for AstNodeForm

where NodeId: Archive, AstNodeKind: Archive,

const COPY_OPTIMIZATION: CopyOptimization<Self>

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

type Archived = ArchivedAstNodeForm

The archived representation of this type.

type Resolver = AstNodeFormResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

impl Clone for AstNodeForm

fn clone(&self) -> AstNodeForm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AstNodeForm

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for AstNodeForm

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<__D: Fallible + ?Sized> Deserialize<AstNodeForm, __D> for Archived<AstNodeForm>

where NodeId: Archive, <NodeId as Archive>::Archived: Deserialize<NodeId, __D>, AstNodeKind: Archive, <AstNodeKind as Archive>::Archived: Deserialize<AstNodeKind, __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<AstNodeForm, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl PartialEq for AstNodeForm

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<__S: Fallible + ?Sized> Serialize<__S> for AstNodeForm

where NodeId: Serialize<__S>, AstNodeKind: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl StructuralPartialEq for AstNodeForm

impl TataraDomain for AstNodeForm

const KEYWORD: &'static str = "defast-node"

The Lisp keyword (e.g., "defmonitor").

fn compile_from_args(args: &[Sexp]) -> Result<Self>

Parse the argument list (everything after the keyword) into Self.

fn compile_from_sexp(form: &Sexp) -> Result<Self, LispError>

Parse a complete form; validates the head symbol matches KEYWORD.