add qgslinevectorlayerdirector

src/analysis/network/CMakeLists.txt

@@ -7,6 +7,7 @@ SET(QGIS_NETWORK_ANALYSIS_SRCS
   qgsgraph.cpp
   qgsgraphbuilder.cpp
   qgsdistanceedgeproperter.cpp
+  qgslinevectorlayerdirector.cpp
 )
 
 INCLUDE_DIRECTORIES(BEFORE raster)
@@ -50,14 +51,14 @@ INSTALL(TARGETS qgis_networkanalysis
   ARCHIVE DESTINATION ${QGIS_LIB_DIR})
 
 
-# Added by Tim to install headers
-
 SET(QGIS_NETWORK_ANALYSIS_HDRS 
   qgsgraph.h 
-  qgsgraphbuilderinterface.h 
+  qgsgraphbuilderintr.h 
   qgsgraphbuilder.h 
   qgsedgeproperter.h 
-  qgsdistanceedgeproperter.h )
+  qgsdistanceedgeproperter.h 
+  qgsgraphdirector.h 
+  qgslinevectorlayerdirector.h )
 
 INSTALL(CODE "MESSAGE(\"Installing NETWORK ANALYSIS headers...\")")
 INSTALL(FILES ${QGIS_NETWORK_ANALYSIS_HDRS} ${QGIS_NETWORK_ANALYSIS_MOC_HDRS} DESTINATION ${QGIS_INCLUDE_DIR}) 

src/analysis/network/qgsgraphbuilderintr.h

