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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252 | /* ============================================================
*
* This file is a part of digiKam project
* https://www.digikam.org
*
* Date : 2012-01-20
* Description : Duplicates items finder.
*
* SPDX-FileCopyrightText: 2012-2025 by Gilles Caulier <caulier dot gilles at gmail dot com>
* SPDX-FileCopyrightText: 2012 by Andi Clemens <andi dot clemens at gmail dot com>
* SPDX-FileCopyrightText: 2015 by Mohamed_Anwer <m_dot_anwer at gmx dot com>
*
* SPDX-License-Identifier: GPL-2.0-or-later
*
* ============================================================ */
#include "duplicatesfinder.h"
// Qt includes
#include <QTimer>
#include <QIcon>
// KDE includes
#include <klocalizedstring.h>
// Local includes
#include "digikam_debug.h"
#include "albummanager.h"
#include "itemlister.h"
#include "dnotificationwrapper.h"
#include "dnotificationwidget.h"
#include "digikamapp.h"
#include "dbjobsthread.h"
#include "dbjobsmanager.h"
#include "applicationsettings.h"
namespace Digikam
{
class Q_DECL_HIDDEN DuplicatesFinder::Private
{
public:
Private() = default;
public:
int minSimilarity = 90;
int maxSimilarity = 100;
int albumTagRelation = 0;
int searchResultRestriction = 0;
HaarIface::RefImageSelMethod refSelMethod = HaarIface::RefImageSelMethod::OlderOrLarger;
bool isAlbumUpdate = false;
QList<int> albumsIdList;
QList<int> tagsIdList;
QList<int> referenceAlbumsList;
SearchesDBJobsThread* job = nullptr;
int duplicatesFound = 0;
};
DuplicatesFinder::DuplicatesFinder(const AlbumList& albums,
const AlbumList& tags,
int albumTagRelation,
int minSimilarity,
int maxSimilarity,
int searchResultRestriction,
HaarIface::RefImageSelMethod method,
const AlbumList& referenceImageAlbum,
ProgressItem* const parent)
: MaintenanceTool(QLatin1String("DuplicatesFinder"), parent),
d (new Private)
{
d->minSimilarity = minSimilarity;
d->maxSimilarity = maxSimilarity;
d->albumTagRelation = albumTagRelation;
d->searchResultRestriction = searchResultRestriction;
d->refSelMethod = method;
for (Album* const a : std::as_const(albums))<--- Variable 'a' can be declared as pointer to const
{
d->albumsIdList << a->id();
}
for (Album* const a : std::as_const(tags))<--- Variable 'a' can be declared as pointer to const
{
d->tagsIdList << a->id();
}
for (Album* const a : std::as_const(referenceImageAlbum))<--- Variable 'a' can be declared as pointer to const
{
d->referenceAlbumsList << a->id();
}
}
DuplicatesFinder::~DuplicatesFinder()
{
delete d;
}
void DuplicatesFinder::slotStart()
{
MaintenanceTool::slotStart();
setLabel(i18n("Find duplicates items"));
setThumbnail(QIcon::fromTheme(QLatin1String("tools-wizard")).pixmap(48));
ProgressManager::addProgressItem(this);
double minThresh = d->minSimilarity / 100.0;
double maxThresh = d->maxSimilarity / 100.0;
const HaarIface::AlbumTagRelation relation = static_cast<HaarIface::AlbumTagRelation>(d->albumTagRelation);
QSet<qlonglong> imageIds = HaarIface::imagesFromAlbumsAndTags(d->albumsIdList, d->tagsIdList, relation);
QSet<qlonglong> referenceImageIds = HaarIface::imagesFromAlbumsAndTags(d->referenceAlbumsList, {}, HaarIface::AlbumExclusive);
switch(d->refSelMethod)
{
case HaarIface::RefImageSelMethod::ExcludeFolder:
case HaarIface::RefImageSelMethod::PreferFolder:
{
imageIds.unite(referenceImageIds); // All reference images must be also in the search path, otherwise no duplicates are found
break;
}
case HaarIface::RefImageSelMethod::NewerCreationDate:
case HaarIface::RefImageSelMethod::NewerModificationDate:
case HaarIface::RefImageSelMethod::OlderOrLarger:
{
break;
}
}
// Finding the duplicates
SearchesDBJobInfo jobInfo(
std::move(imageIds),
d->isAlbumUpdate,
d->refSelMethod,
std::move(referenceImageIds)
);
jobInfo.setMinThreshold(minThresh);
jobInfo.setMaxThreshold(maxThresh);
jobInfo.setSearchResultRestriction(d->searchResultRestriction);
d->job = DBJobsManager::instance()->startSearchesJobThread(jobInfo);
connect(d->job, SIGNAL(finished()),
this, SLOT(slotDone()));
connect(d->job, SIGNAL(signalProgress(int,ItemInfo,QImage,int)),
this, SLOT(slotDuplicatesProgress(int,ItemInfo,QImage,int)));
connect(this, SIGNAL(progressItemCanceled(ProgressItem*)),
this, SIGNAL(signalComplete()));
}
void DuplicatesFinder::slotDuplicatesProgress(int percentage, const ItemInfo& inf,
const QImage& /*img*/, int duplicates)
{
setThumbnail(QIcon::fromTheme(QLatin1String("search")));
QString lbl = i18n("Duplicates for: %1\n", inf.name());
lbl.append(i18n("Path: %1\n", inf.relativePath()));
if (!duplicates)
{
lbl.append(i18n("No duplicate item"));
}
else
{
lbl.append(i18np("1 duplicate item", "%1 duplicate items", duplicates));
}
setLabel(lbl);
d->duplicatesFound += duplicates;
setProgress(percentage);
}
void DuplicatesFinder::slotDone()
{
if (d->job && d->job->hasErrors())
{
qCWarning(DIGIKAM_GENERAL_LOG) << "Failed to list url: " << d->job->errorsList().first();
// Pop-up a message about the error.
DNotificationWrapper(QString(), d->job->errorsList().first(),
DigikamApp::instance(), DigikamApp::instance()->windowTitle());
}
setThumbnail(QIcon::fromTheme(QLatin1String("tools-wizard")).pixmap(48));
QString lbl;
if (totalItems() > 1)
{
lbl.append(i18n("Items scanned for duplicates: %1\n", totalItems()));
}
else
{
lbl.append(i18n("Item scanned for duplicates: %1\n", totalItems()));
}
if (d->duplicatesFound > 1)
{
lbl.append(i18n("Duplicates found: %1", d->duplicatesFound));
}
else
{
lbl.append(i18n("Duplicate found: %1", d->duplicatesFound));
}
setLabel(lbl);
// Dispatch scan resume to the icon-view info pop-up.
Q_EMIT signalScanNotification(lbl, DNotificationWidget::Information);
// save the min and max similarity in the configuration.
ApplicationSettings::instance()->setDuplicatesSearchLastMinSimilarity(d->minSimilarity);
ApplicationSettings::instance()->setDuplicatesSearchLastMaxSimilarity(d->maxSimilarity);
ApplicationSettings::instance()->setDuplicatesAlbumTagRelation(d->albumTagRelation);
ApplicationSettings::instance()->setDuplicatesSearchRestrictions(d->searchResultRestriction);
d->job = nullptr;
MaintenanceTool::slotDone();
}
void DuplicatesFinder::slotCancel()
{
if (d->job)
{
disconnect(d->job, nullptr, this, nullptr);
d->job->cancel();
d->job = nullptr;
}
MaintenanceTool::slotCancel();
}
} // namespace Digikam
#include "moc_duplicatesfinder.cpp"
|