2012-01-31 20:12:06 +01:00
|
|
|
#ifndef selection_hh_INCLUDED
|
|
|
|
#define selection_hh_INCLUDED
|
|
|
|
|
|
|
|
#include "buffer.hh"
|
|
|
|
|
|
|
|
namespace Kakoune
|
|
|
|
{
|
|
|
|
|
2012-11-30 18:32:49 +01:00
|
|
|
// An oriented, inclusive buffer range
|
|
|
|
struct Range
|
2012-01-31 20:12:06 +01:00
|
|
|
{
|
2012-11-30 18:32:49 +01:00
|
|
|
public:
|
2013-06-03 18:58:09 +02:00
|
|
|
Range(const BufferCoord& first, const BufferCoord& last)
|
2012-11-30 18:32:49 +01:00
|
|
|
: m_first{first}, m_last{last} {}
|
2012-01-31 20:12:06 +01:00
|
|
|
|
2012-11-30 18:32:49 +01:00
|
|
|
void merge_with(const Range& range);
|
|
|
|
|
2013-06-03 18:58:09 +02:00
|
|
|
BufferCoord& first() { return m_first; }
|
|
|
|
BufferCoord& last() { return m_last; }
|
2012-11-30 18:32:49 +01:00
|
|
|
|
2013-06-03 18:58:09 +02:00
|
|
|
const BufferCoord& first() const { return m_first; }
|
|
|
|
const BufferCoord& last() const { return m_last; }
|
2012-01-31 20:12:06 +01:00
|
|
|
|
2012-12-11 19:51:59 +01:00
|
|
|
bool operator== (const Range& other) const
|
|
|
|
{
|
|
|
|
return m_first == other.m_first and m_last == other.m_last;
|
|
|
|
}
|
|
|
|
|
2013-06-03 18:58:09 +02:00
|
|
|
const BufferCoord& min() const { return std::min(m_first, m_last); }
|
|
|
|
const BufferCoord& max() const { return std::max(m_first, m_last); }
|
2012-01-31 20:12:06 +01:00
|
|
|
|
2012-11-30 18:32:49 +01:00
|
|
|
private:
|
2013-06-03 18:58:09 +02:00
|
|
|
BufferCoord m_first;
|
|
|
|
BufferCoord m_last;
|
2012-11-30 18:32:49 +01:00
|
|
|
};
|
2012-01-31 20:12:06 +01:00
|
|
|
|
2012-12-11 14:11:33 +01:00
|
|
|
inline bool overlaps(const Range& lhs, const Range& rhs)
|
|
|
|
{
|
2013-05-24 14:25:50 +02:00
|
|
|
return lhs.min() <= rhs.min() ? lhs.max() >= rhs.min()
|
|
|
|
: lhs.min() <= rhs.max();
|
2013-05-03 13:53:23 +02:00
|
|
|
}
|
|
|
|
|
2013-06-03 18:58:09 +02:00
|
|
|
inline String content(const Buffer& buffer, const Range& range)
|
|
|
|
{
|
|
|
|
return buffer.string(range.min(), buffer.char_next(range.max()));
|
|
|
|
}
|
|
|
|
|
2013-06-06 19:39:53 +02:00
|
|
|
inline BufferIterator erase(Buffer& buffer, const Range& range)
|
2013-06-03 18:58:09 +02:00
|
|
|
{
|
2013-06-06 19:39:53 +02:00
|
|
|
return buffer.erase(buffer.iterator_at(range.min()),
|
|
|
|
utf8::next(buffer.iterator_at(range.max())));
|
2013-06-03 18:58:09 +02:00
|
|
|
}
|
|
|
|
|
2012-11-30 18:32:49 +01:00
|
|
|
using CaptureList = std::vector<String>;
|
|
|
|
|
|
|
|
// A selection is a Range, associated with a CaptureList
|
2012-12-11 19:51:59 +01:00
|
|
|
struct Selection : public Range
|
2012-11-30 18:32:49 +01:00
|
|
|
{
|
2013-06-03 18:58:09 +02:00
|
|
|
Selection(const BufferCoord& first, const BufferCoord& last,
|
2012-12-11 19:51:59 +01:00
|
|
|
CaptureList captures = {})
|
2013-01-04 18:39:13 +01:00
|
|
|
: Range(first, last), m_captures(std::move(captures)) {}
|
2012-11-19 14:19:31 +01:00
|
|
|
|
2013-04-22 14:18:49 +02:00
|
|
|
Selection(const Range& range)
|
|
|
|
: Range(range) {}
|
|
|
|
|
2012-11-30 18:32:49 +01:00
|
|
|
CaptureList& captures() { return m_captures; }
|
|
|
|
const CaptureList& captures() const { return m_captures; }
|
|
|
|
|
2012-09-26 20:33:47 +02:00
|
|
|
private:
|
2012-11-30 18:32:49 +01:00
|
|
|
CaptureList m_captures;
|
2012-02-10 00:47:55 +01:00
|
|
|
};
|
2013-05-02 19:04:59 +02:00
|
|
|
|
|
|
|
struct SelectionList : std::vector<Selection>
|
|
|
|
{
|
2013-06-18 21:43:44 +02:00
|
|
|
SelectionList() = default;
|
|
|
|
SelectionList(Selection s) : std::vector<Selection>{s} {}
|
2013-05-02 19:04:59 +02:00
|
|
|
|
2013-06-01 00:48:46 +02:00
|
|
|
void update_insert(const Buffer& buffer, const BufferCoord& begin, const BufferCoord& end);
|
|
|
|
void update_erase(const Buffer& buffer, const BufferCoord& begin, const BufferCoord& end);
|
2013-05-03 13:38:48 +02:00
|
|
|
|
|
|
|
void check_invariant() const;
|
2013-05-02 19:04:59 +02:00
|
|
|
};
|
2012-02-10 00:47:55 +01:00
|
|
|
|
2012-01-31 20:12:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif // selection_hh_INCLUDED
|