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
|
/*
* Copyright (C) 2013 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));
}
|