1 | /**************************************************************************** |
2 | ** |
3 | ** Copyright (C) 2020 Klarälvdalens Datakonsult AB, a KDAB Group company, info@kdab.com, author Giuseppe D'Angelo <giuseppe.dangelo@kdab.com> |
4 | ** Contact: https://www.qt.io/licensing/ |
5 | ** |
6 | ** This file is part of the QtQuick module of the Qt Toolkit. |
7 | ** |
8 | ** $QT_BEGIN_LICENSE:LGPL$ |
9 | ** Commercial License Usage |
10 | ** Licensees holding valid commercial Qt licenses may use this file in |
11 | ** accordance with the commercial license agreement provided with the |
12 | ** Software or, alternatively, in accordance with the terms contained in |
13 | ** a written agreement between you and The Qt Company. For licensing terms |
14 | ** and conditions see https://www.qt.io/terms-conditions. For further |
15 | ** information use the contact form at https://www.qt.io/contact-us. |
16 | ** |
17 | ** GNU Lesser General Public License Usage |
18 | ** Alternatively, this file may be used under the terms of the GNU Lesser |
19 | ** General Public License version 3 as published by the Free Software |
20 | ** Foundation and appearing in the file LICENSE.LGPL3 included in the |
21 | ** packaging of this file. Please review the following information to |
22 | ** ensure the GNU Lesser General Public License version 3 requirements |
23 | ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. |
24 | ** |
25 | ** GNU General Public License Usage |
26 | ** Alternatively, this file may be used under the terms of the GNU |
27 | ** General Public License version 2.0 or (at your option) the GNU General |
28 | ** Public license version 3 or any later version approved by the KDE Free |
29 | ** Qt Foundation. The licenses are as published by the Free Software |
30 | ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3 |
31 | ** included in the packaging of this file. Please review the following |
32 | ** information to ensure the GNU General Public License requirements will |
33 | ** be met: https://www.gnu.org/licenses/gpl-2.0.html and |
34 | ** https://www.gnu.org/licenses/gpl-3.0.html. |
35 | ** |
36 | ** $QT_END_LICENSE$ |
37 | ** |
38 | ****************************************************************************/ |
39 | |
40 | #ifndef QQUICKPARTICLEFLATSET_P_H |
41 | #define QQUICKPARTICLEFLATSET_P_H |
42 | |
43 | // |
44 | // W A R N I N G |
45 | // ------------- |
46 | // |
47 | // This file is not part of the Qt API. It exists purely as an |
48 | // implementation detail. This header file may change from version to |
49 | // version without notice, or even be removed. |
50 | // |
51 | // We mean it. |
52 | // |
53 | |
54 | #include <QtGlobal> |
55 | |
56 | #include <vector> |
57 | #include <algorithm> |
58 | #include <iterator> |
59 | |
60 | QT_BEGIN_NAMESPACE |
61 | |
62 | // Minimal API, just for the consumption of Qt Quick Particles. |
63 | // For extra safety, it's in a private namespace |
64 | |
65 | namespace QtQuickParticlesPrivate { |
66 | |
67 | template <typename T> |
68 | class QFlatSet |
69 | { |
70 | public: |
71 | using iterator = typename std::vector<T>::iterator; |
72 | using const_iterator = typename std::vector<T>::const_iterator; |
73 | using value_type = typename std::vector<T>::value_type; |
74 | using size_type = int; |
75 | |
76 | iterator find(const T &t) |
77 | { |
78 | return std::find(begin(), end(), t); |
79 | } |
80 | |
81 | const_iterator find(const T &t) const |
82 | { |
83 | return std::find(begin(), end(), t); |
84 | } |
85 | |
86 | bool contains(const T &t) const |
87 | { |
88 | return find(t) != end(); |
89 | } |
90 | |
91 | void clear() |
92 | { |
93 | m_data.clear(); |
94 | } |
95 | |
96 | void reserve(int capacity) |
97 | { |
98 | m_data.reserve(capacity); |
99 | } |
100 | |
101 | iterator insert(const T &t) |
102 | { |
103 | auto i = find(t); |
104 | if (i != end()) |
105 | return i; |
106 | T copy = t; |
107 | m_data.push_back(std::move(copy)); |
108 | return std::prev(m_data.end()); |
109 | } |
110 | |
111 | iterator insert(T &&t) |
112 | { |
113 | auto i = find(t); |
114 | if (i != end()) |
115 | return i; |
116 | m_data.push_back(std::move(t)); |
117 | return std::prev(m_data.end()); |
118 | } |
119 | |
120 | size_type remove(const T &t) |
121 | { |
122 | auto i = std::find(m_data.begin(), m_data.end(), t); |
123 | if (i != m_data.end()) { |
124 | m_data.erase(i); |
125 | return 1; |
126 | } |
127 | return 0; |
128 | } |
129 | |
130 | iterator operator<<(const T &t) |
131 | { |
132 | return insert(t); |
133 | } |
134 | |
135 | iterator operator<<(T &&t) |
136 | { |
137 | return insert(std::move(t)); |
138 | } |
139 | |
140 | iterator begin() { return m_data.begin(); } |
141 | const_iterator begin() const { return m_data.begin(); } |
142 | const_iterator cbegin() const { return m_data.cbegin(); } |
143 | |
144 | iterator end() { return m_data.end(); } |
145 | const_iterator end() const { return m_data.end(); } |
146 | const_iterator cend() const { return m_data.cend(); } |
147 | |
148 | private: |
149 | std::vector<T> m_data; |
150 | }; |
151 | |
152 | } // namespace QtQuickParticlesPrivate |
153 | |
154 | QT_END_NAMESPACE |
155 | |
156 | #endif // QQUICKPARTICLEFLATSET_P_H |
157 | |