Struct ElementList

pub struct ElementList<T: TypedSyntaxNode, const STEP: usize> {
    pub node: SyntaxNode,
    /* private fields */
}

Fields

node: SyntaxNode

Implementations

impl<T: TypedSyntaxNode, const STEP: usize> ElementList<T, STEP>

pub fn new(node: SyntaxNode) -> Self

pub fn elements(&self, db: &dyn SyntaxGroup) -> Vec<T>

pub fn has_tail(&self, db: &dyn SyntaxGroup) -> bool

Trait Implementations

impl<T: Clone + TypedSyntaxNode, const STEP: usize> Clone for ElementList<T, STEP>

fn clone(&self) -> ElementList<T, STEP>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + TypedSyntaxNode, const STEP: usize> Debug for ElementList<T, STEP>

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

Formats the value using the given formatter.

impl<T: Hash + TypedSyntaxNode, const STEP: usize> Hash for ElementList<T, STEP>

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: PartialEq + TypedSyntaxNode, const STEP: usize> PartialEq for ElementList<T, STEP>

fn eq(&self, other: &ElementList<T, STEP>) -> 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<T: Eq + TypedSyntaxNode, const STEP: usize> Eq for ElementList<T, STEP>

impl<T: TypedSyntaxNode, const STEP: usize> StructuralPartialEq for ElementList<T, STEP>