blob: 87cd0dfb8b046445015b47f26781c7f55a5ef1a2 (
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
/*
KDChart - a multi-platform charting engine
*/
/****************************************************************************
** Copyright (C) 2001-2003 Klarälvdalens Datakonsult AB. All rights reserved.
**
** This file is part of the KDChart library.
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.
**
** Licensees holding valid commercial KDChart licenses may use this file in
** accordance with the KDChart Commercial License Agreement provided with
** the Software.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.klaralvdalens-datakonsult.se/?page=products for
** information about KDChart Commercial License Agreements.
**
** Contact [email protected] if any conditions of this
** licensing are not clear to you.
**
**********************************************************************/
#include "KDChartVectorSeries.h"
#include "KDChartSeriesCollection.h"
KDChartVectorSeries::~KDChartVectorSeries()
{
}
uint KDChartVectorSeries::rows() const
{
return size();
}
const KDChartData& KDChartVectorSeries::cell( uint row ) const
{
Q_ASSERT( row < size() );
// make it compile on windows using qt232
return this->at(row);
}
void KDChartVectorSeries::setCell( uint row, const KDChartData& element)
{
Q_ASSERT( row < size() );
// make it compile on windows using qt232
this->at(row) = element;
}
void KDChartVectorSeries::expand( uint rows )
{
resize(rows);
}
// we return !ok if its on the infinite axis
double KDChartVectorSeries::maxValue( int coordinate, bool &ok ) const
{
double maxValue = 0.0;
bool bStart = true;
KDChartVectorSeries::const_iterator i;
for ( i = begin(); i != end(); i ++ )
{
const KDChartData& d = *i;
if ( d.isDouble( coordinate ) )
{
if ( bStart )
{
maxValue = d.doubleValue( coordinate );
bStart = false;
}
else
maxValue = TQMAX( maxValue, d.doubleValue( coordinate ) );
}
}
ok = !bStart;
return maxValue;
}
double KDChartVectorSeries::minValue( int coordinate, bool &ok ) const
{
double minValue = 0.0;
bool bStart = true;
KDChartVectorSeries::const_iterator i;
for ( i = begin(); i != end(); i ++ )
{
const KDChartData& d = *i;
if ( d.isDouble( coordinate ) )
{
if ( bStart )
{
minValue = d.doubleValue( coordinate );
bStart = false;
}
else
minValue = TQMIN( minValue, d.doubleValue( coordinate ) );
}
}
ok = !bStart;
return minValue;
}
|
