Commit | Line | Data |
---|---|---|
22a52da1 | 1 | /* Copyright (C) 1995,1996,1998,1999,2000,2001 Free Software Foundation, Inc. |
0f2d19dd JB |
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 | |
82892bed JB |
15 | * the Free Software Foundation, Inc., 59 Temple Place, Suite 330, |
16 | * Boston, MA 02111-1307 USA | |
0f2d19dd JB |
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. | |
82892bed | 40 | * If you do not wish that, delete this exception notice. */ |
1bbd0b84 | 41 | |
1bbd0b84 | 42 | |
0f2d19dd JB |
43 | \f |
44 | ||
a0599745 MD |
45 | #include "libguile/_scm.h" |
46 | #include "libguile/eq.h" | |
47 | #include "libguile/root.h" | |
48 | #include "libguile/strings.h" | |
c96d76b8 | 49 | #include "libguile/lang.h" |
a0599745 MD |
50 | |
51 | #include "libguile/validate.h" | |
52 | #include "libguile/vectors.h" | |
53 | #include "libguile/unif.h" | |
0f2d19dd JB |
54 | \f |
55 | ||
a1ec6916 | 56 | SCM_DEFINE (scm_vector_p, "vector?", 1, 0, 0, |
5ffe9968 | 57 | (SCM obj), |
1e6808ea MG |
58 | "Return @code{#t} if @var{obj} is a vector, otherwise return\n" |
59 | "@code{#f}.") | |
1bbd0b84 | 60 | #define FUNC_NAME s_scm_vector_p |
0f2d19dd | 61 | { |
5ffe9968 | 62 | return SCM_BOOL (SCM_VECTORP (obj)); |
0f2d19dd | 63 | } |
1bbd0b84 | 64 | #undef FUNC_NAME |
0f2d19dd | 65 | |
f172c0b7 | 66 | SCM_GPROC (s_vector_length, "vector-length", 1, 0, 0, scm_vector_length, g_vector_length); |
1e6808ea | 67 | /* Returns the number of elements in @var{vector} as an exact integer. */ |
0f2d19dd | 68 | SCM |
f172c0b7 | 69 | scm_vector_length (SCM v) |
0f2d19dd | 70 | { |
f172c0b7 MD |
71 | SCM_GASSERT1 (SCM_VECTORP(v), |
72 | g_vector_length, v, SCM_ARG1, s_vector_length); | |
b5c2579a | 73 | return SCM_MAKINUM (SCM_VECTOR_LENGTH (v)); |
0f2d19dd JB |
74 | } |
75 | ||
f172c0b7 | 76 | SCM_REGISTER_PROC (s_list_to_vector, "list->vector", 1, 0, 0, scm_vector); |
5ffe9968 | 77 | /* |
942e5b91 MG |
78 | "Return a newly created vector initialized to the elements of" |
79 | "the list @var{list}.\n\n" | |
80 | "@lisp\n" | |
81 | "(vector->list '#(dah dah didah)) @result{} (dah dah didah)\n" | |
82 | "(list->vector '(dididit dah)) @result{} #(dididit dah)\n" | |
83 | "@end lisp") | |
5ffe9968 | 84 | */ |
a1ec6916 | 85 | SCM_DEFINE (scm_vector, "vector", 0, 0, 1, |
f172c0b7 | 86 | (SCM l), |
8f85c0c6 NJ |
87 | "@deffnx {Scheme Procedure} list->vector l\n" |
88 | "Return a newly allocated vector composed of the\n" | |
1e6808ea MG |
89 | "given arguments. Analogous to @code{list}.\n" |
90 | "\n" | |
942e5b91 | 91 | "@lisp\n" |
1e6808ea | 92 | "(vector 'a 'b 'c) @result{} #(a b c)\n" |
942e5b91 | 93 | "@end lisp") |
1bbd0b84 | 94 | #define FUNC_NAME s_scm_vector |
0f2d19dd JB |
95 | { |
96 | SCM res; | |
22a52da1 | 97 | SCM *data; |
c014a02e | 98 | long i; |
22a52da1 DH |
99 | |
100 | /* Dirk:FIXME:: In case of multiple threads, the list might get corrupted | |
101 | while the vector is being created. */ | |
102 | SCM_VALIDATE_LIST_COPYLEN (1, l, i); | |
00ffa0e7 | 103 | res = scm_c_make_vector (i, SCM_UNSPECIFIED); |
34d19ef6 HWN |
104 | |
105 | /* | |
106 | this code doesn't alloc. -- accessing RES is safe. | |
107 | */ | |
108 | data = SCM_WRITABLE_VELTS (res); | |
c96d76b8 | 109 | while (!SCM_NULL_OR_NIL_P (l)) |
22a52da1 DH |
110 | { |
111 | *data++ = SCM_CAR (l); | |
112 | l = SCM_CDR (l); | |
113 | } | |
114 | ||
0f2d19dd JB |
115 | return res; |
116 | } | |
1bbd0b84 | 117 | #undef FUNC_NAME |
0f2d19dd | 118 | |
f172c0b7 | 119 | SCM_GPROC (s_vector_ref, "vector-ref", 2, 0, 0, scm_vector_ref, g_vector_ref); |
1cc91f1b | 120 | |
5ffe9968 GB |
121 | /* |
122 | "@var{k} must be a valid index of @var{vector}.\n" | |
123 | "@samp{Vector-ref} returns the contents of element @var{k} of\n" | |
124 | "@var{vector}.\n\n" | |
942e5b91 MG |
125 | "@lisp\n" |
126 | "(vector-ref '#(1 1 2 3 5 8 13 21) 5) @result{} 8\n" | |
5ffe9968 GB |
127 | "(vector-ref '#(1 1 2 3 5 8 13 21)\n" |
128 | " (let ((i (round (* 2 (acos -1)))))\n" | |
129 | " (if (inexact? i)\n" | |
130 | " (inexact->exact i)\n" | |
942e5b91 MG |
131 | " i))) @result{} 13\n" |
132 | "@end lisp" | |
5ffe9968 GB |
133 | */ |
134 | ||
0f2d19dd | 135 | SCM |
ea633082 | 136 | scm_vector_ref (SCM v, SCM k) |
685c0d71 | 137 | #define FUNC_NAME s_vector_ref |
0f2d19dd | 138 | { |
0c95b57d | 139 | SCM_GASSERT2 (SCM_VECTORP (v), |
9eb8500a MD |
140 | g_vector_ref, v, k, SCM_ARG1, s_vector_ref); |
141 | SCM_GASSERT2 (SCM_INUMP (k), | |
142 | g_vector_ref, v, k, SCM_ARG2, s_vector_ref); | |
b5c2579a | 143 | SCM_ASSERT_RANGE (2, k, SCM_INUM (k) < SCM_VECTOR_LENGTH (v) && SCM_INUM (k) >= 0); |
c014a02e | 144 | return SCM_VELTS (v)[(long) SCM_INUM (k)]; |
0f2d19dd | 145 | } |
685c0d71 | 146 | #undef FUNC_NAME |
0f2d19dd | 147 | |
f172c0b7 | 148 | SCM_GPROC (s_vector_set_x, "vector-set!", 3, 0, 0, scm_vector_set_x, g_vector_set_x); |
1cc91f1b | 149 | |
942e5b91 MG |
150 | /* "@var{k} must be a valid index of @var{vector}.\n" |
151 | "@code{Vector-set!} stores @var{obj} in element @var{k} of @var{vector}.\n" | |
152 | "The value returned by @samp{vector-set!} is unspecified.\n" | |
153 | "@lisp\n" | |
154 | "(let ((vec (vector 0 '(2 2 2 2) "Anna")))\n" | |
155 | " (vector-set! vec 1 '("Sue" "Sue"))\n" | |
156 | " vec) @result{} #(0 ("Sue" "Sue") "Anna")\n" | |
157 | "(vector-set! '#(0 1 2) 1 "doe") @result{} @emph{error} ; constant vector\n" | |
158 | "@end lisp" | |
5ffe9968 GB |
159 | */ |
160 | ||
0f2d19dd | 161 | SCM |
f172c0b7 | 162 | scm_vector_set_x (SCM v, SCM k, SCM obj) |
685c0d71 | 163 | #define FUNC_NAME s_vector_set_x |
0f2d19dd | 164 | { |
f172c0b7 | 165 | SCM_GASSERTn (SCM_VECTORP (v), |
1afff620 | 166 | g_vector_set_x, scm_list_3 (v, k, obj), |
9eb8500a | 167 | SCM_ARG1, s_vector_set_x); |
f172c0b7 | 168 | SCM_GASSERTn (SCM_INUMP (k), |
1afff620 | 169 | g_vector_set_x, scm_list_3 (v, k, obj), |
9eb8500a | 170 | SCM_ARG2, s_vector_set_x); |
b5c2579a | 171 | SCM_ASSERT_RANGE (2, k, SCM_INUM (k) < SCM_VECTOR_LENGTH (v) && SCM_INUM (k) >= 0); |
34d19ef6 | 172 | SCM_VECTOR_SET (v, (long) SCM_INUM(k), obj); |
60c497a3 | 173 | return SCM_UNSPECIFIED; |
0f2d19dd | 174 | } |
685c0d71 | 175 | #undef FUNC_NAME |
0f2d19dd JB |
176 | |
177 | ||
a1ec6916 | 178 | SCM_DEFINE (scm_make_vector, "make-vector", 1, 1, 0, |
1bbd0b84 | 179 | (SCM k, SCM fill), |
1e6808ea | 180 | "Return a newly allocated vector of @var{k} elements. If a\n" |
8f85c0c6 NJ |
181 | "second argument is given, then each position is initialized to\n" |
182 | "@var{fill}. Otherwise the initial contents of each position is\n" | |
1e6808ea | 183 | "unspecified.") |
1bbd0b84 | 184 | #define FUNC_NAME s_scm_make_vector |
0f2d19dd | 185 | { |
1b9be268 | 186 | if (SCM_UNBNDP (fill)) |
d60cebe2 | 187 | fill = SCM_UNSPECIFIED; |
e382fdbe DH |
188 | |
189 | if (SCM_INUMP (k)) | |
190 | { | |
cb0d8be2 | 191 | SCM_ASSERT_RANGE (1, k, SCM_INUM (k) >= 0); |
e382fdbe DH |
192 | return scm_c_make_vector (SCM_INUM (k), fill); |
193 | } | |
194 | else if (SCM_BIGP (k)) | |
195 | SCM_OUT_OF_RANGE (1, k); | |
196 | else | |
197 | SCM_WRONG_TYPE_ARG (1, k); | |
00ffa0e7 KN |
198 | } |
199 | #undef FUNC_NAME | |
200 | ||
e382fdbe | 201 | |
00ffa0e7 | 202 | SCM |
c014a02e | 203 | scm_c_make_vector (unsigned long int k, SCM fill) |
00ffa0e7 KN |
204 | #define FUNC_NAME s_scm_make_vector |
205 | { | |
206 | SCM v; | |
92c2555f | 207 | scm_t_bits *base; |
1b9be268 | 208 | |
e382fdbe DH |
209 | if (k > 0) |
210 | { | |
c014a02e | 211 | unsigned long int j; |
1b9be268 | 212 | |
c014a02e | 213 | SCM_ASSERT_RANGE (1, scm_ulong2num (k), k <= SCM_VECTOR_MAX_LENGTH); |
1b9be268 | 214 | |
4c9419ac | 215 | base = scm_gc_malloc (k * sizeof (scm_t_bits), "vector"); |
e382fdbe DH |
216 | for (j = 0; j != k; ++j) |
217 | base[j] = SCM_UNPACK (fill); | |
218 | } | |
219 | else | |
220 | base = NULL; | |
1b9be268 | 221 | |
228a24ef | 222 | v = scm_cell (SCM_MAKE_VECTOR_TAG (k, scm_tc7_vector), (scm_t_bits) base); |
e382fdbe | 223 | scm_remember_upto_here_1 (fill); |
1b9be268 | 224 | |
0f2d19dd JB |
225 | return v; |
226 | } | |
1bbd0b84 | 227 | #undef FUNC_NAME |
0f2d19dd | 228 | |
e382fdbe | 229 | |
3b3b36dd | 230 | SCM_DEFINE (scm_vector_to_list, "vector->list", 1, 0, 0, |
1e6808ea | 231 | (SCM v), |
8f85c0c6 | 232 | "Return a newly allocated list composed of the elements of @var{v}.\n" |
1e6808ea | 233 | "\n" |
942e5b91 MG |
234 | "@lisp\n" |
235 | "(vector->list '#(dah dah didah)) @result{} (dah dah didah)\n" | |
236 | "(list->vector '(dididit dah)) @result{} #(dididit dah)\n" | |
237 | "@end lisp") | |
1bbd0b84 | 238 | #define FUNC_NAME s_scm_vector_to_list |
0f2d19dd JB |
239 | { |
240 | SCM res = SCM_EOL; | |
c014a02e | 241 | long i; |
34d19ef6 HWN |
242 | SCM const *data; |
243 | SCM_VALIDATE_VECTOR (1, v); | |
0f2d19dd | 244 | data = SCM_VELTS(v); |
b5c2579a | 245 | for(i = SCM_VECTOR_LENGTH(v)-1;i >= 0;i--) res = scm_cons(data[i], res); |
0f2d19dd JB |
246 | return res; |
247 | } | |
1bbd0b84 | 248 | #undef FUNC_NAME |
0f2d19dd JB |
249 | |
250 | ||
a1ec6916 | 251 | SCM_DEFINE (scm_vector_fill_x, "vector-fill!", 2, 0, 0, |
1e6808ea | 252 | (SCM v, SCM fill), |
8f85c0c6 | 253 | "Store @var{fill} in every position of @var{vector}. The value\n" |
1e6808ea | 254 | "returned by @code{vector-fill!} is unspecified.") |
1bbd0b84 | 255 | #define FUNC_NAME s_scm_vector_fill_x |
0f2d19dd | 256 | { |
c014a02e | 257 | register long i; |
1be6b49c | 258 | SCM_VALIDATE_VECTOR (1, v); |
34d19ef6 | 259 | |
1be6b49c | 260 | for(i = SCM_VECTOR_LENGTH (v) - 1; i >= 0; i--) |
34d19ef6 | 261 | SCM_VECTOR_SET(v, i, fill); |
0f2d19dd JB |
262 | return SCM_UNSPECIFIED; |
263 | } | |
1bbd0b84 | 264 | #undef FUNC_NAME |
0f2d19dd JB |
265 | |
266 | ||
0f2d19dd | 267 | SCM |
1bbd0b84 | 268 | scm_vector_equal_p(SCM x, SCM y) |
0f2d19dd | 269 | { |
c014a02e | 270 | long i; |
1be6b49c ML |
271 | for(i = SCM_VECTOR_LENGTH (x) - 1; i >= 0; i--) |
272 | if (SCM_FALSEP (scm_equal_p (SCM_VELTS (x)[i], SCM_VELTS (y)[i]))) | |
0f2d19dd JB |
273 | return SCM_BOOL_F; |
274 | return SCM_BOOL_T; | |
275 | } | |
276 | ||
277 | ||
a1ec6916 | 278 | SCM_DEFINE (scm_vector_move_left_x, "vector-move-left!", 5, 0, 0, |
1bbd0b84 | 279 | (SCM vec1, SCM start1, SCM end1, SCM vec2, SCM start2), |
694a9bb3 NJ |
280 | "Copy elements from @var{vec1}, positions @var{start1} to @var{end1},\n" |
281 | "to @var{vec2} starting at position @var{start2}. @var{start1} and\n" | |
282 | "@var{start2} are inclusive indices; @var{end1} is exclusive.\n\n" | |
283 | "@code{vector-move-left!} copies elements in leftmost order.\n" | |
284 | "Therefore, in the case where @var{vec1} and @var{vec2} refer to the\n" | |
285 | "same vector, @code{vector-move-left!} is usually appropriate when\n" | |
286 | "@var{start1} is greater than @var{start2}.") | |
1bbd0b84 | 287 | #define FUNC_NAME s_scm_vector_move_left_x |
0f2d19dd | 288 | { |
c014a02e ML |
289 | long i; |
290 | long j; | |
291 | long e; | |
0f2d19dd | 292 | |
34d19ef6 HWN |
293 | SCM_VALIDATE_VECTOR (1, vec1); |
294 | SCM_VALIDATE_INUM_COPY (2, start1, i); | |
295 | SCM_VALIDATE_INUM_COPY (3, end1, e); | |
296 | SCM_VALIDATE_VECTOR (4, vec2); | |
297 | SCM_VALIDATE_INUM_COPY (5, start2, j); | |
b5c2579a DH |
298 | SCM_ASSERT_RANGE (2, start1, i <= SCM_VECTOR_LENGTH (vec1) && i >= 0); |
299 | SCM_ASSERT_RANGE (5, start2, j <= SCM_VECTOR_LENGTH (vec2) && j >= 0); | |
300 | SCM_ASSERT_RANGE (3, end1, e <= SCM_VECTOR_LENGTH (vec1) && e >= 0); | |
301 | SCM_ASSERT_RANGE (5, start2, e-i+j <= SCM_VECTOR_LENGTH (vec2)); | |
34d19ef6 HWN |
302 | |
303 | while (i<e) | |
1d1559ce HWN |
304 | { |
305 | SCM_VECTOR_SET (vec2, j, SCM_VELTS (vec1)[i]); | |
306 | i++; | |
307 | j++; | |
308 | } | |
34d19ef6 | 309 | |
0f2d19dd JB |
310 | return SCM_UNSPECIFIED; |
311 | } | |
1bbd0b84 | 312 | #undef FUNC_NAME |
0f2d19dd | 313 | |
a1ec6916 | 314 | SCM_DEFINE (scm_vector_move_right_x, "vector-move-right!", 5, 0, 0, |
1bbd0b84 | 315 | (SCM vec1, SCM start1, SCM end1, SCM vec2, SCM start2), |
694a9bb3 NJ |
316 | "Copy elements from @var{vec1}, positions @var{start1} to @var{end1},\n" |
317 | "to @var{vec2} starting at position @var{start2}. @var{start1} and\n" | |
318 | "@var{start2} are inclusive indices; @var{end1} is exclusive.\n\n" | |
319 | "@code{vector-move-right!} copies elements in rightmost order.\n" | |
320 | "Therefore, in the case where @var{vec1} and @var{vec2} refer to the\n" | |
321 | "same vector, @code{vector-move-right!} is usually appropriate when\n" | |
322 | "@var{start1} is less than @var{start2}.") | |
1bbd0b84 | 323 | #define FUNC_NAME s_scm_vector_move_right_x |
0f2d19dd | 324 | { |
c014a02e ML |
325 | long i; |
326 | long j; | |
327 | long e; | |
0f2d19dd | 328 | |
34d19ef6 HWN |
329 | SCM_VALIDATE_VECTOR (1, vec1); |
330 | SCM_VALIDATE_INUM_COPY (2, start1, i); | |
331 | SCM_VALIDATE_INUM_COPY (3, end1, e); | |
332 | SCM_VALIDATE_VECTOR (4, vec2); | |
333 | SCM_VALIDATE_INUM_COPY (5, start2, j); | |
b5c2579a DH |
334 | SCM_ASSERT_RANGE (2, start1, i <= SCM_VECTOR_LENGTH (vec1) && i >= 0); |
335 | SCM_ASSERT_RANGE (5, start2, j <= SCM_VECTOR_LENGTH (vec2) && j >= 0); | |
336 | SCM_ASSERT_RANGE (3, end1, e <= SCM_VECTOR_LENGTH (vec1) && e >= 0); | |
2cc41672 | 337 | j = e - i + j; |
b5c2579a | 338 | SCM_ASSERT_RANGE (5, start2, j <= SCM_VECTOR_LENGTH (vec2)); |
2cc41672 | 339 | while (i < e) |
1d1559ce HWN |
340 | { |
341 | j--; | |
342 | e--; | |
343 | SCM_VECTOR_SET (vec2, j, SCM_VELTS (vec1)[e]); | |
344 | } | |
345 | ||
0f2d19dd JB |
346 | return SCM_UNSPECIFIED; |
347 | } | |
1bbd0b84 | 348 | #undef FUNC_NAME |
0f2d19dd JB |
349 | |
350 | ||
1cc91f1b | 351 | |
0f2d19dd JB |
352 | void |
353 | scm_init_vectors () | |
0f2d19dd | 354 | { |
7c33806a DH |
355 | scm_nullvect = scm_c_make_vector (0, SCM_UNDEFINED); |
356 | ||
a0599745 | 357 | #include "libguile/vectors.x" |
0f2d19dd JB |
358 | } |
359 | ||
89e00824 ML |
360 | |
361 | /* | |
362 | Local Variables: | |
363 | c-file-style: "gnu" | |
364 | End: | |
365 | */ |