pal.h

Go to the documentation of this file.

/*
 *   libpal - Automated Placement of Labels Library
 *
 *   Copyright (C) 2008 Maxence Laurent, MIS-TIC, HEIG-VD
 *                      University of Applied Sciences, Western Switzerland
 *                      http://www.hes-so.ch
 *
 *   Contact:
 *      maxence.laurent <at> heig-vd <dot> ch
 *    or
 *      eric.taillard <at> heig-vd <dot> ch
 *
 * This file is part of libpal.
 *
 * libpal 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 3 of the License, or
 * (at your option) any later version.
 *
 * libpal is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with libpal.  If not, see <http://www.gnu.org/licenses/>.
 *
 */
 
#ifndef PAL_H
#define PAL_H
 
#define SIP_NO_FILE
 
 
#include "qgis_core.h"
#include "qgsgeometry.h"
#include "qgsgeos.h"
#include "qgspallabeling.h"
#include "qgslabelingenginesettings.h"
#include <QList>
#include <iostream>
#include <ctime>
#include <QMutex>
#include <QStringList>
#include <unordered_map>
 
// TODO ${MAJOR} ${MINOR} etc instead of 0.2
 
class QgsAbstractLabelProvider;
 
namespace pal
{
  class Layer;
  class LabelPosition;
  class PalStat;
  class Problem;
  class PointSet;
 
  enum SearchMethod
  {
    CHAIN = 0, 
    POPMUSIC_TABU_CHAIN = 1, 
    POPMUSIC_TABU = 2, 
    POPMUSIC_CHAIN = 3, 
    FALP = 4 
  };
 
  class CORE_EXPORT Pal
  {
      friend class Problem;
      friend class FeaturePart;
      friend class Layer;
 
    public:
 
      Pal();
 
      ~Pal();
 
      Pal( const Pal &other ) = delete;
      Pal &operator=( const Pal &other ) = delete;
 
      Layer *addLayer( QgsAbstractLabelProvider *provider, const QString &layerName, QgsPalLayerSettings::Placement arrangement, double defaultPriority, bool active, bool toLabel, bool displayAll = false );
 
      void removeLayer( Layer *layer );
 
      typedef bool ( *FnIsCanceled )( void *ctx );
 
      void registerCancellationCallback( FnIsCanceled fnCanceled, void *context );
 
      inline bool isCanceled() { return fnIsCanceled ? fnIsCanceled( fnIsCanceledContext ) : false; }
 
      std::unique_ptr< Problem > extractProblem( const QgsRectangle &extent, const QgsGeometry &mapBoundary );
 
      QList<LabelPosition *> solveProblem( Problem *prob, bool displayAll, QList<pal::LabelPosition *> *unlabeled = nullptr );
 
      void setShowPartialLabels( bool show );
 
      bool showPartialLabels() const;
 
      double maximumLineCandidatesPerMapUnit() const { return mMaxLineCandidatesPerMapUnit; }
 
      void setMaximumLineCandidatesPerMapUnit( double candidates ) { mMaxLineCandidatesPerMapUnit = candidates; }
 
      double maximumPolygonCandidatesPerMapUnitSquared() const { return mMaxPolygonCandidatesPerMapUnitSquared; }
 
      void setMaximumPolygonCandidatesPerMapUnitSquared( double candidates ) { mMaxPolygonCandidatesPerMapUnitSquared = candidates; }
 
      QgsLabelingEngineSettings::PlacementEngineVersion placementVersion() const;
 
      void setPlacementVersion( QgsLabelingEngineSettings::PlacementEngineVersion placementVersion );
 
      int globalCandidatesLimitPoint() const { return mGlobalCandidatesLimitPoint; }
 
      int globalCandidatesLimitLine() const { return mGlobalCandidatesLimitLine; }
 
      int globalCandidatesLimitPolygon() const { return mGlobalCandidatesLimitPolygon; }
 
      bool candidatesAreConflicting( const LabelPosition *lp1, const LabelPosition *lp2 ) const;
 
    private:
 
      std::unordered_map< QgsAbstractLabelProvider *, std::unique_ptr< Layer > > mLayers;
 
      QMutex mMutex;
 
      /*
       * POPMUSIC Tuning
       */
      int mPopmusicR = 30;
 
      int mTabuMaxIt = 4;
      int mTabuMinIt = 2;
 
      int mEjChainDeg = 50;
      int mTenure = 10;
      double mCandListSize = 0.2;
 
      unsigned int mNextCandidateId = 1;
      mutable QHash< QPair< unsigned int, unsigned int >, bool > mCandidateConflicts;
 
      bool mShowPartialLabels = true;
 
      double mMaxLineCandidatesPerMapUnit = 0;
      double mMaxPolygonCandidatesPerMapUnitSquared = 0;
 
      int mGlobalCandidatesLimitPoint = 0;
      int mGlobalCandidatesLimitLine = 0;
      int mGlobalCandidatesLimitPolygon = 0;
 
      QgsLabelingEngineSettings::PlacementEngineVersion mPlacementVersion = QgsLabelingEngineSettings::PlacementEngineVersion2;
 
      FnIsCanceled fnIsCanceled = nullptr;
      void *fnIsCanceledContext = nullptr;
 
      std::unique_ptr< Problem > extract( const QgsRectangle &extent, const QgsGeometry &mapBoundary );
 
      void setPopmusicR( int r );
 
      void setMinIt( int min_it );
 
      void setMaxIt( int max_it );
 
      void setTenure( int tenure );
 
      void setEjChainDeg( int degree );
 
      void setCandListSize( double fact );
 
 
      int getMinIt();
 
      int getMaxIt();
 
  };
 
} // end namespace pal
 
#endif