src/gui/search/searchsortmodel.cpp

   1 /*
   2  * Bittorrent Client using Qt and libtorrent.
   3  * Copyright (C) 2013  sledgehammer999 <hammered999@gmail.com>
   4  *
   5  * This program is free software; you can redistribute it and/or
   6  * modify it under the terms of the GNU General Public License
   7  * as published by the Free Software Foundation; either version 2
   8  * of the License, or (at your option) any later version.
   9  *
  10  * This program is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13  * GNU General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU General Public License
  16  * along with this program; if not, write to the Free Software
  17  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
  18  *
  19  * In addition, as a special exception, the copyright holders give permission to
  20  * link this program with the OpenSSL project's "OpenSSL" library (or with
  21  * modified versions of it that use the same license as the "OpenSSL" library),
  22  * and distribute the linked executables. You must obey the GNU General Public
  23  * License in all respects for all of the code used other than "OpenSSL".  If you
  24  * modify file(s), you may extend this exception to your version of the file(s),
  25  * but you are not obligated to do so. If you do not wish to do so, delete this
  26  * exception statement from your version.
  27  */
  28
  29 #include "searchsortmodel.h"
  30
  31 #include "base/global.h"
  32
  33 SearchSortModel::SearchSortModel(QObject *parent)
  34     : base(parent)
  35 {
  36     setSortRole(UnderlyingDataRole);
  37     setFilterRole(UnderlyingDataRole);
  38 }
  39
  40 void SearchSortModel::enableNameFilter(const bool enabled)
  41 {
  42     m_isNameFilterEnabled = enabled;
  43 }
  44
  45 void SearchSortModel::setNameFilter(const QString &searchTerm)
  46 {
  47     m_searchTerm = searchTerm;
  48     if ((searchTerm.length() > 2) && searchTerm.startsWith(u'"') && searchTerm.endsWith(u'"'))
  49         m_searchTermWords = QStringList(m_searchTerm.mid(1, m_searchTerm.length() - 2));
  50     else
  51         m_searchTermWords = searchTerm.split(u' ', Qt::SkipEmptyParts);
  52 }
  53
  54 void SearchSortModel::setSizeFilter(const qint64 minSize, const qint64 maxSize)
  55 {
  56     m_minSize = std::max(static_cast<qint64>(0), minSize);
  57     m_maxSize = std::max(static_cast<qint64>(-1), maxSize);
  58 }
  59
  60 void SearchSortModel::setSeedsFilter(const int minSeeds, const int maxSeeds)
  61 {
  62     m_minSeeds = std::max(0, minSeeds);
  63     m_maxSeeds = std::max(-1, maxSeeds);
  64 }
  65
  66 void SearchSortModel::setLeechesFilter(const int minLeeches, const int maxLeeches)
  67 {
  68     m_minLeeches = std::max(0, minLeeches);
  69     m_maxLeeches = std::max(-1, maxLeeches);
  70 }
  71
  72 bool SearchSortModel::isNameFilterEnabled() const
  73 {
  74     return m_isNameFilterEnabled;
  75 }
  76
  77 QString SearchSortModel::searchTerm() const
  78 {
  79     return m_searchTerm;
  80 }
  81
  82 int SearchSortModel::minSeeds() const
  83 {
  84     return m_minSeeds;
  85 }
  86
  87 int SearchSortModel::maxSeeds() const
  88 {
  89     return m_maxSeeds;
  90 }
  91
  92 qint64 SearchSortModel::minSize() const
  93 {
  94     return m_minSize;
  95 }
  96
  97 qint64 SearchSortModel::maxSize() const
  98 {
  99     return m_maxSize;
 100 }
 101
 102 bool SearchSortModel::lessThan(const QModelIndex &left, const QModelIndex &right) const
 103 {
 104     switch (sortColumn())
 105     {
 106     case NAME:
 107     case ENGINE_URL:
 108         {
 109             const QString strL = left.data().toString();
 110             const QString strR = right.data().toString();
 111             return m_naturalLessThan(strL, strR);
 112         }
 113         break;
 114     default:
 115         return base::lessThan(left, right);
 116     };
 117 }
 118
 119 bool SearchSortModel::filterAcceptsRow(const int sourceRow, const QModelIndex &sourceParent) const
 120 {
 121     const QAbstractItemModel *const sourceModel = this->sourceModel();
 122
 123     if (m_isNameFilterEnabled && !m_searchTerm.isEmpty())
 124     {
 125         const QString name = sourceModel->data(sourceModel->index(sourceRow, NAME, sourceParent), UnderlyingDataRole).toString();
 126         for (const QString &word : asConst(m_searchTermWords))
 127         {
 128             if (!name.contains(word, Qt::CaseInsensitive))
 129                 return false;
 130         }
 131     }
 132
 133     if ((m_minSize > 0) || (m_maxSize >= 0))
 134     {
 135         const qlonglong size = sourceModel->data(sourceModel->index(sourceRow, SIZE, sourceParent), UnderlyingDataRole).toLongLong();
 136         if (((m_minSize > 0) && (size < m_minSize))
 137             || ((m_maxSize > 0) && (size > m_maxSize)))
 138             return false;
 139     }
 140
 141     if ((m_minSeeds > 0) || (m_maxSeeds >= 0))
 142     {
 143         const int seeds = sourceModel->data(sourceModel->index(sourceRow, SEEDS, sourceParent), UnderlyingDataRole).toInt();
 144         if (((m_minSeeds > 0) && (seeds < m_minSeeds))
 145             || ((m_maxSeeds > 0) && (seeds > m_maxSeeds)))
 146             return false;
 147     }
 148
 149     if ((m_minLeeches > 0) || (m_maxLeeches >= 0))
 150     {
 151         const int leeches = sourceModel->data(sourceModel->index(sourceRow, LEECHES, sourceParent), UnderlyingDataRole).toInt();
 152         if (((m_minLeeches > 0) && (leeches < m_minLeeches))
 153             || ((m_maxLeeches > 0) && (leeches > m_maxLeeches)))
 154             return false;
 155     }
 156
 157     return base::filterAcceptsRow(sourceRow, sourceParent);
 158 }