mirror of
https://github.com/mawww/kakoune.git
synced 2024-12-01 16:32:54 +03:00
241 lines
6.0 KiB
C++
241 lines
6.0 KiB
C++
#include "display_buffer.hh"
|
|
|
|
#include "assert.hh"
|
|
#include "buffer.hh"
|
|
#include "utf8.hh"
|
|
|
|
namespace Kakoune
|
|
{
|
|
|
|
StringView DisplayAtom::content() const
|
|
{
|
|
switch (m_type)
|
|
{
|
|
case BufferRange:
|
|
{
|
|
auto line = (*m_buffer)[m_range.begin.line];
|
|
if (m_range.begin.line == m_range.end.line)
|
|
return line.substr(m_range.begin.column, m_range.end.column - m_range.begin.column);
|
|
else if (m_range.begin.line+1 == m_range.end.line and m_range.end.column == 0)
|
|
return line.substr(m_range.begin.column);
|
|
break;
|
|
}
|
|
case Text:
|
|
case ReplacedBufferRange:
|
|
return m_text;
|
|
}
|
|
kak_assert(false);
|
|
return {};
|
|
}
|
|
|
|
CharCount DisplayAtom::length() const
|
|
{
|
|
switch (m_type)
|
|
{
|
|
case BufferRange:
|
|
return utf8::distance(m_buffer->iterator_at(m_range.begin),
|
|
m_buffer->iterator_at(m_range.end));
|
|
case Text:
|
|
case ReplacedBufferRange:
|
|
return m_text.char_length();
|
|
}
|
|
kak_assert(false);
|
|
return 0;
|
|
}
|
|
|
|
void DisplayAtom::trim_begin(CharCount count)
|
|
{
|
|
if (m_type == BufferRange)
|
|
m_range.begin = utf8::advance(m_buffer->iterator_at(m_range.begin),
|
|
m_buffer->iterator_at(m_range.end), count).coord();
|
|
else
|
|
m_text = m_text.substr(count).str();
|
|
check_invariant();
|
|
}
|
|
|
|
void DisplayAtom::trim_end(CharCount count)
|
|
{
|
|
if (m_type == BufferRange)
|
|
m_range.end = utf8::advance(m_buffer->iterator_at(m_range.end),
|
|
m_buffer->iterator_at(m_range.begin), -count).coord();
|
|
else
|
|
m_text = m_text.substr(0, m_text.char_length() - count).str();
|
|
check_invariant();
|
|
}
|
|
|
|
void DisplayAtom::check_invariant() const
|
|
{
|
|
#ifdef KAK_DEBUG
|
|
if (has_buffer_range())
|
|
{
|
|
kak_assert(m_buffer->is_valid(m_range.begin));
|
|
kak_assert(m_buffer->is_valid(m_range.end));
|
|
}
|
|
#endif
|
|
}
|
|
|
|
DisplayLine::DisplayLine(AtomList atoms)
|
|
: m_atoms(std::move(atoms))
|
|
{
|
|
compute_range();
|
|
}
|
|
|
|
DisplayLine::iterator DisplayLine::split(iterator it, ByteCoord pos)
|
|
{
|
|
kak_assert(it->type() == DisplayAtom::BufferRange);
|
|
kak_assert(it->begin() < pos);
|
|
kak_assert(it->end() > pos);
|
|
|
|
DisplayAtom atom = *it;
|
|
atom.m_range.end = pos;
|
|
it->m_range.begin = pos;
|
|
atom.check_invariant();
|
|
it->check_invariant();
|
|
return m_atoms.insert(it, std::move(atom));
|
|
}
|
|
|
|
DisplayLine::iterator DisplayLine::insert(iterator it, DisplayAtom atom)
|
|
{
|
|
if (atom.has_buffer_range())
|
|
{
|
|
m_range.begin = std::min(m_range.begin, atom.begin());
|
|
m_range.end = std::max(m_range.end, atom.end());
|
|
}
|
|
return m_atoms.insert(it, std::move(atom));
|
|
}
|
|
|
|
void DisplayLine::push_back(DisplayAtom atom)
|
|
{
|
|
if (atom.has_buffer_range())
|
|
{
|
|
m_range.begin = std::min(m_range.begin, atom.begin());
|
|
m_range.end = std::max(m_range.end, atom.end());
|
|
}
|
|
m_atoms.push_back(std::move(atom));
|
|
}
|
|
|
|
DisplayLine::iterator DisplayLine::erase(iterator beg, iterator end)
|
|
{
|
|
iterator res = m_atoms.erase(beg, end);
|
|
compute_range();
|
|
return res;
|
|
}
|
|
|
|
void DisplayLine::optimize()
|
|
{
|
|
if (m_atoms.empty())
|
|
return;
|
|
|
|
auto atom_it = m_atoms.begin();
|
|
auto next_atom_it = atom_it + 1;
|
|
while (next_atom_it != m_atoms.end())
|
|
{
|
|
auto& atom = *atom_it;
|
|
auto& next_atom = *next_atom_it;
|
|
bool merged = false;
|
|
|
|
if (atom.face == next_atom.face and
|
|
atom.type() == next_atom.type())
|
|
{
|
|
auto type = atom.type();
|
|
if ((type == DisplayAtom::BufferRange or
|
|
type == DisplayAtom::ReplacedBufferRange) and
|
|
next_atom.begin() == atom.end())
|
|
{
|
|
atom.m_range.end = next_atom.end();
|
|
if (type == DisplayAtom::ReplacedBufferRange)
|
|
atom.m_text += next_atom.m_text;
|
|
merged = true;
|
|
}
|
|
if (type == DisplayAtom::Text)
|
|
{
|
|
atom.m_text += next_atom.m_text;
|
|
merged = true;
|
|
}
|
|
}
|
|
if (merged)
|
|
next_atom_it = m_atoms.erase(next_atom_it);
|
|
else
|
|
atom_it = next_atom_it++;
|
|
atom_it->check_invariant();
|
|
}
|
|
}
|
|
|
|
CharCount DisplayLine::length() const
|
|
{
|
|
CharCount len = 0;
|
|
for (auto& atom : m_atoms)
|
|
len += atom.length();
|
|
return len;
|
|
}
|
|
|
|
void DisplayLine::trim(CharCount first_char, CharCount char_count, bool only_buffer)
|
|
{
|
|
for (auto it = begin(); first_char > 0 and it != end(); )
|
|
{
|
|
if (only_buffer and not it->has_buffer_range())
|
|
{
|
|
++it;
|
|
continue;
|
|
}
|
|
|
|
auto len = it->length();
|
|
if (len <= first_char)
|
|
{
|
|
m_atoms.erase(it);
|
|
first_char -= len;
|
|
}
|
|
else
|
|
{
|
|
it->trim_begin(first_char);
|
|
first_char = 0;
|
|
}
|
|
}
|
|
auto it = begin();
|
|
for (; it != end() and char_count > 0; ++it)
|
|
char_count -= it->length();
|
|
|
|
if (char_count < 0)
|
|
(it-1)->trim_end(-char_count);
|
|
m_atoms.erase(it, end());
|
|
|
|
compute_range();
|
|
}
|
|
|
|
const BufferRange init_range{ {INT_MAX, INT_MAX}, {INT_MIN, INT_MIN} };
|
|
|
|
void DisplayLine::compute_range()
|
|
{
|
|
m_range = init_range;
|
|
for (auto& atom : m_atoms)
|
|
{
|
|
if (not atom.has_buffer_range())
|
|
continue;
|
|
m_range.begin = std::min(m_range.begin, atom.begin());
|
|
m_range.end = std::max(m_range.end, atom.end());
|
|
}
|
|
if (m_range == init_range)
|
|
m_range = { { 0, 0 }, { 0, 0 } };
|
|
kak_assert(m_range.begin <= m_range.end);
|
|
}
|
|
|
|
void DisplayBuffer::compute_range()
|
|
{
|
|
m_range = init_range;
|
|
for (auto& line : m_lines)
|
|
{
|
|
m_range.begin = std::min(line.range().begin, m_range.begin);
|
|
m_range.end = std::max(line.range().end, m_range.end);
|
|
}
|
|
if (m_range == init_range)
|
|
m_range = { { 0, 0 }, { 0, 0 } };
|
|
kak_assert(m_range.begin <= m_range.end);
|
|
}
|
|
|
|
void DisplayBuffer::optimize()
|
|
{
|
|
for (auto& line : m_lines)
|
|
line.optimize();
|
|
}
|
|
}
|