1
1
mirror of https://github.com/mawww/kakoune.git synced 2024-12-20 10:01:57 +03:00
kakoune/src/buffer.cc

433 lines
12 KiB
C++
Raw Normal View History

2011-09-02 20:51:20 +04:00
#include "buffer.hh"
#include "buffer_manager.hh"
#include "window.hh"
2011-09-09 23:24:18 +04:00
#include "assert.hh"
#include "utils.hh"
#include "context.hh"
#include "file.hh"
#include <algorithm>
2011-09-02 20:51:20 +04:00
namespace Kakoune
{
Buffer::Buffer(String name, Flags flags, std::vector<String> lines)
: m_name(std::move(name)), m_flags(flags | Flags::NoUndo),
2012-11-21 16:37:36 +04:00
m_history(), m_history_cursor(m_history.begin()),
m_last_save_undo_index(0),
2012-08-15 19:07:53 +04:00
m_timestamp(0),
m_hooks(GlobalHooks::instance()),
m_options(GlobalOptions::instance())
2011-09-02 20:51:20 +04:00
{
2012-08-08 21:36:40 +04:00
BufferManager::instance().register_buffer(*this);
if (flags & Flags::File)
m_name = real_path(m_name);
2012-11-27 16:39:35 +04:00
if (lines.empty())
lines.emplace_back("\n");
ByteCount pos = 0;
m_lines.reserve(lines.size());
for (auto& line : lines)
{
kak_assert(not line.empty() and line.back() == '\n');
m_lines.emplace_back(Line{ pos, std::move(line) });
pos += m_lines.back().length();
}
Editor editor_for_hooks(*this);
Context context(editor_for_hooks);
if (flags & Flags::File and flags & Flags::New)
m_hooks.run_hook("BufNew", m_name, context);
else
m_hooks.run_hook("BufOpen", m_name, context);
m_hooks.run_hook("BufCreate", m_name, context);
// now we may begin to record undo data
m_flags = flags;
2011-09-02 20:51:20 +04:00
}
2011-10-24 18:23:13 +04:00
Buffer::~Buffer()
{
2013-01-17 16:44:14 +04:00
{
Editor hook_editor{*this};
Context hook_context{hook_editor};
m_hooks.run_hook("BufClose", m_name, hook_context);
}
2012-08-08 21:36:40 +04:00
BufferManager::instance().unregister_buffer(*this);
kak_assert(m_change_listeners.empty());
2011-10-24 18:23:13 +04:00
}
String Buffer::display_name() const
{
if (m_flags & Flags::File)
return compact_path(m_name);
return m_name;
}
BufferIterator Buffer::iterator_at(const BufferCoord& line_and_column,
bool avoid_eol) const
2011-09-02 20:51:20 +04:00
{
return BufferIterator(*this, clamp(line_and_column, avoid_eol));
2011-09-02 20:51:20 +04:00
}
ByteCount Buffer::line_length(LineCount line) const
2011-09-02 20:51:20 +04:00
{
kak_assert(line < line_count());
ByteCount end = (line < line_count() - 1) ?
2012-06-25 21:05:32 +04:00
m_lines[line + 1].start : character_count();
return end - m_lines[line].start;
2011-09-02 20:51:20 +04:00
}
BufferCoord Buffer::clamp(const BufferCoord& line_and_column,
bool avoid_eol) const
2011-09-02 20:51:20 +04:00
{
if (m_lines.empty())
return BufferCoord();
2011-09-02 20:51:20 +04:00
BufferCoord result(line_and_column.line, line_and_column.column);
2012-10-02 16:08:09 +04:00
result.line = Kakoune::clamp(result.line, 0_line, line_count() - 1);
ByteCount max_col = std::max(0_byte, line_length(result.line) - (avoid_eol ? 2 : 1));
result.column = Kakoune::clamp(result.column, 0_byte, max_col);
2011-09-02 20:51:20 +04:00
return result;
}
BufferIterator Buffer::iterator_at_line_begin(LineCount line) const
{
line = Kakoune::clamp(line, 0_line, line_count()-1);
kak_assert(line_length(line) > 0);
return BufferIterator(*this, { line, 0 });
}
2013-03-13 17:25:22 +04:00
BufferIterator Buffer::iterator_at_line_begin(const BufferIterator& iterator) const
{
2013-03-13 17:25:22 +04:00
return iterator_at_line_begin(iterator.line());
}
BufferIterator Buffer::iterator_at_line_end(LineCount line) const
{
line = Kakoune::clamp(line, 0_line, line_count()-1);
kak_assert(line_length(line) > 0);
return ++BufferIterator(*this, { line, line_length(line) - 1 });
}
2013-03-13 17:25:22 +04:00
BufferIterator Buffer::iterator_at_line_end(const BufferIterator& iterator) const
{
return iterator_at_line_end(iterator.line());
}
2011-09-02 20:51:20 +04:00
BufferIterator Buffer::begin() const
{
return BufferIterator(*this, { 0_line, 0 });
2011-09-02 20:51:20 +04:00
}
BufferIterator Buffer::end() const
{
if (m_lines.empty())
return BufferIterator(*this, { 0_line, 0 });
return BufferIterator(*this, { line_count()-1, m_lines.back().length() });
2011-09-02 20:51:20 +04:00
}
ByteCount Buffer::character_count() const
2011-09-02 20:51:20 +04:00
{
if (m_lines.empty())
return 0;
2012-03-30 16:00:40 +04:00
return m_lines.back().start + m_lines.back().length();
2011-09-02 20:51:20 +04:00
}
LineCount Buffer::line_count() const
2011-09-22 17:58:35 +04:00
{
return LineCount(m_lines.size());
2011-09-22 17:58:35 +04:00
}
2012-03-09 01:23:29 +04:00
String Buffer::string(const BufferIterator& begin, const BufferIterator& end) const
2011-09-02 20:51:20 +04:00
{
String res;
for (LineCount line = begin.line(); line <= end.line(); ++line)
{
ByteCount start = 0;
if (line == begin.line())
start = begin.column();
ByteCount count = -1;
if (line == end.line())
count = end.column() - start;
res += m_lines[line].content.substr(start, count);
}
return res;
2011-09-02 20:51:20 +04:00
}
void Buffer::commit_undo_group()
{
if (m_flags & Flags::NoUndo)
return;
if (m_current_undo_group.empty())
return;
m_history.erase(m_history_cursor, m_history.end());
m_history.push_back(std::move(m_current_undo_group));
m_current_undo_group.clear();
m_history_cursor = m_history.end();
if (m_history.size() < m_last_save_undo_index)
m_last_save_undo_index = -1;
}
// A Modification holds a single atomic modification to Buffer
struct Buffer::Modification
{
enum Type { Insert, Erase };
Type type;
BufferIterator position;
String content;
Modification(Type type, BufferIterator position, String content)
: type(type), position(position), content(std::move(content)) {}
Modification inverse() const
{
2013-02-28 21:51:24 +04:00
Type inverse_type = Insert;
switch (type)
{
case Insert: inverse_type = Erase; break;
case Erase: inverse_type = Insert; break;
default: kak_assert(false);
}
2013-01-23 16:47:45 +04:00
return {inverse_type, position, content};
}
};
bool Buffer::undo()
{
commit_undo_group();
if (m_history_cursor == m_history.begin())
return false;
--m_history_cursor;
for (const Modification& modification : reversed(*m_history_cursor))
apply_modification(modification.inverse());
2012-06-05 17:33:02 +04:00
return true;
}
bool Buffer::redo()
{
if (m_history_cursor == m_history.end())
return false;
kak_assert(m_current_undo_group.empty());
for (const Modification& modification : *m_history_cursor)
apply_modification(modification);
++m_history_cursor;
2012-06-05 17:33:02 +04:00
return true;
}
void Buffer::check_invariant() const
{
#ifdef KAK_DEBUG
ByteCount start = 0;
kak_assert(not m_lines.empty());
for (auto& line : m_lines)
{
kak_assert(line.start == start);
kak_assert(line.length() > 0);
kak_assert(line.content.back() == '\n');
2012-03-30 16:00:40 +04:00
start += line.length();
}
#endif
}
void Buffer::do_insert(const BufferIterator& pos, const String& content)
{
kak_assert(pos.is_valid());
if (content.empty())
return;
2012-08-15 19:07:53 +04:00
++m_timestamp;
ByteCount offset = pos.offset();
// all following lines advanced by length
for (LineCount i = pos.line()+1; i < line_count(); ++i)
m_lines[i].start += content.length();
BufferIterator begin_it;
BufferIterator end_it;
// if we inserted at the end of the buffer, we have created a new
// line without inserting a '\n'
if (pos.is_end())
{
ByteCount start = 0;
for (ByteCount i = 0; i < content.length(); ++i)
{
if (content[i] == '\n')
{
m_lines.push_back({ offset + start, content.substr(start, i + 1 - start) });
start = i + 1;
}
}
if (start != content.length())
m_lines.push_back({ offset + start, content.substr(start) });
begin_it = pos.column() == 0 ? pos : BufferIterator{*this, { pos.line() + 1, 0 }};
end_it = end();
}
else
{
String prefix = m_lines[pos.line()].content.substr(0, pos.column());
String suffix = m_lines[pos.line()].content.substr(pos.column());
std::vector<Line> new_lines;
ByteCount start = 0;
for (ByteCount i = 0; i < content.length(); ++i)
{
if (content[i] == '\n')
{
String line_content = content.substr(start, i + 1 - start);
if (start == 0)
{
line_content = prefix + line_content;
new_lines.push_back({ offset + start - prefix.length(),
std::move(line_content) });
}
else
new_lines.push_back({ offset + start, std::move(line_content) });
start = i + 1;
}
}
if (start == 0)
new_lines.push_back({ offset + start - prefix.length(), prefix + content + suffix });
2012-08-10 16:22:57 +04:00
else if (start != content.length() or not suffix.empty())
new_lines.push_back({ offset + start, content.substr(start) + suffix });
LineCount last_line = pos.line() + new_lines.size() - 1;
auto line_it = m_lines.begin() + (int)pos.line();
*line_it = std::move(*new_lines.begin());
m_lines.insert(line_it+1, std::make_move_iterator(new_lines.begin() + 1),
std::make_move_iterator(new_lines.end()));
begin_it = pos;
end_it = BufferIterator{*this, { last_line, m_lines[last_line].length() - suffix.length() }};
}
for (auto listener : m_change_listeners)
listener->on_insert(begin_it, end_it);
}
2012-10-08 21:25:17 +04:00
void Buffer::do_erase(const BufferIterator& begin, const BufferIterator& end)
{
kak_assert(begin.is_valid());
kak_assert(end.is_valid());
2012-08-15 19:07:53 +04:00
++m_timestamp;
const ByteCount length = end - begin;
2012-10-08 21:25:17 +04:00
String prefix = m_lines[begin.line()].content.substr(0, begin.column());
String suffix = m_lines[end.line()].content.substr(end.column());
2012-10-08 21:25:17 +04:00
Line new_line = { m_lines[begin.line()].start, prefix + suffix };
if (new_line.length() != 0)
{
m_lines.erase(m_lines.begin() + (int)begin.line(), m_lines.begin() + (int)end.line());
m_lines[begin.line()] = std::move(new_line);
}
else
m_lines.erase(m_lines.begin() + (int)begin.line(), m_lines.begin() + (int)end.line() + 1);
2012-10-08 21:25:17 +04:00
for (LineCount i = begin.line()+1; i < line_count(); ++i)
m_lines[i].start -= length;
for (auto listener : m_change_listeners)
2012-10-08 21:25:17 +04:00
listener->on_erase(begin, end);
}
void Buffer::apply_modification(const Modification& modification)
{
const String& content = modification.content;
2013-01-23 17:27:21 +04:00
BufferIterator pos = modification.position;
// this may happen when a modification applied at the
// end of the buffer has been inverted for an undo.
if (not pos.is_end() and pos.column() == m_lines[pos.line()].length())
2013-01-23 17:27:21 +04:00
pos = { pos.buffer(), { pos.line() + 1, 0 }};
kak_assert(pos.is_valid());
switch (modification.type)
{
case Modification::Insert:
{
do_insert(pos, content);
break;
}
case Modification::Erase:
{
2012-10-11 03:17:29 +04:00
ByteCount count = content.length();
BufferIterator end = pos + count;
kak_assert(string(pos, end) == content);
2012-10-11 03:17:29 +04:00
do_erase(pos, end);
break;
}
default:
kak_assert(false);
}
}
void Buffer::insert(BufferIterator pos, String content)
{
if (content.empty())
return;
if (pos.is_end() and content.back() != '\n')
content += '\n';
if (not (m_flags & Flags::NoUndo))
m_current_undo_group.emplace_back(Modification::Insert, pos, content);
do_insert(pos, content);
}
void Buffer::erase(BufferIterator begin, BufferIterator end)
{
if (end.is_end() and (begin.column() != 0 or begin.is_begin()))
--end;
if (begin == end)
2012-03-13 01:31:27 +04:00
return;
if (not (m_flags & Flags::NoUndo))
m_current_undo_group.emplace_back(Modification::Erase, begin,
string(begin, end));
2012-10-08 21:25:17 +04:00
do_erase(begin, end);
}
2011-10-05 18:21:24 +04:00
bool Buffer::is_modified() const
{
2011-11-03 17:44:02 +04:00
size_t history_cursor_index = m_history_cursor - m_history.begin();
return m_last_save_undo_index != history_cursor_index
2011-10-05 18:21:24 +04:00
or not m_current_undo_group.empty();
}
void Buffer::notify_saved()
{
2012-12-19 21:56:20 +04:00
if (not m_current_undo_group.empty())
commit_undo_group();
2012-12-19 21:56:20 +04:00
m_flags &= ~Flags::New;
2011-11-03 17:44:02 +04:00
size_t history_cursor_index = m_history_cursor - m_history.begin();
if (m_last_save_undo_index != history_cursor_index)
{
++m_timestamp;
m_last_save_undo_index = history_cursor_index;
}
2011-10-05 18:21:24 +04:00
}
2011-09-02 20:51:20 +04:00
}