1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/*
This file is part of the Nepomuk KDE project.
Copyright (C) 2010 Vishesh Handa <handa.vish@gmail.com>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) version 3, or any
later version accepted by the membership of KDE e.V. (or its
successor approved by the membership of KDE e.V.), which shall
act as a proxy defined in Section 6 of version 3 of the license.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library. If not, see <http://www.gnu.org/licenses/>.
*/
#include "identifiermodeltree.h"
#include <Nepomuk/Vocabulary/NIE>
#include <Nepomuk/Vocabulary/NFO>
#include <Soprano/Vocabulary/RDF>
#include <Soprano/Statement>
#include <Soprano/Vocabulary/RDFS>
#include <Nepomuk/Types/Class>
Nepomuk::IdentifierModelTreeItem::IdentifierModelTreeItem(const QString& url, bool isFolder)
: FileSystemTreeItem( url, isFolder )
{
m_discarded = false;
}
QUrl Nepomuk::IdentifierModelTreeItem::type() const
{
return m_type;
}
QString Nepomuk::IdentifierModelTreeItem::toString() const
{
if( !parent() ) {
return url();
}
const QString parentString = parent()->url();
const QString ownString = url();
return ownString.mid( parentString.size() );
}
QUrl Nepomuk::IdentifierModelTreeItem::identifiedUri() const
{
return m_identifiedUrl;
}
bool Nepomuk::IdentifierModelTreeItem::discarded() const
{
return m_discarded;
}
void Nepomuk::IdentifierModelTreeItem::setDiscarded(bool status)
{
m_discarded = status;
}
// static
Nepomuk::IdentifierModelTreeItem* Nepomuk::IdentifierModelTreeItem::fromStatementList( const QList< Soprano::Statement >& stList)
{
const QUrl nieUrl = Nepomuk::Vocabulary::NIE::url();
const QUrl rdfType = Soprano::Vocabulary::RDF::type();
const QUrl nfoFolder = Nepomuk::Vocabulary::NFO::Folder();
bool isFolder = false;
QString url;
QUrl type = Soprano::Vocabulary::RDFS::Resource();
foreach( const Soprano::Statement & st, stList ) {
if( st.predicate().uri() == nieUrl ) {
url = st.object().uri().toLocalFile();
if( url.startsWith("file://") )
url = url.mid( 7 );
}
else if( st.predicate().uri() == rdfType ) {
QUrl objectUri = st.object().uri();
if( objectUri == nfoFolder )
isFolder = true;
// Get the correct type and store it into type
// FIXME: This may not be totally accurate
Types::Class oldClass( type );
Types::Class newClass( objectUri );
if( newClass.isSubClassOf( oldClass ) ) {
type = objectUri;
}
}
}
IdentifierModelTreeItem* item = new IdentifierModelTreeItem( url, isFolder );
item->m_statements = stList;
item->m_type = type;
return item;
}
QUrl Nepomuk::IdentifierModelTreeItem::resourceUri() const
{
if( m_statements.isEmpty() )
return QUrl();
return m_statements.first().subject().uri();
}
bool Nepomuk::IdentifierModelTreeItem::identified() const
{
return !m_identifiedUrl.isEmpty();
}
void Nepomuk::IdentifierModelTreeItem::setIdentified(const QUrl& newUri)
{
m_identifiedUrl = newUri;
}
void Nepomuk::IdentifierModelTreeItem::setUnidentified()
{
m_identifiedUrl.clear();
}
void Nepomuk::IdentifierModelTreeItem::discardAll()
{
setDiscarded( true );
foreach( FileSystemTreeItem* item, children() ) {
IdentifierModelTreeItem* i = dynamic_cast<IdentifierModelTreeItem*>(item);
i->discardAll();
}
}
//
// IdentifierModelTree
//
Nepomuk::IdentifierModelTree::IdentifierModelTree()
: FileSystemTree()
{
}
void Nepomuk::IdentifierModelTree::add(FileSystemTreeItem* fileItem)
{
IdentifierModelTreeItem * item = dynamic_cast<IdentifierModelTreeItem *>( fileItem );
QUrl resUri;
if( !item->m_statements.isEmpty() )
resUri = item->m_statements.first().subject().uri();
m_resUrlHash.insert( resUri, item->url() );
FileSystemTree::add(item);
}
Nepomuk::IdentifierModelTreeItem* Nepomuk::IdentifierModelTree::findByUri(const QUrl& uri)
{
QHash<QUrl, QString>::const_iterator it = m_resUrlHash.constFind( uri );
if( it != m_resUrlHash.constEnd() ) {
FileSystemTreeItem* p = find( it.value() );
return dynamic_cast<IdentifierModelTreeItem*>( p );
}
return 0;
}
void Nepomuk::IdentifierModelTree::discardAll()
{
foreach( FileSystemTreeItem* item, rootNodes() ) {
IdentifierModelTreeItem* i = dynamic_cast<IdentifierModelTreeItem*>(item);
i->discardAll();
}
}
|
