Nepomuk
Go to the documentation of this file.
20 #ifndef _NEPOMUK_QUERY_UTILS_H_
21 #define _NEPOMUK_QUERY_UTILS_H_
23 #include <QtCore/QList>
24 #include <QtCore/QHash>
28 if( rp1.count() != rp2.count() )
30 foreach(
const T& rp, rp1 ) {
31 if ( !rp2.contains( rp ) ) {
38 template<
typename Key,
typename Value>
39 bool compareHash(
const QHash<Key, Value>& h1,
const QHash<Key, Value>& h2 ) {
40 if( h1.count() != h2.count() )
42 for(
typename QHash<Key, Value>::ConstIterator it1 = h1.constBegin();
43 it1 != h1.constEnd(); ++it1 ) {
44 typename QHash<Key, Value>::ConstIterator it2 = h2.find( it1.key() );
45 if( it2 == h2.constEnd() ||
This file is part of the KDE documentation.
Documentation copyright © 1996-2013 The KDE developers.
Generated on Sat May 18 2013 11:37:37 by
doxygen 1.8.3.1 written
by
Dimitri van Heesch, © 1997-2006
KDE's Doxygen guidelines are available online.