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
|
/*
* The ManaPlus Client
* Copyright (C) 2008 Douglas Boffey <DougABoffey@netscape.net>
* Copyright (C) 2011-2020 The ManaPlus Developers
* Copyright (C) 2020-2023 The ManaVerse 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 "textmanager.h"
#include "text.h"
#include "utils/foreach.h"
#include <cstring>
#include "debug.h"
TextManager *textManager = nullptr;
TextManager::TextManager() :
mTextList()
{
}
void TextManager::addText(Text *const text)
{
if (text == nullptr)
return;
place(text, nullptr, text->mX, text->mY, text->mHeight);
mTextList.push_back(text);
}
void TextManager::moveText(Text *const text,
const int x, const int y) const
{
if (text == nullptr)
return;
text->mX = x;
text->mY = y;
place(text, text, text->mX, text->mY, text->mHeight);
}
void TextManager::removeText(const Text *const text)
{
FOR_EACH (TextList::iterator, ptr, mTextList)
{
if (*ptr == text)
{
mTextList.erase(ptr);
return;
}
}
}
TextManager::~TextManager()
{
}
void TextManager::draw(Graphics *const graphics,
const int xOff, const int yOff)
{
BLOCK_START("TextManager::draw")
FOR_EACH (TextList::const_iterator, bPtr, mTextList)
(*bPtr)->draw(graphics, xOff, yOff);
BLOCK_END("TextManager::draw")
}
void TextManager::place(const Text *const textObj,
const Text *const omit,
const int &x A_UNUSED,
int &y,
const int h) const
{
if (textObj == nullptr)
return;
const int xLeft = textObj->mX;
const int xRight1 = xLeft + textObj->mWidth;
const int TEST = 50; // Number of lines to test for text
const int nBeings = 30;
bool occupied[TEST]; // is some other text obscuring this line?
std::memset(&occupied, 0, sizeof(occupied)); // set all to false
const int wantedTop = (TEST - h) / 2; // Entry in occupied at top of text
const int occupiedTop = y - wantedTop; // Line in map representing
// to of occupied
int cnt = 0;
for (TextList::const_iterator ptr = mTextList.begin(),
pfEnd = mTextList.end();
ptr != pfEnd && cnt < nBeings;
++ptr, cnt ++)
{
const Text *const text = *ptr;
if (text != omit && text->mX + 1 <= xRight1
&& text->mX + text->mWidth > xLeft)
{
int from = text->mY - occupiedTop;
int to = from + text->mHeight - 1;
if (to < 0 || from >= TEST) // out of range considered
continue;
if (from < 0)
from = 0;
if (to >= TEST)
to = TEST - 1;
for (int i = from; i <= to; ++i)
occupied[i] = true;
}
}
bool ok = true;
const int sz = wantedTop + h;
for (int i = wantedTop; i < sz; i ++)
{
if (occupied[i])
{
ok = false;
break;
}
}
if (ok)
return;
// Have to move it up or down, so find nearest spaces either side
int consec = 0;
int upSlot = -1; // means not found
const int sz2 = wantedTop + h - 2;
for (int seek = sz2; seek >= 0; --seek)
{
if (occupied[seek])
{
consec = 0;
}
else
{
if (++consec == h)
{
upSlot = seek;
break;
}
}
}
int downSlot = -1;
consec = 0;
for (int seek = wantedTop + 1; seek < TEST; ++seek)
{
if (occupied[seek])
{
consec = 0;
}
else
{
if (++consec == h)
{
downSlot = seek - h + 1;
break;
}
}
}
if (upSlot == -1 && downSlot == -1) // no good solution, so leave as is
{
return;
}
if (upSlot == -1) // must go down
{
y += downSlot - wantedTop;
return;
}
if (downSlot == -1) // must go up
{
y -= wantedTop - upSlot;
return;
}
if (wantedTop - upSlot > downSlot - wantedTop) // down is better
{
y += downSlot - wantedTop;
}
else
{
y -= wantedTop - upSlot;
}
}
|
