m_caseSensitivity(Qt::CaseInsensitive),
m_itemData(),
m_items(),
+ m_nameFilter(),
+ m_filteredItems(),
m_requestRole(),
m_minimumUpdateIntervalTimer(0),
m_maximumUpdateIntervalTimer(0),
}
}
+void KFileItemModel::setNameFilter(const QString& nameFilter)
+{
+ if (m_nameFilter != nameFilter) {
+ // TODO #1: Assure that expanded items only can get hidden
+ // if no child item is visible
+
+ // TODO #2: If the user entered a '*' use a regular expression
+
+ m_nameFilter = nameFilter;
+
+ const QString filter = nameFilter.toLower();
+
+ // Check which shown items from m_itemData must get
+ // hidden and hence moved to m_filteredItems.
+ KFileItemList newFilteredItems;
+
+ foreach (ItemData* itemData, m_itemData) {
+ if (!matchesNameFilter(itemData->item, filter)) {
+ m_filteredItems.append(itemData->item);
+ newFilteredItems.append(itemData->item);
+ }
+ }
+
+ if (!newFilteredItems.isEmpty()) {
+ slotItemsDeleted(newFilteredItems);
+ }
+
+ // Check which hidden items from m_filteredItems should
+ // get visible again and hence removed from m_filteredItems.
+ KFileItemList newVisibleItems;
+
+ for (int i = m_filteredItems.count() - 1; i >= 0; --i) {
+ const KFileItem item = m_filteredItems.at(i);
+ if (matchesNameFilter(item, filter)) {
+ newVisibleItems.append(item);
+ m_filteredItems.removeAt(i);
+ }
+ }
+
+ if (!newVisibleItems.isEmpty()) {
+ slotNewItems(newVisibleItems);
+ dispatchPendingItemsToInsert();
+ }
+ }
+}
+
+QString KFileItemModel::nameFilter() const
+{
+ return m_nameFilter;
+}
+
void KFileItemModel::onGroupedSortingChanged(bool current)
{
Q_UNUSED(current);
return groups;
}
+bool KFileItemModel::matchesNameFilter(const KFileItem& item, const QString& nameFilter)
+{
+ const QString itemText = item.text().toLower();
+ return itemText.contains(nameFilter);
+}
+
#include "kfileitemmodel.moc"
*/
void setExpanded(const QSet<KUrl>& urls);
+ void setNameFilter(const QString& nameFilter);
+ QString nameFilter() const;
+
signals:
void loadingCompleted();
*/
bool isChildItem(int index) const;
+ /**
+ * @return True if the given item matches with the name filter.
+ */
+ static bool matchesNameFilter(const KFileItem& item, const QString& nameFilter);
+
private:
QWeakPointer<KDirLister> m_dirLister;
QList<ItemData*> m_itemData;
QHash<KUrl, int> m_items; // Allows O(1) access for KFileItemModel::index(const KFileItem& item)
+ QString m_nameFilter;
+ KFileItemList m_filteredItems; // Items that got hidden by KFileItemModel::setNameFilter()
+
bool m_requestRole[RolesCount];
QTimer* m_minimumUpdateIntervalTimer;
void testIndexForKeyboardSearch();
+ void testNameFilter();
+
private:
bool isModelConsistent() const;
QStringList itemsInModel() const;
// TODO: Maybe we should also test keyboard searches in directories which are not sorted by Name?
}
+void KFileItemModelTest::testNameFilter()
+{
+ QStringList files;
+ files << "A1" << "A2" << "Abc" << "Bcd" << "Cde";
+ m_testDir->createFiles(files);
+
+ m_dirLister->openUrl(m_testDir->url());
+ QVERIFY(QTest::kWaitForSignal(m_model, SIGNAL(itemsInserted(KItemRangeList)), DefaultTimeout));
+
+ m_model->setNameFilter("A"); // Shows A1, A2 and Abc
+ QCOMPARE(m_model->count(), 3);
+
+ m_model->setNameFilter("A2"); // Shows only A2
+ QCOMPARE(m_model->count(), 1);
+
+ m_model->setNameFilter("A2"); // Shows only A1
+ QCOMPARE(m_model->count(), 1);
+
+ m_model->setNameFilter("Bc"); // Shows "Abc" and "Bcd"
+ QCOMPARE(m_model->count(), 2);
+
+ m_model->setNameFilter("bC"); // Shows "Abc" and "Bcd"
+ QCOMPARE(m_model->count(), 2);
+
+ m_model->setNameFilter(QString()); // Shows again all items
+ QCOMPARE(m_model->count(), 5);
+}
+
bool KFileItemModelTest::isModelConsistent() const
{
for (int i = 0; i < m_model->count(); ++i) {
void DolphinView::setNameFilter(const QString& nameFilter)
{
- Q_UNUSED(nameFilter);
- //m_viewModeController->setNameFilter(nameFilter);
+ fileItemModel()->setNameFilter(nameFilter);
}
QString DolphinView::nameFilter() const
{
- return QString(); //m_viewModeController->nameFilter();
+ return fileItemModel()->nameFilter();
}
void DolphinView::calculateItemCount(int& fileCount,