void KStandardItemModel::clear()
{
int size = m_items.size();
m_items.clear();
m_indexesForItems.clear();
emit itemsRemoved(KItemRangeList() << KItemRange(0, size));
}
void KStandardItem::setDataValue(const QByteArray& role, const QVariant& value)
{
const QVariant previous = m_data.value(role);
if (previous == value) {
return;
}
m_data.insert(role, value);
onDataValueChanged(role, value, previous);
if (m_model) {
const int index = m_model->index(this);
QSet<QByteArray> changedRoles;
changedRoles.insert(role);
m_model->onItemChanged(index, changedRoles);
emit m_model->itemsChanged(KItemRangeList() << KItemRange(index, 1), changedRoles);
}
}
void KStandardItemModel::removeItem(int index)
{
if (index >= 0 && index < count()) {
KStandardItem* item = m_items[index];
m_indexesForItems.remove(item);
m_items.removeAt(index);
// Removing an item requires to update the indexes
// afterwards from m_indexesForItems.
for (int i = index; i < m_items.count(); ++i) {
m_indexesForItems.insert(m_items[i], i);
}
onItemRemoved(index, item);
delete item;
item = 0;
emit itemsRemoved(KItemRangeList() << KItemRange(index, 1));
// TODO: no hierarchical items are handled yet
}
}
void KStandardItemModel::changeItem(int index, KStandardItem* item)
{
if (index < 0 || index >= count() || !item) {
delete item;
return;
}
item->m_model = this;
QSet<QByteArray> changedRoles;
KStandardItem* oldItem = m_items[index];
const QHash<QByteArray, QVariant> oldData = oldItem->data();
const QHash<QByteArray, QVariant> newData = item->data();
// Determine which roles have been changed
QHashIterator<QByteArray, QVariant> it(oldData);
while (it.hasNext()) {
it.next();
const QByteArray role = it.key();
const QVariant oldValue = it.value();
if (newData.contains(role) && newData.value(role) != oldValue) {
changedRoles.insert(role);
}
}
m_indexesForItems.remove(oldItem);
delete oldItem;
oldItem = 0;
m_items[index] = item;
m_indexesForItems.insert(item, index);
onItemChanged(index, changedRoles);
emit itemsChanged(KItemRangeList() << KItemRange(index, 1), changedRoles);
}
void KStandardItemModel::insertItem(int index, KStandardItem* item)
{
if (index < 0 || index > count() || !item) {
delete item;
return;
}
if (!m_indexesForItems.contains(item)) {
item->m_model = this;
m_items.insert(index, item);
m_indexesForItems.insert(item, index);
// Inserting an item requires to update the indexes
// afterwards from m_indexesForItems.
for (int i = index + 1; i < m_items.count(); ++i) {
m_indexesForItems.insert(m_items[i], i);
}
// TODO: no hierarchical items are handled yet
onItemInserted(index);
emit itemsInserted(KItemRangeList() << KItemRange(index, 1));
}
}
