|
|
|
@ -135,11 +135,7 @@ double KDChartSeriesCollection::maxValue( int coordinate ) const
|
|
|
|
|
bool first_max = true;
|
|
|
|
|
|
|
|
|
|
// find the first max
|
|
|
|
|
#if COMPAT_TQT_VERSION >= 0x030000
|
|
|
|
|
TQValueVector<KDChartBaseSeries *>::const_iterator i;
|
|
|
|
|
#else
|
|
|
|
|
TQArray<KDChartBaseSeries *>::ConstIterator i;
|
|
|
|
|
#endif
|
|
|
|
|
for ( i = (*this).begin(); i != (*this).end(); i ++ )
|
|
|
|
|
{
|
|
|
|
|
double temp = (*i)->maxValue(coordinate, ok);
|
|
|
|
@ -166,11 +162,7 @@ double KDChartSeriesCollection::minValue( int coordinate ) const
|
|
|
|
|
double result = 0; // if no valid min/max, then this is the default
|
|
|
|
|
|
|
|
|
|
// find the first min
|
|
|
|
|
#if COMPAT_TQT_VERSION >= 0x030000
|
|
|
|
|
TQValueVector<KDChartBaseSeries *>::const_iterator i;
|
|
|
|
|
#else
|
|
|
|
|
TQArray<KDChartBaseSeries *>::ConstIterator i;
|
|
|
|
|
#endif
|
|
|
|
|
for ( i = (*this).begin(); !ok && i != (*this).end(); i ++ )
|
|
|
|
|
result = (*i)->minValue(coordinate, ok);
|
|
|
|
|
|
|
|
|
@ -189,11 +181,7 @@ double KDChartSeriesCollection::minValue( int coordinate ) const
|
|
|
|
|
unsigned int KDChartSeriesCollection::indexOf( KDChartBaseSeries *series )
|
|
|
|
|
{
|
|
|
|
|
unsigned int index = 0;
|
|
|
|
|
#if COMPAT_TQT_VERSION >= 0x030000
|
|
|
|
|
TQValueVector<KDChartBaseSeries *>::const_iterator i;
|
|
|
|
|
#else
|
|
|
|
|
TQArray<KDChartBaseSeries *>::ConstIterator i;
|
|
|
|
|
#endif
|
|
|
|
|
for ( i = (*this).begin(); i != (*this).end(); i ++, index ++ )
|
|
|
|
|
if ( *i == series )
|
|
|
|
|
break;
|
|
|
|
|