/**************************************************************************** ** Copyright (C) 2001-2011 Klaralvdalens Datakonsult AB. All rights reserved. ** ** This file is part of the KD Chart library. ** ** Licensees holding valid commercial KD Chart licenses may use this file in ** accordance with the KD Chart Commercial License Agreement provided with ** the Software. ** ** ** This file may be distributed and/or modified under the terms of the ** GNU General Public License version 2 and version 3 as published by the ** Free Software Foundation and appearing in the file LICENSE.GPL.txt included. ** ** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE ** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ** ** Contact info@kdab.com if any conditions of this licensing are not ** clear to you. ** **********************************************************************/ #include #include #include "KDChartBarDiagram.h" #include "KDChartLineDiagram.h" #include "KDChartTextAttributes.h" #include "KDChartAttributesModel.h" #include "KDChartAbstractCartesianDiagram.h" #include "KDChartNormalLineDiagram_p.h" using namespace KDChart; using namespace std; NormalLineDiagram::NormalLineDiagram( LineDiagram* d ) : LineDiagramType( d ) { } LineDiagram::LineType NormalLineDiagram::type() const { return LineDiagram::Normal; } const QPair< QPointF, QPointF > NormalLineDiagram::calculateDataBoundaries() const { const int rowCount = compressor().modelDataRows(); const int colCount = compressor().modelDataColumns(); const double xMin = 0.0; double xMax = diagram()->model() ? diagram()->model()->rowCount( diagram()->rootIndex() ) : 0; if ( !diagram()->centerDataPoints() && diagram()->model() ) xMax -= 1; double yMin = std::numeric_limits< double >::quiet_NaN(); double yMax = std::numeric_limits< double >::quiet_NaN(); for( int column = 0; column < colCount; ++column ) { for ( int row = 0; row < rowCount; ++row ) { const CartesianDiagramDataCompressor::CachePosition position( row, column ); const CartesianDiagramDataCompressor::DataPoint point = compressor().data( position ); const double value = ISNAN( point.value ) ? 0.0 : point.value; if ( ISNAN( yMin ) ) { yMin = value; yMax = value; } else { yMin = qMin( yMin, value ); yMax = qMax( yMax, value ); } } } // NOTE: calculateDataBoundaries must return the *real* data boundaries! // i.e. we may NOT fake yMin to be qMin( 0.0, yMin ) // (khz, 2008-01-24) const QPointF bottomLeft( QPointF( xMin, yMin ) ); const QPointF topRight( QPointF( xMax, yMax ) ); return QPair< QPointF, QPointF >( bottomLeft, topRight ); } void NormalLineDiagram::paint( PaintContext* ctx ) { reverseMapper().clear(); Q_ASSERT( dynamic_cast( ctx->coordinatePlane() ) ); CartesianCoordinatePlane* plane = static_cast( ctx->coordinatePlane() ); const int columnCount = compressor().modelDataColumns(); const int rowCount = compressor().modelDataRows(); if ( columnCount == 0 || rowCount == 0 ) return; // maybe blank out the area? // FIXME integrate column index retrieval to compressor: // the compressor should only pass through visiblel columns int maxFound = 0; // { // find the last column number that is not hidden // for( int column = datasetDimension() - 1; // column < columnCount; // column += datasetDimension() ) // if( ! diagram()->isHidden( column ) ) // maxFound = column; // } maxFound = columnCount; // ^^^ temp // Reverse order of data sets? bool rev = diagram()->reverseDatasetOrder(); DataValueTextInfoList textInfoList; LineAttributesInfoList lineList; for( int column = rev ? columnCount - 1 : 0; rev ? (column >= 0) : (column < columnCount); rev ? --column : ++column ) { LineAttributes laPreviousCell; CartesianDiagramDataCompressor::DataPoint lastPoint; qreal lastAreaBoundingValue = 0; // Get min. y value, used as lower or upper bounding for area highlighting const qreal minYValue = qMin(plane->visibleDataRange().bottom(), plane->visibleDataRange().top()); CartesianDiagramDataCompressor::CachePosition previousCellPosition; for ( int row = 0; row < rowCount; ++row ) { const CartesianDiagramDataCompressor::CachePosition position( row, column ); // get where to draw the line from: CartesianDiagramDataCompressor::DataPoint point = compressor().data( position ); const QModelIndex sourceIndex = attributesModel()->mapToSource( point.index ); const LineAttributes laCell = diagram()->lineAttributes( sourceIndex ); const LineAttributes::MissingValuesPolicy policy = laCell.missingValuesPolicy(); // lower or upper bounding for the highlighted area qreal areaBoundingValue; if ( laCell.areaBoundingDataset() != -1 ) { const CartesianDiagramDataCompressor::CachePosition areaBoundingCachePosition( row, laCell.areaBoundingDataset() ); areaBoundingValue = compressor().data( areaBoundingCachePosition ).value; } else // Use min. y value (i.e. zero line in most cases) if no bounding dataset is set areaBoundingValue = minYValue; if( ISNAN( point.value ) ) { switch( policy ) { case LineAttributes::MissingValuesAreBridged: // we just bridge both values continue; case LineAttributes::MissingValuesShownAsZero: // set it to zero point.value = 0.0; break; case LineAttributes::MissingValuesHideSegments: // they're just hidden break; default: break; // hm.... } } // area corners, a + b are the line ends: const QPointF a( plane->translate( QPointF( diagram()->centerDataPoints() ? lastPoint.key + 0.5 : lastPoint.key, lastPoint.value ) ) ); const QPointF b( plane->translate( QPointF( diagram()->centerDataPoints() ? point.key + 0.5 : point.key, point.value ) ) ); const QPointF c( plane->translate( QPointF( diagram()->centerDataPoints() ? lastPoint.key + 0.5 : lastPoint.key, lastAreaBoundingValue ) ) ); const QPointF d( plane->translate( QPointF( diagram()->centerDataPoints() ? point.key + 0.5 : point.key, areaBoundingValue ) ) ); // add the line to the list: // add data point labels: const PositionPoints pts = PositionPoints( b, a, d, c ); // if necessary, add the area to the area list: QList areas; if ( !ISNAN( point.value ) && !ISNAN( lastPoint.value ) && laCell.displayArea() ) { areas << ( QPolygonF() << a << b << d << c );//polygon; } // add the pieces to painting if this is not hidden: if ( ! point.hidden && !ISNAN( point.value ) ) { appendDataValueTextInfoToList( diagram(), textInfoList, sourceIndex, &position, pts, Position::NorthWest, Position::SouthWest, point.value ); paintAreas( ctx, attributesModel()->mapToSource( lastPoint.index ), areas, laCell.transparency() ); // position 0 is not really painted, since it takes two points to make a line :-) if( row > 0 && !ISNAN( lastPoint.value ) ) lineList.append( LineAttributesInfo( sourceIndex, a, b ) ); } // wrap it up: previousCellPosition = position; laPreviousCell = laCell; lastAreaBoundingValue = areaBoundingValue; lastPoint = point; } } LineAttributes::MissingValuesPolicy policy = LineAttributes::MissingValuesAreBridged; //unused paintElements( ctx, textInfoList, lineList, policy ); }