-
Notifications
You must be signed in to change notification settings - Fork 0
/
q_sort_filter_proxy_model.cpp
2413 lines (2085 loc) · 84.9 KB
/
q_sort_filter_proxy_model.cpp
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
#include <qsortfilterproxymodel.h>
#ifndef QT_NO_SORTFILTERPROXYMODEL
#include <qitemselectionmodel.h>
#include <qsize.h>
#include <qdebug.h>
#include <qdatetime.h>
#include <qpair.h>
#include <qstringlist.h>
#include </home/oleg/Soft/programming/Qt5.3.1/5.3/gcc/include/QtCore/5.3.1/QtCore/private/qabstractitemmodel_p.h>
#include </home/oleg/Soft/programming/Qt5.3.1/5.3/gcc/include/QtCore/5.3.1/QtCore/private/qabstractproxymodel_p.h>
QT_BEGIN_NAMESPACE
typedef QList<QPair<QModelIndex, QPersistentModelIndex> > QModelIndexPairList;
static inline QSet<int> qVectorToSet(const QVector<int> &vector)
{
QSet<int> set;
set.reserve(vector.size());
for(int i=0; i < vector.size(); ++i)
set << vector.at(i);
return set;
}
class QSortFilterProxyModelLessThan
{
public:
inline QSortFilterProxyModelLessThan(int column, const QModelIndex &parent,
const QAbstractItemModel *source,
const QSortFilterProxyModel *proxy)
: sort_column(column), source_parent(parent), source_model(source), proxy_model(proxy) {}
inline bool operator()(int r1, int r2) const
{
QModelIndex i1 = source_model->index(r1, sort_column, source_parent);
QModelIndex i2 = source_model->index(r2, sort_column, source_parent);
return proxy_model->lessThan(i1, i2);
}
private:
int sort_column;
QModelIndex source_parent;
const QAbstractItemModel *source_model;
const QSortFilterProxyModel *proxy_model;
};
class QSortFilterProxyModelGreaterThan
{
public:
inline QSortFilterProxyModelGreaterThan(int column, const QModelIndex &parent,
const QAbstractItemModel *source,
const QSortFilterProxyModel *proxy)
: sort_column(column), source_parent(parent),
source_model(source), proxy_model(proxy) {}
inline bool operator()(int r1, int r2) const
{
QModelIndex i1 = source_model->index(r1, sort_column, source_parent);
QModelIndex i2 = source_model->index(r2, sort_column, source_parent);
return proxy_model->lessThan(i2, i1);
}
private:
int sort_column;
QModelIndex source_parent;
const QAbstractItemModel *source_model;
const QSortFilterProxyModel *proxy_model;
};
class QSortFilterProxyModelPrivate : public QAbstractProxyModelPrivate
{
Q_DECLARE_PUBLIC(QSortFilterProxyModel)
public:
struct Mapping {
QVector<int> source_rows;
QVector<int> source_columns;
QVector<int> proxy_rows;
QVector<int> proxy_columns;
QVector<QModelIndex> mapped_children;
QMap<QModelIndex, Mapping *>::const_iterator map_iter;
};
mutable QMap<QModelIndex, Mapping*> source_index_mapping;
int source_sort_column;
int proxy_sort_column;
Qt::SortOrder sort_order;
Qt::CaseSensitivity sort_casesensitivity;
int sort_role;
bool sort_localeaware;
int filter_column;
QRegExp filter_regexp;
int filter_role;
bool dynamic_sortfilter;
QModelIndexPairList saved_persistent_indexes;
QMap<QModelIndex, Mapping *>::const_iterator create_mapping(
const QModelIndex &source_parent) const;
QModelIndex proxy_to_source(const QModelIndex &proxyIndex) const;
QModelIndex source_to_proxy(const QModelIndex &sourceIndex) const;
bool can_create_mapping(const QModelIndex &source_parent) const;
void remove_from_mapping(const QModelIndex &source_parent);
inline QMap<QModelIndex, Mapping *>::const_iterator index_to_iterator(
const QModelIndex &proxy_index) const
{
Q_ASSERT(proxy_index.isValid());
Q_ASSERT(proxy_index.model() == q_func());
const void *p = proxy_index.internalPointer();
Q_ASSERT(p);
QMap<QModelIndex, Mapping *>::const_iterator it =
static_cast<const Mapping*>(p)->map_iter;
Q_ASSERT(it != source_index_mapping.constEnd());
Q_ASSERT(it.value());
return it;
}
inline QModelIndex create_index(int row, int column,
QMap<QModelIndex, Mapping*>::const_iterator it) const
{
return q_func()->createIndex(row, column, *it);
}
void _q_sourceDataChanged(const QModelIndex &source_top_left,
const QModelIndex &source_bottom_right);
void _q_sourceHeaderDataChanged(Qt::Orientation orientation, int start, int end);
void _q_sourceReset();
void _q_sourceLayoutAboutToBeChanged();
void _q_sourceLayoutChanged();
void _q_sourceRowsAboutToBeInserted(const QModelIndex &source_parent,
int start, int end);
void _q_sourceRowsInserted(const QModelIndex &source_parent,
int start, int end);
void _q_sourceRowsAboutToBeRemoved(const QModelIndex &source_parent,
int start, int end);
void _q_sourceRowsRemoved(const QModelIndex &source_parent,
int start, int end);
void _q_sourceColumnsAboutToBeInserted(const QModelIndex &source_parent,
int start, int end);
void _q_sourceColumnsInserted(const QModelIndex &source_parent,
int start, int end);
void _q_sourceColumnsAboutToBeRemoved(const QModelIndex &source_parent,
int start, int end);
void _q_sourceColumnsRemoved(const QModelIndex &source_parent,
int start, int end);
void clear_mapping();
void sort();
bool update_source_sort_column();
void sort_source_rows(QVector<int> &source_rows,
const QModelIndex &source_parent) const;
QVector<QPair<int, QVector<int > > > proxy_intervals_for_source_items_to_add(
const QVector<int> &proxy_to_source, const QVector<int> &source_items,
const QModelIndex &source_parent, Qt::Orientation orient) const;
QVector<QPair<int, int > > proxy_intervals_for_source_items(
const QVector<int> &source_to_proxy, const QVector<int> &source_items) const;
void insert_source_items(
QVector<int> &source_to_proxy, QVector<int> &proxy_to_source,
const QVector<int> &source_items, const QModelIndex &source_parent,
Qt::Orientation orient, bool emit_signal = true);
void remove_source_items(
QVector<int> &source_to_proxy, QVector<int> &proxy_to_source,
const QVector<int> &source_items, const QModelIndex &source_parent,
Qt::Orientation orient, bool emit_signal = true);
void remove_proxy_interval(
QVector<int> &source_to_proxy, QVector<int> &proxy_to_source,
int proxy_start, int proxy_end, const QModelIndex &proxy_parent,
Qt::Orientation orient, bool emit_signal = true);
void build_source_to_proxy_mapping(
const QVector<int> &proxy_to_source, QVector<int> &source_to_proxy) const;
void source_items_inserted(const QModelIndex &source_parent,
int start, int end, Qt::Orientation orient);
void source_items_about_to_be_removed(const QModelIndex &source_parent,
int start, int end, Qt::Orientation orient);
void source_items_removed(const QModelIndex &source_parent,
int start, int end, Qt::Orientation orient);
void proxy_item_range(
const QVector<int> &source_to_proxy, const QVector<int> &source_items,
int &proxy_low, int &proxy_high) const;
QModelIndexPairList store_persistent_indexes();
void update_persistent_indexes(const QModelIndexPairList &source_indexes);
void filter_changed(const QModelIndex &source_parent = QModelIndex());
QSet<int> handle_filter_changed(
QVector<int> &source_to_proxy, QVector<int> &proxy_to_source,
const QModelIndex &source_parent, Qt::Orientation orient);
void updateChildrenMapping(const QModelIndex &source_parent, Mapping *parent_mapping,
Qt::Orientation orient, int start, int end, int delta_item_count, bool remove);
virtual void _q_sourceModelDestroyed();
};
typedef QMap<QModelIndex, QSortFilterProxyModelPrivate::Mapping *> IndexMap;
void QSortFilterProxyModelPrivate::_q_sourceModelDestroyed()
{
QAbstractProxyModelPrivate::_q_sourceModelDestroyed();
clear_mapping();
}
void QSortFilterProxyModelPrivate::remove_from_mapping(const QModelIndex &source_parent)
{
if (Mapping *m = source_index_mapping.take(source_parent)) {
for (int i = 0; i < m->mapped_children.size(); ++i)
remove_from_mapping(m->mapped_children.at(i));
delete m;
}
}
void QSortFilterProxyModelPrivate::clear_mapping()
{
// store the persistent indexes
QModelIndexPairList source_indexes = store_persistent_indexes();
qDeleteAll(source_index_mapping);
source_index_mapping.clear();
// update the persistent indexes
update_persistent_indexes(source_indexes);
}
IndexMap::const_iterator QSortFilterProxyModelPrivate::create_mapping(
const QModelIndex &source_parent) const
{
Q_Q(const QSortFilterProxyModel);
IndexMap::const_iterator it = source_index_mapping.constFind(source_parent);
if (it != source_index_mapping.constEnd()) // was mapped already
return it;
Mapping *m = new Mapping;
int source_rows = model->rowCount(source_parent);
for (int i = 0; i < source_rows; ++i) {
if (q->filterAcceptsRow(i, source_parent))
m->source_rows.append(i);
}
int source_cols = model->columnCount(source_parent);
for (int i = 0; i < source_cols; ++i) {
if (q->filterAcceptsColumn(i, source_parent))
m->source_columns.append(i);
}
sort_source_rows(m->source_rows, source_parent);
m->proxy_rows.resize(source_rows);
build_source_to_proxy_mapping(m->source_rows, m->proxy_rows);
m->proxy_columns.resize(source_cols);
build_source_to_proxy_mapping(m->source_columns, m->proxy_columns);
it = IndexMap::const_iterator(source_index_mapping.insert(source_parent, m));
m->map_iter = it;
if (source_parent.isValid()) {
QModelIndex source_grand_parent = source_parent.parent();
IndexMap::const_iterator it2 = create_mapping(source_grand_parent);
Q_ASSERT(it2 != source_index_mapping.constEnd());
it2.value()->mapped_children.append(source_parent);
}
Q_ASSERT(it != source_index_mapping.constEnd());
Q_ASSERT(it.value());
return it;
}
QModelIndex QSortFilterProxyModelPrivate::proxy_to_source(const QModelIndex &proxy_index) const
{
if (!proxy_index.isValid())
return QModelIndex(); // for now; we may want to be able to set a root index later
if (proxy_index.model() != q_func()) {
qWarning() << "QSortFilterProxyModel: index from wrong model passed to mapToSource";
return QModelIndex();
}
IndexMap::const_iterator it = index_to_iterator(proxy_index);
Mapping *m = it.value();
if ((proxy_index.row() >= m->source_rows.size()) || (proxy_index.column() >= m->source_columns.size()))
return QModelIndex();
int source_row = m->source_rows.at(proxy_index.row());
int source_col = m->source_columns.at(proxy_index.column());
return model->index(source_row, source_col, it.key());
}
QModelIndex QSortFilterProxyModelPrivate::source_to_proxy(const QModelIndex &source_index) const
{
if (!source_index.isValid())
return QModelIndex(); // for now; we may want to be able to set a root index later
if (source_index.model() != model) {
qWarning() << "QSortFilterProxyModel: index from wrong model passed to mapFromSource";
return QModelIndex();
}
QModelIndex source_parent = source_index.parent();
IndexMap::const_iterator it = create_mapping(source_parent);
Mapping *m = it.value();
if ((source_index.row() >= m->proxy_rows.size()) || (source_index.column() >= m->proxy_columns.size()))
return QModelIndex();
int proxy_row = m->proxy_rows.at(source_index.row());
int proxy_column = m->proxy_columns.at(source_index.column());
if (proxy_row == -1 || proxy_column == -1)
return QModelIndex();
return create_index(proxy_row, proxy_column, it);
}
bool QSortFilterProxyModelPrivate::can_create_mapping(const QModelIndex &source_parent) const
{
if (source_parent.isValid()) {
QModelIndex source_grand_parent = source_parent.parent();
IndexMap::const_iterator it = source_index_mapping.constFind(source_grand_parent);
if (it == source_index_mapping.constEnd()) {
// Don't care, since we don't have mapping for the grand parent
return false;
}
Mapping *gm = it.value();
if (gm->proxy_rows.at(source_parent.row()) == -1 ||
gm->proxy_columns.at(source_parent.column()) == -1) {
// Don't care, since parent is filtered
return false;
}
}
return true;
}
/*!
\internal
Sorts the existing mappings.
*/
void QSortFilterProxyModelPrivate::sort()
{
Q_Q(QSortFilterProxyModel);
emit q->layoutAboutToBeChanged();
QModelIndexPairList source_indexes = store_persistent_indexes();
IndexMap::const_iterator it = source_index_mapping.constBegin();
for (; it != source_index_mapping.constEnd(); ++it) {
QModelIndex source_parent = it.key();
Mapping *m = it.value();
sort_source_rows(m->source_rows, source_parent);
build_source_to_proxy_mapping(m->source_rows, m->proxy_rows);
}
update_persistent_indexes(source_indexes);
emit q->layoutChanged();
}
/*!
\internal
update the source_sort_column according to the proxy_sort_column
return true if the column was changed
*/
bool QSortFilterProxyModelPrivate::update_source_sort_column()
{
Q_Q(QSortFilterProxyModel);
QModelIndex proxy_index = q->index(0, proxy_sort_column, QModelIndex());
int old_source_sort_colum = source_sort_column;
source_sort_column = q->mapToSource(proxy_index).column();
return old_source_sort_colum != source_sort_column;
}
/*!
\internal
Sorts the given \a source_rows according to current sort column and order.
*/
void QSortFilterProxyModelPrivate::sort_source_rows(
QVector<int> &source_rows, const QModelIndex &source_parent) const
{
Q_Q(const QSortFilterProxyModel);
if (source_sort_column >= 0) {
if (sort_order == Qt::AscendingOrder) {
QSortFilterProxyModelLessThan lt(source_sort_column, source_parent, model, q);
qStableSort(source_rows.begin(), source_rows.end(), lt);
} else {
QSortFilterProxyModelGreaterThan gt(source_sort_column, source_parent, model, q);
qStableSort(source_rows.begin(), source_rows.end(), gt);
}
} else { // restore the source model order
qStableSort(source_rows.begin(), source_rows.end());
}
}
/*!
\internal
Given source-to-proxy mapping \a source_to_proxy and the set of
source items \a source_items (which are part of that mapping),
determines the corresponding proxy item intervals that should
be removed from the proxy model.
The result is a vector of pairs, where each pair represents a
(start, end) tuple, sorted in ascending order.
*/
QVector<QPair<int, int > > QSortFilterProxyModelPrivate::proxy_intervals_for_source_items(
const QVector<int> &source_to_proxy, const QVector<int> &source_items) const
{
QVector<QPair<int, int> > proxy_intervals;
if (source_items.isEmpty())
return proxy_intervals;
int source_items_index = 0;
while (source_items_index < source_items.size()) {
int first_proxy_item = source_to_proxy.at(source_items.at(source_items_index));
Q_ASSERT(first_proxy_item != -1);
int last_proxy_item = first_proxy_item;
++source_items_index;
// Find end of interval
while ((source_items_index < source_items.size())
&& (source_to_proxy.at(source_items.at(source_items_index)) == last_proxy_item + 1)) {
++last_proxy_item;
++source_items_index;
}
// Add interval to result
proxy_intervals.append(QPair<int, int>(first_proxy_item, last_proxy_item));
}
qStableSort(proxy_intervals.begin(), proxy_intervals.end());
return proxy_intervals;
}
/*!
\internal
Given source-to-proxy mapping \a src_to_proxy and proxy-to-source mapping
\a proxy_to_source, removes \a source_items from this proxy model.
The corresponding proxy items are removed in intervals, so that the proper
rows/columnsRemoved(start, end) signals will be generated.
*/
void QSortFilterProxyModelPrivate::remove_source_items(
QVector<int> &source_to_proxy, QVector<int> &proxy_to_source,
const QVector<int> &source_items, const QModelIndex &source_parent,
Qt::Orientation orient, bool emit_signal)
{
Q_Q(QSortFilterProxyModel);
QModelIndex proxy_parent = q->mapFromSource(source_parent);
if (!proxy_parent.isValid() && source_parent.isValid())
return; // nothing to do (already removed)
QVector<QPair<int, int> > proxy_intervals;
proxy_intervals = proxy_intervals_for_source_items(source_to_proxy, source_items);
for (int i = proxy_intervals.size()-1; i >= 0; --i) {
QPair<int, int> interval = proxy_intervals.at(i);
int proxy_start = interval.first;
int proxy_end = interval.second;
remove_proxy_interval(source_to_proxy, proxy_to_source, proxy_start, proxy_end,
proxy_parent, orient, emit_signal);
}
}
/*!
\internal
Given source-to-proxy mapping \a source_to_proxy and proxy-to-source mapping
\a proxy_to_source, removes items from \a proxy_start to \a proxy_end
(inclusive) from this proxy model.
*/
void QSortFilterProxyModelPrivate::remove_proxy_interval(
QVector<int> &source_to_proxy, QVector<int> &proxy_to_source, int proxy_start, int proxy_end,
const QModelIndex &proxy_parent, Qt::Orientation orient, bool emit_signal)
{
Q_Q(QSortFilterProxyModel);
if (emit_signal) {
if (orient == Qt::Vertical)
q->beginRemoveRows(proxy_parent, proxy_start, proxy_end);
else
q->beginRemoveColumns(proxy_parent, proxy_start, proxy_end);
}
// Remove items from proxy-to-source mapping
proxy_to_source.remove(proxy_start, proxy_end - proxy_start + 1);
build_source_to_proxy_mapping(proxy_to_source, source_to_proxy);
if (emit_signal) {
if (orient == Qt::Vertical)
q->endRemoveRows();
else
q->endRemoveColumns();
}
}
/*!
\internal
Given proxy-to-source mapping \a proxy_to_source and a set of
unmapped source items \a source_items, determines the proxy item
intervals at which the subsets of source items should be inserted
(but does not actually add them to the mapping).
The result is a vector of pairs, each pair representing a tuple (start,
items), where items is a vector containing the (sorted) source items that
should be inserted at that proxy model location.
*/
QVector<QPair<int, QVector<int > > > QSortFilterProxyModelPrivate::proxy_intervals_for_source_items_to_add(
const QVector<int> &proxy_to_source, const QVector<int> &source_items,
const QModelIndex &source_parent, Qt::Orientation orient) const
{
Q_Q(const QSortFilterProxyModel);
QVector<QPair<int, QVector<int> > > proxy_intervals;
if (source_items.isEmpty())
return proxy_intervals;
int proxy_low = 0;
int proxy_item = 0;
int source_items_index = 0;
QVector<int> source_items_in_interval;
bool compare = (orient == Qt::Vertical && source_sort_column >= 0);
while (source_items_index < source_items.size()) {
source_items_in_interval.clear();
int first_new_source_item = source_items.at(source_items_index);
source_items_in_interval.append(first_new_source_item);
++source_items_index;
// Find proxy item at which insertion should be started
int proxy_high = proxy_to_source.size() - 1;
QModelIndex i1 = compare ? model->index(first_new_source_item, source_sort_column, source_parent) : QModelIndex();
while (proxy_low <= proxy_high) {
proxy_item = (proxy_low + proxy_high) / 2;
if (compare) {
QModelIndex i2 = model->index(proxy_to_source.at(proxy_item), source_sort_column, source_parent);
if ((sort_order == Qt::AscendingOrder) ? q->lessThan(i1, i2) : q->lessThan(i2, i1))
proxy_high = proxy_item - 1;
else
proxy_low = proxy_item + 1;
} else {
if (first_new_source_item < proxy_to_source.at(proxy_item))
proxy_high = proxy_item - 1;
else
proxy_low = proxy_item + 1;
}
}
proxy_item = proxy_low;
// Find the sequence of new source items that should be inserted here
if (proxy_item >= proxy_to_source.size()) {
for ( ; source_items_index < source_items.size(); ++source_items_index)
source_items_in_interval.append(source_items.at(source_items_index));
} else {
i1 = compare ? model->index(proxy_to_source.at(proxy_item), source_sort_column, source_parent) : QModelIndex();
for ( ; source_items_index < source_items.size(); ++source_items_index) {
int new_source_item = source_items.at(source_items_index);
if (compare) {
QModelIndex i2 = model->index(new_source_item, source_sort_column, source_parent);
if ((sort_order == Qt::AscendingOrder) ? q->lessThan(i1, i2) : q->lessThan(i2, i1))
break;
} else {
if (proxy_to_source.at(proxy_item) < new_source_item)
break;
}
source_items_in_interval.append(new_source_item);
}
}
// Add interval to result
proxy_intervals.append(QPair<int, QVector<int> >(proxy_item, source_items_in_interval));
}
return proxy_intervals;
}
/*!
\internal
Given source-to-proxy mapping \a source_to_proxy and proxy-to-source mapping
\a proxy_to_source, inserts the given \a source_items into this proxy model.
The source items are inserted in intervals (based on some sorted order), so
that the proper rows/columnsInserted(start, end) signals will be generated.
*/
void QSortFilterProxyModelPrivate::insert_source_items(
QVector<int> &source_to_proxy, QVector<int> &proxy_to_source,
const QVector<int> &source_items, const QModelIndex &source_parent,
Qt::Orientation orient, bool emit_signal)
{
Q_Q(QSortFilterProxyModel);
QModelIndex proxy_parent = q->mapFromSource(source_parent);
if (!proxy_parent.isValid() && source_parent.isValid())
return; // nothing to do (source_parent is not mapped)
QVector<QPair<int, QVector<int> > > proxy_intervals;
proxy_intervals = proxy_intervals_for_source_items_to_add(
proxy_to_source, source_items, source_parent, orient);
for (int i = proxy_intervals.size()-1; i >= 0; --i) {
QPair<int, QVector<int> > interval = proxy_intervals.at(i);
int proxy_start = interval.first;
QVector<int> source_items = interval.second;
int proxy_end = proxy_start + source_items.size() - 1;
if (emit_signal) {
if (orient == Qt::Vertical)
q->beginInsertRows(proxy_parent, proxy_start, proxy_end);
else
q->beginInsertColumns(proxy_parent, proxy_start, proxy_end);
}
for (int i = 0; i < source_items.size(); ++i)
proxy_to_source.insert(proxy_start + i, source_items.at(i));
build_source_to_proxy_mapping(proxy_to_source, source_to_proxy);
if (emit_signal) {
if (orient == Qt::Vertical)
q->endInsertRows();
else
q->endInsertColumns();
}
}
}
/*!
\internal
Handles source model items insertion (columnsInserted(), rowsInserted()).
Determines
1) which of the inserted items to also insert into proxy model (filtering),
2) where to insert the items into the proxy model (sorting),
then inserts those items.
The items are inserted into the proxy model in intervals (based on
sorted order), so that the proper rows/columnsInserted(start, end)
signals will be generated.
*/
void QSortFilterProxyModelPrivate::source_items_inserted(
const QModelIndex &source_parent, int start, int end, Qt::Orientation orient)
{
Q_Q(QSortFilterProxyModel);
if ((start < 0) || (end < 0))
return;
IndexMap::const_iterator it = source_index_mapping.constFind(source_parent);
if (it == source_index_mapping.constEnd()) {
if (!can_create_mapping(source_parent))
return;
it = create_mapping(source_parent);
Mapping *m = it.value();
QModelIndex proxy_parent = q->mapFromSource(source_parent);
if (m->source_rows.count() > 0) {
q->beginInsertRows(proxy_parent, 0, m->source_rows.count() - 1);
q->endInsertRows();
}
if (m->source_columns.count() > 0) {
q->beginInsertColumns(proxy_parent, 0, m->source_columns.count() - 1);
q->endInsertColumns();
}
return;
}
Mapping *m = it.value();
QVector<int> &source_to_proxy = (orient == Qt::Vertical) ? m->proxy_rows : m->proxy_columns;
QVector<int> &proxy_to_source = (orient == Qt::Vertical) ? m->source_rows : m->source_columns;
int delta_item_count = end - start + 1;
int old_item_count = source_to_proxy.size();
updateChildrenMapping(source_parent, m, orient, start, end, delta_item_count, false);
// Expand source-to-proxy mapping to account for new items
if (start < 0 || start > source_to_proxy.size()) {
qWarning("QSortFilterProxyModel: invalid inserted rows reported by source model");
remove_from_mapping(source_parent);
return;
}
source_to_proxy.insert(start, delta_item_count, -1);
if (start < old_item_count) {
// Adjust existing "stale" indexes in proxy-to-source mapping
int proxy_count = proxy_to_source.size();
for (int proxy_item = 0; proxy_item < proxy_count; ++proxy_item) {
int source_item = proxy_to_source.at(proxy_item);
if (source_item >= start)
proxy_to_source.replace(proxy_item, source_item + delta_item_count);
}
build_source_to_proxy_mapping(proxy_to_source, source_to_proxy);
}
// Figure out which items to add to mapping based on filter
QVector<int> source_items;
for (int i = start; i <= end; ++i) {
if ((orient == Qt::Vertical)
? q->filterAcceptsRow(i, source_parent)
: q->filterAcceptsColumn(i, source_parent)) {
source_items.append(i);
}
}
// Sort and insert the items
if (orient == Qt::Vertical) // Only sort rows
sort_source_rows(source_items, source_parent);
insert_source_items(source_to_proxy, proxy_to_source, source_items, source_parent, orient);
}
/*!
\internal
Handles source model items removal
(columnsAboutToBeRemoved(), rowsAboutToBeRemoved()).
*/
void QSortFilterProxyModelPrivate::source_items_about_to_be_removed(
const QModelIndex &source_parent, int start, int end, Qt::Orientation orient)
{
if ((start < 0) || (end < 0))
return;
IndexMap::const_iterator it = source_index_mapping.constFind(source_parent);
if (it == source_index_mapping.constEnd()) {
// Don't care, since we don't have mapping for this index
return;
}
Mapping *m = it.value();
QVector<int> &source_to_proxy = (orient == Qt::Vertical) ? m->proxy_rows : m->proxy_columns;
QVector<int> &proxy_to_source = (orient == Qt::Vertical) ? m->source_rows : m->source_columns;
// figure out which items to remove
QVector<int> source_items_to_remove;
int proxy_count = proxy_to_source.size();
for (int proxy_item = 0; proxy_item < proxy_count; ++proxy_item) {
int source_item = proxy_to_source.at(proxy_item);
if ((source_item >= start) && (source_item <= end))
source_items_to_remove.append(source_item);
}
remove_source_items(source_to_proxy, proxy_to_source, source_items_to_remove,
source_parent, orient);
}
/*!
\internal
Handles source model items removal (columnsRemoved(), rowsRemoved()).
*/
void QSortFilterProxyModelPrivate::source_items_removed(
const QModelIndex &source_parent, int start, int end, Qt::Orientation orient)
{
if ((start < 0) || (end < 0))
return;
IndexMap::const_iterator it = source_index_mapping.constFind(source_parent);
if (it == source_index_mapping.constEnd()) {
// Don't care, since we don't have mapping for this index
return;
}
Mapping *m = it.value();
QVector<int> &source_to_proxy = (orient == Qt::Vertical) ? m->proxy_rows : m->proxy_columns;
QVector<int> &proxy_to_source = (orient == Qt::Vertical) ? m->source_rows : m->source_columns;
if (end >= source_to_proxy.size())
end = source_to_proxy.size() - 1;
// Shrink the source-to-proxy mapping to reflect the new item count
int delta_item_count = end - start + 1;
source_to_proxy.remove(start, delta_item_count);
int proxy_count = proxy_to_source.size();
if (proxy_count > source_to_proxy.size()) {
// mapping is in an inconsistent state -- redo the whole mapping
qWarning("QSortFilterProxyModel: inconsistent changes reported by source model");
remove_from_mapping(source_parent);
Q_Q(QSortFilterProxyModel);
q->reset();
return;
}
// Adjust "stale" indexes in proxy-to-source mapping
for (int proxy_item = 0; proxy_item < proxy_count; ++proxy_item) {
int source_item = proxy_to_source.at(proxy_item);
if (source_item >= start) {
Q_ASSERT(source_item - delta_item_count >= 0);
proxy_to_source.replace(proxy_item, source_item - delta_item_count);
}
}
build_source_to_proxy_mapping(proxy_to_source, source_to_proxy);
updateChildrenMapping(source_parent, m, orient, start, end, delta_item_count, true);
}
/*!
\internal
updates the mapping of the children when inserting or removing items
*/
void QSortFilterProxyModelPrivate::updateChildrenMapping(const QModelIndex &source_parent, Mapping *parent_mapping,
Qt::Orientation orient, int start, int end, int delta_item_count, bool remove)
{
// see if any mapped children should be (re)moved
QVector<QPair<QModelIndex, Mapping*> > moved_source_index_mappings;
QVector<QModelIndex>::iterator it2 = parent_mapping->mapped_children.begin();
for ( ; it2 != parent_mapping->mapped_children.end();) {
const QModelIndex source_child_index = *it2;
const int pos = (orient == Qt::Vertical)
? source_child_index.row()
: source_child_index.column();
if (pos < start) {
// not affected
++it2;
} else if (remove && pos <= end) {
// in the removed interval
it2 = parent_mapping->mapped_children.erase(it2);
remove_from_mapping(source_child_index);
} else {
// below the removed items -- recompute the index
QModelIndex new_index;
const int newpos = remove ? pos - delta_item_count : pos + delta_item_count;
if (orient == Qt::Vertical) {
new_index = model->index(newpos,
source_child_index.column(),
source_parent);
} else {
new_index = model->index(source_child_index.row(),
newpos,
source_parent);
}
*it2 = new_index;
++it2;
// update mapping
Mapping *cm = source_index_mapping.take(source_child_index);
Q_ASSERT(cm);
// we do not reinsert right away, because the new index might be identical with another, old index
moved_source_index_mappings.append(QPair<QModelIndex, Mapping*>(new_index, cm));
}
}
// reinsert moved, mapped indexes
QVector<QPair<QModelIndex, Mapping*> >::iterator it = moved_source_index_mappings.begin();
for (; it != moved_source_index_mappings.end(); ++it) {
#ifdef QT_STRICT_ITERATORS
source_index_mapping.insert((*it).first, (*it).second);
(*it).second->map_iter = source_index_mapping.constFind((*it).first);
#else
(*it).second->map_iter = source_index_mapping.insert((*it).first, (*it).second);
#endif
}
}
/*!
\internal
*/
void QSortFilterProxyModelPrivate::proxy_item_range(
const QVector<int> &source_to_proxy, const QVector<int> &source_items,
int &proxy_low, int &proxy_high) const
{
proxy_low = INT_MAX;
proxy_high = INT_MIN;
for (int i = 0; i < source_items.count(); ++i) {
int proxy_item = source_to_proxy.at(source_items.at(i));
Q_ASSERT(proxy_item != -1);
if (proxy_item < proxy_low)
proxy_low = proxy_item;
if (proxy_item > proxy_high)
proxy_high = proxy_item;
}
}
/*!
\internal
*/
void QSortFilterProxyModelPrivate::build_source_to_proxy_mapping(
const QVector<int> &proxy_to_source, QVector<int> &source_to_proxy) const
{
source_to_proxy.fill(-1);
int proxy_count = proxy_to_source.size();
for (int i = 0; i < proxy_count; ++i)
source_to_proxy[proxy_to_source.at(i)] = i;
}
/*!
\internal
Maps the persistent proxy indexes to source indexes and
returns the list of source indexes.
*/
QModelIndexPairList QSortFilterProxyModelPrivate::store_persistent_indexes()
{
Q_Q(QSortFilterProxyModel);
QModelIndexPairList source_indexes;
foreach (QPersistentModelIndexData *data, persistent.indexes) {
QModelIndex proxy_index = data->index;
QModelIndex source_index = q->mapToSource(proxy_index);
source_indexes.append(qMakePair(proxy_index, QPersistentModelIndex(source_index)));
}
return source_indexes;
}
/*!
\internal
Maps \a source_indexes to proxy indexes and stores those
as persistent indexes.
*/
void QSortFilterProxyModelPrivate::update_persistent_indexes(
const QModelIndexPairList &source_indexes)
{
Q_Q(QSortFilterProxyModel);
QModelIndexList from, to;
for (int i = 0; i < source_indexes.count(); ++i) {
QModelIndex source_index = source_indexes.at(i).second;
QModelIndex old_proxy_index = source_indexes.at(i).first;
create_mapping(source_index.parent());
QModelIndex proxy_index = q->mapFromSource(source_index);
from << old_proxy_index;
to << proxy_index;
}
q->changePersistentIndexList(from, to);
}
/*!
\internal
Updates the proxy model (adds/removes rows) based on the
new filter.
*/
void QSortFilterProxyModelPrivate::filter_changed(const QModelIndex &source_parent)
{
IndexMap::const_iterator it = source_index_mapping.constFind(source_parent);
if (it == source_index_mapping.constEnd())
return;
Mapping *m = it.value();
QSet<int> rows_removed = handle_filter_changed(m->proxy_rows, m->source_rows, source_parent, Qt::Vertical);
QSet<int> columns_removed = handle_filter_changed(m->proxy_columns, m->source_columns, source_parent, Qt::Horizontal);
QVector<QModelIndex>::iterator it2 = m->mapped_children.end();
while (it2 != m->mapped_children.begin()) {
--it2;
const QModelIndex source_child_index = *it2;
if (rows_removed.contains(source_child_index.row()) || columns_removed.contains(source_child_index.column())) {
it2 = m->mapped_children.erase(it2);
remove_from_mapping(source_child_index);
} else {
filter_changed(source_child_index);
}
}
}
/*!
\internal
returns the removed items indexes
*/
QSet<int> QSortFilterProxyModelPrivate::handle_filter_changed(
QVector<int> &source_to_proxy, QVector<int> &proxy_to_source,
const QModelIndex &source_parent, Qt::Orientation orient)
{
Q_Q(QSortFilterProxyModel);
// Figure out which mapped items to remove
QVector<int> source_items_remove;
for (int i = 0; i < proxy_to_source.count(); ++i) {
const int source_item = proxy_to_source.at(i);
if ((orient == Qt::Vertical)
? !q->filterAcceptsRow(source_item, source_parent)
: !q->filterAcceptsColumn(source_item, source_parent)) {
// This source item does not satisfy the filter, so it must be removed
source_items_remove.append(source_item);
}
}
// Figure out which non-mapped items to insert
QVector<int> source_items_insert;
int source_count = source_to_proxy.size();
for (int source_item = 0; source_item < source_count; ++source_item) {
if (source_to_proxy.at(source_item) == -1) {
if ((orient == Qt::Vertical)
? q->filterAcceptsRow(source_item, source_parent)
: q->filterAcceptsColumn(source_item, source_parent)) {
// This source item satisfies the filter, so it must be added
source_items_insert.append(source_item);
}
}
}
if (!source_items_remove.isEmpty() || !source_items_insert.isEmpty()) {
// Do item removal and insertion
remove_source_items(source_to_proxy, proxy_to_source,
source_items_remove, source_parent, orient);
if (orient == Qt::Vertical)
sort_source_rows(source_items_insert, source_parent);
insert_source_items(source_to_proxy, proxy_to_source,
source_items_insert, source_parent, orient);
}
return qVectorToSet(source_items_remove);
}
void QSortFilterProxyModelPrivate::_q_sourceDataChanged(const QModelIndex &source_top_left,
const QModelIndex &source_bottom_right)
{
Q_Q(QSortFilterProxyModel);
if (!source_top_left.isValid() || !source_bottom_right.isValid())
return;
QModelIndex source_parent = source_top_left.parent();
IndexMap::const_iterator it = create_mapping(source_parent);
if (it == source_index_mapping.constEnd()) {
// Don't care, since we don't have mapping for this index
return;
}