summaryrefslogtreecommitdiff
path: root/eventsview-plugins/eventsview-plugin-mastodon/abstractsocialcachemodel.cpp
diff options
context:
space:
mode:
authorAndrew Branson <andrew.branson@jolla.com>2026-02-13 06:26:11 +0100
committerAndrew Branson <andrew.branson@jolla.com>2026-02-13 06:26:11 +0100
commitce4447024641c0ee793539d79a6d9be7a34a000b (patch)
tree9fc690b3c5e8c0f6f6b027f2d8461f5907397a55 /eventsview-plugins/eventsview-plugin-mastodon/abstractsocialcachemodel.cpp
parent8c09980c00061a97eab050a4f0fd5fb4135d6ee7 (diff)
Drop libsocialcache files in MastodonPostsModel
Diffstat (limited to 'eventsview-plugins/eventsview-plugin-mastodon/abstractsocialcachemodel.cpp')
-rw-r--r--eventsview-plugins/eventsview-plugin-mastodon/abstractsocialcachemodel.cpp190
1 files changed, 0 insertions, 190 deletions
diff --git a/eventsview-plugins/eventsview-plugin-mastodon/abstractsocialcachemodel.cpp b/eventsview-plugins/eventsview-plugin-mastodon/abstractsocialcachemodel.cpp
deleted file mode 100644
index 895ad72..0000000
--- a/eventsview-plugins/eventsview-plugin-mastodon/abstractsocialcachemodel.cpp
+++ /dev/null
@@ -1,190 +0,0 @@
-/*
- * Copyright (C) 2013-2026 Jolla Ltd.
- * Contact: Lucien Xu <lucien.xu@jollamobile.com>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library 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
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- */
-
-#include "abstractsocialcachemodel.h"
-#include "abstractsocialcachemodel_p.h"
-
-#include <synchronizelists_p.h>
-
-#include <QtCore/QDebug>
-#include <QtCore/QMutexLocker>
-
-template <> bool compareIdentity<SocialCacheModelRow>(
- const SocialCacheModelRow &item, const SocialCacheModelRow &reference)
-{
- return item.value(0) == reference.value(0);
-}
-
-template <>
-int updateRange<AbstractSocialCacheModelPrivate, SocialCacheModelData>(
- AbstractSocialCacheModelPrivate *d,
- int index,
- int count,
- const SocialCacheModelData &source,
- int sourceIndex)
-{
- d->updateRange(index, count, source, sourceIndex);
-
- return count;
-}
-
-AbstractSocialCacheModelPrivate::AbstractSocialCacheModelPrivate(AbstractSocialCacheModel *q)
- : q_ptr(q)
-{
-}
-
-AbstractSocialCacheModelPrivate::~AbstractSocialCacheModelPrivate()
-{
-}
-
-void AbstractSocialCacheModelPrivate::clearData()
-{
- Q_Q(AbstractSocialCacheModel);
- if (m_data.count() > 0) {
- q->beginRemoveRows(QModelIndex(), 0, m_data.count() - 1);
- m_data.clear();
- q->endRemoveRows();
- emit q->countChanged();
- }
-}
-
-void AbstractSocialCacheModelPrivate::updateData(const SocialCacheModelData &data)
-{
- Q_Q(AbstractSocialCacheModel);
- q->updateData(data);
-}
-
-void AbstractSocialCacheModelPrivate::updateRow(int row, const SocialCacheModelRow &data)
-{
- Q_Q(AbstractSocialCacheModel);
- q->updateRow(row, data);
-}
-
-void AbstractSocialCacheModelPrivate::insertRange(
- int index, int count, const SocialCacheModelData &source, int sourceIndex)
-{
- Q_Q(AbstractSocialCacheModel);
-
- if (count > 0 && index >= 0) {
- q->beginInsertRows(QModelIndex(), index, index + count - 1);
- m_data = m_data.mid(0, index) + source.mid(sourceIndex, count) + m_data.mid(index);
- q->endInsertRows();
- emit q->countChanged();
- }
-}
-
-void AbstractSocialCacheModelPrivate::removeRange(int index, int count)
-{
- Q_Q(AbstractSocialCacheModel);
-
- if (count > 0 && index >= 0) {
- q->beginRemoveRows(QModelIndex(), index, index + count - 1);
- m_data = m_data.mid(0, index) + m_data.mid(index + count);
- q->endRemoveRows();
- emit q->countChanged();
- }
-}
-
-void AbstractSocialCacheModelPrivate::updateRange(
- int index, int count, const SocialCacheModelData &source, int sourceIndex)
-{
- Q_Q(AbstractSocialCacheModel);
-
- for (int i = 0; i < count; ++i) {
- m_data[index + i] = source[sourceIndex + i];
- }
-
- emit q->dataChanged(q->createIndex(index, 0), q->createIndex(index + count - 1, 0));
-}
-
-AbstractSocialCacheModel::AbstractSocialCacheModel(AbstractSocialCacheModelPrivate &dd,
- QObject *parent)
- : QAbstractListModel(parent), d_ptr(&dd)
-{
-}
-
-AbstractSocialCacheModel::~AbstractSocialCacheModel()
-{
-}
-
-int AbstractSocialCacheModel::rowCount(const QModelIndex &parent) const
-{
- Q_UNUSED(parent)
- Q_D(const AbstractSocialCacheModel);
- return d->m_data.count();
-}
-
-QVariant AbstractSocialCacheModel::data(const QModelIndex &index, int role) const
-{
- int row = index.row();
- return getField(row, role);
-}
-
-QVariant AbstractSocialCacheModel::getField(int row, int role) const
-{
- Q_D(const AbstractSocialCacheModel);
- if (row < 0 || row >= d->m_data.count()) {
- return QVariant();
- }
-
- return d->m_data.at(row).value(role);
-}
-
-QString AbstractSocialCacheModel::nodeIdentifier() const
-{
- Q_D(const AbstractSocialCacheModel);
- return d->nodeIdentifier;
-}
-
-void AbstractSocialCacheModel::setNodeIdentifier(const QString &nodeIdentifier)
-{
- Q_D(AbstractSocialCacheModel);
- if (d->nodeIdentifier != nodeIdentifier) {
- d->nodeIdentifier = nodeIdentifier;
- emit nodeIdentifierChanged();
- d->nodeIdentifierChanged();
- }
-}
-
-int AbstractSocialCacheModel::count() const
-{
- return rowCount();
-}
-
-void AbstractSocialCacheModel::updateData(const SocialCacheModelData &data)
-{
- Q_D(AbstractSocialCacheModel);
-
- const int count = d->m_data.count();
- synchronizeList(d, d->m_data, data);
-
- if (d->m_data.count() != count) {
- emit countChanged();
- }
- emit modelUpdated();
-}
-
-void AbstractSocialCacheModel::updateRow(int row, const SocialCacheModelRow &data)
-{
- Q_D(AbstractSocialCacheModel);
- foreach (int key, data.keys()) {
- d->m_data[row].insert(key, data.value(key));
- }
- emit dataChanged(index(row), index(row));
-}