#ifndef display_buffer_hh_INCLUDED #define display_buffer_hh_INCLUDED #include "face.hh" #include "hash.hh" #include "coord.hh" #include "string.hh" #include "vector.hh" #include "hash_map.hh" namespace Kakoune { class Buffer; struct BufferRange{ BufferCoord begin, end; }; inline bool operator==(const BufferRange& lhs, const BufferRange& rhs) { return lhs.begin == rhs.begin and lhs.end == rhs.end; } inline size_t hash_value(const BufferRange& range) { return hash_values(range.begin, range.end); } struct DisplayAtom : public UseMemoryDomain { public: enum Type { Range, ReplacedRange, Text }; DisplayAtom(const Buffer& buffer, BufferCoord begin, BufferCoord end) : m_type(Range), m_buffer(&buffer), m_range{begin, end} {} DisplayAtom(String str, Face face = Face{}) : m_type(Text), m_text(std::move(str)), face(face) {} StringView content() const; ColumnCount length() const; const BufferCoord& begin() const { kak_assert(has_buffer_range()); return m_range.begin; } const BufferCoord& end() const { kak_assert(has_buffer_range()); return m_range.end; } void replace(String text) { kak_assert(m_type == Range); m_type = ReplacedRange; m_text = std::move(text); } bool has_buffer_range() const { return m_type == Range or m_type == ReplacedRange; } const Buffer& buffer() const { kak_assert(m_buffer); return *m_buffer; } Type type() const { return m_type; } void trim_begin(ColumnCount count); void trim_end(ColumnCount count); bool operator==(const DisplayAtom& other) const { return face == other.face and type() == other.type() and content() == other.content(); } public: Face face; private: friend class DisplayLine; Type m_type; const Buffer* m_buffer = nullptr; BufferRange m_range; String m_text; }; using AtomList = Vector; class DisplayLine : public UseMemoryDomain { public: using iterator = AtomList::iterator; using const_iterator = AtomList::const_iterator; using value_type = AtomList::value_type; DisplayLine() = default; DisplayLine(AtomList atoms); DisplayLine(String str, Face face = Face{}) { push_back({ std::move(str), face }); } iterator begin() { return m_atoms.begin(); } iterator end() { return m_atoms.end(); } const_iterator begin() const { return m_atoms.begin(); } const_iterator end() const { return m_atoms.end(); } const AtomList& atoms() const { return m_atoms; } ColumnCount length() const; const BufferRange& range() const { return m_range; } // Split atom pointed by it at buffer coord pos, // returns an iterator to the first atom iterator split(iterator it, BufferCoord pos); // Split atom pointed by it at its pos column, // returns an iterator to the first atom iterator split(iterator it, ColumnCount pos); iterator insert(iterator it, DisplayAtom atom); iterator erase(iterator beg, iterator end); void push_back(DisplayAtom atom); // remove first_col from the begining of the line, and make sure // the line is less that col_count character void trim(ColumnCount first_col, ColumnCount col_count, bool only_buffer); // Merge together consecutive atoms sharing the same display attributes void optimize(); private: void compute_range(); BufferRange m_range = { { INT_MAX, INT_MAX }, { INT_MIN, INT_MIN } }; AtomList m_atoms; }; DisplayLine parse_display_line(StringView line, const HashMap& builtins = {}); class DisplayBuffer : public UseMemoryDomain { public: using LineList = Vector; DisplayBuffer() {} LineList& lines() { return m_lines; } const LineList& lines() const { return m_lines; } // returns the smallest BufferRange which contains every DisplayAtoms const BufferRange& range() const { return m_range; } void compute_range(); // Optimize all lines, set DisplayLine::optimize void optimize(); private: LineList m_lines; BufferRange m_range; }; } #endif // display_buffer_hh_INCLUDED