The QCollatorSortKey class can be used to speed up string collation. More...
Header: | #include <QCollatorSortKey> |
CMake: | find_package(Qt6 COMPONENTS Core REQUIRED) target_link_libraries(mytarget PRIVATE Qt6::Core) |
qmake: | QT += core |
Since: | Qt 5.2 |
Note: All functions in this class are reentrant.
QCollatorSortKey(const QCollatorSortKey &other) | |
QCollatorSortKey & | operator=(QCollatorSortKey &&other) |
QCollatorSortKey & | operator=(const QCollatorSortKey &other) |
~QCollatorSortKey() | |
int | compare(const QCollatorSortKey &otherKey) const |
void | swap(QCollatorSortKey &other) |
bool | operator<(const QCollatorSortKey &lhs, const QCollatorSortKey &rhs) |
The QCollatorSortKey class is always created by QCollator::sortKey() and is used for fast strings collation, for example when collating many strings.
See also QCollator, QCollator::sortKey(), and compare().
Constructs a copy of the other collator key.
Move-assigns other to this collator key.
Assigns other to this collator key.
Destroys the collator key.
Compares this key to otherKey, which must have been created by the same QCollator's sortKey() as this key. The comparison is performed in accordance with that QCollator's sort order.
Returns a negative value if this key sorts before otherKey, 0 if the two keys are equal or a positive value if this key sorts after otherKey.
See also operator<().
Swaps this collator key with other.
Both keys must have been created by the same QCollator's sortKey(). Returns true
if lhs should be sorted before rhs, according to the QCollator that created them; otherwise returns false
.
See also QCollatorSortKey::compare().
© The Qt Company Ltd
Licensed under the GNU Free Documentation License, Version 1.3.
https://doc.qt.io/qt-6.2/qcollatorsortkey.html