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
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940 | /* ============================================================
*
* This file is a part of digiKam project
* https://www.digikam.org
*
* Date : 2010-10-23
* Description : Graph data class for image history
*
* SPDX-FileCopyrightText: 2010-2011 by Marcel Wiesweg <marcel dot wiesweg at gmx dot de>
*
* SPDX-License-Identifier: GPL-2.0-or-later
*
* ============================================================ */
#include "itemhistorygraph.h"
// Local includes
#include "digikam_debug.h"
#include "dimagehistory.h"
#include "itemscanner.h"
#include "itemhistorygraphdata.h"
// clazy:excludeall=missing-typeinfo
namespace Digikam
{
class Q_DECL_HIDDEN ItemHistoryGraphDataSharedNull : public QSharedDataPointer<ItemHistoryGraphData>
{
public:
ItemHistoryGraphDataSharedNull()
: QSharedDataPointer<ItemHistoryGraphData>(new ItemHistoryGraphData)
{
}
};
Q_GLOBAL_STATIC(ItemHistoryGraphDataSharedNull, imageHistoryGraphDataSharedNull)
// -----------------------------------------------------------------------------------------------
ItemInfo HistoryVertexProperties::firstItemInfo() const
{
if (infos.isEmpty())
{
return ItemInfo();
}
return infos.first();
}
bool HistoryVertexProperties::markedAs(HistoryImageId::Type type) const
{
if (referredImages.isEmpty())
{
return false;
}
for (const HistoryImageId& ref : std::as_const(referredImages))<--- Consider using std::any_of algorithm instead of a raw loop.
{
if (ref.m_type == type)
{ // cppcheck-suppress useStlAlgorithm
return true;
}
}
return false;
}
bool HistoryVertexProperties::alwaysMarkedAs(HistoryImageId::Type type) const
{
if (referredImages.isEmpty())
{
return false;
}
for (const HistoryImageId& ref : std::as_const(referredImages))<--- Consider using std::all_of or std::none_of algorithm instead of a raw loop.
{
if (ref.m_type != type)
{ // cppcheck-suppress useStlAlgorithm
return false;
}
}
return true;
}
bool HistoryVertexProperties::operator==(const QString& id) const
{
return (uuid == id);
}
bool HistoryVertexProperties::operator==(const ItemInfo& info) const
{
return infos.contains(info);
}
bool HistoryVertexProperties::operator==(qlonglong id) const
{
for (const ItemInfo& info : std::as_const(infos))<--- Consider using std::any_of algorithm instead of a raw loop.
{
if (info.id() == id)
{ // cppcheck-suppress useStlAlgorithm
return true;
}
}
return false;
}
bool HistoryVertexProperties::operator==(const HistoryImageId& other) const
{
if (!uuid.isEmpty() && !other.m_uuid.isEmpty())
{
return (uuid == other.m_uuid);
}
for (const HistoryImageId& id : std::as_const(referredImages))<--- Consider using std::any_of algorithm instead of a raw loop.
{
if (ItemScanner::sameReferredImage(id, other))
{ // cppcheck-suppress useStlAlgorithm
/*
qCDebug(DIGIKAM_DATABASE_LOG) << id << "is the same as" << other;
*/
return true;
}
}
return false;
}
HistoryVertexProperties& HistoryVertexProperties::operator+=(const QString& id)
{
if (!uuid.isNull() && id.isNull())
{
uuid = id;
}
return *this;
}
HistoryVertexProperties& HistoryVertexProperties::operator+=(const ItemInfo& info)
{
if (!info.isNull() && !infos.contains(info))
{
infos << info;
if (uuid.isNull())
{
uuid = info.uuid();
}
}
return *this;
}
HistoryVertexProperties& HistoryVertexProperties::operator+=(const HistoryImageId& id)
{
if (id.isValid() && !referredImages.contains(id))
{
referredImages << id;
if (uuid.isNull() && !id.m_uuid.isEmpty())
{
uuid = id.m_uuid;
}
}
return *this;
}
QDebug operator<<(QDebug dbg, const HistoryVertexProperties& props)
{
for (const ItemInfo& info : std::as_const(props.infos))
{
dbg.space() << info.id();
}
return dbg;
}
QDebug operator<<(QDebug dbg, const HistoryImageId& id)
{
dbg.nospace() << " { ";
dbg.nospace() << id.m_uuid;
dbg.space() << id.m_type;
dbg.space() << id.m_fileName;
dbg.space() << id.m_filePath;
dbg.space() << id.m_creationDate;
dbg.space() << id.m_uniqueHash;
dbg.space() << id.m_fileSize;
dbg.space() << id.m_originalUUID;
dbg.nospace() << " } ";
return dbg;
}
// -----------------------------------------------------------------------------------------------
HistoryEdgeProperties& HistoryEdgeProperties::operator+=(const FilterAction& action)
{
actions << action;
return *this;
}
// -----------------------------------------------------------------------------------------------
HistoryGraph::Vertex ItemHistoryGraphData::addVertex(const QList<HistoryImageId>& imageIds)
{
if (imageIds.isEmpty())
{
return Vertex();
}
Vertex v = addVertex(imageIds.first());
if (imageIds.size() > 1)
{
applyProperties(v, QList<ItemInfo>(), imageIds);
}
return v;
}
HistoryGraph::Vertex ItemHistoryGraphData::addVertex(const HistoryImageId& imageId)
{
if (!imageId.isValid())
{
return Vertex();
}
Vertex v;
QList<ItemInfo> infos;
/*
qCDebug(DIGIKAM_DATABASE_LOG) << "Adding vertex" << imageId.m_uuid.left(6) << imageId.fileName();
*/
// Find by HistoryImageId (most notably, by UUID).
v = findVertexByProperties(imageId);
/*
qCDebug(DIGIKAM_DATABASE_LOG) << "Found by properties:" << (v.isNull() ? -1 : int(v));
*/
if (v.isNull())
{
// Resolve HistoryImageId, find by ItemInfo.
const auto ids = ItemScanner::resolveHistoryImageId(imageId);
for (const qlonglong& id : ids)
{
ItemInfo info(id);
/*
qCDebug(DIGIKAM_DATABASE_LOG) << "Found info id:" << info.id();
*/
infos << info;
v = findVertexByProperties(info);
}
}
applyProperties(v, infos, QList<HistoryImageId>() << imageId);
/*
qCDebug(DIGIKAM_DATABASE_LOG) << "Returning vertex" << v;
*/
return v;
}
HistoryGraph::Vertex ItemHistoryGraphData::addVertex(qlonglong id)
{
return addVertex(ItemInfo(id));
}
HistoryGraph::Vertex ItemHistoryGraphData::addVertex(const ItemInfo& info)
{
Vertex v;
QString uuid;
HistoryImageId id;
// Simply find by image id.
v = findVertexByProperties(info);
/*
qCDebug(DIGIKAM_DATABASE_LOG) << "Find by id" << info.id() << ": found" << v.isNull();
*/
if (v.isNull())
{
// Find by contents.
uuid = info.uuid();
if (!uuid.isNull())
{
v = findVertexByProperties(uuid);
}
/*
qCDebug(DIGIKAM_DATABASE_LOG) << "Find by uuid" << uuid << ": found" << v.isNull();
*/
if (v.isNull())
{
id = info.historyImageId();
v = findVertexByProperties(id);
/*
qCDebug(DIGIKAM_DATABASE_LOG) << "Find by h-i-m" << ": found" << v.isNull();
*/
}
// Need to add new vertex. Do this through the method which will resolve the history id.
if (v.isNull())
{
v = addVertex(id);
}
}
applyProperties(v, QList<ItemInfo>() << info, QList<HistoryImageId>() << id);
/*
qCDebug(DIGIKAM_DATABASE_LOG) << "Returning vertex" << v << properties(v).infos.size();
*/
return v;
}
HistoryGraph::Vertex ItemHistoryGraphData::addVertexScanned(qlonglong id)
{
// Short version where we do not read information about id from an ItemInfo.
Vertex v = findVertexByProperties(id);
applyProperties(v, QList<ItemInfo>() << ItemInfo(id), QList<HistoryImageId>());
return v;
}
void ItemHistoryGraphData::applyProperties(Vertex& v,
const QList<ItemInfo>& infos,
const QList<HistoryImageId>& ids)
{
// If needed, add a new vertex; or retrieve properties to add possibly new entries.
if (v.isNull())
{
v = HistoryGraph::addVertex();
}
HistoryVertexProperties& props = properties(v);
// Adjust properties.
for (const ItemInfo& info : std::as_const(infos))
{
// cppcheck-suppress useStlAlgorithm
props += info;
}
for (const HistoryImageId& id : std::as_const(ids))
{
// cppcheck-suppress useStlAlgorithm
props += id;
}
}
int ItemHistoryGraphData::removeNextUnresolvedVertex(int index)
{
QList<Vertex> vs = vertices(); // clazy:exclude=missing-typeinfo
for ( ; index < vs.size() ; ++index)
{
const Vertex& v = vs[index];
const HistoryVertexProperties& props = properties(v);
if (props.infos.isEmpty())
{
const auto upedgs = edges(v, HistoryGraph::EdgesToRoot);
const auto loedgs = edges(v, HistoryGraph::EdgesToLeaf);
for (const HistoryGraph::Edge& upperEdge : upedgs)
{
for (const HistoryGraph::Edge& lowerEdge : loedgs)
{
HistoryEdgeProperties combinedProps;
combinedProps.actions += properties(upperEdge).actions;
combinedProps.actions += properties(lowerEdge).actions;
HistoryGraph::Edge connection = addEdge(source(lowerEdge), target(upperEdge));
setProperties(connection, combinedProps);
}
}
remove(v);
return index;
}
}
return index;
}
QHash<HistoryGraph::Vertex, HistoryImageId::Types> ItemHistoryGraphData::categorize() const
{
QHash<Vertex, HistoryImageId::Types> types;
const auto verts = vertices();
for (const Vertex& v : verts)
{
const HistoryVertexProperties& props = properties(v);
HistoryImageId::Types type;
if (props.alwaysMarkedAs(HistoryImageId::Source))
{
type |= HistoryImageId::Source;
}
else if (isLeaf(v))
{
// Leaf: Assume current version.
type |= HistoryImageId::Current;
}
else if (isRoot(v))
{
// Root: Assume original if at least once marked as such.
if (props.markedAs(HistoryImageId::Original))
{
type |= HistoryImageId::Original;
}
}
else
{
type = HistoryImageId::Intermediate;
}
/*
* There is one situation which cannot be deduced from the graph structure:
* When there is a derived image, but the parent image shall be kept as visible "Current".
* In this case, the ExplicitBranch flag can be set on the next action.
*/
if (!(type & HistoryImageId::Current) && hasEdges(v, EdgesToLeaf))
{
// We check if all immediate actions set the ExplicitBranch flag.
bool allBranches = true;
const auto edlf = edges(v, EdgesToLeaf);
for (const Edge& e : edlf)
{
const HistoryEdgeProperties& props2 = properties(e);
if (props2.actions.isEmpty())
{
continue; // Unclear situation, ignore.
}
if (!(props2.actions.first().flags() & FilterAction::ExplicitBranch))
{
allBranches = false;
break;
}
}
if (allBranches)
{
type |= HistoryImageId::Current;
}
}
types[v] = type;
}
return types;
}
// -----------------------------------------------------------------------------------------------
ItemHistoryGraph::ItemHistoryGraph()
: d(*imageHistoryGraphDataSharedNull)
{
}
ItemHistoryGraph::ItemHistoryGraph(const ItemHistoryGraph& other)
: d(other.d)
{
}
ItemHistoryGraph::~ItemHistoryGraph()
{
}
ItemHistoryGraph& ItemHistoryGraph::operator=(const ItemHistoryGraph& other)
{
d = other.d;
return *this;
}
bool ItemHistoryGraph::isNull() const
{
return (d == *imageHistoryGraphDataSharedNull);
}
bool ItemHistoryGraph::isEmpty() const
{
return d->isEmpty();
}
bool ItemHistoryGraph::isSingleVertex() const
{
return (d->vertexCount() == 1);
}
bool ItemHistoryGraph::hasEdges() const
{
return d->hasEdges();
}
ItemHistoryGraphData& ItemHistoryGraph::data()
{
return *d;
}
const ItemHistoryGraphData& ItemHistoryGraph::data() const
{
return *d;
}
void ItemHistoryGraph::clear()
{
*d = HistoryGraph();
}
ItemHistoryGraph ItemHistoryGraph::fromInfo(const ItemInfo& info,
HistoryLoadingMode loadingMode,
ProcessingMode processingMode)
{
ItemHistoryGraph graph;
if (loadingMode & LoadRelationCloud)
{
graph.addRelations(info.relationCloud());
}
if (loadingMode & LoadSubjectHistory)
{
graph.addHistory(info.imageHistory(), info);
}
if (loadingMode & LoadLeavesHistory)
{
const auto imgs = graph.leafImages();
for (const ItemInfo& leaf : imgs)
{
if (leaf != info)
{
graph.addHistory(leaf.imageHistory(), leaf);
}
}
}
if (processingMode == PrepareForDisplay)
{
graph.prepareForDisplay(info);
}
return graph;
}
void ItemHistoryGraph::addHistory(const DImageHistory& givenHistory, const ItemInfo& historySubject)
{
addHistory(givenHistory, historySubject.historyImageId());
}
void ItemHistoryGraph::addHistory(const DImageHistory& givenHistory, const HistoryImageId& subjectId)
{
// Append the subject to its history.
DImageHistory history = givenHistory;
if (subjectId.isValid())
{
history << subjectId;
}
d->addHistory(history);
}
void ItemHistoryGraph::addScannedHistory(const DImageHistory& history, qlonglong historySubjectId)
{
d->addHistory(history, historySubjectId);
}
void ItemHistoryGraphData::addHistory(const DImageHistory& history, qlonglong extraCurrent)
{
if (history.isEmpty())
{
return;
}
HistoryGraph::Vertex last;
HistoryEdgeProperties edgeProps;
const auto& entries = history.entries();
for (const DImageHistory::Entry& entry : entries)
{
if (!last.isNull())
{
edgeProps += entry.action;
}
HistoryGraph::Vertex v;
if (!entry.referredImages.isEmpty())
{
v = addVertex(entry.referredImages);
}
if (!v.isNull())
{
if (!last.isNull())
{
if (v != last)
{
HistoryGraph::Edge e = addEdge(v, last);
setProperties(e, edgeProps);
edgeProps = HistoryEdgeProperties();
}
else
{
qCWarning(DIGIKAM_DATABASE_LOG) << "Broken history: Same file referred by different entries. "
"Refusing to add a loop.";
}
}
last = v;
}
}
if (extraCurrent)
{
HistoryGraph::Vertex v = addVertexScanned(extraCurrent);
if (!v.isNull() && !last.isNull() && (v != last))
{
HistoryGraph::Edge e = addEdge(v, last);
setProperties(e, edgeProps);
}
}
}
void ItemHistoryGraph::addRelations(const QList<QPair<qlonglong, qlonglong> >& pairs)
{
HistoryGraph::Vertex v1, v2;
typedef QPair<qlonglong, qlonglong> IdPair;
for (const IdPair& pair : std::as_const(pairs))
{
if ((pair.first < 1) || (pair.second < 1))
{
continue;
}
if (pair.first == pair.second)
{
qCWarning(DIGIKAM_DATABASE_LOG) << "Broken relations cloud: Refusing to add a loop.";
}
v1 = d->addVertex(pair.first);
v2 = d->addVertex(pair.second);
/*
qCDebug(DIGIKAM_DATABASE_LOG) << "Adding" << v1 << "->" << v2;
*/
d->addEdge(v1, v2);
}
}
void ItemHistoryGraph::reduceEdges()
{
if (d->vertexCount() <= 1)
{
return;
}
QList<HistoryGraph::Edge> removedEgdes;
HistoryGraph reduction = d->transitiveReduction(&removedEgdes);
if (reduction.isEmpty())
{
return; // Reduction failed, not a DAG.
}
for (const HistoryGraph::Edge& e : std::as_const(removedEgdes)) // cppcheck-suppress knownEmptyContainer
{
if (!d->properties(e).actions.isEmpty())
{
// TODO: conflict resolution.
qCDebug(DIGIKAM_DATABASE_LOG) << "Conflicting history information: Edge removed by transitiveReduction is not empty.";
}
}
*d = reduction;
}
bool ItemHistoryGraph::hasUnresolvedEntries() const
{
const auto verts = d->vertices();
for (const HistoryGraph::Vertex& v : verts)
{
if (d->properties(v).infos.isEmpty())
{<--- Consider using std::any_of algorithm instead of a raw loop.
return true;
}
}
return false;
}
void ItemHistoryGraph::dropUnresolvedEntries()
{
// Remove nodes which could not be resolved into image infos.
// The problem is that with each removable, the vertex list is invalidated,
// so we cannot do one loop over d->vertices.
for (int i = 0 ; i < d->vertexCount() ; )
{
i = d->removeNextUnresolvedVertex(i);
}
}
void ItemHistoryGraph::sortForInfo(const ItemInfo& subject)
{
// Remove nodes which could not be resolved into image infos.
const auto verts = d->vertices();
for (const HistoryGraph::Vertex& v : verts)
{
HistoryVertexProperties& props = d->properties(v);
ItemScanner::sortByProximity(props.infos, subject);
}
}
void ItemHistoryGraph::prepareForDisplay(const ItemInfo& subject)
{
reduceEdges();
dropUnresolvedEntries();
sortForInfo(subject);
}
QList<QPair<qlonglong, qlonglong> > ItemHistoryGraph::relationCloud() const
{
QList<QPair<qlonglong, qlonglong> > pairs;
ItemHistoryGraphData closure = ItemHistoryGraphData(d->transitiveClosure());
QList<HistoryGraph::VertexPair> edges = closure.edgePairs();
for (const HistoryGraph::VertexPair& edge : std::as_const(edges))
{
const auto& srcs = closure.properties(edge.first).infos;
for (const ItemInfo& source : srcs)
{
const auto& trgs = closure.properties(edge.second).infos;
for (const ItemInfo& target : trgs)
{
pairs << QPair<qlonglong, qlonglong>(source.id(), target.id());
}
}
}
return pairs;
}
QPair<QList<qlonglong>, QList<qlonglong> > ItemHistoryGraph::relationCloudParallel() const
{
QList<qlonglong> subjects, objects;
ItemHistoryGraphData closure = ItemHistoryGraphData(d->transitiveClosure());
QList<HistoryGraph::VertexPair> edges = closure.edgePairs();
for (const HistoryGraph::VertexPair& edge : std::as_const(edges))
{
const auto& infs = closure.properties(edge.first).infos;
for (const ItemInfo& source : infs)
{
const auto& trgs = closure.properties(edge.second).infos;
for (const ItemInfo& target : trgs)
{
subjects << source.id();
objects << target.id();
}
}
}
return qMakePair(subjects, objects);
}
QList<ItemInfo> ItemHistoryGraph::allImages() const
{
return d->toInfoList(d->vertices());
}
QList<qlonglong> ItemHistoryGraph::allImageIds() const
{
QList<qlonglong> ids;
const auto verts = d->vertices();
for (const HistoryGraph::Vertex& v : verts)
{
const auto& infs = d->properties(v).infos;
for (const ItemInfo& info : infs)
{
ids << info.id();
}
}
return ids;
}
QList<ItemInfo> ItemHistoryGraph::rootImages() const
{
return d->toInfoList(d->roots());
}
QList<ItemInfo> ItemHistoryGraph::leafImages() const
{
return d->toInfoList(d->leaves());
}
QHash<ItemInfo, HistoryImageId::Types> ItemHistoryGraph::categorize() const
{
QHash<HistoryGraph::Vertex, HistoryImageId::Types> vertexType = d->categorize();
QHash<ItemInfo, HistoryImageId::Types> types;
const auto verts = d->vertices();
for (const HistoryGraph::Vertex& v : verts)
{
const HistoryVertexProperties& props = d->properties(v);
if (props.infos.isEmpty())
{
continue;
}
HistoryImageId::Types type = vertexType.value(v);
for (const ItemInfo& info : std::as_const(props.infos))
{
types[info] = type;
}
}
return types;
}
static QString toString(const HistoryVertexProperties& props)
{
QStringList ids;
for (const ItemInfo& info : std::as_const(props.infos))
{
ids << QString::number(info.id());
}
if (props.uuid.isEmpty())
{
if (ids.size() == 1)
{
return (QLatin1String("Id: ") + ids.first());
}
else
{
return (QLatin1String("Ids: (") + ids.join(QLatin1String(",")) + QLatin1Char(')'));
}
}
else
{
if (ids.size() == 1)
{
return (QLatin1String("Id: ") + ids.first() + QLatin1String(" UUID: ") + props.uuid.left(6) + QLatin1String("..."));
}
else
{
return (QLatin1String("Ids: (") + ids.join(QLatin1String(",")) + QLatin1String(") UUID: ") + props.uuid.left(6) + QLatin1String("..."));
}
}
}
QDebug operator<<(QDebug dbg, const ItemHistoryGraph& g)
{
if (g.data().isEmpty())
{
dbg << "(Empty graph)";
return dbg;
}
QList<HistoryGraph::Vertex> vertices = g.data().topologicalSort(); // clazy:exclude=missing-typeinfo
if (vertices.isEmpty())
{
vertices = g.data().vertices();
dbg << "Not-a-DAG-Graph with" << vertices.size() << "vertices:" << Qt::endl;;
}
else
{
dbg << "Graph with" << vertices.size() << "vertices:" << Qt::endl;;
}
for (const HistoryGraph::Vertex& target : std::as_const(vertices))
{
QString targetString = toString(g.data().properties(target));
QStringList sourceVertexTexts;
const auto srcs = g.data().adjacentVertices(target, HistoryGraph::InboundEdges);
for (const HistoryGraph::Vertex& source : srcs)
{
sourceVertexTexts << toString(g.data().properties(source));
}
if (!sourceVertexTexts.isEmpty())
{
dbg.nospace() << QLatin1String("{ ") + targetString + QLatin1String(" } ") +
QLatin1String("-> { ") + sourceVertexTexts.join(QLatin1String(" }, { ")) +
QLatin1String(" }") << Qt::endl;;
}
else if (g.data().outDegree(target) == 0)
{
dbg.nospace() << QLatin1String("Unconnected: { ") + targetString + QLatin1String(" }") << Qt::endl;;
}
}
return dbg;
}
} // namespace Digikam
|