Struct BracedTokenTree 

pub struct BracedTokenTree { /* private fields */ }

Implementations

impl BracedTokenTree

pub const INDEX_LBRACE: usize = 0usize

pub const INDEX_TOKENS: usize = 1usize

pub const INDEX_RBRACE: usize = 2usize

pub fn new_green( db: &dyn SyntaxGroup, lbrace: TerminalLBraceGreen, tokens: TokenListGreen, rbrace: TerminalRBraceGreen, ) -> BracedTokenTreeGreen

impl BracedTokenTree

pub fn lbrace(&self, db: &dyn SyntaxGroup) -> TerminalLBrace

pub fn tokens(&self, db: &dyn SyntaxGroup) -> TokenList

pub fn rbrace(&self, db: &dyn SyntaxGroup) -> TerminalRBrace

Trait Implementations

impl Clone for BracedTokenTree

fn clone(&self) -> BracedTokenTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BracedTokenTree

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

Formats the value using the given formatter.

impl Hash for BracedTokenTree

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 BracedTokenTree

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

const OPTIONAL_KIND: Option<SyntaxKind>

The relevant SyntaxKind. None for enums.

type StablePtr = BracedTokenTreePtr

type Green = BracedTokenTreeGreen

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

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

fn cast(db: &dyn SyntaxGroup, node: SyntaxNode) -> Option<Self>

fn as_syntax_node(&self) -> SyntaxNode

fn stable_ptr(&self, db: &dyn SyntaxGroup) -> Self::StablePtr

impl Eq for BracedTokenTree

impl StructuralPartialEq for BracedTokenTree