#[derive(Clone, Copy, Debug, Eq, PartialEq)]
pub struct RopeEditDelta {
pub at: usize,
pub removed_bytes: usize,
pub inserted_bytes: usize,
}
impl RopeEditDelta {
#[must_use]
pub fn insert(at: usize, inserted_bytes: usize) -> Self {
Self {
at,
removed_bytes: 0,
inserted_bytes,
}
}
#[must_use]
pub fn delete(at: usize, removed_bytes: usize) -> Self {
Self {
at,
removed_bytes,
inserted_bytes: 0,
}
}
#[must_use]
pub fn replace(at: usize, removed_bytes: usize, inserted_bytes: usize) -> Self {
Self {
at,
removed_bytes,
inserted_bytes,
}
}
#[must_use]
pub fn shift(&self) -> isize {
self.inserted_bytes as isize - self.removed_bytes as isize
}
#[must_use]
pub fn pre_edit_range(&self) -> (usize, usize) {
(self.at, self.at + self.removed_bytes)
}
}
#[must_use]
pub fn transform_byte_through(byte: usize, delta: RopeEditDelta) -> Option<usize> {
let (lo, hi) = delta.pre_edit_range();
if byte <= lo {
return Some(byte);
}
if byte >= hi {
return Some(((byte as isize) + delta.shift()).max(0) as usize);
}
None
}
#[must_use]
pub fn transform_range_through(
start: usize,
end: usize,
delta: RopeEditDelta,
) -> Option<(usize, usize)> {
let (lo, hi) = delta.pre_edit_range();
if end <= lo {
return Some((start, end));
}
if start >= hi {
let shift = delta.shift();
let new_start = ((start as isize) + shift).max(0) as usize;
let new_end = ((end as isize) + shift).max(0) as usize;
return Some((new_start, new_end));
}
None
}
#[must_use]
pub fn transform_range_through_chain(
start: usize,
end: usize,
deltas: &[RopeEditDelta],
) -> Option<(usize, usize)> {
let mut s = start;
let mut e = end;
for delta in deltas {
let (ns, ne) = transform_range_through(s, e, *delta)?;
s = ns;
e = ne;
}
Some((s, e))
}
#[must_use]
pub fn transform_container_range_through(
start: usize,
end: usize,
delta: RopeEditDelta,
) -> Option<(usize, usize)> {
let (lo, hi) = delta.pre_edit_range();
if hi <= start {
let shift = delta.shift();
let new_start = ((start as isize) + shift).max(0) as usize;
let new_end = ((end as isize) + shift).max(0) as usize;
return Some((new_start, new_end));
}
if lo >= end {
return Some((start, end));
}
if lo >= start && hi <= end {
let new_end = ((end as isize) + delta.shift()).max(start as isize) as usize;
if new_end <= start {
return None;
}
return Some((start, new_end));
}
None
}
#[must_use]
pub fn transform_container_range_through_chain(
start: usize,
end: usize,
deltas: &[RopeEditDelta],
) -> Option<(usize, usize)> {
let mut s = start;
let mut e = end;
for delta in deltas {
let (ns, ne) = transform_container_range_through(s, e, *delta)?;
s = ns;
e = ne;
}
Some((s, e))
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn range_before_edit_is_unchanged() {
let d = RopeEditDelta::insert(100, 5);
assert_eq!(transform_range_through(10, 50, d), Some((10, 50)));
}
#[test]
fn range_after_insertion_shifts_forward() {
let d = RopeEditDelta::insert(100, 5);
assert_eq!(transform_range_through(200, 250, d), Some((205, 255)));
}
#[test]
fn range_after_deletion_shifts_back() {
let d = RopeEditDelta::delete(100, 5);
assert_eq!(transform_range_through(200, 250, d), Some((195, 245)));
}
#[test]
fn range_overlapping_edit_drops() {
let d = RopeEditDelta::replace(100, 5, 3);
assert_eq!(transform_range_through(95, 110, d), None);
assert_eq!(transform_range_through(102, 110, d), None);
assert_eq!(transform_range_through(80, 102, d), None);
}
#[test]
fn range_touching_edit_boundary_is_preserved() {
let d = RopeEditDelta::insert(100, 5);
assert_eq!(transform_range_through(50, 100, d), Some((50, 100)));
assert_eq!(transform_range_through(100, 200, d), Some((105, 205)));
}
#[test]
fn chain_applies_in_order() {
let chain = [
RopeEditDelta::insert(50, 3), RopeEditDelta::insert(60, 2), ];
assert_eq!(
transform_range_through_chain(100, 120, &chain),
Some((105, 125))
);
}
#[test]
fn chain_drops_if_any_delta_intersects() {
let chain = [
RopeEditDelta::insert(50, 3),
RopeEditDelta::replace(110, 5, 1), ];
assert_eq!(transform_range_through_chain(100, 120, &chain), None);
}
#[test]
fn container_interior_insert_extends_end_only() {
let d = RopeEditDelta::insert(110, 1);
assert_eq!(
transform_container_range_through(100, 200, d),
Some((100, 201))
);
}
#[test]
fn container_interior_delete_shrinks_end_only() {
let d = RopeEditDelta::delete(110, 4);
assert_eq!(
transform_container_range_through(100, 200, d),
Some((100, 196))
);
}
#[test]
fn container_edit_before_shifts_both() {
let d = RopeEditDelta::insert(50, 5);
assert_eq!(
transform_container_range_through(100, 200, d),
Some((105, 205))
);
}
#[test]
fn container_edit_after_is_unchanged() {
let d = RopeEditDelta::insert(300, 5);
assert_eq!(
transform_container_range_through(100, 200, d),
Some((100, 200))
);
}
#[test]
fn container_insert_at_start_boundary_pushes_range_forward() {
let d = RopeEditDelta::insert(100, 1);
assert_eq!(
transform_container_range_through(100, 200, d),
Some((101, 201))
);
}
#[test]
fn container_insert_at_end_boundary_stays_outside() {
let d = RopeEditDelta::insert(200, 1);
assert_eq!(
transform_container_range_through(100, 200, d),
Some((100, 200))
);
}
#[test]
fn container_full_range_delete_collapses_to_none() {
let d = RopeEditDelta::delete(100, 100);
assert_eq!(transform_container_range_through(100, 200, d), None);
}
#[test]
fn container_edit_straddling_start_boundary_drops() {
let d = RopeEditDelta::replace(90, 20, 3);
assert_eq!(transform_container_range_through(100, 200, d), None);
}
#[test]
fn container_edit_straddling_end_boundary_drops() {
let d = RopeEditDelta::replace(190, 30, 3);
assert_eq!(transform_container_range_through(100, 200, d), None);
}
#[test]
fn container_chain_threads_interior_edits() {
let chain = [
RopeEditDelta::insert(50, 5), RopeEditDelta::insert(150, 2), RopeEditDelta::delete(160, 1), ];
assert_eq!(
transform_container_range_through_chain(100, 200, &chain),
Some((105, 206))
);
}
}