runtime/nepomuk/services/queryservice/searchcore.cpp

   1 /*
   2    This file is part of the Nepomuk KDE project.
   3    Copyright (C) 2007 Sebastian Trueg <trueg@kde.org>
   4
   5    This library is free software; you can redistribute it and/or
   6    modify it under the terms of the GNU Library General Public
   7    License version 2 as published by the Free Software Foundation.
   8
   9    This library is distributed in the hope that it will be useful,
  10    but WITHOUT ANY WARRANTY; without even the implied warranty of
  11    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12    Library General Public License for more details.
  13
  14    You should have received a copy of the GNU Library General Public License
  15    along with this library; see the file COPYING.LIB.  If not, write to
  16    the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  17    Boston, MA 02110-1301, USA.
  18  */
  19
  20 #include "searchcore.h"
  21 #include "searchthread.h"
  22 #include "qurlhash.h"
  23
  24 #include <QtCore/QEventLoop>
  25 #include <QtCore/QPointer>
  26
  27 #include <KDebug>
  28
  29 class Nepomuk::Search::SearchCore::Private
  30 {
  31 public:
  32     Private()
  33         : cutOffScore( 0.25 ),
  34           active( false ),
  35           canceled( false ) {
  36     }
  37
  38     double cutOffScore;
  39     QHash<QUrl, Nepomuk::Search::Result> lastResults;
  40     SearchThread* searchThread;
  41
  42     bool active;
  43     bool canceled;
  44
  45     QPointer<QEventLoop> eventLoop;
  46 };
  47
  48
  49 Nepomuk::Search::SearchCore::SearchCore( QObject* parent )
  50     : QObject( parent ),
  51       d( new Private() )
  52 {
  53     d->searchThread = new SearchThread( this );
  54     connect( d->searchThread, SIGNAL( newResult( const Nepomuk::Search::Result& ) ),
  55              this, SLOT( slotNewResult( const Nepomuk::Search::Result& ) ) );
  56     connect( d->searchThread, SIGNAL( finished() ),
  57              this, SLOT( slotFinished() ) );
  58 }
  59
  60
  61 Nepomuk::Search::SearchCore::~SearchCore()
  62 {
  63     d->searchThread->cancel();
  64     delete d;
  65 }
  66
  67
  68 bool Nepomuk::Search::SearchCore::isActive() const
  69 {
  70     return d->active;
  71 }
  72
  73
  74 void Nepomuk::Search::SearchCore::query( const Query& query )
  75 {
  76     d->lastResults.clear();
  77     d->canceled = false;
  78     d->active = true;
  79     d->searchThread->query( query, cutOffScore() );
  80 }
  81
  82
  83 void Nepomuk::Search::SearchCore::cancel()
  84 {
  85     d->canceled = true;
  86     d->active = false;
  87     d->searchThread->cancel();
  88 }
  89
  90
  91 void Nepomuk::Search::SearchCore::setCutOffScore( double score )
  92 {
  93     d->cutOffScore = qMin( 1.0, qMax( score, 0.0 ) );
  94 }
  95
  96
  97 double Nepomuk::Search::SearchCore::cutOffScore() const
  98 {
  99     return d->cutOffScore;
 100 }
 101
 102
 103 QList<Nepomuk::Search::Result> Nepomuk::Search::SearchCore::lastResults() const
 104 {
 105     return d->lastResults.values();
 106 }
 107
 108
 109 void Nepomuk::Search::SearchCore::slotNewResult( const Nepomuk::Search::Result& result )
 110 {
 111     if ( !d->canceled ) {
 112         QHash<QUrl, Result>::iterator it = d->lastResults.find( result.resourceUri() );
 113         if ( it == d->lastResults.end() ) {
 114             d->lastResults.insert( result.resourceUri(), result );
 115             emit newResult( result );
 116         }
 117         else {
 118             // FIXME: normalizing scores anyone??
 119             it.value().setScore( it.value().score() + result.score() );
 120             emit scoreChanged( it.value() );
 121         }
 122     }
 123 }
 124
 125
 126 void Nepomuk::Search::SearchCore::slotFinished()
 127 {
 128     kDebug();
 129     d->active = false;
 130     if ( d->eventLoop ) {
 131         d->eventLoop->exit();
 132     }
 133     emit finished();
 134 }
 135
 136
 137 QList<Nepomuk::Search::Result> Nepomuk::Search::SearchCore::blockingQuery( const Query& q )
 138 {
 139     kDebug();
 140
 141     // cancel previous search
 142     if( d->eventLoop != 0 ) {
 143         kDebug() << "Killing previous search";
 144         QEventLoop* loop = d->eventLoop;
 145         d->eventLoop = 0;
 146         d->searchThread->cancel();
 147         loop->exit();
 148     }
 149
 150     QEventLoop loop;
 151     d->eventLoop = &loop;
 152     query( q );
 153     loop.exec();
 154     d->eventLoop = 0;
 155     kDebug() << "done";
 156     return lastResults();
 157 }
 158
 159 #include "searchcore.moc"