PythonQtWrapper_QPolygon.h
71 lines
| 3.3 KiB
| text/x-c
|
CLexer
|
r13 | #ifndef PYTHONQTWRAPPER_QPOLYGON_H | ||
#define PYTHONQTWRAPPER_QPOLYGON_H | ||||
#include <qpolygon.h> | ||||
#include <QObject> | ||||
|
r24 | #include <PythonQt.h> | ||
|
r13 | #include <QVariant> | ||
#include <qdatastream.h> | ||||
#include <qlist.h> | ||||
#include <qpoint.h> | ||||
#include <qpolygon.h> | ||||
#include <qrect.h> | ||||
#include <qvector.h> | ||||
class PythonQtWrapper_QPolygon : public QObject | ||||
{ Q_OBJECT | ||||
public: | ||||
public slots: | ||||
QPolygon* new_QPolygon(); | ||||
QPolygon* new_QPolygon(const QPolygon& a); | ||||
QPolygon* new_QPolygon(const QRect& r, bool closed = false); | ||||
QPolygon* new_QPolygon(const QVector<QPoint >& v); | ||||
QPolygon* new_QPolygon(int size); | ||||
void delete_QPolygon(QPolygon* obj) { delete obj; } | ||||
|
r28 | void resize(QPolygon* theWrappedObject, int size); | ||
void pop_front(QPolygon* theWrappedObject); | ||||
void reserve(QPolygon* theWrappedObject, int size); | ||||
QPolygon subtracted(QPolygon* theWrappedObject, const QPolygon& r) const; | ||||
QRect boundingRect(QPolygon* theWrappedObject) const; | ||||
QVector<QPoint > mid(QPolygon* theWrappedObject, int pos, int length) const; | ||||
void setSharable(QPolygon* theWrappedObject, bool sharable); | ||||
|
r24 | void remove(QPolygon* theWrappedObject, int i, int n); | ||
|
r28 | void writeTo(QPolygon* theWrappedObject, QDataStream& stream); | ||
void remove(QPolygon* theWrappedObject, int i); | ||||
void replace(QPolygon* theWrappedObject, int i, const QPoint& t); | ||||
void readFrom(QPolygon* theWrappedObject, QDataStream& stream); | ||||
void push_back(QPolygon* theWrappedObject, const QPoint& t); | ||||
int indexOf(QPolygon* theWrappedObject, const QPoint& t, int from) const; | ||||
|
r24 | void pop_back(QPolygon* theWrappedObject); | ||
|
r28 | void clear(QPolygon* theWrappedObject); | ||
bool operator_equal(QPolygon* theWrappedObject, const QVector<QPoint >& v) const; | ||||
|
r24 | QPoint value(QPolygon* theWrappedObject, int i, const QPoint& defaultValue) const; | ||
|
r28 | bool empty(QPolygon* theWrappedObject) const; | ||
const QPoint& first(QPolygon* theWrappedObject) const; | ||||
|
r13 | void squeeze(QPolygon* theWrappedObject); | ||
|
r24 | QVector<QPoint >& fill(QPolygon* theWrappedObject, const QPoint& t, int size); | ||
|
r28 | void prepend(QPolygon* theWrappedObject, const QPoint& t); | ||
void translate(QPolygon* theWrappedObject, int dx, int dy); | ||||
QList<QPoint > toList(QPolygon* theWrappedObject) const; | ||||
|
r13 | QPoint value(QPolygon* theWrappedObject, int i) const; | ||
|
r28 | int count(QPolygon* theWrappedObject, const QPoint& t) const; | ||
void translate(QPolygon* theWrappedObject, const QPoint& offset); | ||||
QPolygon united(QPolygon* theWrappedObject, const QPolygon& r) const; | ||||
int count(QPolygon* theWrappedObject) const; | ||||
int capacity(QPolygon* theWrappedObject) const; | ||||
void append(QPolygon* theWrappedObject, const QPoint& t); | ||||
QVector<QPoint > static_QPolygon_fromList(const QList<QPoint >& list); | ||||
bool isEmpty(QPolygon* theWrappedObject) const; | ||||
void push_front(QPolygon* theWrappedObject, const QPoint& t); | ||||
const QPoint& at(QPolygon* theWrappedObject, int i) const; | ||||
|
r24 | bool contains(QPolygon* theWrappedObject, const QPoint& t) const; | ||
int lastIndexOf(QPolygon* theWrappedObject, const QPoint& t, int from) const; | ||||
int size(QPolygon* theWrappedObject) const; | ||||
|
r28 | const QPoint& last(QPolygon* theWrappedObject) const; | ||
QPolygon intersected(QPolygon* theWrappedObject, const QPolygon& r) const; | ||||
bool containsPoint(QPolygon* theWrappedObject, const QPoint& pt, Qt::FillRule fillRule) const; | ||||
|
r13 | }; | ||
#endif // PYTHONQTWRAPPER_QPOLYGON_H | ||||