Files
rust/crates/libsyntax2/src/yellow/syntax.rs

158 lines
4.1 KiB
Rust
Raw Normal View History

2018-08-10 17:49:45 +03:00
use std::{fmt, sync::Arc};
2018-07-29 13:51:55 +03:00
2018-08-13 14:24:22 +03:00
use smol_str::SmolStr;
2018-07-29 13:51:55 +03:00
use {
2018-08-17 21:10:55 +03:00
yellow::{RedNode, TreeRoot, SyntaxRoot, RedPtr, RefRoot, OwnedRoot},
2018-07-29 15:16:07 +03:00
SyntaxKind::{self, *},
2018-07-30 14:08:06 +03:00
TextRange, TextUnit,
2018-07-29 13:51:55 +03:00
};
2018-07-30 12:37:03 +03:00
#[derive(Clone, Copy)]
2018-08-17 21:10:55 +03:00
pub struct SyntaxNode<R: TreeRoot = OwnedRoot> {
pub(crate) root: R,
2018-07-30 12:52:59 +03:00
// Guaranteed to not dangle, because `root` holds a
// strong reference to red's ancestor
2018-08-10 17:49:45 +03:00
red: RedPtr,
2018-07-29 13:51:55 +03:00
}
2018-08-10 17:49:45 +03:00
unsafe impl<R: TreeRoot> Send for SyntaxNode<R> {}
unsafe impl<R: TreeRoot> Sync for SyntaxNode<R> {}
2018-07-31 13:49:03 +03:00
impl<R1: TreeRoot, R2: TreeRoot> PartialEq<SyntaxNode<R1>> for SyntaxNode<R2> {
2018-07-30 23:45:10 +03:00
fn eq(&self, other: &SyntaxNode<R1>) -> bool {
self.red == other.red
}
}
2018-07-31 13:49:03 +03:00
impl<R: TreeRoot> Eq for SyntaxNode<R> {}
2018-07-30 23:45:10 +03:00
2018-08-17 21:10:55 +03:00
pub type SyntaxNodeRef<'a> = SyntaxNode<RefRoot<'a>>;
2018-08-11 12:28:59 +03:00
#[test]
fn syntax_node_ref_is_copy() {
fn assert_copy<T: Copy>(){}
assert_copy::<SyntaxNodeRef>()
}
2018-07-29 13:51:55 +03:00
#[derive(Debug, Clone, PartialEq, Eq, Hash, Ord, PartialOrd)]
2018-08-09 21:27:44 +03:00
pub struct SyntaxError {
pub msg: String,
pub offset: TextUnit,
2018-07-29 13:51:55 +03:00
}
2018-08-17 21:10:55 +03:00
impl SyntaxNode<OwnedRoot> {
pub(crate) fn new_owned(root: SyntaxRoot) -> Self {
2018-08-17 21:10:55 +03:00
let root = OwnedRoot(Arc::new(root));
let red = RedPtr::new(&root.syntax_root().red);
2018-08-10 17:49:45 +03:00
SyntaxNode { root, red }
2018-07-29 13:51:55 +03:00
}
}
impl<R: TreeRoot> SyntaxNode<R> {
2018-08-17 21:10:55 +03:00
pub fn as_ref<'a>(&'a self) -> SyntaxNode<RefRoot<'a>> {
SyntaxNode {
2018-08-17 21:10:55 +03:00
root: self.root.borrowed(),
2018-08-10 17:49:45 +03:00
red: self.red,
}
}
2018-07-29 13:51:55 +03:00
pub fn kind(&self) -> SyntaxKind {
2018-07-29 16:19:16 +03:00
self.red().green().kind()
2018-07-29 13:51:55 +03:00
}
pub fn range(&self) -> TextRange {
let red = self.red();
2018-07-30 14:08:06 +03:00
TextRange::offset_len(red.start_offset(), red.green().text_len())
2018-07-29 13:51:55 +03:00
}
pub fn text(&self) -> String {
2018-07-29 16:19:16 +03:00
self.red().green().text()
2018-07-29 13:51:55 +03:00
}
2018-08-17 22:00:13 +03:00
pub fn children(&self) -> impl Iterator<Item = SyntaxNode<R>> {
let red = self.red;
let n_children = self.red().n_children();
let root = self.root.clone();
(0..n_children).map(move |i| {
let red = unsafe { red.get(&root) };
SyntaxNode {
root: root.clone(),
red: red.get_child(i).unwrap(),
}
})
2018-07-29 13:51:55 +03:00
}
pub fn parent(&self) -> Option<SyntaxNode<R>> {
2018-07-30 12:44:14 +03:00
let parent = self.red().parent()?;
Some(SyntaxNode {
root: self.root.clone(),
red: parent,
})
}
2018-07-30 23:45:10 +03:00
pub fn first_child(&self) -> Option<SyntaxNode<R>> {
2018-08-17 15:37:17 +03:00
let red = self.red().get_child(0)?;
Some(SyntaxNode { root: self.root.clone(), red })
}
pub fn last_child(&self) -> Option<SyntaxNode<R>> {
let n = self.red().n_children();
let n = n.checked_sub(1)?;
let red = self.red().get_child(n)?;
Some(SyntaxNode { root: self.root.clone(), red })
2018-07-30 23:45:10 +03:00
}
pub fn next_sibling(&self) -> Option<SyntaxNode<R>> {
let red = self.red();
let parent = self.parent()?;
let next_sibling_idx = red.index_in_parent()? + 1;
2018-07-31 13:49:03 +03:00
let sibling_red = parent.red().get_child(next_sibling_idx)?;
2018-07-30 23:45:10 +03:00
Some(SyntaxNode {
root: self.root.clone(),
2018-07-31 13:49:03 +03:00
red: sibling_red,
2018-07-30 23:45:10 +03:00
})
}
2018-08-12 18:50:16 +03:00
pub fn prev_sibling(&self) -> Option<SyntaxNode<R>> {
let red = self.red();
let parent = self.parent()?;
let prev_sibling_idx = red.index_in_parent()?.checked_sub(1)?;
let sibling_red = parent.red().get_child(prev_sibling_idx)?;
Some(SyntaxNode {
root: self.root.clone(),
red: sibling_red,
})
}
2018-08-07 18:28:30 +03:00
pub fn is_leaf(&self) -> bool {
self.first_child().is_none()
}
2018-08-13 14:24:22 +03:00
pub fn leaf_text(&self) -> Option<SmolStr> {
self.red().green().leaf_text()
}
2018-07-29 13:51:55 +03:00
fn red(&self) -> &RedNode {
2018-08-10 17:49:45 +03:00
unsafe { self.red.get(&self.root) }
2018-07-29 13:51:55 +03:00
}
}
impl<R: TreeRoot> fmt::Debug for SyntaxNode<R> {
2018-07-29 13:51:55 +03:00
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
write!(fmt, "{:?}@{:?}", self.kind(), self.range())?;
if has_short_text(self.kind()) {
write!(fmt, " \"{}\"", self.text())?;
}
Ok(())
}
}
fn has_short_text(kind: SyntaxKind) -> bool {
match kind {
2018-07-31 23:59:54 +03:00
IDENT | LIFETIME | INT_NUMBER | FLOAT_NUMBER => true,
2018-07-29 13:51:55 +03:00
_ => false,
}
}