选用QList还是选用QVector？

[中才德创]

QList<ST_DEVICE_INFO> lst;
QVector<ST_DEVICE_INFO> vec;

结构体里，“整形、枚举、字符串”。
想用个表来存放，它们究竟有些什么异同点？

struct ST_DEVICE_INFO
{
    int iPort;
    enum enProtocol;
    char *Name[MAX_DEVICE_NAME_LEN];
}

[DIE654456]

The QList class is a template class that provides lists。
The QVector class is a template class that provides a dynamic array。
在Qt里这两个类使用方式差不多。

[核动力蜗牛Killua]

两个类使用起来差不多，但是本质一个是链表一个是数值，处理上当然还是不一样的

[lefttime]

QList比较常用些， 再者根据官方解释， 对于按索引来查询数据相对QVector会快```具体没测试...@@

[Rex237]

For most purposes, QList is the right class to use. Operations like prepend() and insert() are usually faster than with QVector because of the way QList stores its items in memory (see Algorithmic Complexity for details), and its index-based API is more convenient than QLinkedList's iterator-based API. It also expands to less code in your executable.

If you want the items to occupy adjacent memory positions, or if your items are larger than a pointer and you want to avoid the overhead of allocating them on the heap individually at insertion time, then use QVector.
If you want a low-level variable-size array, QVarLengthArray may be sufficient.

[aoxuehan0424]

首先，一个是随机存取，一个是连续存取，所以list插入删除很快，vector查询很快。
但是vector有个地方一定要注意：
vector：如果你添加元素，但是vector的容量（是容量，不是大小，容量比大小大，会预先多分配空间）不够的话，系统就会重新分配一段内存，然后把原先的内容全部拷贝过去，然后删除原先的内容。所以，如果你设定了一个纸箱vector的指针，或者说迭代器，在你添加元素之后，这个指针（迭代器）需要重新计算。

[tzcherish]

[Quote=引用 4 楼 rex237 的回复:]
For most purposes, QList is the right class to use. Operations like prepend() and insert() are usually faster than with QVector because of the way QList stores its items in memory (see Algorithmic Com……
[/Quote]
爱看帮助手册的娃，都是好娃。。。

[gaowenboms]

看你的需求了,LIST是插入快,VECTOR是查找快

[tingsking18]

一个随即存取，一个连续存取。

[blueliuyun]

QVector
QList
QLinkedList
……