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
|
/*
* The ManaPlus Client
* Copyright (C) 2011-2019 The ManaPlus Developers
*
* This file is part of The ManaPlus Client.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "gui/fonts/textchunklist.h"
#include "gui/fonts/textchunk.h"
#include "debug.h"
TextChunkList::TextChunkList() :
start(nullptr),
end(nullptr),
size(0),
search(),
searchWidth()
{
}
void TextChunkList::insertFirst(TextChunk *restrict const item)
{
TextChunk *restrict const oldFirst = start;
if (start != nullptr)
start->prev = item;
item->prev = nullptr;
if (oldFirst != nullptr)
item->next = oldFirst;
else
end = item;
start = item;
size ++;
search[TextChunkSmall(item->text, item->color, item->color2)] = item;
searchWidth[item->text] = item;
}
void TextChunkList::moveToFirst(TextChunk *restrict const item)
{
if (item == start)
return;
TextChunk *restrict const oldPrev = item->prev;
if (oldPrev != nullptr)
oldPrev->next = item->next;
TextChunk *restrict const oldNext = item->next;
if (oldNext != nullptr)
oldNext->prev = item->prev;
else
end = oldPrev;
TextChunk *restrict const oldFirst = start;
if (start != nullptr)
start->prev = item;
item->prev = nullptr;
item->next = oldFirst;
start = item;
}
void TextChunkList::remove(const TextChunk *restrict const item)
{
if (item == nullptr)
return;
TextChunk *restrict const oldPrev = item->prev;
TextChunk *restrict const oldNext = item->next;
if (oldPrev != nullptr)
oldPrev->next = item->next;
else
start = oldNext;
if (oldNext != nullptr)
oldNext->prev = item->prev;
else
end = oldPrev;
search.erase(TextChunkSmall(item->text,
item->color, item->color2));
searchWidth.erase(item->text);
size --;
}
void TextChunkList::removeBack()
{
TextChunk *restrict oldEnd = end;
if (oldEnd != nullptr)
{
end = oldEnd->prev;
if (end != nullptr)
end->next = nullptr;
else
start = nullptr;
search.erase(TextChunkSmall(oldEnd->text,
oldEnd->color, oldEnd->color2));
searchWidth.erase(oldEnd->text);
delete oldEnd;
size --;
}
}
void TextChunkList::removeBack(int n)
{
TextChunk *restrict item = end;
while ((n != 0) && (item != nullptr))
{
n --;
TextChunk *oldEnd = item;
item = item->prev;
search.erase(TextChunkSmall(oldEnd->text,
oldEnd->color, oldEnd->color2));
searchWidth.erase(oldEnd->text);
delete oldEnd;
size --;
}
if (item != nullptr)
{
item->next = nullptr;
end = item;
}
else
{
start = nullptr;
end = nullptr;
}
}
void TextChunkList::clear()
{
search.clear();
searchWidth.clear();
TextChunk *restrict item = start;
while (item != nullptr)
{
TextChunk *restrict const item2 = item->next;
delete item;
item = item2;
}
start = nullptr;
end = nullptr;
size = 0;
}
|
