qgsalgorithmjoinbynearest.h

Go to the documentation of this file.

/***************************************************************************
                         qgsalgorithmjoinbynearest.h
                         ---------------------
    begin                : April 2017
    copyright            : (C) 2017 by Nyall Dawson
    email                : nyall dot dawson at gmail dot com
 ***************************************************************************/
 
/***************************************************************************
 *                                                                         *
 *   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 QGSALGORITHMJOINBYNEAREST_H
#define QGSALGORITHMJOINBYNEAREST_H
 
#define SIP_NO_FILE
 
#include "qgis_sip.h"
#include "qgsprocessingalgorithm.h"
 
 
class QgsJoinByNearestAlgorithm : public QgsProcessingAlgorithm
{
 
  public:
 
    QgsJoinByNearestAlgorithm() = default;
    void initAlgorithm( const QVariantMap &configuration = QVariantMap() ) override;
    QString name() const override;
    QString displayName() const override;
    QStringList tags() const override;
    QString group() const override;
    QString groupId() const override;
    QString shortHelpString() const override;
    QString shortDescription() const override;
    Qgis::ProcessingAlgorithmDocumentationFlags documentationFlags() const override;
    QgsJoinByNearestAlgorithm *createInstance() const override SIP_FACTORY;
 
  protected:
 
    QVariantMap processAlgorithm( const QVariantMap &parameters,
                                  QgsProcessingContext &context, QgsProcessingFeedback *feedback ) override;
 
};
 
 
#endif // QGSALGORITHMJOINBYNEAREST_H