blob: 40f7f946033fe03e9ac63766b1d6ebd01b2e3909 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc
** All rights reserved.
** For any questions to Digia, please use contact form at http://qt.digia.com
**
** This file is part of the Qt Commercial Charts Add-on.
**
** $QT_BEGIN_LICENSE$
** Licensees holding valid Qt Commercial licenses may use this file in
** accordance with the Qt Commercial License Agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia.
**
** If you have questions regarding the use of this file, please use
** contact form at http://qt.digia.com
** $QT_END_LICENSE$
**
****************************************************************************/
#include "boxdatareader.h"
BoxDataReader::BoxDataReader(QIODevice *device) :
QTextStream(device)
{
}
QBoxSet* BoxDataReader::readBox()
{
QString line = readLine();
if (line.startsWith("#"))
return 0;
QStringList strList = line.split(" ", QString::SkipEmptyParts);
sortedList.clear();
for (int i = 1; i < strList.count(); i++) {
sortedList.append(strList.at(i).toDouble());
}
qSort(sortedList.begin(), sortedList.end());
int count = sortedList.count();
QBoxSet *box = new QBoxSet(strList.first());
box->setLowerExtreme(sortedList.first());
box->setUpperExtreme(sortedList.last());
box->setMedian(findMedian(0, count));
box->setLowerQuartile(findMedian(0, count / 2));
if (count % 2)
box->setUpperQuartile(findMedian(count / 2 + 1, count));
else // even amount of numbers
box->setUpperQuartile(findMedian(count / 2, count));
return box;
}
qreal BoxDataReader::findMedian(int begin, int end)
{
int count = end - begin;
if (count % 2 ) {
return sortedList.at((int) (count/2) + begin);
} else {
qreal right = sortedList.at(count / 2 + begin);
qreal left = sortedList.at(count / 2 - 1 + begin);
return (right + left) / 2.0;
}
}
|
