conrouter.h

/***************************************************************************
 *   Copyright (C) 2003-2004 by David Saxton                               *
 *   david@bluehaze.org                                                    *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 ***************************************************************************/

#ifndef CONROUTER_H
#define CONROUTER_H

#include "cells.h"

#include <qpoint.h>
#include <qvaluelist.h>

class ICNDocument;
class Cell;

typedef QValueList<QPoint> QPointList;
typedef QValueList<QPointList> QPointListList;

// TODO: ENHANCE THIS CODE!!!

// needs to be easier to cut routes.
// Routes need to be more intelligent/optimal.
// needs to be able to improve the topology of the wires. 

class ConRouter
{
public:
        ConRouter( ICNDocument *cv );
        ~ConRouter();
        
        void mapRoute( int sx, int sy, int ex, int ey );
        void translateRoute( int dx, int dy );
        void setPoints( const QPointList &pointList, bool reverse = false );
        void setRoutePoints( const QPointList &pointList );
        bool needsRouting( int sx, int sy, int ex, int ey ) const;
        QPointList pointList( bool reverse ) const;
        QPointList *cellPointList() { return &m_cellPointList; }
        QPointListList splitPoints( const QPoint &pos ) const;
        QPointListList dividePoints( uint n ) const;

protected:
        bool checkLineRoute( int scx, int scy, int ecx, int ecy, int maxConScore, int maxCIScore );
        void checkACell( int x, int y, Cell *prev, int prevX, int prevY, int nextScore );
        void checkCell( int x, int y ); // Gets the shortest route from the final cell
        void removeDuplicatePoints();
        
        int xcells, ycells;
        int m_lcx, m_lcy; // Last x / y from mapRoute, if we need a point on the route
        Cells *cellsPtr;
        TempLabelMap tempLabels;
        ICNDocument *p_icnDocument;
        QPointList m_cellPointList;
};

#endif

---