/* * Cantata * * Copyright (c) 2011-2012 Craig Drummond * */ /* * Copyright (c) 2008 Sander Knopper (sander AT knopper DOT tk) and * Roeland Douma (roeland AT rullzer DOT com) * * This file is part of QtMPC. * * QtMPC 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. * * QtMPC 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 QtMPC. If not, see . */ #include "musiclibraryitem.h" #include "musiclibraryitemartist.h" #include "musiclibraryitemalbum.h" #include "musiclibraryitemsong.h" #include "musiclibraryproxymodel.h" MusicLibraryProxyModel::MusicLibraryProxyModel(QObject *parent) : ProxyModel(parent) // , // filterField(3) { setDynamicSortFilter(true); setFilterCaseSensitivity(Qt::CaseInsensitive); setSortCaseSensitivity(Qt::CaseInsensitive); setSortLocaleAware(true); } bool MusicLibraryProxyModel::filterAcceptsRoot(const MusicLibraryItem * const item) const { // switch (filterField) { // case 0: // Artist // return item->data().contains(filterRegExp()); // case 1: // Album // for (int i = 0; i < item->childCount(); i++) { // if (item->child(i)->data().contains(filterRegExp())) { // return true; // } // } // break; // case 2: // Song // for (int i = 0; i < item->childCount(); i++) { // for (int j = 0; j < item->child(i)->childCount(); j++) { // if (item->child(i)->child(j)->data().contains(filterRegExp())) { // return true; // } // } // } // break; // case 3: // Any if (item->data().contains(filterRegExp())) return true; foreach (const MusicLibraryItem *i, item->children()) { if (i->data().contains(filterRegExp())) { return true; } } foreach (const MusicLibraryItem *i, item->children()) { foreach (const MusicLibraryItem *j, i->children()) { if (j->data().contains(filterRegExp())) { return true; } } } foreach (const MusicLibraryItem *i, item->children()) { foreach (const MusicLibraryItem *j, i->children()) { foreach (const MusicLibraryItem *k, j->children()) { if (k->data().contains(filterRegExp())) { return true; } } } } // break; // default: // break; // } // return false; } bool MusicLibraryProxyModel::filterAcceptsArtist(const MusicLibraryItem * const item) const { // switch (filterField) { // case 0: // Artist // return item->data().contains(filterRegExp()); // case 1: // Album // for (int i = 0; i < item->childCount(); i++) { // if (item->child(i)->data().contains(filterRegExp())) { // return true; // } // } // break; // case 2: // Song // for (int i = 0; i < item->childCount(); i++) { // for (int j = 0; j < item->child(i)->childCount(); j++) { // if (item->child(i)->child(j)->data().contains(filterRegExp())) { // return true; // } // } // } // break; // case 3: // Any if (item->data().contains(filterRegExp())) return true; foreach (const MusicLibraryItem *i, item->children()) { if (i->data().contains(filterRegExp())) { return true; } } foreach (const MusicLibraryItem *i, item->children()) { foreach (const MusicLibraryItem *j, i->children()) { if (j->data().contains(filterRegExp())) { return true; } } } // break; // default: // break; // } // return false; } bool MusicLibraryProxyModel::filterAcceptsAlbum(const MusicLibraryItem * const item) const { // switch (filterField) { // case 0: // Artist // return item->parent()->data().contains(filterRegExp()); // case 1: // Album // return item->data().contains(filterRegExp()); // case 2: // Song // for (int i = 0; i < item->childCount(); i++) { // if (item->child(i)->data().contains(filterRegExp())) // return true; // } // break; // case 3: // Any if (item->parent()->data().contains(filterRegExp()) || item->data().contains(filterRegExp())) return true; foreach (const MusicLibraryItem *i, item->children()) { if (i->data().contains(filterRegExp())) { return true; } } // break; // default: // break; // } return false; } bool MusicLibraryProxyModel::filterAcceptsSong(const MusicLibraryItem * const item) const { // switch (filterField) { // case 0: // Artist // return item->parent()->parent()->data().contains(filterRegExp()); // case 1: // Album // return item->parent()->data().contains(filterRegExp()); // case 2: // Song // return item->data().contains(filterRegExp()); // case 3: // Any return item->parent()->parent()->data().contains(filterRegExp()) || item->parent()->data().contains(filterRegExp()) || item->data().contains(filterRegExp()); // default: // break; // } return false; } bool MusicLibraryProxyModel::filterAcceptsRow(int sourceRow, const QModelIndex &sourceParent) const { if (filterGenre.isEmpty() && filterRegExp().isEmpty()) { return true; } if (!isChildOfRoot(sourceParent)) { return true; } const QModelIndex index = sourceModel()->index(sourceRow, 0, sourceParent); const MusicLibraryItem * const item = static_cast(index.internalPointer()); if (!filterGenre.isEmpty() && !item->hasGenre(filterGenre)) { return false; } switch (item->type()) { case MusicLibraryItem::Type_Root: return filterAcceptsRoot(item); case MusicLibraryItem::Type_Artist: return filterAcceptsArtist(item); case MusicLibraryItem::Type_Album: return filterAcceptsAlbum(item); case MusicLibraryItem::Type_Song: return filterAcceptsSong(item); default: break; } return false; } bool MusicLibraryProxyModel::lessThan(const QModelIndex &left, const QModelIndex &right) const { if (left.row()<0 || right.row()<0) { return left.row()<0; } if (static_cast(left.internalPointer())->type() == MusicLibraryItem::Type_Song) { const MusicLibraryItemSong * const leftItem = static_cast(left.internalPointer()); const MusicLibraryItemSong * const rightItem = static_cast(right.internalPointer()); bool isSingleTracks=static_cast(leftItem->parent())->isSingleTracks(); if (isSingleTracks) { int compare=leftItem->song().artistSong().localeAwareCompare(rightItem->song().artistSong()); if (0!=compare) { return compare<0; } } if (leftItem->disc() != rightItem->disc()) { return leftItem->disc() < rightItem->disc(); } return leftItem->track() < rightItem->track(); } else if (static_cast(left.internalPointer())->type() == MusicLibraryItem::Type_Album) { const MusicLibraryItemAlbum * const leftItem = static_cast(left.internalPointer()); const MusicLibraryItemAlbum * const rightItem = static_cast(right.internalPointer()); if (leftItem->isSingleTracks() != rightItem->isSingleTracks()) { return leftItem->isSingleTracks() > rightItem->isSingleTracks(); } if (MusicLibraryItemAlbum::showDate() && (leftItem->year() != rightItem->year())) { return leftItem->year() < rightItem->year(); } } else if (static_cast(left.internalPointer())->type() == MusicLibraryItem::Type_Artist) { const MusicLibraryItemArtist * const leftItem = static_cast(left.internalPointer()); const MusicLibraryItemArtist * const rightItem = static_cast(right.internalPointer()); if (leftItem->isVarious() != rightItem->isVarious()) { return leftItem->isVarious() > rightItem->isVarious(); } return leftItem->baseArtist().localeAwareCompare(rightItem->baseArtist())<0; } return QSortFilterProxyModel::lessThan(left, right); } // void MusicLibraryProxyModel::setFilterField(int field) // { // filterField = field; // } void MusicLibraryProxyModel::setFilterGenre(const QString &genre) { if (filterGenre!=genre) { invalidate(); } filterGenre=genre; }