Struct cairo_lang_syntax::node::ast::Trivia

pub struct Trivia(/* private fields */);

Implementations

impl Trivia

pub fn new_green( db: &dyn SyntaxGroup, children: Vec<TriviumGreen> ) -> TriviaGreen

Methods from Deref<Target = ElementList<Trivium, 1>>

pub fn elements(&self, db: &dyn SyntaxGroup) -> Vec<T>

pub fn has_tail(&self, db: &dyn SyntaxGroup) -> bool

Trait Implementations

impl Clone for Trivia

fn clone(&self) -> Trivia

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Trivia

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

Formats the value using the given formatter.

impl Deref for Trivia

type Target = ElementList<Trivium, 1>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl Hash for Trivia

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 Trivia

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

const OPTIONAL_KIND: Option<SyntaxKind> = _

The relevant SyntaxKind. None for enums.

type StablePtr = TriviaPtr

type Green = TriviaGreen

fn missing(db: &dyn SyntaxGroup) -> Self::Green

fn from_syntax_node(db: &dyn SyntaxGroup, node: SyntaxNode) -> Self

fn as_syntax_node(&self) -> SyntaxNode

fn stable_ptr(&self) -> Self::StablePtr

impl Eq for Trivia

impl StructuralPartialEq for Trivia