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
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
|
/*
This file is part of the Nepomuk KDE project.
Copyright (C) 2007 Sebastian Trueg <[email protected]>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License version 2 as published by the Free Software Foundation.
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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "tagcloud.h"
#include "newtagdialog.h"
#include <QtGui/QFont>
#include <QtGui/QFontMetrics>
#include <QtCore/QList>
#include <QtGui/QPushButton>
#include <QtCore/Qt>
#include <QtCore/QTime>
#include <QtGui/QPainter>
#include <QtGui/QMouseEvent>
#include <QtGui/QPalette>
#include <QtGui/QInputDialog>
#include <QtGui/QAction>
#include <KRandomSequence>
#include <KLocale>
#include <KColorScheme>
#include <KDebug>
#include <Soprano/Client/DBusModel>
#include <Soprano/QueryResultIterator>
#include <Soprano/Vocabulary/RDF>
#include <Soprano/Vocabulary/NAO>
#include <nepomuk/resourcemanager.h>
#include <math.h>
namespace {
const int s_hSpacing = 10;
const int s_vSpacing = 5;
class TagNode {
public:
TagNode()
: weight( 0 ),
selected( false ) {
}
// fixed info
Nepomuk::Tag tag;
int weight;
// misc
bool selected;
// info generated by rebuildCloud
QFont font;
QRect rect;
QRect zoomedRect;
QString text;
};
bool tagNodeNameLessThan( const TagNode& n1, const TagNode& n2 ) {
return n1.text < n2.text;
}
bool tagNodeWeightLessThan( const TagNode& n1, const TagNode& n2 ) {
return n1.weight < n2.weight;
}
int rowLength( const QList<TagNode*>& row ) {
int rowLen = 0;
for ( int j = 0; j < row.count(); ++j ) {
rowLen += row[j]->rect.width();
if ( j < row.count()-1 ) {
rowLen += s_hSpacing;
}
}
return rowLen;
}
int rowHeight( const QList<TagNode*>& row ) {
int h = 0;
for ( int j = 0; j < row.count(); ++j ) {
h = qMax( row[j]->rect.height(), h );
}
return h;
}
QSize cloudSize( const QList<QList<TagNode*> >& rows ) {
int w = 0;
int h = 0;
for ( int i = 0; i < rows.count(); ++i ) {
w = qMax( w, rowLength( rows[i] ) );
h += rowHeight( rows[i] );
if ( i < rows.count()-1 ) {
h += s_vSpacing;
}
}
return QSize( w, h );
}
}
class Nepomuk::TagCloud::Private
{
public:
Private( TagCloud* parent )
: maxFontSize( 0 ),
minFontSize( 0 ),
maxNumberDisplayedTags( 0 ),
selectionEnabled( false ),
newTagButtonEnabled( false ),
alignment( Qt::AlignCenter ),
sorting( SortAlpabetically ),
zoomEnabled( true ),
showAllTags( false ),
customNewTagAction( 0 ),
hoverTag( 0 ),
cachedHfwWidth( -1 ),
m_parent( parent ) {
newTagNode.text = i18nc( "@label", "New Tag..." );
}
int maxFontSize;
int minFontSize;
int maxNumberDisplayedTags;
bool selectionEnabled;
bool newTagButtonEnabled;
Qt::Alignment alignment;
Sorting sorting;
bool zoomEnabled;
// The resource whose tags we are showing
// invalid if we show all tags or a selection
QUrl resource;
bool showAllTags;
// the actual nodes
QList<TagNode> nodes;
// just a helper structure for speeding up things
QList<QList<TagNode*> > rows;
TagNode newTagNode;
QAction* customNewTagAction;
TagNode* hoverTag;
QMatrix zoomMatrix;
QSize cachedSizeHint;
int cachedHfwWidth;
int cachedHfwHeight;
void invalidateCachedValues() {
cachedSizeHint = QSize();
cachedHfwWidth = -1;
}
int getMinFontSize() const;
int getMaxFontSize() const;
void updateNodeWeights();
void updateNodeFonts();
void sortNodes();
void rebuildCloud();
TagNode* tagAt( const QPoint& pos );
TagNode* findTagInRow( const QList<TagNode*>& row, const QPoint& pos );
TagNode* nodeForTag( const Tag& tag );
int calculateWeight( const Nepomuk::Tag& tag );
private:
TagCloud* m_parent;
};
int Nepomuk::TagCloud::Private::getMinFontSize() const
{
return minFontSize > 0 ? minFontSize : ( 8 * m_parent->font().pointSize() / 10 );
}
int Nepomuk::TagCloud::Private::getMaxFontSize() const
{
return maxFontSize > 0 ? maxFontSize : ( 22 * m_parent->font().pointSize() / 10 );
}
int Nepomuk::TagCloud::Private::calculateWeight( const Nepomuk::Tag& tag )
{
// stupid SPARQL has no functions such as count!
Soprano::QueryResultIterator it
= ResourceManager::instance()->mainModel()->executeQuery( QString( "select ?r where { ?r <%1> <%2> . }" )
.arg( Soprano::Vocabulary::NAO::hasTag().toString() )
.arg( QString::fromAscii( tag.resourceUri().toEncoded() ) ),
Soprano::Query::QueryLanguageSparql );
int w = 0;
while ( it.next() ) {
++w;
}
return w;
}
void Nepomuk::TagCloud::Private::updateNodeWeights()
{
bool changedWeights = false;
for ( QList<TagNode>::iterator it = nodes.begin();
it != nodes.end(); ++it ) {
TagNode& node = *it;
int w = calculateWeight( node.tag );
if ( w != node.weight ) {
node.weight = w;
changedWeights = true;
}
}
if ( changedWeights ) {
updateNodeFonts();
}
}
void Nepomuk::TagCloud::Private::updateNodeFonts()
{
int maxWeight = 0;
int minWeight = 0;
for ( QList<TagNode>::iterator it = nodes.begin();
it != nodes.end(); ++it ) {
TagNode& node = *it;
minWeight = qMin( minWeight, node.weight );
maxWeight = qMax( maxWeight, node.weight );
}
// calculate font sizes
// ----------------------------------------------
int usedMinFontSize = getMinFontSize();
int usedMaxFontSize = getMaxFontSize();
for ( QList<TagNode>::iterator it = nodes.begin();
it != nodes.end(); ++it ) {
TagNode& node = *it;
double normalizedWeight = (double)(node.weight - minWeight) / (double)qMax(maxWeight - minWeight, 1);
node.font = m_parent->font();
node.font.setPointSize( usedMinFontSize + (int)((double)(usedMaxFontSize-usedMinFontSize) * normalizedWeight) );
if( normalizedWeight > 0.8 )
node.font.setBold( true );
}
if ( newTagButtonEnabled ) {
newTagNode.font = m_parent->font();
newTagNode.font.setPointSize( usedMinFontSize );
newTagNode.font.setUnderline( true );
}
}
void Nepomuk::TagCloud::Private::sortNodes()
{
if ( sorting == SortAlpabetically ) {
qSort( nodes.begin(), nodes.end(), tagNodeNameLessThan );
}
else if ( sorting == SortByWeight ) {
qSort( nodes.begin(), nodes.end(), tagNodeWeightLessThan );
}
else if ( sorting == SortRandom ) {
KRandomSequence().randomize( nodes );
}
}
void Nepomuk::TagCloud::Private::rebuildCloud()
{
if ( nodes.isEmpty() && !newTagButtonEnabled ) {
return;
}
// - Always try to be quadratic
// - Always prefer to expand horizontally
// - If we cannot fit everything into m_parent->contentsRect(), zoom
// - If alignment & Qt::AlignJustify insert spaces between tags
sortNodes();
QRect contentsRect = m_parent->contentsRect();
// initialize the nodes' sizes
// ----------------------------------------------
for ( QList<TagNode>::iterator it = nodes.begin();
it != nodes.end(); ++it ) {
TagNode& node = *it;
node.rect = QFontMetrics( node.font ).boundingRect( node.text );
}
if ( newTagButtonEnabled ) {
newTagNode.rect = QFontMetrics( newTagNode.font ).boundingRect( customNewTagAction ? customNewTagAction->text() : newTagNode.text );
}
// and position the nodes
// ----------------------------------------------
rows.clear();
if ( 0 ) { // FIXME: make it configurable
QRect lineRect;
QRect totalRect;
QList<TagNode*> row;
for ( QList<TagNode>::iterator it = nodes.begin();
it != nodes.end(); /* We do increment it below */ ) {
TagNode& node = *it;
int usedSpacing = row.isEmpty() ? 0 : s_hSpacing;
if ( lineRect.width() + usedSpacing + node.rect.width() <= contentsRect.width() ) {
node.rect.moveBottomLeft( QPoint( lineRect.right() + usedSpacing, lineRect.bottom() ) );
QRect newLineRect = lineRect.united( node.rect );
newLineRect.moveTopLeft( lineRect.topLeft() );
lineRect = newLineRect;
row.append( &node );
// update all other nodes in this line
Q_FOREACH( TagNode* n, row ) {
n->rect.moveBottom( lineRect.bottom() - ( lineRect.height() - n->rect.height() )/2 );
}
++it;
}
else {
rows.append( row );
row.clear();
int newLineTop = lineRect.bottom() + s_vSpacing;
lineRect = QRect();
lineRect.moveTop( newLineTop );
}
}
rows.append( row );
}
else {
// initialize first row
rows.append( QList<TagNode*>() );
for ( QList<TagNode>::iterator it = nodes.begin();
it != nodes.end(); ++it ) {
TagNode& node = *it;
rows.first().append( &node );
}
if ( newTagButtonEnabled ) {
rows.first().append( &newTagNode );
}
// calculate the rows
QList<QList<TagNode*> > bestRows( rows );
QSize size( rowLength( rows.first() ), rowHeight( rows.first() ) );
QSize bestSize( size );
while ( ( size.height() < size.width() ||
size.width() > contentsRect.width() ) &&
size.height() <= contentsRect.height() ) {
// find the longest row
int maxRow = 0;
int maxLen = 0;
for ( int i = 0; i < rows.count(); ++i ) {
int rowLen = rowLength( rows[i] );
if ( rowLen > maxLen ) {
maxLen = rowLen;
maxRow = i;
}
}
// move the last item from the longest row to the next row
TagNode* node = rows[maxRow].takeLast();
if ( rows.count() <= maxRow+1 ) {
rows.append( QList<TagNode*>() );
}
rows[maxRow+1].prepend( node );
// update the size
size = cloudSize( rows );
if ( size.width() < bestSize.width() &&
( size.width() > size.height() ||
bestSize.width() > contentsRect.width() ) &&
size.height() <= contentsRect.height() ) {
bestSize = size;
bestRows = rows;
}
}
rows = bestRows;
// position the tags
int y = 0;
for ( QList<QList<TagNode*> >::iterator rowIt = rows.begin(); rowIt != rows.end(); ++rowIt ) {
QList<TagNode*>& row = *rowIt;
int h = rowHeight( row );
int x = 0;
Q_FOREACH( TagNode* node, row ) {
node->rect.moveTop( y + ( h - node->rect.height() )/2 );
node->rect.moveLeft( x );
x += s_hSpacing + node->rect.width();
}
y += h + s_vSpacing;
}
}
// let's see if we have to zoom
// ----------------------------------------------
zoomMatrix = QMatrix();
int w = contentsRect.width();
if ( zoomEnabled ) {
for ( QList<QList<TagNode*> >::iterator rowIt = rows.begin(); rowIt != rows.end(); ++rowIt ) {
QList<TagNode*>& row = *rowIt;
w = qMax( w, row.last()->rect.right() );
}
if ( w > contentsRect.width() ) {
double zoomFactor = ( double )contentsRect.width() / ( double )w;
zoomMatrix.scale( zoomFactor, zoomFactor );
}
}
// force horizontal alignment
// ----------------------------------------------
for ( QList<QList<TagNode*> >::iterator rowIt = rows.begin(); rowIt != rows.end(); ++rowIt ) {
QList<TagNode*>& row = *rowIt;
int space = /*contentsRect.right()*/w - row.last()->rect.right();
if ( alignment & ( Qt::AlignRight|Qt::AlignHCenter ) ) {
Q_FOREACH( TagNode* node, row ) {
node->rect.moveLeft( node->rect.left() + ( alignment & Qt::AlignRight ? space : space/2 ) );
}
}
else if ( alignment & Qt::AlignJustify && row.count() > 1 ) {
space /= ( row.count()-1 );
int i = 0;
Q_FOREACH( TagNode* node, row ) {
node->rect.moveLeft( node->rect.left() + ( space * i++ ) );
}
}
}
// force vertical alignment
// ----------------------------------------------
int verticalSpace = contentsRect.bottom() - rows.last().first()->rect.bottom();
if ( alignment & ( Qt::AlignBottom|Qt::AlignVCenter ) ) {
for ( QList<QList<TagNode*> >::iterator rowIt = rows.begin(); rowIt != rows.end(); ++rowIt ) {
Q_FOREACH( TagNode* node, *rowIt ) {
node->rect.moveTop( node->rect.top() + ( alignment & Qt::AlignBottom ? verticalSpace : verticalSpace/2 ) );
}
}
}
for( QList<TagNode>::iterator it = nodes.begin(); it != nodes.end(); ++it ) {
it->zoomedRect = zoomMatrix.mapRect( it->rect );
}
newTagNode.zoomedRect = zoomMatrix.mapRect( newTagNode.rect );
m_parent->updateGeometry();
m_parent->update();
}
// binary search in row
TagNode* Nepomuk::TagCloud::Private::findTagInRow( const QList<TagNode*>& row, const QPoint& pos )
{
int x = row.count() * pos.x() / m_parent->width();
int i = 0;
while ( 1 ) {
if ( x-i >= 0 && x-i < row.count() && row[x-i]->zoomedRect.contains( pos ) ) {
return row[x-i];
}
else if ( x+i >= 0 && x+i < row.count() && row[x+i]->zoomedRect.contains( pos ) ) {
return row[x+i];
}
if ( x-i < 0 && x+i >= row.count() ) {
return 0;
}
++i;
}
return 0;
}
// binary search in cloud
TagNode* Nepomuk::TagCloud::Private::tagAt( const QPoint& pos )
{
int y = rows.count() * pos.y() / m_parent->height();
int i = 0;
while ( 1 ) {
if ( y-i >= 0 && y-i < rows.count() ) {
if ( TagNode* node = findTagInRow( rows[y-i], pos ) ) {
return node;
}
}
if ( y+i >= 0 && y+i < rows.count() ) {
if ( TagNode* node = findTagInRow( rows[y+i], pos ) ) {
return node;
}
}
if ( y-i < 0 && y+i >= rows.count() ) {
return 0;
}
++i;
}
return 0;
}
TagNode* Nepomuk::TagCloud::Private::nodeForTag( const Tag& tag )
{
for ( QList<TagNode>::iterator it = nodes.begin();
it != nodes.end(); ++it ) {
TagNode& node = *it;
if ( tag == node.tag ) {
return &node;
}
}
return 0;
}
Nepomuk::TagCloud::TagCloud( QWidget* parent )
: QFrame( parent ),
d( new Private(this) )
{
QSizePolicy policy( QSizePolicy::Preferred,
QSizePolicy::Preferred );
policy.setHeightForWidth( true );
setSizePolicy( policy );
setMouseTracking( true );
// Since signals are delivered in no particular order
// our slot might be called before the resources are updated
// Then, we would use invalid cached data.
// By using queued connections this problem should be solved.
connect( ResourceManager::instance()->mainModel(),
SIGNAL( statementAdded( const Soprano::Statement& ) ),
this,
SLOT( slotStatementAdded( const Soprano::Statement& ) ),
Qt::QueuedConnection );
connect( ResourceManager::instance()->mainModel(),
SIGNAL( statementRemoved( const Soprano::Statement& ) ),
this,
SLOT( slotStatementRemoved( const Soprano::Statement& ) ),
Qt::QueuedConnection );
}
Nepomuk::TagCloud::~TagCloud()
{
delete d;
}
void Nepomuk::TagCloud::setMaxFontSize( int size )
{
d->invalidateCachedValues();
d->maxFontSize = size;
d->updateNodeFonts();
d->rebuildCloud();
}
void Nepomuk::TagCloud::setMinFontSize( int size )
{
d->invalidateCachedValues();
d->minFontSize = size;
d->updateNodeFonts();
d->rebuildCloud();
}
void Nepomuk::TagCloud::setMaxNumberDisplayedTags( int n )
{
d->maxNumberDisplayedTags = n;
d->rebuildCloud();
}
void Nepomuk::TagCloud::setSelectionEnabled( bool enabled )
{
d->selectionEnabled = enabled;
update();
}
void Nepomuk::TagCloud::setNewTagButtonEnabled( bool enabled )
{
d->newTagButtonEnabled = enabled;
d->rebuildCloud();
}
bool Nepomuk::TagCloud::zoomEnabled() const
{
return d->zoomEnabled;
}
void Nepomuk::TagCloud::setZoomEnabled( bool zoom )
{
if ( d->zoomEnabled != zoom ) {
d->zoomEnabled = zoom;
d->rebuildCloud();
}
}
void Nepomuk::TagCloud::setContextMenuEnabled( bool enabled )
{
}
void Nepomuk::TagCloud::setAlignment( Qt::Alignment alignment )
{
d->alignment = alignment;
d->rebuildCloud();
}
void Nepomuk::TagCloud::setSorting( Sorting s )
{
d->invalidateCachedValues();
d->sorting = s;
d->rebuildCloud();
}
void Nepomuk::TagCloud::showAllTags()
{
showTags( Nepomuk::Tag::allTags() );
d->showAllTags = true;
}
void Nepomuk::TagCloud::showResourceTags( const Resource& resource )
{
showTags( resource.tags() );
d->resource = resource.uri();
}
void Nepomuk::TagCloud::showTags( const QList<Tag>& tags )
{
d->resource = QUrl();
d->showAllTags = false;
d->invalidateCachedValues();
d->nodes.clear();
Q_FOREACH( const Tag &tag, tags ) {
TagNode node;
node.tag = tag;
node.weight = d->calculateWeight( tag );
node.text = node.tag.genericLabel();
d->nodes.append( node );
}
d->updateNodeFonts();
d->rebuildCloud();
}
void Nepomuk::TagCloud::setTagSelected( const Tag& tag, bool selected )
{
if ( TagNode* node = d->nodeForTag( tag ) ) {
node->selected = selected;
if ( d->selectionEnabled ) {
update( node->zoomedRect );
}
}
}
QSize Nepomuk::TagCloud::sizeHint() const
{
// If we have tags d->rebuildCloud() has been called at least once,
// thus, we have proper rects (i.e. needed sizes)
if ( !d->cachedSizeHint.isValid() ) {
QList<QList<TagNode*> > rows;
rows.append( QList<TagNode*>() );
for ( QList<TagNode>::iterator it = d->nodes.begin();
it != d->nodes.end(); ++it ) {
TagNode& node = *it;
rows.first().append( &node );
}
if ( d->newTagButtonEnabled ) {
rows.first().append( &d->newTagNode );
}
QSize size( rowLength( rows.first() ), rowHeight( rows.first() ) );
QSize bestSize( size );
while ( size.height() < size.width() ) {
// find the longest row
int maxRow = 0;
int maxLen = 0;
for ( int i = 0; i < rows.count(); ++i ) {
int rowLen = rowLength( rows[i] );
if ( rowLen > maxLen ) {
maxLen = rowLen;
maxRow = i;
}
}
// move the last item from the longest row to the next row
TagNode* node = rows[maxRow].takeLast();
if ( rows.count() <= maxRow+1 ) {
rows.append( QList<TagNode*>() );
}
rows[maxRow+1].prepend( node );
// update the size
size = cloudSize( rows );
if ( size.width() < bestSize.width() &&
size.width() > size.height() ) {
bestSize = size;
}
}
d->cachedSizeHint = QSize( bestSize.width() + frameWidth()*2,
bestSize.height() + frameWidth()*2 );
}
return d->cachedSizeHint;
}
QSize Nepomuk::TagCloud::minimumSizeHint() const
{
return QFrame::minimumSizeHint();
// If we have tags d->rebuildCloud() has been called at least once,
// thus, we have proper rects (i.e. needed sizes)
if ( d->nodes.isEmpty() && !d->newTagButtonEnabled ) {
return QSize( fontMetrics().width( i18nc( "@label Indicator when no tags defined", "No Tags" ) ), fontMetrics().height() );
}
else {
QSize size;
for ( QList<TagNode>::iterator it = d->nodes.begin();
it != d->nodes.end(); ++it ) {
size.setWidth( qMax( size.width(), ( *it ).rect.width() ) );
size.setHeight( qMax( size.height(), ( *it ).rect.height() ) );
}
if ( d->newTagButtonEnabled ) {
size.setWidth( qMax( size.width(), d->newTagNode.rect.width() ) );
size.setHeight( qMax( size.height(), d->newTagNode.rect.height() ) );
}
size.setWidth( size.width() + frameWidth()*2 );
size.setHeight( size.height() + frameWidth()*2 );
return size;
}
}
int Nepomuk::TagCloud::heightForWidth( int contentsWidth ) const
{
// If we have tags d->rebuildCloud() has been called at least once,
// thus, we have proper rects (i.e. needed sizes)
// FIXME: add zoom here
if ( d->cachedHfwWidth != contentsWidth ) {
// have to keep in mind the frame
contentsWidth -= frameWidth()*2;
QList<TagNode*> allNodes;
for ( QList<TagNode>::iterator it = d->nodes.begin();
it != d->nodes.end(); ++it ) {
TagNode& node = *it;
allNodes.append( &node );
}
if ( d->newTagButtonEnabled ) {
allNodes.append( &d->newTagNode );
}
int h = 0;
bool newRow = true;
int rowW = 0;
int rowH = 0;
for ( int i = 0; i < allNodes.count(); ++i ) {
int w = rowW;
if ( !newRow ) {
w += s_hSpacing;
}
newRow = false;
w += allNodes[i]->rect.width();
if ( w <= contentsWidth ) {
rowH = qMax( rowH, allNodes[i]->rect.height() );
rowW = w;
}
else {
if ( h > 0 ) {
h += s_vSpacing;
}
h += rowH;
rowH = allNodes[i]->rect.height();
rowW = allNodes[i]->rect.width();
}
}
if ( rowH > 0 ) {
h += s_vSpacing + rowH;
}
d->cachedHfwWidth = contentsWidth;
d->cachedHfwHeight = h;
}
return d->cachedHfwHeight + frameWidth()*2;
}
void Nepomuk::TagCloud::resizeEvent( QResizeEvent* e )
{
QFrame::resizeEvent( e );
d->rebuildCloud();
update();
}
void Nepomuk::TagCloud::paintEvent( QPaintEvent* e )
{
QFrame::paintEvent( e );
KStatefulBrush normalTextBrush( KColorScheme::View, KColorScheme::NormalText );
KStatefulBrush activeTextBrush( KColorScheme::View, KColorScheme::VisitedText );
KStatefulBrush hoverTextBrush( KColorScheme::View, KColorScheme::ActiveText );
QPainter p( this );
QRegion paintRegion = e->region();
p.save();
p.setMatrix( d->zoomMatrix );
for ( QList<TagNode>::iterator it = d->nodes.begin();
it != d->nodes.end(); ++it ) {
TagNode& node = *it;
if ( paintRegion.contains( node.zoomedRect ) ) {
p.setFont( node.font );
if ( &node == d->hoverTag ) {
p.setPen( hoverTextBrush.brush( this ).color() );
}
else if ( d->selectionEnabled && node.selected ) {
p.setPen( activeTextBrush.brush( this ).color() );
}
else {
p.setPen( normalTextBrush.brush( this ).color() );
}
p.drawText( node.rect, Qt::AlignCenter, node.text );
}
}
if ( d->newTagButtonEnabled ) {
p.setFont( d->newTagNode.font );
if ( &d->newTagNode == d->hoverTag ) {
p.setPen( hoverTextBrush.brush( this ).color() );
}
else {
p.setPen( normalTextBrush.brush( this ).color() );
}
p.drawText( d->newTagNode.rect, Qt::AlignCenter, d->customNewTagAction ? d->customNewTagAction->text() : d->newTagNode.text );
}
p.restore();
}
void Nepomuk::TagCloud::mousePressEvent( QMouseEvent* e )
{
if ( e->button() == Qt::LeftButton ) {
if ( TagNode* node = d->tagAt( e->pos() ) ) {
kDebug() << "clicked" << node->text;
if ( node == &d->newTagNode ) {
if ( d->customNewTagAction ) {
d->customNewTagAction->trigger();
}
else {
// FIXME: nicer gui
Tag newTag = NewTagDialog::createTag( this );
if ( newTag.isValid() ) {
emit tagAdded( newTag );
}
}
}
else {
emit tagClicked( node->tag );
if ( d->selectionEnabled ) {
kDebug() << "Toggleing tag" << node->text;
node->selected = !node->selected;
emit tagToggled( node->tag, node->selected );
update( node->zoomedRect );
}
}
}
}
}
void Nepomuk::TagCloud::mouseMoveEvent( QMouseEvent* e )
{
if ( e->buttons() == Qt::NoButton ) {
TagNode* oldHoverTag = d->hoverTag;
if ( ( d->hoverTag = d->tagAt( e->pos() ) ) &&
!d->selectionEnabled ) {
setCursor( Qt::PointingHandCursor );
}
else if ( d->newTagButtonEnabled &&
d->newTagNode.zoomedRect.contains( e->pos() ) ) {
d->hoverTag = &d->newTagNode;
setCursor( Qt::PointingHandCursor );
}
else {
unsetCursor();
}
if ( oldHoverTag || d->hoverTag ) {
QRect updateRect;
if ( d->hoverTag )
updateRect = updateRect.united( d->hoverTag->zoomedRect );
if ( oldHoverTag )
updateRect = updateRect.united( oldHoverTag->zoomedRect );
update( updateRect );
}
}
}
void Nepomuk::TagCloud::leaveEvent( QEvent* )
{
unsetCursor();
if ( d->hoverTag ) {
QRect updateRect = d->hoverTag->zoomedRect;
d->hoverTag = 0;
update( updateRect );
}
}
void Nepomuk::TagCloud::slotStatementAdded( const Soprano::Statement& s )
{
if ( s.predicate().uri() == Soprano::Vocabulary::RDF::type() &&
s.object().uri() == Nepomuk::Tag::resourceTypeUri() ) {
// new tag created
if ( d->showAllTags ) {
showAllTags();
}
}
else if ( s.predicate().uri() == Nepomuk::Resource::tagUri() ) {
if ( s.subject().uri() == d->resource ) {
showResourceTags( d->resource );
}
else {
// weights might have changed
d->updateNodeWeights();
d->rebuildCloud();
}
}
}
void Nepomuk::TagCloud::slotStatementRemoved( const Soprano::Statement& s )
{
// FIXME: In theory might contain empty nodes as wildcards
if ( s.predicate().uri() == Nepomuk::Resource::tagUri() ) {
if ( d->resource.isValid() &&
d->resource == s.subject().uri() ) {
showResourceTags( d->resource );
}
else {
// weights might have changed
d->updateNodeWeights();
d->rebuildCloud();
}
}
else if ( s.predicate().uri() == Soprano::Vocabulary::RDF::type() &&
s.object().uri() == Nepomuk::Tag::resourceTypeUri() ) {
// tag deleted
if ( d->showAllTags ) {
showAllTags();
}
}
}
void Nepomuk::TagCloud::setCustomNewTagAction( QAction* action )
{
d->customNewTagAction = action;
setNewTagButtonEnabled( action != 0 );
}
#include "tagcloud.moc"
|