Fix pasting after when selections are overlapping

With overlapping selections, pasting after breaks assumption of
SelectionList::for_each as our changes are no longer happening in
increasing locations.

We hence cannot rely on the ForwardChangeTracker in that case and
have to rely on the more general (and more costly) ranges update logic.

This interacts poorly with paste linewise pastes and we try to preserve
the current behaviour by tracking the last paste position.

Overall, this change really begs for overlapping selections to be
removed, but we will fix them like that for now.

Fixes #4779
This commit is contained in:
Maxime Coste 2022-11-28 20:27:44 +11:00
parent 760a45556c
commit 2688893156
10 changed files with 58 additions and 26 deletions

View File

@ -82,7 +82,7 @@ void update_backward(ConstArrayView<Buffer::Change> changes, RangeContainer& ran
} }
template<typename RangeContainer> template<typename RangeContainer>
void update_ranges(Buffer& buffer, size_t& timestamp, RangeContainer&& ranges) void update_ranges(Buffer& buffer, size_t timestamp, RangeContainer&& ranges)
{ {
if (timestamp == buffer.timestamp()) if (timestamp == buffer.timestamp())
return; return;
@ -104,7 +104,6 @@ void update_ranges(Buffer& buffer, size_t& timestamp, RangeContainer&& ranges)
change_it = backward_end; change_it = backward_end;
} }
} }
timestamp = buffer.timestamp();
} }
} }

View File

