blob: 023727282a1087f853abd99f19be67570dc79efa (
plain) (
tree)
|
|
/*
* The ManaPlus Client
* Copyright (C) 2011-2015 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 *const item)
{
TextChunk *const oldFirst = start;
if (start)
start->prev = item;
item->prev = nullptr;
if (oldFirst)
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 *const item)
{
if (item == start)
return;
TextChunk *const oldPrev = item->prev;
if (oldPrev)
oldPrev->next = item->next;
TextChunk *const oldNext = item->next;
if (oldNext)
oldNext->prev = item->prev;
else
end = oldPrev;
TextChunk *const oldFirst = start;
if (start)
start->prev = item;
item->prev = nullptr;
item->next = oldFirst;
start = item;
}
void TextChunkList::remove(TextChunk *const item)
{
if (!item)
return;
TextChunk *const oldPrev = item->prev;
TextChunk *const oldNext = item->next;
if (oldPrev)
oldPrev->next = item->next;
else
start = oldNext;
if (oldNext)
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 *oldEnd = end;
if (oldEnd)
{
end = oldEnd->prev;
if (end)
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 *item = end;
while (n && item)
{
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)
{
item->next = nullptr;
end = item;
}
else
{
start = nullptr;
end = nullptr;
}
}
void TextChunkList::clear()
{
search.clear();
searchWidth.clear();
TextChunk *item = start;
while (item)
{
TextChunk *const item2 = item->next;
delete item;
item = item2;
}
start = nullptr;
end = nullptr;
size = 0;
}
|