Struct TokenSeparatedSequence 

pub struct TokenSeparatedSequence<'arena, T, Tok> {
    pub nodes: Vec<'arena, T>,
    pub tokens: Vec<'arena, Tok>,
}

A sequence of AST nodes separated by infix tokens.

The token type is generic so every syntax crate can plug in its own token definition. Methods that depend on spatial relationships between nodes and tokens require HasPosition on the token; that’s the narrowest bound that still supports has_trailing_token style queries, and every sibling crate’s token already carries a Position start so the impl is trivial.

Fields

nodes: Vec<'arena, T>

tokens: Vec<'arena, Tok>

Implementations

impl<'arena, T, Tok> TokenSeparatedSequence<'arena, T, Tok>

pub const fn new(nodes: BVec<'arena, T>, tokens: BVec<'arena, Tok>) -> Self

pub fn empty(arena: &'arena Bump) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get(&self, index: usize) -> Option<&T>

pub fn first(&self) -> Option<&T>

pub fn last(&self) -> Option<&T>

pub fn iter(&self) -> Iter<'_, T>

pub fn as_slice(&self) -> &[T]

pub fn iter_with_tokens( &self, ) -> impl Iterator<Item = (usize, &T, Option<&Tok>)>

Iterate yielding (index, node, optional trailing token) tuples.

The token is None only for the last element if it has no trailing separator.

impl<T, Tok> TokenSeparatedSequence<'_, T, Tok>

where T: HasSpan, Tok: HasPosition,

pub fn has_trailing_token(&self) -> bool

Whether the sequence ends with a trailing separator token.

pub fn get_trailing_token(&self) -> Option<&Tok>

Return the trailing separator token, if any.

Trait Implementations

impl<'arena, T: Clone, Tok: Clone> Clone for TokenSeparatedSequence<'arena, T, Tok>

fn clone(&self) -> TokenSeparatedSequence<'arena, T, Tok>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'arena, T: Debug, Tok: Debug> Debug for TokenSeparatedSequence<'arena, T, Tok>

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

Formats the value using the given formatter.

impl<'arena, T: Hash, Tok: Hash> Hash for TokenSeparatedSequence<'arena, T, Tok>

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<T, Tok> Index<usize> for TokenSeparatedSequence<'_, T, Tok>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &T

Performs the indexing (container[index]) operation.

impl<'seq, T, Tok> IntoIterator for &'seq TokenSeparatedSequence<'_, T, Tok>

type Item = &'seq T

The type of the elements being iterated over.

type IntoIter = Iter<'seq, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'arena, T, Tok> IntoIterator for TokenSeparatedSequence<'arena, T, Tok>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<'arena, <TokenSeparatedSequence<'arena, T, Tok> as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'arena, T: Ord, Tok: Ord> Ord for TokenSeparatedSequence<'arena, T, Tok>

fn cmp(&self, other: &TokenSeparatedSequence<'arena, T, Tok>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'arena, T: PartialEq, Tok: PartialEq> PartialEq for TokenSeparatedSequence<'arena, T, Tok>

fn eq(&self, other: &TokenSeparatedSequence<'arena, T, Tok>) -> 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<'arena, T: PartialOrd, Tok: PartialOrd> PartialOrd for TokenSeparatedSequence<'arena, T, Tok>

fn partial_cmp( &self, other: &TokenSeparatedSequence<'arena, T, Tok>, ) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'arena, T, Tok> Serialize for TokenSeparatedSequence<'arena, T, Tok>

where T: Serialize, Tok: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<'arena, T: Eq, Tok: Eq> Eq for TokenSeparatedSequence<'arena, T, Tok>

impl<'arena, T, Tok> StructuralPartialEq for TokenSeparatedSequence<'arena, T, Tok>