qgsrectangle.h

Go to the documentation of this file.

/***************************************************************************
                          qgsrectangle.h  -  description
                             -------------------
    begin                : Sat Jun 22 2002
    copyright            : (C) 2002 by Gary E.Sherman
    email                : sherman at mrcc.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 QGSRECTANGLE_H
#define QGSRECTANGLE_H
 
#include <iosfwd>
 
#include "qgis.h"
#include "qgis_core.h"
#include "qgspointxy.h"
 
#include <QDomDocument>
#include <QRectF>
#include <QString>
 
using namespace Qt::StringLiterals;
 
class QString;
class QRectF;
class QgsBox3D;
 

class CORE_EXPORT QgsRectangle
{
    Q_GADGET
 
    Q_PROPERTY( double xMinimum READ xMinimum WRITE setXMinimum )
    Q_PROPERTY( double xMaximum READ xMaximum WRITE setXMaximum )
    Q_PROPERTY( double yMinimum READ yMinimum WRITE setYMinimum )
    Q_PROPERTY( double yMaximum READ yMaximum WRITE setYMaximum )
    Q_PROPERTY( double width READ width )
    Q_PROPERTY( double height READ height )
    Q_PROPERTY( double area READ area )
    Q_PROPERTY( double perimeter READ perimeter )
    Q_PROPERTY( QgsPointXY center READ center )
    Q_PROPERTY( bool isEmpty READ isEmpty )
    Q_PROPERTY( bool isNull READ isNull )
    Q_PROPERTY( bool isValid READ isValid )
 
  public:
    QgsRectangle() = default; // optimised constructor for null rectangle - no need to call normalize here
 
    // clang-format off
    explicit QgsRectangle( double xMin, double yMin = 0, double xMax = 0, double yMax = 0, bool normalize = true ) SIP_HOLDGIL
      // clang-format on
  : mXmin( xMin )
    , mYmin( yMin )
    , mXmax( xMax )
    , mYmax( yMax )
    {
      if ( normalize )
        QgsRectangle::normalize();
    }

    QgsRectangle( const QgsPointXY &p1, const QgsPointXY &p2, bool normalize = true ) SIP_HOLDGIL
    {
      set( p1, p2, normalize );
    }

    QgsRectangle( const QRectF &qRectF ) SIP_HOLDGIL
    {
      mXmin = qRectF.topLeft().x();
      mYmin = qRectF.topLeft().y();
      mXmax = qRectF.bottomRight().x();
      mYmax = qRectF.bottomRight().y();
    }
 
    QgsRectangle( const QgsRectangle &other ) SIP_HOLDGIL
    {
      mXmin = other.xMinimum();
      mYmin = other.yMinimum();
      mXmax = other.xMaximum();
      mYmax = other.yMaximum();
    }
 
    // IMPORTANT - while QgsRectangle is inherited by QgsReferencedRectangle, we do NOT want a virtual destructor here
    // because this class MUST be lightweight and we don't want the cost of the vtable here.
    // see https://github.com/qgis/QGIS/pull/4720#issuecomment-308652392
    ~QgsRectangle() = default;

    static QgsRectangle fromWkt( const QString &wkt );

    static QgsRectangle fromCenterAndSize( const QgsPointXY &center, double width, double height );

    static QgsRectangle fromEdges( double left, double top, double right, double bottom );

    void set( const QgsPointXY &p1, const QgsPointXY &p2, bool normalize = true )
    {
      mXmin = p1.x();
      mXmax = p2.x();
      mYmin = p1.y();
      mYmax = p2.y();
      if ( normalize )
        QgsRectangle::normalize();
    }

    void set( double xMin, double yMin, double xMax, double yMax, bool normalize = true )
    {
      mXmin = xMin;
      mYmin = yMin;
      mXmax = xMax;
      mYmax = yMax;
      if ( normalize )
        QgsRectangle::normalize();
    }

    void setXMinimum( double x ) SIP_HOLDGIL { mXmin = x; }

    void setXMaximum( double x ) SIP_HOLDGIL { mXmax = x; }

    void setYMinimum( double y ) SIP_HOLDGIL { mYmin = y; }

    void setYMaximum( double y ) SIP_HOLDGIL { mYmax = y; }

    void setNull() SIP_HOLDGIL
    {
      mXmin = mYmin = std::numeric_limits<double>::max();
      mXmax = mYmax = -std::numeric_limits<double>::max();
    }

    Q_DECL_DEPRECATED void setMinimal() SIP_DEPRECATED
    {
      setNull();
    }

    double xMaximum() const SIP_HOLDGIL { return mXmax; }

    double xMinimum() const SIP_HOLDGIL { return mXmin; }

    double yMaximum() const SIP_HOLDGIL { return mYmax; }

    double yMinimum() const SIP_HOLDGIL { return mYmin; }

    double left() const SIP_HOLDGIL { return mXmin; }

    double right() const SIP_HOLDGIL { return mXmax; }

    double top() const SIP_HOLDGIL { return mYmax; }

    double bottom() const SIP_HOLDGIL { return mYmin; }

    void normalize()
    {
      if ( isNull() )
        return;
 
      if ( mXmin > mXmax )
      {
        std::swap( mXmin, mXmax );
      }
      if ( mYmin > mYmax )
      {
        std::swap( mYmin, mYmax );
      }
    }

    double width() const SIP_HOLDGIL { return mXmax - mXmin; }

    double height() const SIP_HOLDGIL { return mYmax - mYmin; }

    double area() const SIP_HOLDGIL { return ( mXmax - mXmin ) * ( mYmax - mYmin ); }

    double perimeter() const SIP_HOLDGIL { return 2 * ( mXmax - mXmin ) + 2 * ( mYmax - mYmin ); }

    QgsPointXY center() const SIP_HOLDGIL { return QgsPointXY( mXmax * 0.5 + mXmin * 0.5, mYmin * 0.5 + mYmax * 0.5 ); }

    void scale( double scaleFactor, const QgsPointXY *c = nullptr )
    {
      // scale from the center
      double centerX, centerY;
      if ( c )
      {
        centerX = c->x();
        centerY = c->y();
      }
      else
      {
        centerX = mXmin + width() / 2;
        centerY = mYmin + height() / 2;
      }
      scale( scaleFactor, centerX, centerY );
    }

    void scale( double scaleFactor, double centerX, double centerY )
    {
      const double newWidth = width() * scaleFactor;
      const double newHeight = height() * scaleFactor;
      mXmin = centerX - newWidth / 2.0;
      mXmax = centerX + newWidth / 2.0;
      mYmin = centerY - newHeight / 2.0;
      mYmax = centerY + newHeight / 2.0;
    }

    QgsRectangle scaled( double scaleFactor, const QgsPointXY *center = nullptr ) const;

    void grow( double delta )
    {
      if ( isNull() )
        return;
      mXmin -= delta;
      mXmax += delta;
      mYmin -= delta;
      mYmax += delta;
    }

    void include( const QgsPointXY &p )
    {
      if ( isNull() )
      {
        setXMinimum( p.x() );
        setXMaximum( p.x() );
        setYMinimum( p.y() );
        setYMaximum( p.y() );
        return;
      }
      if ( p.x() < xMinimum() )
        setXMinimum( p.x() );
      if ( p.x() > xMaximum() )
        setXMaximum( p.x() );
      if ( p.y() < yMinimum() )
        setYMinimum( p.y() );
      if ( p.y() > yMaximum() )
        setYMaximum( p.y() );
    }

    QgsRectangle buffered( double width ) const
    {
      if ( isNull() )
        return QgsRectangle();
      return QgsRectangle( mXmin - width, mYmin - width, mXmax + width, mYmax + width );
    }

    QgsRectangle intersect( const QgsRectangle &rect ) const
    {
      QgsRectangle intersection = QgsRectangle();
      if ( intersects( rect ) )
      {
        intersection.setXMinimum( mXmin > rect.xMinimum() ? mXmin : rect.xMinimum() );
        intersection.setXMaximum( mXmax < rect.xMaximum() ? mXmax : rect.xMaximum() );
        intersection.setYMinimum( mYmin > rect.yMinimum() ? mYmin : rect.yMinimum() );
        intersection.setYMaximum( mYmax < rect.yMaximum() ? mYmax : rect.yMaximum() );
      }
      return intersection;
    }

    bool intersects( const QgsRectangle &rect ) const SIP_HOLDGIL
    {
      if ( isNull() || rect.isNull() )
      {
        return false;
      }
 
      const double x1 = ( mXmin > rect.mXmin ? mXmin : rect.mXmin );
      const double x2 = ( mXmax < rect.mXmax ? mXmax : rect.mXmax );
      if ( x1 > x2 )
        return false;
      const double y1 = ( mYmin > rect.mYmin ? mYmin : rect.mYmin );
      const double y2 = ( mYmax < rect.mYmax ? mYmax : rect.mYmax );
      return y1 <= y2;
    }

    bool contains( const QgsRectangle &rect ) const SIP_HOLDGIL
    {
      // simple case, both rectangles are normalized
      if ( isNormalized() && rect.isNormalized() )
      {
        return qgsDoubleGreaterThanOrNear( rect.mXmin, mXmin ) && qgsDoubleLessThanOrNear( rect.mXmax, mXmax )
               && qgsDoubleGreaterThanOrNear( rect.mYmin, mYmin ) && qgsDoubleLessThanOrNear( rect.mYmax, mYmax );
      }
      else
      {
        return containsRange(mXmin, mXmax, rect.mXmin, rect.mXmax) && containsRange(mYmin, mYmax, rect.mYmin, rect.mYmax);
      }
    }

    bool contains( const QgsPointXY &p ) const SIP_HOLDGIL
    {
      return mXmin <= p.x() && p.x() <= mXmax &&
             mYmin <= p.y() && p.y() <= mYmax;
    }

    bool contains( double x, double y ) const SIP_HOLDGIL
    {
      return mXmin <= x && x <= mXmax &&
             mYmin <= y && y <= mYmax;
    }

    void combineExtentWith( const QgsRectangle &rect )
    {
      if ( isNull() )
        *this = rect;
      else if ( !rect.isNull() )
      {
        mXmin = std::min( mXmin, rect.xMinimum() );
        mXmax = std::max( mXmax, rect.xMaximum() );
        mYmin = std::min( mYmin, rect.yMinimum() );
        mYmax = std::max( mYmax, rect.yMaximum() );
      }
    }

    void combineExtentWith( double x, double y )
    {
      if ( isNull() )
        *this = QgsRectangle( x, y, x, y );
      else
      {
        mXmin = ( ( mXmin < x ) ? mXmin : x );
        mXmax = ( ( mXmax > x ) ? mXmax : x );
 
        mYmin = ( ( mYmin < y ) ? mYmin : y );
        mYmax = ( ( mYmax > y ) ? mYmax : y );
      }
    }

    void combineExtentWith( const QgsPointXY &point )
    {
      combineExtentWith( point.x(), point.y() );
    }

    double distance( const QgsPointXY &point ) const
    {
      const double dx = std::max( std::max( mXmin - point.x(), 0.0 ), point.x() - mXmax );
      const double dy = std::max( std::max( mYmin - point.y(), 0.0 ), point.y() - mYmax );
      return std::sqrt( dx * dx + dy * dy );
    }

    QgsRectangle operator-( QgsVector v ) const;

    QgsRectangle operator+( QgsVector v ) const;

    QgsRectangle &operator-=( QgsVector v );

    QgsRectangle &operator+=( QgsVector v );

    bool isEmpty() const
    {
      return isNull() || qgsDoubleNear( mXmax, mXmin ) || qgsDoubleNear( mYmax, mYmin );
    }

    bool isPoint() const
    {
      return qgsDoubleNear( mXmax, mXmin ) && qgsDoubleNear( mYmax, mYmin ) && !isNull();
    }

    bool isNormalized() const
    {
      return qgsDoubleLessThanOrNear( mXmin, mXmax ) && qgsDoubleLessThanOrNear( mYmin, mYmax );
    }

    bool isNull() const
    {
      // rectangle created QgsRectangle() or with rect.setNull() or
      // otherwise having NaN ordinates
      return ( std::isnan( mXmin )  && std::isnan( mXmax ) && std::isnan( mYmin ) && std::isnan( mYmax ) ) ||
             ( qgsDoubleNear( mXmin, std::numeric_limits<double>::max() ) && qgsDoubleNear( mYmin, std::numeric_limits<double>::max() ) &&
               qgsDoubleNear( mXmax, -std::numeric_limits<double>::max() ) && qgsDoubleNear( mYmax, -std::numeric_limits<double>::max() ) );
    }

    bool isValid() const
    {
      if ( ( !isFinite() ) || ( mXmax <= mXmin ) || ( mYmax <= mYmin ) )
      {
        return false;
      }
      return true;
    }

    bool isMaximal() const
    {
      return ( std::isinf( mXmin ) || mXmin == std::numeric_limits<double>::lowest() )
             && ( std::isinf( mYmin ) || mYmin == std::numeric_limits<double>::lowest() )
             && ( std::isinf( mXmax ) || mXmax == std::numeric_limits<double>::max() )
             && ( std::isinf( mYmax ) || mYmax == std::numeric_limits<double>::max() );
    }

    Q_INVOKABLE QString asWktCoordinates() const;

    Q_INVOKABLE QString asWktPolygon() const;

    QRectF toRectF() const
    {
      return QRectF( static_cast< qreal >( mXmin ), static_cast< qreal >( mYmin ), static_cast< qreal >( mXmax - mXmin ), static_cast< qreal >( mYmax - mYmin ) );
    }

    Q_INVOKABLE QString toString( int precision = 16 ) const;

    QString asPolygon() const;
 
    bool operator==( const QgsRectangle &r1 ) const
    {
      if ( isNull() ) return r1.isNull();
 
      return qgsDoubleNear( r1.xMaximum(), xMaximum() ) &&
             qgsDoubleNear( r1.xMinimum(), xMinimum() ) &&
             qgsDoubleNear( r1.yMaximum(), yMaximum() ) &&
             qgsDoubleNear( r1.yMinimum(), yMinimum() );
    }
 
    bool operator!=( const QgsRectangle &r1 ) const
    {
      return ( ! operator==( r1 ) );
    }
 
    QgsRectangle &operator=( const QgsRectangle &r1 )
    {
      if ( &r1 != this )
      {
        mXmax = r1.xMaximum();
        mXmin = r1.xMinimum();
        mYmax = r1.yMaximum();
        mYmin = r1.yMinimum();
      }
 
      return *this;
    }

    bool isFinite() const
    {
      if ( std::isinf( mXmin ) || std::isinf( mYmin ) || std::isinf( mXmax ) || std::isinf( mYmax ) )
      {
        return false;
      }
      if ( std::isnan( mXmin ) || std::isnan( mYmin ) || std::isnan( mXmax ) || std::isnan( mYmax ) )
      {
        return false;
      }
      return true;
    }

    void invert()
    {
      std::swap( mXmin, mYmin );
      std::swap( mXmax, mYmax );
    }

    QgsBox3D toBox3d( double zMin, double zMax ) const;

    std::pair< QgsRectangle, QgsRectangle > splitAtAntimeridian() const;

    operator QVariant() const
    {
      return QVariant::fromValue( *this );
    }

    QgsRectangle snappedToGrid( double spacing ) const;
 
#ifdef SIP_RUN
// clang-format off
    SIP_PYOBJECT __repr__();
    % MethodCode
    QString str;
    if ( sipCpp->isNull() )
      str = u"<QgsRectangle()>"_s;
    else
      str = u"<QgsRectangle: %1>"_s.arg( sipCpp->asWktCoordinates() );
    sipRes = PyUnicode_FromString( str.toUtf8().constData() );
    % End
// clang-format on
#endif
 
  private:
 
    double mXmin = std::numeric_limits<double>::max();
    double mYmin = std::numeric_limits<double>::max();
    double mXmax = -std::numeric_limits<double>::max();
    double mYmax = -std::numeric_limits<double>::max();

    static bool containsRange(double aMin, double aMax, double bMin, double bMax)
    {
      const bool aNormalized = (aMax >= aMin);
      const bool bNormalized = (bMax >= bMin);
 
      if (aNormalized && bNormalized)
      {
        // both ranges normal, nice and easy
        return qgsDoubleGreaterThanOrNear( bMin, aMin ) && qgsDoubleLessThanOrNear( bMax, aMax );
      }
      else if (!aNormalized && bNormalized)
      {
        return qgsDoubleGreaterThanOrNear( bMin, aMin ) || qgsDoubleLessThanOrNear( bMax, aMax );
      }
      else if ( aNormalized && !bNormalized )
      {
        // a cannot possibly contain b
        return false;
      }
      else {
        // both non-normalized
        return qgsDoubleLessThanOrNear( aMin, bMin ) && qgsDoubleGreaterThanOrNear( aMax, bMax );
      }
    }
 
};
 
Q_DECLARE_METATYPE( QgsRectangle )
 
#ifndef SIP_RUN

CORE_EXPORT QDataStream &operator<<( QDataStream &out, const QgsRectangle &rectangle );

CORE_EXPORT QDataStream &operator>>( QDataStream &in, QgsRectangle &rectangle );
 
inline std::ostream &operator << ( std::ostream &os, const QgsRectangle &r )
{
  return os << r.toString().toLocal8Bit().data();
}
 
#endif
 
#endif // QGSRECTANGLE_H