1 /****************************************************************************
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
4 ** All rights reserved.
5 ** Contact: Nokia Corporation (qt-info@nokia.com)
7 ** This file is part of the QtCore module of the Qt Toolkit.
9 ** $QT_BEGIN_LICENSE:LGPL$
10 ** No Commercial Usage
11 ** This file contains pre-release code and may not be distributed.
12 ** You may use this file in accordance with the terms and conditions
13 ** contained in the Technology Preview License Agreement accompanying
16 ** GNU Lesser General Public License Usage
17 ** Alternatively, this file may be used under the terms of the GNU Lesser
18 ** General Public License version 2.1 as published by the Free Software
19 ** Foundation and appearing in the file LICENSE.LGPL included in the
20 ** packaging of this file. Please review the following information to
21 ** ensure the GNU Lesser General Public License version 2.1 requirements
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
24 ** In addition, as a special exception, Nokia gives you certain additional
25 ** rights. These rights are described in the Nokia Qt LGPL Exception
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
28 ** If you have questions regarding the use of this file, please contact
29 ** Nokia at qt-info@nokia.com.
40 ****************************************************************************/
42 #ifndef QTCONCURRENT_MEDIAN_H
43 #define QTCONCURRENT_MEDIAN_H
45 #include <QtCore/qglobal.h>
47 #ifndef QT_NO_CONCURRENT
49 #include <QtCore/qvector.h>
50 #include <QtCore/qalgorithms.h>
59 namespace QtConcurrent
{
65 Median(int _bufferSize
)
66 : currentMedian(), bufferSize(_bufferSize
), currentIndex(0), valid(false), dirty(true)
68 values
.resize(bufferSize
);
79 void addValue(T value
)
81 currentIndex
= ((currentIndex
+ 1) % bufferSize
);
82 if (valid
== false && currentIndex
% bufferSize
== 0)
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
)) {
94 values
[currentIndex
] = value
;
97 bool isMedianValid() const
106 QVector
<T
> sorted
= values
;
108 currentMedian
= sorted
.at(bufferSize
/ 2 + 1);
110 return currentMedian
;
121 } // namespace QtConcurrent
128 #endif // QT_NO_CONCURRENT