matrixion/src/timeline/CommunitiesModel.cpp

481 lines
15 KiB
C++
Raw Normal View History

2021-06-10 00:52:28 +03:00
// SPDX-FileCopyrightText: 2021 Nheko Contributors
//
// SPDX-License-Identifier: GPL-3.0-or-later
#include "CommunitiesModel.h"
#include <set>
#include "Cache.h"
2021-12-01 02:02:41 +03:00
#include "Cache_p.h"
#include "Logging.h"
2021-06-10 00:52:28 +03:00
#include "UserSettingsPage.h"
CommunitiesModel::CommunitiesModel(QObject *parent)
: QAbstractListModel(parent)
{}
QHash<int, QByteArray>
CommunitiesModel::roleNames() const
{
2021-09-18 01:22:33 +03:00
return {
{AvatarUrl, "avatarUrl"},
{DisplayName, "displayName"},
{Tooltip, "tooltip"},
2021-12-01 02:02:41 +03:00
{Collapsed, "collapsed"},
{Collapsible, "collapsible"},
2021-09-18 01:22:33 +03:00
{Hidden, "hidden"},
2021-12-01 02:02:41 +03:00
{Depth, "depth"},
2021-09-18 01:22:33 +03:00
{Id, "id"},
};
2021-06-10 00:52:28 +03:00
}
2021-12-01 02:02:41 +03:00
bool
CommunitiesModel::setData(const QModelIndex &index, const QVariant &value, int role)
{
if (role != CommunitiesModel::Collapsed)
return false;
else if (index.row() >= 2 || index.row() - 2 < spaceOrder_.size()) {
spaceOrder_.tree.at(index.row() - 2).collapsed = value.toBool();
const auto cindex = spaceOrder_.lastChild(index.row() - 2);
emit dataChanged(index, this->index(cindex + 2), {Collapsed, Qt::DisplayRole});
return true;
} else
return false;
}
2021-06-10 00:52:28 +03:00
QVariant
CommunitiesModel::data(const QModelIndex &index, int role) const
{
2021-09-18 01:22:33 +03:00
if (index.row() == 0) {
switch (role) {
case CommunitiesModel::Roles::AvatarUrl:
2021-11-14 04:23:10 +03:00
return QString(":/icons/icons/ui/world.svg");
2021-09-18 01:22:33 +03:00
case CommunitiesModel::Roles::DisplayName:
return tr("All rooms");
case CommunitiesModel::Roles::Tooltip:
return tr("Shows all rooms without filtering.");
2021-12-01 02:02:41 +03:00
case CommunitiesModel::Roles::Collapsed:
return false;
case CommunitiesModel::Roles::Collapsible:
2021-09-18 01:22:33 +03:00
return false;
case CommunitiesModel::Roles::Hidden:
return false;
2021-12-01 02:02:41 +03:00
case CommunitiesModel::Roles::Parent:
return "";
case CommunitiesModel::Roles::Depth:
return 0;
2021-09-18 01:22:33 +03:00
case CommunitiesModel::Roles::Id:
return "";
}
} else if (index.row() == 1) {
switch (role) {
case CommunitiesModel::Roles::AvatarUrl:
return QString(":/icons/icons/ui/people.svg");
case CommunitiesModel::Roles::DisplayName:
return tr("Direct Chats");
case CommunitiesModel::Roles::Tooltip:
return tr("Show direct chats.");
2021-12-01 02:02:41 +03:00
case CommunitiesModel::Roles::Collapsed:
return false;
case CommunitiesModel::Roles::Collapsible:
return false;
case CommunitiesModel::Roles::Hidden:
return hiddentTagIds_.contains("dm");
2021-12-01 02:02:41 +03:00
case CommunitiesModel::Roles::Parent:
return "";
case CommunitiesModel::Roles::Depth:
return 0;
case CommunitiesModel::Roles::Id:
return "dm";
}
} else if (index.row() - 2 < spaceOrder_.size()) {
2021-12-01 02:02:41 +03:00
auto id = spaceOrder_.tree.at(index.row() - 2).name;
2021-09-18 01:22:33 +03:00
switch (role) {
case CommunitiesModel::Roles::AvatarUrl:
return QString::fromStdString(spaces_.at(id).avatar_url);
case CommunitiesModel::Roles::DisplayName:
case CommunitiesModel::Roles::Tooltip:
return QString::fromStdString(spaces_.at(id).name);
2021-12-01 02:02:41 +03:00
case CommunitiesModel::Roles::Collapsed:
return spaceOrder_.tree.at(index.row() - 2).collapsed;
case CommunitiesModel::Roles::Collapsible: {
auto idx = index.row() - 2;
return idx != spaceOrder_.lastChild(idx);
}
2021-09-18 01:22:33 +03:00
case CommunitiesModel::Roles::Hidden:
return hiddentTagIds_.contains("space:" + id);
2021-12-01 02:02:41 +03:00
case CommunitiesModel::Roles::Parent: {
if (auto p = spaceOrder_.parent(index.row() - 2); p >= 0)
return spaceOrder_.tree[p].name;
return "";
}
case CommunitiesModel::Roles::Depth:
return spaceOrder_.tree.at(index.row() - 2).depth;
2021-09-18 01:22:33 +03:00
case CommunitiesModel::Roles::Id:
return "space:" + id;
}
} else if (index.row() - 2 < tags_.size() + spaceOrder_.size()) {
auto tag = tags_.at(index.row() - 2 - spaceOrder_.size());
2021-09-18 01:22:33 +03:00
if (tag == "m.favourite") {
switch (role) {
case CommunitiesModel::Roles::AvatarUrl:
2021-11-14 04:23:10 +03:00
return QString(":/icons/icons/ui/star.svg");
2021-09-18 01:22:33 +03:00
case CommunitiesModel::Roles::DisplayName:
return tr("Favourites");
case CommunitiesModel::Roles::Tooltip:
return tr("Rooms you have favourited.");
}
} else if (tag == "m.lowpriority") {
switch (role) {
case CommunitiesModel::Roles::AvatarUrl:
2021-11-14 04:23:10 +03:00
return QString(":/icons/icons/ui/lowprio.svg");
2021-09-18 01:22:33 +03:00
case CommunitiesModel::Roles::DisplayName:
return tr("Low Priority");
case CommunitiesModel::Roles::Tooltip:
return tr("Rooms with low priority.");
}
} else if (tag == "m.server_notice") {
switch (role) {
case CommunitiesModel::Roles::AvatarUrl:
2021-11-14 04:23:10 +03:00
return QString(":/icons/icons/ui/tag.svg");
2021-09-18 01:22:33 +03:00
case CommunitiesModel::Roles::DisplayName:
return tr("Server Notices");
case CommunitiesModel::Roles::Tooltip:
return tr("Messages from your server or administrator.");
}
} else {
switch (role) {
case CommunitiesModel::Roles::AvatarUrl:
2021-11-14 04:23:10 +03:00
return QString(":/icons/icons/ui/tag.svg");
2021-09-18 01:22:33 +03:00
case CommunitiesModel::Roles::DisplayName:
case CommunitiesModel::Roles::Tooltip:
return tag.mid(2);
}
}
2021-06-10 00:52:28 +03:00
2021-09-18 01:22:33 +03:00
switch (role) {
case CommunitiesModel::Roles::Hidden:
return hiddentTagIds_.contains("tag:" + tag);
2021-12-01 02:02:41 +03:00
case CommunitiesModel::Roles::Collapsed:
2021-09-18 01:22:33 +03:00
return true;
2021-12-01 02:02:41 +03:00
case CommunitiesModel::Roles::Collapsible:
return false;
case CommunitiesModel::Roles::Parent:
return "";
case CommunitiesModel::Roles::Depth:
return 0;
2021-09-18 01:22:33 +03:00
case CommunitiesModel::Roles::Id:
return "tag:" + tag;
2021-06-10 00:52:28 +03:00
}
2021-09-18 01:22:33 +03:00
}
return QVariant();
2021-06-10 00:52:28 +03:00
}
2021-12-01 02:02:41 +03:00
namespace {
struct temptree
{
std::map<std::string, temptree> children;
void insert(const std::vector<std::string> &parents, const std::string &child)
{
temptree *t = this;
for (const auto &e : parents)
t = &t->children[e];
t->children[child];
}
void flatten(CommunitiesModel::FlatTree &to, int i = 0) const
{
for (const auto &[child, subtree] : children) {
to.tree.push_back({QString::fromStdString(child), i, false});
subtree.flatten(to, i + 1);
}
}
};
void
addChildren(temptree &t,
std::vector<std::string> path,
std::string child,
const std::map<std::string, std::set<std::string>> &children)
{
if (std::find(path.begin(), path.end(), child) != path.end())
return;
path.push_back(child);
if (children.count(child)) {
for (const auto &c : children.at(child)) {
t.insert(path, c);
addChildren(t, path, c, children);
}
}
}
}
2021-06-10 00:52:28 +03:00
void
CommunitiesModel::initializeSidebar()
{
2021-09-18 01:22:33 +03:00
beginResetModel();
tags_.clear();
2021-12-01 02:02:41 +03:00
spaceOrder_.tree.clear();
2021-09-18 01:22:33 +03:00
spaces_.clear();
std::set<std::string> ts;
2021-12-01 02:02:41 +03:00
std::set<std::string> isSpace;
std::map<std::string, std::set<std::string>> spaceChilds;
std::map<std::string, std::set<std::string>> spaceParents;
2021-09-18 01:22:33 +03:00
auto infos = cache::roomInfo();
for (auto it = infos.begin(); it != infos.end(); it++) {
if (it.value().is_space) {
spaces_[it.key()] = it.value();
2021-12-01 02:02:41 +03:00
isSpace.insert(it.key().toStdString());
2021-09-18 01:22:33 +03:00
} else {
for (const auto &t : it.value().tags) {
if (t.find("u.") == 0 || t.find("m." == 0)) {
ts.insert(t);
2021-06-10 00:52:28 +03:00
}
2021-09-18 01:22:33 +03:00
}
2021-06-10 00:52:28 +03:00
}
2021-09-18 01:22:33 +03:00
}
2021-06-10 00:52:28 +03:00
2021-12-01 02:02:41 +03:00
// NOTE(Nico): We build a forrest from the Directed Cyclic(!) Graph of spaces. To do that we
// start with orphan spaces at the top. This leaves out some space circles, but there is no good
// way to break that cycle imo anyway. Then we carefully walk a tree down from each root in our
// forrest, carefully checking not to run in a circle and get lost forever.
// TODO(Nico): Optimize this. We can do this with a lot fewer allocations and checks.
for (const auto &space : isSpace) {
spaceParents[space];
for (const auto &p : cache::client()->getParentRoomIds(space)) {
spaceParents[space].insert(p);
spaceChilds[p].insert(space);
}
}
temptree spacetree;
std::vector<std::string> path;
for (const auto &space : isSpace) {
if (!spaceParents[space].empty())
continue;
spacetree.children[space] = {};
}
for (const auto &space : spacetree.children) {
addChildren(spacetree, path, space.first, spaceChilds);
}
// NOTE(Nico): This flattens the tree into a list, preserving the depth at each element.
spacetree.flatten(spaceOrder_);
2021-09-18 01:22:33 +03:00
for (const auto &t : ts)
tags_.push_back(QString::fromStdString(t));
2021-06-11 18:54:05 +03:00
2021-09-18 01:22:33 +03:00
hiddentTagIds_ = UserSettings::instance()->hiddenTags();
endResetModel();
2021-06-10 00:52:28 +03:00
2021-09-18 01:22:33 +03:00
emit tagsChanged();
emit hiddenTagsChanged();
2021-06-10 00:52:28 +03:00
}
void
CommunitiesModel::clear()
{
2021-09-18 01:22:33 +03:00
beginResetModel();
tags_.clear();
endResetModel();
resetCurrentTagId();
2021-06-10 00:52:28 +03:00
2021-09-18 01:22:33 +03:00
emit tagsChanged();
2021-06-10 00:52:28 +03:00
}
void
CommunitiesModel::sync(const mtx::responses::Sync &sync_)
2021-06-10 00:52:28 +03:00
{
2021-09-18 01:22:33 +03:00
bool tagsUpdated = false;
for (const auto &[roomid, room] : sync_.rooms.join) {
2021-09-18 01:22:33 +03:00
(void)roomid;
for (const auto &e : room.account_data.events)
if (std::holds_alternative<
mtx::events::AccountDataEvent<mtx::events::account_data::Tags>>(e)) {
tagsUpdated = true;
}
for (const auto &e : room.state.events)
if (std::holds_alternative<mtx::events::StateEvent<mtx::events::state::space::Child>>(
e) ||
std::holds_alternative<mtx::events::StateEvent<mtx::events::state::space::Parent>>(
e)) {
tagsUpdated = true;
}
for (const auto &e : room.timeline.events)
if (std::holds_alternative<mtx::events::StateEvent<mtx::events::state::space::Child>>(
e) ||
std::holds_alternative<mtx::events::StateEvent<mtx::events::state::space::Parent>>(
e)) {
tagsUpdated = true;
}
}
for (const auto &[roomid, room] : sync_.rooms.leave) {
2021-09-18 01:22:33 +03:00
(void)room;
2021-12-01 02:02:41 +03:00
if (spaces_.count(QString::fromStdString(roomid)))
2021-09-18 01:22:33 +03:00
tagsUpdated = true;
}
for (const auto &e : sync_.account_data.events) {
if (std::holds_alternative<
mtx::events::AccountDataEvent<mtx::events::account_data::Direct>>(e)) {
tagsUpdated = true;
break;
}
}
2021-09-18 01:22:33 +03:00
if (tagsUpdated)
initializeSidebar();
2021-06-10 00:52:28 +03:00
}
void
CommunitiesModel::setCurrentTagId(QString tagId)
{
2021-09-18 01:22:33 +03:00
if (tagId.startsWith("tag:")) {
auto tag = tagId.mid(4);
for (const auto &t : tags_) {
if (t == tag) {
this->currentTagId_ = tagId;
emit currentTagIdChanged(currentTagId_);
return;
}
}
} else if (tagId.startsWith("space:")) {
auto tag = tagId.mid(6);
2021-12-01 02:02:41 +03:00
for (const auto &t : spaceOrder_.tree) {
if (t.name == tag) {
2021-09-18 01:22:33 +03:00
this->currentTagId_ = tagId;
emit currentTagIdChanged(currentTagId_);
return;
}
2021-06-10 00:52:28 +03:00
}
} else if (tagId == "dm") {
this->currentTagId_ = tagId;
emit currentTagIdChanged(currentTagId_);
return;
2021-09-18 01:22:33 +03:00
}
2021-06-10 00:52:28 +03:00
2021-09-18 01:22:33 +03:00
this->currentTagId_ = "";
emit currentTagIdChanged(currentTagId_);
2021-06-10 00:52:28 +03:00
}
2021-06-11 18:54:05 +03:00
void
CommunitiesModel::toggleTagId(QString tagId)
{
2021-09-18 01:22:33 +03:00
if (hiddentTagIds_.contains(tagId)) {
hiddentTagIds_.removeOne(tagId);
UserSettings::instance()->setHiddenTags(hiddentTagIds_);
} else {
hiddentTagIds_.push_back(tagId);
UserSettings::instance()->setHiddenTags(hiddentTagIds_);
}
if (tagId.startsWith("tag:")) {
auto idx = tags_.indexOf(tagId.mid(4));
if (idx != -1)
emit dataChanged(
index(idx + 1 + spaceOrder_.size()), index(idx + 1 + spaceOrder_.size()), {Hidden});
} else if (tagId.startsWith("space:")) {
auto idx = spaceOrder_.indexOf(tagId.mid(6));
if (idx != -1)
emit dataChanged(index(idx + 1), index(idx + 1), {Hidden});
} else if (tagId == "dm") {
emit dataChanged(index(1), index(1), {Hidden});
2021-09-18 01:22:33 +03:00
}
emit hiddenTagsChanged();
2021-06-11 18:54:05 +03:00
}
2021-12-01 02:02:41 +03:00
FilteredCommunitiesModel::FilteredCommunitiesModel(CommunitiesModel *model, QObject *parent)
: QSortFilterProxyModel(parent)
{
setSourceModel(model);
setDynamicSortFilter(true);
sort(0);
}
namespace {
enum Categories
{
World,
Direct,
Favourites,
Server,
LowPrio,
Space,
UserTag,
};
Categories
tagIdToCat(QString tagId)
{
if (tagId.isEmpty())
return World;
else if (tagId == "dm")
return Direct;
else if (tagId == "tag:m.favourite")
return Favourites;
else if (tagId == "tag:m.server_notice")
return Server;
else if (tagId == "tag:m.lowpriority")
return LowPrio;
else if (tagId.startsWith("space:"))
return Space;
else
return UserTag;
}
}
bool
FilteredCommunitiesModel::lessThan(const QModelIndex &left, const QModelIndex &right) const
{
QModelIndex const left_idx = sourceModel()->index(left.row(), 0, QModelIndex());
QModelIndex const right_idx = sourceModel()->index(right.row(), 0, QModelIndex());
Categories leftCat = tagIdToCat(sourceModel()->data(left_idx, CommunitiesModel::Id).toString());
Categories rightCat =
tagIdToCat(sourceModel()->data(right_idx, CommunitiesModel::Id).toString());
if (leftCat != rightCat)
return leftCat < rightCat;
if (leftCat == Space) {
return left.row() < right.row();
}
QString leftName = sourceModel()->data(left_idx, CommunitiesModel::DisplayName).toString();
QString rightName = sourceModel()->data(right_idx, CommunitiesModel::DisplayName).toString();
return leftName.compare(rightName, Qt::CaseInsensitive) < 0;
}
bool
FilteredCommunitiesModel::filterAcceptsRow(int sourceRow, const QModelIndex &) const
{
CommunitiesModel *m = qobject_cast<CommunitiesModel *>(this->sourceModel());
if (!m)
return true;
if (sourceRow < 2 || sourceRow - 2 >= m->spaceOrder_.size())
return true;
auto idx = sourceRow - 2;
while (idx >= 0 && m->spaceOrder_.tree[idx].depth > 0) {
idx = m->spaceOrder_.parent(idx);
if (idx >= 0 && m->spaceOrder_.tree.at(idx).collapsed)
return false;
}
return true;
}