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
|
/*
* Copyright (C) 2000 Lars Knoll (knoll@kde.org)
* Copyright (C) 2003, 2004, 2006, 2007, 2008 Apple Inc. All right reserved.
* Copyright (C) 2011 Google, Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifndef BidiRunList_h
#define BidiRunList_h
#include <wtf/Noncopyable.h>
namespace WebCore {
template <class Run>
class BidiRunList {
WTF_MAKE_NONCOPYABLE(BidiRunList);
public:
BidiRunList()
: m_firstRun(0)
, m_lastRun(0)
, m_logicallyLastRun(0)
, m_runCount(0)
{
}
// FIXME: Once BidiResolver no longer owns the BidiRunList,
// then ~BidiRunList should call deleteRuns() automatically.
Run* firstRun() const { return m_firstRun; }
Run* lastRun() const { return m_lastRun; }
Run* logicallyLastRun() const { return m_logicallyLastRun; }
unsigned runCount() const { return m_runCount; }
void addRun(Run*);
void prependRun(Run*);
void moveRunToEnd(Run*);
void moveRunToBeginning(Run*);
void deleteRuns();
void reverseRuns(unsigned start, unsigned end);
void reorderRunsFromLevels();
void setLogicallyLastRun(Run* run) { m_logicallyLastRun = run; }
private:
Run* m_firstRun;
Run* m_lastRun;
Run* m_logicallyLastRun;
unsigned m_runCount;
};
template <class Run>
inline void BidiRunList<Run>::addRun(Run* run)
{
if (!m_firstRun)
m_firstRun = run;
else
m_lastRun->m_next = run;
m_lastRun = run;
m_runCount++;
}
template <class Run>
inline void BidiRunList<Run>::prependRun(Run* run)
{
ASSERT(!run->m_next);
if (!m_lastRun)
m_lastRun = run;
else
run->m_next = m_firstRun;
m_firstRun = run;
m_runCount++;
}
template <class Run>
inline void BidiRunList<Run>::moveRunToEnd(Run* run)
{
ASSERT(m_firstRun);
ASSERT(m_lastRun);
ASSERT(run->m_next);
Run* current = 0;
Run* next = m_firstRun;
while (next != run) {
current = next;
next = current->next();
}
if (!current)
m_firstRun = run->next();
else
current->m_next = run->m_next;
run->m_next = 0;
m_lastRun->m_next = run;
m_lastRun = run;
}
template <class Run>
inline void BidiRunList<Run>::moveRunToBeginning(Run* run)
{
ASSERT(m_firstRun);
ASSERT(m_lastRun);
ASSERT(run != m_firstRun);
Run* current = m_firstRun;
Run* next = current->next();
while (next != run) {
current = next;
next = current->next();
}
current->m_next = run->m_next;
if (run == m_lastRun)
m_lastRun = current;
run->m_next = m_firstRun;
m_firstRun = run;
}
template <class Run>
void BidiRunList<Run>::deleteRuns()
{
if (!m_firstRun)
return;
Run* curr = m_firstRun;
while (curr) {
Run* s = curr->next();
curr->destroy();
curr = s;
}
m_firstRun = 0;
m_lastRun = 0;
m_runCount = 0;
}
template <class Run>
void BidiRunList<Run>::reverseRuns(unsigned start, unsigned end)
{
if (start >= end)
return;
ASSERT(end < m_runCount);
// Get the item before the start of the runs to reverse and put it in
// |beforeStart|. |curr| should point to the first run to reverse.
Run* curr = m_firstRun;
Run* beforeStart = 0;
unsigned i = 0;
while (i < start) {
i++;
beforeStart = curr;
curr = curr->next();
}
Run* startRun = curr;
while (i < end) {
i++;
curr = curr->next();
}
Run* endRun = curr;
Run* afterEnd = curr->next();
i = start;
curr = startRun;
Run* newNext = afterEnd;
while (i <= end) {
// Do the reversal.
Run* next = curr->next();
curr->m_next = newNext;
newNext = curr;
curr = next;
i++;
}
// Now hook up beforeStart and afterEnd to the startRun and endRun.
if (beforeStart)
beforeStart->m_next = endRun;
else
m_firstRun = endRun;
startRun->m_next = afterEnd;
if (!afterEnd)
m_lastRun = startRun;
}
} // namespace WebCore
#endif // BidiRunList
|
