92 lines
3.3 KiB
C++
92 lines
3.3 KiB
C++
/*
|
|
This file is part of Telegram Desktop,
|
|
the official desktop version of Telegram messaging app, see https://telegram.org
|
|
|
|
Telegram Desktop 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 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
It 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.
|
|
|
|
In addition, as a special exception, the copyright holders give permission
|
|
to link the code of portions of this program with the OpenSSL library.
|
|
|
|
Full license: https://github.com/telegramdesktop/tdesktop/blob/master/LICENSE
|
|
Copyright (c) 2014-2016 John Preston, https://desktop.telegram.org
|
|
*/
|
|
#pragma once
|
|
|
|
#include "dialogs/dialogs_common.h"
|
|
#include "dialogs/dialogs_list.h"
|
|
|
|
class History;
|
|
|
|
namespace Dialogs {
|
|
|
|
class IndexedList {
|
|
public:
|
|
IndexedList(SortMode sortMode);
|
|
|
|
RowsByLetter addToEnd(History *history);
|
|
Row *addByName(History *history);
|
|
void adjustByPos(const RowsByLetter &links);
|
|
void moveToTop(PeerData *peer);
|
|
|
|
// For sortMode != SortMode::Date
|
|
void peerNameChanged(PeerData *peer, const PeerData::Names &oldNames, const PeerData::NameFirstChars &oldChars);
|
|
|
|
//For sortMode == SortMode::Date
|
|
void peerNameChanged(Mode list, PeerData *peer, const PeerData::Names &oldNames, const PeerData::NameFirstChars &oldChars);
|
|
|
|
void del(const PeerData *peer, Row *replacedBy = nullptr);
|
|
void clear();
|
|
|
|
const List &all() const {
|
|
return _list;
|
|
}
|
|
const List *filtered(QChar ch) const {
|
|
static StaticNeverFreedPointer<List> empty(new List(SortMode::Add));
|
|
return _index.value(ch, empty.data());
|
|
}
|
|
|
|
~IndexedList();
|
|
|
|
// Part of List interface is duplicated here for all() list.
|
|
int size() const { return all().size(); }
|
|
bool isEmpty() const { return all().isEmpty(); }
|
|
bool contains(PeerId peerId) const { return all().contains(peerId); }
|
|
Row *getRow(PeerId peerId) const { return all().getRow(peerId); }
|
|
Row *rowAtY(int32 y, int32 h) const { return all().rowAtY(y, h); }
|
|
|
|
using iterator = List::iterator;
|
|
using const_iterator = List::const_iterator;
|
|
const_iterator cbegin() const { return all().cbegin(); }
|
|
const_iterator cend() const { return all().cend(); }
|
|
const_iterator begin() const { return all().cbegin(); }
|
|
const_iterator end() const { return all().cend(); }
|
|
iterator begin() { return all().begin(); }
|
|
iterator end() { return all().end(); }
|
|
const_iterator cfind(Row *value) const { return all().cfind(value); }
|
|
const_iterator find(Row *value) const { return all().cfind(value); }
|
|
iterator find(Row *value) { return all().find(value); }
|
|
const_iterator cfind(int y, int h) const { return all().cfind(y, h); }
|
|
const_iterator find(int y, int h) const { return all().cfind(y, h); }
|
|
iterator find(int y, int h) { return all().find(y, h); }
|
|
|
|
private:
|
|
void adjustByName(PeerData *peer, const PeerData::Names &oldNames, const PeerData::NameFirstChars &oldChars);
|
|
void adjustNames(Mode list, PeerData *peer, const PeerData::Names &oldNames, const PeerData::NameFirstChars &oldChars);
|
|
|
|
SortMode _sortMode;
|
|
List _list;
|
|
using Index = QMap<QChar, List*>;
|
|
Index _index;
|
|
|
|
};
|
|
|
|
} // namespace Dialogs
|