Struct tree_sitter_facade::Node

pub struct Node<'tree> { /* fields omitted */ }

Implementations

impl<'tree> Node<'tree>

pub fn byte_range(&self) -> Range<u32>

pub fn child(&self, i: u32) -> Option<Self>

pub fn child_by_field_id(&self, field_id: u16) -> Option<Self>

pub fn child_by_field_name(&self, field_name: impl AsRef<[u8]>) -> Option<Self>

pub fn child_count(&self) -> u32

pub fn children<'a>(
    &self,
    cursor: &'a mut TreeCursor<'tree>
) -> impl ExactSizeIterator<Item = Node<'tree>> + 'a

pub fn children_by_field_id<'a>(
    &self,
    field_id: u16,
    cursor: &'a mut TreeCursor<'tree>
) -> impl Iterator<Item = Node<'tree>> + 'a

pub fn children_by_field_name<'a>(
    &self,
    field_name: &str,
    cursor: &'a mut TreeCursor<'tree>
) -> impl Iterator<Item = Node<'tree>> + 'a

pub fn descendant_for_byte_range(&self, start: u32, end: u32) -> Option<Self>

pub fn descendant_for_point_range(
    &self,
    start: Point,
    end: Point
) -> Option<Self>

pub fn edit(&mut self, edit: &InputEdit)

pub fn end_byte(&self) -> u32

pub fn end_position(&self) -> Point

pub fn has_changes(&self) -> bool

pub fn has_error(&self) -> bool

pub fn id(&self) -> u32

pub fn is_error(&self) -> bool

pub fn is_extra(&self) -> bool

pub fn is_missing(&self) -> bool

pub fn is_named(&self) -> bool

pub fn kind(&self) -> Cow<'_, str>

pub fn kind_id(&self) -> u16

pub fn language(&self) -> Language

pub fn named_child(&self, i: u32) -> Option<Self>

pub fn named_child_count(&self) -> u32

pub fn named_children<'a>(
    &self,
    cursor: &'a mut TreeCursor<'tree>
) -> impl ExactSizeIterator<Item = Node<'tree>> + 'a

pub fn named_descendant_for_byte_range(
    &self,
    start: u32,
    end: u32
) -> Option<Self>

pub fn named_descendant_for_point_range(
    &self,
    start: Point,
    end: Point
) -> Option<Self>

pub fn next_named_sibling(&self) -> Option<Self>

pub fn next_sibling(&self) -> Option<Self>

pub fn parent(&self) -> Option<Self>

pub fn prev_named_sibling(&self) -> Option<Self>

pub fn prev_sibling(&self) -> Option<Self>

pub fn range(&self) -> Range

pub fn start_byte(&self) -> u32

pub fn start_position(&self) -> Point

pub fn to_sexp(&self) -> Cow<'_, str>

pub fn utf8_text<'a>(&self, source: &'a [u8]) -> Result<Cow<'a, str>, Utf8Error>

pub fn utf16_text<'a>(&self, source: &'a [u16]) -> &'a [u16]

pub fn walk(&self) -> TreeCursor<'tree>

Trait Implementations

impl<'tree> Clone for Node<'tree>

fn clone(&self) -> Node<'tree>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'tree> Debug for Node<'tree>

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

Formats the value using the given formatter.

impl<'tree> Eq for Node<'tree>

impl<'tree> From<Node<'tree>> for Node<'tree>

fn from(inner: Node<'tree>) -> Self

Performs the conversion.

impl<'tree> Hash for Node<'tree>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<'tree> PartialEq<Node<'tree>> for Node<'tree>

fn eq(&self, other: &Node<'tree>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Node<'tree>) -> bool

This method tests for !=.

impl<'tree> StructuralEq for Node<'tree>

impl<'tree> StructuralPartialEq for Node<'tree>