| 1 | /**************************************************************************** |
| 2 | ** |
| 3 | ** Copyright (C) 2020 Klarälvdalens Datakonsult AB, a KDAB Group company, info@kdab.com, author Marc Mutz <marc.mutz@kdab.com> |
| 4 | ** Contact: http://www.qt.io/licensing/ |
| 5 | ** |
| 6 | ** This file is part of the QtCore 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 | #ifndef QDUPLICATETRACKER_P_H |
| 40 | #define QDUPLICATETRACKER_P_H |
| 41 | |
| 42 | // |
| 43 | // W A R N I N G |
| 44 | // ------------- |
| 45 | // |
| 46 | // This file is not part of the Qt API. It exists purely as an |
| 47 | // implementation detail. This header file may change from version to |
| 48 | // version without notice, or even be removed. |
| 49 | // |
| 50 | // We mean it. |
| 51 | // |
| 52 | |
| 53 | #include <qglobal.h> |
| 54 | |
| 55 | #if QT_HAS_INCLUDE(<memory_resource>) && __cplusplus > 201402L |
| 56 | # include <unordered_set> |
| 57 | # include <memory_resource> |
| 58 | #else |
| 59 | # include <qset.h> |
| 60 | #endif |
| 61 | |
| 62 | QT_BEGIN_NAMESPACE |
| 63 | |
| 64 | template <typename T, size_t Prealloc = 32> |
| 65 | class QDuplicateTracker { |
| 66 | #ifdef __cpp_lib_memory_resource |
| 67 | char buffer[Prealloc * sizeof(T)]; |
| 68 | std::pmr::monotonic_buffer_resource res{buffer, sizeof buffer}; |
| 69 | std::pmr::unordered_set<T> set{&res}; |
| 70 | #else |
| 71 | QSet<T> set; |
| 72 | int setSize = 0; |
| 73 | #endif |
| 74 | Q_DISABLE_COPY_MOVE(QDuplicateTracker); |
| 75 | public: |
| 76 | QDuplicateTracker() = default; |
| 77 | void reserve(int n) { set.reserve(n); } |
| 78 | [[nodiscard]] bool hasSeen(const T &s) |
| 79 | { |
| 80 | bool inserted; |
| 81 | #ifdef __cpp_lib_memory_resource |
| 82 | inserted = set.insert(s).second; |
| 83 | #else |
| 84 | set.insert(s); |
| 85 | const int n = set.size(); |
| 86 | inserted = qExchange(setSize, n) != n; |
| 87 | #endif |
| 88 | return !inserted; |
| 89 | } |
| 90 | [[nodiscard]] bool hasSeen(T &&s) |
| 91 | { |
| 92 | bool inserted; |
| 93 | #ifdef __cpp_lib_memory_resource |
| 94 | inserted = set.insert(std::move(s)).second; |
| 95 | #else |
| 96 | set.insert(std::move(s)); |
| 97 | const int n = set.size(); |
| 98 | inserted = qExchange(setSize, n) != n; |
| 99 | #endif |
| 100 | return !inserted; |
| 101 | } |
| 102 | |
| 103 | template <typename C> |
| 104 | void appendTo(C &c) const & |
| 105 | { |
| 106 | for (const auto &e : set) |
| 107 | c.push_back(e); |
| 108 | } |
| 109 | |
| 110 | template <typename C> |
| 111 | void appendTo(C &c) && |
| 112 | { |
| 113 | for (auto &e : set) |
| 114 | c.push_back(std::move(e)); |
| 115 | } |
| 116 | }; |
| 117 | |
| 118 | QT_END_NAMESPACE |
| 119 | |
| 120 | #endif /* QDUPLICATETRACKER_P_H */ |
| 121 | |