Struct LexedSource 

pub struct LexedSource<'a> { /* private fields */ }

Lossless tokenization of a KCL source string.

LexedSource keeps the original source and the full token sequence, including whitespace, comments, and recovery tokens. Lexical errors are represented as token kinds such as SyntaxKind::Unknown, SyntaxKind::UnterminatedString, and SyntaxKind::UnterminatedBlockComment.

Implementations

impl<'a> LexedSource<'a>

pub fn as_str(&self) -> &'a str

Returns the original source string.

pub fn tokens(&self) -> &[Token<'a>]

Returns all tokens, including trivia and recovery tokens.

pub fn iter(&self) -> impl Iterator<Item = &Token<'a>>

Iterates over all tokens by reference.

pub fn into_tokens(self) -> Vec<Token<'a>>

Consumes the lexed source and returns its token vector.

pub fn len(&self) -> usize

Returns the number of tokens.

pub fn is_empty(&self) -> bool

Returns true when the source produced no tokens.

Trait Implementations

impl<'a> Clone for LexedSource<'a>

fn clone(&self) -> LexedSource<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for LexedSource<'a>

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

Formats the value using the given formatter.

impl<'a, 's> IntoIterator for &'s LexedSource<'a>

type IntoIter = Iter<'s, Token<'a>>

Which kind of iterator are we turning this into?

type Item = &'s Token<'a>

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a> IntoIterator for LexedSource<'a>

type IntoIter = IntoIter<Token<'a>>

Which kind of iterator are we turning this into?

type Item = Token<'a>

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a> PartialEq for LexedSource<'a>

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

impl<'a> StructuralPartialEq for LexedSource<'a>