1 /* Copyright (C) 1995, 1996, 1998, 1999 Free Software Foundation, Inc.
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)
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.
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
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
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.
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
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.
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. */
42 /* Software engineering face-lift by Greg J. Badros, 11-Dec-1999,
43 gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */
58 * This complicates things too much if allowed on any array.
59 * C code can safely call it on arrays known to be used in a single
62 * SCM_REGISTER_PROC(s_vector_set_length_x, "vector-set-length!", 2, 0, 0, scm_vector_set_length_x);
64 static char s_vector_set_length_x
[] = "vector-set-length!";
68 scm_vector_set_length_x (SCM vect
, SCM len
)
75 SCM_ASRTGO (SCM_NIMP (vect
), badarg1
);
78 if (SCM_TYP7 (vect
) == scm_tc7_bvect
)
80 l
= (l
+ SCM_LONG_BIT
- 1) / SCM_LONG_BIT
;
82 sz
= scm_uniform_element_size (vect
);
85 switch (SCM_TYP7 (vect
))
88 badarg1
: scm_wta (vect
, (char *) SCM_ARG1
, s_vector_set_length_x
);
90 SCM_ASRTGO (vect
!= scm_nullstr
, badarg1
);
96 SCM_ASRTGO (vect
!= scm_nullvect
, badarg1
);
100 SCM_ASSERT (SCM_INUMP (len
), len
, SCM_ARG2
, s_vector_set_length_x
);
105 scm_wta (SCM_MAKINUM (l
* sz
), (char *) SCM_NALLOC
, s_vector_set_length_x
);
109 scm_must_realloc (SCM_CHARS (vect
),
110 (long) SCM_LENGTH (vect
) * sz
,
112 s_vector_set_length_x
)));
113 if (SCM_VECTORP (vect
))
115 sz
= SCM_LENGTH (vect
);
117 SCM_VELTS (vect
)[--l
] = SCM_UNSPECIFIED
;
119 else if (SCM_STRINGP (vect
))
120 SCM_CHARS (vect
)[l
- 1] = 0;
121 SCM_SETLENGTH (vect
, SCM_INUM (len
), SCM_TYP7 (vect
));
126 SCM_DEFINE (scm_vector_p
, "vector?", 1, 0, 0,
128 "Returns @t{#t} if @var{obj} is a vector, otherwise returns @t{#f}. (r5rs)")
129 #define FUNC_NAME s_scm_vector_p
133 return SCM_BOOL (SCM_VECTORP (obj
));
137 SCM_GPROC (s_vector_length
, "vector-length", 1, 0, 0, scm_vector_length
, g_vector_length
);
138 /* Returns the number of elements in @var{vector} as an exact integer. (r5rs) */
140 scm_vector_length (SCM v
)
142 SCM_GASSERT1 (SCM_VECTORP(v
),
143 g_vector_length
, v
, SCM_ARG1
, s_vector_length
);
144 return SCM_MAKINUM (SCM_LENGTH (v
));
147 SCM_REGISTER_PROC (s_list_to_vector
, "list->vector", 1, 0, 0, scm_vector
);
149 "@samp{List->vector} returns a newly\n"
150 "created vector initialized to the elements of the list @var{list}.\n\n"
152 "@t{(vector->list '#(dah dah didah))\n"
153 "=> (dah dah didah)\n"
154 "list->vector '(dididit dah))\n"
155 "=> #(dididit dah)\n"
159 SCM_DEFINE (scm_vector
, "vector", 0, 0, 1,
161 "Returns a newly allocated vector whose elements contain the given\n"
162 "arguments. Analogous to @samp{list}. (r5rs)\n\n"
164 "@t{(vector 'a 'b 'c) ==> #(a b c) }\n"
166 #define FUNC_NAME s_scm_vector
171 SCM_VALIDATE_LIST_COPYLEN (1,l
,i
);
172 res
= scm_make_vector (SCM_MAKINUM (i
), SCM_UNSPECIFIED
);
173 data
= SCM_VELTS (res
);
174 for(; i
&& SCM_NIMP(l
); --i
, l
= SCM_CDR (l
))
175 *data
++ = SCM_CAR (l
);
180 SCM_GPROC (s_vector_ref
, "vector-ref", 2, 0, 0, scm_vector_ref
, g_vector_ref
);
183 "@var{k} must be a valid index of @var{vector}.\n"
184 "@samp{Vector-ref} returns the contents of element @var{k} of\n"
187 "@t{(vector-ref '#(1 1 2 3 5 8 13 21)\n"
190 "(vector-ref '#(1 1 2 3 5 8 13 21)\n"
191 " (let ((i (round (* 2 (acos -1)))))\n"
192 " (if (inexact? i)\n"
193 " (inexact->exact i)\n"
201 scm_vector_ref (SCM v
, SCM k
)
203 SCM_GASSERT2 (SCM_VECTORP (v
),
204 g_vector_ref
, v
, k
, SCM_ARG1
, s_vector_ref
);
205 SCM_GASSERT2 (SCM_INUMP (k
),
206 g_vector_ref
, v
, k
, SCM_ARG2
, s_vector_ref
);
207 SCM_ASSERT (SCM_INUM (k
) < SCM_LENGTH (v
) && SCM_INUM (k
) >= 0,
208 k
, SCM_OUTOFRANGE
, s_vector_ref
);
209 return SCM_VELTS (v
)[(long) SCM_INUM (k
)];
212 SCM_GPROC (s_vector_set_x
, "vector-set!", 3, 0, 0, scm_vector_set_x
, g_vector_set_x
);
215 @var{k} must be a valid index of @var{vector}.
216 @samp{Vector-set!} stores @var{obj} in element @var{k} of @var{vector}.
217 The value returned by @samp{vector-set!} is unspecified.
222 @t{(let ((vec (vector 0 '(2 2 2 2) "Anna")))
223 (vector-set! vec 1 '("Sue" "Sue"))
225 ==> #(0 ("Sue" "Sue") "Anna")
227 (vector-set! '#(0 1 2) 1 "doe")
228 ==> @emph{error} ; constant vector
234 scm_vector_set_x (SCM v
, SCM k
, SCM obj
)
236 SCM_GASSERTn (SCM_VECTORP (v
),
237 g_vector_set_x
, SCM_LIST3 (v
, k
, obj
),
238 SCM_ARG1
, s_vector_set_x
);
239 SCM_GASSERTn (SCM_INUMP (k
),
240 g_vector_set_x
, SCM_LIST3 (v
, k
, obj
),
241 SCM_ARG2
, s_vector_set_x
);
242 SCM_ASSERT ((SCM_INUM (k
) < SCM_LENGTH (v
)) && (SCM_INUM (k
) >= 0),
243 k
, SCM_OUTOFRANGE
, s_vector_set_x
);
244 SCM_VELTS(v
)[(long) SCM_INUM(k
)] = obj
;
249 SCM_DEFINE (scm_make_vector
, "make-vector", 1, 1, 0,
251 "Returns a newly allocated vector of @var{k} elements. If a second\n"
252 "argument is given, then each element is initialized to @var{fill}.\n"
253 "Otherwise the initial contents of each element is unspecified. (r5rs)")
254 #define FUNC_NAME s_scm_make_vector
261 SCM_VALIDATE_INUM_MIN (1,k
,0);
262 if (SCM_UNBNDP(fill
))
263 fill
= SCM_UNSPECIFIED
;
267 SCM_SETCHARS(v
, scm_must_malloc(i
?(long)(i
*sizeof(SCM
)):1L, FUNC_NAME
));
268 SCM_SETLENGTH(v
, i
, scm_tc7_vector
);
269 velts
= SCM_VELTS(v
);
271 while(--i
>= j
) (velts
)[i
] = fill
;
278 SCM_DEFINE (scm_vector_to_list
, "vector->list", 1, 0, 0,
280 "@samp{Vector->list} returns a newly allocated list of the objects contained\n"
281 "in the elements of @var{vector}. (r5rs)\n\n"
283 "@t{(vector->list '#(dah dah didah))\n"
284 "=> (dah dah didah)\n"
285 "list->vector '(dididit dah))\n"
286 "=> #(dididit dah)\n"
289 #define FUNC_NAME s_scm_vector_to_list
294 SCM_VALIDATE_VECTOR (1,v
);
296 for(i
= SCM_LENGTH(v
)-1;i
>= 0;i
--) res
= scm_cons(data
[i
], res
);
302 SCM_DEFINE (scm_vector_fill_x
, "vector-fill!", 2, 0, 0,
304 "Stores @var{fill} in every element of @var{vector}.\n"
305 "The value returned by @samp{vector-fill!} is unspecified. (r5rs)")
306 #define FUNC_NAME s_scm_vector_fill_x
310 SCM_VALIDATE_VECTOR (1,v
);
312 for(i
= SCM_LENGTH(v
) - 1; i
>= 0; i
--)
314 return SCM_UNSPECIFIED
;
320 scm_vector_equal_p(SCM x
, SCM y
)
323 for(i
= SCM_LENGTH(x
)-1;i
>= 0;i
--)
324 if (SCM_FALSEP(scm_equal_p(SCM_VELTS(x
)[i
], SCM_VELTS(y
)[i
])))
330 SCM_DEFINE (scm_vector_move_left_x
, "vector-move-left!", 5, 0, 0,
331 (SCM vec1
, SCM start1
, SCM end1
, SCM vec2
, SCM start2
),
332 "Vector version of @code{substring-move-left!}.")
333 #define FUNC_NAME s_scm_vector_move_left_x
339 SCM_VALIDATE_VECTOR (1,vec1
);
340 SCM_VALIDATE_INUM_COPY (2,start1
,i
);
341 SCM_VALIDATE_INUM_COPY (3,end1
,e
);
342 SCM_VALIDATE_VECTOR (4,vec2
);
343 SCM_VALIDATE_INUM_COPY (5,start2
,j
);
344 SCM_ASSERT (i
<= SCM_LENGTH (vec1
) && i
>= 0, start1
, SCM_OUTOFRANGE
, FUNC_NAME
);
345 SCM_ASSERT (j
<= SCM_LENGTH (vec2
) && j
>= 0, start2
, SCM_OUTOFRANGE
, FUNC_NAME
);
346 SCM_ASSERT (e
<= SCM_LENGTH (vec1
) && e
>= 0, end1
, SCM_OUTOFRANGE
, FUNC_NAME
);
347 SCM_ASSERT (e
-i
+j
<= SCM_LENGTH (vec2
), start2
, SCM_OUTOFRANGE
, FUNC_NAME
);
348 while (i
<e
) SCM_VELTS (vec2
)[j
++] = SCM_VELTS (vec1
)[i
++];
349 return SCM_UNSPECIFIED
;
353 SCM_DEFINE (scm_vector_move_right_x
, "vector-move-right!", 5, 0, 0,
354 (SCM vec1
, SCM start1
, SCM end1
, SCM vec2
, SCM start2
),
355 "Vector version of @code{substring-move-right!}.")
356 #define FUNC_NAME s_scm_vector_move_right_x
362 SCM_VALIDATE_VECTOR (1,vec1
);
363 SCM_VALIDATE_INUM_COPY (2,start1
,i
);
364 SCM_VALIDATE_INUM_COPY (3,end1
,e
);
365 SCM_VALIDATE_VECTOR (4,vec2
);
366 SCM_VALIDATE_INUM_COPY (5,start2
,j
);
367 SCM_ASSERT (i
<= SCM_LENGTH (vec1
) && i
>= 0, start1
, SCM_OUTOFRANGE
, FUNC_NAME
);
368 SCM_ASSERT (j
<= SCM_LENGTH (vec2
) && j
>= 0, start2
, SCM_OUTOFRANGE
, FUNC_NAME
);
369 SCM_ASSERT (e
<= SCM_LENGTH (vec1
) && e
>= 0, end1
, SCM_OUTOFRANGE
, FUNC_NAME
);
371 SCM_ASSERT (j
<= SCM_LENGTH (vec2
), start2
, SCM_OUTOFRANGE
, FUNC_NAME
);
373 SCM_VELTS (vec2
)[--j
] = SCM_VELTS (vec1
)[--e
];
374 return SCM_UNSPECIFIED
;
385 scm_make_subr (s_resizuve, scm_tc7_subr_2, scm_vector_set_length_x); */