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
|
/* $Header: array.c,v 1.0 87/12/18 13:04:42 root Exp $
*
* $Log: array.c,v $
* Revision 1.0 87/12/18 13:04:42 root
* Initial revision
*
*/
#include <stdio.h>
#include "EXTERN.h"
#include "handy.h"
#include "util.h"
#include "search.h"
#include "perl.h"
STR *
afetch(ar,key)
register ARRAY *ar;
int key;
{
if (key < 0 || key > ar->ary_max)
return Nullstr;
return ar->ary_array[key];
}
bool
astore(ar,key,val)
register ARRAY *ar;
int key;
STR *val;
{
bool retval;
if (key < 0)
return FALSE;
if (key > ar->ary_max) {
int newmax = key + ar->ary_max / 5;
ar->ary_array = (STR**)saferealloc((char*)ar->ary_array,
(newmax+1) * sizeof(STR*));
bzero((char*)&ar->ary_array[ar->ary_max+1],
(newmax - ar->ary_max) * sizeof(STR*));
ar->ary_max = newmax;
}
if (key > ar->ary_fill)
ar->ary_fill = key;
retval = (ar->ary_array[key] != Nullstr);
if (retval)
str_free(ar->ary_array[key]);
ar->ary_array[key] = val;
return retval;
}
bool
adelete(ar,key)
register ARRAY *ar;
int key;
{
if (key < 0 || key > ar->ary_max)
return FALSE;
if (ar->ary_array[key]) {
str_free(ar->ary_array[key]);
ar->ary_array[key] = Nullstr;
return TRUE;
}
return FALSE;
}
ARRAY *
anew()
{
register ARRAY *ar = (ARRAY*)safemalloc(sizeof(ARRAY));
ar->ary_array = (STR**) safemalloc(5 * sizeof(STR*));
ar->ary_fill = -1;
ar->ary_max = 4;
bzero((char*)ar->ary_array, 5 * sizeof(STR*));
return ar;
}
void
afree(ar)
register ARRAY *ar;
{
register int key;
if (!ar)
return;
for (key = 0; key <= ar->ary_fill; key++)
str_free(ar->ary_array[key]);
safefree((char*)ar->ary_array);
safefree((char*)ar);
}
bool
apush(ar,val)
register ARRAY *ar;
STR *val;
{
return astore(ar,++(ar->ary_fill),val);
}
STR *
apop(ar)
register ARRAY *ar;
{
STR *retval;
if (ar->ary_fill < 0)
return Nullstr;
retval = ar->ary_array[ar->ary_fill];
ar->ary_array[ar->ary_fill--] = Nullstr;
return retval;
}
aunshift(ar,num)
register ARRAY *ar;
register int num;
{
register int i;
register STR **sstr,**dstr;
if (num <= 0)
return;
astore(ar,ar->ary_fill+num,(STR*)0); /* maybe extend array */
sstr = ar->ary_array + ar->ary_fill;
dstr = sstr + num;
for (i = ar->ary_fill; i >= 0; i--) {
*dstr-- = *sstr--;
}
bzero((char*)(ar->ary_array), num * sizeof(STR*));
}
STR *
ashift(ar)
register ARRAY *ar;
{
STR *retval;
if (ar->ary_fill < 0)
return Nullstr;
retval = ar->ary_array[0];
bcopy((char*)(ar->ary_array+1),(char*)ar->ary_array,
ar->ary_fill * sizeof(STR*));
ar->ary_array[ar->ary_fill--] = Nullstr;
return retval;
}
long
alen(ar)
register ARRAY *ar;
{
return (long)ar->ary_fill;
}
void
ajoin(ar,delim,str)
register ARRAY *ar;
char *delim;
register STR *str;
{
register int i;
register int len;
register int dlen;
if (ar->ary_fill < 0) {
str_set(str,"");
STABSET(str);
return;
}
dlen = strlen(delim);
len = ar->ary_fill * dlen; /* account for delimiters */
for (i = ar->ary_fill; i >= 0; i--)
len += str_len(ar->ary_array[i]);
str_grow(str,len); /* preallocate for efficiency */
str_sset(str,ar->ary_array[0]);
for (i = 1; i <= ar->ary_fill; i++) {
str_ncat(str,delim,dlen);
str_scat(str,ar->ary_array[i]);
}
STABSET(str);
}
|
