1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
// This is the SIP interface definition for TQPointArray.
//
// Copyright (c) 2007
// Riverbank Computing Limited <[email protected]>
//
// This file is part of PyTQt.
//
// 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.
//
// 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
// 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>TQPointArray</Title>
<FuncSynopsis>
<FuncDef><Function>TQPointArray</Function></FuncDef>
<ParamDef>int <Parameter>nPoints</Parameter></ParamDef>
<ParamDef>const TQCOORD *<Parameter>points</Parameter></ParamDef>
</FuncSynopsis>
<Para>
This takes a single parameter which is a list of points.
</Para>
<FuncSynopsis>
<FuncDef>void <Function>point</Function></FuncDef>
<ParamDef>uint <Parameter>i</Parameter></ParamDef>
<ParamDef>int *<Parameter>x</Parameter></ParamDef>
<ParamDef>int *<Parameter>y</Parameter></ParamDef>
</FuncSynopsis>
<Para>
This takes the single parameter <Literal>i</Literal> and returns the
<Literal>x</Literal> and <Literal>y</Literal> values as a tuple.
</Para>
<FuncSynopsis>
<FuncDef>bool <Function>putPoints</Function></FuncDef>
<ParamDef>int <Parameter>index</Parameter></ParamDef>
<ParamDef>int <Parameter>nPoints</Parameter></ParamDef>
<ParamDef>const TQCOORD *<Parameter>points</Parameter></ParamDef>
</FuncSynopsis>
<Para>
This takes two parameters, <Literal>index</Literal> and a list of points.
</Para>
<FuncSynopsis>
<FuncDef>bool <Function>putPoints</Function></FuncDef>
<ParamDef>int <Parameter>index</Parameter></ParamDef>
<ParamDef>int <Parameter>nPoints</Parameter></ParamDef>
<ParamDef>int <Parameter>firstx</Parameter></ParamDef>
<ParamDef>int <Parameter>firsty</Parameter></ParamDef>
<ParamDef>...</ParamDef>
</FuncSynopsis>
<Para>
Not implemented.
</Para>
<FuncSynopsis>
<FuncDef>bool <Function>setPoints</Function></FuncDef>
<ParamDef>int <Parameter>nPoints</Parameter></ParamDef>
<ParamDef>const TQCOORD *<Parameter>points</Parameter></ParamDef>
</FuncSynopsis>
<Para>
This takes a single parameter which is a list of points.
</Para>
<FuncSynopsis>
<FuncDef>bool <Function>setPoints</Function></FuncDef>
<ParamDef>int <Parameter>nPoints</Parameter></ParamDef>
<ParamDef>int <Parameter>firstx</Parameter></ParamDef>
<ParamDef>int <Parameter>firsty</Parameter></ParamDef>
<ParamDef>...</ParamDef>
</FuncSynopsis>
<Para>
Not implemented.
</Para>
</Sect2>
%End
class TQPointArray
{
%TypeHeaderCode
#include <tqpointarray.h>
%End
%TypeCode
// Convert a list of numbers to an array on TQCOORDs on the heap.
static TQCOORD *getPoints(int nrpnts,PyObject *pntlist)
{
TQCOORD *pnts, *pp;
if ((pnts = (TQCOORD *)sipMalloc(nrpnts * sizeof (TQCOORD))) == NULL)
return NULL;
// Convert the list.
pp = pnts;
for (int i = 0; i < nrpnts; ++i)
{
*pp++ = (TQCOORD)PyLong_AsLong(PyList_GetItem(pntlist,i));
if (PyErr_Occurred() != NULL)
{
sipFree((void *)pnts);
return NULL;
}
}
return pnts;
}
%End
public:
TQPointArray();
TQPointArray(int);
TQPointArray(const TQPointArray &);
TQPointArray(const TQRect &,bool = 0);
TQPointArray(SIP_PYLIST) [(int,const TQCOORD *)];
%MethodCode
// The Python interface is a list of TQCOORDs.
int nrpnts;
TQCOORD *pnts;
nrpnts = PyList_GET_SIZE(a0);
if ((pnts = getPoints(nrpnts,a0)) == NULL)
sipIsErr = 1;
else
{
// No wrapper class for TQPointArray.
Py_BEGIN_ALLOW_THREADS
sipCpp = new TQPointArray(nrpnts / 2,pnts);
Py_END_ALLOW_THREADS
sipFree((void *)pnts);
}
%End
TQPointArray copy() const;
void translate(int,int);
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.
//TQPoint point(uint) const;
void setPoint(uint,int,int);
void setPoint(uint,const TQPoint &);
bool setPoints(SIP_PYLIST);
%MethodCode
int nrpnts;
TQCOORD *pnts;
nrpnts = PyList_GET_SIZE(a0);
if ((pnts = getPoints(nrpnts,a0)) == NULL)
sipIsErr = 1;
else
{
Py_BEGIN_ALLOW_THREADS
sipRes = sipCpp -> setPoints(nrpnts / 2,pnts);
Py_END_ALLOW_THREADS
sipFree((void *)pnts);
}
%End
// bool setPoints(int,int,int,...);
bool putPoints(int,SIP_PYLIST);
%MethodCode
int nrpnts;
TQCOORD *pnts;
nrpnts = PyList_GET_SIZE(a1);
if ((pnts = getPoints(nrpnts,a1)) == NULL)
sipIsErr = 1;
else
{
Py_BEGIN_ALLOW_THREADS
sipRes = sipCpp -> putPoints(a0,nrpnts / 2,pnts);
Py_END_ALLOW_THREADS
sipFree((void *)pnts);
}
%End
// bool putPoints(int,int,int,int,...);
bool putPoints(int,int,const TQPointArray &,int = 0);
void makeArc(int,int,int,int,int,int);
void makeEllipse(int,int,int,int);
%If (TQt_TRANSFORMATIONS)
void makeArc(int,int,int,int,int,int,const TQWMatrix &);
%End
TQPointArray cubicBezier() const;
// These are actually in TQArray, which isn't implemented so pretend
// they are here.
uint nrefs() const;
bool isEmpty() const;
bool isNull() const;
bool resize(uint);
uint size() const;
bool truncate(uint);
bool fill(const TQPoint &,int = -1);
TQPoint &at(uint) const;
void sort();
int bsearch(const TQPoint &) const;
int find(const TQPoint &,uint = 0) const;
int contains(const TQPoint &) const;
};
|
