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
|
/*
SPDX-FileCopyrightText: 2009 David Nolden <david.nolden.kdevelop@art-master.de>
SPDX-FileCopyrightText: 2011 Milian Wolff <mail@milianw.de>
SPDX-License-Identifier: GPL-2.0-or-later
*/
#ifndef KDEVPLATFORM_KDEVVARLENGTHARRAY_H
#define KDEVPLATFORM_KDEVVARLENGTHARRAY_H
#include <QVarLengthArray>
#include <QVector>
/**
* Extended QVarLengthArray with additional convenience API.
*/
template<class T, int Prealloc = 256>
class KDevVarLengthArray : public QVarLengthArray<T
, Prealloc>
{
using Base = QVarLengthArray<T, Prealloc>;
public:
using Base::Base;
///Removes exactly one occurrence of the given value from the array. Returns false if none was found.
inline bool removeOne(const T& value);
/// @return QList of items in this array
QList<T> toList() const;
/// @return QVector of items in this array
QVector<T> toVector() const;
};
template<class T, int Prealloc>
Q_INLINE_TEMPLATE bool KDevVarLengthArray<T, Prealloc>::removeOne(const T& value)
{
const int idx = Base::indexOf(value);
if (idx == -1) {
return false;
}
Base::remove(idx);
return true;
}
template<class T, int Prealloc>
Q_OUTOFLINE_TEMPLATE QList<T> KDevVarLengthArray<T, Prealloc>::toList() const
{
QList<T> ret;
ret.reserve(Base::size());
const T* const end = Base::constEnd();
for (const T* it = Base::constBegin(); it != end; ++it) {
ret << *it;
}
return ret;
}
template<class T, int Prealloc>
Q_OUTOFLINE_TEMPLATE QVector<T> KDevVarLengthArray<T, Prealloc>::toVector() const
{
QVector<T> ret;
ret.reserve(Base::size());
const T* const end = Base::constEnd();
for (const T* it = Base::constBegin(); it != end; ++it) {
ret << *it;
}
return ret;
}
#endif // KDEVPLATFORM_KDEVVARLENGTHARRAY_H
|
