1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
|
#ifndef buffer_iterator_inl_h_INCLUDED
#define buffer_iterator_inl_h_INCLUDED
#include "assert.hh"
namespace Kakoune
{
inline BufferIterator::BufferIterator(const Buffer& buffer, BufferCoord coord)
: m_buffer(&buffer), m_coord(coord)
{
assert(is_valid());
}
inline const Buffer& BufferIterator::buffer() const
{
assert(m_buffer);
return *m_buffer;
}
inline bool BufferIterator::is_valid() const
{
return m_buffer and
((line() < m_buffer->line_count() and
column() < m_buffer->m_lines[line()].length()) or
((line() == m_buffer->line_count() and column() == 0)) or
(line() == m_buffer->line_count() - 1 and
column() == m_buffer->m_lines.back().length()));
}
inline void BufferIterator::clamp(bool avoid_eol)
{
assert(m_buffer);
m_coord = m_buffer->clamp(m_coord, avoid_eol);
}
inline bool BufferIterator::operator==(const BufferIterator& iterator) const
{
assert(m_buffer == iterator.m_buffer);
return (m_coord == iterator.m_coord);
}
inline bool BufferIterator::operator!=(const BufferIterator& iterator) const
{
assert(m_buffer == iterator.m_buffer);
return (m_coord != iterator.m_coord);
}
inline bool BufferIterator::operator<(const BufferIterator& iterator) const
{
assert(m_buffer == iterator.m_buffer);
return (m_coord < iterator.m_coord);
}
inline bool BufferIterator::operator<=(const BufferIterator& iterator) const
{
assert(m_buffer == iterator.m_buffer);
return (m_coord <= iterator.m_coord);
}
inline bool BufferIterator::operator>(const BufferIterator& iterator) const
{
assert(m_buffer == iterator.m_buffer);
return (m_coord > iterator.m_coord);
}
inline bool BufferIterator::operator>=(const BufferIterator& iterator) const
{
assert(m_buffer == iterator.m_buffer);
return (m_coord >= iterator.m_coord);
}
inline void BufferIterator::on_insert(const BufferCoord& begin,
const BufferCoord& end)
{
if (m_coord < begin)
return;
if (begin.line == line())
m_coord.column = end.column + m_coord.column - begin.column;
m_coord.line += end.line - begin.line;
assert(is_valid());
}
inline void BufferIterator::on_erase(const BufferCoord& begin,
const BufferCoord& end)
{
if (m_coord < begin)
return;
if (m_coord <= end)
m_coord = begin;
else
{
if (end.line == m_coord.line)
{
m_coord.line = begin.line;
m_coord.column = begin.column + m_coord.column - end.column;
}
else
m_coord.line -= end.line - begin.line;
}
if (is_end())
operator--();
assert(is_valid());
}
inline char BufferIterator::operator*() const
{
assert(m_buffer);
return m_buffer->m_lines[line()].content[column()];
}
inline ByteCount BufferIterator::offset() const
{
assert(m_buffer);
return line() == 0 ? column()
: m_buffer->m_lines[line()].start + column();
}
inline size_t BufferIterator::operator-(const BufferIterator& iterator) const
{
assert(m_buffer == iterator.m_buffer);
return (size_t)(int)(offset() - iterator.offset());
}
inline BufferIterator BufferIterator::operator+(ByteCount size) const
{
assert(m_buffer);
if (size >= 0)
{
ByteCount o = std::min(m_buffer->character_count(), offset() + size);
for (LineCount i = line() + 1; i < m_buffer->line_count(); ++i)
{
if (m_buffer->m_lines[i].start > o)
return BufferIterator(*m_buffer, { i-1, o - m_buffer->m_lines[i-1].start });
}
LineCount last_line = std::max(0_line, m_buffer->line_count() - 1);
return BufferIterator(*m_buffer, { last_line, o - m_buffer->m_lines[last_line].start });
}
return operator-(-size);
}
inline BufferIterator BufferIterator::operator-(ByteCount size) const
{
assert(m_buffer);
if (size >= 0)
{
ByteCount o = std::max(0_byte, offset() - size);
for (LineCount i = line(); i >= 0; --i)
{
if (m_buffer->m_lines[i].start <= o)
return BufferIterator(*m_buffer, { i, o - m_buffer->m_lines[i].start });
}
assert(false);
}
return operator+(-size);
}
inline BufferIterator& BufferIterator::operator+=(ByteCount size)
{
return *this = (*this + size);
}
inline BufferIterator& BufferIterator::operator-=(ByteCount size)
{
return *this = (*this - size);
}
inline BufferIterator& BufferIterator::operator++()
{
if (column() < m_buffer->m_lines[line()].length() - 1)
++m_coord.column;
else if (line() == m_buffer->line_count() - 1)
m_coord.column = m_buffer->m_lines.back().length();
else
{
++m_coord.line;
m_coord.column = 0;
}
return *this;
}
inline BufferIterator& BufferIterator::operator--()
{
if (column() == 0)
{
if (line() > 0)
{
--m_coord.line;
m_coord.column = m_buffer->m_lines[m_coord.line].length() - 1;
}
}
else
--m_coord.column;
return *this;
}
inline BufferIterator BufferIterator::operator++(int)
{
BufferIterator save = *this;
++*this;
return save;
}
inline BufferIterator BufferIterator::operator--(int)
{
BufferIterator save = *this;
--*this;
return save;
}
inline bool BufferIterator::is_begin() const
{
assert(m_buffer);
return m_coord.line == 0 and m_coord.column == 0;
}
inline bool BufferIterator::is_end() const
{
assert(m_buffer);
return offset() == m_buffer->character_count();
}
}
#endif // buffer_iterator_inl_h_INCLUDED
|
