23 return qHash(e.qualifiedName());
47 for (QHash<QString, Entry>::const_iterator entryIt = store->
begin();
48 entryIt != store->
end(); ++entryIt) {
62 Q_ASSERT(!entry.
name().isEmpty());
73 return d->entries.isEmpty();
78 return d->entries.isEmpty();
83 return d->entries.contains(entryKey);
102 if (!
d->entries.contains(entryKey)) {
104 QString prefix = splitKey[0];
105 splitKey.pop_front();
110 return d->entries [entryKey];
128 return d->entries[entryKey];
145 d->entries.remove(entryKey);
167 return d->entries.constBegin();
172 return d->entries.constEnd();
178 dbgMetaData <<
" - Metadata (there are" <<
d->entries.size() <<
" entries)";
179 Q_FOREACH (
const Entry& e,
d->entries) {
190 dbgMetaData <<
"Apply " << filters.size() <<
" filters";
191 Q_FOREACH (
const Filter* filter, filters) {
198 return d->entries.keys();
203 return d->entries.values();
const KisMetaData::Value & value() const
QString qualifiedName() const
QHash< QString, Entry > entries