X-Git-Url: https://cloud.milkyroute.net/gitweb/dolphin.git/blobdiff_plain/6c3d9acbc22ea9463ba40ef84c9e8c8419dfacf3..b81d3fbbbb188805e279791f4e06dec460f83697:/src/kitemviews/private/kitemlistsizehintresolver.cpp diff --git a/src/kitemviews/private/kitemlistsizehintresolver.cpp b/src/kitemviews/private/kitemlistsizehintresolver.cpp index c76ff0f55..0c2dd0b80 100644 --- a/src/kitemviews/private/kitemlistsizehintresolver.cpp +++ b/src/kitemviews/private/kitemlistsizehintresolver.cpp @@ -1,30 +1,18 @@ -/*************************************************************************** - * Copyright (C) 2011 by Peter Penz * - * * - * This program 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 2 of the License, or * - * (at your option) any later version. * - * * - * This program 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. * - * * - * You should have received a copy of the GNU General Public License * - * along with this program; if not, write to the * - * Free Software Foundation, Inc., * - * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA * - ***************************************************************************/ +/* + * SPDX-FileCopyrightText: 2011 Peter Penz + * + * SPDX-License-Identifier: GPL-2.0-or-later + */ #include "kitemlistsizehintresolver.h" - -#include -#include +#include "kitemviews/kitemlistview.h" KItemListSizeHintResolver::KItemListSizeHintResolver(const KItemListView* itemListView) : m_itemListView(itemListView), - m_sizeHintCache() + m_logicalHeightHintCache(), + m_logicalWidthHint(0.0), + m_minHeightHint(0.0), + m_needsResolving(false) { } @@ -32,57 +20,133 @@ KItemListSizeHintResolver::~KItemListSizeHintResolver() { } -QSizeF KItemListSizeHintResolver::sizeHint(int index) const +QSizeF KItemListSizeHintResolver::minSizeHint() { - QSizeF size = m_sizeHintCache.at(index); - if (size.isEmpty()) { - size = m_itemListView->itemSizeHint(index); - m_sizeHintCache[index] = size; - } - return size; + updateCache(); + return QSizeF(m_logicalWidthHint, m_minHeightHint); } -void KItemListSizeHintResolver::itemsInserted(int index, int count) +QSizeF KItemListSizeHintResolver::sizeHint(int index) { - const int currentCount = m_sizeHintCache.count(); - m_sizeHintCache.reserve(currentCount + count); - while (count > 0) { - m_sizeHintCache.insert(index, QSizeF()); - ++index; - --count; + updateCache(); + return QSizeF(m_logicalWidthHint, m_logicalHeightHintCache.at(index).first); +} + +bool KItemListSizeHintResolver::isElided(int index) +{ + return m_logicalHeightHintCache.at(index).second; +} + +void KItemListSizeHintResolver::itemsInserted(const KItemRangeList& itemRanges) +{ + int insertedCount = 0; + for (const KItemRange& range : itemRanges) { + insertedCount += range.count; } + + const int currentCount = m_logicalHeightHintCache.count(); + m_logicalHeightHintCache.reserve(currentCount + insertedCount); + + // We build the new list from the end to the beginning to mimize the + // number of moves. + m_logicalHeightHintCache.insert(m_logicalHeightHintCache.end(), insertedCount, std::make_pair(0.0, false)); + + int sourceIndex = currentCount - 1; + int targetIndex = m_logicalHeightHintCache.count() - 1; + int itemsToInsertBeforeCurrentRange = insertedCount; + + for (int rangeIndex = itemRanges.count() - 1; rangeIndex >= 0; --rangeIndex) { + const KItemRange& range = itemRanges.at(rangeIndex); + itemsToInsertBeforeCurrentRange -= range.count; + + // First: move all existing items that must be put behind 'range'. + while (targetIndex >= itemsToInsertBeforeCurrentRange + range.index + range.count) { + m_logicalHeightHintCache[targetIndex] = m_logicalHeightHintCache[sourceIndex]; + --sourceIndex; + --targetIndex; + } + + // Then: insert QSizeF() for the items which are inserted into 'range'. + while (targetIndex >= itemsToInsertBeforeCurrentRange + range.index) { + m_logicalHeightHintCache[targetIndex] = std::make_pair(0.0, false); + --targetIndex; + } + } + + m_needsResolving = true; + + Q_ASSERT(m_logicalHeightHintCache.count() == m_itemListView->model()->count()); } -void KItemListSizeHintResolver::itemsRemoved(int index, int count) +void KItemListSizeHintResolver::itemsRemoved(const KItemRangeList& itemRanges) { - const QList::iterator begin = m_sizeHintCache.begin() + index; - const QList::iterator end = begin + count; - m_sizeHintCache.erase(begin, end); + const QVector>::iterator begin = m_logicalHeightHintCache.begin(); + const QVector>::iterator end = m_logicalHeightHintCache.end(); + + KItemRangeList::const_iterator rangeIt = itemRanges.constBegin(); + const KItemRangeList::const_iterator rangeEnd = itemRanges.constEnd(); + + QVector>::iterator destIt = begin + rangeIt->index; + QVector>::iterator srcIt = destIt + rangeIt->count; + + ++rangeIt; + + while (srcIt != end) { + *destIt = *srcIt; + ++destIt; + ++srcIt; + + if (rangeIt != rangeEnd && srcIt == begin + rangeIt->index) { + // Skip the items in the next removed range. + srcIt += rangeIt->count; + ++rangeIt; + } + } + + m_logicalHeightHintCache.erase(destIt, end); + + // Note that the cache size might temporarily not match the model size if + // this function is called from KItemListView::setModel() to empty the cache. + if (!m_logicalHeightHintCache.isEmpty() && m_itemListView->model()) { + Q_ASSERT(m_logicalHeightHintCache.count() == m_itemListView->model()->count()); + } } -void KItemListSizeHintResolver::itemsMoved(int index, int count) +void KItemListSizeHintResolver::itemsMoved(const KItemRange& range, const QList& movedToIndexes) { - while (count) { - m_sizeHintCache[index] = QSizeF(); - ++index; - --count; + QVector> newLogicalHeightHintCache(m_logicalHeightHintCache); + + const int movedRangeEnd = range.index + range.count; + for (int i = range.index; i < movedRangeEnd; ++i) { + const int newIndex = movedToIndexes.at(i - range.index); + newLogicalHeightHintCache[newIndex] = m_logicalHeightHintCache.at(i); } + + m_logicalHeightHintCache = newLogicalHeightHintCache; } void KItemListSizeHintResolver::itemsChanged(int index, int count, const QSet& roles) { - Q_UNUSED(roles); + Q_UNUSED(roles) while (count) { - m_sizeHintCache[index] = QSizeF(); + m_logicalHeightHintCache[index] = std::make_pair(0.0, false); ++index; --count; } + + m_needsResolving = true; } void KItemListSizeHintResolver::clearCache() { - const int count = m_sizeHintCache.count(); - for (int i = 0; i < count; ++i) { - m_sizeHintCache[i] = QSizeF(); + m_logicalHeightHintCache.fill(std::make_pair(0.0, false)); + m_needsResolving = true; +} + +void KItemListSizeHintResolver::updateCache() +{ + if (m_needsResolving) { + m_itemListView->calculateItemSizeHints(m_logicalHeightHintCache, m_logicalWidthHint); + m_needsResolving = false; } }