-
Notifications
You must be signed in to change notification settings - Fork 96
/
arrayshb.c
438 lines (366 loc) · 11.9 KB
/
arrayshb.c
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
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
/*
* The Array API (Harbour level)
*
* Copyright 1999 Antonio Linares <alinares@fivetech.com>
*
* This program 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.
*
* This program is distributed 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 this program; see the file LICENSE.txt. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301 USA (or visit https://www.gnu.org/licenses/).
*
* As a special exception, the Harbour Project gives permission for
* additional uses of the text contained in its release of Harbour.
*
* The exception is that, if you link the Harbour libraries with other
* files to produce an executable, this does not by itself cause the
* resulting executable to be covered by the GNU General Public License.
* Your use of that executable is in no way restricted on account of
* linking the Harbour library code into it.
*
* This exception does not however invalidate any other reasons why
* the executable file might be covered by the GNU General Public License.
*
* This exception applies only to the code released by the Harbour
* Project under the name Harbour. If you copy code from other
* Harbour Project or Free Software Foundation releases into a copy of
* Harbour, as the General Public License permits, the exception does
* not apply to the code that you add in this way. To avoid misleading
* anyone as to the status of such modified files, you must delete
* this exception notice from them.
*
* If you write modifications of your own for Harbour, it is your choice
* whether to permit this exception to apply to your modifications.
* If you do not wish that, delete this exception notice.
*
*/
#include "hbapi.h"
#include "hbstack.h"
#include "hbapiitm.h"
#include "hbapierr.h"
#include "hbapilng.h"
/* This function creates an array item using 'iDimension' as an index
* to retrieve the number of elements from the parameter list.
*/
static void hb_arrayNewRagged( PHB_ITEM pArray, int iDimension )
{
HB_SIZE nElements;
HB_TRACE( HB_TR_DEBUG, ( "hb_arrayNewRagged(%p, %d)", pArray, iDimension ) );
nElements = hb_parns( iDimension );
/* create an array */
hb_arrayNew( pArray, nElements );
if( ++iDimension <= hb_pcount() )
{
/* call self recursively to create next dimensions
*/
while( nElements )
hb_arrayNewRagged( hb_arrayGetItemPtr( pArray, nElements-- ), iDimension );
}
}
HB_FUNC( ARRAY )
{
int iPCount = hb_pcount();
if( iPCount > 0 )
{
HB_BOOL bError = HB_FALSE;
int iParam;
for( iParam = 1; iParam <= iPCount; iParam++ )
{
if( ! HB_ISNUM( iParam ) )
{
bError = HB_TRUE;
break;
}
if( hb_parns( iParam ) < 0 ) /* || hb_parns( iParam ) <= 4096 */
{
#ifdef HB_CLP_STRICT
hb_errRT_BASE( EG_BOUND, 1131, NULL, hb_langDGetErrorDesc( EG_ARRDIMENSION ), 0 );
#else
hb_errRT_BASE( EG_BOUND, 1131, NULL, hb_langDGetErrorDesc( EG_ARRDIMENSION ), HB_ERR_ARGS_BASEPARAMS );
#endif
bError = HB_TRUE;
break;
}
}
if( ! bError )
hb_arrayNewRagged( hb_stackReturnItem(), 1 );
}
}
HB_FUNC( AADD )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
if( pArray )
{
PHB_ITEM pValue = hb_param( 2, HB_IT_ANY );
if( pValue && hb_arrayAdd( pArray, pValue ) )
hb_itemReturn( pValue );
else
hb_errRT_BASE( EG_BOUND, 1187, NULL, HB_ERR_FUNCNAME, HB_ERR_ARGS_BASEPARAMS );
}
else
hb_errRT_BASE_SubstR( EG_ARG, 1123, NULL, HB_ERR_FUNCNAME, HB_ERR_ARGS_BASEPARAMS );
}
/* NOTE: CA-Cl*pper 5.3 and older will return NIL on bad parameter, 5.3a,b
will throw a runtime error. [vszakats] */
HB_FUNC( ASIZE )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
if( pArray && HB_ISNUM( 2 ) )
{
HB_ISIZ nSize = hb_parns( 2 );
hb_arraySize( pArray, HB_MAX( nSize, 0 ) );
hb_itemReturn( pArray ); /* ASize() returns the array itself */
}
#ifdef HB_COMPAT_C53 /* From CA-Cl*pper 5.3a */
else
#ifdef HB_CLP_STRICT
hb_errRT_BASE( EG_ARG, 2023, NULL, HB_ERR_FUNCNAME, 0 );
#else
hb_errRT_BASE( EG_ARG, 2023, NULL, HB_ERR_FUNCNAME, HB_ERR_ARGS_BASEPARAMS );
#endif
#endif
}
HB_FUNC( ATAIL )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
if( pArray )
hb_arrayLast( pArray, hb_stackReturnItem() );
}
HB_FUNC( AINS )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
if( pArray )
{
HB_ISIZ nPos = hb_parns( 2 );
if( nPos == 0 )
nPos = 1;
hb_arrayIns( pArray, nPos );
hb_itemReturn( pArray ); /* AIns() returns the array itself */
}
}
HB_FUNC( ADEL )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
if( pArray )
{
HB_ISIZ nPos = hb_parns( 2 );
if( nPos == 0 )
nPos = 1;
hb_arrayDel( pArray, nPos );
hb_itemReturn( pArray ); /* ADel() returns the array itself */
}
}
HB_FUNC( AFILL )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
if( pArray )
{
PHB_ITEM pValue = hb_param( 2, HB_IT_ANY );
hb_itemReturn( pArray ); /* AFill() returns the array itself */
if( pValue )
{
HB_SIZE nStart, nCount;
HB_ISIZ lStart = hb_parns( 3 ), lCount = hb_parns( 4 );
/* Explicit lCount of 0 - Nothing to do! */
if( HB_ISNUM( 4 ) && lCount == 0 )
return;
/* Clipper aborts if negative start. */
else if( lStart < 0 )
return;
/* Clipper allows Start to be of wrong type, or 0, and corrects it to 1. */
else if( lStart == 0 )
lStart = 1;
if( lCount < 0 )
{
/* Clipper allows the Count to be negative, if start is 1, and corrects it to maximum elements. */
if( lStart == 1 )
nCount = 0;
/* Clipper aborts if negative count and start is not at 1. */
else
return;
}
nStart = ( HB_SIZE ) lStart;
nCount = ( HB_SIZE ) lCount;
hb_arrayFill( pArray,
pValue,
HB_ISNUM( 3 ) ? &nStart : NULL,
HB_ISNUM( 4 ) ? &nCount : NULL );
}
}
else
#ifdef HB_CLP_STRICT
/* NOTE: In CA-Cl*pper AFill() is written in a manner that it will
call AEval() to do the job, so the error (if any) will also be
thrown by AEval(). [vszakats] */
hb_errRT_BASE( EG_ARG, 2017, NULL, "AEVAL", 0 );
#else
hb_errRT_BASE( EG_ARG, 6004, NULL, HB_ERR_FUNCNAME, HB_ERR_ARGS_BASEPARAMS );
#endif
}
HB_FUNC( ASCAN )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
PHB_ITEM pValue = hb_param( 2, HB_IT_ANY );
if( pArray && pValue )
{
HB_SIZE nStart = hb_parns( 3 );
HB_SIZE nCount = hb_parns( 4 );
hb_retns( hb_arrayScanCase( pArray, pValue,
HB_ISNUM( 3 ) ? &nStart : NULL,
HB_ISNUM( 4 ) ? &nCount : NULL,
HB_FALSE,
HB_TRUE ) );
}
else
hb_retni( 0 );
}
/* Same as AScan() but has an additional parameter to force exact comparison. */
HB_FUNC( HB_ASCAN )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
PHB_ITEM pValue = hb_param( 2, HB_IT_ANY );
if( pArray && pValue )
{
HB_SIZE nStart = hb_parns( 3 );
HB_SIZE nCount = hb_parns( 4 );
hb_retns( hb_arrayScanCase( pArray, pValue,
HB_ISNUM( 3 ) ? &nStart : NULL,
HB_ISNUM( 4 ) ? &nCount : NULL,
hb_parl( 5 ),
HB_TRUE ) );
}
else
hb_retni( 0 );
}
/* Same as hb_AScan() but with case-insensitive string comparison. */
HB_FUNC( HB_ASCANI )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
PHB_ITEM pValue = hb_param( 2, HB_IT_ANY );
if( pArray && pValue )
{
HB_SIZE nStart = hb_parns( 3 );
HB_SIZE nCount = hb_parns( 4 );
hb_retns( hb_arrayScanCase( pArray, pValue,
HB_ISNUM( 3 ) ? &nStart : NULL,
HB_ISNUM( 4 ) ? &nCount : NULL,
hb_parl( 5 ),
HB_FALSE ) );
}
else
hb_retni( 0 );
}
HB_FUNC( HB_RASCAN )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
PHB_ITEM pValue = hb_param( 2, HB_IT_ANY );
if( pArray && pValue )
{
HB_SIZE nStart = hb_parns( 3 );
HB_SIZE nCount = hb_parns( 4 );
hb_retns( hb_arrayRevScan( pArray, pValue,
HB_ISNUM( 3 ) ? &nStart : NULL,
HB_ISNUM( 4 ) ? &nCount : NULL,
hb_parl( 5 ) ) );
}
else
hb_retni( 0 );
}
HB_FUNC( HB_AINS )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
if( pArray )
{
HB_ISIZ nPos = hb_parns( 2 );
if( nPos == 0 )
nPos = 1;
if( hb_parl( 4 ) )
{
HB_SIZE nLen = hb_arrayLen( pArray ) + 1;
if( nPos >= 1 && ( HB_SIZE ) nPos <= nLen )
hb_arraySize( pArray, nLen );
}
if( hb_arrayIns( pArray, nPos ) )
{
if( ! HB_ISNIL( 3 ) )
hb_arraySet( pArray, nPos, hb_param( 3, HB_IT_ANY ) );
}
hb_itemReturn( pArray ); /* AIns() returns the array itself */
}
}
HB_FUNC( HB_ADEL )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
if( pArray )
{
HB_ISIZ nPos = hb_parns( 2 );
if( nPos == 0 )
nPos = 1;
if( hb_arrayDel( pArray, nPos ) )
{
if( hb_parl( 3 ) )
hb_arraySize( pArray, hb_arrayLen( pArray ) - 1 );
}
hb_itemReturn( pArray ); /* ADel() returns the array itself */
}
}
/* TODO: In Xbase++ fifth parameter determines whether array elements
are passed by reference to the code block. [vszakats] */
HB_FUNC( AEVAL )
{
PHB_ITEM pArray = hb_param( 1, HB_IT_ARRAY );
PHB_ITEM pBlock = hb_param( 2, HB_IT_BLOCK );
if( pArray && pBlock )
{
HB_SIZE nStart = hb_parns( 3 );
HB_SIZE nCount = hb_parns( 4 );
hb_arrayEval( pArray,
pBlock,
HB_ISNUM( 3 ) ? &nStart : NULL,
HB_ISNUM( 4 ) ? &nCount : NULL );
hb_itemReturn( pArray ); /* AEval() returns the array itself */
}
else
hb_errRT_BASE( EG_ARG, 2017, NULL, HB_ERR_FUNCNAME, HB_ERR_ARGS_BASEPARAMS );
}
HB_FUNC( ACOPY )
{
PHB_ITEM pSrcArray = hb_param( 1, HB_IT_ARRAY );
PHB_ITEM pDstArray = hb_param( 2, HB_IT_ARRAY );
if( pSrcArray && pDstArray )
{
/* CA-Cl*pper works this way. */
if( ! hb_arrayIsObject( pSrcArray ) && ! hb_arrayIsObject( pDstArray ) )
{
HB_SIZE nStart = hb_parns( 3 );
HB_SIZE nCount = hb_parns( 4 );
HB_SIZE nTarget = hb_parns( 5 );
hb_arrayCopy( pSrcArray,
pDstArray,
HB_ISNUM( 3 ) ? &nStart : NULL,
HB_ISNUM( 4 ) ? &nCount : NULL,
HB_ISNUM( 5 ) ? &nTarget : NULL );
}
hb_itemReturn( pDstArray ); /* ACopy() returns the target array */
}
}
/* NOTE: Clipper will return NIL if the parameter is not an array. [vszakats] */
HB_FUNC( ACLONE )
{
PHB_ITEM pSrcArray = hb_param( 1, HB_IT_ARRAY );
if( pSrcArray && ! hb_arrayIsObject( pSrcArray ) )
hb_arrayCloneTo( hb_stackReturnItem(), pSrcArray ); /* AClone() returns the new array */
}
HB_FUNC( HB_APARAMS )
{
hb_itemReturnRelease( hb_arrayFromParams( hb_parni( 1 ) + 1 ) );
}