/**************************************************************************** ** ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). ** Contact: Nokia Corporation (qt-info@nokia.com) ** ** This file is part of the QtGui module of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:LGPL$ ** No Commercial Usage ** This file contains pre-release code and may not be distributed. ** You may use this file in accordance with the terms and conditions ** contained in the either Technology Preview License Agreement or the ** Beta Release License Agreement. ** ** GNU Lesser General Public License Usage ** Alternatively, this file may be used under the terms of the GNU Lesser ** General Public License version 2.1 as published by the Free Software ** Foundation and appearing in the file LICENSE.LGPL included in the ** packaging of this file. Please review the following information to ** ensure the GNU Lesser General Public License version 2.1 requirements ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. ** ** In addition, as a special exception, Nokia gives you certain ** additional rights. These rights are described in the Nokia Qt LGPL ** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this ** package. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU ** General Public License version 3.0 as published by the Free Software ** Foundation and appearing in the file LICENSE.GPL included in the ** packaging of this file. Please review the following information to ** ensure the GNU General Public License version 3.0 requirements will be ** met: http://www.gnu.org/copyleft/gpl.html. ** ** If you are unsure which license is appropriate for your use, please ** contact the sales department at http://qt.nokia.com/contact. ** $QT_END_LICENSE$ ** ****************************************************************************/ #ifndef QPOLYGON_H #define QPOLYGON_H #include #include #include QT_BEGIN_HEADER QT_BEGIN_NAMESPACE QT_MODULE(Gui) class QMatrix; class QTransform; class QRect; class QVariant; class Q_GUI_EXPORT QPolygon : public QVector { public: inline QPolygon() {} inline ~QPolygon() {} inline QPolygon(int size); inline QPolygon(const QPolygon &a) : QVector(a) {} inline QPolygon(const QVector &v) : QVector(v) {} QPolygon(const QRect &r, bool closed=false); QPolygon(int nPoints, const int *points); operator QVariant() const; void translate(int dx, int dy); void translate(const QPoint &offset); QPolygon translated(int dx, int dy) const; inline QPolygon translated(const QPoint &offset) const; QRect boundingRect() const; void point(int i, int *x, int *y) const; QPoint point(int i) const; void setPoint(int index, int x, int y); void setPoint(int index, const QPoint &p); void setPoints(int nPoints, const int *points); void setPoints(int nPoints, int firstx, int firsty, ...); void putPoints(int index, int nPoints, const int *points); void putPoints(int index, int nPoints, int firstx, int firsty, ...); void putPoints(int index, int nPoints, const QPolygon & from, int fromIndex=0); bool containsPoint(const QPoint &pt, Qt::FillRule fillRule) const; QPolygon united(const QPolygon &r) const; QPolygon intersected(const QPolygon &r) const; QPolygon subtracted(const QPolygon &r) const; }; inline QPolygon::QPolygon(int asize) : QVector(asize) {} #ifndef QT_NO_DEBUG_STREAM Q_GUI_EXPORT QDebug operator<<(QDebug, const QPolygon &); #endif /***************************************************************************** QPolygon stream functions *****************************************************************************/ #ifndef QT_NO_DATASTREAM Q_GUI_EXPORT QDataStream &operator<<(QDataStream &stream, const QPolygon &polygon); Q_GUI_EXPORT QDataStream &operator>>(QDataStream &stream, QPolygon &polygon); #endif /***************************************************************************** Misc. QPolygon functions *****************************************************************************/ inline void QPolygon::setPoint(int index, const QPoint &pt) { (*this)[index] = pt; } inline void QPolygon::setPoint(int index, int x, int y) { (*this)[index] = QPoint(x, y); } inline QPoint QPolygon::point(int index) const { return at(index); } inline void QPolygon::translate(const QPoint &offset) { translate(offset.x(), offset.y()); } inline QPolygon QPolygon::translated(const QPoint &offset) const { return translated(offset.x(), offset.y()); } class QRectF; class Q_GUI_EXPORT QPolygonF : public QVector { public: inline QPolygonF() {} inline ~QPolygonF() {} inline QPolygonF(int size); inline QPolygonF(const QPolygonF &a) : QVector(a) {} inline QPolygonF(const QVector &v) : QVector(v) {} QPolygonF(const QRectF &r); QPolygonF(const QPolygon &a); inline void translate(qreal dx, qreal dy); void translate(const QPointF &offset); inline QPolygonF translated(qreal dx, qreal dy) const; QPolygonF translated(const QPointF &offset) const; QPolygon toPolygon() const; bool isClosed() const { return !isEmpty() && first() == last(); } QRectF boundingRect() const; bool containsPoint(const QPointF &pt, Qt::FillRule fillRule) const; QPolygonF united(const QPolygonF &r) const; QPolygonF intersected(const QPolygonF &r) const; QPolygonF subtracted(const QPolygonF &r) const; }; inline QPolygonF::QPolygonF(int asize) : QVector(asize) {} #ifndef QT_NO_DEBUG_STREAM Q_GUI_EXPORT QDebug operator<<(QDebug, const QPolygonF &); #endif /***************************************************************************** QPolygonF stream functions *****************************************************************************/ #ifndef QT_NO_DATASTREAM Q_GUI_EXPORT QDataStream &operator<<(QDataStream &stream, const QPolygonF &array); Q_GUI_EXPORT QDataStream &operator>>(QDataStream &stream, QPolygonF &array); #endif inline void QPolygonF::translate(qreal dx, qreal dy) { translate(QPointF(dx, dy)); } inline QPolygonF QPolygonF::translated(qreal dx, qreal dy) const { return translated(QPointF(dx, dy)); } QT_END_NAMESPACE QT_END_HEADER #endif // QPOLYGON_H