diff options
author | Timothy Pearson <[email protected]> | 2011-11-29 01:11:08 -0600 |
---|---|---|
committer | Timothy Pearson <[email protected]> | 2011-11-29 01:11:08 -0600 |
commit | 8a055d66f43592c257cece2eb8cc021808062917 (patch) | |
tree | d0922f201bd5d24b62a33160d1d9baf9e89f9a70 /sip/qt/qpointarray.sip | |
parent | b388516ca2691303a076a0764fd40bf7116fe43d (diff) | |
download | pytqt-8a055d66f43592c257cece2eb8cc021808062917.tar.gz pytqt-8a055d66f43592c257cece2eb8cc021808062917.zip |
Initial TQt conversion
Diffstat (limited to 'sip/qt/qpointarray.sip')
-rw-r--r-- | sip/qt/qpointarray.sip | 100 |
1 files changed, 50 insertions, 50 deletions
diff --git a/sip/qt/qpointarray.sip b/sip/qt/qpointarray.sip index c88b56b..f0daeea 100644 --- a/sip/qt/qpointarray.sip +++ b/sip/qt/qpointarray.sip @@ -1,31 +1,31 @@ -// This is the SIP interface definition for QPointArray. +// This is the SIP interface definition for TQPointArray. // // Copyright (c) 2007 // Riverbank Computing Limited <[email protected]> // -// This file is part of PyQt. +// This file is part of PyTQt. // -// This copy of PyQt is free software; you can redistribute it and/or modify it +// This copy of PyTQt 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, or (at your option) any later // version. // -// PyQt is supplied in the hope that it will be useful, but WITHOUT ANY +// PyTQt is supplied in the hope that it will be useful, but WITHOUT ANY // WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS // FOR A PARTICULAR PURPOSE. See the GNU General Public License for more // details. // // You should have received a copy of the GNU General Public License along with -// PyQt; see the file LICENSE. If not, write to the Free Software Foundation, +// PyTQt; see the file LICENSE. If not, write to the Free Software Foundation, // Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. %ExportedDoc -<Sect2><Title>QPointArray</Title> +<Sect2><Title>TQPointArray</Title> <FuncSynopsis> - <FuncDef><Function>QPointArray</Function></FuncDef> + <FuncDef><Function>TQPointArray</Function></FuncDef> <ParamDef>int <Parameter>nPoints</Parameter></ParamDef> - <ParamDef>const QCOORD *<Parameter>points</Parameter></ParamDef> + <ParamDef>const TQCOORD *<Parameter>points</Parameter></ParamDef> </FuncSynopsis> <Para> This takes a single parameter which is a list of points. @@ -46,7 +46,7 @@ This takes the single parameter <Literal>i</Literal> and returns the <FuncDef>bool <Function>putPoints</Function></FuncDef> <ParamDef>int <Parameter>index</Parameter></ParamDef> <ParamDef>int <Parameter>nPoints</Parameter></ParamDef> - <ParamDef>const QCOORD *<Parameter>points</Parameter></ParamDef> + <ParamDef>const TQCOORD *<Parameter>points</Parameter></ParamDef> </FuncSynopsis> <Para> This takes two parameters, <Literal>index</Literal> and a list of points. @@ -67,7 +67,7 @@ Not implemented. <FuncSynopsis> <FuncDef>bool <Function>setPoints</Function></FuncDef> <ParamDef>int <Parameter>nPoints</Parameter></ParamDef> - <ParamDef>const QCOORD *<Parameter>points</Parameter></ParamDef> + <ParamDef>const TQCOORD *<Parameter>points</Parameter></ParamDef> </FuncSynopsis> <Para> This takes a single parameter which is a list of points. @@ -87,20 +87,20 @@ Not implemented. %End -class QPointArray +class TQPointArray { %TypeHeaderCode #include <qpointarray.h> %End %TypeCode -// Convert a list of numbers to an array on QCOORDs on the heap. +// Convert a list of numbers to an array on TQCOORDs on the heap. -static QCOORD *getPoints(int nrpnts,PyObject *pntlist) +static TQCOORD *getPoints(int nrpnts,PyObject *pntlist) { - QCOORD *pnts, *pp; + TQCOORD *pnts, *pp; - if ((pnts = (QCOORD *)sipMalloc(nrpnts * sizeof (QCOORD))) == NULL) + if ((pnts = (TQCOORD *)sipMalloc(nrpnts * sizeof (TQCOORD))) == NULL) return NULL; // Convert the list. @@ -109,7 +109,7 @@ static QCOORD *getPoints(int nrpnts,PyObject *pntlist) for (int i = 0; i < nrpnts; ++i) { - *pp++ = (QCOORD)PyInt_AsLong(PyList_GetItem(pntlist,i)); + *pp++ = (TQCOORD)PyInt_AsLong(PyList_GetItem(pntlist,i)); if (PyErr_Occurred() != NULL) { @@ -123,17 +123,17 @@ static QCOORD *getPoints(int nrpnts,PyObject *pntlist) %End public: - QPointArray(); - QPointArray(int); - QPointArray(const QPointArray &); - QPointArray(const QRect &,bool = 0); + TQPointArray(); + TQPointArray(int); + TQPointArray(const TQPointArray &); + TQPointArray(const TQRect &,bool = 0); - QPointArray(SIP_PYLIST) [(int,const QCOORD *)]; + TQPointArray(SIP_PYLIST) [(int,const TQCOORD *)]; %MethodCode - // The Python interface is a list of QCOORDs. + // The Python interface is a list of TQCOORDs. int nrpnts; - QCOORD *pnts; + TQCOORD *pnts; nrpnts = PyList_GET_SIZE(a0); @@ -141,31 +141,31 @@ public: sipIsErr = 1; else { - // No wrapper class for QPointArray. + // No wrapper class for TQPointArray. Py_BEGIN_ALLOW_THREADS - sipCpp = new QPointArray(nrpnts / 2,pnts); + sipCpp = new TQPointArray(nrpnts / 2,pnts); Py_END_ALLOW_THREADS sipFree((ANY *)pnts); } %End - QPointArray copy() const; + TQPointArray copy() const; void translate(int,int); - QRect boundingRect() const; + TQRect boundingRect() const; void point(uint,int *,int *) const; // This is hidden by the above. It would probably be better to remove // the one above, but that would break backwards compatibility. - //QPoint point(uint) const; + //TQPoint point(uint) const; void setPoint(uint,int,int); - void setPoint(uint,const QPoint &); + void setPoint(uint,const TQPoint &); bool setPoints(SIP_PYLIST); %MethodCode int nrpnts; - QCOORD *pnts; + TQCOORD *pnts; nrpnts = PyList_GET_SIZE(a0); @@ -186,7 +186,7 @@ public: bool putPoints(int,SIP_PYLIST); %MethodCode int nrpnts; - QCOORD *pnts; + TQCOORD *pnts; nrpnts = PyList_GET_SIZE(a1); @@ -203,29 +203,29 @@ public: %End // bool putPoints(int,int,int,int,...); -%If (Qt_3_0_0 -) - bool putPoints(int,int,const QPointArray &,int = 0); +%If (TQt_3_0_0 -) + bool putPoints(int,int,const TQPointArray &,int = 0); %End -%If (- Qt_2_00) - QPoint at(uint) const; +%If (- TQt_2_00) + TQPoint at(uint) const; %End void makeArc(int,int,int,int,int,int); void makeEllipse(int,int,int,int); -%If (Qt_TRANSFORMATIONS) -%If (Qt_2_00 -) - void makeArc(int,int,int,int,int,int,const QWMatrix &); +%If (TQt_TRANSFORMATIONS) +%If (TQt_2_00 -) + void makeArc(int,int,int,int,int,int,const TQWMatrix &); %End %End -%If (- Qt_3_0_0) - QPointArray quadBezier() const; +%If (- TQt_3_0_0) + TQPointArray quadBezier() const; %End -%If (Qt_3_0_0 -) - QPointArray cubicBezier() const; +%If (TQt_3_0_0 -) + TQPointArray cubicBezier() const; %End - // These are actually in QArray, which isn't implemented so pretend + // These are actually in TQArray, which isn't implemented so pretend // they are here. uint nrefs() const; @@ -234,14 +234,14 @@ public: bool resize(uint); uint size() const; bool truncate(uint); - bool fill(const QPoint &,int = -1); -%If (Qt_2_00 -) - QPoint &at(uint) const; + bool fill(const TQPoint &,int = -1); +%If (TQt_2_00 -) + TQPoint &at(uint) const; %End -%If (Qt_2_1_0 -) +%If (TQt_2_1_0 -) void sort(); - int bsearch(const QPoint &) const; + int bsearch(const TQPoint &) const; %End - int find(const QPoint &,uint = 0) const; - int contains(const QPoint &) const; + int find(const TQPoint &,uint = 0) const; + int contains(const TQPoint &) const; }; |