1 //! FIXME: write short doc here
5 hash::BuildHasherDefault,
6 ops::{self, RangeInclusive},
9 use indexmap::IndexMap;
10 use itertools::Itertools;
11 use rustc_hash::FxHashMap;
13 use text_edit::TextEditBuilder;
16 AstNode, Direction, NodeOrToken, SyntaxElement, SyntaxKind, SyntaxNode, SyntaxNodePtr,
17 SyntaxToken, TextRange, TextSize,
20 /// Returns ancestors of the node at the offset, sorted by length. This should
21 /// do the right thing at an edge, e.g. when searching for expressions at `{
22 /// $0foo }` we will get the name reference instead of the whole block, which
23 /// we would get if we just did `find_token_at_offset(...).flat_map(|t|
24 /// t.parent().ancestors())`.
25 pub fn ancestors_at_offset(
28 ) -> impl Iterator<Item = SyntaxNode> {
29 node.token_at_offset(offset)
30 .map(|token| token.parent().ancestors())
31 .kmerge_by(|node1, node2| node1.text_range().len() < node2.text_range().len())
34 /// Finds a node of specific Ast type at offset. Note that this is slightly
35 /// imprecise: if the cursor is strictly between two nodes of the desired type,
39 /// struct Foo {}|struct Bar;
42 /// then the shorter node will be silently preferred.
43 pub fn find_node_at_offset<N: AstNode>(syntax: &SyntaxNode, offset: TextSize) -> Option<N> {
44 ancestors_at_offset(syntax, offset).find_map(N::cast)
47 pub fn find_node_at_range<N: AstNode>(syntax: &SyntaxNode, range: TextRange) -> Option<N> {
48 syntax.covering_element(range).ancestors().find_map(N::cast)
51 /// Skip to next non `trivia` token
52 pub fn skip_trivia_token(mut token: SyntaxToken, direction: Direction) -> Option<SyntaxToken> {
53 while token.kind().is_trivia() {
54 token = match direction {
55 Direction::Next => token.next_token()?,
56 Direction::Prev => token.prev_token()?,
62 /// Finds the first sibling in the given direction which is not `trivia`
63 pub fn non_trivia_sibling(element: SyntaxElement, direction: Direction) -> Option<SyntaxElement> {
64 return match element {
65 NodeOrToken::Node(node) => node.siblings_with_tokens(direction).skip(1).find(not_trivia),
66 NodeOrToken::Token(token) => token.siblings_with_tokens(direction).skip(1).find(not_trivia),
69 fn not_trivia(element: &SyntaxElement) -> bool {
71 NodeOrToken::Node(_) => true,
72 NodeOrToken::Token(token) => !token.kind().is_trivia(),
77 pub fn least_common_ancestor(u: &SyntaxNode, v: &SyntaxNode) -> Option<SyntaxNode> {
79 return Some(u.clone());
82 let u_depth = u.ancestors().count();
83 let v_depth = v.ancestors().count();
84 let keep = u_depth.min(v_depth);
86 let u_candidates = u.ancestors().skip(u_depth - keep);
87 let v_candidates = v.ancestors().skip(v_depth - keep);
88 let (res, _) = u_candidates.zip(v_candidates).find(|(x, y)| x == y)?;
92 pub fn neighbor<T: AstNode>(me: &T, direction: Direction) -> Option<T> {
93 me.syntax().siblings(direction).skip(1).find_map(T::cast)
96 pub fn has_errors(node: &SyntaxNode) -> bool {
97 node.children().any(|it| it.kind() == SyntaxKind::ERROR)
100 #[derive(Debug, PartialEq, Eq, Clone, Copy)]
101 pub enum InsertPosition<T> {
108 type FxIndexMap<K, V> = IndexMap<K, V, BuildHasherDefault<rustc_hash::FxHasher>>;
110 #[derive(Debug, Hash, PartialEq, Eq)]
111 enum TreeDiffInsertPos {
112 After(SyntaxElement),
113 AsFirstChild(SyntaxElement),
117 pub struct TreeDiff {
118 replacements: FxHashMap<SyntaxElement, SyntaxElement>,
119 deletions: Vec<SyntaxElement>,
120 // the vec as well as the indexmap are both here to preserve order
121 insertions: FxIndexMap<TreeDiffInsertPos, Vec<SyntaxElement>>,
125 pub fn into_text_edit(&self, builder: &mut TextEditBuilder) {
126 let _p = profile::span("into_text_edit");
128 for (anchor, to) in self.insertions.iter() {
129 let offset = match anchor {
130 TreeDiffInsertPos::After(it) => it.text_range().end(),
131 TreeDiffInsertPos::AsFirstChild(it) => it.text_range().start(),
133 to.iter().for_each(|to| builder.insert(offset, to.to_string()));
135 for (from, to) in self.replacements.iter() {
136 builder.replace(from.text_range(), to.to_string())
138 for text_range in self.deletions.iter().map(SyntaxElement::text_range) {
139 builder.delete(text_range);
143 pub fn is_empty(&self) -> bool {
144 self.replacements.is_empty() && self.deletions.is_empty() && self.insertions.is_empty()
148 /// Finds a (potentially minimal) diff, which, applied to `from`, will result in `to`.
150 /// Specifically, returns a structure that consists of a replacements, insertions and deletions
151 /// such that applying this map on `from` will result in `to`.
153 /// This function tries to find a fine-grained diff.
154 pub fn diff(from: &SyntaxNode, to: &SyntaxNode) -> TreeDiff {
155 let _p = profile::span("diff");
157 let mut diff = TreeDiff {
158 replacements: FxHashMap::default(),
159 insertions: FxIndexMap::default(),
160 deletions: Vec::new(),
162 let (from, to) = (from.clone().into(), to.clone().into());
164 if !syntax_element_eq(&from, &to) {
165 go(&mut diff, from, to);
169 fn syntax_element_eq(lhs: &SyntaxElement, rhs: &SyntaxElement) -> bool {
170 lhs.kind() == rhs.kind()
171 && lhs.text_range().len() == rhs.text_range().len()
172 && match (&lhs, &rhs) {
173 (NodeOrToken::Node(lhs), NodeOrToken::Node(rhs)) => {
174 lhs.green() == rhs.green() || lhs.text() == rhs.text()
176 (NodeOrToken::Token(lhs), NodeOrToken::Token(rhs)) => lhs.text() == rhs.text(),
181 // FIXME: this is horrible inefficient. I bet there's a cool algorithm to diff trees properly.
182 fn go(diff: &mut TreeDiff, lhs: SyntaxElement, rhs: SyntaxElement) {
183 let (lhs, rhs) = match lhs.as_node().zip(rhs.as_node()) {
184 Some((lhs, rhs)) => (lhs, rhs),
186 mark::hit!(diff_node_token_replace);
187 diff.replacements.insert(lhs, rhs);
192 let mut look_ahead_scratch = Vec::default();
194 let mut rhs_children = rhs.children_with_tokens();
195 let mut lhs_children = lhs.children_with_tokens();
196 let mut last_lhs = None;
198 let lhs_child = lhs_children.next();
199 match (lhs_child.clone(), rhs_children.next()) {
200 (None, None) => break,
201 (None, Some(element)) => {
202 let insert_pos = match last_lhs.clone() {
204 mark::hit!(diff_insert);
205 TreeDiffInsertPos::After(prev)
207 // first iteration, insert into out parent as the first child
209 mark::hit!(diff_insert_as_first_child);
210 TreeDiffInsertPos::AsFirstChild(lhs.clone().into())
213 diff.insertions.entry(insert_pos).or_insert_with(Vec::new).push(element);
215 (Some(element), None) => {
216 mark::hit!(diff_delete);
217 diff.deletions.push(element);
219 (Some(ref lhs_ele), Some(ref rhs_ele)) if syntax_element_eq(lhs_ele, rhs_ele) => {}
220 (Some(lhs_ele), Some(rhs_ele)) => {
221 // nodes differ, look for lhs_ele in rhs, if its found we can mark everything up
222 // until that element as insertions. This is important to keep the diff minimal
223 // in regards to insertions that have been actually done, this is important for
224 // use insertions as we do not want to replace the entire module node.
225 look_ahead_scratch.push(rhs_ele.clone());
226 let mut rhs_children_clone = rhs_children.clone();
227 let mut insert = false;
228 while let Some(rhs_child) = rhs_children_clone.next() {
229 if syntax_element_eq(&lhs_ele, &rhs_child) {
230 mark::hit!(diff_insertions);
234 look_ahead_scratch.push(rhs_child);
237 let drain = look_ahead_scratch.drain(..);
239 let insert_pos = if let Some(prev) = last_lhs.clone().filter(|_| insert) {
240 TreeDiffInsertPos::After(prev)
242 mark::hit!(insert_first_child);
243 TreeDiffInsertPos::AsFirstChild(lhs.clone().into())
246 diff.insertions.entry(insert_pos).or_insert_with(Vec::new).extend(drain);
247 rhs_children = rhs_children_clone;
249 go(diff, lhs_ele, rhs_ele)
253 last_lhs = lhs_child.or(last_lhs);
258 /// Adds specified children (tokens or nodes) to the current node at the
259 /// specific position.
261 /// This is a type-unsafe low-level editing API, if you need to use it,
262 /// prefer to create a type-safe abstraction on top of it instead.
263 pub fn insert_children(
265 position: InsertPosition<SyntaxElement>,
266 to_insert: impl IntoIterator<Item = SyntaxElement>,
268 let mut to_insert = to_insert.into_iter();
269 _insert_children(parent, position, &mut to_insert)
274 position: InsertPosition<SyntaxElement>,
275 to_insert: &mut dyn Iterator<Item = SyntaxElement>,
277 let mut delta = TextSize::default();
278 let to_insert = to_insert.map(|element| {
279 delta += element.text_range().len();
280 to_green_element(element)
283 let mut old_children = parent.green().children().map(|it| match it {
284 NodeOrToken::Token(it) => NodeOrToken::Token(it.clone()),
285 NodeOrToken::Node(it) => NodeOrToken::Node(it.clone()),
288 let new_children = match &position {
289 InsertPosition::First => to_insert.chain(old_children).collect::<Vec<_>>(),
290 InsertPosition::Last => old_children.chain(to_insert).collect::<Vec<_>>(),
291 InsertPosition::Before(anchor) | InsertPosition::After(anchor) => {
292 let take_anchor = if let InsertPosition::After(_) = position { 1 } else { 0 };
293 let split_at = position_of_child(parent, anchor.clone()) + take_anchor;
294 let before = old_children.by_ref().take(split_at).collect::<Vec<_>>();
295 before.into_iter().chain(to_insert).chain(old_children).collect::<Vec<_>>()
299 with_children(parent, new_children)
302 /// Replaces all nodes in `to_delete` with nodes from `to_insert`
304 /// This is a type-unsafe low-level editing API, if you need to use it,
305 /// prefer to create a type-safe abstraction on top of it instead.
306 pub fn replace_children(
308 to_delete: RangeInclusive<SyntaxElement>,
309 to_insert: impl IntoIterator<Item = SyntaxElement>,
311 let mut to_insert = to_insert.into_iter();
312 _replace_children(parent, to_delete, &mut to_insert)
315 fn _replace_children(
317 to_delete: RangeInclusive<SyntaxElement>,
318 to_insert: &mut dyn Iterator<Item = SyntaxElement>,
320 let start = position_of_child(parent, to_delete.start().clone());
321 let end = position_of_child(parent, to_delete.end().clone());
322 let mut old_children = parent.green().children().map(|it| match it {
323 NodeOrToken::Token(it) => NodeOrToken::Token(it.clone()),
324 NodeOrToken::Node(it) => NodeOrToken::Node(it.clone()),
327 let before = old_children.by_ref().take(start).collect::<Vec<_>>();
328 let new_children = before
330 .chain(to_insert.map(to_green_element))
331 .chain(old_children.skip(end + 1 - start))
332 .collect::<Vec<_>>();
333 with_children(parent, new_children)
336 #[derive(Debug, PartialEq, Eq, Hash)]
338 FirstChildOf(SyntaxNode),
339 After(SyntaxElement),
343 pub struct SyntaxRewriter<'a> {
344 f: Option<Box<dyn Fn(&SyntaxElement) -> Option<SyntaxElement> + 'a>>,
345 //FIXME: add debug_assertions that all elements are in fact from the same file.
346 replacements: FxHashMap<SyntaxElement, Replacement>,
347 insertions: IndexMap<InsertPos, Vec<SyntaxElement>>,
350 impl fmt::Debug for SyntaxRewriter<'_> {
351 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
352 f.debug_struct("SyntaxRewriter")
353 .field("replacements", &self.replacements)
354 .field("insertions", &self.insertions)
359 impl<'a> SyntaxRewriter<'a> {
360 pub fn from_fn(f: impl Fn(&SyntaxElement) -> Option<SyntaxElement> + 'a) -> SyntaxRewriter<'a> {
362 f: Some(Box::new(f)),
363 replacements: FxHashMap::default(),
364 insertions: IndexMap::default(),
367 pub fn delete<T: Clone + Into<SyntaxElement>>(&mut self, what: &T) {
368 let what = what.clone().into();
369 let replacement = Replacement::Delete;
370 self.replacements.insert(what, replacement);
372 pub fn insert_before<T: Clone + Into<SyntaxElement>, U: Clone + Into<SyntaxElement>>(
377 let before = before.clone().into();
378 let pos = match before.prev_sibling_or_token() {
379 Some(sibling) => InsertPos::After(sibling),
380 None => match before.parent() {
381 Some(parent) => InsertPos::FirstChildOf(parent),
385 self.insertions.entry(pos).or_insert_with(Vec::new).push(what.clone().into());
387 pub fn insert_after<T: Clone + Into<SyntaxElement>, U: Clone + Into<SyntaxElement>>(
393 .entry(InsertPos::After(after.clone().into()))
394 .or_insert_with(Vec::new)
395 .push(what.clone().into());
397 pub fn insert_as_first_child<T: Clone + Into<SyntaxNode>, U: Clone + Into<SyntaxElement>>(
403 .entry(InsertPos::FirstChildOf(parent.clone().into()))
404 .or_insert_with(Vec::new)
405 .push(what.clone().into());
407 pub fn insert_many_before<
408 T: Clone + Into<SyntaxElement>,
409 U: IntoIterator<Item = SyntaxElement>,
415 let before = before.clone().into();
416 let pos = match before.prev_sibling_or_token() {
417 Some(sibling) => InsertPos::After(sibling),
418 None => match before.parent() {
419 Some(parent) => InsertPos::FirstChildOf(parent),
423 self.insertions.entry(pos).or_insert_with(Vec::new).extend(what);
425 pub fn insert_many_after<
426 T: Clone + Into<SyntaxElement>,
427 U: IntoIterator<Item = SyntaxElement>,
434 .entry(InsertPos::After(after.clone().into()))
435 .or_insert_with(Vec::new)
438 pub fn insert_many_as_first_children<
439 T: Clone + Into<SyntaxNode>,
440 U: IntoIterator<Item = SyntaxElement>,
447 .entry(InsertPos::FirstChildOf(parent.clone().into()))
448 .or_insert_with(Vec::new)
451 pub fn replace<T: Clone + Into<SyntaxElement>>(&mut self, what: &T, with: &T) {
452 let what = what.clone().into();
453 let replacement = Replacement::Single(with.clone().into());
454 self.replacements.insert(what, replacement);
456 pub fn replace_with_many<T: Clone + Into<SyntaxElement>>(
459 with: Vec<SyntaxElement>,
461 let what = what.clone().into();
462 let replacement = Replacement::Many(with);
463 self.replacements.insert(what, replacement);
465 pub fn replace_ast<T: AstNode>(&mut self, what: &T, with: &T) {
466 self.replace(what.syntax(), with.syntax())
469 pub fn rewrite(&self, node: &SyntaxNode) -> SyntaxNode {
470 let _p = profile::span("rewrite");
472 if self.f.is_none() && self.replacements.is_empty() && self.insertions.is_empty() {
475 let green = self.rewrite_children(node);
476 with_green(node, green)
479 pub fn rewrite_ast<N: AstNode>(self, node: &N) -> N {
480 N::cast(self.rewrite(node.syntax())).unwrap()
483 /// Returns a node that encompasses all replacements to be done by this rewriter.
485 /// Passing the returned node to `rewrite` will apply all replacements queued up in `self`.
487 /// Returns `None` when there are no replacements.
488 pub fn rewrite_root(&self) -> Option<SyntaxNode> {
489 let _p = profile::span("rewrite_root");
490 fn element_to_node_or_parent(element: &SyntaxElement) -> SyntaxNode {
492 SyntaxElement::Node(it) => it.clone(),
493 SyntaxElement::Token(it) => it.parent(),
497 assert!(self.f.is_none());
500 .map(element_to_node_or_parent)
501 .chain(self.insertions.keys().map(|pos| match pos {
502 InsertPos::FirstChildOf(it) => it.clone(),
503 InsertPos::After(it) => element_to_node_or_parent(it),
505 // If we only have one replacement/insertion, we must return its parent node, since `rewrite` does
506 // not replace the node passed to it.
507 .map(|it| it.parent().unwrap_or(it))
508 .fold1(|a, b| least_common_ancestor(&a, &b).unwrap())
511 fn replacement(&self, element: &SyntaxElement) -> Option<Replacement> {
512 if let Some(f) = &self.f {
513 assert!(self.replacements.is_empty());
514 return f(element).map(Replacement::Single);
516 self.replacements.get(element).cloned()
519 fn insertions(&self, pos: &InsertPos) -> Option<impl Iterator<Item = SyntaxElement> + '_> {
520 self.insertions.get(pos).map(|insertions| insertions.iter().cloned())
523 fn rewrite_children(&self, node: &SyntaxNode) -> rowan::GreenNode {
524 let _p = profile::span("rewrite_children");
526 // FIXME: this could be made much faster.
527 let mut new_children = Vec::new();
528 if let Some(elements) = self.insertions(&InsertPos::FirstChildOf(node.clone())) {
529 new_children.extend(elements.map(element_to_green));
531 for child in node.children_with_tokens() {
532 self.rewrite_self(&mut new_children, &child);
535 rowan::GreenNode::new(rowan::SyntaxKind(node.kind() as u16), new_children)
540 acc: &mut Vec<NodeOrToken<rowan::GreenNode, rowan::GreenToken>>,
541 element: &SyntaxElement,
543 let _p = profile::span("rewrite_self");
545 if let Some(replacement) = self.replacement(&element) {
547 Replacement::Single(element) => acc.push(element_to_green(element)),
548 Replacement::Many(replacements) => {
549 acc.extend(replacements.into_iter().map(element_to_green))
551 Replacement::Delete => (),
555 NodeOrToken::Token(it) => acc.push(NodeOrToken::Token(it.green().clone())),
556 NodeOrToken::Node(it) => {
557 acc.push(NodeOrToken::Node(self.rewrite_children(it)));
561 if let Some(elements) = self.insertions(&InsertPos::After(element.clone())) {
562 acc.extend(elements.map(element_to_green));
567 fn element_to_green(element: SyntaxElement) -> NodeOrToken<rowan::GreenNode, rowan::GreenToken> {
569 NodeOrToken::Node(it) => NodeOrToken::Node(it.green().clone()),
570 NodeOrToken::Token(it) => NodeOrToken::Token(it.green().clone()),
574 impl ops::AddAssign for SyntaxRewriter<'_> {
575 fn add_assign(&mut self, rhs: SyntaxRewriter) {
576 assert!(rhs.f.is_none());
577 self.replacements.extend(rhs.replacements);
578 for (pos, insertions) in rhs.insertions.into_iter() {
579 match self.insertions.entry(pos) {
580 indexmap::map::Entry::Occupied(mut occupied) => {
581 occupied.get_mut().extend(insertions)
583 indexmap::map::Entry::Vacant(vacant) => drop(vacant.insert(insertions)),
589 #[derive(Clone, Debug)]
592 Single(SyntaxElement),
593 Many(Vec<SyntaxElement>),
598 new_children: Vec<NodeOrToken<rowan::GreenNode, rowan::GreenToken>>,
600 let _p = profile::span("with_children");
602 let new_green = rowan::GreenNode::new(rowan::SyntaxKind(parent.kind() as u16), new_children);
603 with_green(parent, new_green)
606 fn with_green(syntax_node: &SyntaxNode, green: rowan::GreenNode) -> SyntaxNode {
607 let len = green.children().map(|it| it.text_len()).sum::<TextSize>();
608 let new_root_node = syntax_node.replace_with(green);
609 let new_root_node = SyntaxNode::new_root(new_root_node);
611 // FIXME: use a more elegant way to re-fetch the node (#1185), make
612 // `range` private afterwards
613 let mut ptr = SyntaxNodePtr::new(syntax_node);
614 ptr.range = TextRange::at(ptr.range.start(), len);
615 ptr.to_node(&new_root_node)
618 fn position_of_child(parent: &SyntaxNode, child: SyntaxElement) -> usize {
620 .children_with_tokens()
621 .position(|it| it == child)
622 .expect("element is not a child of current element")
625 fn to_green_element(element: SyntaxElement) -> NodeOrToken<rowan::GreenNode, rowan::GreenToken> {
627 NodeOrToken::Node(it) => it.green().clone().into(),
628 NodeOrToken::Token(it) => it.green().clone().into(),
634 use expect_test::{expect, Expect};
635 use itertools::Itertools;
636 use parser::SyntaxKind;
637 use test_utils::mark;
638 use text_edit::TextEdit;
640 use crate::{AstNode, SyntaxElement};
643 fn replace_node_token() {
644 mark::check!(diff_node_token_replace);
655 Line 0: Token(USE_KW@0..3 "use") -> ident
667 fn replace_parent() {
668 mark::check!(diff_insert_as_first_child);
675 Line 0: AsFirstChild(Node(SOURCE_FILE@0..0))
691 mark::check!(diff_insert);
703 Line 2: After(Node(USE@10..18))
731 Line 2: After(Token(WHITESPACE@9..10 "\n"))
759 Line 0: After(Token(WHITESPACE@0..1 "\n"))
775 fn first_child_insertion() {
776 mark::check!(insert_first_child);
789 Line 0: AsFirstChild(Node(SOURCE_FILE@0..30))
806 mark::check!(diff_delete);
830 mark::check!(diff_insertions);
833 use expect_test::{expect, Expect};
834 use text_edit::TextEdit;
839 use expect_test::{expect, Expect};
846 Line 1: After(Node(USE@1..35))
848 -> use crate::AstNode;
856 Line 2: use text_edit::TextEdit;
858 Line 4: use crate::AstNode;
868 use text_edit::TextEdit;
882 Line 2: Token(IDENT@5..14 "text_edit") -> crate
883 Line 2: Token(IDENT@16..24 "TextEdit") -> AstNode
884 Line 2: Token(WHITESPACE@25..27 "\n\n") -> "\n"
888 Line 3: use crate::AstNode;
900 hash::BuildHasherDefault,
901 ops::{self, RangeInclusive},
906 use std::hash::BuildHasherDefault;
907 use std::ops::{self, RangeInclusive};
912 Line 2: After(Node(PATH_SEGMENT@5..8))
915 Line 6: After(Token(WHITESPACE@86..87 "\n"))
916 -> use std::hash::BuildHasherDefault;
918 -> use std::ops::{self, RangeInclusive};
923 Line 2: Token(IDENT@5..8 "std") -> std
930 hash::BuildHasherDefault,
931 ops::{self, RangeInclusive},
938 fn early_return_assist() {
942 if let Ok(x) = Err(92) {
949 let x = match Err(92) {
959 Line 3: After(Node(BLOCK_EXPR@40..63))
966 Line 3: After(Node(IF_EXPR@17..63))
972 Line 3: Token(IF_KW@17..19 "if") -> let
973 Line 3: Token(LET_KW@20..23 "let") -> x
974 Line 3: Node(BLOCK_EXPR@40..63) -> =
988 fn check_diff(from: &str, to: &str, expected_diff: Expect) {
989 let from_node = crate::SourceFile::parse(from).tree().syntax().clone();
990 let to_node = crate::SourceFile::parse(to).tree().syntax().clone();
991 let diff = super::diff(&from_node, &to_node);
994 |syn: &SyntaxElement| from[..syn.text_range().start().into()].lines().count();
996 let fmt_syntax = |syn: &SyntaxElement| match syn.kind() {
997 SyntaxKind::WHITESPACE => format!("{:?}", syn.to_string()),
998 _ => format!("{}", syn),
1002 diff.insertions.iter().format_with("\n", |(k, v), f| -> Result<(), std::fmt::Error> {
1004 "Line {}: {:?}\n-> {}",
1005 line_number(match k {
1006 super::TreeDiffInsertPos::After(syn) => syn,
1007 super::TreeDiffInsertPos::AsFirstChild(syn) => syn,
1010 v.iter().format_with("\n-> ", |v, f| f(&fmt_syntax(v)))
1014 let replacements = diff
1017 .sorted_by_key(|(syntax, _)| syntax.text_range().start())
1018 .format_with("\n", |(k, v), f| {
1019 f(&format!("Line {}: {:?} -> {}", line_number(k), k, fmt_syntax(v)))
1022 let deletions = diff
1025 .format_with("\n", |v, f| f(&format!("Line {}: {}", line_number(v), &fmt_syntax(v))));
1027 let actual = format!(
1028 "insertions:\n\n{}\n\nreplacements:\n\n{}\n\ndeletions:\n\n{}\n",
1029 insertions, replacements, deletions
1031 expected_diff.assert_eq(&actual);
1033 let mut from = from.to_owned();
1034 let mut text_edit = TextEdit::builder();
1035 diff.into_text_edit(&mut text_edit);
1036 text_edit.finish().apply(&mut from);
1037 assert_eq!(&*from, to, "diff did not turn `from` to `to`");