PythonQtWrapper_QPolygonF.h
72 lines
| 3.5 KiB
| text/x-c
|
CLexer
florianlink
|
r13 | #ifndef PYTHONQTWRAPPER_QPOLYGONF_H | ||
#define PYTHONQTWRAPPER_QPOLYGONF_H | ||||
#include <qpolygon.h> | ||||
#include <QObject> | ||||
#include <QVariant> | ||||
#include <qdatastream.h> | ||||
#include <qlist.h> | ||||
#include <qpoint.h> | ||||
#include <qpolygon.h> | ||||
#include <qrect.h> | ||||
#include <qvector.h> | ||||
class PythonQtWrapper_QPolygonF : public QObject | ||||
{ Q_OBJECT | ||||
public: | ||||
public slots: | ||||
QPolygonF* new_QPolygonF(); | ||||
QPolygonF* new_QPolygonF(const QPolygon& a); | ||||
QPolygonF* new_QPolygonF(const QPolygonF& a); | ||||
QPolygonF* new_QPolygonF(const QRectF& r); | ||||
QPolygonF* new_QPolygonF(const QVector<QPointF >& v); | ||||
QPolygonF* new_QPolygonF(int size); | ||||
void delete_QPolygonF(QPolygonF* obj) { delete obj; } | ||||
void append(QPolygonF* theWrappedObject, const QPointF& t); | ||||
const QPointF& at(QPolygonF* theWrappedObject, int i) const; | ||||
QRectF boundingRect(QPolygonF* theWrappedObject) const; | ||||
int capacity(QPolygonF* theWrappedObject) const; | ||||
void clear(QPolygonF* theWrappedObject); | ||||
bool contains(QPolygonF* theWrappedObject, const QPointF& t) const; | ||||
bool containsPoint(QPolygonF* theWrappedObject, const QPointF& pt, Qt::FillRule fillRule) const; | ||||
int count(QPolygonF* theWrappedObject) const; | ||||
int count(QPolygonF* theWrappedObject, const QPointF& t) const; | ||||
bool empty(QPolygonF* theWrappedObject) const; | ||||
QVector<QPointF >& fill(QPolygonF* theWrappedObject, const QPointF& t, int size); | ||||
const QPointF& first(QPolygonF* theWrappedObject) const; | ||||
QVector<QPointF > static_QPolygonF_fromList(const QList<QPointF >& list); | ||||
int indexOf(QPolygonF* theWrappedObject, const QPointF& t, int from) const; | ||||
QPolygonF intersected(QPolygonF* theWrappedObject, const QPolygonF& r) const; | ||||
bool isClosed(QPolygonF* theWrappedObject) const; | ||||
bool isEmpty(QPolygonF* theWrappedObject) const; | ||||
const QPointF& last(QPolygonF* theWrappedObject) const; | ||||
int lastIndexOf(QPolygonF* theWrappedObject, const QPointF& t, int from) const; | ||||
QVector<QPointF > mid(QPolygonF* theWrappedObject, int pos, int length) const; | ||||
void writeTo(QPolygonF* theWrappedObject, QDataStream& stream); | ||||
bool operator_equal(QPolygonF* theWrappedObject, const QVector<QPointF >& v) const; | ||||
void readFrom(QPolygonF* theWrappedObject, QDataStream& stream); | ||||
void pop_back(QPolygonF* theWrappedObject); | ||||
void pop_front(QPolygonF* theWrappedObject); | ||||
void prepend(QPolygonF* theWrappedObject, const QPointF& t); | ||||
void push_back(QPolygonF* theWrappedObject, const QPointF& t); | ||||
void push_front(QPolygonF* theWrappedObject, const QPointF& t); | ||||
void remove(QPolygonF* theWrappedObject, int i); | ||||
void remove(QPolygonF* theWrappedObject, int i, int n); | ||||
void replace(QPolygonF* theWrappedObject, int i, const QPointF& t); | ||||
void reserve(QPolygonF* theWrappedObject, int size); | ||||
void resize(QPolygonF* theWrappedObject, int size); | ||||
void setSharable(QPolygonF* theWrappedObject, bool sharable); | ||||
int size(QPolygonF* theWrappedObject) const; | ||||
void squeeze(QPolygonF* theWrappedObject); | ||||
QPolygonF subtracted(QPolygonF* theWrappedObject, const QPolygonF& r) const; | ||||
QList<QPointF > toList(QPolygonF* theWrappedObject) const; | ||||
QPolygon toPolygon(QPolygonF* theWrappedObject) const; | ||||
void translate(QPolygonF* theWrappedObject, const QPointF& offset); | ||||
void translate(QPolygonF* theWrappedObject, qreal dx, qreal dy); | ||||
QPolygonF united(QPolygonF* theWrappedObject, const QPolygonF& r) const; | ||||
QPointF value(QPolygonF* theWrappedObject, int i) const; | ||||
QPointF value(QPolygonF* theWrappedObject, int i, const QPointF& defaultValue) const; | ||||
}; | ||||
#endif // PYTHONQTWRAPPER_QPOLYGONF_H | ||||