Struct GreenNode 

pub struct GreenNode { /* private fields */ }

Node in the green syntax tree.

Implementations

impl GreenNode

pub fn new<I>(kind: SyntaxKind, children: I) -> GreenNode

where I: IntoIterator<Item = NodeOrToken<GreenNode, GreenToken>>, I::IntoIter: ExactSizeIterator,

Create specified kind of green node with given children.

pub fn kind(&self) -> SyntaxKind

Kind of this node.

pub fn text_len(&self) -> TextSize

Total length of text that this node covers.

pub fn children( &self, ) -> impl Iterator<Item = NodeOrToken<&GreenNode, &GreenToken>> + Clone

Iterator over the child nodes and tokens of this node.

pub fn children_len(&self) -> usize

Number of child nodes and tokens of this node.

Trait Implementations

impl Clone for GreenNode

fn clone(&self) -> GreenNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GreenNode

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

Formats the value using the given formatter.

impl Display for GreenNode

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

Formats the value using the given formatter.

impl From<GreenNode> for NodeOrToken<GreenNode, GreenToken>

fn from(node: GreenNode) -> Self

Converts to this type from the input type.

impl Hash for GreenNode

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 GreenNode

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

impl StructuralPartialEq for GreenNode