@ -1588,6 +1588,7 @@ void option_list_postprocess(Vector<RangeAndString, MemoryDomain::Options>& opt)
void option_update(RangeAndStringList& opt, const Context& context) void option_update(RangeAndStringList& opt, const Context& context)
{ {
update_ranges(context.buffer(), opt.prefix, opt.list); update_ranges(context.buffer(), opt.prefix, opt.list);
opt.prefix = context.buffer().timestamp();
} }
bool option_add_from_strings(Vector<RangeAndString, MemoryDomain::Options>& opt, ConstArrayView<String> strs) bool option_add_from_strings(Vector<RangeAndString, MemoryDomain::Options>& opt, ConstArrayView<String> strs)
@ -1618,6 +1619,7 @@ private:
auto& buffer = context.context.buffer(); auto& buffer = context.context.buffer();
auto& range_and_faces = get_option(context); auto& range_and_faces = get_option(context);
update_ranges(buffer, range_and_faces.prefix, range_and_faces.list); update_ranges(buffer, range_and_faces.prefix, range_and_faces.list);
range_and_faces.prefix = buffer.timestamp();
for (auto& [range, face] : range_and_faces.list) for (auto& [range, face] : range_and_faces.list)
{ {
@ -1662,6 +1664,7 @@ private:
auto& sels = context.context.selections(); auto& sels = context.context.selections();
auto& range_and_faces = get_option(context); auto& range_and_faces = get_option(context);
update_ranges(buffer, range_and_faces.prefix, range_and_faces.list); update_ranges(buffer, range_and_faces.prefix, range_and_faces.list);
range_and_faces.prefix = buffer.timestamp();
for (auto& [range, spec] : range_and_faces.list) for (auto& [range, spec] : range_and_faces.list)
{ {
@ -1693,6 +1696,7 @@ private:
auto& range_and_faces = get_option(context); auto& range_and_faces = get_option(context);
const int tabstop = context.context.options()["tabstop"].get<int>(); const int tabstop = context.context.options()["tabstop"].get<int>();
update_ranges(buffer, range_and_faces.prefix, range_and_faces.list); update_ranges(buffer, range_and_faces.prefix, range_and_faces.list);
range_and_faces.prefix = buffer.timestamp();
for (auto& [range, spec] : range_and_faces.list) for (auto& [range, spec] : range_and_faces.list)
{ {

View File

@ -1470,7 +1470,7 @@ private:
context().selections().for_each([strings, &buffer=context().buffer()] context().selections().for_each([strings, &buffer=context().buffer()]
(size_t index, Selection& sel) { (size_t index, Selection& sel) {
Kakoune::insert(buffer, sel, sel.cursor(), strings[std::min(strings.size()-1, index)]); Kakoune::insert(buffer, sel, sel.cursor(), strings[std::min(strings.size()-1, index)]);
}); }, false);
} }
void insert(Codepoint key) void insert(Codepoint key)

View File

@ -495,6 +495,8 @@ void InsertCompleter::reset()
{ {
auto& buffer = m_context.buffer(); auto& buffer = m_context.buffer();
update_ranges(buffer, m_completions.timestamp, m_inserted_ranges); update_ranges(buffer, m_completions.timestamp, m_inserted_ranges);
m_completions.timestamp = buffer.timestamp();
hook_param = join(m_inserted_ranges | filter([](auto&& r) { return not r.empty(); }) | transform([&](auto&& r) { hook_param = join(m_inserted_ranges | filter([](auto&& r) { return not r.empty(); }) | transform([&](auto&& r) {
return selection_to_string(ColumnType::Byte, buffer, {r.begin, buffer.char_prev(r.end)}); return selection_to_string(ColumnType::Byte, buffer, {r.begin, buffer.char_prev(r.end)});
}), ' '); }), ' ');

View File

@ -429,7 +429,7 @@ void replace_with_char(Context& context, NormalParams)
context.selections().for_each([&](size_t index, Selection& sel) { context.selections().for_each([&](size_t index, Selection& sel) {
CharCount count = char_length(buffer, sel); CharCount count = char_length(buffer, sel);
replace(buffer, sel, String{*cp, count}); replace(buffer, sel, String{*cp, count});
}); }, false);
}, "replace with char", "enter char to replace with\n"); }, "replace with char", "enter char to replace with\n");
} }
@ -455,7 +455,7 @@ void for_each_codepoint(Context& context, NormalParams)
begin != end; ++begin) begin != end; ++begin)
utf8::dump(std::back_inserter(str), func(*begin)); utf8::dump(std::back_inserter(str), func(*begin));
replace(buffer, sel, str); replace(buffer, sel, str);
}); }, false);
} }
void command(const Context& context, EnvVarMap env_vars, char reg = 0) void command(const Context& context, EnvVarMap env_vars, char reg = 0)
@ -664,14 +664,14 @@ enum class PasteMode
Replace Replace
}; };
BufferCoord paste_pos(Buffer& buffer, const Selection& sel, PasteMode mode, bool linewise) BufferCoord paste_pos(Buffer& buffer, BufferCoord min, BufferCoord max, PasteMode mode, bool linewise)
{ {
switch (mode) switch (mode)
{ {
case PasteMode::Append: case PasteMode::Append:
return linewise ? std::min(buffer.line_count(), sel.max().line+1) : buffer.char_next(sel.max()); return linewise ? std::min(buffer.line_count(), max.line+1) : buffer.char_next(max);
case PasteMode::Insert: case PasteMode::Insert:
return linewise ? sel.min().line : sel.min(); return linewise ? min.line : min;
default: default:
kak_assert(false); kak_assert(false);
return {}; return {};
@ -690,16 +690,17 @@ void paste(Context& context, NormalParams params)
auto& buffer = context.buffer(); auto& buffer = context.buffer();
ScopedEdition edition(context); ScopedEdition edition(context);
ScopedSelectionEdition selection_edition{context}; ScopedSelectionEdition selection_edition{context};
context.selections().for_each([&](size_t index, Selection& sel) { context.selections().for_each([&, last=BufferCoord{}](size_t index, Selection& sel) mutable {
auto& str = strings[std::min(strings.size()-1, index)]; auto& str = strings[std::min(strings.size()-1, index)];
auto& min = sel.min(); auto& min = sel.min();
auto& max = sel.max(); auto& max = sel.max();
BufferRange range = (mode == PasteMode::Replace) ? BufferRange range = (mode == PasteMode::Replace) ?
buffer.replace(min, buffer.char_next(max), str) buffer.replace(min, buffer.char_next(max), str)
: buffer.insert(paste_pos(buffer, sel, mode, linewise), str); : buffer.insert(paste_pos(buffer, min, std::max(max, last), mode, linewise), str);
min = range.begin; min = range.begin;
max = range.end > range.begin ? buffer.char_prev(range.end) : range.begin; max = range.end > range.begin ? buffer.char_prev(range.end) : range.begin;
}); last = max;
}, mode == PasteMode::Append);
} }
template<PasteMode mode> template<PasteMode mode>
@ -733,7 +734,7 @@ void paste_all(Context& context, NormalParams params)
selections.for_each([&](size_t, const Selection& sel) { selections.for_each([&](size_t, const Selection& sel) {
auto range = (mode == PasteMode::Replace) ? auto range = (mode == PasteMode::Replace) ?
buffer.replace(sel.min(), buffer.char_next(sel.max()), all) buffer.replace(sel.min(), buffer.char_next(sel.max()), all)
: buffer.insert(paste_pos(buffer, sel, mode, linewise), all); : buffer.insert(paste_pos(buffer, sel.min(), sel.max(), mode, linewise), all);
ByteCount pos_offset = 0; ByteCount pos_offset = 0;
BufferCoord pos = range.begin; BufferCoord pos = range.begin;
@ -744,7 +745,7 @@ void paste_all(Context& context, NormalParams params)
pos = buffer.next(end); pos = buffer.next(end);
pos_offset = offset; pos_offset = offset;
} }
}); }, mode == PasteMode::Append);
} }
selections = std::move(result); selections = std::move(result);
} }
@ -784,10 +785,10 @@ void insert_output(Context& context, NormalParams params)
auto& min = sel.min(); auto& min = sel.min();
auto& max = sel.max(); auto& max = sel.max();
auto range = insert(buffer, sel, paste_pos(buffer, sel, mode, false), out); auto range = insert(buffer, sel, paste_pos(buffer, min, max, mode, false), out);
min = range.begin; min = range.begin;
max = range.end > range.begin ? buffer.char_prev(range.end) : range.begin; max = range.end > range.begin ? buffer.char_prev(range.end) : range.begin;
}); }, mode == PasteMode::Append);
selections.set_main_index(old_main); selections.set_main_index(old_main);
}); });
} }

