7417ec8b6fca2cf58c1c56cc6223280e8a1e55e8
[bpt/guile.git] / libguile / vectors.c
1 /* Copyright (C) 1995, 1996, 1998, 1999 Free Software Foundation, Inc.
2 *
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2, or (at your option)
6 * any later version.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public License
14 * along with this software; see the file COPYING. If not, write to
15 * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
17 *
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
20 *
21 * The exception is that, if you link the GUILE library with other files
22 * to produce an executable, this does not by itself cause the
23 * resulting executable to be covered by the GNU General Public License.
24 * Your use of that executable is in no way restricted on account of
25 * linking the GUILE library code into it.
26 *
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
29 *
30 * This exception applies only to the code released by the
31 * Free Software Foundation under the name GUILE. If you copy
32 * code from other Free Software Foundation releases into a copy of
33 * GUILE, as the General Public License permits, the exception does
34 * not apply to the code that you add in this way. To avoid misleading
35 * anyone as to the status of such modified files, you must delete
36 * this exception notice from them.
37 *
38 * If you write modifications of your own for GUILE, it is your choice
39 * whether to permit this exception to apply to your modifications.
40 * If you do not wish that, delete this exception notice. */
41
42 /* Software engineering face-lift by Greg J. Badros, 11-Dec-1999,
43 gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */
44
45 \f
46
47 #include <stdio.h>
48 #include "_scm.h"
49 #include "eq.h"
50
51 #include "scm_validate.h"
52 #include "vectors.h"
53 #include "unif.h"
54 \f
55
56 /*
57 * This complicates things too much if allowed on any array.
58 * C code can safely call it on arrays known to be used in a single
59 * threaded manner.
60 *
61 * SCM_REGISTER_PROC(s_vector_set_length_x, "vector-set-length!", 2, 0, 0, scm_vector_set_length_x);
62 */
63 static char s_vector_set_length_x[] = "vector-set-length!";
64
65
66 SCM
67 scm_vector_set_length_x (SCM vect, SCM len)
68 {
69 long l;
70 scm_sizet siz;
71 scm_sizet sz;
72
73 l = SCM_INUM (len);
74 SCM_ASRTGO (SCM_NIMP (vect), badarg1);
75
76 #ifdef HAVE_ARRAYS
77 if (SCM_TYP7 (vect) == scm_tc7_bvect)
78 {
79 l = (l + SCM_LONG_BIT - 1) / SCM_LONG_BIT;
80 }
81 sz = scm_uniform_element_size (vect);
82 if (sz == 0)
83 #endif
84 switch (SCM_TYP7 (vect))
85 {
86 default:
87 badarg1: scm_wta (vect, (char *) SCM_ARG1, s_vector_set_length_x);
88 case scm_tc7_string:
89 SCM_ASRTGO (vect != scm_nullstr, badarg1);
90 sz = sizeof (char);
91 l++;
92 break;
93 case scm_tc7_vector:
94 case scm_tc7_wvect:
95 SCM_ASRTGO (vect != scm_nullvect, badarg1);
96 sz = sizeof (SCM);
97 break;
98 }
99 SCM_ASSERT (SCM_INUMP (len), len, SCM_ARG2, s_vector_set_length_x);
100 if (!l)
101 l = 1L;
102 siz = l * sz;
103 if (siz != l * sz)
104 scm_wta (SCM_MAKINUM (l * sz), (char *) SCM_NALLOC, s_vector_set_length_x);
105 SCM_REDEFER_INTS;
106 SCM_SETCHARS (vect,
107 ((char *)
108 scm_must_realloc (SCM_CHARS (vect),
109 (long) SCM_LENGTH (vect) * sz,
110 (long) siz,
111 s_vector_set_length_x)));
112 if (SCM_VECTORP (vect))
113 {
114 sz = SCM_LENGTH (vect);
115 while (l > sz)
116 SCM_VELTS (vect)[--l] = SCM_UNSPECIFIED;
117 }
118 else if (SCM_STRINGP (vect))
119 SCM_CHARS (vect)[l - 1] = 0;
120 SCM_SETLENGTH (vect, SCM_INUM (len), SCM_TYP7 (vect));
121 SCM_REALLOW_INTS;
122 return vect;
123 }
124
125 SCM_DEFINE (scm_vector_p, "vector?", 1, 0, 0,
126 (SCM x),
127 "")
128 #define FUNC_NAME s_scm_vector_p
129 {
130 if (SCM_IMP (x))
131 return SCM_BOOL_F;
132 return SCM_BOOL (SCM_VECTORP (x));
133 }
134 #undef FUNC_NAME
135
136 SCM_GPROC (s_vector_length, "vector-length", 1, 0, 0, scm_vector_length, g_vector_length);
137
138 SCM
139 scm_vector_length (SCM v)
140 {
141 SCM_GASSERT1 (SCM_VECTORP(v),
142 g_vector_length, v, SCM_ARG1, s_vector_length);
143 return SCM_MAKINUM (SCM_LENGTH (v));
144 }
145
146 SCM_REGISTER_PROC (s_list_to_vector, "list->vector", 1, 0, 0, scm_vector);
147
148 SCM_DEFINE (scm_vector, "vector", 0, 0, 1,
149 (SCM l),
150 "")
151 #define FUNC_NAME s_scm_vector
152 {
153 SCM res;
154 register SCM *data;
155 int i;
156 SCM_VALIDATE_LIST_COPYLEN (1,l,i);
157 res = scm_make_vector (SCM_MAKINUM (i), SCM_UNSPECIFIED);
158 data = SCM_VELTS (res);
159 for(; i && SCM_NIMP(l); --i, l = SCM_CDR (l))
160 *data++ = SCM_CAR (l);
161 return res;
162 }
163 #undef FUNC_NAME
164
165 SCM_GPROC (s_vector_ref, "vector-ref", 2, 0, 0, scm_vector_ref, g_vector_ref);
166
167 SCM
168 scm_vector_ref (SCM v, SCM k)
169 {
170 SCM_GASSERT2 (SCM_VECTORP (v),
171 g_vector_ref, v, k, SCM_ARG1, s_vector_ref);
172 SCM_GASSERT2 (SCM_INUMP (k),
173 g_vector_ref, v, k, SCM_ARG2, s_vector_ref);
174 SCM_ASSERT (SCM_INUM (k) < SCM_LENGTH (v) && SCM_INUM (k) >= 0,
175 k, SCM_OUTOFRANGE, s_vector_ref);
176 return SCM_VELTS (v)[(long) SCM_INUM (k)];
177 }
178
179 SCM_GPROC (s_vector_set_x, "vector-set!", 3, 0, 0, scm_vector_set_x, g_vector_set_x);
180
181 SCM
182 scm_vector_set_x (SCM v, SCM k, SCM obj)
183 {
184 SCM_GASSERTn (SCM_VECTORP (v),
185 g_vector_set_x, SCM_LIST3 (v, k, obj),
186 SCM_ARG1, s_vector_set_x);
187 SCM_GASSERTn (SCM_INUMP (k),
188 g_vector_set_x, SCM_LIST3 (v, k, obj),
189 SCM_ARG2, s_vector_set_x);
190 SCM_ASSERT ((SCM_INUM (k) < SCM_LENGTH (v)) && (SCM_INUM (k) >= 0),
191 k, SCM_OUTOFRANGE, s_vector_set_x);
192 SCM_VELTS(v)[(long) SCM_INUM(k)] = obj;
193 return obj;
194 }
195
196
197 SCM_DEFINE (scm_make_vector, "make-vector", 1, 1, 0,
198 (SCM k, SCM fill),
199 "")
200 #define FUNC_NAME s_scm_make_vector
201 {
202 SCM v;
203 register long i;
204 register long j;
205 register SCM *velts;
206
207 SCM_VALIDATE_INUM_MIN (1,k,0);
208 if (SCM_UNBNDP(fill))
209 fill = SCM_UNSPECIFIED;
210 i = SCM_INUM(k);
211 SCM_NEWCELL(v);
212 SCM_DEFER_INTS;
213 SCM_SETCHARS(v, scm_must_malloc(i?(long)(i*sizeof(SCM)):1L, FUNC_NAME));
214 SCM_SETLENGTH(v, i, scm_tc7_vector);
215 velts = SCM_VELTS(v);
216 j = 0;
217 while(--i >= j) (velts)[i] = fill;
218 SCM_ALLOW_INTS;
219 return v;
220 }
221 #undef FUNC_NAME
222
223
224 SCM_DEFINE (scm_vector_to_list, "vector->list", 1, 0, 0,
225 (SCM v),
226 "")
227 #define FUNC_NAME s_scm_vector_to_list
228 {
229 SCM res = SCM_EOL;
230 long i;
231 SCM *data;
232 SCM_VALIDATE_VECTOR (1,v);
233 data = SCM_VELTS(v);
234 for(i = SCM_LENGTH(v)-1;i >= 0;i--) res = scm_cons(data[i], res);
235 return res;
236 }
237 #undef FUNC_NAME
238
239
240 SCM_DEFINE (scm_vector_fill_x, "vector-fill!", 2, 0, 0,
241 (SCM v, SCM fill_x),
242 "")
243 #define FUNC_NAME s_scm_vector_fill_x
244 {
245 register long i;
246 register SCM *data;
247 SCM_VALIDATE_VECTOR (1,v);
248 data = SCM_VELTS(v);
249 for(i = SCM_LENGTH(v) - 1; i >= 0; i--)
250 data[i] = fill_x;
251 return SCM_UNSPECIFIED;
252 }
253 #undef FUNC_NAME
254
255
256
257 SCM
258 scm_vector_equal_p(SCM x, SCM y)
259 {
260 long i;
261 for(i = SCM_LENGTH(x)-1;i >= 0;i--)
262 if (SCM_FALSEP(scm_equal_p(SCM_VELTS(x)[i], SCM_VELTS(y)[i])))
263 return SCM_BOOL_F;
264 return SCM_BOOL_T;
265 }
266
267
268 SCM_DEFINE (scm_vector_move_left_x, "vector-move-left!", 5, 0, 0,
269 (SCM vec1, SCM start1, SCM end1, SCM vec2, SCM start2),
270 "Vector version of @code{substring-move-left!}.")
271 #define FUNC_NAME s_scm_vector_move_left_x
272 {
273 long i;
274 long j;
275 long e;
276
277 SCM_VALIDATE_VECTOR (1,vec1);
278 SCM_VALIDATE_INUM_COPY (2,start1,i);
279 SCM_VALIDATE_INUM_COPY (3,end1,e);
280 SCM_VALIDATE_VECTOR (4,vec2);
281 SCM_VALIDATE_INUM_COPY (5,start2,j);
282 SCM_ASSERT (i <= SCM_LENGTH (vec1) && i >= 0, start1, SCM_OUTOFRANGE, FUNC_NAME);
283 SCM_ASSERT (j <= SCM_LENGTH (vec2) && j >= 0, start2, SCM_OUTOFRANGE, FUNC_NAME);
284 SCM_ASSERT (e <= SCM_LENGTH (vec1) && e >= 0, end1, SCM_OUTOFRANGE, FUNC_NAME);
285 SCM_ASSERT (e-i+j <= SCM_LENGTH (vec2), start2, SCM_OUTOFRANGE, FUNC_NAME);
286 while (i<e) SCM_VELTS (vec2)[j++] = SCM_VELTS (vec1)[i++];
287 return SCM_UNSPECIFIED;
288 }
289 #undef FUNC_NAME
290
291 SCM_DEFINE (scm_vector_move_right_x, "vector-move-right!", 5, 0, 0,
292 (SCM vec1, SCM start1, SCM end1, SCM vec2, SCM start2),
293 "Vector version of @code{substring-move-right!}.")
294 #define FUNC_NAME s_scm_vector_move_right_x
295 {
296 long i;
297 long j;
298 long e;
299
300 SCM_VALIDATE_VECTOR (1,vec1);
301 SCM_VALIDATE_INUM_COPY (2,start1,i);
302 SCM_VALIDATE_INUM_COPY (3,end1,e);
303 SCM_VALIDATE_VECTOR (4,vec2);
304 SCM_VALIDATE_INUM_COPY (5,start2,j);
305 SCM_ASSERT (i <= SCM_LENGTH (vec1) && i >= 0, start1, SCM_OUTOFRANGE, FUNC_NAME);
306 SCM_ASSERT (j <= SCM_LENGTH (vec2) && j >= 0, start2, SCM_OUTOFRANGE, FUNC_NAME);
307 SCM_ASSERT (e <= SCM_LENGTH (vec1) && e >= 0, end1, SCM_OUTOFRANGE, FUNC_NAME);
308 j = e - i + j;
309 SCM_ASSERT (j <= SCM_LENGTH (vec2), start2, SCM_OUTOFRANGE, FUNC_NAME);
310 while (i < e)
311 SCM_VELTS (vec2)[--j] = SCM_VELTS (vec1)[--e];
312 return SCM_UNSPECIFIED;
313 }
314 #undef FUNC_NAME
315
316
317
318 void
319 scm_init_vectors ()
320 {
321 #include "vectors.x"
322 /*
323 scm_make_subr (s_resizuve, scm_tc7_subr_2, scm_vector_set_length_x); */
324 }
325