summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
Diffstat (limited to 'src')
-rw-r--r--src/edit.zig18
-rw-r--r--src/lib_editor.zig12
2 files changed, 30 insertions, 0 deletions
diff --git a/src/edit.zig b/src/edit.zig
index 8c59ffa1..32943c19 100644
--- a/src/edit.zig
+++ b/src/edit.zig
@@ -1563,6 +1563,24 @@ fn mapThroughChanges(chs: []const sam.Op, pos: usize) usize {
return @intCast(@as(i64, @intCast(pos)) + delta);
}
+/// The bytes from `from` to `to` replaced with `bytes` (the library's
+/// `replace`), every range following the edit as `normalAlign`'s do; a step
+/// to undo of its own when `step`, else part of the one before it.
+pub fn replaceBytes(e: Editor, t: *Text, from: usize, to: usize, bytes: []const u8, step: bool) Error!void {
+ const expl = t.vsel.active and t.vsel.explicit;
+ const text = try flatSurface(e, t);
+ var rs: [Text.max_selections]modal.Selection = undefined;
+ const got = t.ranges(text, 0, &rs);
+ const ch = [1]sam.Op{.{ .q0 = @intCast(from), .q1 = @intCast(to), .text = bytes }};
+ var cells: [Text.max_selections]Text.Cells = undefined;
+ for (rs[0..got.n], cells[0..got.n]) |r, *cell| {
+ const c = Text.rangeCells(text, r);
+ cell.* = .{ .cur = mapThroughChanges(&ch, c.cur), .anc = mapThroughChanges(&ch, c.anc) };
+ }
+ if (step) try pushUndo(e, t);
+ try setEditCells(e, t, try sam.apply(e.gpa, text, &ch), 0, cells[0..got.n], got.pri, expl);
+}
+
/// `J` / `Alt-J`: join every range's lines with the next, in ONE edit
/// (helix join_selections): the newline and the next line's leading blanks
/// become one space, or nothing when that line is blank, and a line two
diff --git a/src/lib_editor.zig b/src/lib_editor.zig
index f9149ef0..9bfa5cff 100644
--- a/src/lib_editor.zig
+++ b/src/lib_editor.zig
@@ -384,6 +384,18 @@ pub fn Editor(comptime cap: Capacity) type {
return ed.keep(a, live, .done);
}
+ /// The bytes from `from` to `to` replaced with `with`, as one step
+ /// to undo, the ranges following as an edit moves them (one inside
+ /// the bytes goes to their start). `join`: part of the step before
+ /// it instead, as the frames of a drag after its first, so one undo
+ /// takes the whole drag back.
+ pub fn replace(ed: *Self, a: std.mem.Allocator, from: usize, to: usize, with: []const u8, join: bool) Outcome {
+ std.debug.assert(from <= to and to <= ed.len());
+ const live = ed.thaw(a, null) catch return .{ .refused = .out_of_memory };
+ edit.replaceBytes(live.context(a), &live.text, from, to, with, !join) catch return .{ .refused = .out_of_memory };
+ return ed.keep(a, live, .done);
+ }
+
/// The register `name`'s values, one per range that wrote it.
pub fn register(ed: *const Self, a: std.mem.Allocator, name: u21) error{OutOfMemory}!?[]const []const u8 {
var r: Registers = .{};