kakoune/src/buffer.cc

317 lines
8.4 KiB
C++
Raw Normal View History

2011-09-02 18:51:20 +02:00
#include "buffer.hh"
#include "buffer_manager.hh"
#include "window.hh"
2011-09-09 21:24:18 +02:00
#include "assert.hh"
#include "utils.hh"
#include "hooks_manager.hh"
#include "context.hh"
#include <algorithm>
2011-09-02 18:51:20 +02:00
namespace Kakoune
{
template<typename T>
T clamp(T min, T max, T val)
{
if (val < min)
return min;
if (val > max)
return max;
return val;
}
2011-10-07 16:15:55 +02:00
Buffer::Buffer(const std::string& name, Type type,
2012-03-08 22:23:29 +01:00
const String& initial_content)
2011-10-07 16:15:55 +02:00
: m_name(name), m_type(type),
m_history(1), m_history_cursor(m_history.begin()),
2012-03-12 22:31:27 +01:00
m_last_save_undo_index(0)
2011-09-02 18:51:20 +02:00
{
BufferManager::instance().register_buffer(this);
2012-03-12 22:31:27 +01:00
if (not initial_content.empty())
apply_modification(Modification::make_insert(begin(), initial_content));
if (type == Type::NewFile)
GlobalHooksManager::instance().run_hook("BufCreate", name, Context(*this));
else if (type == Type::File)
GlobalHooksManager::instance().run_hook("BufOpen", name, Context(*this));
2011-09-02 18:51:20 +02:00
}
2011-10-24 16:23:13 +02:00
Buffer::~Buffer()
{
m_windows.clear();
assert(m_modification_listeners.empty());
}
BufferIterator Buffer::iterator_at(const BufferCoord& line_and_column) const
2011-09-02 18:51:20 +02:00
{
if (m_lines.empty())
return begin();
2011-11-24 15:23:41 +01:00
BufferCoord clamped = clamp(line_and_column);
return BufferIterator(*this, m_lines[clamped.line] + clamped.column);
2011-09-02 18:51:20 +02:00
}
BufferCoord Buffer::line_and_column_at(const BufferIterator& iterator) const
2011-09-02 18:51:20 +02:00
{
BufferCoord result;
2011-09-02 18:51:20 +02:00
if (not m_lines.empty())
{
result.line = line_at(iterator);
result.column = iterator.m_position - m_lines[result.line];
}
return result;
}
BufferPos Buffer::line_at(const BufferIterator& iterator) const
{
auto it = std::upper_bound(m_lines.begin(), m_lines.end(),
iterator.m_position);
return it - m_lines.begin() - 1;
2011-09-02 18:51:20 +02:00
}
BufferSize Buffer::line_length(BufferPos line) const
{
assert(not m_lines.empty());
2012-02-27 20:52:36 +01:00
BufferPos end = (line < m_lines.size() - 1) ?
2012-03-12 22:39:54 +01:00
m_lines[line + 1] : length();
2011-09-02 18:51:20 +02:00
return end - m_lines[line];
}
BufferCoord Buffer::clamp(const BufferCoord& line_and_column) const
2011-09-02 18:51:20 +02:00
{
if (m_lines.empty())
return BufferCoord();
2011-09-02 18:51:20 +02:00
BufferCoord result(line_and_column.line, line_and_column.column);
result.line = Kakoune::clamp<int>(0, m_lines.size() - 1, result.line);
int max_col = std::max(0, line_length(result.line)-2);
2011-11-24 15:23:41 +01:00
result.column = Kakoune::clamp<int>(0, max_col, result.column);
2011-09-02 18:51:20 +02:00
return result;
}
BufferIterator Buffer::iterator_at_line_begin(const BufferIterator& iterator) const
{
return BufferIterator(*this, m_lines[line_at(iterator)]);
}
BufferIterator Buffer::iterator_at_line_end(const BufferIterator& iterator) const
{
BufferPos line = line_at(iterator) + 1;
return line < m_lines.size() ? BufferIterator(*this, m_lines[line]) : end();
}
2011-09-02 18:51:20 +02:00
BufferIterator Buffer::begin() const
{
return BufferIterator(*this, 0);
}
BufferIterator Buffer::end() const
{
return BufferIterator(*this, length());
}
BufferSize Buffer::length() const
{
return m_content.size();
}
2011-09-22 15:58:35 +02:00
BufferSize Buffer::line_count() const
{
return m_lines.size();
2011-09-22 15:58:35 +02:00
}
2012-03-08 22:23:29 +01:00
String Buffer::string(const BufferIterator& begin, const BufferIterator& end) const
2011-09-02 18:51:20 +02:00
{
return m_content.substr(begin.m_position, end - begin);
}
void Buffer::begin_undo_group()
{
assert(m_current_undo_group.empty());
m_history.erase(m_history_cursor, m_history.end());
2011-11-03 14:44:02 +01:00
if (m_history.size() < m_last_save_undo_index)
m_last_save_undo_index = -1;
m_history_cursor = m_history.end();
}
void Buffer::end_undo_group()
{
m_history.push_back(m_current_undo_group);
m_history_cursor = m_history.end();
m_current_undo_group.clear();
}
Modification Modification::inverse() const
{
Type inverse_type;
switch (type)
{
case Insert: inverse_type = Erase; break;
case Erase: inverse_type = Insert; break;
default: assert(false);
}
return Modification(inverse_type, position, content);
}
bool Buffer::undo()
{
if (m_history_cursor == m_history.begin())
return false;
--m_history_cursor;
for (const Modification& modification : reversed(*m_history_cursor))
apply_modification(modification.inverse());
}
bool Buffer::redo()
{
if (m_history_cursor == m_history.end())
return false;
for (const Modification& modification : *m_history_cursor)
apply_modification(modification);
++m_history_cursor;
}
void Buffer::update_lines(const Modification& modification)
{
size_t length = modification.content.length();
const BufferPos pos = modification.position.m_position;
const BufferPos endpos = pos + length;
// find the first line beginning after modification position
auto line_it = std::upper_bound(m_lines.begin(), m_lines.end(), pos);
if (modification.type == Modification::Insert)
{
// all following lines advanced by length
for (auto it = line_it; it != m_lines.end(); ++it)
*it += length;
std::vector<BufferPos> new_lines;
// if we inserted at the end of the buffer, we may have created a new
// line without inserting a '\n'
2012-03-12 15:26:46 +01:00
if (endpos == m_content.size() and
(pos == 0 or m_content[pos-1] == '\n'))
new_lines.push_back(pos);
// every \n inserted that was not the last buffer character created a
// new line
for (BufferPos i = pos; i < endpos and i + 1 < m_content.size(); ++i)
{
if (m_content[i] == '\n')
new_lines.push_back(i + 1);
}
m_lines.insert(line_it, new_lines.begin(), new_lines.end());
}
else if (modification.type == Modification::Erase)
{
// find the first line beginning after endpos
auto end = std::upper_bound(line_it, m_lines.end(), endpos);
// all the lines until the end moved back by length
for (auto it = end; it != m_lines.end(); ++it)
{
*it -= length;
assert(m_content[(*it)-1] == '\n');
}
// if we erased from the beginning of a line until the end of
// the buffer, that line also needs to be erased
if (pos == m_content.size() and *(line_it-1) == pos)
--line_it;
m_lines.erase(line_it, end);
}
else
assert(false);
}
void Buffer::apply_modification(const Modification& modification)
{
switch (modification.type)
{
case Modification::Insert:
m_content.insert(modification.position.m_position,
modification.content);
break;
case Modification::Erase:
{
size_t size = modification.content.size();
assert(string(modification.position, modification.position + size)
== modification.content);
m_content.erase(modification.position.m_position, size);
break;
}
default:
assert(false);
}
update_lines(modification);
for (auto listener : m_modification_listeners)
listener->on_modification(modification);
}
void Buffer::modify(Modification&& modification)
{
2012-03-12 22:31:27 +01:00
if (modification.content.empty())
return;
apply_modification(modification);
m_current_undo_group.push_back(std::move(modification));
}
Window* Buffer::get_or_create_window()
{
if (m_windows.empty())
m_windows.push_front(std::unique_ptr<Window>(new Window(*this)));
return m_windows.front().get();
}
void Buffer::delete_window(Window* window)
{
assert(&window->buffer() == this);
auto window_it = std::find(m_windows.begin(), m_windows.end(), window);
assert(window_it != m_windows.end());
m_windows.erase(window_it);
}
2011-10-05 16:21:24 +02:00
bool Buffer::is_modified() const
{
2011-11-03 14:44:02 +01:00
size_t history_cursor_index = m_history_cursor - m_history.begin();
return m_last_save_undo_index != history_cursor_index
2011-10-05 16:21:24 +02:00
or not m_current_undo_group.empty();
}
void Buffer::notify_saved()
{
2011-11-03 14:44:02 +01:00
size_t history_cursor_index = m_history_cursor - m_history.begin();
m_last_save_undo_index = history_cursor_index;
2011-10-05 16:21:24 +02:00
}
void Buffer::register_modification_listener(ModificationListener* listener)
{
assert(listener);
assert(not contains(m_modification_listeners, listener));
m_modification_listeners.push_back(listener);
}
void Buffer::unregister_modification_listener(ModificationListener* listener)
{
assert(listener);
auto it = std::find(m_modification_listeners.begin(),
m_modification_listeners.end(),
listener);
assert(it != m_modification_listeners.end());
m_modification_listeners.erase(it);
}
2011-09-02 18:51:20 +02:00
}