View File

@ -362,22 +362,45 @@ static void fix_overflowing_selections(Vector<Selection>& selections,
} }
} }
void SelectionList::for_each(ApplyFunc func) bool any_overlaps(ConstArrayView<Selection> sels)
{
for (int i = 0; i + 1 < sels.size(); ++i)
{
if (overlaps(sels[i], sels[i+1]))
return true;
}
return false;
}
void SelectionList::for_each(ApplyFunc func, bool may_append)
{ {
update(); update();
ForwardChangesTracker changes_tracker; if (may_append and any_overlaps(m_selections))
for (size_t index = 0; index < m_selections.size(); ++index)
{ {
auto& sel = m_selections[index]; size_t timestamp = m_buffer->timestamp();
for (size_t index = 0; index < m_selections.size(); ++index)
{
auto& sel = m_selections[index];
update_ranges(*m_buffer, timestamp, ArrayView<Selection>(sel));
func(index, sel);
}
}
else
{
ForwardChangesTracker changes_tracker;
for (size_t index = 0; index < m_selections.size(); ++index)
{
auto& sel = m_selections[index];
sel.anchor() = changes_tracker.get_new_coord_tolerant(sel.anchor()); sel.anchor() = changes_tracker.get_new_coord_tolerant(sel.anchor());
sel.cursor() = changes_tracker.get_new_coord_tolerant(sel.cursor()); sel.cursor() = changes_tracker.get_new_coord_tolerant(sel.cursor());
kak_assert(m_buffer->is_valid(sel.anchor()) and m_buffer->is_valid(sel.cursor())); kak_assert(m_buffer->is_valid(sel.anchor()) and m_buffer->is_valid(sel.cursor()));
func(index, sel); func(index, sel);
changes_tracker.update(*m_buffer, m_timestamp); changes_tracker.update(*m_buffer, m_timestamp);
}
} }
// We might just have been deleting text if strings were empty, // We might just have been deleting text if strings were empty,
@ -414,7 +437,7 @@ void SelectionList::replace(ConstArrayView<String> strings)
for_each([&](size_t index, Selection& sel) { for_each([&](size_t index, Selection& sel) {
Kakoune::replace(*m_buffer, sel, strings[std::min(strings.size()-1, index)]); Kakoune::replace(*m_buffer, sel, strings[std::min(strings.size()-1, index)]);
}); }, false);
} }
void SelectionList::erase() void SelectionList::erase()

View File

@ -137,7 +137,7 @@ struct SelectionList
void force_timestamp(size_t timestamp) { m_timestamp = timestamp; } void force_timestamp(size_t timestamp) { m_timestamp = timestamp; }
using ApplyFunc = FunctionRef<void (size_t index, Selection& sel)>; using ApplyFunc = FunctionRef<void (size_t index, Selection& sel)>;
void for_each(ApplyFunc apply); void for_each(ApplyFunc apply, bool may_append);
void replace(ConstArrayView<String> strings); void replace(ConstArrayView<String> strings);

View File

@ -0,0 +1 @@
../../../../../../../../../../../