#[derive(Clone, Debug, PartialEq, Eq)]
pub struct TextEdit {
pub start: usize,
pub end: usize,
pub replacement: String,
}
#[derive(Clone, Debug, Default, PartialEq, Eq)]
pub struct ReferencePlan {
pub edits: Vec<TextEdit>,
pub unresolved: Vec<String>,
}
impl ReferencePlan {
pub fn is_empty(&self) -> bool {
self.edits.is_empty() && self.unresolved.is_empty()
}
}
pub fn check_text_edits(source: &str, edits: &[TextEdit]) -> Result<(), String> {
let mut ordered: Vec<&TextEdit> = edits.iter().collect();
ordered.sort_by_key(|edit| (edit.start, edit.end));
let mut previous_end: Option<usize> = None;
for edit in ordered {
if edit.start > edit.end {
return Err(format!(
"edit range {}..{} is inverted",
edit.start, edit.end
));
}
if edit.end > source.len() {
return Err(format!(
"edit range {}..{} runs past the {} bytes it was planned against",
edit.start,
edit.end,
source.len()
));
}
if !source.is_char_boundary(edit.start) || !source.is_char_boundary(edit.end) {
return Err(format!(
"edit range {}..{} splits a UTF-8 character",
edit.start, edit.end
));
}
if previous_end.is_some_and(|end| edit.start < end) {
return Err(format!(
"edit range {}..{} overlaps the previous edit",
edit.start, edit.end
));
}
previous_end = Some(edit.end);
}
Ok(())
}
pub fn apply_text_edits(source: &str, edits: &[TextEdit]) -> String {
match apply_text_edits_checked(source, edits) {
Ok(rewritten) => rewritten,
Err(_) => source.to_owned(),
}
}
pub fn apply_text_edits_checked(source: &str, edits: &[TextEdit]) -> Result<String, String> {
check_text_edits(source, edits)?;
let mut ordered: Vec<&TextEdit> = edits.iter().collect();
ordered.sort_by_key(|edit| std::cmp::Reverse(edit.start));
let mut output = source.to_owned();
for edit in ordered {
output.replace_range(edit.start..edit.end, &edit.replacement);
}
Ok(output)
}
#[cfg(test)]
#[path = "text_edit_tests.rs"]
mod text_edit_tests;