rust/crates/syntax/src/ast/edit.rs

398 lines
12 KiB
Rust
Raw Normal View History

2019-09-26 14:08:44 -05:00
//! This module contains functions for editing syntax trees. As the trees are
//! immutable, all function here return a fresh copy of the tree, instead of
//! doing an in-place modification.
2020-05-19 16:12:01 -05:00
use std::{
2021-05-14 08:40:11 -05:00
fmt, iter,
2020-05-19 16:12:01 -05:00
ops::{self, RangeInclusive},
};
2019-09-26 14:08:44 -05:00
use arrayvec::ArrayVec;
use crate::{
2021-05-14 08:40:11 -05:00
algo,
ast::{
self,
make::{self, tokens},
2021-05-14 12:00:35 -05:00
AstNode,
},
ted, AstToken, Direction, InsertPosition, NodeOrToken, SmolStr, SyntaxElement, SyntaxKind,
2019-09-28 11:50:16 -05:00
SyntaxKind::{ATTR, COMMENT, WHITESPACE},
2019-10-12 14:07:47 -05:00
SyntaxNode, SyntaxToken, T,
2019-09-26 14:08:44 -05:00
};
2019-11-23 23:14:57 -06:00
impl ast::BinExpr {
#[must_use]
pub fn replace_op(&self, op: SyntaxKind) -> Option<ast::BinExpr> {
let op_node: SyntaxElement = self.op_details()?.0.into();
2020-01-15 11:14:49 -06:00
let to_insert: Option<SyntaxElement> = Some(make::token(op).into());
Some(self.replace_children(single_node(op_node), to_insert))
2019-11-23 23:14:57 -06:00
}
}
2020-07-30 09:21:30 -05:00
impl ast::RecordExprFieldList {
2019-09-30 01:27:26 -05:00
#[must_use]
2020-07-30 09:21:30 -05:00
pub fn append_field(&self, field: &ast::RecordExprField) -> ast::RecordExprFieldList {
2019-09-30 01:27:26 -05:00
self.insert_field(InsertPosition::Last, field)
}
#[must_use]
pub fn insert_field(
&self,
2020-07-30 09:21:30 -05:00
position: InsertPosition<&'_ ast::RecordExprField>,
field: &ast::RecordExprField,
) -> ast::RecordExprFieldList {
2019-09-30 01:27:26 -05:00
let is_multiline = self.syntax().text().contains_char('\n');
let ws;
let space = if is_multiline {
ws = tokens::WsBuilder::new(&format!(
"\n{} ",
2019-12-20 08:43:30 -06:00
leading_indent(self.syntax()).unwrap_or_default()
2019-09-30 01:27:26 -05:00
));
ws.ws()
} else {
tokens::single_space()
};
2021-03-25 14:03:20 -05:00
let mut to_insert: ArrayVec<SyntaxElement, 4> = ArrayVec::new();
2019-09-30 01:27:26 -05:00
to_insert.push(space.into());
to_insert.push(field.syntax().clone().into());
2020-03-06 08:38:48 -06:00
to_insert.push(make::token(T![,]).into());
2019-09-30 01:27:26 -05:00
macro_rules! after_l_curly {
() => {{
let anchor = match self.l_curly_token() {
2020-04-10 03:27:23 -05:00
Some(it) => it.into(),
2019-09-30 01:27:26 -05:00
None => return self.clone(),
};
InsertPosition::After(anchor)
}};
}
macro_rules! after_field {
($anchor:expr) => {
if let Some(comma) = $anchor
.syntax()
.siblings_with_tokens(Direction::Next)
.find(|it| it.kind() == T![,])
{
InsertPosition::After(comma)
} else {
2020-03-06 08:38:48 -06:00
to_insert.insert(0, make::token(T![,]).into());
2019-09-30 01:27:26 -05:00
InsertPosition::After($anchor.syntax().clone().into())
}
};
2021-01-02 13:48:39 -06:00
}
2019-09-30 01:27:26 -05:00
let position = match position {
InsertPosition::First => after_l_curly!(),
InsertPosition::Last => {
if !is_multiline {
// don't insert comma before curly
to_insert.pop();
}
match self.fields().last() {
Some(it) => after_field!(it),
None => after_l_curly!(),
}
}
InsertPosition::Before(anchor) => {
InsertPosition::Before(anchor.syntax().clone().into())
}
InsertPosition::After(anchor) => after_field!(anchor),
};
self.insert_children(position, to_insert)
2019-09-30 01:27:26 -05:00
}
}
2020-01-15 11:48:28 -06:00
impl ast::Path {
#[must_use]
pub fn with_segment(&self, segment: ast::PathSegment) -> ast::Path {
if let Some(old) = self.segment() {
return self.replace_children(
2020-01-15 11:48:28 -06:00
single_node(old.syntax().clone()),
iter::once(segment.syntax().clone().into()),
);
}
self.clone()
}
}
impl ast::PathSegment {
#[must_use]
2020-09-03 05:18:46 -05:00
pub fn with_generic_args(&self, type_args: ast::GenericArgList) -> ast::PathSegment {
self._with_generic_args(type_args, false)
2020-01-15 11:48:28 -06:00
}
#[must_use]
2020-07-31 11:29:29 -05:00
pub fn with_turbo_fish(&self, type_args: ast::GenericArgList) -> ast::PathSegment {
2020-09-03 05:18:46 -05:00
self._with_generic_args(type_args, true)
2020-01-15 11:48:28 -06:00
}
2020-09-03 05:18:46 -05:00
fn _with_generic_args(&self, type_args: ast::GenericArgList, turbo: bool) -> ast::PathSegment {
2020-07-31 11:29:29 -05:00
if let Some(old) = self.generic_arg_list() {
return self.replace_children(
2020-01-15 11:48:28 -06:00
single_node(old.syntax().clone()),
iter::once(type_args.syntax().clone().into()),
);
}
2021-03-25 14:03:20 -05:00
let mut to_insert: ArrayVec<SyntaxElement, 2> = ArrayVec::new();
2020-01-15 11:48:28 -06:00
if turbo {
to_insert.push(make::token(T![::]).into());
}
to_insert.push(type_args.syntax().clone().into());
self.insert_children(InsertPosition::Last, to_insert)
2020-01-15 11:48:28 -06:00
}
}
impl ast::UseTree {
/// Splits off the given prefix, making it the path component of the use tree, appending the rest of the path to all UseTreeList items.
#[must_use]
pub fn split_prefix(&self, prefix: &ast::Path) -> ast::UseTree {
2020-08-12 11:49:43 -05:00
let suffix = if self.path().as_ref() == Some(prefix) && self.use_tree_list().is_none() {
make::path_unqualified(make::path_segment_self())
} else {
match split_path_prefix(&prefix) {
Some(it) => it,
None => return self.clone(),
}
};
2020-08-12 11:49:43 -05:00
2020-07-30 05:01:14 -05:00
let use_tree = make::use_tree(
suffix,
self.use_tree_list(),
self.rename(),
self.star_token().is_some(),
);
let nested = make::use_tree_list(iter::once(use_tree));
return make::use_tree(prefix.clone(), Some(nested), None, false);
fn split_path_prefix(prefix: &ast::Path) -> Option<ast::Path> {
let parent = prefix.parent_path()?;
let segment = parent.segment()?;
if algo::has_errors(segment.syntax()) {
return None;
}
let mut res = make::path_unqualified(segment);
for p in iter::successors(parent.parent_path(), |it| it.parent_path()) {
res = make::path_qualified(res, p.segment()?);
}
Some(res)
}
}
}
2019-09-30 02:08:28 -05:00
#[must_use]
2020-03-24 06:56:07 -05:00
pub fn remove_attrs_and_docs<N: ast::AttrsOwner>(node: &N) -> N {
N::cast(remove_attrs_and_docs_inner(node.syntax().clone())).unwrap()
2019-09-28 11:50:16 -05:00
}
2020-03-24 06:56:07 -05:00
fn remove_attrs_and_docs_inner(mut node: SyntaxNode) -> SyntaxNode {
2019-09-28 11:50:16 -05:00
while let Some(start) =
node.children_with_tokens().find(|it| it.kind() == ATTR || it.kind() == COMMENT)
{
let end = match &start.next_sibling_or_token() {
Some(el) if el.kind() == WHITESPACE => el.clone(),
Some(_) | None => start.clone(),
};
2020-01-15 10:54:25 -06:00
node = algo::replace_children(&node, start..=end, &mut iter::empty());
2019-09-28 11:50:16 -05:00
}
node
}
2019-10-12 14:07:47 -05:00
#[derive(Debug, Clone, Copy)]
pub struct IndentLevel(pub u8);
impl From<u8> for IndentLevel {
fn from(level: u8) -> IndentLevel {
IndentLevel(level)
}
}
2020-05-19 16:12:01 -05:00
impl fmt::Display for IndentLevel {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
let spaces = " ";
let buf;
let len = self.0 as usize * 4;
let indent = if len <= spaces.len() {
&spaces[..len]
} else {
buf = iter::repeat(' ').take(len).collect::<String>();
&buf
};
fmt::Display::fmt(indent, f)
}
}
impl ops::Add<u8> for IndentLevel {
type Output = IndentLevel;
fn add(self, rhs: u8) -> IndentLevel {
IndentLevel(self.0 + rhs)
}
}
2019-10-12 14:07:47 -05:00
impl IndentLevel {
pub fn single() -> IndentLevel {
IndentLevel(0)
}
pub fn is_zero(&self) -> bool {
self.0 == 0
}
pub fn from_element(element: &SyntaxElement) -> IndentLevel {
match element {
rowan::NodeOrToken::Node(it) => IndentLevel::from_node(it),
rowan::NodeOrToken::Token(it) => IndentLevel::from_token(it),
}
}
2019-10-12 14:07:47 -05:00
pub fn from_node(node: &SyntaxNode) -> IndentLevel {
2021-02-24 13:25:10 -06:00
match node.first_token() {
Some(it) => Self::from_token(&it),
2021-03-21 09:33:18 -05:00
None => IndentLevel(0),
2021-02-24 13:25:10 -06:00
}
}
pub fn from_token(token: &SyntaxToken) -> IndentLevel {
for ws in prev_tokens(token.clone()).filter_map(ast::Whitespace::cast) {
2019-10-12 14:07:47 -05:00
let text = ws.syntax().text();
if let Some(pos) = text.rfind('\n') {
let level = text[pos + 1..].chars().count() / 4;
return IndentLevel(level as u8);
}
}
IndentLevel(0)
}
2020-05-19 16:12:01 -05:00
/// XXX: this intentionally doesn't change the indent of the very first token.
/// Ie, in something like
/// ```
/// fn foo() {
/// 92
/// }
/// ```
/// if you indent the block, the `{` token would stay put.
2020-05-09 07:40:11 -05:00
fn increase_indent(self, node: SyntaxNode) -> SyntaxNode {
let res = node.clone_subtree().clone_for_update();
let tokens = res.preorder_with_tokens().filter_map(|event| match event {
rowan::WalkEvent::Leave(NodeOrToken::Token(it)) => Some(it),
_ => None,
});
for token in tokens {
if let Some(ws) = ast::Whitespace::cast(token) {
if ws.text().contains('\n') {
let new_ws = make::tokens::whitespace(&format!("{}{}", ws.syntax(), self));
ted::replace(ws.syntax(), &new_ws)
}
}
}
res.clone_subtree()
2019-10-12 14:07:47 -05:00
}
2020-05-09 07:40:11 -05:00
fn decrease_indent(self, node: SyntaxNode) -> SyntaxNode {
let res = node.clone_subtree().clone_for_update();
let tokens = res.preorder_with_tokens().filter_map(|event| match event {
rowan::WalkEvent::Leave(NodeOrToken::Token(it)) => Some(it),
_ => None,
});
for token in tokens {
if let Some(ws) = ast::Whitespace::cast(token) {
if ws.text().contains('\n') {
let new_ws = make::tokens::whitespace(
&ws.syntax().text().replace(&format!("\n{}", self), "\n"),
);
ted::replace(ws.syntax(), &new_ws)
}
}
}
res.clone_subtree()
}
2019-10-12 14:07:47 -05:00
}
// FIXME: replace usages with IndentLevel above
fn leading_indent(node: &SyntaxNode) -> Option<SmolStr> {
2019-10-12 14:07:47 -05:00
for token in prev_tokens(node.first_token()?) {
if let Some(ws) = ast::Whitespace::cast(token.clone()) {
let ws_text = ws.text();
if let Some(pos) = ws_text.rfind('\n') {
return Some(ws_text[pos + 1..].into());
}
}
if token.text().contains('\n') {
break;
}
}
None
}
2019-10-12 14:07:47 -05:00
fn prev_tokens(token: SyntaxToken) -> impl Iterator<Item = SyntaxToken> {
iter::successors(Some(token), |token| token.prev_token())
}
2020-05-09 07:40:11 -05:00
pub trait AstNodeEdit: AstNode + Clone + Sized {
#[must_use]
fn insert_children(
&self,
position: InsertPosition<SyntaxElement>,
to_insert: impl IntoIterator<Item = SyntaxElement>,
) -> Self {
let new_syntax = algo::insert_children(self.syntax(), position, to_insert);
Self::cast(new_syntax).unwrap()
}
#[must_use]
fn replace_children(
&self,
to_replace: RangeInclusive<SyntaxElement>,
to_insert: impl IntoIterator<Item = SyntaxElement>,
) -> Self {
let new_syntax = algo::replace_children(self.syntax(), to_replace, to_insert);
Self::cast(new_syntax).unwrap()
}
2020-08-13 03:32:03 -05:00
fn indent_level(&self) -> IndentLevel {
IndentLevel::from_node(self.syntax())
}
2020-05-09 07:40:11 -05:00
#[must_use]
fn indent(&self, level: IndentLevel) -> Self {
Self::cast(level.increase_indent(self.syntax().clone())).unwrap()
2020-05-09 07:40:11 -05:00
}
#[must_use]
fn dedent(&self, level: IndentLevel) -> Self {
Self::cast(level.decrease_indent(self.syntax().clone())).unwrap()
}
#[must_use]
fn reset_indent(&self) -> Self {
let level = IndentLevel::from_node(self.syntax());
self.dedent(level)
2020-05-09 07:40:11 -05:00
}
2019-09-26 14:08:44 -05:00
}
2020-05-09 07:40:11 -05:00
impl<N: AstNode + Clone> AstNodeEdit for N {}
2020-01-15 10:56:25 -06:00
fn single_node(element: impl Into<SyntaxElement>) -> RangeInclusive<SyntaxElement> {
let element = element.into();
element.clone()..=element
}
2019-10-12 14:07:47 -05:00
#[test]
fn test_increase_indent() {
let arm_list = {
2020-08-05 12:29:24 -05:00
let arm = make::match_arm(iter::once(make::wildcard_pat().into()), make::expr_unit());
make::match_arm_list(vec![arm.clone(), arm])
2019-10-12 14:07:47 -05:00
};
assert_eq!(
arm_list.syntax().to_string(),
"{
_ => (),
_ => (),
}"
);
2020-05-09 07:40:11 -05:00
let indented = arm_list.indent(IndentLevel(2));
2019-10-12 14:07:47 -05:00
assert_eq!(
indented.syntax().to_string(),
"{
_ => (),
_ => (),
}"
);
}