#ifndef selection_hh_INCLUDED #define selection_hh_INCLUDED #include "coord.hh" #include "range.hh" #include "safe_ptr.hh" #include "utils.hh" #include "string.hh" #include "vector.hh" #include namespace Kakoune { class Buffer; using BufferRange = Range; using CaptureList = Vector; constexpr ColumnCount max_column{std::numeric_limits::max()}; constexpr ColumnCount max_non_eol_column{max_column-1}; struct BasicSelection { static constexpr MemoryDomain Domain = MemoryDomain::Selections; BasicSelection() = default; BasicSelection(BufferCoord pos) : BasicSelection(pos,pos) {} BasicSelection(BufferCoord anchor, BufferCoordAndTarget cursor) : m_anchor{anchor}, m_cursor{cursor} {} BufferCoord& anchor() { return m_anchor; } BufferCoordAndTarget& cursor() { return m_cursor; } const BufferCoord& anchor() const { return m_anchor; } const BufferCoordAndTarget& cursor() const { return m_cursor; } void set(BufferCoord anchor, BufferCoord cursor) { m_anchor = anchor; m_cursor = cursor; } void set(BufferCoord coord) { set(coord, coord); } friend bool operator==(const BasicSelection&, const BasicSelection&) = default; // When selections are single char, we want the anchor to be considered min, and cursor max const BufferCoord& min() const { return m_anchor <= m_cursor ? m_anchor : m_cursor; } const BufferCoord& max() const { return m_anchor <= m_cursor ? m_cursor : m_anchor; } BufferCoord& min() { return m_anchor <= m_cursor ? m_anchor : m_cursor; } BufferCoord& max() { return m_anchor <= m_cursor ? m_cursor : m_anchor; } private: BufferCoord m_anchor; BufferCoordAndTarget m_cursor; }; struct Selection : BasicSelection { Selection() = default; Selection(BufferCoord pos) : BasicSelection(pos,pos) {} Selection(BufferCoord anchor, BufferCoordAndTarget cursor, CaptureList captures = {}) : BasicSelection{anchor, cursor}, m_captures(std::move(captures)) {} CaptureList& captures() { return m_captures; } const CaptureList& captures() const { return m_captures; } friend bool operator==(const Selection&, const Selection&) = default; private: CaptureList m_captures; }; inline bool overlaps(const BasicSelection& lhs, const BasicSelection& rhs) { return lhs.min() <= rhs.min() ? lhs.max() >= rhs.min() : lhs.min() <= rhs.max(); } void update_selections(Vector& selections, size_t& main, const Buffer& buffer, size_t timestamp, bool merge = true); bool compare_selections(const Selection& lhs, const Selection& rhs); void sort_selections(Vector& selections, size_t& main); void merge_overlapping_selections(Vector& selections, size_t& main); void clamp_selections(Vector& sel, const Buffer& buffer); void replace(Buffer& buffer, Selection& sel, StringView content); BufferRange insert(Buffer& buffer, Selection& sel, BufferCoord pos, StringView content); struct SelectionList { static constexpr MemoryDomain Domain = MemoryDomain::Selections; ~SelectionList(); SelectionList(Buffer& buffer, Selection s); SelectionList(Buffer& buffer, Selection s, size_t timestamp); SelectionList(Buffer& buffer, Vector s); SelectionList(Buffer& buffer, Vector s, size_t timestamp); SelectionList(const SelectionList&); SelectionList(SelectionList&&); SelectionList& operator=(const SelectionList&); SelectionList& operator=(SelectionList&&); void update(bool merge = true); void check_invariant() const; const Selection& main() const { return (*this)[m_main]; } Selection& main() { return (*this)[m_main]; } size_t main_index() const { return m_main; } void set_main_index(size_t main) { kak_assert(main < size()); m_main = main; } void push_back(const Selection& sel) { m_selections.push_back(sel); } void push_back(Selection&& sel) { m_selections.push_back(std::move(sel)); } Selection& operator[](size_t i) { return m_selections[i]; } const Selection& operator[](size_t i) const { return m_selections[i]; } void set(Vector list, size_t main); SelectionList& operator=(Vector list) { const size_t main_index = list.size()-1; set(std::move(list), main_index); return *this; } using iterator = Vector::iterator; iterator begin() { return m_selections.begin(); } iterator end() { return m_selections.end(); } using const_iterator = Vector::const_iterator; const_iterator begin() const { return m_selections.begin(); } const_iterator end() const { return m_selections.end(); } void remove(size_t index); void remove_from(size_t index); const Selection* data() const { return m_selections.data(); } size_t size() const { return m_selections.size(); } bool operator==(const SelectionList& other) const { return m_buffer == other.m_buffer and m_selections == other.m_selections; } void sort(); void merge_overlapping(); void merge_consecutive(); void sort_and_merge_overlapping(); Buffer& buffer() const { return *m_buffer; } size_t timestamp() const { return m_timestamp; } void force_timestamp(size_t timestamp) { m_timestamp = timestamp; } using ApplyFunc = FunctionRef; void for_each(ApplyFunc apply, bool may_append); void replace(ConstArrayView strings); void erase(); private: size_t m_main = 0; Vector m_selections; SafePtr m_buffer; size_t m_timestamp; }; Vector compute_modified_ranges(const Buffer& buffer, size_t timestamp); enum class ColumnType { Byte, Codepoint, DisplayColumn }; Selection selection_from_string(ColumnType column_type, const Buffer& buffer, StringView desc, ColumnCount tabstop = -1); String selection_to_string(ColumnType column_type, const Buffer& buffer, const Selection& selection, ColumnCount tabstop = -1); String selection_list_to_string(ColumnType column_type, const SelectionList& selections, ColumnCount tabstop = -1); SelectionList selection_list_from_strings(Buffer& buffer, ColumnType column_type, ConstArrayView descs, size_t timestamp, size_t main, ColumnCount tabstop = -1); } #endif // selection_hh_INCLUDED