diff options
| author | Oswald Buddenhagen <oswald.buddenhagen@nokia.com> | 2010-02-18 22:29:52 +0100 |
|---|---|---|
| committer | Oswald Buddenhagen <oswald.buddenhagen@nokia.com> | 2010-02-22 18:12:16 +0100 |
| commit | e38f2b026a00acafab96b1fcc7c27a4446ec49d1 (patch) | |
| tree | c8f20dbeec8e089f86a3b67f16e116e23d43c55f /src/corelib/tools/qlist.h | |
| parent | 4967231a9e5c39de3a60b61db9b6a71266a04829 (diff) | |
make queues to which only lists are appended not blow the memory
append2(list) didn't use the array shifting logic the append() for
single elements does. this would cause the list to grow endlessly
despite leading elements being removed if only lists were ever appended.
Reviewed-by: joao
Diffstat (limited to 'src/corelib/tools/qlist.h')
| -rw-r--r-- | src/corelib/tools/qlist.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/src/corelib/tools/qlist.h b/src/corelib/tools/qlist.h index 5364e8eee8..fdebd7d740 100644 --- a/src/corelib/tools/qlist.h +++ b/src/corelib/tools/qlist.h @@ -80,6 +80,7 @@ struct Q_CORE_EXPORT QListData { static Data shared_null; Data *d; void **erase(void **xi); + void **append(int n); void **append(); void **append(const QListData &l); void **append2(const QListData &l); // remove in 5.0 |