Definition at line 62 of file qtconcurrentmedian.h.
#include <qtconcurrentmedian.h>
Public Member Functions |
|
| Median (int _bufferSize) | |
| void | reset () |
| void | addValue (T value) |
| bool | isMedianValid () const |
| T | median () |
| Median | ( | int | _bufferSize | ) | [inline] |
Definition at line 65 of file qtconcurrentmedian.h.
: currentMedian(), bufferSize(_bufferSize), currentIndex(0), valid(false), dirty(true)
{
values.resize(bufferSize);
}
| void reset | ( | ) | [inline] |
Definition at line 71 of file qtconcurrentmedian.h.
{
values.fill(0);
currentIndex = 0;
valid = false;
dirty = true;
}
| void addValue | ( | T | value | ) | [inline] |
Definition at line 79 of file qtconcurrentmedian.h.
{
currentIndex = ((currentIndex + 1) % bufferSize);
if (valid == false && currentIndex % bufferSize == 0)
valid = true;
// Only update the cached median value when we have to, that
// is when the new value is on then other side of the median
// compared to the current value at the index.
const T currentIndexValue = values[currentIndex];
if ((currentIndexValue > currentMedian && currentMedian > value)
|| (currentMedian > currentIndexValue && value > currentMedian)) {
dirty = true;
}
values[currentIndex] = value;
}
| bool isMedianValid | ( | ) | const [inline] |
| T median | ( | ) | [inline] |
Definition at line 102 of file qtconcurrentmedian.h.
{
if (dirty) {
dirty = false;
QVector<T> sorted = values;
qSort(sorted);
currentMedian = sorted.at(bufferSize / 2 + 1);
}
return currentMedian;
}