| 1 | /****************************************************************************
|
|---|
| 2 | **
|
|---|
| 3 | ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|---|
| 4 | ** Contact: Qt Software Information ([email protected])
|
|---|
| 5 | **
|
|---|
| 6 | ** This file is part of the QtCore module of the Qt Toolkit.
|
|---|
| 7 | **
|
|---|
| 8 | ** $QT_BEGIN_LICENSE:LGPL$
|
|---|
| 9 | ** Commercial Usage
|
|---|
| 10 | ** Licensees holding valid Qt Commercial licenses may use this file in
|
|---|
| 11 | ** accordance with the Qt Commercial License Agreement provided with the
|
|---|
| 12 | ** Software or, alternatively, in accordance with the terms contained in
|
|---|
| 13 | ** a written agreement between you and Nokia.
|
|---|
| 14 | **
|
|---|
| 15 | ** GNU Lesser General Public License Usage
|
|---|
| 16 | ** Alternatively, this file may be used under the terms of the GNU Lesser
|
|---|
| 17 | ** General Public License version 2.1 as published by the Free Software
|
|---|
| 18 | ** Foundation and appearing in the file LICENSE.LGPL included in the
|
|---|
| 19 | ** packaging of this file. Please review the following information to
|
|---|
| 20 | ** ensure the GNU Lesser General Public License version 2.1 requirements
|
|---|
| 21 | ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|---|
| 22 | **
|
|---|
| 23 | ** In addition, as a special exception, Nokia gives you certain
|
|---|
| 24 | ** additional rights. These rights are described in the Nokia Qt LGPL
|
|---|
| 25 | ** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
|
|---|
| 26 | ** package.
|
|---|
| 27 | **
|
|---|
| 28 | ** GNU General Public License Usage
|
|---|
| 29 | ** Alternatively, this file may be used under the terms of the GNU
|
|---|
| 30 | ** General Public License version 3.0 as published by the Free Software
|
|---|
| 31 | ** Foundation and appearing in the file LICENSE.GPL included in the
|
|---|
| 32 | ** packaging of this file. Please review the following information to
|
|---|
| 33 | ** ensure the GNU General Public License version 3.0 requirements will be
|
|---|
| 34 | ** met: http://www.gnu.org/copyleft/gpl.html.
|
|---|
| 35 | **
|
|---|
| 36 | ** If you are unsure which license is appropriate for your use, please
|
|---|
| 37 | ** contact the sales department at [email protected].
|
|---|
| 38 | ** $QT_END_LICENSE$
|
|---|
| 39 | **
|
|---|
| 40 | ****************************************************************************/
|
|---|
| 41 |
|
|---|
| 42 | #ifndef QTCONCURRENT_MEDIAN_H
|
|---|
| 43 | #define QTCONCURRENT_MEDIAN_H
|
|---|
| 44 |
|
|---|
| 45 | #include <QtCore/qglobal.h>
|
|---|
| 46 |
|
|---|
| 47 | #ifndef QT_NO_CONCURRENT
|
|---|
| 48 |
|
|---|
| 49 | #include <QtCore/qvector.h>
|
|---|
| 50 | #include <QtCore/qalgorithms.h>
|
|---|
| 51 |
|
|---|
| 52 | QT_BEGIN_HEADER
|
|---|
| 53 | QT_BEGIN_NAMESPACE
|
|---|
| 54 |
|
|---|
| 55 | QT_MODULE(Core)
|
|---|
| 56 |
|
|---|
| 57 | #ifndef qdoc
|
|---|
| 58 |
|
|---|
| 59 | namespace QtConcurrent {
|
|---|
| 60 |
|
|---|
| 61 | template <typename T>
|
|---|
| 62 | class Median
|
|---|
| 63 | {
|
|---|
| 64 | public:
|
|---|
| 65 | Median(int _bufferSize)
|
|---|
| 66 | : currentMedian(), bufferSize(_bufferSize), currentIndex(0), valid(false), dirty(true)
|
|---|
| 67 | {
|
|---|
| 68 | values.resize(bufferSize);
|
|---|
| 69 | }
|
|---|
| 70 |
|
|---|
| 71 | void reset()
|
|---|
| 72 | {
|
|---|
| 73 | values.fill(0);
|
|---|
| 74 | currentIndex = 0;
|
|---|
| 75 | valid = false;
|
|---|
| 76 | dirty = true;
|
|---|
| 77 | }
|
|---|
| 78 |
|
|---|
| 79 | void addValue(T value)
|
|---|
| 80 | {
|
|---|
| 81 | currentIndex = ((currentIndex + 1) % bufferSize);
|
|---|
| 82 | if (valid == false && currentIndex % bufferSize == 0)
|
|---|
| 83 | valid = true;
|
|---|
| 84 |
|
|---|
| 85 | // Only update the cached median value when we have to, that
|
|---|
| 86 | // is when the new value is on then other side of the median
|
|---|
| 87 | // compared to the current value at the index.
|
|---|
| 88 | const T currentIndexValue = values[currentIndex];
|
|---|
| 89 | if ((currentIndexValue > currentMedian && currentMedian > value)
|
|---|
| 90 | || (currentMedian > currentIndexValue && value > currentMedian)) {
|
|---|
| 91 | dirty = true;
|
|---|
| 92 | }
|
|---|
| 93 |
|
|---|
| 94 | values[currentIndex] = value;
|
|---|
| 95 | }
|
|---|
| 96 |
|
|---|
| 97 | bool isMedianValid() const
|
|---|
| 98 | {
|
|---|
| 99 | return valid;
|
|---|
| 100 | }
|
|---|
| 101 |
|
|---|
| 102 | T median()
|
|---|
| 103 | {
|
|---|
| 104 | if (dirty) {
|
|---|
| 105 | dirty = false;
|
|---|
| 106 | QVector<T> sorted = values;
|
|---|
| 107 | qSort(sorted);
|
|---|
| 108 | currentMedian = sorted.at(bufferSize / 2 + 1);
|
|---|
| 109 | }
|
|---|
| 110 | return currentMedian;
|
|---|
| 111 | }
|
|---|
| 112 | private:
|
|---|
| 113 | QVector<T> values;
|
|---|
| 114 | T currentMedian;
|
|---|
| 115 | int bufferSize;
|
|---|
| 116 | int currentIndex;
|
|---|
| 117 | bool valid;
|
|---|
| 118 | bool dirty;
|
|---|
| 119 | };
|
|---|
| 120 |
|
|---|
| 121 | } // namespace QtConcurrent
|
|---|
| 122 |
|
|---|
| 123 | #endif //qdoc
|
|---|
| 124 |
|
|---|
| 125 | QT_END_NAMESPACE
|
|---|
| 126 | QT_END_HEADER
|
|---|
| 127 |
|
|---|
| 128 | #endif // QT_NO_CONCURRENT
|
|---|
| 129 |
|
|---|
| 130 | #endif
|
|---|