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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
/*!
\class QCompleter
\brief The QCompleter class provides completions based on an item model.
\since 4.2
You can use QCompleter to provide auto completions in any Qt
widget, such as QLineEdit and QComboBox.
When the user starts typing a word, QCompleter suggests possible ways of
completing the word, based on a word list. The word list is
provided as a QAbstractItemModel. (For simple applications, where
the word list is static, you can pass a QStringList to
QCompleter's constructor.)
\tableofcontents
\section1 Basic Usage
A QCompleter is used typically with a QLineEdit or QComboBox.
For example, here's how to provide auto completions from a simple
word list in a QLineEdit:
\snippet doc/src/snippets/code/src_gui_util_qcompleter.cpp 0
A QFileSystemModel can be used to provide auto completion of file names.
For example:
\snippet doc/src/snippets/code/src_gui_util_qcompleter.cpp 1
To set the model on which QCompleter should operate, call
setModel(). By default, QCompleter will attempt to match the \l
{completionPrefix}{completion prefix} (i.e., the word that the
user has started typing) against the Qt::EditRole data stored in
column 0 in the model case sensitively. This can be changed
using setCompletionRole(), setCompletionColumn(), and
setCaseSensitivity().
If the model is sorted on the column and role that are used for completion,
you can call setModelSorting() with either
QCompleter::CaseSensitivelySortedModel or
QCompleter::CaseInsensitivelySortedModel as the argument. On large models,
this can lead to significant performance improvements, because QCompleter
can then use binary search instead of linear search.
The model can be a \l{QAbstractListModel}{list model},
a \l{QAbstractTableModel}{table model}, or a
\l{QAbstractItemModel}{tree model}. Completion on tree models
is slightly more involved and is covered in the \l{Handling
Tree Models} section below.
The completionMode() determines the mode used to provide completions to
the user.
\section1 Iterating Through Completions
To retrieve a single candidate string, call setCompletionPrefix()
with the text that needs to be completed and call
currentCompletion(). You can iterate through the list of
completions as below:
\snippet doc/src/snippets/code/src_gui_util_qcompleter.cpp 2
completionCount() returns the total number of completions for the
current prefix. completionCount() should be avoided when possible,
since it requires a scan of the entire model.
\section1 The Completion Model
completionModel() return a list model that contains all possible
completions for the current completion prefix, in the order in which
they appear in the model. This model can be used to display the current
completions in a custom view. Calling setCompletionPrefix() automatically
refreshes the completion model.
\section1 Handling Tree Models
QCompleter can look for completions in tree models, assuming
that any item (or sub-item or sub-sub-item) can be unambiguously
represented as a string by specifying the path to the item. The
completion is then performed one level at a time.
Let's take the example of a user typing in a file system path.
The model is a (hierarchical) QFileSystemModel. The completion
occurs for every element in the path. For example, if the current
text is \c C:\Wind, QCompleter might suggest \c Windows to
complete the current path element. Similarly, if the current text
is \c C:\Windows\Sy, QCompleter might suggest \c System.
For this kind of completion to work, QCompleter needs to be able to
split the path into a list of strings that are matched at each level.
For \c C:\Windows\Sy, it needs to be split as "C:", "Windows" and "Sy".
The default implementation of splitPath(), splits the completionPrefix
using QDir::separator() if the model is a QFileSystemModel.
To provide completions, QCompleter needs to know the path from an index.
This is provided by pathFromIndex(). The default implementation of
pathFromIndex(), returns the data for the \l{Qt::EditRole}{edit role}
for list models and the absolute file path if the mode is a QFileSystemModel.
\sa QAbstractItemModel, QLineEdit, QComboBox, {Completer Example}
*/
#include "qcompleter_p.h"
#ifndef QT_NO_COMPLETER
#include "QtGui/qscrollbar.h"
#include "QtGui/qstringlistmodel.h"
#include "QtGui/qdirmodel.h"
#include "QtGui/qfilesystemmodel.h"
#include "QtGui/qheaderview.h"
#include "QtGui/qlistview.h"
#include "QtGui/qapplication.h"
#include "QtGui/qevent.h"
#include "QtGui/qheaderview.h"
#include "QtGui/qdesktopwidget.h"
#include "QtGui/qlineedit.h"
QT_BEGIN_NAMESPACE
QCompletionModel::QCompletionModel(QCompleterPrivate *c, QObject *parent)
: QAbstractProxyModel(*new QCompletionModelPrivate, parent),
c(c), showAll(false)
{
createEngine();
}
int QCompletionModel::columnCount(const QModelIndex &) const
{
Q_D(const QCompletionModel);
return d->model->columnCount();
}
void QCompletionModel::setSourceModel(QAbstractItemModel *source)
{
bool hadModel = (sourceModel() != 0);
if (hadModel)
QObject::disconnect(sourceModel(), 0, this, 0);
QAbstractProxyModel::setSourceModel(source);
if (source) {
// TODO: Optimize updates in the source model
connect(source, SIGNAL(modelReset()), this, SLOT(invalidate()));
connect(source, SIGNAL(destroyed()), this, SLOT(modelDestroyed()));
connect(source, SIGNAL(layoutChanged()), this, SLOT(invalidate()));
connect(source, SIGNAL(rowsInserted(QModelIndex,int,int)), this, SLOT(rowsInserted()));
connect(source, SIGNAL(rowsRemoved(QModelIndex,int,int)), this, SLOT(invalidate()));
connect(source, SIGNAL(columnsInserted(QModelIndex,int,int)), this, SLOT(invalidate()));
connect(source, SIGNAL(columnsRemoved(QModelIndex,int,int)), this, SLOT(invalidate()));
connect(source, SIGNAL(dataChanged(QModelIndex,QModelIndex)), this, SLOT(invalidate()));
}
invalidate();
}
void QCompletionModel::createEngine()
{
bool sortedEngine = false;
switch (c->sorting) {
case QCompleter::UnsortedModel:
sortedEngine = false;
break;
case QCompleter::CaseSensitivelySortedModel:
sortedEngine = c->cs == Qt::CaseSensitive;
break;
case QCompleter::CaseInsensitivelySortedModel:
sortedEngine = c->cs == Qt::CaseInsensitive;
break;
}
if (sortedEngine)
engine.reset(new QSortedModelEngine(c));
else
engine.reset(new QUnsortedModelEngine(c));
}
QModelIndex QCompletionModel::mapToSource(const QModelIndex& index) const
{
Q_D(const QCompletionModel);
if (!index.isValid())
return engine->curParent;
int row;
QModelIndex parent = engine->curParent;
if (!showAll) {
if (!engine->matchCount())
return QModelIndex();
Q_ASSERT(index.row() < engine->matchCount());
QIndexMapper& rootIndices = engine->historyMatch.indices;
if (index.row() < rootIndices.count()) {
row = rootIndices[index.row()];
parent = QModelIndex();
} else {
row = engine->curMatch.indices[index.row() - rootIndices.count()];
}
} else {
row = index.row();
}
return d->model->index(row, index.column(), parent);
}
QModelIndex QCompletionModel::mapFromSource(const QModelIndex& idx) const
{
if (!idx.isValid())
return QModelIndex();
int row = -1;
if (!showAll) {
if (!engine->matchCount())
return QModelIndex();
QIndexMapper& rootIndices = engine->historyMatch.indices;
if (idx.parent().isValid()) {
if (idx.parent() != engine->curParent)
return QModelIndex();
} else {
row = rootIndices.indexOf(idx.row());
if (row == -1 && engine->curParent.isValid())
return QModelIndex(); // source parent and our parent don't match
}
if (row == -1) {
QIndexMapper& indices = engine->curMatch.indices;
engine->filterOnDemand(idx.row() - indices.last());
row = indices.indexOf(idx.row()) + rootIndices.count();
}
if (row == -1)
return QModelIndex();
} else {
if (idx.parent() != engine->curParent)
return QModelIndex();
row = idx.row();
}
return createIndex(row, idx.column());
}
bool QCompletionModel::setCurrentRow(int row)
{
if (row < 0 || !engine->matchCount())
return false;
if (row >= engine->matchCount())
engine->filterOnDemand(row + 1 - engine->matchCount());
if (row >= engine->matchCount()) // invalid row
return false;
engine->curRow = row;
return true;
}
QModelIndex QCompletionModel::currentIndex(bool sourceIndex) const
{
if (!engine->matchCount())
return QModelIndex();
int row = engine->curRow;
if (showAll)
row = engine->curMatch.indices[engine->curRow];
QModelIndex idx = createIndex(row, c->column);
if (!sourceIndex)
return idx;
return mapToSource(idx);
}
QModelIndex QCompletionModel::index(int row, int column, const QModelIndex& parent) const
{
Q_D(const QCompletionModel);
if (row < 0 || column < 0 || column >= columnCount(parent) || parent.isValid())
return QModelIndex();
if (!showAll) {
if (!engine->matchCount())
return QModelIndex();
if (row >= engine->historyMatch.indices.count()) {
int want = row + 1 - engine->matchCount();
if (want > 0)
engine->filterOnDemand(want);
if (row >= engine->matchCount())
return QModelIndex();
}
} else {
if (row >= d->model->rowCount(engine->curParent))
return QModelIndex();
}
return createIndex(row, column);
}
int QCompletionModel::completionCount() const
{
if (!engine->matchCount())
return 0;
engine->filterOnDemand(INT_MAX);
return engine->matchCount();
}
int QCompletionModel::rowCount(const QModelIndex &parent) const
{
Q_D(const QCompletionModel);
if (parent.isValid())
return 0;
if (showAll) {
// Show all items below current parent, even if we have no valid matches
if (engine->curParts.count() != 1 && !engine->matchCount()
&& !engine->curParent.isValid())
return 0;
return d->model->rowCount(engine->curParent);
}
return completionCount();
}
void QCompletionModel::setFiltered(bool filtered)
{
if (showAll == !filtered)
return;
showAll = !filtered;
resetModel();
}
bool QCompletionModel::hasChildren(const QModelIndex &parent) const
{
Q_D(const QCompletionModel);
if (parent.isValid())
return false;
if (showAll)
return d->model->hasChildren(mapToSource(parent));
if (!engine->matchCount())
return false;
return true;
}
QVariant QCompletionModel::data(const QModelIndex& index, int role) const
{
Q_D(const QCompletionModel);
return d->model->data(mapToSource(index), role);
}
void QCompletionModel::modelDestroyed()
{
QAbstractProxyModel::setSourceModel(0); // switch to static empty model
invalidate();
}
void QCompletionModel::rowsInserted()
{
invalidate();
emit rowsAdded();
}
void QCompletionModel::invalidate()
{
engine->cache.clear();
filter(engine->curParts);
}
void QCompletionModel::filter(const QStringList& parts)
{
Q_D(QCompletionModel);
engine->filter(parts);
resetModel();
if (d->model->canFetchMore(engine->curParent))
d->model->fetchMore(engine->curParent);
}
void QCompletionModel::resetModel()
{
if (rowCount() == 0) {
reset();
return;
}
emit layoutAboutToBeChanged();
QModelIndexList piList = persistentIndexList();
QModelIndexList empty;
for (int i = 0; i < piList.size(); i++)
empty.append(QModelIndex());
changePersistentIndexList(piList, empty);
emit layoutChanged();
}
//////////////////////////////////////////////////////////////////////////////
void QCompletionEngine::filter(const QStringList& parts)
{
const QAbstractItemModel *model = c->proxy->sourceModel();
curParts = parts;
if (curParts.isEmpty())
curParts.append(QString());
curRow = -1;
curParent = QModelIndex();
curMatch = QMatchData();
historyMatch = filterHistory();
if (!model)
return;
QModelIndex parent;
for (int i = 0; i < curParts.count() - 1; i++) {
QString part = curParts[i];
int emi = filter(part, parent, -1).exactMatchIndex;
if (emi == -1)
return;
parent = model->index(emi, c->column, parent);
}
// Note that we set the curParent to a valid parent, even if we have no matches
// When filtering is disabled, we show all the items under this parent
curParent = parent;
if (curParts.last().isEmpty())
curMatch = QMatchData(QIndexMapper(0, model->rowCount(curParent) - 1), -1, false);
else
curMatch = filter(curParts.last(), curParent, 1); // build at least one
curRow = curMatch.isValid() ? 0 : -1;
}
QMatchData QCompletionEngine::filterHistory()
{
QAbstractItemModel *source = c->proxy->sourceModel();
if (curParts.count() <= 1 || c->proxy->showAll || !source)
return QMatchData();
bool isDirModel = false;
bool isFsModel = false;
#ifndef QT_NO_DIRMODEL
isDirModel = (qobject_cast<QDirModel *>(source) != 0);
#endif
#ifndef QT_NO_FILESYSTEMMODEL
isFsModel = (qobject_cast<QFileSystemModel *>(source) != 0);
#endif
QVector<int> v;
QIndexMapper im(v);
QMatchData m(im, -1, true);
for (int i = 0; i < source->rowCount(); i++) {
QString str = source->index(i, c->column).data().toString();
if (str.startsWith(c->prefix, c->cs)
#if (!defined(Q_OS_WIN) || defined(Q_OS_WINCE)) && !defined(Q_OS_SYMBIAN)
&& ((!isFsModel && !isDirModel) || QDir::toNativeSeparators(str) != QDir::separator())
#endif
)
m.indices.append(i);
}
return m;
}
// Returns a match hint from the cache by chopping the search string
bool QCompletionEngine::matchHint(QString part, const QModelIndex& parent, QMatchData *hint)
{
if (c->cs == Qt::CaseInsensitive)
part = part.toLower();
const CacheItem& map = cache[parent];
QString key = part;
while (!key.isEmpty()) {
key.chop(1);
if (map.contains(key)) {
*hint = map[key];
return true;
}
}
return false;
}
bool QCompletionEngine::lookupCache(QString part, const QModelIndex& parent, QMatchData *m)
{
if (c->cs == Qt::CaseInsensitive)
part = part.toLower();
const CacheItem& map = cache[parent];
if (!map.contains(part))
return false;
*m = map[part];
return true;
}
// When the cache size exceeds 1MB, it clears out about 1/2 of the cache.
void QCompletionEngine::saveInCache(QString part, const QModelIndex& parent, const QMatchData& m)
{
QMatchData old = cache[parent].take(part);
cost = cost + m.indices.cost() - old.indices.cost();
if (cost * sizeof(int) > 1024 * 1024) {
QMap<QModelIndex, CacheItem>::iterator it1 = cache.begin();
while (it1 != cache.end()) {
CacheItem& ci = it1.value();
int sz = ci.count()/2;
QMap<QString, QMatchData>::iterator it2 = ci.begin();
int i = 0;
while (it2 != ci.end() && i < sz) {
cost -= it2.value().indices.cost();
it2 = ci.erase(it2);
i++;
}
if (ci.count() == 0) {
it1 = cache.erase(it1);
} else {
++it1;
}
}
}
if (c->cs == Qt::CaseInsensitive)
part = part.toLower();
cache[parent][part] = m;
}
///////////////////////////////////////////////////////////////////////////////////
QIndexMapper QSortedModelEngine::indexHint(QString part, const QModelIndex& parent, Qt::SortOrder order)
{
const QAbstractItemModel *model = c->proxy->sourceModel();
if (c->cs == Qt::CaseInsensitive)
part = part.toLower();
const CacheItem& map = cache[parent];
// Try to find a lower and upper bound for the search from previous results
int to = model->rowCount(parent) - 1;
int from = 0;
const CacheItem::const_iterator it = map.lowerBound(part);
// look backward for first valid hint
for(CacheItem::const_iterator it1 = it; it1-- != map.constBegin();) {
const QMatchData& value = it1.value();
if (value.isValid()) {
if (order == Qt::AscendingOrder) {
from = value.indices.last() + 1;
} else {
to = value.indices.first() - 1;
}
break;
}
}
// look forward for first valid hint
for(CacheItem::const_iterator it2 = it; it2 != map.constEnd(); ++it2) {
const QMatchData& value = it2.value();
if (value.isValid() && !it2.key().startsWith(part)) {
if (order == Qt::AscendingOrder) {
to = value.indices.first() - 1;
} else {
from = value.indices.first() + 1;
}
break;
}
}
return QIndexMapper(from, to);
}
Qt::SortOrder QSortedModelEngine::sortOrder(const QModelIndex &parent) const
{
const QAbstractItemModel *model = c->proxy->sourceModel();
int rowCount = model->rowCount(parent);
if (rowCount < 2)
return Qt::AscendingOrder;
QString first = model->data(model->index(0, c->column, parent), c->role).toString();
QString last = model->data(model->index(rowCount - 1, c->column, parent), c->role).toString();
return QString::compare(first, last, c->cs) <= 0 ? Qt::AscendingOrder : Qt::DescendingOrder;
}
QMatchData QSortedModelEngine::filter(const QString& part, const QModelIndex& parent, int)
{
const QAbstractItemModel *model = c->proxy->sourceModel();
QMatchData hint;
if (lookupCache(part, parent, &hint))
return hint;
QIndexMapper indices;
Qt::SortOrder order = sortOrder(parent);
if (matchHint(part, parent, &hint)) {
if (!hint.isValid())
return QMatchData();
indices = hint.indices;
} else {
indices = indexHint(part, parent, order);
}
// binary search the model within 'indices' for 'part' under 'parent'
int high = indices.to() + 1;
int low = indices.from() - 1;
int probe;
QModelIndex probeIndex;
QString probeData;
while (high - low > 1)
{
probe = (high + low) / 2;
probeIndex = model->index(probe, c->column, parent);
probeData = model->data(probeIndex, c->role).toString();
const int cmp = QString::compare(probeData, part, c->cs);
if ((order == Qt::AscendingOrder && cmp >= 0)
|| (order == Qt::DescendingOrder && cmp < 0)) {
high = probe;
} else {
low = probe;
}
}
if ((order == Qt::AscendingOrder && low == indices.to())
|| (order == Qt::DescendingOrder && high == indices.from())) { // not found
saveInCache(part, parent, QMatchData());
return QMatchData();
}
probeIndex = model->index(order == Qt::AscendingOrder ? low+1 : high-1, c->column, parent);
probeData = model->data(probeIndex, c->role).toString();
if (!probeData.startsWith(part, c->cs)) {
saveInCache(part, parent, QMatchData());
return QMatchData();
}
const bool exactMatch = QString::compare(probeData, part, c->cs) == 0;
int emi = exactMatch ? (order == Qt::AscendingOrder ? low+1 : high-1) : -1;
int from = 0;
int to = 0;
if (order == Qt::AscendingOrder) {
from = low + 1;
high = indices.to() + 1;
low = from;
} else {
to = high - 1;
low = indices.from() - 1;
high = to;
}
while (high - low > 1)
{
probe = (high + low) / 2;
probeIndex = model->index(probe, c->column, parent);
probeData = model->data(probeIndex, c->role).toString();
const bool startsWith = probeData.startsWith(part, c->cs);
if ((order == Qt::AscendingOrder && startsWith)
|| (order == Qt::DescendingOrder && !startsWith)) {
low = probe;
} else {
high = probe;
}
}
QMatchData m(order == Qt::AscendingOrder ? QIndexMapper(from, high - 1) : QIndexMapper(low+1, to), emi, false);
saveInCache(part, parent, m);
return m;
}
////////////////////////////////////////////////////////////////////////////////////////
int QUnsortedModelEngine::buildIndices(const QString& str, const QModelIndex& parent, int n,
const QIndexMapper& indices, QMatchData* m)
{
Q_ASSERT(m->partial);
Q_ASSERT(n != -1 || m->exactMatchIndex == -1);
const QAbstractItemModel *model = c->proxy->sourceModel();
int i, count = 0;
for (i = 0; i < indices.count() && count != n; ++i) {
QModelIndex idx = model->index(indices[i], c->column, parent);
QString data = model->data(idx, c->role).toString();
if (!data.startsWith(str, c->cs) || !(model->flags(idx) & Qt::ItemIsSelectable))
continue;
m->indices.append(indices[i]);
++count;
if (m->exactMatchIndex == -1 && QString::compare(data, str, c->cs) == 0) {
m->exactMatchIndex = indices[i];
if (n == -1)
return indices[i];
}
}
return indices[i-1];
}
void QUnsortedModelEngine::filterOnDemand(int n)
{
Q_ASSERT(matchCount());
if (!curMatch.partial)
return;
Q_ASSERT(n >= -1);
const QAbstractItemModel *model = c->proxy->sourceModel();
int lastRow = model->rowCount(curParent) - 1;
QIndexMapper im(curMatch.indices.last() + 1, lastRow);
int lastIndex = buildIndices(curParts.last(), curParent, n, im, &curMatch);
curMatch.partial = (lastRow != lastIndex);
saveInCache(curParts.last(), curParent, curMatch);
}
QMatchData QUnsortedModelEngine::filter(const QString& part, const QModelIndex& parent, int n)
{
QMatchData hint;
QVector<int> v;
QIndexMapper im(v);
QMatchData m(im, -1, true);
const QAbstractItemModel *model = c->proxy->sourceModel();
bool foundInCache = lookupCache(part, parent, &m);
if (!foundInCache) {
if (matchHint(part, parent, &hint) && !hint.isValid())
return QMatchData();
}
if (!foundInCache && !hint.isValid()) {
const int lastRow = model->rowCount(parent) - 1;
QIndexMapper all(0, lastRow);
int lastIndex = buildIndices(part, parent, n, all, &m);
m.partial = (lastIndex != lastRow);
} else {
if (!foundInCache) { // build from hint as much as we can
buildIndices(part, parent, INT_MAX, hint.indices, &m);
m.partial = hint.partial;
}
if (m.partial && ((n == -1 && m.exactMatchIndex == -1) || (m.indices.count() < n))) {
// need more and have more
const int lastRow = model->rowCount(parent) - 1;
QIndexMapper rest(hint.indices.last() + 1, lastRow);
int want = n == -1 ? -1 : n - m.indices.count();
int lastIndex = buildIndices(part, parent, want, rest, &m);
m.partial = (lastRow != lastIndex);
}
}
saveInCache(part, parent, m);
return m;
}
///////////////////////////////////////////////////////////////////////////////
QCompleterPrivate::QCompleterPrivate()
: widget(0), proxy(0), popup(0), cs(Qt::CaseSensitive), role(Qt::EditRole), column(0),
maxVisibleItems(7), sorting(QCompleter::UnsortedModel), wrap(true), eatFocusOut(true),
hiddenBecauseNoMatch(false)
{
}
void QCompleterPrivate::init(QAbstractItemModel *m)
{
Q_Q(QCompleter);
proxy = new QCompletionModel(this, q);
QObject::connect(proxy, SIGNAL(rowsAdded()), q, SLOT(_q_autoResizePopup()));
q->setModel(m);
#ifdef QT_NO_LISTVIEW
q->setCompletionMode(QCompleter::InlineCompletion);
#else
q->setCompletionMode(QCompleter::PopupCompletion);
#endif // QT_NO_LISTVIEW
}
void QCompleterPrivate::setCurrentIndex(QModelIndex index, bool select)
{
Q_Q(QCompleter);
if (!q->popup())
return;
if (!select) {
popup->selectionModel()->setCurrentIndex(index, QItemSelectionModel::NoUpdate);
} else {
if (!index.isValid())
popup->selectionModel()->clear();
else
popup->selectionModel()->setCurrentIndex(index, QItemSelectionModel::Select
| QItemSelectionModel::Rows);
}
index = popup->selectionModel()->currentIndex();
if (!index.isValid())
popup->scrollToTop();
else
popup->scrollTo(index, QAbstractItemView::PositionAtTop);
}
void QCompleterPrivate::_q_completionSelected(const QItemSelection& selection)
{
QModelIndex index;
if (!selection.indexes().isEmpty())
index = selection.indexes().first();
_q_complete(index, true);
}
void QCompleterPrivate::_q_complete(QModelIndex index, bool highlighted)
{
Q_Q(QCompleter);
QString completion;
if (!index.isValid() || (!proxy->showAll && (index.row() >= proxy->engine->matchCount()))) {
completion = prefix;
} else {
if (!(index.flags() & Qt::ItemIsEnabled))
return;
QModelIndex si = proxy->mapToSource(index);
si = si.sibling(si.row(), column); // for clicked()
completion = q->pathFromIndex(si);
#ifndef QT_NO_DIRMODEL
// add a trailing separator in inline
if (mode == QCompleter::InlineCompletion) {
if (qobject_cast<QDirModel *>(proxy->sourceModel()) && QFileInfo(completion).isDir())
completion += QDir::separator();
}
#endif
#ifndef QT_NO_FILESYSTEMMODEL
// add a trailing separator in inline
if (mode == QCompleter::InlineCompletion) {
if (qobject_cast<QFileSystemModel *>(proxy->sourceModel()) && QFileInfo(completion).isDir())
completion += QDir::separator();
}
#endif
}
if (highlighted) {
emit q->highlighted(index);
emit q->highlighted(completion);
} else {
emit q->activated(index);
emit q->activated(completion);
}
}
void QCompleterPrivate::_q_autoResizePopup()
{
if (!popup || !popup->isVisible())
return;
showPopup(popupRect);
}
void QCompleterPrivate::showPopup(const QRect& rect)
{
const QRect screen = QApplication::desktop()->availableGeometry(widget);
Qt::LayoutDirection dir = widget->layoutDirection();
QPoint pos;
int rh, w;
int h = (popup->sizeHintForRow(0) * qMin(maxVisibleItems, popup->model()->rowCount()) + 3) + 3;
QScrollBar *hsb = popup->horizontalScrollBar();
if (hsb && hsb->isVisible())
h += popup->horizontalScrollBar()->sizeHint().height();
if (rect.isValid()) {
rh = rect.height();
w = rect.width();
pos = widget->mapToGlobal(dir == Qt::RightToLeft ? rect.bottomRight() : rect.bottomLeft());
} else {
rh = widget->height();
pos = widget->mapToGlobal(QPoint(0, widget->height() - 2));
w = widget->width();
}
if (w > screen.width())
w = screen.width();
if ((pos.x() + w) > (screen.x() + screen.width()))
pos.setX(screen.x() + screen.width() - w);
if (pos.x() < screen.x())
pos.setX(screen.x());
int top = pos.y() - rh - screen.top() + 2;
int bottom = screen.bottom() - pos.y();
h = qMax(h, popup->minimumHeight());
if (h > bottom) {
h = qMin(qMax(top, bottom), h);
if (top > bottom)
pos.setY(pos.y() - h - rh + 2);
}
popup->setGeometry(pos.x(), pos.y(), w, h);
if (!popup->isVisible())
popup->show();
}
void QCompleterPrivate::_q_fileSystemModelDirectoryLoaded(const QString &path)
{
Q_Q(QCompleter);
// Slot called when QFileSystemModel has finished loading.
// If we hide the popup because there was no match because the model was not loaded yet,
// we re-start the completion when we get the results
if (hiddenBecauseNoMatch
&& prefix.startsWith(path) && prefix != (path + QLatin1Char('/'))
&& widget) {
q->complete();
}
}
/*!
Constructs a completer object with the given \a parent.
*/
QCompleter::QCompleter(QObject *parent)
: QObject(*new QCompleterPrivate(), parent)
{
Q_D(QCompleter);
d->init();
}
/*!
Constructs a completer object with the given \a parent that provides completions
from the specified \a model.
*/
QCompleter::QCompleter(QAbstractItemModel *model, QObject *parent)
: QObject(*new QCompleterPrivate(), parent)
{
Q_D(QCompleter);
d->init(model);
}
#ifndef QT_NO_STRINGLISTMODEL
/*!
Constructs a QCompleter object with the given \a parent that uses the specified
\a list as a source of possible completions.
*/
QCompleter::QCompleter(const QStringList& list, QObject *parent)
: QObject(*new QCompleterPrivate(), parent)
{
Q_D(QCompleter);
d->init(new QStringListModel(list, this));
}
#endif // QT_NO_STRINGLISTMODEL
/*!
Destroys the completer object.
*/
QCompleter::~QCompleter()
{
}
/*!
Sets the widget for which completion are provided for to \a widget. This
function is automatically called when a QCompleter is set on a QLineEdit
using QLineEdit::setCompleter() or on a QComboBox using
QComboBox::setCompleter(). The widget needs to be set explicitly when
providing completions for custom widgets.
\sa widget(), setModel(), setPopup()
*/
void QCompleter::setWidget(QWidget *widget)
{
Q_D(QCompleter);
if (d->widget)
d->widget->removeEventFilter(this);
d->widget = widget;
if (d->widget)
d->widget->installEventFilter(this);
if (d->popup) {
d->popup->hide();
d->popup->setFocusProxy(d->widget);
}
}
/*!
Returns the widget for which the completer object is providing completions.
\sa setWidget()
*/
QWidget *QCompleter::widget() const
{
Q_D(const QCompleter);
return d->widget;
}
/*!
Sets the model which provides completions to \a model. The \a model can
be list model or a tree model. If a model has been already previously set
and it has the QCompleter as its parent, it is deleted.
For convenience, if \a model is a QFileSystemModel, QCompleter switches its
caseSensitivity to Qt::CaseInsensitive on Windows and Qt::CaseSensitive
on other platforms.
\sa completionModel(), modelSorting, {Handling Tree Models}
*/
void QCompleter::setModel(QAbstractItemModel *model)
{
Q_D(QCompleter);
QAbstractItemModel *oldModel = d->proxy->sourceModel();
d->proxy->setSourceModel(model);
if (d->popup)
setPopup(d->popup); // set the model and make new connections
if (oldModel && oldModel->QObject::parent() == this)
delete oldModel;
#ifndef QT_NO_DIRMODEL
if (qobject_cast<QDirModel *>(model)) {
#if (defined(Q_OS_WIN) && !defined(Q_OS_WINCE)) || defined(Q_OS_SYMBIAN)
setCaseSensitivity(Qt::CaseInsensitive);
#else
setCaseSensitivity(Qt::CaseSensitive);
#endif
}
#endif // QT_NO_DIRMODEL
#ifndef QT_NO_FILESYSTEMMODEL
QFileSystemModel *fsModel = qobject_cast<QFileSystemModel *>(model);
if (fsModel) {
#if (defined(Q_OS_WIN) && !defined(Q_OS_WINCE)) || defined(Q_OS_SYMBIAN)
setCaseSensitivity(Qt::CaseInsensitive);
#else
setCaseSensitivity(Qt::CaseSensitive);
#endif
setCompletionRole(QFileSystemModel::FileNameRole);
connect(fsModel, SIGNAL(directoryLoaded(QString)), this, SLOT(_q_fileSystemModelDirectoryLoaded(QString)));
}
#endif // QT_NO_FILESYSTEMMODEL
}
/*!
Returns the model that provides completion strings.
\sa completionModel()
*/
QAbstractItemModel *QCompleter::model() const
{
Q_D(const QCompleter);
return d->proxy->sourceModel();
}
/*!
\enum QCompleter::CompletionMode
This enum specifies how completions are provided to the user.
\value PopupCompletion Current completions are displayed in a popup window.
\value InlineCompletion Completions appear inline (as selected text).
\value UnfilteredPopupCompletion All possible completions are displayed in a popup window with the most likely suggestion indicated as current.
\sa setCompletionMode()
*/
/*!
\property QCompleter::completionMode
\brief how the completions are provided to the user
The default value is QCompleter::PopupCompletion.
*/
void QCompleter::setCompletionMode(QCompleter::CompletionMode mode)
{
Q_D(QCompleter);
d->mode = mode;
d->proxy->setFiltered(mode != QCompleter::UnfilteredPopupCompletion);
if (mode == QCompleter::InlineCompletion) {
if (d->widget)
d->widget->removeEventFilter(this);
if (d->popup) {
d->popup->deleteLater();
d->popup = 0;
}
} else {
if (d->widget)
d->widget->installEventFilter(this);
}
}
QCompleter::CompletionMode QCompleter::completionMode() const
{
Q_D(const QCompleter);
return d->mode;
}
/*!
Sets the popup used to display completions to \a popup. QCompleter takes
ownership of the view.
A QListView is automatically created when the completionMode() is set to
QCompleter::PopupCompletion or QCompleter::UnfilteredPopupCompletion. The
default popup displays the completionColumn().
Ensure that this function is called before the view settings are modified.
This is required since view's properties may require that a model has been
set on the view (for example, hiding columns in the view requires a model
to be set on the view).
\sa popup()
*/
void QCompleter::setPopup(QAbstractItemView *popup)
{
Q_D(QCompleter);
Q_ASSERT(popup != 0);
if (d->popup) {
QObject::disconnect(d->popup->selectionModel(), 0, this, 0);
QObject::disconnect(d->popup, 0, this, 0);
}
if (d->popup != popup)
delete d->popup;
if (popup->model() != d->proxy)
popup->setModel(d->proxy);
#if defined(Q_OS_MAC) && !defined(QT_MAC_USE_COCOA)
popup->show();
#else
popup->hide();
#endif
Qt::FocusPolicy origPolicy = Qt::NoFocus;
if (d->widget)
origPolicy = d->widget->focusPolicy();
popup->setParent(0, Qt::Popup);
popup->setFocusPolicy(Qt::NoFocus);
if (d->widget)
d->widget->setFocusPolicy(origPolicy);
popup->setFocusProxy(d->widget);
popup->installEventFilter(this);
popup->setItemDelegate(new QCompleterItemDelegate(popup));
#ifndef QT_NO_LISTVIEW
if (QListView *listView = qobject_cast<QListView *>(popup)) {
listView->setModelColumn(d->column);
}
#endif
QObject::connect(popup, SIGNAL(clicked(QModelIndex)),
this, SLOT(_q_complete(QModelIndex)));
QObject::connect(this, SIGNAL(activated(QModelIndex)),
popup, SLOT(hide()));
QObject::connect(popup->selectionModel(), SIGNAL(selectionChanged(QItemSelection,QItemSelection)),
this, SLOT(_q_completionSelected(QItemSelection)));
d->popup = popup;
}
/*!
Returns the popup used to display completions.
\sa setPopup()
*/
QAbstractItemView *QCompleter::popup() const
{
Q_D(const QCompleter);
#ifndef QT_NO_LISTVIEW
if (!d->popup && completionMode() != QCompleter::InlineCompletion) {
QListView *listView = new QListView;
listView->setEditTriggers(QAbstractItemView::NoEditTriggers);
listView->setHorizontalScrollBarPolicy(Qt::ScrollBarAlwaysOff);
listView->setSelectionBehavior(QAbstractItemView::SelectRows);
listView->setSelectionMode(QAbstractItemView::SingleSelection);
listView->setModelColumn(d->column);
QCompleter *that = const_cast<QCompleter*>(this);
that->setPopup(listView);
}
#endif // QT_NO_LISTVIEW
return d->popup;
}
/*!
\reimp
*/
bool QCompleter::event(QEvent *ev)
{
return QObject::event(ev);
}
/*!
\reimp
*/
bool QCompleter::eventFilter(QObject *o, QEvent *e)
{
Q_D(QCompleter);
if (d->eatFocusOut && o == d->widget && e->type() == QEvent::FocusOut) {
d->hiddenBecauseNoMatch = false;
if (d->popup && d->popup->isVisible())
return true;
}
if (o != d->popup)
return QObject::eventFilter(o, e);
switch (e->type()) {
case QEvent::KeyPress: {
QKeyEvent *ke = static_cast<QKeyEvent *>(e);
QModelIndex curIndex = d->popup->currentIndex();
QModelIndexList selList = d->popup->selectionModel()->selectedIndexes();
const int key = ke->key();
// In UnFilteredPopup mode, select the current item
if ((key == Qt::Key_Up || key == Qt::Key_Down) && selList.isEmpty() && curIndex.isValid()
&& d->mode == QCompleter::UnfilteredPopupCompletion) {
d->setCurrentIndex(curIndex);
return true;
}
// Handle popup navigation keys. These are hardcoded because up/down might make the
// widget do something else (lineedit cursor moves to home/end on mac, for instance)
switch (key) {
case Qt::Key_End:
case Qt::Key_Home:
if (ke->modifiers() & Qt::ControlModifier)
return false;
break;
case Qt::Key_Up:
if (!curIndex.isValid()) {
int rowCount = d->proxy->rowCount();
QModelIndex lastIndex = d->proxy->index(rowCount - 1, d->column);
d->setCurrentIndex(lastIndex);
return true;
} else if (curIndex.row() == 0) {
if (d->wrap)
d->setCurrentIndex(QModelIndex());
return true;
}
return false;
case Qt::Key_Down:
if (!curIndex.isValid()) {
QModelIndex firstIndex = d->proxy->index(0, d->column);
d->setCurrentIndex(firstIndex);
return true;
} else if (curIndex.row() == d->proxy->rowCount() - 1) {
if (d->wrap)
d->setCurrentIndex(QModelIndex());
return true;
}
return false;
case Qt::Key_PageUp:
case Qt::Key_PageDown:
return false;
}
// Send the event to the widget. If the widget accepted the event, do nothing
// If the widget did not accept the event, provide a default implementation
d->eatFocusOut = false;
(static_cast<QObject *>(d->widget))->event(ke);
d->eatFocusOut = true;
if (!d->widget || e->isAccepted() || !d->popup->isVisible()) {
// widget lost focus, hide the popup
if (d->widget && (!d->widget->hasFocus()
#ifdef QT_KEYPAD_NAVIGATION
|| (QApplication::keypadNavigationEnabled() && !d->widget->hasEditFocus())
#endif
))
d->popup->hide();
if (e->isAccepted())
return true;
}
// default implementation for keys not handled by the widget when popup is open
switch (key) {
#ifdef QT_KEYPAD_NAVIGATION
case Qt::Key_Select:
if (!QApplication::keypadNavigationEnabled())
break;
#endif
case Qt::Key_Return:
case Qt::Key_Enter:
case Qt::Key_Tab:
d->popup->hide();
if (curIndex.isValid())
d->_q_complete(curIndex);
break;
case Qt::Key_F4:
if (ke->modifiers() & Qt::AltModifier)
d->popup->hide();
break;
case Qt::Key_Backtab:
case Qt::Key_Escape:
d->popup->hide();
break;
default:
break;
}
return true;
}
#ifdef QT_KEYPAD_NAVIGATION
case QEvent::KeyRelease: {
QKeyEvent *ke = static_cast<QKeyEvent *>(e);
if (QApplication::keypadNavigationEnabled() && ke->key() == Qt::Key_Back) {
// Send the event to the 'widget'. This is what we did for KeyPress, so we need
// to do the same for KeyRelease, in case the widget's KeyPress event set
// up something (such as a timer) that is relying on also receiving the
// key release. I see this as a bug in Qt, and should really set it up for all
// the affected keys. However, it is difficult to tell how this will affect
// existing code, and I can't test for every combination!
d->eatFocusOut = false;
static_cast<QObject *>(d->widget)->event(ke);
d->eatFocusOut = true;
}
break;
}
#endif
case QEvent::MouseButtonPress: {
#ifdef QT_KEYPAD_NAVIGATION
if (QApplication::keypadNavigationEnabled()) {
// if we've clicked in the widget (or its descendant), let it handle the click
QWidget *source = qobject_cast<QWidget *>(o);
if (source) {
QPoint pos = source->mapToGlobal((static_cast<QMouseEvent *>(e))->pos());
QWidget *target = QApplication::widgetAt(pos);
if (target && (d->widget->isAncestorOf(target) ||
target == d->widget)) {
d->eatFocusOut = false;
static_cast<QObject *>(target)->event(e);
d->eatFocusOut = true;
return true;
}
}
}
#endif
if (!d->popup->underMouse()) {
d->popup->hide();
return true;
}
}
return false;
case QEvent::InputMethod:
case QEvent::ShortcutOverride:
QApplication::sendEvent(d->widget, e);
break;
default:
return false;
}
return false;
}
/*!
For QCompleter::PopupCompletion and QCompletion::UnfilteredPopupCompletion
modes, calling this function displays the popup displaying the current
completions. By default, if \a rect is not specified, the popup is displayed
on the bottom of the widget(). If \a rect is specified the popup is
displayed on the left edge of the rectangle.
For QCompleter::InlineCompletion mode, the highlighted() signal is fired
with the current completion.
*/
void QCompleter::complete(const QRect& rect)
{
Q_D(QCompleter);
QModelIndex idx = d->proxy->currentIndex(false);
d->hiddenBecauseNoMatch = false;
if (d->mode == QCompleter::InlineCompletion) {
if (idx.isValid())
d->_q_complete(idx, true);
return;
}
Q_ASSERT(d->widget != 0);
if ((d->mode == QCompleter::PopupCompletion && !idx.isValid())
|| (d->mode == QCompleter::UnfilteredPopupCompletion && d->proxy->rowCount() == 0)) {
if (d->popup)
d->popup->hide(); // no suggestion, hide
d->hiddenBecauseNoMatch = true;
return;
}
popup();
if (d->mode == QCompleter::UnfilteredPopupCompletion)
d->setCurrentIndex(idx, false);
d->showPopup(rect);
d->popupRect = rect;
}
/*!
Sets the current row to the \a row specified. Returns true if successful;
otherwise returns false.
This function may be used along with currentCompletion() to iterate
through all the possible completions.
\sa currentCompletion(), completionCount()
*/
bool QCompleter::setCurrentRow(int row)
{
Q_D(QCompleter);
return d->proxy->setCurrentRow(row);
}
/*!
Returns the current row.
\sa setCurrentRow()
*/
int QCompleter::currentRow() const
{
Q_D(const QCompleter);
return d->proxy->currentRow();
}
/*!
Returns the number of completions for the current prefix. For an unsorted
model with a large number of items this can be expensive. Use setCurrentRow()
and currentCompletion() to iterate through all the completions.
*/
int QCompleter::completionCount() const
{
Q_D(const QCompleter);
return d->proxy->completionCount();
}
/*!
\enum QCompleter::ModelSorting
This enum specifies how the items in the model are sorted.
\value UnsortedModel The model is unsorted.
\value CaseSensitivelySortedModel The model is sorted case sensitively.
\value CaseInsensitivelySortedModel The model is sorted case insensitively.
\sa setModelSorting()
*/
/*!
\property QCompleter::modelSorting
\brief the way the model is sorted
By default, no assumptions are made about the order of the items
in the model that provides the completions.
If the model's data for the completionColumn() and completionRole() is sorted in
ascending order, you can set this property to \l CaseSensitivelySortedModel
or \l CaseInsensitivelySortedModel. On large models, this can lead to
significant performance improvements because the completer object can
then use a binary search algorithm instead of linear search algorithm.
The sort order (i.e ascending or descending order) of the model is determined
dynamically by inspecting the contents of the model.
\bold{Note:} The performance improvements described above cannot take place
when the completer's \l caseSensitivity is different to the case sensitivity
used by the model's when sorting.
\sa setCaseSensitivity(), QCompleter::ModelSorting
*/
void QCompleter::setModelSorting(QCompleter::ModelSorting sorting)
{
Q_D(QCompleter);
if (d->sorting == sorting)
return;
d->sorting = sorting;
d->proxy->createEngine();
d->proxy->invalidate();
}
QCompleter::ModelSorting QCompleter::modelSorting() const
{
Q_D(const QCompleter);
return d->sorting;
}
/*!
\property QCompleter::completionColumn
\brief the column in the model in which completions are searched for.
If the popup() is a QListView, it is automatically setup to display
this column.
By default, the match column is 0.
\sa completionRole, caseSensitivity
*/
void QCompleter::setCompletionColumn(int column)
{
Q_D(QCompleter);
if (d->column == column)
return;
#ifndef QT_NO_LISTVIEW
if (QListView *listView = qobject_cast<QListView *>(d->popup))
listView->setModelColumn(column);
#endif
d->column = column;
d->proxy->invalidate();
}
int QCompleter::completionColumn() const
{
Q_D(const QCompleter);
return d->column;
}
/*!
\property QCompleter::completionRole
\brief the item role to be used to query the contents of items for matching.
The default role is Qt::EditRole.
\sa completionColumn, caseSensitivity
*/
void QCompleter::setCompletionRole(int role)
{
Q_D(QCompleter);
if (d->role == role)
return;
d->role = role;
d->proxy->invalidate();
}
int QCompleter::completionRole() const
{
Q_D(const QCompleter);
return d->role;
}
/*!
\property QCompleter::wrapAround
\brief the completions wrap around when navigating through items
\since 4.3
The default is true.
*/
void QCompleter::setWrapAround(bool wrap)
{
Q_D(QCompleter);
if (d->wrap == wrap)
return;
d->wrap = wrap;
}
bool QCompleter::wrapAround() const
{
Q_D(const QCompleter);
return d->wrap;
}
/*!
\property QCompleter::maxVisibleItems
\brief the maximum allowed size on screen of the completer, measured in items
\since 4.6
By default, this property has a value of 7.
*/
int QCompleter::maxVisibleItems() const
{
Q_D(const QCompleter);
return d->maxVisibleItems;
}
void QCompleter::setMaxVisibleItems(int maxItems)
{
Q_D(QCompleter);
if (maxItems < 0) {
qWarning("QCompleter::setMaxVisibleItems: "
"Invalid max visible items (%d) must be >= 0", maxItems);
return;
}
d->maxVisibleItems = maxItems;
}
/*!
\property QCompleter::caseSensitivity
\brief the case sensitivity of the matching
The default is Qt::CaseSensitive.
\sa completionColumn, completionRole, modelSorting
*/
void QCompleter::setCaseSensitivity(Qt::CaseSensitivity cs)
{
Q_D(QCompleter);
if (d->cs == cs)
return;
d->cs = cs;
d->proxy->createEngine();
d->proxy->invalidate();
}
Qt::CaseSensitivity QCompleter::caseSensitivity() const
{
Q_D(const QCompleter);
return d->cs;
}
/*!
\property QCompleter::completionPrefix
\brief the completion prefix used to provide completions.
The completionModel() is updated to reflect the list of possible
matches for \a prefix.
*/
void QCompleter::setCompletionPrefix(const QString &prefix)
{
Q_D(QCompleter);
d->prefix = prefix;
d->proxy->filter(splitPath(prefix));
}
QString QCompleter::completionPrefix() const
{
Q_D(const QCompleter);
return d->prefix;
}
/*!
Returns the model index of the current completion in the completionModel().
\sa setCurrentRow(), currentCompletion(), model()
*/
QModelIndex QCompleter::currentIndex() const
{
Q_D(const QCompleter);
return d->proxy->currentIndex(false);
}
/*!
Returns the current completion string. This includes the \l completionPrefix.
When used alongside setCurrentRow(), it can be used to iterate through
all the matches.
\sa setCurrentRow(), currentIndex()
*/
QString QCompleter::currentCompletion() const
{
Q_D(const QCompleter);
return pathFromIndex(d->proxy->currentIndex(true));
}
/*!
Returns the completion model. The completion model is a read-only list model
that contains all the possible matches for the current completion prefix.
The completion model is auto-updated to reflect the current completions.
\note The return value of this function is defined to be an QAbstractItemModel
purely for generality. This actual kind of model returned is an instance of an
QAbstractProxyModel subclass.
\sa completionPrefix, model()
*/
QAbstractItemModel *QCompleter::completionModel() const
{
Q_D(const QCompleter);
return d->proxy;
}
/*!
Returns the path for the given \a index. The completer object uses this to
obtain the completion text from the underlying model.
The default implementation returns the \l{Qt::EditRole}{edit role} of the
item for list models. It returns the absolute file path if the model is a
QFileSystemModel.
\sa splitPath()
*/
QString QCompleter::pathFromIndex(const QModelIndex& index) const
{
Q_D(const QCompleter);
if (!index.isValid())
return QString();
QAbstractItemModel *sourceModel = d->proxy->sourceModel();
if (!sourceModel)
return QString();
bool isDirModel = false;
bool isFsModel = false;
#ifndef QT_NO_DIRMODEL
isDirModel = qobject_cast<QDirModel *>(d->proxy->sourceModel()) != 0;
#endif
#ifndef QT_NO_FILESYSTEMMODEL
isFsModel = qobject_cast<QFileSystemModel *>(d->proxy->sourceModel()) != 0;
#endif
if (!isDirModel && !isFsModel)
return sourceModel->data(index, d->role).toString();
QModelIndex idx = index;
QStringList list;
do {
QString t;
if (isDirModel)
t = sourceModel->data(idx, Qt::EditRole).toString();
#ifndef QT_NO_FILESYSTEMMODEL
else
t = sourceModel->data(idx, QFileSystemModel::FileNameRole).toString();
#endif
list.prepend(t);
QModelIndex parent = idx.parent();
idx = parent.sibling(parent.row(), index.column());
} while (idx.isValid());
#if (!defined(Q_OS_WIN) || defined(Q_OS_WINCE)) && !defined(Q_OS_SYMBIAN)
if (list.count() == 1) // only the separator or some other text
return list[0];
list[0].clear() ; // the join below will provide the separator
#endif
return list.join(QDir::separator());
}
/*!
Splits the given \a path into strings that are used to match at each level
in the model().
The default implementation of splitPath() splits a file system path based on
QDir::separator() when the sourceModel() is a QFileSystemModel.
When used with list models, the first item in the returned list is used for
matching.
\sa pathFromIndex(), {Handling Tree Models}
*/
QStringList QCompleter::splitPath(const QString& path) const
{
bool isDirModel = false;
bool isFsModel = false;
#ifndef QT_NO_DIRMODEL
Q_D(const QCompleter);
isDirModel = qobject_cast<QDirModel *>(d->proxy->sourceModel()) != 0;
#endif
#ifndef QT_NO_FILESYSTEMMODEL
#ifdef QT_NO_DIRMODEL
Q_D(const QCompleter);
#endif
isFsModel = qobject_cast<QFileSystemModel *>(d->proxy->sourceModel()) != 0;
#endif
if ((!isDirModel && !isFsModel) || path.isEmpty())
return QStringList(completionPrefix());
QString pathCopy = QDir::toNativeSeparators(path);
QString sep = QDir::separator();
#if defined(Q_OS_SYMBIAN)
if (pathCopy == QLatin1String("\\"))
return QStringList(pathCopy);
#elif defined(Q_OS_WIN) && !defined(Q_OS_WINCE)
if (pathCopy == QLatin1String("\\") || pathCopy == QLatin1String("\\\\"))
return QStringList(pathCopy);
QString doubleSlash(QLatin1String("\\\\"));
if (pathCopy.startsWith(doubleSlash))
pathCopy = pathCopy.mid(2);
else
doubleSlash.clear();
#endif
QRegExp re(QLatin1Char('[') + QRegExp::escape(sep) + QLatin1Char(']'));
QStringList parts = pathCopy.split(re);
#if defined(Q_OS_SYMBIAN)
// Do nothing
#elif defined(Q_OS_WIN) && !defined(Q_OS_WINCE)
if (!doubleSlash.isEmpty())
parts[0].prepend(doubleSlash);
#else
if (pathCopy[0] == sep[0]) // readd the "/" at the beginning as the split removed it
parts[0] = QDir::fromNativeSeparators(QString(sep[0]));
#endif
return parts;
}
/*!
\fn void QCompleter::activated(const QModelIndex& index)
This signal is sent when an item in the popup() is activated by the user.
(by clicking or pressing return). The item's \a index in the completionModel()
is given.
*/
/*!
\fn void QCompleter::activated(const QString &text)
This signal is sent when an item in the popup() is activated by the user (by
clicking or pressing return). The item's \a text is given.
*/
/*!
\fn void QCompleter::highlighted(const QModelIndex& index)
This signal is sent when an item in the popup() is highlighted by
the user. It is also sent if complete() is called with the completionMode()
set to QCompleter::InlineCompletion. The item's \a index in the completionModel()
is given.
*/
/*!
\fn void QCompleter::highlighted(const QString &text)
This signal is sent when an item in the popup() is highlighted by
the user. It is also sent if complete() is called with the completionMode()
set to QCompleter::InlineCompletion. The item's \a text is given.
*/
QT_END_NAMESPACE
#include "moc_qcompleter.cpp"
#endif // QT_NO_COMPLETER
|