Struct UnboundedPreceding 

pub struct UnboundedPreceding { /* private fields */ }

Implementations

impl UnboundedPreceding

pub fn preceding_token(&self) -> Option<SyntaxToken>

pub fn unbounded_token(&self) -> Option<SyntaxToken>

Trait Implementations

impl AstNode for UnboundedPreceding

fn can_cast(kind: SyntaxKind) -> bool

fn cast(syntax: SyntaxNode) -> Option<Self>

fn syntax(&self) -> &SyntaxNode

fn clone_for_update(&self) -> Self

where Self: Sized,

fn clone_subtree(&self) -> Self

where Self: Sized,

impl Clone for UnboundedPreceding

fn clone(&self) -> UnboundedPreceding

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for UnboundedPreceding

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

Formats the value using the given formatter.

impl Eq for UnboundedPreceding

impl From<UnboundedPreceding> for FrameBound

fn from(node: UnboundedPreceding) -> FrameBound

Converts to this type from the input type.

impl Hash for UnboundedPreceding

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 UnboundedPreceding

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