@@ -29,7 +29,7 @@
 /**
 * \ingroup analysis
 * \class QgsGraphBuilderInterface
-* \brief Determine interface for creating a graph. Contains the settings of the graph.
+* \brief Determine interface for creating a graph. Contains the settings of the graph. QgsGraphBuilder and QgsGraphDirector is a Builder pattern
 */
 class ANALYSIS_EXPORT QgsGraphBuilderInterface
 {

src/analysis/network/qgsgraphdirector.h

@@ -0,0 +1,75 @@
+/***************************************************************************
+  qgsgraphdirector.h
+  --------------------------------------
+  Date                 : 2010-10-18
+  Copyright            : (C) 2010 by Yakushev Sergey
+  Email                : YakushevS <at> list.ru
+****************************************************************************
+*                                                                          *
+*   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 QGSGRAPHDIRECTORH
+#define QGSGRAPHDIRECTORH
+
+//QT4 includes
+#include <QObject>
+#include <QVector>
+#include <QList>
+
+//QGIS includes
+#include <qgspoint.h>
+#include "qgsedgeproperter.h"
+
+//forward declarations
+class QgsGraphBuilderInterface;
+
+/**
+ * \ingroup analysis
+ * \class QgsGraphDirector
+ * \brief Determine making the graph. QgsGraphBuilder and QgsGraphDirector is a builder patter.
+ */
+class ANALYSIS_EXPORT QgsGraphDirector : public QObject
+{
+    Q_OBJECT
+
+  signals:
+    void buildProgress( int, int ) const;
+    void buildMessage( QString ) const;
+
+  public:
+    //! Destructor
+    virtual ~QgsGraphDirector() { };
+
+    /**
+     * Make a graph using RgGraphBuilder
+     *
+     * @param builder   The graph builder
+     *
+     * @param additionalPoints  Vector of points that must be tied to the graph
+     *
+     * @param tiedPoints  Vector of tied points
+     *
+     * @note if tiedPoints[i]==QgsPoint(0.0,0.0) then tied failed.
+     */
+    virtual void makeGraph( QgsGraphBuilderInterface* builder,
+                            const QVector< QgsPoint >& additionalPoints,
+                            QVector< QgsPoint>& tiedPoints ) const = 0;
+
+    void addProperter( QgsEdgeProperter* prop )
+    {
+      mProperterList.push_back( prop );
+    }
+
+    /**
+     * return Director name
+     */
+    virtual QString name() const = 0;
+
+  protected:
+    QList<QgsEdgeProperter*> mProperterList;
+};
+#endif //QGSGRAPHDIRECTORH

src/analysis/network/qgslinevectorlayerdirector.cpp

@@ -0,0 +1,272 @@
+/***************************************************************************
+ *   Copyright (C) 2010 by Sergey Yakushev                                 *
+ *   yakushevs <at> list.ru                                                *
+ *                                                                         *
+ *                                                                         *
+ *   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.                                   *
+ ***************************************************************************/
+
+/**
+ * \file qgslinevectorlayerdirector.cpp
+ * \brief implementation of QgsLineVectorLayerDirector
+ */
+
+#include "qgslinevectorlayerdirector.h"
+#include "qgsgraphbuilderintr.h"
+
+// Qgis includes
+#include <qgsvectorlayer.h>
+#include <qgsmaplayerregistry.h>
+#include <qgsvectordataprovider.h>
+#include <qgspoint.h>
+#include <qgsgeometry.h>
+#include <qgsdistancearea.h>
+
+// QT includes
+#include <QString>
+#include <QtAlgorithms>
+
+//standard includes
+#include <limits>
+
+QgsLineVectorLayerDirector::QgsLineVectorLayerDirector( const QString& layerId,
+    int directionFieldId,
+    const QString& directDirectionValue,
+    const QString& reverseDirectionValue,
+    const QString& bothDirectionValue,
+    int defaultDirection
+    )
+{
+  mLayerId                = layerId;
+  mDirectionFieldId       = directionFieldId;
+  mDirectDirectionValue   = directDirectionValue;
+  mReverseDirectionValue  = reverseDirectionValue;
+  mDefaultDirection       = defaultDirection;
+  mBothDirectionValue     = bothDirectionValue;
+}
+
+QgsLineVectorLayerDirector::~QgsLineVectorLayerDirector()
+{
+
+}
+
+QString QgsLineVectorLayerDirector::name() const
+{
+  return QString( "Vector line" );
+}
+
+void QgsLineVectorLayerDirector::makeGraph( QgsGraphBuilderInterface *builder, const QVector< QgsPoint >& additionalPoints,
+    QVector< QgsPoint >& tiedPoint ) const
+{
+  QgsVectorLayer *vl = myLayer();
+
+  if ( vl == NULL )
+    return;
+
+  int featureCount = ( int ) vl->featureCount() * 2;
+  int step = 0;
+
+  QgsCoordinateTransform ct( vl->crs(), builder->destinationCrs() );
+
+  QgsDistanceArea da;
+  da.setSourceCrs( builder->destinationCrs().srsid() );
+  da.setProjectionsEnabled( true );
+
+  tiedPoint = QVector< QgsPoint >( additionalPoints.size(), QgsPoint( 0.0, 0.0 ) );
+  TiePointInfo tmpInfo;
+  tmpInfo.mLength = std::numeric_limits<double>::infinity();
+
+  QVector< TiePointInfo > pointLengthMap( additionalPoints.size(), tmpInfo );
+  QVector< TiePointInfo >::iterator pointLengthIt;
+
+  // begin: tie points to the graph
+  QgsAttributeList la;
+  vl->select( la );
+  QgsFeature feature;
+  while ( vl->nextFeature( feature ) )
+  {
+    QgsPoint pt1, pt2;
+    bool isFirstPoint = true;
+    QgsPolyline pl = feature.geometry()->asPolyline();
+    QgsPolyline::iterator pointIt;
+    for ( pointIt = pl.begin(); pointIt != pl.end(); ++pointIt )
+    {
+      pt2 = ct.transform( *pointIt );
+      if ( !isFirstPoint )
+      {
+        int i = 0;
+        for ( i = 0; i != additionalPoints.size(); ++i )
+        {
+          TiePointInfo info;
+          info.mLength = additionalPoints[ i ].sqrDistToSegment( pt1.x(), pt1.y(), pt2.x(), pt2.y(), info.mTiedPoint );
+
+          if ( pointLengthMap[ i ].mLength > info.mLength )
+          {
+            info.mTiedPoint = info.mTiedPoint ;
+            info.mFirstPoint = pt1;
+            info.mLastPoint = pt2;
+
+            pointLengthMap[ i ] = info;
+            tiedPoint[ i ] = info.mTiedPoint;
+          }
+        }
+      }
+      pt1 = pt2;
+      isFirstPoint = false;
+    }
+    emit buildProgress( ++step, featureCount );
+  }
+
+  // end: tie points to graph
+
+  // add tied point to graph 
+  int i = 0;
+  for ( i = 0; i < tiedPoint.size(); ++i )
+  {
+    if ( tiedPoint[ i ] != QgsPoint( 0.0, 0.0 ) )
+    {
+      tiedPoint[ i ] = builder->addVertex( tiedPoint[ i ] );
+    }
+  }
+
+  { // fill attribute list 'la'
+    QgsAttributeList tmpAttr;
+    if ( mDirectionFieldId != -1 )
+    {
+      tmpAttr.push_back( mDirectionFieldId );
+    }
+
+    QList< QgsEdgeProperter* >::const_iterator it;
+    QgsAttributeList::const_iterator it2;
+
+    for ( it = mProperterList.begin(); it != mProperterList.end(); ++it )
+    {
+      QgsAttributeList tmp = (*it)->requiredAttributes();
+      for ( it2 = tmp.begin(); it2 != tmp.end(); ++it2 )
+      {
+        tmpAttr.push_back( *it2 );
+      }
+    }
+    qSort( tmpAttr.begin(), tmpAttr.end() );
+
+    int lastAttrId = -1;
+        for ( it2 = tmpAttr.begin(); it2 != tmpAttr.end(); ++it2 )
+    {
+      if ( *it2 == lastAttrId )
+      {
+        continue;
+      }
+
+      la.push_back( *it2 );
+
+      lastAttrId = *it2;
+    }
+  } // end fill attribute list 'la'
+
+  // begin graph construction
+  vl->select( la );
+  while ( vl->nextFeature( feature ) )
+  {
+    QgsAttributeMap attr = feature.attributeMap();
+    int directionType = mDefaultDirection;
+    QgsAttributeMap::const_iterator it;
+    // What direction have feature?
+    for ( it = attr.constBegin(); it != attr.constEnd(); ++it )
+    {
+      if ( it.key() != mDirectionFieldId )
+      {
+        continue;
+      }
+      QString str = it.value().toString();
+      if ( str == mBothDirectionValue )
+      {
+        directionType = 3;
+      }
+      else if ( str == mDirectDirectionValue )
+      {
+        directionType = 1;
+      }
+      else if ( str == mReverseDirectionValue )
+      {
+        directionType = 2;
+      }
+    }
+
+    // begin features segments and add arc to the Graph;
+    QgsPoint pt1, pt2;
+
+    bool isFirstPoint = true;
+    QgsPolyline pl = feature.geometry()->asPolyline();
+    QgsPolyline::iterator pointIt;
+    for ( pointIt = pl.begin(); pointIt != pl.end(); ++pointIt )
+    {
+      pt2 = builder->addVertex( ct.transform( *pointIt ) );
+
+      std::map< double, QgsPoint > pointsOnArc;
+      pointsOnArc[ 0.0 ] = pt1;
+      pointsOnArc[ pt1.sqrDist( pt2 )] = pt2;
+
+      for ( pointLengthIt = pointLengthMap.begin(); pointLengthIt != pointLengthMap.end(); ++pointLengthIt )
+      {
+        if ( pointLengthIt->mFirstPoint == pt1 && pointLengthIt->mLastPoint == pt2 )
+        {
+          QgsPoint tiedPoint = pointLengthIt->mTiedPoint;
+          pointsOnArc[ pt1.sqrDist( tiedPoint )] = tiedPoint;
+        }
+      }
+
+      if ( !isFirstPoint )
+      {
+        std::map< double, QgsPoint >::iterator pointsIt;
+        QgsPoint pt1;
+        QgsPoint pt2;
+        bool isFirstPoint = true;
+        for ( pointsIt = pointsOnArc.begin(); pointsIt != pointsOnArc.end(); ++pointsIt )
+        {
+          pt2 = pointsIt->second;
+          if ( !isFirstPoint )
+          {
+            double distance = da.measureLine( pt1, pt2 );
+            QVector< QVariant > prop;
+            QList< QgsEdgeProperter* >::const_iterator it;
+            for ( it = mProperterList.begin(); it != mProperterList.end(); ++it )
+            {
+              prop.push_back( (*it)->property( distance, feature ) );
+            }
+
+            if ( directionType == 1 ||
+                 directionType == 3 )
+            {
+              builder->addArc( pt1, pt2, prop );
+            }
+            if ( directionType == 2 ||
+                 directionType == 3 )
+            {
+              builder->addArc( pt2, pt1, prop );
+            }
+          }
+          pt1 = pt2;
+          isFirstPoint = false;
+        }
+      } // if ( !isFirstPoint )
+      pt1 = pt2;
+      isFirstPoint = false;
+    } // for (it = pl.begin(); it != pl.end(); ++it)
+    emit buildProgress( ++step, featureCount );
+  } // while( vl->nextFeature(feature) )
+} // makeGraph( QgsGraphBuilderInterface *builder, const QVector< QgsPoint >& additionalPoints, QVector< QgsPoint >& tiedPoint )
+
+QgsVectorLayer* QgsLineVectorLayerDirector::myLayer() const
+{
+  QMap <QString, QgsMapLayer*> m = QgsMapLayerRegistry::instance()->mapLayers();
+  QMap <QString, QgsMapLayer*>::const_iterator it = m.find( mLayerId );
+  if ( it == m.end() )
+  {
+    return NULL;
+  }
+  // return NULL if it.value() isn't QgsVectorLayer()
+  return dynamic_cast<QgsVectorLayer*>( it.value() );
+}