Struct NamedNode 

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

Implementations

impl NamedNode

pub fn cast(node: SyntaxNode) -> Option<Self>

pub fn can_cast(kind: SyntaxKind) -> bool

pub fn as_cst(&self) -> &SyntaxNode

pub fn text_range(&self) -> TextRange

impl NamedNode

pub fn node_type(&self) -> Option<SyntaxToken>

pub fn is_any(&self) -> bool

Returns true if the node type is wildcard (_), matching any named node.

pub fn is_missing(&self) -> bool

Returns true if this is a MISSING node: (MISSING ...).

pub fn missing_constraint(&self) -> Option<SyntaxToken>

For MISSING nodes, returns the inner type constraint if present.

(MISSING identifier) → Some(“identifier”) (MISSING ";") → Some(“;”) (MISSING) → None

pub fn children(&self) -> impl Iterator<Item = Expr> + '_

pub fn anchors(&self) -> impl Iterator<Item = Anchor> + '_

Returns all anchors in this node.

pub fn items(&self) -> impl Iterator<Item = SeqItem> + '_

Returns children interleaved with anchors, preserving order.

pub fn predicate(&self) -> Option<NodePredicate>

Returns the predicate if present: (identifier == "foo").

Trait Implementations

impl Clone for NamedNode

fn clone(&self) -> NamedNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NamedNode

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

Formats the value using the given formatter.

impl Hash for NamedNode

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 NamedNode

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

impl StructuralPartialEq for NamedNode