Struct InnerPosition 

pub(crate) struct InnerPosition<'a> {
    pub(crate) node: Node<'a>,
    pub(crate) character_index: usize,
}

Fields

node: Node<'a>

character_index: usize

Implementations

impl<'a> InnerPosition<'a>

fn upgrade(tree_state: &'a TreeState, weak: WeakPosition) -> Option<Self>

fn clamped_upgrade( tree_state: &'a TreeState, weak: WeakPosition, ) -> Option<Self>

fn is_word_start(&self) -> bool

fn is_run_start(&self) -> bool

fn is_line_start(&self) -> bool

fn is_run_end(&self) -> bool

fn is_line_end(&self) -> bool

fn is_paragraph_end(&self) -> bool

fn is_document_start(&self, root_node: &Node<'_>) -> bool

fn is_document_end(&self, root_node: &Node<'_>) -> bool

fn biased_to_start(&self, root_node: &Node<'_>) -> Self

fn biased_to_end(&self, root_node: &Node<'_>) -> Self

fn comparable(&self, root_node: &Node<'_>) -> (Vec<usize>, usize)

fn previous_word_start(&self) -> Self

fn word_end(&self) -> Self

fn line_start(&self) -> Self

fn line_end(&self) -> Self

pub(crate) fn downgrade(&self) -> WeakPosition

Trait Implementations

impl<'a> Clone for InnerPosition<'a>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl PartialEq for InnerPosition<'_>

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

impl Eq for InnerPosition<'_>