Method buildPlaneLayoutGraph

src/KDChart/KDChartChart.cpp:464–547

* this method determines the needed layout of the graph * taking care of the sharing problematic * its NOT allowed to have a diagram that shares * more than one axis in the same direction */

 * more than one axis in the same direction
 */
QVector<LayoutGraphNode *> Chart::Private::buildPlaneLayoutGraph()
{
    QHash<AbstractCoordinatePlane *, LayoutGraphNode *> planeNodeMapping;
    QVector<LayoutGraphNode *> allNodes;
    // create all nodes and a mapping between plane and nodes
    Q_FOREACH (AbstractCoordinatePlane *curPlane, coordinatePlanes) {
        if (curPlane->diagram()) {
            allNodes.append(new LayoutGraphNode);
            allNodes[allNodes.size() - 1]->diagramPlane = curPlane;
            allNodes[allNodes.size() - 1]->priority = allNodes.size();
            checkExistingAxes(allNodes[allNodes.size() - 1]);
            planeNodeMapping[curPlane] = allNodes[allNodes.size() - 1];
        }
    }
    // build the graph connections
    Q_FOREACH (LayoutGraphNode *curNode, allNodes) {
        QVector<CartesianAxis *> sharedAxes;
        CoordinatePlaneList xSharedPlanes = findSharingAxisDiagrams(curNode->diagramPlane, coordinatePlanes, Abscissa, &sharedAxes);
        Q_ASSERT(sharedAxes.size() < 2);
        // TODO duplicated code make a method out of it
        if (sharedAxes.size() == 1 && xSharedPlanes.size() > 1) {
            // xSharedPlanes.removeAll( sharedAxes.first()->diagram()->coordinatePlane() );
            // std::sort( xSharedPlanes.begin(), xSharedPlanes.end(), PriorityComparator( planeNodeMapping ) );
            for (int i = 0; i < xSharedPlanes.size() - 1; ++i) {
                LayoutGraphNode *tmpNode = planeNodeMapping[xSharedPlanes[i]];
                Q_ASSERT(tmpNode);
                LayoutGraphNode *tmpNode2 = planeNodeMapping[xSharedPlanes[i + 1]];
                Q_ASSERT(tmpNode2);
                tmpNode->bottomSuccesor = tmpNode2;
            }
            //            if ( sharedAxes.first()->diagram() &&  sharedAxes.first()->diagram()->coordinatePlane() )
            //            {
            //                LayoutGraphNode *lastNode = planeNodeMapping[ xSharedPlanes.last() ];
            //                Q_ASSERT( lastNode );
            //                Q_ASSERT( sharedAxes.first()->diagram()->coordinatePlane() );
            //                LayoutGraphNode *ownerNode = planeNodeMapping[ sharedAxes.first()->diagram()->coordinatePlane() ];
            //                Q_ASSERT( ownerNode );
            //                lastNode->bottomSuccesor = ownerNode;
            //            }
            // merge AxisInformation, needs a two pass run
            LayoutGraphNode axisInfoNode;
            for (int count = 0; count < 2; ++count) {
                for (int i = 0; i < xSharedPlanes.size(); ++i) {
                    mergeNodeAxisInformation(&axisInfoNode, planeNodeMapping[xSharedPlanes[i]]);
                }
            }
        }
        sharedAxes.clear();
        CoordinatePlaneList ySharedPlanes = findSharingAxisDiagrams(curNode->diagramPlane, coordinatePlanes, Ordinate, &sharedAxes);
        Q_ASSERT(sharedAxes.size() < 2);
        if (sharedAxes.size() == 1 && ySharedPlanes.size() > 1) {
            // ySharedPlanes.removeAll( sharedAxes.first()->diagram()->coordinatePlane() );
            // std::sort( ySharedPlanes.begin(), ySharedPlanes.end(), PriorityComparator( planeNodeMapping ) );
            for (int i = 0; i < ySharedPlanes.size() - 1; ++i) {
                LayoutGraphNode *tmpNode = planeNodeMapping[ySharedPlanes[i]];
                Q_ASSERT(tmpNode);
                LayoutGraphNode *tmpNode2 = planeNodeMapping[ySharedPlanes[i + 1]];
                Q_ASSERT(tmpNode2);