115 lines
3.6 KiB
C++
115 lines
3.6 KiB
C++
#include "selection.hh"
|
|
|
|
#include "utf8.hh"
|
|
|
|
namespace Kakoune
|
|
{
|
|
|
|
void Selection::merge_with(const Selection& range)
|
|
{
|
|
m_cursor = range.m_cursor;
|
|
if (m_anchor < m_cursor)
|
|
m_anchor = std::min(m_anchor, range.m_anchor);
|
|
if (m_anchor > m_cursor)
|
|
m_anchor = std::max(m_anchor, range.m_anchor);
|
|
}
|
|
|
|
namespace
|
|
{
|
|
|
|
template<template <bool, bool> class UpdateFunc>
|
|
void on_buffer_change(const Buffer& buffer, SelectionList& sels,
|
|
BufferCoord begin, BufferCoord end, LineCount end_line)
|
|
{
|
|
auto update_beg = std::lower_bound(sels.begin(), sels.end(), begin,
|
|
[](const Selection& s, BufferCoord c)
|
|
{ return s.max() < c; });
|
|
auto update_only_line_beg = std::upper_bound(sels.begin(), sels.end(), end_line,
|
|
[](LineCount l, const Selection& s)
|
|
{ return l < s.min().line; });
|
|
|
|
if (update_beg != update_only_line_beg)
|
|
{
|
|
// for the first one, we are not sure if min < begin
|
|
UpdateFunc<false, false>{}(buffer, update_beg->anchor(), begin, end);
|
|
UpdateFunc<false, false>{}(buffer, update_beg->cursor(), begin, end);
|
|
}
|
|
for (auto it = update_beg+1; it < update_only_line_beg; ++it)
|
|
{
|
|
UpdateFunc<false, true>{}(buffer, it->anchor(), begin, end);
|
|
UpdateFunc<false, true>{}(buffer, it->cursor(), begin, end);
|
|
}
|
|
if (end.line > begin.line)
|
|
{
|
|
for (auto it = update_only_line_beg; it != sels.end(); ++it)
|
|
{
|
|
UpdateFunc<true, true>{}(buffer, it->anchor(), begin, end);
|
|
UpdateFunc<true, true>{}(buffer, it->cursor(), begin, end);
|
|
}
|
|
}
|
|
}
|
|
|
|
template<bool assume_different_line, bool assume_greater_than_begin>
|
|
struct UpdateInsert
|
|
{
|
|
void operator()(const Buffer& buffer, BufferCoord& coord,
|
|
BufferCoord begin, BufferCoord end) const
|
|
{
|
|
if (assume_different_line)
|
|
kak_assert(begin.line < coord.line);
|
|
if (not assume_greater_than_begin and coord < begin)
|
|
return;
|
|
if (not assume_different_line and begin.line == coord.line)
|
|
coord.column = end.column + coord.column - begin.column;
|
|
|
|
coord.line += end.line - begin.line;
|
|
}
|
|
};
|
|
|
|
template<bool assume_different_line, bool assume_greater_than_begin>
|
|
struct UpdateErase
|
|
{
|
|
void operator()(const Buffer& buffer, BufferCoord& coord,
|
|
BufferCoord begin, BufferCoord end) const
|
|
{
|
|
if (not assume_greater_than_begin and coord < begin)
|
|
return;
|
|
if (assume_different_line)
|
|
kak_assert(end.line < coord.line);
|
|
if (not assume_different_line and coord <= end)
|
|
coord = buffer.clamp(begin);
|
|
else
|
|
{
|
|
if (not assume_different_line and end.line == coord.line)
|
|
{
|
|
coord.line = begin.line;
|
|
coord.column = begin.column + coord.column - end.column;
|
|
}
|
|
else
|
|
coord.line -= end.line - begin.line;
|
|
}
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
void SelectionList::update_insert(const Buffer& buffer, BufferCoord begin, BufferCoord end)
|
|
{
|
|
on_buffer_change<UpdateInsert>(buffer, *this, begin, end, begin.line);
|
|
}
|
|
|
|
void SelectionList::update_erase(const Buffer& buffer, BufferCoord begin, BufferCoord end)
|
|
{
|
|
on_buffer_change<UpdateErase>(buffer, *this, begin, end, end.line);
|
|
}
|
|
|
|
void SelectionList::check_invariant() const
|
|
{
|
|
kak_assert(size() > 0);
|
|
kak_assert(m_main < size());
|
|
for (size_t i = 0; i+1 < size(); ++ i)
|
|
kak_assert((*this)[i].min() <= (*this)[i+1].min());
|
|
}
|
|
|
|
}
|