The <QtAlgorithms> header includes the generic, template-based algorithms. 更多...
| 头： | #include <QtAlgorithms> |
| uint | qCountLeadingZeroBits (quint32 v ) |
| uint | qCountLeadingZeroBits (quint8 v ) |
| uint | qCountLeadingZeroBits (quint16 v ) |
| uint | qCountLeadingZeroBits (quint64 v ) |
| uint | qCountTrailingZeroBits (quint8 v ) |
| uint | qCountTrailingZeroBits (quint32 v ) |
| uint | qCountTrailingZeroBits (quint16 v ) |
| uint | qCountTrailingZeroBits (quint64 v ) |
| void | qDeleteAll (ForwardIterator begin , ForwardIterator end ) |
| void | qDeleteAll (const Container & c ) |
| uint | qPopulationCount (quint8 v ) |
| uint | qPopulationCount (quint32 v ) |
| uint | qPopulationCount (quint16 v ) |
| uint | qPopulationCount (quint64 v ) |
| void | qSwap (T & var1 , T & var2 ) |
Qt provides a number of global template functions in
<QtAlgorithms>
that work on containers and perform small tasks to make life easier, such as
qDeleteAll
(), which invokes
operator delete
on all items in a given container or in a given range. You can use these algorithms with any
container class
that provides STL-style iterators, including Qt's
QList
, QLinkedList,
QVector
,
QMap
，和
QHash
类。
Most algorithms take STL 样式迭代器 as parameters. The algorithms are generic in the sense that they aren't bound to a specific iterator class; you can use them with any iterators that meet a certain set of requirements.
Different algorithms can have different requirements for the iterators they accept. For example, qFill() accepts two forward iterators . The iterator types required are specified for each algorithm. If an iterator of the wrong type is passed (for example, if QList::ConstIterator is passed as an output iterator ), you will always get a compiler error, although not necessarily a very informative one.
Some algorithms have special requirements on the value type stored in the containers. For example, qDeleteAll () requires that the value type is a non-const pointer type (for example, QWidget *). The value type requirements are specified for each algorithm, and the compiler will produce an error if a requirement isn't met.
The generic algorithms can be used on other container classes than those provided by Qt and STL. The syntax of STL-style iterators is modeled after C++ pointers, so it's possible to use plain arrays as containers and plain pointers as iterators. A common idiom is to use qBinaryFind() together with two static arrays: one that contains a list of keys, and another that contains a list of associated values. For example, the following code will look up an HTML entity (e.g.,
&
;) in the
name_table
array and return the corresponding Unicode value from the
value_table
if the entity is recognized:
QChar resolveEntity(const QString &entity) { static const QLatin1String name_table[] = { "AElig", "Aacute", ..., "zwnj" }; static const ushort value_table[] = { 0x0061, 0x00c1, ..., 0x200c }; int N = sizeof(name_table) / sizeof(name_table[0]); const QLatin1String *name = qBinaryFind(name_table, name_table + N, entity); int index = name - name_table; if (index == N) return QChar(); return QChar(value_table[index]); }
This kind of code is for advanced users only; for most applications, a QMap - or QHash -based approach would work just as well:
QChar resolveEntity(const QString &entity) { static QMap<QString, int> entityMap; if (!entityMap) { entityMap.insert("AElig", 0x0061); entityMap.insert("Aacute", 0x00c1); ... entityMap.insert("zwnj", 0x200c); } return QChar(entityMap.value(entity)); }
The algorithms have certain requirements on the iterator types they accept, and these are specified individually for each function. The compiler will produce an error if a requirement isn't met.
An
input iterator
is an iterator that can be used for reading data sequentially from a container. It must provide the following operators:
==
and
!=
for comparing two iterators, unary
*
for retrieving the value stored in the item, and prefix
++
for advancing to the next item.
The Qt containers' iterator types (const and non-const) are all input iterators.
An output iterator is an iterator that can be used for writing data sequentially to a container or to some output stream. It must provide the following operators: unary
*
for writing a value (i.e.,
*it = val
) and prefix
++
for advancing to the next item.
The Qt containers' non-const iterator types are all output iterators.
A forward iterator is an iterator that meets the requirements of both input iterators and output iterators.
The Qt containers' non-const iterator types are all forward iterators.
A
bidirectional iterator
is an iterator that meets the requirements of forward iterators but that in addition supports prefix
--
for iterating backward.
The Qt containers' non-const iterator types are all bidirectional iterators.
The last category, random access iterators , is the most powerful type of iterator. It supports all the requirements of a bidirectional iterator, and supports the following operations:
i += n
|
advances iterator
i
by
n
positions
|
i -= n
|
moves iterator
i
back by
n
positions
|
i + n
or
n + i
|
returns the iterator for the item
n
positions ahead of iterator
i
|
i - n
|
returns the iterator for the item
n
positions behind of iterator
i
|
i - j
|
returns the number of items between iterators
i
and
j
|
i[n]
|
如同
*(i + n)
|
i < j
|
返回
true
if iterator
j
comes after iterator
i
|
QList and QVector 's non-const iterator types are random access iterators.
Historically, Qt used to provide functions which were direct equivalents of many STL algorithmic functions. Starting with Qt 5.0, you are instead encouraged to use directly the implementations available in the STL; most of the Qt ones have been deprecated (although they are still available to keep the old code compiling).
Most of the time, an application using the deprecated Qt algorithmic functions can be easily ported to use the equivalent STL functions. You need to:
#include <algorithm>
preprocessor directive;
| Qt function | STL function |
|---|---|
| qBinaryFind |
std::binary_search
or
std::lower_bound
|
| qCopy |
std::copy
|
| qCopyBackward |
std::copy_backward
|
| qEqual |
std::equal
|
| qFill |
std::fill
|
| qFind |
std::find
|
| qCount |
std::count
|
| qSort |
std::sort
|
| qStableSort |
std::stable_sort
|
| qLowerBound |
std::lower_bound
|
| qUpperBound |
std::upper_bound
|
| qLess |
std::less
|
| qGreater |
std::greater
|
The only cases in which the port may not be straightforward is if the old code relied on template specializations of the qLess() and/or the qSwap () functions, which were used internally by the implementations of the Qt algorithmic functions, but are instead ignored by the STL ones.
In case the old code relied on the specialization of the qLess() functor, then a workaround is explicitly passing an instance of the qLess() class to the STL function, for instance like this:
std::sort(container.begin(), container.end(), qLess<T>());
Instead, since it's not possible to pass a custom swapper functor to STL functions, the only workaround for a template specialization for
qSwap
() is providing the same specialization for
std::swap()
.
另请参阅 容器类 and <QtGlobal> .
Returns the number of consecutive zero bits in v , when searching from the MSB. For example, qCountLeadingZeroBits(quint32(1)) returns 31 and qCountLeadingZeroBits(quint32(8)) returns 28.
该函数在 Qt 5.6 引入。
Returns the number of consecutive zero bits in v , when searching from the MSB. For example, qCountLeadingZeroBits(quint8(1)) returns 7 and qCountLeadingZeroBits(quint8(8)) returns 4.
该函数在 Qt 5.6 引入。
Returns the number of consecutive zero bits in v , when searching from the MSB. For example, qCountLeadingZeroBits(quint16(1)) returns 15 and qCountLeadingZeroBits(quint16(8)) returns 12.
该函数在 Qt 5.6 引入。
Returns the number of consecutive zero bits in v , when searching from the MSB. For example, qCountLeadingZeroBits(quint64(1)) returns 63 and qCountLeadingZeroBits(quint64(8)) returns 60.
该函数在 Qt 5.6 引入。
Returns the number of consecutive zero bits in v , when searching from the LSB. For example, qCountTrailingZeroBits(1) returns 0 and qCountTrailingZeroBits(8) returns 3.
该函数在 Qt 5.6 引入。
这是重载函数。
该函数在 Qt 5.6 引入。
这是重载函数。
该函数在 Qt 5.6 引入。
这是重载函数。
该函数在 Qt 5.6 引入。
Deletes all the items in the range [
begin
,
end
) using the C++
delete
operator. The item type must be a pointer type (for example,
QWidget *
).
范例：
QList<Employee *> list; list.append(new Employee("Blackpool", "Stephen")); list.append(new Employee("Twist", "Oliver")); qDeleteAll(list.begin(), list.end()); list.clear();
Notice that qDeleteAll() doesn't remove the items from the container; it merely calls
delete
on them. In the example above, we call clear() on the container to remove the items.
This function can also be used to delete items stored in associative containers, such as QMap and QHash . Only the objects stored in each container will be deleted by this function; objects used as keys will not be deleted.
另请参阅 forward iterators .
这是重载函数。
This is the same as qDeleteAll( c .begin(), c .end()).
Returns the number of bits set in v . This number is also called the Hamming Weight of v .
该函数在 Qt 5.2 引入。
这是重载函数。
该函数在 Qt 5.2 引入。
这是重载函数。
该函数在 Qt 5.2 引入。
这是重载函数。
该函数在 Qt 5.2 引入。
Exchanges the values of variables
lhs
and
rhs
, taking type-specific
swap()
overloads into account.
This function is Qt's version of
boost::swap()
, and is equivalent to
using std::swap; // bring std::swap into scope (for built-in types) swap(lhs, rhs); // unqualified call (picks up type-specific overloads // via Argument-Dependent Lookup, or falls back to std::swap)
Use this function primarily in generic code, where you would traditionally have written the above two lines, because you don't know anything about
T
.
If you already know what
T
is, then use one of the following options, in order of preference:
lhs.swap(rhs);
if such a member-swap exists
std::swap(lhs, rhs);
if no type-specific
swap()
exists
见
boost::swap()
on boost.org
了解更多细节。
另请参阅
std::swap
on cppreference.com
,
Swappable
on cppreference.com
.