summaryrefslogtreecommitdiffstats
path: root/sip/qt/qstringlist.sip
blob: b48a60d246733a269da76cd0aa8ddb9327e7ee65 (plain)
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
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
// This is the SIP interface definition for TQStringList.
//
// Copyright (c) 2007
// 	Riverbank Computing Limited <info@riverbankcomputing.co.uk>
// 
// 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>TQStringList (TQt v2+)</Title>
<Para>
The Python <Literal>len</Literal>, <Literal>[]</Literal> (for both reading and
writing slices and individual elements), <Literal>del</Literal> (for deleting
slices and individual elements), <Literal>+</Literal>, <Literal>+=</Literal>,
<Literal>*</Literal>, <Literal>*=</Literal>, <Literal>==</Literal>,
<Literal>!=</Literal> and <Literal>in</Literal> operators are supported.
</Para>

<FuncSynopsis>
	<FuncDef>Iterator <Function>append</Function></FuncDef>
	<ParamDef>const TQString &<Parameter>x</Parameter></ParamDef>
</FuncSynopsis>
<Para>
This does not return a value.
</Para>

<FuncSynopsis>
	<FuncDef>Iterator <Function>prepend</Function></FuncDef>
	<ParamDef>const TQString &<Parameter>x</Parameter></ParamDef>
</FuncSynopsis>
<Para>
This does not return a value.
</Para>
</Sect2>
%End


%If (TQt_2_00 -)

class TQStringList
{
%TypeHeaderCode
#include <qstringlist.h>
%End

public:
	TQStringList();
	TQStringList(const TQStringList &);
	TQStringList(const TQString &);

	void sort();
%If (TQt_2_1_0 -)
	static TQStringList fromStrList(const TQStrList &);
	static TQStringList split(const TQString &,const TQString &,bool = 0);
	static TQStringList split(const TQChar &,const TQString &,bool = 0);
	static TQStringList split(const TQRegExp &,const TQString &,bool = 0);
	TQString join(const TQString &) const;
	TQStringList grep(const TQString &,bool = 1) const;
	TQStringList grep(const TQRegExp &) const;
%End

%If (TQt_3_2_0 -)
	TQStringList &gres(const TQString &,const TQString &,bool = 1);
	TQStringList &gres(const TQRegExp &,const TQString &);
%End

	// These are actually in TQValueList, which isn't implemented so
	// pretend they are here.

	bool isEmpty() const;
	void append(const TQString &);
	void prepend(const TQString &);
	void remove(const TQString &);
	const TQString &first() const;
	const TQString &last() const;
	int findIndex(const TQString &) const;
	uint contains(const TQString &) const;
	uint count() const;
	void clear();

	int __len__();
%MethodCode
		sipRes = sipCpp -> count();
%End

	void __setitem__(int,const TQString &);
%MethodCode
		int len;

		len = sipCpp -> count();

		if ((a0 = (int)sipConvertFromSequenceIndex(a0,len)) < 0)
			sipIsErr = 1;
		else
			(*sipCpp)[a0] = *a1;
%End

	void __setitem__(SIP_PYSLICE,const TQStringList &);
%MethodCode
#if PY_VERSION_HEX >= 0x02050000
		Py_ssize_t len, start, stop, step, slicelength, i;
#else
		int len, start, stop, step, slicelength, i;
#endif

		len = sipCpp -> count();

		if (sipConvertFromSliceObject(a0,len,&start,&stop,&step,&slicelength) < 0)
			sipIsErr = 1;
		else
		{
			int vlen = a1 -> count();

			if (vlen != slicelength)
			{
				sipBadLengthForSlice(vlen,slicelength);
				sipIsErr = 1;
			}
			else
			{
				TQStringList::ConstIterator it = a1 -> begin();

				for (i = 0; i < slicelength; ++i)
				{
					(*sipCpp)[start] = *it;
					start += step;
					++it;
				}
			}
		}
%End

	void __delitem__(int);
%MethodCode
		int len;

		len = sipCpp -> count();

		if ((a0 = (int)sipConvertFromSequenceIndex(a0,len)) < 0)
			sipIsErr = 1;
		else
			sipCpp -> remove(sipCpp -> at(a0));
%End

	void __delitem__(SIP_PYSLICE);
%MethodCode
#if PY_VERSION_HEX >= 0x02050000
		Py_ssize_t len, start, stop, step, slicelength, i;
#else
		int len, start, stop, step, slicelength, i;
#endif

		len = sipCpp -> count();

		if (sipConvertFromSliceObject(a0,len,&start,&stop,&step,&slicelength) < 0)
			sipIsErr = 1;
		else
			for (i = 0; i < slicelength; ++i)
			{
				sipCpp -> remove(sipCpp -> at(start));
				start += step - 1;
			}
%End

	TQString operator[](int);
%MethodCode
		int len;

		len = sipCpp -> count();

		if ((a0 = (int)sipConvertFromSequenceIndex(a0,len)) < 0)
			sipIsErr = 1;
		else
			sipRes = new TQString((*sipCpp)[a0]);
%End

	TQStringList operator[](SIP_PYSLICE);
%MethodCode
#if PY_VERSION_HEX >= 0x02050000
		Py_ssize_t len, start, stop, step, slicelength, i;
#else
		int len, start, stop, step, slicelength, i;
#endif

		len = sipCpp -> count();

		if (sipConvertFromSliceObject(a0,len,&start,&stop,&step,&slicelength) < 0)
			sipIsErr = 1;
		else
		{
			sipRes = new TQStringList();

			for (i = 0; i < slicelength; ++i)
			{
				(*sipRes) += (*sipCpp)[start];
				start += step;
			}
		}
%End

	int __contains__(const TQString &);
%MethodCode
		sipRes = (sipCpp -> findIndex(*a0) >= 0);
%End

	TQStringList operator+(const TQStringList &);
	TQStringList &operator+=(const TQStringList &);

	TQStringList &operator+=(const TQString &);

	TQStringList operator*(int);
%MethodCode
		sipRes = new TQStringList();

		while (a0-- > 0)
			*sipRes += *sipCpp;
%End

	TQStringList &operator*=(int);
%MethodCode
		TQStringList orig(*sipCpp);

		sipCpp -> clear();

		while (a0-- > 0)
			*sipCpp += orig;
%End

	bool operator==(const TQStringList &);
	bool operator!=(const TQStringList &);
};

%End