runtime/nepomuk/libnepomukquery/result.cpp

   1 /*
   2    This file is part of the Nepomuk KDE project.
   3    Copyright (C) 2008 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 "result.h"
  21 #include "qurlhash.h"
  22
  23 #include <QtCore/QSharedData>
  24 #include <QtCore/QHash>
  25
  26
  27 class Nepomuk::Search::Result::Private : public QSharedData
  28 {
  29 public:
  30     QUrl resource;
  31     double score;
  32     QHash<QUrl, Soprano::Node> requestProperties;
  33 };
  34
  35
  36 Nepomuk::Search::Result::Result()
  37     : d( new Private() )
  38 {
  39 }
  40
  41
  42 Nepomuk::Search::Result::Result( const QUrl& uri, double score )
  43     : d( new Private() )
  44 {
  45     d->resource = uri;
  46     d->score = score;
  47 }
  48
  49
  50 Nepomuk::Search::Result::Result( const Result& other )
  51 {
  52     d = other.d;
  53 }
  54
  55
  56 Nepomuk::Search::Result::~Result()
  57 {
  58 }
  59
  60
  61 Nepomuk::Search::Result& Nepomuk::Search::Result::operator=( const Result& other )
  62 {
  63     d = other.d;
  64     return *this;
  65 }
  66
  67
  68 double Nepomuk::Search::Result::score() const
  69 {
  70     return d->score;
  71 }
  72
  73
  74 QUrl Nepomuk::Search::Result::resourceUri() const
  75 {
  76     return d->resource;
  77 }
  78
  79
  80 void Nepomuk::Search::Result::setScore( double score )
  81 {
  82     d->score = score;
  83 }
  84
  85
  86 void Nepomuk::Search::Result::addRequestProperty( const QUrl& property, const Soprano::Node& value )
  87 {
  88     d->requestProperties[property] = value;
  89 }
  90
  91
  92 Soprano::Node Nepomuk::Search::Result::operator[]( const QUrl& property ) const
  93 {
  94     return requestProperty( property );
  95 }
  96
  97
  98 Soprano::Node Nepomuk::Search::Result::requestProperty( const QUrl& property ) const
  99 {
 100     QHash<QUrl, Soprano::Node>::const_iterator it = d->requestProperties.find( property );
 101     if ( it != d->requestProperties.end() ) {
 102         return *it;
 103     }
 104     else {
 105         return Soprano::Node();
 106     }
 107 }
 108
 109
 110 QHash<QUrl, Soprano::Node> Nepomuk::Search::Result::requestProperties() const
 111 {
 112     return d->requestProperties;
 113 }
 114
 115
 116 bool Nepomuk::Search::Result::operator==( const Result& other ) const
 117 {
 118     if ( d->resource != other.d->resource ||
 119          d->score != other.d->score ) {
 120         return false;
 121     }
 122     for ( QHash<QUrl, Soprano::Node>::const_iterator it = d->requestProperties.constBegin();
 123           it != d->requestProperties.constEnd(); ++it ) {
 124         QHash<QUrl, Soprano::Node>::const_iterator it2 = other.d->requestProperties.constFind( it.key() );
 125         if ( it2 == other.d->requestProperties.constEnd() ||
 126              it2.value() != it.value() ) {
 127             return false;
 128         }
 129     }
 130     for ( QHash<QUrl, Soprano::Node>::const_iterator it = other.d->requestProperties.constBegin();
 131           it != other.d->requestProperties.constEnd(); ++it ) {
 132         QHash<QUrl, Soprano::Node>::const_iterator it2 = d->requestProperties.constFind( it.key() );
 133         if ( it2 == d->requestProperties.constEnd() ||
 134              it2.value() != it.value() ) {
 135             return false;
 136         }
 137     }
 138     return true;
 139 }