1
1
mirror of https://github.com/mawww/kakoune.git synced 2024-12-23 11:32:20 +03:00
kakoune/src/selection.hh

84 lines
2.0 KiB
C++
Raw Normal View History

#ifndef selection_hh_INCLUDED
#define selection_hh_INCLUDED
#include "buffer.hh"
namespace Kakoune
{
// An oriented, inclusive buffer range
struct Range
{
public:
Range(const BufferIterator& first, const BufferIterator& last)
: m_first{first}, m_last{last} {}
void merge_with(const Range& range);
BufferIterator& first() { return m_first; }
BufferIterator& last() { return m_last; }
const BufferIterator& first() const { return m_first; }
const BufferIterator& last() const { return m_last; }
bool operator== (const Range& other) const
{
return m_first == other.m_first and m_last == other.m_last;
}
2012-02-28 00:01:59 +04:00
// returns min(first, last)
BufferIterator begin() const;
2012-02-28 00:01:59 +04:00
// returns max(first, last) + 1
BufferIterator end() const;
2013-02-27 22:11:25 +04:00
String content() const;
void check_invariant() const;
private:
BufferIterator m_first;
BufferIterator m_last;
};
inline bool overlaps(const Range& lhs, const Range& rhs)
{
return (lhs.first() <= rhs.first() and lhs.last() >= rhs.first()) or
(lhs.first() <= rhs.last() and lhs.last() >= rhs.last());
}
using CaptureList = std::vector<String>;
// A selection is a Range, associated with a CaptureList
struct Selection : public Range
{
Selection(const BufferIterator& first, const BufferIterator& last,
CaptureList captures = {})
2013-01-04 21:39:13 +04:00
: Range(first, last), m_captures(std::move(captures)) {}
Selection(const Range& range)
: Range(range) {}
void avoid_eol();
CaptureList& captures() { return m_captures; }
const CaptureList& captures() const { return m_captures; }
const Buffer& buffer() const { return first().buffer(); }
private:
CaptureList m_captures;
};
struct SelectionList : std::vector<Selection>
{
using std::vector<Selection>::vector;
void update_insert(const BufferCoord& begin, const BufferCoord& end);
void update_erase(const BufferCoord& begin, const BufferCoord& end);
2013-05-03 15:38:48 +04:00
void check_invariant() const;
};
}
#endif // selection_hh_INCLUDED